{"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0053369035,0.00008323228,0.98860127,0.00012868296,0.000106068896,0.000086430344,0.00012382772,0.00055627484,0.004977246],"genre_scores_gemma":[0.12052682,0.00022816534,0.8692286,0.00021126069,0.000045395987,0.0006206441,0.00034159783,0.00032526866,0.008472275],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998116,0.000046639616,0.000009077738,0.00002116434,0.00009371046,0.000017857754],"domain_scores_gemma":[0.9997167,0.00012132964,0.000024156114,0.000030613195,0.000075350305,0.000031866435],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046617855,0.000456434,0.00044002093,0.00047762046,0.0006336262,0.0006063655,0.0012474766,0.0010185718,0.004187138],"category_scores_gemma":[0.0010501547,0.00033311962,0.0009102993,0.00039042553,0.0004720049,0.0006300378,0.0009770725,0.00066590344,0.001008798],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032218555,0.00006142334,0.0009791381,0.00012547139,0.00003159593,0.00015303622,0.00012858535,0.8914633,0.006685129,0.0414338,0.0039315796,0.05497476],"study_design_scores_gemma":[0.000008039176,0.000008212139,0.000035534224,0.00000562711,0.000002111952,0.000021359394,0.00000403131,0.9935474,0.0006324148,0.0014138847,0.0043149698,0.0000063954803],"about_ca_topic_score_codex":0.0042152195,"about_ca_topic_score_gemma":0.0040435256,"teacher_disagreement_score":0.0042152195,"about_ca_system_score_codex":0.00048911804,"about_ca_system_score_gemma":0.0012704518,"threshold_uncertainty_score":0.01400739},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045757893,0.00019683546,0.93518037,0.00024834328,0.00014391962,0.00011587659,0.00032086085,0.0013731001,0.016662847],"genre_scores_gemma":[0.38505322,0.0004919021,0.588257,0.000102627775,0.00009671045,0.0002122461,0.001053659,0.0010265533,0.02370612],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99904853,0.00010916423,0.000045450342,0.00016789524,0.00049393246,0.0001350326],"domain_scores_gemma":[0.9988539,0.00048243543,0.00006516447,0.00036561402,0.0001578939,0.00007500292],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048015465,0.0009537671,0.000981085,0.0014227871,0.0008679173,0.0018857394,0.0013525371,0.0006416016,0.015716597],"category_scores_gemma":[0.0029470187,0.0004568075,0.0007231302,0.0019087429,0.0012306941,0.0029910535,0.0031988292,0.0021238208,0.0024176305],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035618694,0.00013989807,0.0004241673,0.00026363504,0.000029477938,0.00010936111,0.00035263738,0.041189376,0.016718814,0.52358973,0.009644374,0.40718234],"study_design_scores_gemma":[0.00009196457,0.00014441839,0.00035819376,0.000046170513,0.00002914794,0.00016377815,0.00022523341,0.22437367,0.017337529,0.72716546,0.03003567,0.000028690049],"about_ca_topic_score_codex":0.0010873983,"about_ca_topic_score_gemma":0.0016926482,"teacher_disagreement_score":0.015716597,"about_ca_system_score_codex":0.000741953,"about_ca_system_score_gemma":0.00074104394,"threshold_uncertainty_score":0.052577198},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.071988255,0.000864415,0.8315664,0.000379493,0.0004524168,0.00028093558,0.002943266,0.002653955,0.0888708],"genre_scores_gemma":[0.48974746,0.0011476316,0.4505206,0.00021577622,0.00005104158,0.00014148299,0.0047898083,0.0011582838,0.052227926],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995427,0.00006608614,0.00005536822,0.00010174009,0.00015399184,0.00008016016],"domain_scores_gemma":[0.99897814,0.00024861158,0.00009389739,0.0002623531,0.0003099428,0.00010715016],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029589335,0.00053494086,0.0007195227,0.000764213,0.0006439427,0.0017643605,0.0013195989,0.00066342286,0.01480384],"category_scores_gemma":[0.0029206143,0.00052702107,0.000873428,0.0011129403,0.00089114375,0.0018755409,0.0022445172,0.0008851185,0.008826618],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013439842,0.00017600475,0.0045961533,0.0011397888,0.00009520231,0.0016333534,0.0007062859,0.14114092,0.020953322,0.33593607,0.04745244,0.44482648],"study_design_scores_gemma":[0.00013204059,0.00027092578,0.001998739,0.00028675044,0.00007311331,0.003122183,0.0009877426,0.4524099,0.027720407,0.2993266,0.21357553,0.00009609785],"about_ca_topic_score_codex":0.0016350945,"about_ca_topic_score_gemma":0.002552335,"teacher_disagreement_score":0.01480384,"about_ca_system_score_codex":0.0003598178,"about_ca_system_score_gemma":0.0006282272,"threshold_uncertainty_score":0.04952371},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.685274,0.0020584455,0.22809324,0.00083292107,0.00021699096,0.00009105977,0.0012033499,0.0011539045,0.08107612],"genre_scores_gemma":[0.9780247,0.00056886557,0.016952096,0.000100671925,0.00012385432,0.00005689575,0.00034891252,0.0001587978,0.0036651832],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992906,0.00008671063,0.000027010434,0.00022338697,0.00020020861,0.00017202435],"domain_scores_gemma":[0.9972209,0.0011122155,0.00046693237,0.0004007742,0.00037521898,0.00042395078],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073157693,0.0005904467,0.0005756447,0.002091586,0.00065769407,0.0010833157,0.0009105496,0.00054951926,0.006807848],"category_scores_gemma":[0.00434199,0.0002934688,0.00067452504,0.000892014,0.0017287066,0.0022911832,0.0011441855,0.0011138943,0.0006292663],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033518177,0.00008259803,0.008553622,0.00034747354,0.00006105098,0.00047551104,0.0004946169,0.031272452,0.059982676,0.83985394,0.0071708914,0.051370017],"study_design_scores_gemma":[0.00005075774,0.00037427997,0.021645056,0.00009112298,0.00007570046,0.0041325297,0.0004110532,0.20176908,0.0339431,0.714771,0.022609355,0.00012695178],"about_ca_topic_score_codex":0.000555927,"about_ca_topic_score_gemma":0.00049299817,"teacher_disagreement_score":0.006807848,"about_ca_system_score_codex":0.0010438741,"about_ca_system_score_gemma":0.00028080147,"threshold_uncertainty_score":0.022774458},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17242996,0.0011051138,0.7874965,0.000828328,0.00009479092,0.00017437247,0.0018421742,0.0009066729,0.035122134],"genre_scores_gemma":[0.57345396,0.0013108344,0.40560022,0.00030933024,0.00008778526,0.00024812832,0.0043677795,0.00024831772,0.014373649],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99945587,0.00010138248,0.000032789943,0.00012607702,0.0001638239,0.000120120574],"domain_scores_gemma":[0.9981504,0.00067572563,0.00023429,0.0003628803,0.0003700597,0.00020660803],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005503758,0.00064521737,0.0004711741,0.0010299128,0.0008820258,0.0011194369,0.0013114224,0.0006576913,0.0056521553],"category_scores_gemma":[0.0042762365,0.00039781828,0.00032069304,0.0016403635,0.00050755066,0.002366921,0.0017769287,0.0008328953,0.0014991823],"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.0008463296,0.00021087234,0.0053864187,0.00081562414,0.00015330319,0.0005275357,0.00065125,0.2625484,0.055070456,0.37263772,0.028063418,0.27308863],"study_design_scores_gemma":[0.000118019605,0.00020545056,0.0030796698,0.00009024307,0.000090931004,0.0007347507,0.00038730475,0.5052764,0.009822257,0.4442127,0.035933565,0.000048699574],"about_ca_topic_score_codex":0.0012448231,"about_ca_topic_score_gemma":0.003119282,"teacher_disagreement_score":0.0056521553,"about_ca_system_score_codex":0.00067642215,"about_ca_system_score_gemma":0.0005493959,"threshold_uncertainty_score":0.018908381},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46356395,0.0005590179,0.38192216,0.0014491346,0.0007496322,0.00030464967,0.0085380925,0.0015986579,0.14131467],"genre_scores_gemma":[0.7553085,0.00046681368,0.16328561,0.00034426723,0.00013595835,0.00021700676,0.0090957,0.00044704066,0.07069914],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99967575,0.000049443046,0.000023188144,0.00008901768,0.0000880061,0.00007467029],"domain_scores_gemma":[0.99943835,0.00009435546,0.00008779376,0.0001482985,0.00012667042,0.0001045196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017635309,0.00039110205,0.00050945143,0.0018207185,0.0013577583,0.0013964343,0.000797737,0.000743957,0.01645279],"category_scores_gemma":[0.0009596802,0.00031894076,0.0006068144,0.0010779825,0.0010570815,0.0010064567,0.0014666651,0.0009818714,0.004403795],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00049883197,0.00015618246,0.0055594807,0.00045190845,0.0001267544,0.0017053797,0.0009990555,0.0110202925,0.040765036,0.8131732,0.028095903,0.09744795],"study_design_scores_gemma":[0.000108794535,0.00026438397,0.014005078,0.00019681067,0.00016865025,0.005575457,0.0021959262,0.04463724,0.035110887,0.7376257,0.15997857,0.00013245555],"about_ca_topic_score_codex":0.0016089397,"about_ca_topic_score_gemma":0.0027794377,"teacher_disagreement_score":0.01645279,"about_ca_system_score_codex":0.00060667616,"about_ca_system_score_gemma":0.00049318525,"threshold_uncertainty_score":0.05504006},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.121797726,0.00080573885,0.8230004,0.00056923,0.0005228662,0.00024665848,0.00065846706,0.002528582,0.04987031],"genre_scores_gemma":[0.36438036,0.0009202524,0.60032445,0.00019146327,0.00012326152,0.00012649556,0.001496028,0.00082301866,0.031614628],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986677,0.0003490832,0.00010502661,0.00032270263,0.00037543778,0.00018003157],"domain_scores_gemma":[0.99642545,0.0013818587,0.00037427843,0.0011034678,0.00038896943,0.0003259142],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009971447,0.00087514,0.0006531763,0.002131661,0.0015297543,0.002269893,0.0019631016,0.0016117232,0.011807788],"category_scores_gemma":[0.0075385845,0.00088579895,0.000989699,0.0025561166,0.0017293394,0.0034870529,0.002531651,0.0019049194,0.0029980382],"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.0003554021,0.00020148761,0.002918778,0.00042692243,0.00006643228,0.0010823581,0.000918977,0.049700413,0.01883905,0.56025153,0.018733101,0.34650552],"study_design_scores_gemma":[0.00008337839,0.0001703908,0.0013749771,0.00021611166,0.000137703,0.0016382395,0.0007351787,0.12818289,0.02947868,0.7641542,0.07374482,0.00008342389],"about_ca_topic_score_codex":0.00096004456,"about_ca_topic_score_gemma":0.0022490444,"teacher_disagreement_score":0.011807788,"about_ca_system_score_codex":0.0006936524,"about_ca_system_score_gemma":0.00051026203,"threshold_uncertainty_score":0.03950101},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.060437262,0.00014006527,0.92892,0.00011291242,0.000024586334,0.00005983936,0.00024397549,0.0011758773,0.008885503],"genre_scores_gemma":[0.39861217,0.00019209989,0.59685236,0.00006662712,0.000025410525,0.0001118333,0.0009170859,0.00041604522,0.0028064342],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99955946,0.000039025184,0.000019432007,0.000074413314,0.00024894348,0.0000587568],"domain_scores_gemma":[0.9993382,0.00025162587,0.00006317272,0.00014742225,0.00014234998,0.000057252677],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031708984,0.00044925674,0.00068336463,0.00093753875,0.0008526853,0.001882804,0.0010972217,0.0011556653,0.0032677427],"category_scores_gemma":[0.002145742,0.00039911323,0.00048501595,0.00075377006,0.0012150534,0.0023162453,0.0015219316,0.0011522537,0.00089631096],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037906182,0.00011872838,0.0040739467,0.00036064794,0.000030844425,0.0008767962,0.0005854553,0.2368346,0.062378865,0.34095898,0.006210685,0.34719136],"study_design_scores_gemma":[0.000020442503,0.000051761643,0.00065004843,0.000049500326,0.000009580925,0.00047784328,0.00014883566,0.83832175,0.024008114,0.12463071,0.011607828,0.000023597062],"about_ca_topic_score_codex":0.0010898723,"about_ca_topic_score_gemma":0.0012395338,"teacher_disagreement_score":0.0032677427,"about_ca_system_score_codex":0.000618378,"about_ca_system_score_gemma":0.0005446697,"threshold_uncertainty_score":0.010931671},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013588949,0.00023835622,0.9896515,0.000041623316,0.0000871562,0.000025133466,0.000050199884,0.00023453176,0.00831251],"genre_scores_gemma":[0.048337396,0.00063822727,0.9376974,0.00006301504,0.00009440176,0.00015577555,0.00025212098,0.0009864968,0.011775202],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991722,0.0002089099,0.00003545818,0.00011367337,0.000410786,0.000058955364],"domain_scores_gemma":[0.999342,0.00031946565,0.000030608055,0.00013235793,0.00012716194,0.000048455193],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011444826,0.001455672,0.0017915724,0.0016790177,0.00055349566,0.0028768335,0.0019130026,0.0012295077,0.0143467095],"category_scores_gemma":[0.0033201203,0.0012961476,0.0014266452,0.0017769389,0.0011581541,0.0020957761,0.0038279896,0.004974482,0.004222072],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018856094,0.00011955137,0.00019463984,0.0005399405,0.00009373149,0.00008837319,0.00015583873,0.15654074,0.0062006908,0.4598737,0.014733783,0.3612705],"study_design_scores_gemma":[0.0000409593,0.00004323706,0.000075928576,0.00009651086,0.000035745925,0.00015844354,0.000041062514,0.69707364,0.003232464,0.2775074,0.021671355,0.00002329079],"about_ca_topic_score_codex":0.00074267626,"about_ca_topic_score_gemma":0.0008940119,"teacher_disagreement_score":0.0143467095,"about_ca_system_score_codex":0.0007601333,"about_ca_system_score_gemma":0.00068113935,"threshold_uncertainty_score":0.047994554},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.068245776,0.00029475184,0.8970157,0.00014432838,0.00007225754,0.00035288717,0.0008566719,0.0029454716,0.03007231],"genre_scores_gemma":[0.33217862,0.0004618647,0.65372425,0.00008180979,0.000031836884,0.00040360444,0.0019792977,0.00057024974,0.010568479],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993748,0.00011604507,0.000028267206,0.0001292271,0.00027464554,0.00007706633],"domain_scores_gemma":[0.99891293,0.0003356671,0.00012739278,0.00030330563,0.00021936871,0.00010135021],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037870483,0.00077699166,0.0004034746,0.0013678292,0.0005615162,0.0010328739,0.00126079,0.00065142184,0.01167737],"category_scores_gemma":[0.0031725967,0.0006687243,0.0006378693,0.0016865556,0.0006093947,0.0017278806,0.0012395249,0.0008230743,0.0013878867],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038198117,0.00023741196,0.0054884665,0.00042484447,0.00012070194,0.0011386427,0.0012465855,0.14263298,0.057589497,0.20343564,0.029370554,0.5579326],"study_design_scores_gemma":[0.00017538959,0.00032252408,0.004949689,0.00019201373,0.00010318778,0.002153788,0.0007497451,0.53362876,0.04540807,0.17490964,0.23729342,0.00011376784],"about_ca_topic_score_codex":0.0022263327,"about_ca_topic_score_gemma":0.0041109016,"teacher_disagreement_score":0.01167737,"about_ca_system_score_codex":0.0008705686,"about_ca_system_score_gemma":0.00038812475,"threshold_uncertainty_score":0.039064765},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008478205,0.0034070897,0.9237989,0.00087987096,0.0006691963,0.00019068873,0.0012815596,0.006000159,0.055294354],"genre_scores_gemma":[0.2131677,0.007725921,0.73135144,0.0009706194,0.0005692647,0.00038770607,0.0044051376,0.003499479,0.037922792],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99919707,0.0001408912,0.000040947867,0.00020227418,0.0003570891,0.00006167802],"domain_scores_gemma":[0.9990006,0.00038497674,0.00009111586,0.00034141983,0.00012000278,0.000061840095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005452764,0.0011665002,0.0005456164,0.0019491517,0.0006437181,0.0016816261,0.0011958224,0.0010746266,0.026527725],"category_scores_gemma":[0.00454315,0.0008071994,0.0011341842,0.0018172874,0.0013759446,0.0040560807,0.002872046,0.0020369426,0.0060556764],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008530281,0.000034418346,0.0005359303,0.0005481204,0.00003390488,0.00029983808,0.0005378937,0.018473078,0.007164338,0.5317729,0.04631355,0.39420074],"study_design_scores_gemma":[0.000037434824,0.000046035693,0.00043524723,0.00015849127,0.00003861886,0.0013413809,0.00021030026,0.05645799,0.00609773,0.6393802,0.29574537,0.000051213523],"about_ca_topic_score_codex":0.0008367455,"about_ca_topic_score_gemma":0.0012166887,"teacher_disagreement_score":0.026527725,"about_ca_system_score_codex":0.000702401,"about_ca_system_score_gemma":0.00036283938,"threshold_uncertainty_score":0.088744104},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08579202,0.00036709115,0.8907838,0.00021676006,0.00014190345,0.0001219779,0.00035290862,0.0007429036,0.02148063],"genre_scores_gemma":[0.52382123,0.00088869093,0.4389053,0.00018146636,0.00019663207,0.00020966878,0.0015800878,0.00073988613,0.03347702],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999106,0.00010845604,0.000053869557,0.00028050318,0.00029097675,0.00016023063],"domain_scores_gemma":[0.9978198,0.0010493058,0.00020870635,0.0005967212,0.00014878872,0.00017663774],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008432211,0.0014128139,0.001868753,0.0010720361,0.0008542341,0.0023147264,0.0025573643,0.001763489,0.012464793],"category_scores_gemma":[0.004492162,0.0012640848,0.002053948,0.000968182,0.0022267015,0.0044708666,0.0059262887,0.003230357,0.0015614205],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00075684045,0.00027206607,0.0017957869,0.0005898851,0.000118130134,0.00023767553,0.00069157395,0.31945854,0.01548148,0.3518144,0.014054339,0.29472938],"study_design_scores_gemma":[0.000057437803,0.00019576169,0.00069808535,0.00007285088,0.000044603617,0.00020795384,0.00021513242,0.71212935,0.0041992655,0.27651805,0.005620589,0.000040954008],"about_ca_topic_score_codex":0.0018723843,"about_ca_topic_score_gemma":0.0020630732,"teacher_disagreement_score":0.012464793,"about_ca_system_score_codex":0.00053576904,"about_ca_system_score_gemma":0.00067964755,"threshold_uncertainty_score":0.041698873},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26439902,0.00074817246,0.7236467,0.00019168518,0.00009845,0.000080232865,0.00007313427,0.0007514189,0.010011138],"genre_scores_gemma":[0.77885354,0.00028611443,0.21528767,0.00007756416,0.000019981351,0.00007805219,0.00012588057,0.00015568639,0.0051155696],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99973136,0.0000386185,0.000015697671,0.0000723938,0.000082734216,0.000059220194],"domain_scores_gemma":[0.99947685,0.00020283934,0.000091857626,0.00013509783,0.000047191133,0.000046251374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003906027,0.000514016,0.00052094413,0.00036951795,0.00045376518,0.0004697476,0.00078050134,0.0007842331,0.0040177777],"category_scores_gemma":[0.0015149903,0.00036569685,0.00050081254,0.00046661717,0.000710213,0.0012941658,0.00090594275,0.00060090225,0.0005136127],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009552591,0.00029648363,0.0032586448,0.00053185155,0.00011746352,0.0005688391,0.00028323222,0.48201975,0.1872551,0.041784856,0.0025542467,0.28037426],"study_design_scores_gemma":[0.00007220934,0.00067772844,0.0008178326,0.000026045613,0.000047797286,0.0003428691,0.000069413516,0.9197912,0.047610316,0.025864204,0.0046603456,0.000020052976],"about_ca_topic_score_codex":0.00055749924,"about_ca_topic_score_gemma":0.0010143351,"teacher_disagreement_score":0.0040177777,"about_ca_system_score_codex":0.00029562518,"about_ca_system_score_gemma":0.00032277388,"threshold_uncertainty_score":0.013440788},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05139966,0.00036883817,0.937351,0.00015179631,0.000071007154,0.000034431778,0.000105950894,0.0005451719,0.009972241],"genre_scores_gemma":[0.7207799,0.00033083,0.2737489,0.000037398127,0.000039069673,0.000064258114,0.00015614476,0.00038774413,0.004455748],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99929833,0.00011347227,0.000027766715,0.0000815692,0.00040667792,0.00007215599],"domain_scores_gemma":[0.9975712,0.0011738654,0.00012214898,0.00055155257,0.0004970217,0.00008429336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000886515,0.0004940376,0.00089462847,0.0012026334,0.00080537953,0.0012375843,0.0013272706,0.0008223327,0.0061441017],"category_scores_gemma":[0.010924723,0.00056298,0.00042749837,0.001137508,0.0013662194,0.0024597535,0.0019032203,0.00068949914,0.00076160266],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021837908,0.000024388688,0.001317326,0.000230294,0.000029425388,0.00022514824,0.0005100708,0.61030465,0.0031560815,0.22121276,0.0028834273,0.15988806],"study_design_scores_gemma":[0.000015001286,0.000017013148,0.00018919264,0.000014799913,0.0000064854084,0.000070785914,0.000063884465,0.9328473,0.0020283356,0.062388886,0.0023488312,0.00000946268],"about_ca_topic_score_codex":0.002588628,"about_ca_topic_score_gemma":0.0048864908,"teacher_disagreement_score":0.0061441017,"about_ca_system_score_codex":0.0008727504,"about_ca_system_score_gemma":0.00070894003,"threshold_uncertainty_score":0.020554066},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036418833,0.0015331899,0.82747,0.00041554242,0.0005628614,0.00015921601,0.0011312852,0.0018549195,0.13045411],"genre_scores_gemma":[0.46444923,0.0015518845,0.44236124,0.00041647864,0.00024948703,0.0002091747,0.0035685482,0.0018814183,0.08531258],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993042,0.00010737399,0.00005043078,0.00011084729,0.0003447132,0.00008240976],"domain_scores_gemma":[0.9993999,0.00017591305,0.00005621243,0.00017145531,0.00012393256,0.0000725928],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040398593,0.00058484025,0.0006816107,0.0015494087,0.0007972581,0.0024300816,0.0011593599,0.00058640924,0.021418385],"category_scores_gemma":[0.0021229116,0.0004985216,0.00075316185,0.0011901167,0.001200938,0.002655483,0.0036926917,0.0019513791,0.005542797],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008108614,0.000032504824,0.00047586346,0.00021380247,0.00002008727,0.00016977957,0.00027824295,0.007846425,0.004196822,0.86470985,0.0139922695,0.10798329],"study_design_scores_gemma":[0.000037715326,0.000052825908,0.00036198343,0.00012343416,0.000020728035,0.00051722635,0.0002662326,0.048096392,0.0068832384,0.82696027,0.11665377,0.000026131473],"about_ca_topic_score_codex":0.00091320864,"about_ca_topic_score_gemma":0.0017198699,"teacher_disagreement_score":0.021418385,"about_ca_system_score_codex":0.000667427,"about_ca_system_score_gemma":0.00031910135,"threshold_uncertainty_score":0.07165164},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1386703,0.00016881533,0.8567818,0.00015886326,0.00008163111,0.00011767441,0.00026209292,0.0010707269,0.0026881115],"genre_scores_gemma":[0.38063765,0.00014877625,0.61475307,0.000035417484,0.000024905012,0.00012588507,0.0008986794,0.00024699277,0.0031285437],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990839,0.000101349964,0.000053086846,0.00024103522,0.00040342828,0.00011727038],"domain_scores_gemma":[0.9977449,0.0011446167,0.00019540185,0.00026887568,0.00047527344,0.0001709704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005822312,0.00091871124,0.0013252074,0.0024386563,0.0008903552,0.0017686153,0.0014733466,0.0014941301,0.006056242],"category_scores_gemma":[0.0064414674,0.00067246944,0.0009270921,0.0015529911,0.0010304217,0.0031781574,0.0023769757,0.0018837166,0.0008230903],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00080203643,0.00026472707,0.005325287,0.0005165377,0.00015576831,0.000625172,0.00064275484,0.33318803,0.030284647,0.15116715,0.0059188595,0.47110894],"study_design_scores_gemma":[0.0000438441,0.0002106844,0.00096304074,0.000026779617,0.000017723014,0.00017700576,0.00021629695,0.8865829,0.007869594,0.099708974,0.0041422634,0.00004090357],"about_ca_topic_score_codex":0.003930571,"about_ca_topic_score_gemma":0.0041624657,"teacher_disagreement_score":0.006056242,"about_ca_system_score_codex":0.0012057396,"about_ca_system_score_gemma":0.00093078025,"threshold_uncertainty_score":0.020260155},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23046055,0.0027543763,0.5886043,0.0008034565,0.00033718836,0.00019164706,0.0011371743,0.0021058342,0.17360553],"genre_scores_gemma":[0.6129799,0.003539588,0.31335452,0.00027460218,0.00022827975,0.0001826994,0.0020704817,0.0014930977,0.0658768],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99953926,0.00010685899,0.000021188866,0.000087255874,0.0001843323,0.00006116998],"domain_scores_gemma":[0.9989048,0.0005038244,0.000118227115,0.00022622875,0.00013991378,0.00010697832],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035096434,0.0008993239,0.00073611696,0.001267047,0.00067488896,0.0022403435,0.0012769982,0.0008699959,0.015597077],"category_scores_gemma":[0.002133844,0.0009575343,0.0005092732,0.002688172,0.0006112046,0.0024932506,0.0012930626,0.0026327681,0.0027265174],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002459097,0.00011208371,0.0008790424,0.00049779913,0.000035958008,0.00047972274,0.000663905,0.064415485,0.019752879,0.67497647,0.02540342,0.21253741],"study_design_scores_gemma":[0.000085632906,0.000096164964,0.0013741623,0.00009975029,0.00004851747,0.0008773937,0.0002922705,0.15449123,0.006650869,0.78276473,0.053176425,0.00004273676],"about_ca_topic_score_codex":0.000942775,"about_ca_topic_score_gemma":0.0019622694,"teacher_disagreement_score":0.015597077,"about_ca_system_score_codex":0.0006924394,"about_ca_system_score_gemma":0.0002447228,"threshold_uncertainty_score":0.05217743},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16389321,0.00092235685,0.774741,0.0010542802,0.0002633458,0.00041177144,0.002066433,0.007097966,0.049549654],"genre_scores_gemma":[0.49994755,0.00045541162,0.4803363,0.0002312652,0.00008730896,0.00033033118,0.0023589365,0.0012405461,0.015012327],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990845,0.00013654093,0.000057476358,0.00022449146,0.00025184685,0.00024508854],"domain_scores_gemma":[0.9971073,0.0014110986,0.00027013113,0.0007545673,0.00024486354,0.00021192223],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005458858,0.0016086907,0.0011099143,0.0010523681,0.0009375218,0.0014366495,0.0028835614,0.0011113791,0.011096046],"category_scores_gemma":[0.0050534518,0.0005821463,0.0007160908,0.0021878746,0.0006875648,0.0029376377,0.003359288,0.0014244716,0.0023378024],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002473726,0.0006506498,0.0014875479,0.00092889636,0.00008149617,0.00036844722,0.00042508228,0.37713966,0.040014148,0.043704644,0.03680397,0.49592176],"study_design_scores_gemma":[0.00029071147,0.00028968832,0.0004921039,0.00005979003,0.00006285632,0.00017433452,0.00027984046,0.8757886,0.021416899,0.09374043,0.0073689027,0.00003580284],"about_ca_topic_score_codex":0.002335886,"about_ca_topic_score_gemma":0.0057143294,"teacher_disagreement_score":0.011096046,"about_ca_system_score_codex":0.001047923,"about_ca_system_score_gemma":0.0016430622,"threshold_uncertainty_score":0.037120044},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037773933,0.0013164368,0.78642124,0.00057038444,0.00056694774,0.00009834118,0.00047439834,0.00046067894,0.17231777],"genre_scores_gemma":[0.5015705,0.0021149525,0.32632524,0.00018365459,0.00021541347,0.00013342036,0.0012484837,0.00092772883,0.16728051],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999688,0.000045798777,0.000012670284,0.000045978555,0.0001828068,0.000024775038],"domain_scores_gemma":[0.9996209,0.000101588645,0.000028967483,0.00011700969,0.0001018258,0.00002965499],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023473689,0.000625629,0.0006977687,0.0009335251,0.0006805728,0.0016768138,0.00080658,0.0006868653,0.014835168],"category_scores_gemma":[0.0019587462,0.000577366,0.00045646884,0.0008036991,0.00082957937,0.0018198305,0.002151644,0.0021292788,0.002801778],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009017747,0.000057404755,0.00034259201,0.00014845366,0.000016920623,0.00014569508,0.000216162,0.064759165,0.006641459,0.755568,0.0104613295,0.16155267],"study_design_scores_gemma":[0.000034381497,0.00006003512,0.00038502493,0.00009845237,0.000025811427,0.0005234806,0.00014587205,0.432777,0.009255213,0.39348108,0.16318421,0.000029440997],"about_ca_topic_score_codex":0.0009143845,"about_ca_topic_score_gemma":0.0013311881,"teacher_disagreement_score":0.014835168,"about_ca_system_score_codex":0.0004121513,"about_ca_system_score_gemma":0.0003668785,"threshold_uncertainty_score":0.049628615},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26833278,0.0004351413,0.69866693,0.00026989373,0.00009975381,0.00016359067,0.0003945023,0.0009561002,0.030681271],"genre_scores_gemma":[0.65458214,0.00048646796,0.32558867,0.00011918715,0.00006847646,0.00021886069,0.00090368936,0.00045077343,0.017581733],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995646,0.00011845931,0.000020638472,0.00011526396,0.00009573442,0.000085330845],"domain_scores_gemma":[0.99882966,0.0003457984,0.000111312664,0.00039196335,0.00013830604,0.00018287904],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031190432,0.00050314685,0.000703738,0.0007051999,0.00092737086,0.0011933328,0.0017462325,0.00052085676,0.0058160597],"category_scores_gemma":[0.0014775848,0.0006158735,0.00049985654,0.0012770869,0.0007885698,0.0016443541,0.0022184174,0.0012916304,0.0010007098],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042358585,0.00029083368,0.0020226806,0.00053701526,0.00006281507,0.00041191868,0.0010530526,0.1286339,0.04451008,0.6600037,0.011539365,0.1505111],"study_design_scores_gemma":[0.000077641766,0.00020262982,0.001552862,0.0000921603,0.000070304486,0.00049301895,0.00066258886,0.3942737,0.024097461,0.56179917,0.016631374,0.000047047495],"about_ca_topic_score_codex":0.0008896921,"about_ca_topic_score_gemma":0.0019535488,"teacher_disagreement_score":0.0058160597,"about_ca_system_score_codex":0.0007057633,"about_ca_system_score_gemma":0.0005019,"threshold_uncertainty_score":0.019456685},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.122407734,0.0034806042,0.3019778,0.0010722692,0.0018410672,0.00012389697,0.0004636273,0.00056767056,0.5680652],"genre_scores_gemma":[0.59598583,0.003952524,0.11773532,0.0008303212,0.00055604795,0.00014748973,0.0008836587,0.0006850709,0.27922377],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998306,0.00003328069,0.000007096972,0.00003638898,0.00006497904,0.000027554373],"domain_scores_gemma":[0.99985445,0.00004025662,0.000012311577,0.000032144817,0.000032819666,0.000028037739],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017489352,0.0006133813,0.0005786959,0.0010917739,0.0007505346,0.0008951618,0.0006908031,0.00050152384,0.020308232],"category_scores_gemma":[0.00062876905,0.00029597292,0.00038720344,0.001092663,0.0009533878,0.0016239346,0.0019269409,0.001482179,0.0026788088],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020720032,0.000012394049,0.0000619852,0.0000564492,0.0000043812274,0.000057383717,0.00009679463,0.0024480578,0.0016645323,0.95396376,0.005020529,0.036592882],"study_design_scores_gemma":[0.0000061379283,0.000014404867,0.00007397456,0.000025831196,0.0000030152546,0.00011187532,0.00006290191,0.0049275425,0.0005270388,0.97255456,0.0216864,0.0000062796394],"about_ca_topic_score_codex":0.00062042405,"about_ca_topic_score_gemma":0.0011538728,"teacher_disagreement_score":0.020308232,"about_ca_system_score_codex":0.0004541516,"about_ca_system_score_gemma":0.0002096291,"threshold_uncertainty_score":0.06793779},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04486014,0.002684915,0.90950614,0.0005785322,0.00032174625,0.000073339535,0.00043439268,0.00022772381,0.04131307],"genre_scores_gemma":[0.70728356,0.005211328,0.24005808,0.00027736355,0.00044282895,0.0001684639,0.0011511759,0.0005363374,0.04487077],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993012,0.0002007168,0.000030563726,0.000106263404,0.00028943928,0.00007173156],"domain_scores_gemma":[0.99881977,0.000503284,0.00013789402,0.00015237239,0.00026614772,0.00012056224],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065263145,0.0005971666,0.0009853255,0.002055211,0.0009433127,0.002270675,0.001469944,0.0009192235,0.006065816],"category_scores_gemma":[0.0040927804,0.00048028646,0.0005508282,0.0021255224,0.0018265139,0.0037315274,0.0022586037,0.0011059443,0.001008922],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015127479,0.000005439902,0.00013424149,0.00003407512,0.0000056728427,0.000034586454,0.000095817275,0.024054244,0.00038898463,0.9586784,0.0018283081,0.014724911],"study_design_scores_gemma":[0.000007633698,0.000009798226,0.00013161857,0.000023655164,0.0000045197035,0.00008676299,0.000074467614,0.083558306,0.00021922344,0.90243435,0.013436923,0.000012741098],"about_ca_topic_score_codex":0.0040986543,"about_ca_topic_score_gemma":0.004650861,"teacher_disagreement_score":0.006065816,"about_ca_system_score_codex":0.0013138396,"about_ca_system_score_gemma":0.0006099589,"threshold_uncertainty_score":0.020292163},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00608573,0.00048957375,0.99044585,0.00022424539,0.00005479816,0.000036270736,0.00007012321,0.00044356874,0.002149782],"genre_scores_gemma":[0.1482346,0.00072271185,0.84516275,0.00014685694,0.00014901574,0.00019420238,0.00035672373,0.00044502187,0.004588085],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966272,0.0011208933,0.0001820206,0.0008384901,0.00095941353,0.00027200923],"domain_scores_gemma":[0.9903819,0.0059392736,0.0007070643,0.0018795603,0.00079775637,0.0002944948],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031036278,0.0015790587,0.0023945314,0.0017894692,0.0012871755,0.0025837475,0.0033846356,0.0030810444,0.00538142],"category_scores_gemma":[0.024276119,0.0014372263,0.0013328297,0.0028538757,0.0027541195,0.005504038,0.0044525014,0.0030380243,0.0013483346],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034131279,0.00012596327,0.00043958978,0.00028369535,0.000061501865,0.00007074671,0.00019231408,0.62061733,0.002715428,0.16036744,0.0107757095,0.204009],"study_design_scores_gemma":[0.00003366469,0.000057094403,0.00010335324,0.000024688336,0.000018966808,0.00006921434,0.000043517968,0.8303235,0.0013772938,0.16560745,0.0023231474,0.000018211973],"about_ca_topic_score_codex":0.0030169894,"about_ca_topic_score_gemma":0.0030650846,"teacher_disagreement_score":0.00538142,"about_ca_system_score_codex":0.0019674243,"about_ca_system_score_gemma":0.0022987232,"threshold_uncertainty_score":0.01800257},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33237043,0.0064776423,0.5029659,0.0074849124,0.00081933895,0.000069927984,0.00027855343,0.00040686165,0.14912643],"genre_scores_gemma":[0.9541983,0.001955608,0.035403494,0.00016384866,0.00042226206,0.000046336823,0.00013111832,0.00013468265,0.0075444314],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99970907,0.000099899495,0.000011759778,0.000035080768,0.0001027217,0.00004145415],"domain_scores_gemma":[0.999116,0.00057447073,0.00008854757,0.00010278518,0.000069884685,0.00004829759],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003973809,0.00039535784,0.00044778024,0.0009766592,0.00070276257,0.0016051845,0.0009861275,0.0009724192,0.006095563],"category_scores_gemma":[0.0029515503,0.00048909127,0.000548342,0.0010025701,0.0024350502,0.0026154697,0.0011596892,0.0011174717,0.00035258647],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030168323,0.000032235494,0.00040279017,0.000058662405,0.000010427404,0.000098982484,0.000096591495,0.21652128,0.0015648525,0.76471704,0.001081533,0.0153853865],"study_design_scores_gemma":[0.000008925958,0.0000130157605,0.00045172652,0.000009284936,0.0000049362693,0.00008133849,0.000053685737,0.38099402,0.00053067395,0.61486244,0.0029799056,0.000009983298],"about_ca_topic_score_codex":0.0013148624,"about_ca_topic_score_gemma":0.001301333,"teacher_disagreement_score":0.006095563,"about_ca_system_score_codex":0.0005632975,"about_ca_system_score_gemma":0.00038779117,"threshold_uncertainty_score":0.020391703},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25598708,0.0010836514,0.7311695,0.00067201955,0.00013414894,0.00020779436,0.00090766465,0.0032486191,0.006589361],"genre_scores_gemma":[0.7630158,0.00062133593,0.2280183,0.0001323914,0.00011830425,0.000107726075,0.0020583307,0.000805972,0.00512179],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973884,0.0004003934,0.00029836746,0.00057035976,0.0009873852,0.0003552133],"domain_scores_gemma":[0.9866716,0.006399603,0.0012938407,0.0043379357,0.00085193187,0.00044512842],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018531184,0.00055302185,0.0015139463,0.0015824429,0.0016386681,0.0040234504,0.0029566681,0.0016782609,0.0041960287],"category_scores_gemma":[0.020033652,0.0011711887,0.0010354705,0.003492173,0.0021751244,0.011687781,0.004719984,0.0016464799,0.0007561179],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0025255906,0.0004978764,0.011637935,0.0010563846,0.00016684213,0.0018104647,0.0039154473,0.11155404,0.03179847,0.38600454,0.021344768,0.4276876],"study_design_scores_gemma":[0.00020020893,0.00020834681,0.0020467967,0.00009346583,0.00010290394,0.0009436056,0.00085216085,0.40133458,0.021157015,0.5566775,0.01631206,0.00007128111],"about_ca_topic_score_codex":0.00304959,"about_ca_topic_score_gemma":0.0024295384,"teacher_disagreement_score":0.0041960287,"about_ca_system_score_codex":0.00091321603,"about_ca_system_score_gemma":0.00082417496,"threshold_uncertainty_score":0.014037073},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009746955,0.0037795224,0.1655426,0.0002967925,0.000991139,0.00008791379,0.0006441145,0.0011910421,0.81771994],"genre_scores_gemma":[0.12419811,0.009702612,0.11078665,0.00039905676,0.00072063575,0.00018729869,0.0031622003,0.0013166734,0.7495268],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99979717,0.0000145569165,0.000008029125,0.000049925362,0.00011062016,0.000019762678],"domain_scores_gemma":[0.999933,0.000010214704,0.0000056608515,0.000018756422,0.000020855767,0.000011502895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010431147,0.0009301268,0.0005378208,0.0011915001,0.0005137427,0.0013399835,0.0008305962,0.00047710064,0.060545173],"category_scores_gemma":[0.00030317422,0.00036657663,0.00034105647,0.0012899111,0.0007663629,0.0017011029,0.001958861,0.0012984315,0.022678962],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027282744,0.00003161228,0.00009565922,0.00022206854,0.000010992278,0.00008883063,0.00014070638,0.005494263,0.0062802485,0.5710124,0.051890917,0.3647051],"study_design_scores_gemma":[0.000008970765,0.000059158738,0.00026412713,0.00011251867,0.000011255122,0.0005283382,0.000115358904,0.0065925545,0.0043714372,0.38072872,0.60718846,0.000019099507],"about_ca_topic_score_codex":0.00026021546,"about_ca_topic_score_gemma":0.00058627117,"teacher_disagreement_score":0.060545173,"about_ca_system_score_codex":0.00032694158,"about_ca_system_score_gemma":0.0003772835,"threshold_uncertainty_score":0.2025438},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10509874,0.00017955812,0.8810874,0.00015982984,0.00012224766,0.000075157244,0.00014625397,0.0014326179,0.011698236],"genre_scores_gemma":[0.46690688,0.0005197525,0.51296514,0.00010175526,0.0000435469,0.00007598351,0.00034507737,0.0012138663,0.017828051],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998504,0.000014544675,0.000008142406,0.000045546294,0.00006361359,0.000017735634],"domain_scores_gemma":[0.9997278,0.00008009415,0.00003202674,0.00010291749,0.0000353734,0.000021679201],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016906332,0.0008511008,0.00048705447,0.0008795258,0.00032180603,0.0006252138,0.00092470704,0.0005517348,0.0035738202],"category_scores_gemma":[0.0008130574,0.0006541275,0.0004181837,0.0007193386,0.00073215447,0.0011739256,0.0014968279,0.0010994618,0.0008674452],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016466872,0.00010244443,0.00088843924,0.00032497695,0.000053696727,0.00027562334,0.00048245318,0.16474149,0.16810478,0.09476973,0.005620772,0.56447095],"study_design_scores_gemma":[0.00006336057,0.0003094073,0.0011133184,0.00006946676,0.00009557147,0.0012645916,0.00049492705,0.6544584,0.11825363,0.18786818,0.03593999,0.000069161826],"about_ca_topic_score_codex":0.0007566895,"about_ca_topic_score_gemma":0.0018031836,"teacher_disagreement_score":0.0035738202,"about_ca_system_score_codex":0.0001852874,"about_ca_system_score_gemma":0.00020879986,"threshold_uncertainty_score":0.011955678},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024102237,0.0017685709,0.9421299,0.0006169617,0.00015058032,0.00011101986,0.00044556012,0.0010301708,0.029644912],"genre_scores_gemma":[0.5435796,0.0040374696,0.41418257,0.001667881,0.0008186897,0.0007599294,0.0023141487,0.0016234493,0.031016208],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997349,0.00041668033,0.00017032055,0.0006368169,0.0010446232,0.00038248478],"domain_scores_gemma":[0.9897126,0.006229021,0.0007457057,0.0014883742,0.0013695027,0.00045475672],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031885356,0.0013570918,0.0016868768,0.0034899984,0.0013535898,0.0030143159,0.0027753515,0.0011846625,0.016902572],"category_scores_gemma":[0.014315523,0.00075101963,0.0019962986,0.0026202218,0.0032056903,0.009319257,0.0053640925,0.004397116,0.0038094688],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013319052,0.000048746693,0.00054647285,0.00022268167,0.00003357389,0.00016604892,0.00022352465,0.011958299,0.0032470906,0.9310097,0.007949378,0.044461355],"study_design_scores_gemma":[0.00007357942,0.00011426709,0.000318135,0.00007991893,0.00004182972,0.00043879144,0.00015892247,0.058703166,0.006826747,0.9045645,0.028646544,0.000033663895],"about_ca_topic_score_codex":0.0014947604,"about_ca_topic_score_gemma":0.0006931277,"teacher_disagreement_score":0.016902572,"about_ca_system_score_codex":0.0014628627,"about_ca_system_score_gemma":0.0007145008,"threshold_uncertainty_score":0.05654472},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21736084,0.0008143275,0.7146469,0.00039113447,0.00037447416,0.00023269933,0.0003581835,0.0018341311,0.063987285],"genre_scores_gemma":[0.606982,0.0012278935,0.36423737,0.00009122807,0.00010111981,0.00021023005,0.0006643363,0.0005674295,0.025918381],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995598,0.000069195754,0.000032770968,0.00009503616,0.0001489885,0.00009416044],"domain_scores_gemma":[0.99956924,0.00014207499,0.000046794292,0.00015157086,0.000031579522,0.000058653797],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018031283,0.0009897354,0.0011593242,0.0009790661,0.0012118673,0.0015681335,0.0015043226,0.00093064894,0.008798691],"category_scores_gemma":[0.0010294714,0.0009222425,0.00059382105,0.002407931,0.000923276,0.0019909022,0.00391229,0.0011143527,0.0025108866],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016807447,0.00053201173,0.0013732695,0.00092366105,0.00011125993,0.0030810349,0.0015353671,0.3225907,0.06829731,0.22354983,0.013315413,0.36300942],"study_design_scores_gemma":[0.0004011103,0.00094847387,0.0009649172,0.00017087409,0.000098518736,0.0016979959,0.0009584235,0.5818891,0.045841567,0.28376126,0.08317238,0.00009533095],"about_ca_topic_score_codex":0.00062733603,"about_ca_topic_score_gemma":0.00059088867,"teacher_disagreement_score":0.008798691,"about_ca_system_score_codex":0.0003130444,"about_ca_system_score_gemma":0.00028194184,"threshold_uncertainty_score":0.029434562},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027986826,0.000057608442,0.9696913,0.00007892063,0.000029981387,0.00008187849,0.000085136584,0.00029492806,0.0016934614],"genre_scores_gemma":[0.22286944,0.00008664597,0.7730804,0.000095105366,0.00003211743,0.00027793477,0.00042998226,0.00041847382,0.002709867],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993042,0.00018622671,0.00003705731,0.00010834687,0.00031142015,0.000052785523],"domain_scores_gemma":[0.99786794,0.0011405728,0.00017503173,0.0002556481,0.00042906607,0.00013176302],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009230852,0.00075422996,0.00091675296,0.0013626491,0.00061060424,0.00094033044,0.0016183362,0.0016423818,0.0041532195],"category_scores_gemma":[0.00678763,0.0007784253,0.0006020089,0.0010182564,0.00080459594,0.0012393302,0.002352372,0.001928116,0.0008665023],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035216738,0.00025715478,0.0020755655,0.00025549135,0.000058946764,0.000110157525,0.0002853742,0.768874,0.01601074,0.04139994,0.004798897,0.16552162],"study_design_scores_gemma":[0.000015242881,0.00005173777,0.00012560743,0.000013762367,0.0000055542346,0.00002397356,0.00003326213,0.98864985,0.0023727773,0.007656921,0.0010453719,0.0000058720607],"about_ca_topic_score_codex":0.001824183,"about_ca_topic_score_gemma":0.0047957585,"teacher_disagreement_score":0.0041532195,"about_ca_system_score_codex":0.00072229584,"about_ca_system_score_gemma":0.00084376923,"threshold_uncertainty_score":0.013893902},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014520946,0.0023745324,0.33835995,0.0015226396,0.0010365603,0.00016364096,0.0019483989,0.0021051338,0.6379681],"genre_scores_gemma":[0.5041146,0.0049448977,0.16931127,0.0011478775,0.0010790982,0.0004561489,0.0068472736,0.0035207488,0.30857816],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99841833,0.00021747248,0.00012543575,0.00046325865,0.00059563003,0.00017988827],"domain_scores_gemma":[0.9987067,0.00038730982,0.0000773579,0.0005406301,0.00022174373,0.00006622574],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078009866,0.00089187344,0.00080162624,0.0012466034,0.0017711661,0.0046683517,0.0012159559,0.00081789267,0.035899222],"category_scores_gemma":[0.0029031923,0.0007192502,0.0009837146,0.001319154,0.0027742854,0.009543137,0.0033652883,0.0024688812,0.011148328],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015861542,0.000014031858,0.000044702243,0.00007017461,0.0000053680533,0.00005383734,0.0002287115,0.00038258889,0.00075537985,0.9524982,0.012290908,0.033640172],"study_design_scores_gemma":[0.0000065557115,0.000008389017,0.00004633574,0.000042716456,0.000007840257,0.00019113939,0.00008530408,0.0014388538,0.0011466686,0.8888013,0.10821321,0.00001169303],"about_ca_topic_score_codex":0.00084423565,"about_ca_topic_score_gemma":0.0009923739,"teacher_disagreement_score":0.035899222,"about_ca_system_score_codex":0.0012092377,"about_ca_system_score_gemma":0.0010830233,"threshold_uncertainty_score":0.120094836},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030922564,0.00046092283,0.9869658,0.00012346015,0.000062167404,0.000025035393,0.00007750949,0.0006375645,0.008555236],"genre_scores_gemma":[0.13053064,0.0013766412,0.8471521,0.00012768077,0.00010178726,0.00016406752,0.0005510234,0.00046491268,0.019531196],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99947375,0.000104779596,0.00003629359,0.00010216826,0.00023292704,0.000050086015],"domain_scores_gemma":[0.9993217,0.0002486584,0.000056509445,0.00021975757,0.00011660233,0.000036820456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005886464,0.0012024564,0.0011893156,0.0013385868,0.00074613135,0.0023805357,0.002424656,0.0011557934,0.012886752],"category_scores_gemma":[0.00256313,0.0009295838,0.0017813068,0.0018069131,0.0012543411,0.0031791104,0.0030184458,0.0029608842,0.0040615126],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052755284,0.00004946933,0.00023976277,0.00018020801,0.00004678546,0.000052008418,0.00011933854,0.1365813,0.0026771678,0.6002769,0.008017927,0.25170642],"study_design_scores_gemma":[0.000018979643,0.000032909487,0.0001378202,0.000045131037,0.000021858437,0.00008616125,0.00004345544,0.43904147,0.0015136466,0.53992647,0.019110119,0.000021858708],"about_ca_topic_score_codex":0.0015521041,"about_ca_topic_score_gemma":0.0018529826,"teacher_disagreement_score":0.012886752,"about_ca_system_score_codex":0.0011991846,"about_ca_system_score_gemma":0.00065991835,"threshold_uncertainty_score":0.04311049},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009826464,0.00007327322,0.99683726,0.00004763162,0.000035074827,0.000025762442,0.000052086147,0.00043931475,0.0015070132],"genre_scores_gemma":[0.036500778,0.00027774906,0.95821893,0.00008437449,0.000036610974,0.00011962929,0.00048647652,0.00041824227,0.003857183],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990497,0.00018037339,0.000076759345,0.0001288639,0.00043161266,0.00013261662],"domain_scores_gemma":[0.9986181,0.00024048211,0.0000747491,0.00049039634,0.0004475623,0.00012856879],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010156812,0.0009575042,0.0010310463,0.0019806297,0.0009521741,0.0025151179,0.0026699672,0.0009834316,0.009775472],"category_scores_gemma":[0.0035360039,0.00081594964,0.0019892135,0.002163948,0.00084966206,0.0025866614,0.0043529607,0.0024998672,0.0039124126],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023417342,0.00020288683,0.0015026978,0.0005035059,0.00019841883,0.00032670397,0.0006795162,0.1613937,0.027336935,0.26007736,0.020356921,0.5271871],"study_design_scores_gemma":[0.000028840692,0.00007800142,0.00027547198,0.00010184575,0.000073544536,0.00029466642,0.0001569179,0.84247226,0.008582592,0.11637527,0.031521276,0.00003940522],"about_ca_topic_score_codex":0.0033180853,"about_ca_topic_score_gemma":0.0058434834,"teacher_disagreement_score":0.009775472,"about_ca_system_score_codex":0.00075567485,"about_ca_system_score_gemma":0.0011011992,"threshold_uncertainty_score":0.032702148},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07431361,0.0037798563,0.8629953,0.0016256223,0.0002984533,0.00029167449,0.002521361,0.003990645,0.05018351],"genre_scores_gemma":[0.44303066,0.004438303,0.51309985,0.00029661643,0.00025940797,0.00039537207,0.007597412,0.0012279687,0.029654434],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985796,0.00026753102,0.00011848849,0.00023404184,0.00063708116,0.00016322992],"domain_scores_gemma":[0.99766773,0.0016515616,0.000086846245,0.00032470477,0.00018576844,0.000083420586],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007330026,0.0006429073,0.0017254971,0.0010848794,0.0010364564,0.002406598,0.0019131274,0.0015847824,0.0073952465],"category_scores_gemma":[0.005607169,0.00064896554,0.0006574666,0.003797833,0.0011085712,0.0059704906,0.0031298122,0.0017181631,0.0017759561],"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.00053366425,0.00017485932,0.00091204554,0.0014201349,0.000063911124,0.000521519,0.0008102754,0.21595387,0.007763479,0.4059914,0.05575104,0.31010383],"study_design_scores_gemma":[0.00009888174,0.000056126282,0.0002775771,0.00010602636,0.000026395473,0.0004270284,0.00049357483,0.512366,0.0061068335,0.4249154,0.055091176,0.000034918932],"about_ca_topic_score_codex":0.0023178416,"about_ca_topic_score_gemma":0.0020554566,"teacher_disagreement_score":0.0073952465,"about_ca_system_score_codex":0.0010653702,"about_ca_system_score_gemma":0.0006306622,"threshold_uncertainty_score":0.024739563},"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":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010881417,0.0048223017,0.26905498,0.0009995663,0.004889132,0.00013514758,0.0007489687,0.002730512,0.7057379],"genre_scores_gemma":[0.08665518,0.0036779656,0.102065414,0.00045667766,0.00058565754,0.00010885195,0.001870704,0.0019982723,0.8025813],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995975,0.00003135809,0.000021573567,0.0001335135,0.00017314173,0.00004290142],"domain_scores_gemma":[0.99964416,0.000050436967,0.000012766383,0.00018569267,0.00007850172,0.000028391014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029454657,0.0009966756,0.00094650686,0.0018243532,0.0012917946,0.0022407754,0.0010043636,0.00083444244,0.11193487],"category_scores_gemma":[0.0010308768,0.00056969665,0.0008820918,0.0017688873,0.00069746654,0.0022735621,0.0015699376,0.0015720639,0.043466765],"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.00008235221,0.000053414697,0.00022240031,0.00023714441,0.000025529831,0.00030213097,0.00016128164,0.0026725198,0.01446386,0.26276496,0.08511215,0.6339023],"study_design_scores_gemma":[0.0000155343,0.00006147973,0.00062182755,0.00012418513,0.000028169063,0.0010425557,0.00014799676,0.0069023855,0.020258605,0.3075553,0.6632095,0.000032473203],"about_ca_topic_score_codex":0.00039781732,"about_ca_topic_score_gemma":0.0005930357,"teacher_disagreement_score":0.11193487,"about_ca_system_score_codex":0.00050326023,"about_ca_system_score_gemma":0.00041647343,"threshold_uncertainty_score":0.37445945},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00911655,0.004973828,0.7372578,0.0012940293,0.0012395965,0.00013577945,0.00077954814,0.00086314697,0.24433978],"genre_scores_gemma":[0.1506031,0.014944565,0.5171019,0.0011544204,0.0011736834,0.0005403144,0.0035240068,0.0013999301,0.30955803],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99935573,0.00009252882,0.000026757189,0.00018995749,0.0002782208,0.000056856046],"domain_scores_gemma":[0.9995079,0.00017689068,0.000036794874,0.00012716946,0.00010586193,0.000045393776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048562844,0.0011245951,0.00078476575,0.0017684181,0.0012372155,0.002996532,0.0013251764,0.0009430153,0.02268323],"category_scores_gemma":[0.0019507284,0.0006492717,0.00085322617,0.0030110448,0.0016672456,0.006278792,0.0023343528,0.0020985913,0.0072820247],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013347156,0.000008162119,0.00006928704,0.000089206325,0.000010023747,0.00004442349,0.00008783395,0.0059220903,0.00081524503,0.9121815,0.019011414,0.06174742],"study_design_scores_gemma":[0.0000046180176,0.000025753698,0.0001430564,0.00007238705,0.000010556322,0.00028899978,0.00010200658,0.019462405,0.0012363974,0.76537395,0.21326558,0.0000143735015],"about_ca_topic_score_codex":0.00067875854,"about_ca_topic_score_gemma":0.00087574427,"teacher_disagreement_score":0.02268323,"about_ca_system_score_codex":0.0011163789,"about_ca_system_score_gemma":0.0005939748,"threshold_uncertainty_score":0.07588297},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.061499752,0.0016331284,0.9069749,0.00022589148,0.00023630344,0.0001930511,0.0006255044,0.004001354,0.024610132],"genre_scores_gemma":[0.1985017,0.00087243953,0.7782164,0.00013415706,0.00011751355,0.00017221345,0.0027146982,0.0012039596,0.018066863],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990282,0.00012894545,0.00005908307,0.00015305687,0.0005025333,0.00012817525],"domain_scores_gemma":[0.99825364,0.0007043791,0.000098981545,0.00048179226,0.00037055285,0.00009055476],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005898626,0.0010811357,0.001636197,0.0019686522,0.00072095206,0.0013247366,0.0020268557,0.00093198713,0.0139693],"category_scores_gemma":[0.0035390917,0.000693387,0.0008298561,0.002144755,0.00068953366,0.0023298585,0.002853953,0.0012947379,0.003740641],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00053401914,0.00016920992,0.0011861824,0.0005632913,0.000091392714,0.00032034208,0.00023523431,0.06773608,0.025599748,0.059496112,0.029080937,0.8149875],"study_design_scores_gemma":[0.00013408295,0.00027995434,0.0011417415,0.00016143656,0.00009974068,0.00074769557,0.00021919115,0.7543268,0.0331237,0.16958882,0.040142372,0.00003450787],"about_ca_topic_score_codex":0.0009267287,"about_ca_topic_score_gemma":0.0028723371,"teacher_disagreement_score":0.0139693,"about_ca_system_score_codex":0.0004511242,"about_ca_system_score_gemma":0.0005601526,"threshold_uncertainty_score":0.04673195},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90323335,0.007012542,0.07071755,0.0006606383,0.00006766749,0.00018131328,0.0011297653,0.0004643506,0.016532918],"genre_scores_gemma":[0.9566385,0.0024844923,0.03521652,0.000066139895,0.00003674575,0.000050648097,0.001289537,0.000554538,0.0036628058],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99346864,0.002679458,0.00039001612,0.0005914801,0.0025727677,0.00029764613],"domain_scores_gemma":[0.78384405,0.18403617,0.0066309185,0.015124773,0.009478729,0.0008854544],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0066662244,0.00045055238,0.0006817816,0.002282701,0.00069882354,0.0020916646,0.0015000735,0.0013627029,0.005014394],"category_scores_gemma":[0.14028095,0.0005648007,0.000731226,0.003287358,0.0018660732,0.005622776,0.0011788983,0.0009924808,0.0016354644],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0038874296,0.0006771542,0.16761261,0.0016270676,0.0005063208,0.00050437957,0.0060057254,0.13781248,0.01120625,0.023820998,0.010485746,0.6358538],"study_design_scores_gemma":[0.00030640527,0.0037415407,0.2669415,0.00090200966,0.0010196526,0.0065014507,0.014355195,0.54789,0.023164885,0.08352428,0.051388446,0.0002646888],"about_ca_topic_score_codex":0.0034550352,"about_ca_topic_score_gemma":0.0037063882,"teacher_disagreement_score":0.0066662244,"about_ca_system_score_codex":0.0006709085,"about_ca_system_score_gemma":0.0004561611,"threshold_uncertainty_score":0.035254776},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2087123,0.0012765229,0.7185464,0.0022559909,0.0003808995,0.00027256235,0.00031181643,0.00050968525,0.06773392],"genre_scores_gemma":[0.6087577,0.00079494424,0.3696758,0.00034068624,0.00018735608,0.00019081774,0.0003718935,0.00044251134,0.019238286],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995573,0.00016085507,0.000020551664,0.00004990068,0.00013757378,0.00007381921],"domain_scores_gemma":[0.9986714,0.0008682943,0.00011898734,0.00009193305,0.00015058876,0.000098888304],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009899857,0.0009814476,0.0011590978,0.0011707011,0.00068618124,0.0012590699,0.0011421818,0.001925071,0.010148119],"category_scores_gemma":[0.006693257,0.00062924536,0.0006968314,0.0011443387,0.0009807089,0.0012090505,0.0015646517,0.0012829816,0.00070387655],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038160576,0.00028936449,0.00044291472,0.00025377696,0.000042725813,0.00015709325,0.0002122421,0.77523345,0.0060260044,0.1112572,0.0068097524,0.09889389],"study_design_scores_gemma":[0.00006927478,0.00008885256,0.00016474858,0.000015151384,0.000015444311,0.00004396382,0.000088095556,0.9671697,0.0010522407,0.029305525,0.0019751992,0.000011830389],"about_ca_topic_score_codex":0.0023027698,"about_ca_topic_score_gemma":0.0030578908,"teacher_disagreement_score":0.010148119,"about_ca_system_score_codex":0.0007922748,"about_ca_system_score_gemma":0.00074810494,"threshold_uncertainty_score":0.03394878},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17274399,0.023235427,0.6015781,0.008956659,0.0013825715,0.00034888805,0.0022596943,0.0026528758,0.18684174],"genre_scores_gemma":[0.77517325,0.012548617,0.15607889,0.0024018988,0.0025161328,0.0010508742,0.004563788,0.00243292,0.043233614],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99378306,0.00130018,0.00025756223,0.0011935743,0.0019403023,0.0015254215],"domain_scores_gemma":[0.96454686,0.024891352,0.0019202655,0.0037905364,0.0021899096,0.002661037],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004732935,0.0033317746,0.003618524,0.0063806376,0.0038483085,0.006735528,0.008201831,0.0034972548,0.03290532],"category_scores_gemma":[0.03751772,0.0019262936,0.0030176593,0.0051584532,0.004735452,0.017249428,0.010172241,0.008787016,0.0051476317],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00084227324,0.0002223082,0.005483592,0.0013523783,0.00021156005,0.0004369314,0.001015097,0.058698937,0.007140898,0.8306545,0.027253669,0.0666879],"study_design_scores_gemma":[0.000083368184,0.0003252915,0.0022264118,0.0004468054,0.00021862461,0.0008191315,0.0003863905,0.23551053,0.004480238,0.723147,0.03223788,0.00011847167],"about_ca_topic_score_codex":0.0021258642,"about_ca_topic_score_gemma":0.0020978604,"teacher_disagreement_score":0.03290532,"about_ca_system_score_codex":0.0045702746,"about_ca_system_score_gemma":0.00093906035,"threshold_uncertainty_score":0.11007923},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20439894,0.0005922976,0.7857243,0.00023515738,0.000066300025,0.0002259044,0.00059034437,0.00347915,0.0046875873],"genre_scores_gemma":[0.35200447,0.0001646926,0.64209735,0.000042833555,0.00004068749,0.00015437936,0.0020670923,0.0005205962,0.002907894],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981919,0.00021305238,0.00017188421,0.0006036783,0.0005794275,0.00024012216],"domain_scores_gemma":[0.9945393,0.002560827,0.00071882136,0.0007311125,0.0010302196,0.00041964906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086819107,0.0012471724,0.0017703866,0.003859094,0.0013364358,0.002605857,0.0022423987,0.0019330824,0.0055863056],"category_scores_gemma":[0.011221544,0.0011922517,0.000955747,0.0023730237,0.0010646203,0.00315563,0.003118263,0.0009248154,0.0020814815],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018121569,0.00023086411,0.0089656925,0.00093051733,0.00020402599,0.0009830269,0.0013925749,0.23909931,0.06822369,0.04960322,0.010446066,0.61810887],"study_design_scores_gemma":[0.00010608553,0.00020507029,0.0017182366,0.00005434827,0.00006468917,0.00041038104,0.0005832376,0.8962705,0.042191703,0.047442563,0.010869708,0.00008343759],"about_ca_topic_score_codex":0.0025992857,"about_ca_topic_score_gemma":0.002789283,"teacher_disagreement_score":0.0055863056,"about_ca_system_score_codex":0.0009145309,"about_ca_system_score_gemma":0.0010590788,"threshold_uncertainty_score":0.018688023},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010559991,0.00007187977,0.98596627,0.00006715982,0.000039169194,0.00006640164,0.00011884902,0.0016014405,0.0015087978],"genre_scores_gemma":[0.122549586,0.00013259269,0.87364227,0.000058615195,0.000014050511,0.0001685371,0.000538167,0.0007288809,0.002167315],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99935025,0.00012479562,0.000041982963,0.000094690855,0.0003543331,0.000033983506],"domain_scores_gemma":[0.9989655,0.00047485685,0.0000633933,0.000252187,0.00021305263,0.000031027826],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010954092,0.00046946647,0.00066150166,0.0010074006,0.00035455532,0.0009082101,0.0011895995,0.0006042188,0.003722255],"category_scores_gemma":[0.002390059,0.00049350125,0.0006629027,0.0004937311,0.00053220114,0.00064473425,0.0011848701,0.0006258359,0.0010310266],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014403065,0.000049054415,0.0024824247,0.00046210075,0.00006120841,0.0004908673,0.00060565193,0.4212929,0.074901186,0.029352648,0.009127643,0.46103027],"study_design_scores_gemma":[0.000017721863,0.000036940575,0.0004680286,0.000023332212,0.000006859481,0.000271671,0.00006165002,0.95633173,0.022841973,0.00904091,0.010878075,0.000021129295],"about_ca_topic_score_codex":0.0007338365,"about_ca_topic_score_gemma":0.0011488583,"teacher_disagreement_score":0.003722255,"about_ca_system_score_codex":0.00038781628,"about_ca_system_score_gemma":0.00060073246,"threshold_uncertainty_score":0.012452185},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34865782,0.000854715,0.59521335,0.0011984125,0.00027264794,0.00019636616,0.00031563113,0.00045653974,0.05283452],"genre_scores_gemma":[0.83943903,0.0011902114,0.14431763,0.00036571067,0.0005257422,0.00024926412,0.0006589312,0.00028042257,0.012973071],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962327,0.00070381473,0.00023136607,0.00067695754,0.0013637372,0.00079143146],"domain_scores_gemma":[0.99063385,0.0048940736,0.0012938086,0.0013652913,0.0008577542,0.00095529325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002052198,0.0012923958,0.0016366459,0.0031163427,0.0029121577,0.0032540113,0.003729317,0.0014679576,0.008058873],"category_scores_gemma":[0.015209826,0.0013604182,0.0027846524,0.004189805,0.0045063,0.005762022,0.008831656,0.0066523524,0.00165555],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016645386,0.00017645583,0.0030829578,0.00015708442,0.000040360315,0.0003444809,0.0008457901,0.020676121,0.0032561298,0.93642455,0.0021960072,0.03263353],"study_design_scores_gemma":[0.00004150272,0.0000923544,0.0013178837,0.0000599148,0.000049494647,0.00066610076,0.00038217532,0.13975827,0.004566904,0.8467404,0.0062672235,0.000057775163],"about_ca_topic_score_codex":0.0026085095,"about_ca_topic_score_gemma":0.0017586254,"teacher_disagreement_score":0.008058873,"about_ca_system_score_codex":0.0034856664,"about_ca_system_score_gemma":0.0009706712,"threshold_uncertainty_score":0.026959598},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08842569,0.0014506202,0.8654627,0.0008844668,0.0005722178,0.00008594599,0.00054138864,0.00183317,0.040743902],"genre_scores_gemma":[0.5907482,0.0016902611,0.36289135,0.0005390235,0.0004972342,0.00017809706,0.0011118463,0.0019014477,0.04044258],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99947804,0.00008724221,0.000025664309,0.000079814534,0.0002650241,0.00006432242],"domain_scores_gemma":[0.9992073,0.0002444515,0.00006598777,0.0003669963,0.00007376986,0.000041578613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034746126,0.0008798544,0.0011079294,0.0007279551,0.00052027794,0.0013684123,0.0010313699,0.00088140083,0.0059546945],"category_scores_gemma":[0.002449396,0.00050447276,0.00064513285,0.000978618,0.0010325379,0.00230116,0.0022174697,0.001741443,0.0017039111],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004080687,0.00023626913,0.0004805492,0.00038289657,0.000080602615,0.00018030308,0.00036831884,0.16455019,0.05277968,0.3707983,0.034398783,0.37533608],"study_design_scores_gemma":[0.000072874296,0.00015047824,0.0005170985,0.00004839498,0.00004666793,0.0005246454,0.00021074212,0.4171501,0.023932865,0.5277047,0.029604843,0.000036628822],"about_ca_topic_score_codex":0.00038159246,"about_ca_topic_score_gemma":0.0009147702,"teacher_disagreement_score":0.0059546945,"about_ca_system_score_codex":0.00037516473,"about_ca_system_score_gemma":0.0003425244,"threshold_uncertainty_score":0.019920409},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4205699,0.0017448193,0.45317817,0.0012420822,0.00024869104,0.00010494446,0.00070585235,0.0004095437,0.12179606],"genre_scores_gemma":[0.9187113,0.0016935265,0.035911474,0.00015131869,0.0002358144,0.00011257433,0.0008535856,0.000333779,0.041996572],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997687,0.00003751503,0.000012902177,0.000057266527,0.00008939912,0.000034303317],"domain_scores_gemma":[0.9992842,0.00033532304,0.00010637445,0.000102407845,0.00008028416,0.00009137924],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002605968,0.0006904267,0.0006565981,0.0015309055,0.00071545533,0.001889383,0.0011975431,0.00091934035,0.007534027],"category_scores_gemma":[0.0017716325,0.00048988115,0.00074846833,0.0010232832,0.0017203195,0.0028649075,0.0014059846,0.0023082988,0.0010122263],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003566344,0.000021766222,0.00019174737,0.000070876406,0.000009131986,0.00008336377,0.00021609805,0.0108218,0.0025196823,0.9751012,0.0012962348,0.009632524],"study_design_scores_gemma":[0.000011776196,0.00001633437,0.000188362,0.000015596239,0.000006458185,0.00011743857,0.000095667005,0.030038316,0.00084297516,0.96655434,0.0021020407,0.000010630174],"about_ca_topic_score_codex":0.0006467745,"about_ca_topic_score_gemma":0.0005364494,"teacher_disagreement_score":0.007534027,"about_ca_system_score_codex":0.00058505684,"about_ca_system_score_gemma":0.00020191082,"threshold_uncertainty_score":0.025203824},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5489074,0.002839424,0.37666515,0.00838828,0.00034927073,0.0006970246,0.010383467,0.003966704,0.047803253],"genre_scores_gemma":[0.6914072,0.002156993,0.26263183,0.0006799615,0.00044029372,0.00052809826,0.015995234,0.0017327421,0.0244276],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99689,0.00086045486,0.00024436464,0.00068616256,0.0009065007,0.00041254688],"domain_scores_gemma":[0.9748502,0.020846292,0.0011685304,0.0016431278,0.00081635953,0.0006755903],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013835205,0.0018778517,0.002566929,0.0015305235,0.0015484293,0.0076961676,0.005228328,0.0032038018,0.025077369],"category_scores_gemma":[0.017047746,0.001787587,0.0027324152,0.004243924,0.0018619346,0.010165243,0.0034424425,0.0037451733,0.0026713526],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0024934188,0.000913093,0.007770151,0.0032671401,0.0004430407,0.00084497314,0.0015735959,0.5354384,0.012803585,0.10901513,0.049099036,0.2763384],"study_design_scores_gemma":[0.00044903957,0.00018878722,0.0020222203,0.000086954366,0.00018683654,0.00050490675,0.00056266156,0.7874126,0.0037920736,0.20028518,0.0044483226,0.000060378763],"about_ca_topic_score_codex":0.008538807,"about_ca_topic_score_gemma":0.011725637,"teacher_disagreement_score":0.025077369,"about_ca_system_score_codex":0.003010219,"about_ca_system_score_gemma":0.0028433262,"threshold_uncertainty_score":0.08389217},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0057420493,0.00004145201,0.991844,0.000041282452,0.0000104057945,0.000025248697,0.000025311814,0.0001722093,0.002097987],"genre_scores_gemma":[0.14961681,0.00026315116,0.8459446,0.000039461058,0.000019846355,0.00013999878,0.00030052807,0.00030485523,0.0033707817],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992084,0.00010084434,0.00004062467,0.00010551045,0.0004907307,0.00005387733],"domain_scores_gemma":[0.99934405,0.00019093294,0.00007359731,0.00019134491,0.0001615936,0.000038505328],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076710887,0.0005802474,0.00073557394,0.0010766658,0.000633184,0.001698716,0.0010923304,0.00083790196,0.0032462135],"category_scores_gemma":[0.003630375,0.00054290064,0.00092577515,0.0007931753,0.0014828948,0.0021784378,0.0023385365,0.0009114541,0.0010739829],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050999493,0.000035674624,0.0008100588,0.000196278,0.000019948617,0.0002446335,0.00052717916,0.21826088,0.018569387,0.57664156,0.0026048177,0.18203856],"study_design_scores_gemma":[0.000013435214,0.00005468985,0.0002365432,0.000034906032,0.0000116629235,0.00035640877,0.00016189873,0.7057794,0.011789328,0.2625314,0.019008337,0.00002198764],"about_ca_topic_score_codex":0.0012952745,"about_ca_topic_score_gemma":0.001397416,"teacher_disagreement_score":0.0032462135,"about_ca_system_score_codex":0.0005403694,"about_ca_system_score_gemma":0.000706552,"threshold_uncertainty_score":0.010859668},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14816433,0.0006590901,0.7687449,0.0006313859,0.0005608801,0.0002153532,0.0005637168,0.00054980617,0.079910606],"genre_scores_gemma":[0.7062776,0.0008379657,0.26048276,0.00021927427,0.00016521537,0.0002811499,0.00082580076,0.00061102357,0.030299217],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997739,0.000057704856,0.000011332286,0.000034768087,0.000091725844,0.000030491636],"domain_scores_gemma":[0.9998171,0.000042760636,0.000024207986,0.00005319293,0.000035729347,0.000027075563],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018555064,0.00046910037,0.0005966437,0.001038911,0.00063242647,0.0008466367,0.0008828604,0.0006970526,0.014377747],"category_scores_gemma":[0.0008839074,0.00034534588,0.0006481709,0.0009926718,0.0007240315,0.0008110885,0.0016530969,0.0013522395,0.001520268],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000112292204,0.00007899477,0.00036180604,0.00019098687,0.000041237607,0.00014515776,0.00027012217,0.069698706,0.007012235,0.78947496,0.009039017,0.12357455],"study_design_scores_gemma":[0.00010526149,0.00012436188,0.00040526636,0.00008155867,0.000034637087,0.00020589259,0.0003144755,0.25026286,0.00335296,0.7217008,0.023383135,0.00002881094],"about_ca_topic_score_codex":0.00044401176,"about_ca_topic_score_gemma":0.0008713657,"teacher_disagreement_score":0.014377747,"about_ca_system_score_codex":0.00042281652,"about_ca_system_score_gemma":0.00032920917,"threshold_uncertainty_score":0.048098326},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0038584908,0.00018577001,0.8631146,0.00011634119,0.00025221743,0.00015329088,0.001783909,0.07642238,0.05411303],"genre_scores_gemma":[0.053269453,0.0003593636,0.8502472,0.0001894349,0.000032965912,0.00027163312,0.009417195,0.015595924,0.07061674],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995271,0.000032161577,0.00001729578,0.00005897895,0.00029623843,0.00006826707],"domain_scores_gemma":[0.9995541,0.00007593609,0.00000978553,0.00008073325,0.00023656178,0.000042945205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005052528,0.0010112957,0.00068327505,0.0010890461,0.00065767777,0.0013360019,0.0035096852,0.0008484478,0.08485413],"category_scores_gemma":[0.0012224383,0.0007839844,0.00084658305,0.0010578325,0.0004256995,0.00073001167,0.001228738,0.001378478,0.027194133],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042834628,0.00019555204,0.0012864815,0.00042715322,0.000084684245,0.0004264741,0.0003832402,0.06173034,0.030021444,0.051401112,0.225817,0.6277981],"study_design_scores_gemma":[0.0003109823,0.00010192725,0.0007663084,0.000093805626,0.00006502276,0.00056080095,0.00013971906,0.517563,0.048647042,0.018960072,0.41268417,0.000107099455],"about_ca_topic_score_codex":0.029558904,"about_ca_topic_score_gemma":0.0538972,"teacher_disagreement_score":0.08485413,"about_ca_system_score_codex":0.00094612414,"about_ca_system_score_gemma":0.0021517968,"threshold_uncertainty_score":0.28386533},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0771866,0.00020613983,0.8926329,0.0006844575,0.00016871045,0.000117984615,0.000918869,0.0018955228,0.026188757],"genre_scores_gemma":[0.5464371,0.00044673146,0.4365622,0.00038245527,0.00010071421,0.00032781877,0.0026211897,0.0005780616,0.012543773],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99951637,0.000095023504,0.000025164607,0.000112924165,0.0001644029,0.00008610191],"domain_scores_gemma":[0.9993722,0.00017307892,0.000079512014,0.00021833704,0.00011998366,0.00003697257],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027890044,0.00051753875,0.00046777862,0.0007087614,0.0005621382,0.0015043697,0.0009926178,0.000937057,0.010147813],"category_scores_gemma":[0.0022017981,0.00030259523,0.00052120065,0.0011476234,0.00079986785,0.0023965598,0.0017304404,0.001442653,0.0023858491],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002530346,0.00011273557,0.0011332592,0.00027701678,0.000026603351,0.0004408144,0.00044053822,0.06488904,0.016264373,0.72133166,0.016794493,0.1780365],"study_design_scores_gemma":[0.000050422266,0.00011251356,0.0004968637,0.00006465511,0.00003184162,0.0005259794,0.0002844216,0.25649992,0.010512582,0.69288397,0.038502462,0.000034433204],"about_ca_topic_score_codex":0.00079650484,"about_ca_topic_score_gemma":0.00069936586,"teacher_disagreement_score":0.010147813,"about_ca_system_score_codex":0.0004923226,"about_ca_system_score_gemma":0.00038985093,"threshold_uncertainty_score":0.033947825},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02178117,0.0002517199,0.9734109,0.00012220266,0.0000339209,0.00011204519,0.00015432228,0.00074136315,0.003392281],"genre_scores_gemma":[0.091299236,0.0002168875,0.90554565,0.00003516618,0.000023958346,0.00017392168,0.0005460617,0.00022780005,0.0019314702],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99919885,0.0001302557,0.000049434682,0.00016315025,0.0003633224,0.00009503917],"domain_scores_gemma":[0.998178,0.0011408875,0.00018191844,0.00021942673,0.00020569972,0.00007399979],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094494986,0.0015903254,0.0020206855,0.0020043813,0.00080668606,0.0020797816,0.003082536,0.0019855043,0.00667862],"category_scores_gemma":[0.005954957,0.0013195109,0.0013960182,0.003393476,0.0012367807,0.002675463,0.0027264734,0.0020014788,0.0012502475],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005516256,0.00023275768,0.0018772368,0.00050465454,0.00009072215,0.00018640317,0.00046382585,0.52885383,0.0051102266,0.03898677,0.007297061,0.41584483],"study_design_scores_gemma":[0.000062777566,0.000064071806,0.00016012354,0.00003236845,0.000024333252,0.000121894016,0.00008916265,0.98075473,0.0015521817,0.015440932,0.0016869417,0.000010536726],"about_ca_topic_score_codex":0.0032082286,"about_ca_topic_score_gemma":0.0034243555,"teacher_disagreement_score":0.00667862,"about_ca_system_score_codex":0.0012455821,"about_ca_system_score_gemma":0.0009884151,"threshold_uncertainty_score":0.022342205},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.064441144,0.000644601,0.9010758,0.0012622157,0.00015158848,0.00039657616,0.00024374768,0.0002661958,0.031518172],"genre_scores_gemma":[0.55694205,0.00089120737,0.42006043,0.00048726625,0.00016628674,0.0006545607,0.0005906401,0.00032920315,0.019878358],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99946433,0.00018131488,0.000022143808,0.00009602059,0.00013597793,0.00010020563],"domain_scores_gemma":[0.9984871,0.0010600266,0.00007026841,0.000088618595,0.00012089495,0.00017310005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009001438,0.001189097,0.0015931574,0.0014796582,0.00087740936,0.0016509866,0.0018901917,0.0028550131,0.010416323],"category_scores_gemma":[0.005398404,0.0007974097,0.00091909425,0.0013090027,0.001120213,0.0023772935,0.0022294577,0.0016873971,0.00068219367],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004674218,0.00040180195,0.0006390669,0.00043317603,0.000107454536,0.00026606058,0.00031289383,0.4304953,0.006845746,0.3771461,0.018618764,0.1642662],"study_design_scores_gemma":[0.00008048967,0.000111660855,0.0001214249,0.000039923823,0.00002550703,0.0000603221,0.00005830316,0.86956847,0.0006637441,0.12626699,0.0029861894,0.000016845972],"about_ca_topic_score_codex":0.0037871301,"about_ca_topic_score_gemma":0.0034282387,"teacher_disagreement_score":0.010416323,"about_ca_system_score_codex":0.0012741842,"about_ca_system_score_gemma":0.0016341943,"threshold_uncertainty_score":0.034846067},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01085078,0.012740095,0.8554113,0.0023419654,0.00079076283,0.0003660553,0.0016702192,0.0028260811,0.11300278],"genre_scores_gemma":[0.13562925,0.018290812,0.7745626,0.0009309799,0.0012619677,0.0012256164,0.0049327337,0.0028686377,0.060297407],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99516654,0.0012370886,0.00020155741,0.0006024085,0.0021318197,0.00066052406],"domain_scores_gemma":[0.9824212,0.011354063,0.0008187447,0.0032489381,0.0015889758,0.00056807324],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029055632,0.004052815,0.0035897135,0.004484266,0.0023293311,0.0106350975,0.009064327,0.003971642,0.043775383],"category_scores_gemma":[0.024833256,0.0027889158,0.0021468021,0.013435452,0.002898944,0.012657654,0.0069373935,0.009194988,0.014898292],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046237142,0.0003740572,0.00088532374,0.0012571053,0.00010012739,0.000120309494,0.00031020623,0.11334271,0.0019671272,0.40315324,0.099632,0.37839532],"study_design_scores_gemma":[0.0001353599,0.00009013585,0.00052732875,0.00027828928,0.0001365689,0.00032812264,0.00021980739,0.39344504,0.003136557,0.5518725,0.049761146,0.00006907411],"about_ca_topic_score_codex":0.0048809103,"about_ca_topic_score_gemma":0.008068037,"teacher_disagreement_score":0.043775383,"about_ca_system_score_codex":0.004331753,"about_ca_system_score_gemma":0.0027727806,"threshold_uncertainty_score":0.14644325},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011255272,0.00021294999,0.9795725,0.00012056186,0.00009600724,0.000034720026,0.000111605215,0.0005742923,0.008022138],"genre_scores_gemma":[0.17636418,0.00026337057,0.81468517,0.000094659714,0.00006971853,0.00014123505,0.00030609482,0.0003959677,0.007679526],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999708,0.00004402304,0.00001909195,0.000039974224,0.00014605322,0.000042841195],"domain_scores_gemma":[0.9994854,0.00026918243,0.00002000227,0.00007420024,0.00012528918,0.00002587363],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039691123,0.0006470399,0.0009685576,0.0007626895,0.00071196683,0.001243609,0.0017158247,0.0010500401,0.0093244715],"category_scores_gemma":[0.0034459434,0.00035945792,0.000652429,0.0012579706,0.00064080296,0.0015952658,0.0016522463,0.0011768787,0.002458392],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001355169,0.000086809545,0.00074138254,0.0004298823,0.000049489958,0.00019527951,0.0004158432,0.33147436,0.0058921715,0.35982096,0.009828625,0.29092962],"study_design_scores_gemma":[0.000045423803,0.000018493873,0.00011585014,0.000034199544,0.000013486541,0.000066992034,0.000074254334,0.89336824,0.0018396379,0.09722517,0.0071830433,0.000015166363],"about_ca_topic_score_codex":0.0033828346,"about_ca_topic_score_gemma":0.008911991,"teacher_disagreement_score":0.0093244715,"about_ca_system_score_codex":0.0008354683,"about_ca_system_score_gemma":0.0010189391,"threshold_uncertainty_score":0.031193435},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32881227,0.002018926,0.584306,0.00039894317,0.00026862798,0.00014300532,0.00049615203,0.0011601629,0.08239602],"genre_scores_gemma":[0.8429511,0.0014136063,0.14347526,0.00010816511,0.00009242391,0.00009963308,0.00083193893,0.00022392465,0.010803801],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994592,0.00006608868,0.00003404609,0.00014104367,0.00020616398,0.00009348404],"domain_scores_gemma":[0.99923563,0.00021652013,0.00014127929,0.00026222313,0.00006993199,0.000074468706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016972928,0.0003233184,0.00035345746,0.0007086425,0.00074259104,0.0010217977,0.00072073983,0.000335754,0.006612554],"category_scores_gemma":[0.0017446796,0.00033592098,0.0006002228,0.0007948061,0.0009886982,0.0017348636,0.0012693662,0.0007670939,0.0006127937],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023049238,0.00006418501,0.0027393596,0.00035539787,0.000053953925,0.0008657382,0.00073979225,0.2335109,0.0373426,0.44598448,0.004718002,0.27339503],"study_design_scores_gemma":[0.000046307738,0.00028581455,0.0036812767,0.0001448805,0.00005118526,0.0015482968,0.00068220013,0.4304186,0.028296264,0.4415178,0.093259975,0.00006737216],"about_ca_topic_score_codex":0.00084653305,"about_ca_topic_score_gemma":0.00085959287,"teacher_disagreement_score":0.006612554,"about_ca_system_score_codex":0.0007174809,"about_ca_system_score_gemma":0.00025578734,"threshold_uncertainty_score":0.02212125},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0110217845,0.000665251,0.98213583,0.0005231028,0.00016744349,0.00012546657,0.00022110026,0.0009484818,0.004191536],"genre_scores_gemma":[0.15474865,0.0006035796,0.8312834,0.00027701145,0.00019482477,0.00033922435,0.0015813106,0.0006622384,0.010309769],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99855715,0.000319191,0.00008902379,0.00035219584,0.0004395604,0.00024276982],"domain_scores_gemma":[0.99631006,0.0020622266,0.00022106271,0.0008645922,0.0003527038,0.00018928884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020671908,0.0014476749,0.0023691682,0.002154156,0.0015008294,0.0023522268,0.0038437997,0.0023287958,0.014419621],"category_scores_gemma":[0.012379842,0.0010557481,0.0018056682,0.0038927863,0.0015439953,0.0052015083,0.003847603,0.0038922578,0.0032244406],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006218466,0.00038445398,0.0021484932,0.000431437,0.00013535922,0.00015238149,0.00049989944,0.30305082,0.0019373927,0.19377528,0.042480733,0.4543819],"study_design_scores_gemma":[0.000057357032,0.000040252355,0.00012797248,0.000028822504,0.00001644225,0.00005753728,0.000063148655,0.89182323,0.0005558235,0.10195065,0.005266295,0.000012512006],"about_ca_topic_score_codex":0.009453599,"about_ca_topic_score_gemma":0.016410366,"teacher_disagreement_score":0.014419621,"about_ca_system_score_codex":0.0021216886,"about_ca_system_score_gemma":0.0018460689,"threshold_uncertainty_score":0.048238397},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046358436,0.0006969489,0.85631204,0.0006442202,0.0009743414,0.0001862685,0.00058663293,0.0013451918,0.09289593],"genre_scores_gemma":[0.28612614,0.000714983,0.68482137,0.00054435636,0.00017172114,0.00019036733,0.0013651084,0.0006208261,0.025445111],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993401,0.00009117508,0.00004557287,0.00008458299,0.0003486642,0.00008973415],"domain_scores_gemma":[0.99950695,0.00009941964,0.000043416614,0.00014258479,0.00015125632,0.00005647714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002917709,0.0003963947,0.00038500602,0.0007615638,0.0005587864,0.0011849001,0.00095920847,0.0011088554,0.013334192],"category_scores_gemma":[0.001487096,0.00034246626,0.00085036474,0.0005451085,0.00065874355,0.0011762684,0.0019022967,0.0012081296,0.0034013807],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037143868,0.000099155215,0.0019728164,0.00046369235,0.0000679393,0.0008911608,0.0004502551,0.072453,0.08669972,0.52304184,0.02173478,0.29175428],"study_design_scores_gemma":[0.000092477436,0.00036455778,0.0018147018,0.00019883706,0.000070656104,0.0023082548,0.00032252475,0.32327038,0.051079288,0.19109471,0.42927462,0.00010907401],"about_ca_topic_score_codex":0.00049478974,"about_ca_topic_score_gemma":0.0008742661,"teacher_disagreement_score":0.013334192,"about_ca_system_score_codex":0.00036136503,"about_ca_system_score_gemma":0.0003369825,"threshold_uncertainty_score":0.04460728},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21010539,0.003931437,0.62034804,0.0067327213,0.0007710396,0.00021810814,0.003328076,0.0017943046,0.15277089],"genre_scores_gemma":[0.6673085,0.004486247,0.26554966,0.0019627085,0.0014559941,0.0006753956,0.008576961,0.0020169013,0.04796753],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975079,0.00035947608,0.00012890871,0.0006211447,0.00079033815,0.000592277],"domain_scores_gemma":[0.9789274,0.012731154,0.0013713554,0.0021171535,0.0021549426,0.0026980436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029032102,0.00180777,0.0020427715,0.0053971903,0.0027046571,0.0040504658,0.0044144364,0.003485363,0.028345274],"category_scores_gemma":[0.024572859,0.00089700974,0.0017844773,0.0036800802,0.0027280333,0.008257196,0.005921785,0.006373247,0.005453515],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012114185,0.0003660711,0.008754188,0.0011268555,0.000192751,0.00058870873,0.0007480146,0.026293773,0.018432114,0.7813452,0.041316226,0.11962472],"study_design_scores_gemma":[0.00006226128,0.00029429968,0.0047643124,0.00025962671,0.00015533238,0.001227736,0.00030826993,0.10672253,0.007960173,0.85531676,0.022859737,0.000069097274],"about_ca_topic_score_codex":0.00083957426,"about_ca_topic_score_gemma":0.0014018227,"teacher_disagreement_score":0.028345274,"about_ca_system_score_codex":0.0013994637,"about_ca_system_score_gemma":0.00076770666,"threshold_uncertainty_score":0.09482443},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0068857837,0.004372492,0.92986554,0.0019158192,0.0030047596,0.00014212001,0.00037643997,0.00068296015,0.052754115],"genre_scores_gemma":[0.09113922,0.008452839,0.8340081,0.0014061877,0.00307876,0.00059965905,0.0009845269,0.0017598666,0.0585708],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986659,0.00033481958,0.00014684153,0.0002652397,0.0005094082,0.00007785661],"domain_scores_gemma":[0.99551576,0.002587082,0.00009377537,0.0011297708,0.0005287113,0.00014497587],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016580068,0.0014567968,0.0016848319,0.00088515313,0.0014263468,0.0016938653,0.0023563525,0.0013427498,0.010065959],"category_scores_gemma":[0.0059614247,0.001036574,0.002429113,0.0016212951,0.0021852737,0.0048147193,0.0032949804,0.006617211,0.004525561],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043091577,0.00011879161,0.0006168026,0.0010144467,0.000057746747,0.0008615156,0.00054804474,0.02305496,0.022293089,0.58876723,0.07216602,0.29007038],"study_design_scores_gemma":[0.000054046373,0.0002909138,0.0007373387,0.00039299586,0.00009385517,0.0015392627,0.00021196171,0.043892298,0.014181785,0.6020576,0.33646998,0.00007793788],"about_ca_topic_score_codex":0.00079150393,"about_ca_topic_score_gemma":0.0012068615,"teacher_disagreement_score":0.010065959,"about_ca_system_score_codex":0.0007622492,"about_ca_system_score_gemma":0.000559109,"threshold_uncertainty_score":0.03367406},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4408622,0.0030487417,0.43210408,0.002570109,0.00064999046,0.00007854811,0.0014132169,0.00041447981,0.118858606],"genre_scores_gemma":[0.91455054,0.0022271334,0.06327924,0.00018656382,0.0002620462,0.000068748486,0.0010102144,0.00020879912,0.018206637],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996406,0.00008707401,0.00001951169,0.00008156135,0.00009876955,0.00007245623],"domain_scores_gemma":[0.99884593,0.00046896332,0.00021077393,0.00014919948,0.00015548343,0.00016955877],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003760115,0.0003926303,0.0004366161,0.001293243,0.0007041657,0.001915526,0.00059779984,0.000697416,0.005475669],"category_scores_gemma":[0.0037337986,0.00032167078,0.00035743852,0.0010745928,0.0015475441,0.0022243094,0.0012470726,0.0011829495,0.0012126178],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013655788,0.000044459768,0.0028816336,0.00012671572,0.000019534009,0.00013722733,0.00028984004,0.011504767,0.0050025997,0.9057417,0.008017965,0.06609692],"study_design_scores_gemma":[0.000026636779,0.00004389481,0.0023744479,0.000060003673,0.000027265669,0.0004637925,0.00038466734,0.022600334,0.0034772467,0.9486038,0.021916509,0.000021368784],"about_ca_topic_score_codex":0.0010241425,"about_ca_topic_score_gemma":0.0017581886,"teacher_disagreement_score":0.005475669,"about_ca_system_score_codex":0.000656958,"about_ca_system_score_gemma":0.00034516913,"threshold_uncertainty_score":0.018317938},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5714482,0.0013621073,0.28300884,0.001411901,0.0005281607,0.00014528466,0.0026729112,0.0007039581,0.13871866],"genre_scores_gemma":[0.879718,0.00057048275,0.071410455,0.00031188707,0.00017130288,0.00011552165,0.002139034,0.00026565202,0.04529772],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99905246,0.00020341732,0.00006448693,0.00015827222,0.0002820095,0.00023936575],"domain_scores_gemma":[0.99870753,0.00062780094,0.00020395129,0.0001790354,0.00012228369,0.00015944251],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044082617,0.0005763628,0.00088854163,0.0020188084,0.002284284,0.0033982818,0.0015534475,0.0014465352,0.016500056],"category_scores_gemma":[0.0025839342,0.00059893384,0.00090791075,0.0019983782,0.002028168,0.0038714684,0.004669032,0.0018938602,0.0024702004],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024125303,0.00005229244,0.0012945125,0.00017289822,0.00003816981,0.0004758037,0.00052153587,0.0121491365,0.0027733573,0.9540675,0.0073101926,0.020903297],"study_design_scores_gemma":[0.00004492059,0.00004075193,0.0010105501,0.000063859276,0.000018348408,0.0005254697,0.00078421645,0.018267246,0.0023527874,0.96560204,0.011255758,0.000034050812],"about_ca_topic_score_codex":0.0015941353,"about_ca_topic_score_gemma":0.0019869297,"teacher_disagreement_score":0.016500056,"about_ca_system_score_codex":0.0012041132,"about_ca_system_score_gemma":0.00039810166,"threshold_uncertainty_score":0.055198193},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5365956,0.0011083692,0.4500891,0.0019896056,0.00016171254,0.00005956713,0.0007899058,0.00036224758,0.00884391],"genre_scores_gemma":[0.9501025,0.0010189038,0.04370599,0.00025355542,0.00017333409,0.0001077741,0.00067297404,0.00026738658,0.0036976547],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984668,0.00046535968,0.000066065266,0.0004334348,0.000326019,0.00024228853],"domain_scores_gemma":[0.9744334,0.019009931,0.0018059462,0.0019233879,0.0015759812,0.0012513696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002548624,0.0006038299,0.0009302146,0.0022267352,0.0012391779,0.002262612,0.002286664,0.00128571,0.0030270119],"category_scores_gemma":[0.0280668,0.0008433833,0.0006102351,0.0015305927,0.0027293297,0.0060192724,0.0023253297,0.0017097375,0.000414979],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00056257175,0.000105691004,0.01867681,0.0003865585,0.00013484221,0.00036789285,0.0009021778,0.37433606,0.011447794,0.54114574,0.0062370123,0.045696847],"study_design_scores_gemma":[0.00005258331,0.00008344048,0.0042133722,0.00006707688,0.000047274934,0.00040746917,0.00037276253,0.5299675,0.0047642444,0.45643178,0.0035407697,0.000051669533],"about_ca_topic_score_codex":0.0017796211,"about_ca_topic_score_gemma":0.0019736418,"teacher_disagreement_score":0.0030270119,"about_ca_system_score_codex":0.0016526491,"about_ca_system_score_gemma":0.0004998792,"threshold_uncertainty_score":0.013478577},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008945888,0.00038250434,0.97540945,0.0001980813,0.00013823068,0.000105273444,0.0012058811,0.0015766541,0.012037985],"genre_scores_gemma":[0.09614458,0.0006049654,0.8857255,0.00011775105,0.00006459965,0.00014347238,0.0037057544,0.00053588836,0.012957479],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996131,0.0000591875,0.0000332883,0.00007733697,0.00016024012,0.000056819346],"domain_scores_gemma":[0.9993716,0.00015923356,0.00006619119,0.00022356663,0.00013019054,0.000049235343],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002575898,0.00076917745,0.0004571224,0.0006176791,0.00045199716,0.0014666205,0.0010533761,0.0006516746,0.021283928],"category_scores_gemma":[0.0023260145,0.0005636732,0.0007991913,0.0013725655,0.00038038028,0.002501272,0.0014347223,0.0010071443,0.0051172357],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005079642,0.00014845836,0.001255297,0.0010958079,0.00010894177,0.00067598437,0.00044955735,0.06636015,0.043779805,0.2405891,0.08714865,0.55788034],"study_design_scores_gemma":[0.00015249242,0.00018619282,0.0015168671,0.00020723487,0.00009721586,0.0014361759,0.0001945481,0.35302022,0.037874803,0.39922515,0.20600335,0.000085758824],"about_ca_topic_score_codex":0.0009817362,"about_ca_topic_score_gemma":0.002384254,"teacher_disagreement_score":0.021283928,"about_ca_system_score_codex":0.00039367692,"about_ca_system_score_gemma":0.0002939266,"threshold_uncertainty_score":0.0712018},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09788179,0.0009538325,0.89122903,0.0007288042,0.00009635232,0.00009386109,0.00072549493,0.0024837009,0.0058069853],"genre_scores_gemma":[0.5046033,0.0006794982,0.4891387,0.0002502229,0.00006781507,0.00018661891,0.001242462,0.00037246285,0.003458994],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972615,0.00063491164,0.00023840791,0.0004095667,0.0010539474,0.00040173114],"domain_scores_gemma":[0.9926957,0.002676943,0.00078183104,0.0028512722,0.00075315626,0.00024115796],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001782518,0.000602506,0.0011216791,0.0010672042,0.00065669476,0.0025639432,0.00267966,0.0010032615,0.0052462523],"category_scores_gemma":[0.011593623,0.00046170733,0.00082406116,0.0021980465,0.0009524517,0.0052374676,0.004553969,0.0013310685,0.0011103585],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010484628,0.00022102152,0.0040278565,0.00052465877,0.000113641836,0.0003559676,0.0014183308,0.1866307,0.029841552,0.17457983,0.017148372,0.5840896],"study_design_scores_gemma":[0.000117789416,0.0003468997,0.001565991,0.0000857816,0.000042917334,0.00060159765,0.00071917236,0.82181203,0.031390425,0.12987626,0.013331898,0.000109125176],"about_ca_topic_score_codex":0.0017194649,"about_ca_topic_score_gemma":0.0009535404,"teacher_disagreement_score":0.0052462523,"about_ca_system_score_codex":0.000674516,"about_ca_system_score_gemma":0.0008140264,"threshold_uncertainty_score":0.017550468},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22544746,0.0026604212,0.38202995,0.0014733816,0.0003091514,0.00019580557,0.0008690216,0.0007591772,0.38625565],"genre_scores_gemma":[0.7738568,0.0039236303,0.11173308,0.0005867671,0.00026536055,0.00029043865,0.0016136114,0.0005186673,0.10721161],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996068,0.00009107217,0.000015434687,0.0000793605,0.00013846197,0.0000688024],"domain_scores_gemma":[0.9990226,0.00041970878,0.00010539068,0.00017211915,0.00016057718,0.00011968301],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031557586,0.0007579954,0.00058965094,0.001858074,0.0015607895,0.0020098859,0.0010987923,0.0011660418,0.012531956],"category_scores_gemma":[0.0022684808,0.0008007441,0.0004608532,0.0026874384,0.0012204273,0.0026344263,0.0017204144,0.002562747,0.001953706],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032407384,0.000026737225,0.00018884563,0.00009042878,0.0000077798195,0.0001441615,0.00022721007,0.0043477756,0.0018519382,0.96510804,0.0051287324,0.022845944],"study_design_scores_gemma":[0.00001213445,0.000012680113,0.0002499898,0.00003162312,0.000013396688,0.00028877286,0.00018625721,0.010801311,0.0011598364,0.97205275,0.015180908,0.000010466717],"about_ca_topic_score_codex":0.0015843592,"about_ca_topic_score_gemma":0.0022509154,"teacher_disagreement_score":0.012531956,"about_ca_system_score_codex":0.0008664915,"about_ca_system_score_gemma":0.0003322924,"threshold_uncertainty_score":0.041923583},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05128995,0.0010592161,0.901528,0.00051499583,0.00031321953,0.00018859972,0.0017252131,0.0022952058,0.04108568],"genre_scores_gemma":[0.4427691,0.0018062909,0.5143231,0.0004115748,0.00029837972,0.00030633542,0.0025371893,0.0010123575,0.036535602],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985501,0.00028251574,0.00012211107,0.00043753345,0.0003605559,0.0002471508],"domain_scores_gemma":[0.99697864,0.0010409203,0.0005009106,0.0007595821,0.00049079966,0.00022910863],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063990394,0.0007481816,0.00049287884,0.0017205554,0.0015358472,0.0038568566,0.0012850887,0.0010969328,0.016001036],"category_scores_gemma":[0.0050567705,0.00087899837,0.00097292714,0.0026624443,0.001887439,0.0041903844,0.0017203842,0.001307807,0.0025898372],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013602286,0.000036863603,0.0006576597,0.00022291127,0.000027193575,0.00014667434,0.00033134889,0.036071755,0.009067875,0.8757959,0.0073733325,0.07013237],"study_design_scores_gemma":[0.00008117419,0.00014578368,0.00089169596,0.00009220057,0.000039211784,0.0006010346,0.00027174098,0.08228307,0.008322716,0.8135882,0.093618125,0.00006504484],"about_ca_topic_score_codex":0.0018740249,"about_ca_topic_score_gemma":0.0023755447,"teacher_disagreement_score":0.016001036,"about_ca_system_score_codex":0.0021329832,"about_ca_system_score_gemma":0.00082540815,"threshold_uncertainty_score":0.053528845},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013707667,0.0006599698,0.977413,0.000328805,0.00011164363,0.000040133567,0.00009407049,0.00009800869,0.0075467373],"genre_scores_gemma":[0.50596404,0.0023202826,0.47685072,0.0002939642,0.00026114096,0.00026889265,0.00037734307,0.00040180297,0.013261804],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994438,0.00019377511,0.00004297029,0.00007843743,0.00019654019,0.0000443935],"domain_scores_gemma":[0.9977276,0.0016913705,0.00016378768,0.00011124955,0.0002106492,0.00009543926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011651497,0.0007557437,0.0012726627,0.0006378386,0.0004723771,0.0017764566,0.0006825624,0.0019101469,0.003552398],"category_scores_gemma":[0.00409522,0.0006200227,0.00080773176,0.00095043203,0.0011149899,0.0015576282,0.0019730201,0.0014971694,0.0005375763],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011689213,0.000062163825,0.00053865946,0.0002063075,0.00004112302,0.00011887295,0.00011184025,0.8748241,0.0031616683,0.06913834,0.0022931977,0.049386814],"study_design_scores_gemma":[0.00002477255,0.000028860031,0.00014179188,0.000019144896,0.00001034799,0.000062136096,0.00004210787,0.9572013,0.0010057384,0.038729418,0.0027176053,0.000016725187],"about_ca_topic_score_codex":0.0015369172,"about_ca_topic_score_gemma":0.0010781012,"teacher_disagreement_score":0.003552398,"about_ca_system_score_codex":0.0004374895,"about_ca_system_score_gemma":0.00061640056,"threshold_uncertainty_score":0.011883974},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022457875,0.0017046122,0.96453166,0.00028044704,0.00015973326,0.000047703437,0.0001340443,0.0001773808,0.010506499],"genre_scores_gemma":[0.42045018,0.0065147053,0.51042527,0.00021309804,0.0005806344,0.00043265938,0.00090924895,0.0007951445,0.059679005],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.99957937,0.00010406913,0.000030064546,0.00010186828,0.00014473558,0.000039839004],"domain_scores_gemma":[0.9992059,0.0005180724,0.00007746857,0.000086158434,0.00005993459,0.00005253346],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009003386,0.0012518555,0.0016873459,0.0009381813,0.0003886777,0.0014602941,0.0014075675,0.0010063123,0.007635797],"category_scores_gemma":[0.0029414853,0.0008867393,0.0010577801,0.0016687504,0.0009850853,0.0029370666,0.0020971838,0.0024167635,0.00084601453],"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.000115489915,0.000073735,0.00029011245,0.00030908946,0.00007930674,0.00008648888,0.000090381385,0.46920168,0.0036701101,0.40005007,0.0053230855,0.120710485],"study_design_scores_gemma":[0.000022740282,0.00006812765,0.00016840911,0.000035790126,0.00001959363,0.000050799525,0.00002967318,0.7188904,0.00097111665,0.27432323,0.0054097096,0.000010358493],"about_ca_topic_score_codex":0.0012457649,"about_ca_topic_score_gemma":0.0008394367,"teacher_disagreement_score":0.007635797,"about_ca_system_score_codex":0.0006318878,"about_ca_system_score_gemma":0.0004881104,"threshold_uncertainty_score":0.025544286},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9174395,0.00023573198,0.043357085,0.00069897453,0.00008097501,0.0000666515,0.0006375033,0.0003067013,0.03717687],"genre_scores_gemma":[0.9736363,0.00022996907,0.015756255,0.00021878502,0.00006213705,0.00005697081,0.0013240586,0.0002268613,0.008488648],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989592,0.00016644468,0.000085994674,0.000299599,0.0002484997,0.00024026274],"domain_scores_gemma":[0.99453944,0.0028679823,0.00081059337,0.00063833577,0.0002665226,0.00087715103],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008958615,0.0008498524,0.0012141458,0.0012447556,0.001662473,0.004230802,0.0021162552,0.001961516,0.018351834],"category_scores_gemma":[0.004307369,0.0011585393,0.0015212948,0.0015401044,0.0018181821,0.0033047807,0.0022813277,0.0024931747,0.0012957206],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012888429,0.00039574996,0.010823022,0.00046289994,0.00014888654,0.002009215,0.001760123,0.03715849,0.026128644,0.87582004,0.0065398715,0.037464272],"study_design_scores_gemma":[0.0003184632,0.00018627523,0.0063249646,0.000108824286,0.00015152853,0.0012885527,0.001002444,0.06375861,0.013502951,0.9077241,0.005549337,0.00008394961],"about_ca_topic_score_codex":0.0013315603,"about_ca_topic_score_gemma":0.0015377655,"teacher_disagreement_score":0.018351834,"about_ca_system_score_codex":0.0011527537,"about_ca_system_score_gemma":0.00071723235,"threshold_uncertainty_score":0.061392963},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033295774,0.00009742512,0.9948672,0.000050172974,0.000012870307,0.000014310606,0.0000446143,0.00046736395,0.001116493],"genre_scores_gemma":[0.13051242,0.00040982172,0.8650031,0.000041229905,0.000032512497,0.00006632055,0.00035690665,0.0003897335,0.0031879393],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993006,0.0000779318,0.000025308475,0.00010086163,0.0004481305,0.000047188936],"domain_scores_gemma":[0.9996031,0.00009758969,0.000040827417,0.00014300582,0.000095763855,0.00001962831],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042524462,0.0006966421,0.0008010704,0.0010810472,0.00035515666,0.0013971367,0.001063322,0.0010192567,0.004251536],"category_scores_gemma":[0.0011206799,0.0007639555,0.0013662128,0.0009945385,0.00034127862,0.001682897,0.0016516965,0.0011901922,0.001601084],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000117769836,0.00006348742,0.0009118053,0.00028342512,0.0001080626,0.0005146095,0.0003915697,0.50701433,0.14402084,0.05207078,0.0042871656,0.2902162],"study_design_scores_gemma":[0.000010807164,0.000034965557,0.00029856004,0.000019501507,0.000021283462,0.0004051234,0.000039499457,0.96250683,0.020730076,0.0075568473,0.008347431,0.000029140385],"about_ca_topic_score_codex":0.0014203915,"about_ca_topic_score_gemma":0.002001219,"teacher_disagreement_score":0.004251536,"about_ca_system_score_codex":0.00038340417,"about_ca_system_score_gemma":0.00063448393,"threshold_uncertainty_score":0.014222801},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35660768,0.00018870953,0.63878447,0.00016816442,0.00004000392,0.00012802647,0.0003860807,0.00084787514,0.0028490566],"genre_scores_gemma":[0.6703159,0.00010621753,0.32665625,0.000025954638,0.000016384864,0.000100595236,0.0010666732,0.00015995123,0.0015520307],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99939644,0.000073195115,0.000030514298,0.00017152667,0.00022837802,0.00009997375],"domain_scores_gemma":[0.99882454,0.0005813093,0.00017266664,0.00012628864,0.00018013574,0.00011504052],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000534057,0.0008080286,0.00105172,0.0014228759,0.000645528,0.0011560391,0.0015597964,0.0014451377,0.0033959632],"category_scores_gemma":[0.004265007,0.0007442945,0.0010129624,0.0011017281,0.00073596544,0.0020090998,0.0017749589,0.0007466314,0.00075019634],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021958376,0.00004561753,0.0074133025,0.00013030146,0.00007672669,0.000604979,0.0002608064,0.9265313,0.008175747,0.0050639305,0.00075670937,0.05072096],"study_design_scores_gemma":[0.000015591671,0.000051904324,0.0009798023,0.000011376429,0.000009024395,0.000101451275,0.0002463037,0.9881146,0.002607275,0.00719042,0.00065998425,0.000012301264],"about_ca_topic_score_codex":0.0037707137,"about_ca_topic_score_gemma":0.003437003,"teacher_disagreement_score":0.0037707137,"about_ca_system_score_codex":0.00077930593,"about_ca_system_score_gemma":0.00069208874,"threshold_uncertainty_score":0.011360645},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003682776,0.00050708436,0.9921034,0.000078148485,0.000056033092,0.000055240875,0.00034950452,0.0011418401,0.0020260764],"genre_scores_gemma":[0.20793575,0.0013372474,0.78451973,0.00012717019,0.00008537135,0.0004724644,0.0016564629,0.0008735575,0.0029922442],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99909484,0.00026080405,0.000067700836,0.00015767058,0.00033215547,0.0000868667],"domain_scores_gemma":[0.9987998,0.000629999,0.00007047601,0.00016287727,0.00023999703,0.000096751966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008747335,0.0008722903,0.0018027168,0.001651302,0.0008855247,0.0023492991,0.0023478197,0.0012844934,0.004496399],"category_scores_gemma":[0.0034171687,0.0006368503,0.0021038684,0.0018742809,0.00089585205,0.0016286783,0.0032163467,0.0011895372,0.0015439072],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013748856,0.000046075962,0.0015039595,0.0002997954,0.000090064415,0.00013857338,0.00028232744,0.8316359,0.0036289785,0.07385198,0.004886026,0.08349884],"study_design_scores_gemma":[0.000014209598,0.000012742442,0.00010614658,0.000018625797,0.000008812588,0.000043594926,0.000022743996,0.9712639,0.00082640204,0.018650295,0.0090184035,0.000014118756],"about_ca_topic_score_codex":0.012064744,"about_ca_topic_score_gemma":0.008427079,"teacher_disagreement_score":0.012064744,"about_ca_system_score_codex":0.0013697115,"about_ca_system_score_gemma":0.0016469299,"threshold_uncertainty_score":0.023989081},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82597744,0.00046207785,0.13839233,0.0023097757,0.0002928126,0.000116050476,0.0029188653,0.0009492966,0.02858132],"genre_scores_gemma":[0.9287704,0.0003400503,0.044158656,0.00032539052,0.0002905455,0.00018160781,0.0058567007,0.0005113037,0.019565292],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982753,0.00020373357,0.00017528496,0.00031580435,0.0006626753,0.0003671421],"domain_scores_gemma":[0.992063,0.0036938519,0.0010668834,0.000979881,0.0012247881,0.0009716279],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083795947,0.0006205592,0.0011841852,0.0052725887,0.002004283,0.00556488,0.0018470752,0.001996269,0.01233516],"category_scores_gemma":[0.009139635,0.0006742946,0.001066322,0.004882988,0.0026518297,0.005336557,0.0036663848,0.0028917608,0.0018408344],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011797041,0.00033635757,0.023415267,0.0003301316,0.00009006538,0.000309855,0.0016184002,0.014729297,0.009350081,0.8031083,0.02110975,0.12442289],"study_design_scores_gemma":[0.00009421798,0.00014187268,0.008695729,0.00015392498,0.00007089106,0.00036936798,0.0015072987,0.14695132,0.006226191,0.80895704,0.026749862,0.00008236622],"about_ca_topic_score_codex":0.0030247534,"about_ca_topic_score_gemma":0.003064164,"teacher_disagreement_score":0.01233516,"about_ca_system_score_codex":0.0016265902,"about_ca_system_score_gemma":0.0010262082,"threshold_uncertainty_score":0.04126519},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008101782,0.0015831477,0.93122315,0.00029429697,0.00049727573,0.00013793146,0.00022763226,0.00075138325,0.057183355],"genre_scores_gemma":[0.1472572,0.0050256453,0.80780196,0.00038959205,0.00038235117,0.00030248286,0.0015977729,0.0011261587,0.036116928],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994512,0.000061137296,0.000029919005,0.00008317344,0.00031098578,0.000063650565],"domain_scores_gemma":[0.9998091,0.00005792037,0.000014091962,0.00007300117,0.000037016893,0.000008895168],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043736256,0.00057589775,0.00083558337,0.0007597943,0.0006035005,0.0018990962,0.0010755438,0.00054600084,0.014680109],"category_scores_gemma":[0.0010576955,0.00046884446,0.0015266635,0.0012560041,0.0011651086,0.002138375,0.0016376894,0.0024963976,0.0047712196],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031190644,0.000050900115,0.00011462951,0.0005048677,0.000023277604,0.00017033225,0.00017133485,0.020880682,0.007891422,0.68358266,0.014902986,0.27167568],"study_design_scores_gemma":[0.000034632492,0.00007354724,0.00018992113,0.0001663357,0.000026969548,0.0008604725,0.0001440433,0.095643744,0.011898583,0.73924035,0.1516828,0.0000386318],"about_ca_topic_score_codex":0.00053497223,"about_ca_topic_score_gemma":0.0006224319,"teacher_disagreement_score":0.014680109,"about_ca_system_score_codex":0.00055017904,"about_ca_system_score_gemma":0.00046495371,"threshold_uncertainty_score":0.049109876},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019901654,0.00042232798,0.9639416,0.00021532421,0.00006954023,0.00023412376,0.00048409504,0.0049728123,0.009758586],"genre_scores_gemma":[0.117258966,0.00034610293,0.871944,0.00008232331,0.00006299901,0.00030523152,0.0022564195,0.00086122006,0.006882714],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988691,0.00010720991,0.00006966502,0.00020760442,0.0005545761,0.00019182407],"domain_scores_gemma":[0.99799514,0.0010759587,0.00014169725,0.00036319892,0.0003246184,0.00009936169],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005143684,0.0025808197,0.0018767954,0.0021514783,0.0012979544,0.0032412782,0.0028784247,0.0013969077,0.022390334],"category_scores_gemma":[0.003853613,0.0011475447,0.0017211344,0.00393987,0.0012074697,0.004092601,0.003214444,0.002838354,0.006076983],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00062728557,0.00035700575,0.0012533658,0.0006241322,0.00013421009,0.00021150205,0.00052420446,0.17096649,0.014348215,0.05459089,0.029181404,0.7271813],"study_design_scores_gemma":[0.0001949784,0.00013203724,0.000444005,0.00003886655,0.000050590697,0.00013965489,0.00032898356,0.91539997,0.009074358,0.06565014,0.008516591,0.000029851331],"about_ca_topic_score_codex":0.008656547,"about_ca_topic_score_gemma":0.016908104,"teacher_disagreement_score":0.022390334,"about_ca_system_score_codex":0.0016120686,"about_ca_system_score_gemma":0.001671966,"threshold_uncertainty_score":0.07490313},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18612038,0.0018821224,0.75466883,0.007080497,0.0003200844,0.00036729613,0.0043684747,0.0014577637,0.043734584],"genre_scores_gemma":[0.7094086,0.001982894,0.26721162,0.0010629073,0.0005009481,0.00047776644,0.0053695138,0.0006306259,0.013355132],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99839896,0.00032581313,0.00010398629,0.00042944917,0.00043090023,0.00031087827],"domain_scores_gemma":[0.99423236,0.003988517,0.0005400587,0.0007515444,0.0002062092,0.00028121393],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009401799,0.0012202621,0.0011684262,0.00073041325,0.0013235606,0.0025777111,0.0025833051,0.0017262183,0.010255927],"category_scores_gemma":[0.007708913,0.00094135676,0.0020083457,0.0014483375,0.001996592,0.0085748425,0.003716929,0.0040882365,0.0009084157],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006961319,0.00040324192,0.005421305,0.0015551032,0.00017559323,0.0008723701,0.0012358105,0.35537753,0.007554837,0.48222756,0.037864152,0.10661641],"study_design_scores_gemma":[0.00016155759,0.00014538887,0.0014122691,0.000111185785,0.00008339304,0.0005559236,0.0005098232,0.4254727,0.0030682024,0.54914504,0.019283913,0.000050678933],"about_ca_topic_score_codex":0.0033536495,"about_ca_topic_score_gemma":0.0036166732,"teacher_disagreement_score":0.010255927,"about_ca_system_score_codex":0.0015269455,"about_ca_system_score_gemma":0.0012228284,"threshold_uncertainty_score":0.034309506},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010963515,0.0018709549,0.8789281,0.00027007077,0.00055580377,0.00006145832,0.00023192183,0.0007291946,0.106389],"genre_scores_gemma":[0.22368519,0.003432931,0.6260672,0.00031743015,0.00028365388,0.0001734919,0.0007730266,0.0009890962,0.14427799],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99980575,0.000025869782,0.000006212906,0.000042839703,0.000098769015,0.000020574993],"domain_scores_gemma":[0.9998252,0.000059720158,0.000011119362,0.000045583034,0.00004302983,0.000015462358],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031564868,0.00073160336,0.0006553412,0.0007201775,0.0004665591,0.0013418001,0.00088556524,0.00085353275,0.016908666],"category_scores_gemma":[0.0006083562,0.00063563633,0.00053341594,0.0006041684,0.00086488714,0.0010951437,0.0013651625,0.001789274,0.0040761284],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014637534,0.000033183405,0.00026418426,0.00029495318,0.000037925383,0.00019385424,0.00018783139,0.075841255,0.017925572,0.5546095,0.025512861,0.32495248],"study_design_scores_gemma":[0.00003671272,0.00010698433,0.0006250991,0.00024131927,0.000041143438,0.0011739766,0.00017979021,0.30850515,0.015952649,0.48904645,0.1840371,0.000053590997],"about_ca_topic_score_codex":0.0004844959,"about_ca_topic_score_gemma":0.0009261139,"teacher_disagreement_score":0.016908666,"about_ca_system_score_codex":0.00044204443,"about_ca_system_score_gemma":0.00033649086,"threshold_uncertainty_score":0.056565166},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11750832,0.00029556747,0.8722424,0.00014904734,0.00015771191,0.00008476375,0.00009866696,0.0015254682,0.007938074],"genre_scores_gemma":[0.5772354,0.00019742857,0.41760352,0.00007424496,0.000032292694,0.00009380611,0.0001537944,0.000445772,0.004163721],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99951684,0.00011953206,0.000035118137,0.0001189614,0.00014455836,0.00006504425],"domain_scores_gemma":[0.9985858,0.0004930398,0.00011020663,0.00061795535,0.00011140867,0.000081594575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005422584,0.0007015176,0.00077867456,0.0013011589,0.0006269905,0.00086590135,0.0013718904,0.0010841783,0.005564249],"category_scores_gemma":[0.0036387397,0.00069852883,0.00072229624,0.001248236,0.0013509619,0.0018261274,0.0029030943,0.0009784456,0.001113113],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006544911,0.0001397203,0.002395109,0.00025846623,0.000095506315,0.00062006636,0.0010277744,0.32777655,0.06391143,0.082803324,0.0050748647,0.51524264],"study_design_scores_gemma":[0.00010007143,0.00022091673,0.000837522,0.000051315936,0.000063061314,0.0005635875,0.00037127384,0.84069544,0.026126098,0.11877707,0.0121275345,0.00006611278],"about_ca_topic_score_codex":0.00078274286,"about_ca_topic_score_gemma":0.0012714971,"teacher_disagreement_score":0.005564249,"about_ca_system_score_codex":0.00029195816,"about_ca_system_score_gemma":0.00023633741,"threshold_uncertainty_score":0.018614233},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027017945,0.0011569519,0.95602554,0.00034494165,0.0001136386,0.00025969476,0.0039531733,0.0056874333,0.0054406617],"genre_scores_gemma":[0.26811144,0.0010741606,0.7073989,0.00066613575,0.00023982179,0.0009324645,0.013531246,0.0013293131,0.006716463],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978878,0.00034037212,0.00021337658,0.0003396787,0.0009929251,0.00022584976],"domain_scores_gemma":[0.99375784,0.002089402,0.0005939918,0.0020388823,0.0012468407,0.0002730511],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012259663,0.00047171925,0.0011814209,0.0019185425,0.00077277014,0.0016873418,0.0016257494,0.0008665419,0.008014124],"category_scores_gemma":[0.011115386,0.0005509972,0.0008356399,0.0034799548,0.0005523686,0.0050290604,0.002598617,0.0009924391,0.003741942],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016269323,0.00028602933,0.006539477,0.000691895,0.00014305185,0.00044076392,0.00039721277,0.039439145,0.04118219,0.13470218,0.045321237,0.7292299],"study_design_scores_gemma":[0.00045680336,0.0009905302,0.003966232,0.00031875435,0.00016887959,0.0023279048,0.0003872042,0.39350724,0.057483543,0.3970901,0.14306347,0.00023936998],"about_ca_topic_score_codex":0.0010261011,"about_ca_topic_score_gemma":0.0017893839,"teacher_disagreement_score":0.008014124,"about_ca_system_score_codex":0.00047323343,"about_ca_system_score_gemma":0.001149525,"threshold_uncertainty_score":0.026809871},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007404855,0.066916876,0.90185183,0.0010824723,0.00048909365,0.00010185032,0.0004873258,0.00079183775,0.020873917],"genre_scores_gemma":[0.070792995,0.1679996,0.74127835,0.00048576973,0.0009842069,0.00027704958,0.0020262983,0.0011577889,0.014998021],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99920505,0.00015914312,0.00007495569,0.00016671125,0.00035753427,0.0000366614],"domain_scores_gemma":[0.99916327,0.00038843736,0.000051216404,0.00014294399,0.00020091908,0.000053186846],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008846742,0.0011866139,0.0016601977,0.0040501733,0.0010155205,0.002849762,0.0020968735,0.0017490275,0.0071635484],"category_scores_gemma":[0.0031617123,0.0013586896,0.00126462,0.007559545,0.001276702,0.00463613,0.0024984134,0.0021355962,0.0030751051],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000435903,0.000053550604,0.00075981265,0.0018962458,0.000050307815,0.00009432698,0.00026698987,0.051069934,0.0019979803,0.37255612,0.015124264,0.55608684],"study_design_scores_gemma":[0.000026328946,0.00009509,0.0005961762,0.0007049594,0.000040172734,0.0005125552,0.00012666418,0.174295,0.002234041,0.53553724,0.28577447,0.000057312023],"about_ca_topic_score_codex":0.0019817557,"about_ca_topic_score_gemma":0.002174009,"teacher_disagreement_score":0.0071635484,"about_ca_system_score_codex":0.0012565108,"about_ca_system_score_gemma":0.0011689367,"threshold_uncertainty_score":0.023964465},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011251285,0.00071585854,0.9059884,0.00022582528,0.0003755045,0.00012586608,0.0003947085,0.0059687574,0.07495375],"genre_scores_gemma":[0.14311804,0.0017494974,0.7388786,0.00025758753,0.00015088421,0.00020909398,0.0016443826,0.0051144636,0.108877406],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999501,0.000060439794,0.000020691392,0.00007452862,0.0002955963,0.00004767817],"domain_scores_gemma":[0.9994529,0.00014354615,0.00002648546,0.00022175667,0.00012074904,0.000034671706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026955135,0.0014849704,0.0007325075,0.0012168469,0.0006503695,0.001608988,0.0014048999,0.0011295144,0.05795723],"category_scores_gemma":[0.0017609047,0.0009896802,0.00097543537,0.0011323905,0.0006131898,0.0016741818,0.0024101003,0.002771444,0.015533005],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009216251,0.00010614316,0.00034611832,0.0004143982,0.000036095968,0.00025933946,0.00045775005,0.026661858,0.0413328,0.1940565,0.04702119,0.6892156],"study_design_scores_gemma":[0.00007290131,0.00022038049,0.00071398955,0.00025589098,0.00009147737,0.0016946128,0.00037104596,0.21643911,0.06716697,0.20466998,0.50821596,0.00008765528],"about_ca_topic_score_codex":0.0008699002,"about_ca_topic_score_gemma":0.0018118514,"teacher_disagreement_score":0.05795723,"about_ca_system_score_codex":0.00036883377,"about_ca_system_score_gemma":0.00024113116,"threshold_uncertainty_score":0.19388628},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49112445,0.0054539978,0.20194559,0.0042420058,0.0012406631,0.0001249157,0.0006717687,0.00097549136,0.294221],"genre_scores_gemma":[0.90037245,0.003782196,0.03458129,0.00076579826,0.00088832545,0.0001255703,0.0005646341,0.0009564321,0.057963368],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99963284,0.000075720214,0.000013109651,0.00008195392,0.00012511422,0.00007125857],"domain_scores_gemma":[0.9987979,0.0006179422,0.00014658138,0.00016768945,0.000120981145,0.000148909],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005814626,0.0008776986,0.00070653384,0.0016723736,0.0009905343,0.0014407542,0.0010280953,0.00086499675,0.018366508],"category_scores_gemma":[0.0035169171,0.0004717474,0.0006400284,0.0016019592,0.0020786093,0.003154993,0.001446717,0.0027490621,0.002092652],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002603665,0.000053297248,0.0008420619,0.00019087225,0.000021255713,0.0001567236,0.00038085307,0.013317472,0.0048325052,0.9126704,0.008675532,0.05859868],"study_design_scores_gemma":[0.000032852044,0.000055994286,0.000733329,0.00004460381,0.000021266982,0.00015620729,0.00013989705,0.019403836,0.00128843,0.9677826,0.010319228,0.000021777669],"about_ca_topic_score_codex":0.0023446153,"about_ca_topic_score_gemma":0.0022840241,"teacher_disagreement_score":0.018366508,"about_ca_system_score_codex":0.0012027732,"about_ca_system_score_gemma":0.0004609731,"threshold_uncertainty_score":0.061442137},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42575267,0.00027096627,0.5620812,0.0005933576,0.00012505494,0.0003428122,0.00028339837,0.00058929273,0.009961278],"genre_scores_gemma":[0.8746708,0.00013164917,0.11719675,0.000119140364,0.000030020987,0.00014064243,0.00035825686,0.0000979921,0.007254678],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982804,0.00043775374,0.00007387453,0.00034446875,0.0005128021,0.00035066716],"domain_scores_gemma":[0.9966677,0.0015695355,0.0005439563,0.00067905564,0.00028433112,0.0002555316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012003067,0.00044052626,0.0008319169,0.0006308571,0.0011059485,0.0012533887,0.0012885879,0.0011880803,0.010153955],"category_scores_gemma":[0.005927761,0.00047637988,0.00096943375,0.0008948449,0.001920982,0.0018172588,0.0017103235,0.0012314909,0.0012185507],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018074844,0.00036762477,0.006667229,0.00022579436,0.00015203375,0.0009584644,0.00029927373,0.7559163,0.016692992,0.14391041,0.0034422963,0.06956006],"study_design_scores_gemma":[0.00021429658,0.00025955943,0.0011624144,0.000032004195,0.000034690795,0.00016782229,0.0001499947,0.9339766,0.012751812,0.047302347,0.003904855,0.0000436348],"about_ca_topic_score_codex":0.004499533,"about_ca_topic_score_gemma":0.0033726466,"teacher_disagreement_score":0.010153955,"about_ca_system_score_codex":0.001042897,"about_ca_system_score_gemma":0.0007740957,"threshold_uncertainty_score":0.03396833},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02979256,0.0004353659,0.95864314,0.00034223087,0.00009679823,0.00020710124,0.00020401082,0.0014936011,0.0087852655],"genre_scores_gemma":[0.3740444,0.00032424708,0.6017105,0.00046325594,0.00017632019,0.00055128,0.0013488295,0.00081605546,0.020565199],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985759,0.0005106864,0.000053158114,0.000309655,0.00041163195,0.00013882254],"domain_scores_gemma":[0.99563086,0.0027341344,0.00022339118,0.0006497493,0.0005240887,0.00023781092],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024110787,0.00096904166,0.0014118913,0.001653277,0.0010968642,0.0013399816,0.0026739365,0.0015934403,0.016703239],"category_scores_gemma":[0.01425851,0.00064794795,0.00086896954,0.0012077091,0.0012755364,0.0016676808,0.0030434653,0.0022438895,0.0031523202],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042456086,0.00024153774,0.0030793503,0.00018366444,0.00010142217,0.00015209438,0.0003604621,0.5713972,0.0028650113,0.12595241,0.009815575,0.28542677],"study_design_scores_gemma":[0.000091491806,0.00011068282,0.00038834152,0.000033213553,0.000020360898,0.00006499593,0.000045281493,0.9164998,0.0011447776,0.076142706,0.005443437,0.0000148251775],"about_ca_topic_score_codex":0.0028121262,"about_ca_topic_score_gemma":0.006423256,"teacher_disagreement_score":0.016703239,"about_ca_system_score_codex":0.0010510575,"about_ca_system_score_gemma":0.00096614746,"threshold_uncertainty_score":0.055877924},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09000847,0.004179609,0.79011416,0.0013717226,0.0006428236,0.00006010085,0.00041998047,0.00017868569,0.113024525],"genre_scores_gemma":[0.6535954,0.0065512457,0.28150758,0.0005260024,0.0013374025,0.00019821996,0.0010649746,0.00077182153,0.054447375],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99913114,0.00018992259,0.000049231432,0.00015770878,0.0003972643,0.00007477752],"domain_scores_gemma":[0.99619824,0.0023643237,0.00020939964,0.00023578444,0.00073316845,0.0002590519],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011547161,0.0008865965,0.00082082604,0.0033908547,0.001226024,0.0020530499,0.0020680635,0.0011247377,0.006278194],"category_scores_gemma":[0.008766379,0.000787395,0.00093537336,0.0028177584,0.003075149,0.0051420475,0.0019629223,0.004684832,0.0010392363],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035613957,0.00001699756,0.00028469207,0.00008013424,0.000009739109,0.000053104333,0.00013531753,0.012381417,0.0014872565,0.9494558,0.002518157,0.033541895],"study_design_scores_gemma":[0.000005934734,0.00001680646,0.00036405426,0.000026144526,0.0000061960027,0.00008084276,0.00006373853,0.042814434,0.0009121491,0.947506,0.008190425,0.000013179748],"about_ca_topic_score_codex":0.0014431841,"about_ca_topic_score_gemma":0.0012859011,"teacher_disagreement_score":0.006278194,"about_ca_system_score_codex":0.0014235697,"about_ca_system_score_gemma":0.0005119777,"threshold_uncertainty_score":0.02100265},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.56135386,0.0008071638,0.28542337,0.0022324913,0.00035762298,0.0003059972,0.003245695,0.0008499769,0.1454238],"genre_scores_gemma":[0.8868744,0.00054801157,0.062389016,0.000515504,0.00021134218,0.00022651984,0.0024602676,0.00060437043,0.046170596],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99965477,0.000090298,0.000018075554,0.00007646635,0.00009812483,0.00006230268],"domain_scores_gemma":[0.99876046,0.0005729351,0.00013833167,0.00012788575,0.00021073196,0.00018959033],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034633963,0.0004915876,0.0005271032,0.0019844717,0.0011370286,0.0023773205,0.00085877295,0.0008870351,0.02144401],"category_scores_gemma":[0.0031308925,0.00054878904,0.0005646002,0.0016350844,0.00095929665,0.003046973,0.0014692533,0.0014786216,0.0016771492],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000111524074,0.00008687832,0.00035537063,0.00014105174,0.00001590124,0.00011620971,0.00027211674,0.006480421,0.0012865051,0.95926946,0.007151697,0.024712881],"study_design_scores_gemma":[0.000029028864,0.000012316742,0.0001415744,0.000020697144,0.000009737343,0.00008159737,0.00008381017,0.0175914,0.000655468,0.9766311,0.0047354144,0.000007729858],"about_ca_topic_score_codex":0.0009869077,"about_ca_topic_score_gemma":0.0014417912,"teacher_disagreement_score":0.02144401,"about_ca_system_score_codex":0.00073563383,"about_ca_system_score_gemma":0.00040248214,"threshold_uncertainty_score":0.07173741},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018680932,0.00033364,0.98874503,0.000052599604,0.00010513938,0.000029515357,0.00005148193,0.0006326786,0.008181734],"genre_scores_gemma":[0.06473451,0.00075380685,0.90914303,0.00016056119,0.00004828854,0.00009929903,0.000327837,0.0012055723,0.023527117],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99976104,0.000026139733,0.000009757369,0.000040477284,0.00014473688,0.000017888247],"domain_scores_gemma":[0.99979705,0.000057715166,0.000009259832,0.00006685314,0.000057940004,0.000011148854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003403914,0.00068767124,0.0009032001,0.0006607201,0.0003461282,0.000867601,0.0015146631,0.0007484782,0.009771128],"category_scores_gemma":[0.00075110485,0.00055790105,0.00063123385,0.00086091546,0.0004919959,0.00083019974,0.0014909089,0.0013617858,0.0035874832],"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.00006439662,0.000062218685,0.00022705775,0.00037690657,0.00006319469,0.00009883177,0.00016180324,0.22583151,0.040927555,0.09017703,0.025846051,0.61616343],"study_design_scores_gemma":[0.000008682721,0.000019205254,0.00009773503,0.000030572854,0.000012954476,0.00017697275,0.00001909613,0.93197733,0.0076420885,0.029695118,0.03030324,0.000017006101],"about_ca_topic_score_codex":0.0009897329,"about_ca_topic_score_gemma":0.0017199641,"teacher_disagreement_score":0.009771128,"about_ca_system_score_codex":0.00031616038,"about_ca_system_score_gemma":0.00040959226,"threshold_uncertainty_score":0.032687724},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5543017,0.0028363925,0.41928452,0.00073582766,0.00007839646,0.000084500665,0.000265469,0.00027686916,0.022136306],"genre_scores_gemma":[0.98755264,0.0006651624,0.009960116,0.000031440115,0.00004922235,0.000035144498,0.00010419895,0.000050198058,0.0015518026],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99957377,0.00014876724,0.000019695013,0.00006130799,0.00015784489,0.00003863937],"domain_scores_gemma":[0.99480504,0.0035883214,0.0005837302,0.0003194232,0.0005583046,0.00014514966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009101662,0.00030962302,0.0005868406,0.0010026834,0.0005065765,0.000923167,0.00070265844,0.0005126836,0.0015278879],"category_scores_gemma":[0.007401511,0.0003670431,0.00022415549,0.0009401735,0.000820907,0.0014276094,0.00077779393,0.00048488448,0.00023347774],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038518413,0.00006740955,0.0049958467,0.00026740952,0.000058231388,0.0005330768,0.0006746503,0.7692206,0.02626166,0.14231038,0.0029794401,0.052246116],"study_design_scores_gemma":[0.000016639015,0.00009186094,0.0014076118,0.000017483979,0.000026317844,0.00025713426,0.00019784273,0.96022433,0.0022639527,0.03454667,0.0009269445,0.000023191908],"about_ca_topic_score_codex":0.0013141325,"about_ca_topic_score_gemma":0.0008518257,"teacher_disagreement_score":0.0015278879,"about_ca_system_score_codex":0.00056366564,"about_ca_system_score_gemma":0.00026030678,"threshold_uncertainty_score":0.005111277},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9374087,0.00027214157,0.013261709,0.00024598886,0.00008244436,0.000016922462,0.00044740902,0.00022464861,0.04804001],"genre_scores_gemma":[0.9875888,0.00017620435,0.0075499252,0.000056276574,0.000014579885,0.00001819655,0.00056446536,0.00010747289,0.003924088],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99931204,0.000080053665,0.000041850955,0.00017225195,0.00021471539,0.00017920579],"domain_scores_gemma":[0.9977697,0.0006219426,0.00057213294,0.0003811053,0.00027825465,0.00037697828],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041279948,0.00032698805,0.0002753702,0.0010675397,0.0008353442,0.0021319005,0.0005504403,0.0005170994,0.00948527],"category_scores_gemma":[0.0025721814,0.00033773688,0.00029590857,0.0010468983,0.00097206683,0.0012005355,0.00047206832,0.00079108553,0.0012135775],"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.0016483922,0.00036418703,0.05159509,0.0005045471,0.00020493209,0.0019156501,0.0008153121,0.048553627,0.28576267,0.43511048,0.02776196,0.14576317],"study_design_scores_gemma":[0.00007798819,0.00038779477,0.11143484,0.00015763672,0.00024301298,0.0067211497,0.0018505076,0.1386405,0.310111,0.34653324,0.0836139,0.00022842808],"about_ca_topic_score_codex":0.00077622937,"about_ca_topic_score_gemma":0.0010271994,"teacher_disagreement_score":0.00948527,"about_ca_system_score_codex":0.0011819111,"about_ca_system_score_gemma":0.00041950512,"threshold_uncertainty_score":0.031731427},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05956268,0.014001576,0.7739555,0.003917886,0.0020112512,0.00010753856,0.0005019674,0.00036134842,0.14558022],"genre_scores_gemma":[0.29473615,0.008788959,0.5832585,0.0011563869,0.002125533,0.00033391413,0.00089236017,0.00065100665,0.108057104],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992022,0.00026050198,0.000041701227,0.00020251147,0.00020625256,0.00008683776],"domain_scores_gemma":[0.9987889,0.00073629734,0.000086183936,0.00019143878,0.00010689422,0.00009024956],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010035884,0.0010758677,0.0015664188,0.0007688935,0.0010888873,0.0019838307,0.0020003095,0.0019088901,0.009477441],"category_scores_gemma":[0.003887219,0.00079946476,0.00093011174,0.0016286738,0.002489198,0.0043515367,0.0023136826,0.0030650366,0.0014168418],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014034401,0.000063535634,0.00021724224,0.00044110423,0.00003432659,0.00010775912,0.00020198208,0.035654005,0.0010099928,0.82698107,0.031194372,0.103954315],"study_design_scores_gemma":[0.000036672864,0.000032230382,0.00021748613,0.00006222412,0.000014425774,0.00019216984,0.00014708271,0.07314105,0.0005776149,0.9038081,0.02174561,0.0000252847],"about_ca_topic_score_codex":0.0012899842,"about_ca_topic_score_gemma":0.0015497104,"teacher_disagreement_score":0.009477441,"about_ca_system_score_codex":0.00046807659,"about_ca_system_score_gemma":0.0007190038,"threshold_uncertainty_score":0.0317052},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11344209,0.0033932354,0.87401855,0.005446027,0.00027161444,0.00018823156,0.00075102434,0.0002841824,0.0022050722],"genre_scores_gemma":[0.48406193,0.0049050753,0.49725792,0.0009047132,0.0016810044,0.0004907253,0.0033331502,0.00048611933,0.0068794135],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9940602,0.0026172502,0.0006602335,0.0011745256,0.0011805268,0.00030716363],"domain_scores_gemma":[0.9206271,0.067885704,0.0033152148,0.003675342,0.0028990316,0.0015974467],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012668562,0.0017362011,0.006368267,0.0038076239,0.0025589166,0.004353508,0.0063880784,0.005034692,0.0033137249],"category_scores_gemma":[0.07987721,0.0018899154,0.002386879,0.006090108,0.0049610706,0.017246641,0.0064685596,0.003159091,0.00044352442],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00057618215,0.00034242918,0.004067657,0.0008756902,0.00029343113,0.00045214294,0.0007419596,0.6842487,0.0010456172,0.20401081,0.010247898,0.09309748],"study_design_scores_gemma":[0.00003657472,0.000048840036,0.00033612625,0.000028162525,0.000024915875,0.00008746841,0.00009360939,0.7870699,0.00016285632,0.21139036,0.0006977339,0.000023362545],"about_ca_topic_score_codex":0.009141881,"about_ca_topic_score_gemma":0.005661529,"teacher_disagreement_score":0.012668562,"about_ca_system_score_codex":0.0027350034,"about_ca_system_score_gemma":0.0015922838,"threshold_uncertainty_score":0.0669986},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09382858,0.00052945374,0.8258468,0.00031688716,0.00020603828,0.00020263666,0.0006274151,0.0031352316,0.075307],"genre_scores_gemma":[0.45518887,0.0008466994,0.51208913,0.00018978538,0.00012928274,0.00032089095,0.0015346387,0.0007193644,0.028981362],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997887,0.000037862446,0.000011244048,0.000052836505,0.00008014151,0.000029297818],"domain_scores_gemma":[0.99936527,0.00019640615,0.00006534025,0.00021553168,0.000095907664,0.00006160163],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018801726,0.0006190735,0.000528255,0.0009143,0.00047329703,0.00075142307,0.0012467924,0.00059490476,0.0124482345],"category_scores_gemma":[0.0010962674,0.00042173447,0.00057174574,0.000936567,0.0006735547,0.001523882,0.0017329495,0.0016288976,0.002571334],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039476372,0.00035918353,0.0009104363,0.0007058812,0.000051621926,0.00045270243,0.00042511764,0.103957504,0.052630972,0.26476675,0.026432252,0.54891294],"study_design_scores_gemma":[0.00007140516,0.0003420023,0.001046048,0.00014167349,0.000070526774,0.0009987677,0.0002811429,0.5607693,0.029304355,0.354891,0.05203294,0.000050814953],"about_ca_topic_score_codex":0.000529454,"about_ca_topic_score_gemma":0.000747899,"teacher_disagreement_score":0.0124482345,"about_ca_system_score_codex":0.0002616644,"about_ca_system_score_gemma":0.00024141204,"threshold_uncertainty_score":0.04164344},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3989308,0.0014986634,0.36856169,0.0047144387,0.00045754385,0.00022108585,0.0013917717,0.0007604626,0.22346349],"genre_scores_gemma":[0.8686254,0.0016223807,0.063170396,0.0005762298,0.0003988745,0.00021833695,0.0017686853,0.0004485394,0.06317112],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99949753,0.00010234535,0.000025408272,0.00013663738,0.00013185189,0.00010621062],"domain_scores_gemma":[0.9976828,0.0013168488,0.0002431898,0.00033784175,0.0001666663,0.00025264767],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051143457,0.0007032037,0.0010400797,0.0010708694,0.0024259884,0.0030170928,0.0029203645,0.0034951414,0.020981481],"category_scores_gemma":[0.004799791,0.00082396687,0.0011257693,0.002101086,0.0023938902,0.005666659,0.002594385,0.0026650147,0.0018640901],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000740731,0.000076744036,0.00038279474,0.00013230168,0.000019214738,0.00021547692,0.00029427302,0.013323231,0.0014908956,0.9512373,0.006326187,0.026427507],"study_design_scores_gemma":[0.000022046966,0.000008722916,0.00017136896,0.000015443311,0.000008752992,0.00007887496,0.00011983853,0.012400231,0.0004626234,0.9835527,0.0031504806,0.000008879383],"about_ca_topic_score_codex":0.0016547596,"about_ca_topic_score_gemma":0.0017730447,"teacher_disagreement_score":0.020981481,"about_ca_system_score_codex":0.0010042288,"about_ca_system_score_gemma":0.00052211335,"threshold_uncertainty_score":0.07019007},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011599295,0.00082287565,0.9755434,0.00039256096,0.00022119618,0.00008734161,0.00022696338,0.0022554137,0.008850828],"genre_scores_gemma":[0.17870748,0.0006919495,0.8050887,0.00026136864,0.0005086837,0.0003080941,0.0005898113,0.0009855918,0.012858249],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975533,0.00050420885,0.00017191618,0.0004917715,0.0009264799,0.00035233723],"domain_scores_gemma":[0.99175256,0.0043894635,0.00046028188,0.0023509818,0.00066707586,0.00037975863],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021849202,0.0017353172,0.0025571452,0.00202844,0.0012489597,0.002731919,0.005672401,0.0014637413,0.009475343],"category_scores_gemma":[0.01345039,0.0009740517,0.0013750363,0.0051227496,0.0015696969,0.005260633,0.0048618056,0.0030524444,0.0019572284],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011351355,0.00058701687,0.0015075029,0.0004504146,0.000087719745,0.00018291765,0.00034303142,0.2128759,0.016617877,0.1554217,0.027845647,0.5829453],"study_design_scores_gemma":[0.000067557325,0.00007099344,0.000304297,0.000022624185,0.000029348597,0.000111025576,0.000040807387,0.8891761,0.0059227454,0.10011949,0.00410078,0.000034306428],"about_ca_topic_score_codex":0.0045086946,"about_ca_topic_score_gemma":0.004681909,"teacher_disagreement_score":0.009475343,"about_ca_system_score_codex":0.0014350367,"about_ca_system_score_gemma":0.0015173611,"threshold_uncertainty_score":0.031698227},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02855884,0.00011042598,0.9694986,0.000048199043,0.000021650512,0.00003397662,0.0001542246,0.00056389614,0.001010161],"genre_scores_gemma":[0.17156547,0.00036296263,0.82424915,0.000037419602,0.00004502938,0.00009400426,0.0011428884,0.0005463588,0.001956741],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99873215,0.0002590699,0.00005867369,0.00019216834,0.00062035245,0.00013764728],"domain_scores_gemma":[0.99690825,0.0015988053,0.00021599687,0.0005175086,0.0006048889,0.00015454998],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010159889,0.0014001502,0.0019530617,0.002011681,0.00049216993,0.0024837803,0.0021307587,0.0014794897,0.0028949592],"category_scores_gemma":[0.006083666,0.0021342786,0.001342294,0.0025702422,0.0014546287,0.0024696728,0.002983924,0.0029396203,0.0012931654],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045421973,0.00022576636,0.0049016546,0.00038375286,0.00008906894,0.00038590143,0.00035515663,0.3281291,0.02350668,0.06683186,0.006507828,0.568229],"study_design_scores_gemma":[0.000010241004,0.000024685232,0.0004227697,0.00001667296,0.000010027076,0.00013665197,0.000071190385,0.9743751,0.0050079427,0.01901611,0.0008932559,0.000015223556],"about_ca_topic_score_codex":0.0033294302,"about_ca_topic_score_gemma":0.005184381,"teacher_disagreement_score":0.0033294302,"about_ca_system_score_codex":0.00047960458,"about_ca_system_score_gemma":0.00091450167,"threshold_uncertainty_score":0.009684622},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4639706,0.0006075049,0.51749486,0.0008805842,0.00013064846,0.00011376858,0.00034688375,0.0003988197,0.016056407],"genre_scores_gemma":[0.87214357,0.0007017276,0.10827189,0.0003491717,0.00007842036,0.0001354817,0.00044894507,0.0003215902,0.017549293],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997259,0.00006263526,0.000012748264,0.000054992015,0.00009265891,0.000051081395],"domain_scores_gemma":[0.99829,0.00084302993,0.000226808,0.00016106565,0.00017850543,0.0003005827],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042406886,0.00045601957,0.0006006855,0.0014336373,0.0011732627,0.0014409539,0.0011976868,0.0013120908,0.0053449366],"category_scores_gemma":[0.003419235,0.00066809973,0.00035774687,0.0011477033,0.0012566904,0.0020767031,0.00178531,0.0012878475,0.0004840901],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004447345,0.0002098198,0.002857615,0.00035265286,0.000039887473,0.0005584786,0.00058494345,0.19637561,0.015271055,0.6801156,0.0064879437,0.09670168],"study_design_scores_gemma":[0.000045609053,0.000037597107,0.0008020899,0.000048153423,0.00001983616,0.00013398254,0.00023507739,0.3087825,0.0038187646,0.68139464,0.004655949,0.000025828755],"about_ca_topic_score_codex":0.0027772458,"about_ca_topic_score_gemma":0.004738955,"teacher_disagreement_score":0.0053449366,"about_ca_system_score_codex":0.0005735956,"about_ca_system_score_gemma":0.00039523272,"threshold_uncertainty_score":0.017880559},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34754875,0.0060040215,0.5424311,0.00912511,0.0012390984,0.0001472947,0.00049065374,0.00039004782,0.09262388],"genre_scores_gemma":[0.969909,0.0014786847,0.020336436,0.0005630679,0.00069918396,0.00009172715,0.00015067308,0.000090554975,0.0066807396],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99471855,0.0018786149,0.00033842734,0.0011023136,0.0016291302,0.00033287844],"domain_scores_gemma":[0.95252496,0.031986054,0.003268065,0.0061027138,0.003787502,0.0023307477],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048696143,0.00062077364,0.0020565228,0.003279599,0.0026710809,0.0048943087,0.002053822,0.0030861117,0.0074504316],"category_scores_gemma":[0.055254232,0.0010601731,0.0007848664,0.0021817219,0.0074831587,0.012486378,0.007755636,0.00387575,0.001005652],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027133743,0.000054237942,0.002264705,0.00023337985,0.00007755576,0.00022591946,0.00042766175,0.009473574,0.0029285054,0.954502,0.001998402,0.027542725],"study_design_scores_gemma":[0.000054922897,0.00018104681,0.0011781161,0.000048574053,0.00006191741,0.00048104965,0.00031139332,0.03821487,0.0019316172,0.9516872,0.0057993247,0.000050019746],"about_ca_topic_score_codex":0.00044368135,"about_ca_topic_score_gemma":0.00029713436,"teacher_disagreement_score":0.0074504316,"about_ca_system_score_codex":0.00076126703,"about_ca_system_score_gemma":0.00082711276,"threshold_uncertainty_score":0.02575326},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21746132,0.004901457,0.746082,0.0018754484,0.00040683884,0.00013069279,0.000913502,0.0010136601,0.027215064],"genre_scores_gemma":[0.9269432,0.0018581083,0.06519863,0.00020052295,0.00046494638,0.00016778176,0.0007867985,0.0007033257,0.0036766645],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9918846,0.003006143,0.00046437926,0.000924117,0.0031233926,0.00059740123],"domain_scores_gemma":[0.80970794,0.1534137,0.008779845,0.015374517,0.010822438,0.0019015818],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008286412,0.0010118965,0.0026671588,0.0044929506,0.0015175324,0.0029553655,0.0046622274,0.0025248218,0.007509138],"category_scores_gemma":[0.104497224,0.0017151217,0.0013282432,0.004572499,0.006508394,0.008665976,0.005041428,0.0041285986,0.00112195],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015370122,0.00013592023,0.017646803,0.0006934223,0.0001428739,0.0004524556,0.0012607743,0.44428724,0.00394812,0.4248761,0.009281549,0.0957377],"study_design_scores_gemma":[0.000049667797,0.00012256246,0.0025604244,0.00011773169,0.00006389494,0.00031694048,0.00023731464,0.6756232,0.002396592,0.3164019,0.002053751,0.000056104567],"about_ca_topic_score_codex":0.0044108797,"about_ca_topic_score_gemma":0.0027182552,"teacher_disagreement_score":0.008286412,"about_ca_system_score_codex":0.0018950513,"about_ca_system_score_gemma":0.0010198987,"threshold_uncertainty_score":0.0438233},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003052112,0.0001309137,0.99121654,0.00005791172,0.00007442185,0.000046108635,0.000058594145,0.0011894109,0.004173971],"genre_scores_gemma":[0.046247933,0.00022151587,0.94421464,0.00006487974,0.00007006161,0.0001227925,0.00034603124,0.0009857899,0.0077264113],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.999212,0.000103621045,0.000034668774,0.00012487349,0.000451815,0.00007302085],"domain_scores_gemma":[0.99928635,0.00029046639,0.000026696252,0.0001698754,0.00018527778,0.000041352298],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047434215,0.00080122956,0.001091894,0.0014244547,0.0009563294,0.0018530126,0.002329014,0.0010631356,0.013194102],"category_scores_gemma":[0.0025530949,0.00076110935,0.001364217,0.0016926386,0.0012327337,0.0019572936,0.0022646163,0.0022829073,0.0029700159],"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.00024594966,0.0001075272,0.00038901548,0.00021529131,0.000051620165,0.00013554317,0.00023673633,0.096736096,0.011779306,0.2098066,0.014536838,0.6657595],"study_design_scores_gemma":[0.000066681394,0.00009343796,0.00023301052,0.000045143242,0.000028232684,0.0002569028,0.00007769318,0.81157255,0.0092349425,0.14176172,0.036594305,0.000035346802],"about_ca_topic_score_codex":0.0031239232,"about_ca_topic_score_gemma":0.0048625995,"teacher_disagreement_score":0.013194102,"about_ca_system_score_codex":0.00072330254,"about_ca_system_score_gemma":0.0008614057,"threshold_uncertainty_score":0.04413873},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009298573,0.00039777282,0.94973224,0.00021441338,0.00025394533,0.00011173879,0.00038208012,0.0022863313,0.037322942],"genre_scores_gemma":[0.1288349,0.00075641955,0.8375282,0.00016870872,0.0001363215,0.00017147193,0.0010809974,0.0017387,0.029584302],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992101,0.0001168539,0.00005143742,0.00016280454,0.00038535852,0.00007334622],"domain_scores_gemma":[0.99887437,0.00030942334,0.000061026418,0.0005630868,0.0001385451,0.000053420266],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037353503,0.001271373,0.001581046,0.001616917,0.00082546356,0.0020377035,0.0029131393,0.0016550369,0.035108984],"category_scores_gemma":[0.0034736688,0.0015009299,0.0011586087,0.0023049596,0.0008651418,0.0034243471,0.0035529938,0.0029179717,0.008132471],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002761899,0.00010222643,0.00026455606,0.0006138917,0.00006703649,0.0001890284,0.00020054054,0.049691837,0.016635992,0.2393994,0.02426431,0.66829497],"study_design_scores_gemma":[0.00012571873,0.00008809604,0.000367167,0.0001627722,0.00006926809,0.0005954988,0.00013634723,0.36569434,0.016276801,0.5456775,0.07075318,0.000053318472],"about_ca_topic_score_codex":0.0008794822,"about_ca_topic_score_gemma":0.0019184767,"teacher_disagreement_score":0.035108984,"about_ca_system_score_codex":0.0005874708,"about_ca_system_score_gemma":0.00040241997,"threshold_uncertainty_score":0.11745125},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09390578,0.00068475655,0.77177274,0.00036419556,0.0007407067,0.00016923073,0.000522122,0.0006960602,0.13114443],"genre_scores_gemma":[0.4912161,0.00275385,0.28069407,0.0002830683,0.00017443708,0.00034122358,0.001556248,0.00088111346,0.22209993],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998666,0.000012697601,0.000006321917,0.00004466991,0.000045095283,0.000024641697],"domain_scores_gemma":[0.9999223,0.000021837983,0.000007656771,0.000023436934,0.000011269697,0.000013467251],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011428672,0.0009813724,0.0007190668,0.0006245569,0.0007286112,0.00094295776,0.0009858175,0.0008130292,0.016656242],"category_scores_gemma":[0.0003149252,0.0005153637,0.0006264091,0.00045758756,0.0010016952,0.0010333054,0.003162706,0.0015079187,0.00359173],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020709916,0.00014813179,0.0003748265,0.0007640519,0.00006350783,0.00070200325,0.00050594995,0.16230907,0.075403444,0.56455266,0.014069751,0.18089953],"study_design_scores_gemma":[0.00010359339,0.0006407553,0.00073729246,0.0003253684,0.00009225164,0.0012283678,0.000771859,0.41639733,0.032446068,0.39993304,0.14722313,0.00010102019],"about_ca_topic_score_codex":0.00081220834,"about_ca_topic_score_gemma":0.0008612867,"teacher_disagreement_score":0.016656242,"about_ca_system_score_codex":0.00032503274,"about_ca_system_score_gemma":0.00030898253,"threshold_uncertainty_score":0.055720687},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16884112,0.017269531,0.48946223,0.021460518,0.0017604176,0.00013336376,0.0015115878,0.0005605156,0.2990008],"genre_scores_gemma":[0.8494344,0.007989572,0.09969607,0.0019304982,0.001171147,0.00022585227,0.0008163953,0.00021493934,0.03852108],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978707,0.00052019133,0.00012348547,0.0005828006,0.00059102,0.00031183823],"domain_scores_gemma":[0.9914035,0.005038842,0.00062328915,0.0012473412,0.0010404328,0.0006466763],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025526115,0.001033367,0.0011221435,0.0023341451,0.0031356988,0.0033000924,0.0014566781,0.0015208871,0.008970855],"category_scores_gemma":[0.010346607,0.00067797076,0.00131527,0.0024469772,0.0064122216,0.008400075,0.003825281,0.0037202805,0.0015220816],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031168678,0.000013504324,0.00026306615,0.000055008255,0.0000121592775,0.000074855685,0.00010095446,0.0025016654,0.00055134675,0.98458004,0.003528506,0.008287678],"study_design_scores_gemma":[0.000013655569,0.000018060817,0.00023257245,0.000018709165,0.000006348431,0.00013219278,0.000059119477,0.0024157257,0.0005390398,0.9790141,0.017536433,0.000013974856],"about_ca_topic_score_codex":0.0016342168,"about_ca_topic_score_gemma":0.0010641874,"teacher_disagreement_score":0.008970855,"about_ca_system_score_codex":0.0025684554,"about_ca_system_score_gemma":0.0007494186,"threshold_uncertainty_score":0.030010521},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06903517,0.00043431015,0.8873601,0.00017465414,0.00020360647,0.00012223083,0.000449205,0.0022270698,0.03999357],"genre_scores_gemma":[0.36917582,0.0010572566,0.5923158,0.00008394644,0.00005653954,0.00008945304,0.0014055802,0.0017310331,0.034084536],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995382,0.000060145336,0.000024452067,0.000082588325,0.0002473135,0.00004735241],"domain_scores_gemma":[0.99956924,0.0001238157,0.00003627588,0.00015422683,0.000084940635,0.000031508018],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002650238,0.0007189147,0.00050941744,0.0012331988,0.0004911087,0.0012649826,0.0011568383,0.00072525727,0.010767976],"category_scores_gemma":[0.0016033134,0.00088675955,0.0006363801,0.0011291298,0.00084944273,0.0014342319,0.0019567842,0.0018619532,0.002101605],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013700858,0.00004702364,0.0007371054,0.00033705315,0.00005165241,0.0004013633,0.0009663437,0.1153316,0.04083321,0.34919065,0.0143207805,0.4776462],"study_design_scores_gemma":[0.000057781235,0.00014234266,0.001109266,0.00017569531,0.00006997861,0.001153405,0.00080782856,0.41422012,0.03860627,0.431575,0.11197937,0.000102887294],"about_ca_topic_score_codex":0.0017439655,"about_ca_topic_score_gemma":0.0049664425,"teacher_disagreement_score":0.010767976,"about_ca_system_score_codex":0.0005486873,"about_ca_system_score_gemma":0.00030695045,"threshold_uncertainty_score":0.036022425},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09443804,0.0017475936,0.8208023,0.0022218288,0.0011221854,0.0010643201,0.0024119208,0.004052963,0.07213891],"genre_scores_gemma":[0.22651942,0.00062163913,0.7270826,0.00036812224,0.00015572914,0.00037587676,0.003284915,0.0012087766,0.04038296],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99933076,0.00013895635,0.00002471399,0.00011928435,0.0001933329,0.00019307256],"domain_scores_gemma":[0.9986099,0.0006088074,0.00006765695,0.00037442526,0.00022237086,0.000116844196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072059315,0.00092912326,0.000757464,0.0011847848,0.0013303757,0.0010248882,0.0015894179,0.00064805325,0.03908171],"category_scores_gemma":[0.0033696732,0.0003450301,0.0009789268,0.0015842845,0.0006960038,0.0020846028,0.0012397971,0.001384318,0.0031004103],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005906872,0.0005054312,0.0011734185,0.00068708125,0.00008424246,0.00016287372,0.00019749752,0.102421306,0.0068821614,0.10161981,0.07256764,0.7131079],"study_design_scores_gemma":[0.00037918938,0.00044567097,0.0013610803,0.00015383847,0.00015597433,0.00044707596,0.00044020955,0.69295496,0.017222987,0.20668101,0.079686314,0.00007166322],"about_ca_topic_score_codex":0.006820614,"about_ca_topic_score_gemma":0.018319864,"teacher_disagreement_score":0.03908171,"about_ca_system_score_codex":0.0017309933,"about_ca_system_score_gemma":0.0023294883,"threshold_uncertainty_score":0.13074136},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51132685,0.0025780045,0.28585765,0.0027786836,0.0004330972,0.00019000267,0.0012504755,0.00037951625,0.19520572],"genre_scores_gemma":[0.7961816,0.0026357311,0.15244575,0.0005137895,0.00051398744,0.00029472445,0.0028131802,0.00033349232,0.04426769],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99919933,0.00014478833,0.000066910354,0.00023012755,0.00023255528,0.00012634193],"domain_scores_gemma":[0.99394035,0.004279733,0.00034890382,0.00054813665,0.00051812024,0.00036468793],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016449358,0.00073926605,0.001461181,0.0024069815,0.0025104436,0.002889239,0.001492769,0.0020457443,0.01102843],"category_scores_gemma":[0.00785256,0.0010787166,0.0018503089,0.0020043002,0.0042337477,0.0058809626,0.0046366514,0.0036804092,0.0014029111],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013121923,0.00015744453,0.005978437,0.0005130828,0.00008263728,0.0012629753,0.0014144222,0.014091941,0.0103921285,0.89196503,0.008386698,0.064443044],"study_design_scores_gemma":[0.000085543084,0.00029729898,0.0036629704,0.00030667553,0.00016082216,0.0020999853,0.0014374697,0.06750149,0.008577043,0.8951385,0.02066701,0.000065186825],"about_ca_topic_score_codex":0.000921338,"about_ca_topic_score_gemma":0.0009366535,"teacher_disagreement_score":0.01102843,"about_ca_system_score_codex":0.00062577386,"about_ca_system_score_gemma":0.0004897843,"threshold_uncertainty_score":0.036893785},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.67241275,0.0005189379,0.27697864,0.0008227972,0.00011465875,0.00008330035,0.0010776438,0.00062304176,0.047368266],"genre_scores_gemma":[0.8681893,0.00027624852,0.123586826,0.00015607596,0.00004985695,0.000110686764,0.001078585,0.00012688038,0.006425418],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990619,0.00019217862,0.00005563331,0.00015985665,0.00039737255,0.00013299326],"domain_scores_gemma":[0.9977859,0.00097200146,0.00030711084,0.00047254367,0.00024024618,0.00022212339],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038676776,0.00027475078,0.0006590478,0.0013316434,0.0014660277,0.0020511076,0.0010897223,0.0007003159,0.005035055],"category_scores_gemma":[0.0039867056,0.00048434097,0.000493578,0.0018227693,0.0018079645,0.0019770137,0.0018182418,0.0013728446,0.00081381935],"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.00017280813,0.000058860132,0.0018783286,0.0000917903,0.000015895504,0.00020036651,0.0003231632,0.048408307,0.0059806304,0.90234286,0.0035892539,0.036937617],"study_design_scores_gemma":[0.00005269088,0.000048290163,0.0007144594,0.000021520542,0.000010081061,0.0003056097,0.00024008873,0.13314654,0.0032658419,0.8554786,0.0066820555,0.000034171702],"about_ca_topic_score_codex":0.0023427466,"about_ca_topic_score_gemma":0.0034428353,"teacher_disagreement_score":0.005035055,"about_ca_system_score_codex":0.0013245525,"about_ca_system_score_gemma":0.0005235049,"threshold_uncertainty_score":0.016843915},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036285631,0.00012982107,0.98998636,0.00018416805,0.000104409126,0.00006714232,0.00015245662,0.0016772347,0.0040698405],"genre_scores_gemma":[0.029354833,0.00019342647,0.9591319,0.00008215319,0.00005864033,0.00013588165,0.000634329,0.000536106,0.009872732],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993703,0.000090675756,0.00004043585,0.00017023786,0.0002384454,0.00009004505],"domain_scores_gemma":[0.99882466,0.0003624957,0.000040149243,0.00036643338,0.00032710674,0.00007921006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004804767,0.0012193373,0.0010232901,0.00174622,0.0012322724,0.0021880984,0.002386753,0.0015093704,0.01755033],"category_scores_gemma":[0.002803917,0.0007422744,0.0012667986,0.0025793961,0.0008035693,0.0034200377,0.002334435,0.0023836552,0.004417137],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021092645,0.00019832686,0.00047725873,0.00013648522,0.000023317334,0.00006893666,0.00020313541,0.02481572,0.006907694,0.089208946,0.021159202,0.85659],"study_design_scores_gemma":[0.0001140317,0.000115396244,0.00085752056,0.000051680196,0.000054279986,0.0003219068,0.00030307862,0.71413153,0.018757293,0.18878146,0.07644745,0.00006441937],"about_ca_topic_score_codex":0.004455451,"about_ca_topic_score_gemma":0.0055001406,"teacher_disagreement_score":0.01755033,"about_ca_system_score_codex":0.0010795076,"about_ca_system_score_gemma":0.0011934441,"threshold_uncertainty_score":0.058711648},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012259101,0.00090720895,0.97284,0.0011789214,0.00014506915,0.00022138152,0.00039993346,0.0034550626,0.008593182],"genre_scores_gemma":[0.100786544,0.00051214505,0.8920903,0.00027932654,0.00013574032,0.00040327053,0.0016868181,0.0005589443,0.0035468657],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964887,0.0006527763,0.00029825157,0.0007792881,0.0011987452,0.0005822205],"domain_scores_gemma":[0.9954928,0.0022452017,0.0003406756,0.0012647846,0.00045434025,0.00020205468],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021282425,0.002176172,0.0020051026,0.0030133934,0.001789752,0.0041866573,0.004302081,0.0030675072,0.014045682],"category_scores_gemma":[0.010589762,0.0009409501,0.0028409585,0.004469515,0.0016774876,0.009118775,0.0058782897,0.0034595698,0.004694309],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00065198814,0.0006186074,0.0017024786,0.0009342141,0.00019429375,0.0002709294,0.00066673197,0.09468513,0.009189081,0.2524244,0.04910506,0.58955705],"study_design_scores_gemma":[0.0003800989,0.00016829181,0.00063348335,0.000075175914,0.00007774606,0.00063006475,0.00038645076,0.4806746,0.00795311,0.48798066,0.020955479,0.000084841464],"about_ca_topic_score_codex":0.0028150172,"about_ca_topic_score_gemma":0.0042426144,"teacher_disagreement_score":0.014045682,"about_ca_system_score_codex":0.002432949,"about_ca_system_score_gemma":0.0025230595,"threshold_uncertainty_score":0.046987474},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0879021,0.0012580681,0.82242376,0.00083878,0.00041004206,0.00011554841,0.00039002392,0.00032797578,0.08633372],"genre_scores_gemma":[0.5426019,0.002337945,0.4082457,0.0003210552,0.0004432252,0.00016324014,0.0012173516,0.0010805172,0.043589063],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997079,0.00007421082,0.000013699608,0.00005111571,0.00012495989,0.000028080294],"domain_scores_gemma":[0.9992756,0.0004570762,0.000049793452,0.0000776772,0.00008905081,0.00005073759],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039940895,0.0006061664,0.0010824662,0.0010029619,0.0006110997,0.0011824257,0.0014991352,0.0010789586,0.009133255],"category_scores_gemma":[0.0036090463,0.0005795714,0.00058251014,0.0012029856,0.0016467504,0.001703221,0.0021589613,0.0021584455,0.0015641631],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00052408694,0.000049656024,0.0010155394,0.0005267451,0.000026019941,0.0005652387,0.00070731534,0.11851497,0.011915582,0.63646793,0.018349517,0.21133736],"study_design_scores_gemma":[0.000053359134,0.00010880427,0.00056921784,0.00009317695,0.000021394611,0.00051604654,0.00025604546,0.38898966,0.002255622,0.58322,0.023891551,0.00002514452],"about_ca_topic_score_codex":0.0017920067,"about_ca_topic_score_gemma":0.0016830852,"teacher_disagreement_score":0.009133255,"about_ca_system_score_codex":0.00047196617,"about_ca_system_score_gemma":0.0002463728,"threshold_uncertainty_score":0.030553758},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036024994,0.000118260374,0.9917685,0.00009056803,0.000040639254,0.000028123477,0.000040539693,0.00017547295,0.004135439],"genre_scores_gemma":[0.17998989,0.0005243583,0.807937,0.00016028379,0.00008141478,0.00022714342,0.00022577871,0.00054111186,0.010313026],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995914,0.00011121084,0.000019733414,0.00008283741,0.00015481956,0.000040025898],"domain_scores_gemma":[0.99954623,0.0001407991,0.000031825715,0.00016857169,0.000087100925,0.000025493055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005694151,0.00079386716,0.0008280259,0.0012126103,0.00077635515,0.0015791745,0.003401885,0.0016707663,0.007316418],"category_scores_gemma":[0.0028956048,0.0008387487,0.0012184677,0.0010192444,0.0014491922,0.0025539305,0.0034869602,0.0024797618,0.0014805088],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006385726,0.00004825668,0.00026924294,0.00013356435,0.000047410038,0.00010075641,0.00017338069,0.366147,0.0057846033,0.53902036,0.0038742304,0.084337346],"study_design_scores_gemma":[0.000012439613,0.0000193276,0.000058177186,0.000014678792,0.000013139514,0.00004398817,0.00002644812,0.80032337,0.0013005714,0.1923731,0.0057962644,0.000018471073],"about_ca_topic_score_codex":0.0016772154,"about_ca_topic_score_gemma":0.0019136163,"teacher_disagreement_score":0.007316418,"about_ca_system_score_codex":0.0008362417,"about_ca_system_score_gemma":0.0006146392,"threshold_uncertainty_score":0.024475813},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49758345,0.00032812028,0.45862427,0.00017591109,0.00015831333,0.000109924615,0.00061569223,0.0019226772,0.04048162],"genre_scores_gemma":[0.76708996,0.00015645467,0.22245355,0.0000772728,0.0000269069,0.00008925816,0.0010156186,0.00053206284,0.008559036],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99982774,0.000023821114,0.000009382909,0.000032558917,0.00005777691,0.00004862585],"domain_scores_gemma":[0.9993519,0.00039439654,0.00003560642,0.00008377669,0.00007786092,0.00005631602],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027869898,0.0004859468,0.0008748774,0.000735351,0.0006615943,0.0013730256,0.0010586153,0.00057098496,0.010361657],"category_scores_gemma":[0.002029875,0.00042635578,0.00065058924,0.0009770422,0.0008110467,0.0016269998,0.0016008065,0.0005928679,0.0006834271],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00078671303,0.000117744006,0.0051776352,0.00045640508,0.00008478268,0.00036846873,0.000719092,0.44120088,0.016287368,0.291282,0.0099445,0.23357442],"study_design_scores_gemma":[0.000076511,0.000050585248,0.0005301094,0.000031755128,0.000016405595,0.00006383266,0.00018491321,0.84121037,0.004461218,0.1491908,0.0041635362,0.000019951818],"about_ca_topic_score_codex":0.0031859751,"about_ca_topic_score_gemma":0.009127367,"teacher_disagreement_score":0.010361657,"about_ca_system_score_codex":0.000652126,"about_ca_system_score_gemma":0.00045697734,"threshold_uncertainty_score":0.03466314},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2240094,0.0021118862,0.6030353,0.004599991,0.0006545083,0.00016962839,0.0014203598,0.0004778895,0.16352104],"genre_scores_gemma":[0.8727566,0.0024855442,0.097895056,0.001221217,0.00063313195,0.00024703713,0.0009921513,0.0001961441,0.023573108],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998922,0.00014883124,0.00006505453,0.00040079988,0.00030799783,0.00015544842],"domain_scores_gemma":[0.99596775,0.0020922476,0.00040745776,0.0007131887,0.00047810317,0.00034119305],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009108893,0.00051933207,0.00069195224,0.0013531283,0.0019863558,0.0023875444,0.0013390579,0.0010429149,0.0064869965],"category_scores_gemma":[0.0064800126,0.0004540867,0.0007925561,0.0015121785,0.0027679708,0.0053401827,0.0027202854,0.0026901236,0.0011058152],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034984372,0.000013833439,0.00037863234,0.00007072612,0.000013014686,0.000112208545,0.00016056355,0.002907547,0.0017390166,0.98020154,0.0032115022,0.011156539],"study_design_scores_gemma":[0.000019096644,0.000020526588,0.0003255577,0.00001996825,0.000014062462,0.00027606572,0.00009193265,0.008093582,0.002005617,0.9679413,0.021175278,0.00001706202],"about_ca_topic_score_codex":0.0009631132,"about_ca_topic_score_gemma":0.00069187704,"teacher_disagreement_score":0.0064869965,"about_ca_system_score_codex":0.0011464505,"about_ca_system_score_gemma":0.00040720883,"threshold_uncertainty_score":0.021701097},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031968674,0.00012466204,0.9950164,0.00004676641,0.00002553235,0.000021698637,0.00007329523,0.00026317735,0.0012316245],"genre_scores_gemma":[0.18896878,0.0005924212,0.8041097,0.00008986785,0.00008328977,0.00018165736,0.0008670613,0.0002532586,0.004853975],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99923277,0.0002812401,0.000037555903,0.00012506392,0.00025983134,0.000063652675],"domain_scores_gemma":[0.997514,0.0014921204,0.00019739909,0.0004050436,0.00032216296,0.000069358655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001119357,0.0010903095,0.0007987109,0.0012385761,0.00036449745,0.0012578239,0.0013737882,0.0012386758,0.0035388041],"category_scores_gemma":[0.009342178,0.0005560502,0.00092009833,0.001192204,0.00069427205,0.0019855797,0.0017371468,0.0012350196,0.001581031],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001877975,0.000045013752,0.0014237161,0.00020017973,0.0000552101,0.00010926774,0.0001796211,0.77651554,0.0027696383,0.08304026,0.005423935,0.1300498],"study_design_scores_gemma":[0.000014006971,0.000022393453,0.000119461765,0.000014699563,0.0000078249095,0.00009221092,0.000040496743,0.96752053,0.0010963113,0.027111268,0.003953083,0.000007799794],"about_ca_topic_score_codex":0.0023624203,"about_ca_topic_score_gemma":0.0018930321,"teacher_disagreement_score":0.0035388041,"about_ca_system_score_codex":0.0006405431,"about_ca_system_score_gemma":0.00050487154,"threshold_uncertainty_score":0.011838496},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.62623507,0.00086882483,0.33688712,0.0009894171,0.000043879478,0.00022582232,0.001046326,0.0008619625,0.03284151],"genre_scores_gemma":[0.9403432,0.00069412333,0.046481267,0.00033529763,0.000094491596,0.00027048078,0.0013912334,0.00017771343,0.01021222],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984358,0.00032255417,0.00007087872,0.00041169918,0.00047357127,0.00028537362],"domain_scores_gemma":[0.9942855,0.003185698,0.00079155905,0.00063102663,0.0005197329,0.0005864983],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005980702,0.00058182876,0.00071560265,0.0017450824,0.0011600825,0.0023851197,0.0017221252,0.001078071,0.0077283126],"category_scores_gemma":[0.008794442,0.0009373044,0.0006791258,0.0015693202,0.0014099926,0.004129828,0.0026605495,0.0015047572,0.00089508365],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037630397,0.0001732008,0.014426658,0.00030698674,0.00010817604,0.0010130322,0.0019154258,0.097263046,0.01617792,0.8032495,0.008183565,0.05680623],"study_design_scores_gemma":[0.00007855093,0.00014688533,0.00603771,0.00008795802,0.000085775886,0.0021487824,0.0009673293,0.6119701,0.009882359,0.35689178,0.011629329,0.00007345461],"about_ca_topic_score_codex":0.0034985093,"about_ca_topic_score_gemma":0.0026409382,"teacher_disagreement_score":0.0077283126,"about_ca_system_score_codex":0.0015719052,"about_ca_system_score_gemma":0.000531167,"threshold_uncertainty_score":0.025853753},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36900118,0.010856423,0.3668405,0.016219305,0.0014859149,0.00031206527,0.0011726255,0.00031602455,0.233796],"genre_scores_gemma":[0.82545304,0.008875509,0.09783733,0.001943959,0.0023660858,0.00038929452,0.0019249849,0.0004910877,0.060718793],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985002,0.0005575502,0.000057270285,0.00021724757,0.00040730156,0.00026036814],"domain_scores_gemma":[0.9926409,0.0057162256,0.00035256043,0.00033611731,0.00036781305,0.0005864134],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001647744,0.001967623,0.0020870017,0.0023700397,0.0024582667,0.004055434,0.0020252445,0.0030184155,0.011783483],"category_scores_gemma":[0.012752017,0.0012562046,0.0022568011,0.004587747,0.0028190075,0.005969141,0.0029969208,0.0056307856,0.00071293605],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018982,0.00019297258,0.0010285508,0.00028253283,0.00008802189,0.0002679872,0.0004546095,0.072588086,0.00082161033,0.87525606,0.019414801,0.029415078],"study_design_scores_gemma":[0.00004648807,0.000052799598,0.0006716676,0.000064345135,0.000034433193,0.00018944252,0.00015958532,0.14484389,0.00028006124,0.8457671,0.007868205,0.000021915368],"about_ca_topic_score_codex":0.0031664425,"about_ca_topic_score_gemma":0.0029271634,"teacher_disagreement_score":0.011783483,"about_ca_system_score_codex":0.0024221013,"about_ca_system_score_gemma":0.0010583083,"threshold_uncertainty_score":0.03941965},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02450139,0.0034684062,0.92178464,0.0027589223,0.0011505578,0.00013172383,0.0008353153,0.0009980882,0.044370882],"genre_scores_gemma":[0.53590435,0.00811003,0.3948332,0.0022374569,0.0033934354,0.00046758447,0.0026256908,0.0010930424,0.051335163],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9949528,0.001822341,0.0003758921,0.0005442016,0.0016713351,0.00063349673],"domain_scores_gemma":[0.9802312,0.012697351,0.0010746539,0.0027772298,0.0024873368,0.00073214684],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004702564,0.0012997115,0.0017913977,0.0027935063,0.0017596134,0.004537531,0.0030236347,0.0016429495,0.0118123805],"category_scores_gemma":[0.027343322,0.0007258837,0.001170331,0.0040978934,0.0024693026,0.0080985585,0.0059743156,0.0036868453,0.0022892612],"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.00017186544,0.00008947386,0.0010665401,0.00019761623,0.000035161687,0.00013580332,0.00039421045,0.032757863,0.0015648438,0.79122645,0.032938875,0.13942131],"study_design_scores_gemma":[0.000019025807,0.000043335855,0.00031667703,0.00007261578,0.000021695354,0.00013507545,0.00012723773,0.14817321,0.0010010242,0.83636403,0.0136907,0.000035340392],"about_ca_topic_score_codex":0.004455129,"about_ca_topic_score_gemma":0.0034245995,"teacher_disagreement_score":0.0118123805,"about_ca_system_score_codex":0.0015548555,"about_ca_system_score_gemma":0.0015331805,"threshold_uncertainty_score":0.03951639},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0038950804,0.0006257383,0.9771985,0.0007706746,0.0004898804,0.00008771453,0.00026752276,0.0016744244,0.014990374],"genre_scores_gemma":[0.09961508,0.0013858157,0.8748246,0.00062997895,0.0005398307,0.0003793076,0.0008509787,0.0022877466,0.019486707],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981164,0.00043301354,0.00015796295,0.00044557007,0.0006852181,0.00016186491],"domain_scores_gemma":[0.99608,0.0017271898,0.00012301984,0.0016618391,0.00030500774,0.00010295311],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013606373,0.0018425392,0.0014470841,0.0019445652,0.0018094572,0.0026591506,0.002846471,0.0012909559,0.016499236],"category_scores_gemma":[0.009080548,0.0009182526,0.0018844168,0.0039044097,0.002503151,0.011736081,0.003968306,0.006477428,0.0061769607],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022433276,0.00019783726,0.00025305676,0.0004056091,0.00006177817,0.00023296347,0.00043447083,0.013637502,0.006793215,0.53671515,0.04420033,0.39684376],"study_design_scores_gemma":[0.000073616495,0.00006274172,0.00013646655,0.000073884396,0.00005405049,0.00038387495,0.00010777862,0.061438143,0.0052782157,0.8808827,0.051453274,0.000055266817],"about_ca_topic_score_codex":0.0011617922,"about_ca_topic_score_gemma":0.001704629,"teacher_disagreement_score":0.016499236,"about_ca_system_score_codex":0.00091083115,"about_ca_system_score_gemma":0.0008859493,"threshold_uncertainty_score":0.05519551},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014095976,0.00020511626,0.9455117,0.00007954294,0.00012327492,0.000110903675,0.00024362734,0.0009275438,0.03870237],"genre_scores_gemma":[0.2163651,0.0006136915,0.75329274,0.00006719029,0.00008768716,0.00020318701,0.0008850066,0.0010110443,0.027474314],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990607,0.00018254283,0.0000425656,0.00019802313,0.00040566115,0.00011059003],"domain_scores_gemma":[0.9991153,0.0002599909,0.000081727965,0.00027945274,0.0001975761,0.00006599882],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054919405,0.0011863806,0.0010517711,0.0012556207,0.0007836183,0.001934529,0.0020044672,0.0012895807,0.018955935],"category_scores_gemma":[0.0030278768,0.0011754732,0.0008471996,0.001705492,0.00091990206,0.0020379287,0.0019350632,0.0020573295,0.004835285],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024730797,0.000087768334,0.00030665877,0.00034026388,0.000040984538,0.00052568025,0.0004381605,0.07423665,0.016176036,0.6634094,0.015549729,0.2286413],"study_design_scores_gemma":[0.00011085138,0.00017795902,0.0004463687,0.00013349467,0.000068708054,0.0009655894,0.00024693547,0.43648982,0.02344993,0.43904862,0.09876761,0.00009415527],"about_ca_topic_score_codex":0.0011240537,"about_ca_topic_score_gemma":0.0021736203,"teacher_disagreement_score":0.018955935,"about_ca_system_score_codex":0.0005389855,"about_ca_system_score_gemma":0.0004745726,"threshold_uncertainty_score":0.06341398},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00090821314,0.0014443207,0.95776254,0.00015097203,0.00070561894,0.00004004078,0.000068195186,0.00050624786,0.03841393],"genre_scores_gemma":[0.032368917,0.005566677,0.8920953,0.00023447046,0.00047590001,0.000102108854,0.0002531886,0.0007966406,0.068106696],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99967885,0.000032885644,0.000011367543,0.00003666427,0.00022318092,0.000017075723],"domain_scores_gemma":[0.9996971,0.000121101606,0.000009724177,0.000067149,0.00008658011,0.00001822084],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041011034,0.00068004214,0.00080982415,0.0012560915,0.00053441466,0.001312492,0.0013029439,0.00086512044,0.010881795],"category_scores_gemma":[0.0010313905,0.0004878278,0.0012490234,0.0012496945,0.0008481208,0.0012933612,0.001392573,0.0025008614,0.0052776905],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029913574,0.00005050398,0.00014260178,0.0003573996,0.000021932186,0.00016802276,0.0001603049,0.04516098,0.010495116,0.40593246,0.027630605,0.5098502],"study_design_scores_gemma":[0.00002034809,0.000059221322,0.0002385379,0.000116526266,0.000030733932,0.0007053901,0.000028429962,0.37280604,0.0073983655,0.26140794,0.35714862,0.00003978579],"about_ca_topic_score_codex":0.0009063869,"about_ca_topic_score_gemma":0.0012977979,"teacher_disagreement_score":0.010881795,"about_ca_system_score_codex":0.00036199117,"about_ca_system_score_gemma":0.00063078036,"threshold_uncertainty_score":0.03640318},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008918448,0.08912916,0.22571789,0.020388663,0.09310939,0.000410596,0.0071212784,0.0040826085,0.551122],"genre_scores_gemma":[0.08708255,0.08555229,0.22251351,0.0033853706,0.022574294,0.0005982305,0.018623784,0.0035616388,0.5561083],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9975643,0.00063165766,0.00019190996,0.00032614922,0.0011440533,0.00014200275],"domain_scores_gemma":[0.9972873,0.00063088094,0.00009577928,0.00059166783,0.0010110236,0.00038339454],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020192964,0.0012762158,0.0016764945,0.0020423895,0.00096092164,0.005340391,0.0016196904,0.0012083736,0.11516636],"category_scores_gemma":[0.0049629705,0.00047288125,0.0015466529,0.0017075635,0.001459599,0.0023404341,0.0031659894,0.0028784699,0.041075382],"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.00011772242,0.00004816882,0.00078322244,0.0006173463,0.0001538801,0.00013669487,0.00017928352,0.0035350225,0.0017712412,0.06659842,0.7431377,0.18292123],"study_design_scores_gemma":[0.000013660825,0.00003848716,0.000958768,0.0002137628,0.000025707459,0.00025317122,0.00012203545,0.0031722474,0.00046350432,0.025286617,0.96942747,0.00002464581],"about_ca_topic_score_codex":0.0016110926,"about_ca_topic_score_gemma":0.0022771985,"teacher_disagreement_score":0.11516636,"about_ca_system_score_codex":0.0015261888,"about_ca_system_score_gemma":0.0023550505,"threshold_uncertainty_score":0.38526988},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010187335,0.0012315983,0.97385705,0.0007632545,0.000119103875,0.0001751385,0.00025547176,0.0014285155,0.011982398],"genre_scores_gemma":[0.09845398,0.000992055,0.89190984,0.0004999809,0.00021786398,0.00038275376,0.00096157676,0.0005888117,0.005993137],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99733704,0.0006916897,0.00012905069,0.00086663925,0.0006753286,0.00030034044],"domain_scores_gemma":[0.99460536,0.0029633425,0.00047846427,0.0012325413,0.0004998535,0.00022047642],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022599965,0.0023076565,0.0019861413,0.0017426751,0.0010441571,0.003041154,0.0067445906,0.0023232256,0.0074151154],"category_scores_gemma":[0.0126131615,0.0010643638,0.0019975794,0.0035270718,0.001671935,0.009069737,0.0037589406,0.00577855,0.0030707112],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041267378,0.00041981495,0.00095771905,0.00070519646,0.000100200385,0.00014952869,0.00045000348,0.4427663,0.006215375,0.2548736,0.030803993,0.26214558],"study_design_scores_gemma":[0.00008702073,0.00006956428,0.00020846381,0.000048623064,0.000037700123,0.00020746859,0.00007629468,0.90116954,0.002475935,0.083643526,0.011945935,0.000029904937],"about_ca_topic_score_codex":0.0034905623,"about_ca_topic_score_gemma":0.0037770425,"teacher_disagreement_score":0.0074151154,"about_ca_system_score_codex":0.0021101807,"about_ca_system_score_gemma":0.0017408859,"threshold_uncertainty_score":0.024806023},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009738539,0.000104286395,0.981384,0.00011091176,0.000085708576,0.0001814878,0.00011055661,0.0038990914,0.0043855137],"genre_scores_gemma":[0.10466834,0.000099696525,0.88931257,0.000046576974,0.000038329657,0.00016562779,0.0005089847,0.00086421834,0.004295628],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99957246,0.00003924159,0.000021070475,0.000114788454,0.00018969669,0.000062736595],"domain_scores_gemma":[0.99933606,0.00023173491,0.000046078716,0.0001233881,0.00018763727,0.0000750969],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004798085,0.0012228825,0.0012526368,0.0013691859,0.0011396387,0.0014212981,0.0022859115,0.0011437383,0.019762645],"category_scores_gemma":[0.002269447,0.0006809468,0.00093400595,0.0012825156,0.0007879535,0.0014963434,0.0029337225,0.0014699209,0.0044084974],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00052479346,0.0001670059,0.0011905311,0.00034907344,0.0000801362,0.00028303708,0.0003516615,0.13481437,0.020485008,0.04596155,0.019000117,0.7767927],"study_design_scores_gemma":[0.00018730294,0.00010955259,0.00023394343,0.00002254835,0.000028096123,0.00013030204,0.00013280362,0.95699036,0.009056273,0.022684628,0.010395107,0.000029145773],"about_ca_topic_score_codex":0.008683404,"about_ca_topic_score_gemma":0.010688669,"teacher_disagreement_score":0.019762645,"about_ca_system_score_codex":0.0013283171,"about_ca_system_score_gemma":0.0018715443,"threshold_uncertainty_score":0.06611258},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06831339,0.003109107,0.9106916,0.002157445,0.00016384335,0.00026323195,0.000088501816,0.00083724735,0.014375692],"genre_scores_gemma":[0.3770405,0.0029312035,0.6120391,0.00057336426,0.00031653073,0.00071194733,0.00031547353,0.000514246,0.005557558],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99614644,0.0014201901,0.00021966115,0.0006898686,0.0011321106,0.00039159023],"domain_scores_gemma":[0.98694825,0.008752982,0.00078438484,0.002502588,0.000784221,0.00022749639],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026897718,0.0012714106,0.0011314399,0.0012356156,0.0012588246,0.0018879152,0.0016463506,0.0013488637,0.0036391183],"category_scores_gemma":[0.017656883,0.00090888835,0.0008267975,0.0023050208,0.0019110915,0.005844101,0.001452024,0.002520568,0.0009249041],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047979038,0.0003703105,0.0014108927,0.0006409984,0.00013144752,0.00006410787,0.00017152428,0.615852,0.009112992,0.21166319,0.005710155,0.15439264],"study_design_scores_gemma":[0.00024196706,0.00023975,0.00049716927,0.00004403355,0.00008292558,0.000079974794,0.00007462274,0.74855614,0.006862215,0.23235334,0.010937714,0.000030226578],"about_ca_topic_score_codex":0.0015668792,"about_ca_topic_score_gemma":0.002236599,"teacher_disagreement_score":0.0036391183,"about_ca_system_score_codex":0.00211163,"about_ca_system_score_gemma":0.0025692729,"threshold_uncertainty_score":0.015321016},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026384333,0.0035986078,0.9503983,0.0003725298,0.00050037843,0.00028224054,0.0004155993,0.0019638778,0.016084181],"genre_scores_gemma":[0.17575514,0.0023881858,0.810644,0.00020629843,0.0000895369,0.00038494013,0.0011552605,0.0005352686,0.008841371],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988256,0.00020191667,0.000057546084,0.00012663043,0.0007164326,0.000071847324],"domain_scores_gemma":[0.99779665,0.0007649032,0.00012082137,0.0004115567,0.0007768524,0.00012917841],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085818523,0.0006371472,0.0007790724,0.0010281805,0.0005774923,0.0011068839,0.0015761992,0.0010664709,0.006864851],"category_scores_gemma":[0.0045963894,0.00050129445,0.0005691913,0.0012457191,0.0003337296,0.0016116797,0.0018939269,0.00044982907,0.0018036962],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005691891,0.00016835098,0.0019084862,0.0010172024,0.0001918116,0.00013132989,0.0003047893,0.09058077,0.01819562,0.018214114,0.009902987,0.8588154],"study_design_scores_gemma":[0.00016354544,0.0004014332,0.0038199285,0.0001930119,0.00008736718,0.0011138582,0.0004139999,0.9088703,0.014583579,0.011356619,0.05879591,0.00020046551],"about_ca_topic_score_codex":0.0031145597,"about_ca_topic_score_gemma":0.00564581,"teacher_disagreement_score":0.006864851,"about_ca_system_score_codex":0.00040845017,"about_ca_system_score_gemma":0.0010312491,"threshold_uncertainty_score":0.022965193},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.076679885,0.0009914279,0.80471236,0.0002281067,0.00021117234,0.0001821809,0.0006341055,0.001037452,0.11532333],"genre_scores_gemma":[0.50040686,0.0021856881,0.4350419,0.00012583609,0.00014466596,0.00026843263,0.0019619379,0.0011886337,0.058676038],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99922264,0.0001689756,0.000033992357,0.00015680476,0.00032255604,0.00009505023],"domain_scores_gemma":[0.99876285,0.0004845453,0.00013056467,0.00026195607,0.00023208841,0.00012806499],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032645787,0.00084816123,0.0007486659,0.000944795,0.0007402498,0.0019824142,0.002198582,0.0009813379,0.0151516395],"category_scores_gemma":[0.0028423327,0.0009952228,0.00069700973,0.0014400685,0.0009282889,0.0017902853,0.0016457598,0.0022300028,0.003009356],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016156511,0.00006348716,0.00038014055,0.00030685824,0.000026397856,0.00050147175,0.00062371325,0.05713548,0.00948783,0.79074085,0.009634857,0.13093732],"study_design_scores_gemma":[0.00007114111,0.00009256138,0.00073183636,0.00013194977,0.000046256926,0.00074581243,0.0003193081,0.23899697,0.009670081,0.67605275,0.07308484,0.000056510664],"about_ca_topic_score_codex":0.0015121232,"about_ca_topic_score_gemma":0.0029426129,"teacher_disagreement_score":0.0151516395,"about_ca_system_score_codex":0.000606817,"about_ca_system_score_gemma":0.00039276917,"threshold_uncertainty_score":0.050687313},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14543009,0.0012272453,0.6563752,0.002459553,0.0013378258,0.0006885903,0.0032542483,0.0018265763,0.18740064],"genre_scores_gemma":[0.46763876,0.0024062004,0.43199605,0.0010197,0.0010796364,0.00095390325,0.0071757645,0.0007729501,0.08695701],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999044,0.00015441724,0.000056298082,0.00024534683,0.00028500304,0.00021484558],"domain_scores_gemma":[0.9990256,0.0003204344,0.00010586161,0.00032124738,0.00010280146,0.00012411001],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004831702,0.0012039595,0.0012787672,0.00063347793,0.0012056028,0.0020015065,0.0014484753,0.0013280325,0.024719607],"category_scores_gemma":[0.0025270213,0.0006687798,0.0014922807,0.0017479097,0.0005520102,0.0038737585,0.0035601181,0.0019342335,0.006367669],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00064881245,0.00044683664,0.0022033332,0.00088526745,0.00009073606,0.0014756111,0.00037478865,0.08936064,0.01230222,0.30345532,0.11461055,0.47414595],"study_design_scores_gemma":[0.00018843244,0.00045451237,0.0022643693,0.00010204535,0.00006297915,0.002844449,0.00032466426,0.23688042,0.008757284,0.56819123,0.17986812,0.000061519364],"about_ca_topic_score_codex":0.00094073627,"about_ca_topic_score_gemma":0.0013471909,"teacher_disagreement_score":0.024719607,"about_ca_system_score_codex":0.00046468055,"about_ca_system_score_gemma":0.0007024689,"threshold_uncertainty_score":0.082695305},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003667021,0.16428052,0.32536855,0.0073530157,0.09539625,0.00019985886,0.0028970689,0.0030020843,0.39783567],"genre_scores_gemma":[0.034692723,0.10721514,0.119932294,0.0014861239,0.021003075,0.0003017019,0.004939829,0.0027704528,0.7076587],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989078,0.000109818655,0.00006210443,0.0001622329,0.0007025161,0.000055413053],"domain_scores_gemma":[0.99887246,0.00034808088,0.000041149175,0.00022744841,0.00040953973,0.00010132446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000750467,0.001455469,0.0023899693,0.0025502087,0.0005483305,0.0034288936,0.0012092469,0.0010499691,0.06701847],"category_scores_gemma":[0.0029708701,0.00060338207,0.0008394727,0.005111144,0.0008591179,0.002754912,0.0015358033,0.0024540676,0.028034294],"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.000029794766,0.000027535978,0.00015079517,0.00056143274,0.00003777498,0.00003605532,0.00004620367,0.0034914482,0.0010778207,0.04817608,0.5722165,0.37414858],"study_design_scores_gemma":[0.000011041709,0.000021119311,0.0005049514,0.0001897782,0.000029179888,0.0002786358,0.000035838275,0.00770049,0.0007794074,0.04921293,0.9412219,0.000014872843],"about_ca_topic_score_codex":0.0015134945,"about_ca_topic_score_gemma":0.0028697732,"teacher_disagreement_score":0.06701847,"about_ca_system_score_codex":0.0012922094,"about_ca_system_score_gemma":0.0013476657,"threshold_uncertainty_score":0.22419918},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01772486,0.0001305902,0.97908634,0.00014093786,0.000034340126,0.00010956714,0.00013069074,0.0014067058,0.0012358526],"genre_scores_gemma":[0.18023585,0.000098886885,0.816951,0.000060525002,0.000026676744,0.00027039187,0.0004366653,0.00022730224,0.0016927026],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990089,0.00023152938,0.000048068734,0.00027440835,0.0002893858,0.00014762336],"domain_scores_gemma":[0.99852127,0.0006509729,0.00014766843,0.0003729552,0.00021123858,0.000095777694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006894601,0.00042184605,0.0011775627,0.0005922077,0.00081432203,0.00092476036,0.0020688805,0.0009289471,0.0041751997],"category_scores_gemma":[0.0039609005,0.0005110584,0.000619541,0.001094886,0.0008908338,0.0016089289,0.0016574551,0.0008918398,0.0009012514],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039716644,0.00012046317,0.0012298321,0.0002466341,0.00006571329,0.00014232405,0.00016214329,0.64542794,0.014043809,0.088322334,0.006548073,0.24329358],"study_design_scores_gemma":[0.00011780675,0.00003888906,0.00012020088,0.0000060125144,0.000008018868,0.00004613009,0.000018765408,0.96734023,0.0023786635,0.027326576,0.0025872765,0.000011444118],"about_ca_topic_score_codex":0.005877696,"about_ca_topic_score_gemma":0.007579375,"teacher_disagreement_score":0.005877696,"about_ca_system_score_codex":0.0013534448,"about_ca_system_score_gemma":0.0016580715,"threshold_uncertainty_score":0.013967395},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4234522,0.00048619532,0.558867,0.0004725828,0.000087433604,0.0001723596,0.001745475,0.0016806138,0.013036172],"genre_scores_gemma":[0.55420333,0.0004530547,0.4311099,0.00014347612,0.000044718647,0.000113309055,0.005208351,0.00064939994,0.008074398],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991824,0.00015113468,0.00006941036,0.00022777951,0.00020654293,0.00016266563],"domain_scores_gemma":[0.9939569,0.004023727,0.00040774362,0.00094570394,0.00042090408,0.0002450735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068826065,0.0008960497,0.0010731407,0.0018354285,0.0012210197,0.0020277328,0.0015903367,0.0012566557,0.007998476],"category_scores_gemma":[0.008403333,0.0010185145,0.0013234768,0.0026139265,0.0015652312,0.005096577,0.0025537347,0.0019701358,0.0010660889],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047956142,0.00045492552,0.025514036,0.0010241698,0.00013482798,0.00078827195,0.0019484053,0.21930107,0.018074213,0.2856834,0.013406251,0.4331909],"study_design_scores_gemma":[0.000030997184,0.00013714566,0.003711721,0.00014935315,0.000098388664,0.0004028979,0.0010961117,0.34793746,0.012786824,0.62458354,0.009030603,0.00003492966],"about_ca_topic_score_codex":0.0015007792,"about_ca_topic_score_gemma":0.0039359885,"teacher_disagreement_score":0.007998476,"about_ca_system_score_codex":0.000827015,"about_ca_system_score_gemma":0.00064734765,"threshold_uncertainty_score":0.026757538},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052797113,0.00049432827,0.94397324,0.00024963598,0.000048244885,0.0000746255,0.00010322764,0.00024623988,0.002013324],"genre_scores_gemma":[0.68355346,0.0007771405,0.30966324,0.00021352316,0.00016723189,0.0002073858,0.00088718126,0.0004850842,0.0040456676],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986889,0.0005118826,0.000050197203,0.00015696451,0.00048785747,0.00010418476],"domain_scores_gemma":[0.98691213,0.010404397,0.00049046124,0.0005869468,0.0011062127,0.0004997829],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034789613,0.001261049,0.0014921238,0.0025614665,0.00074529776,0.0015102121,0.0023119575,0.0019424241,0.0030647658],"category_scores_gemma":[0.023944141,0.0007997913,0.0011283805,0.0015396586,0.0016252114,0.0019568251,0.002124287,0.0016559551,0.0003803986],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028284697,0.000103545666,0.002588453,0.00019385635,0.0000621391,0.00011548159,0.0001740942,0.87599283,0.003948049,0.08078224,0.0014373815,0.034319144],"study_design_scores_gemma":[0.0000038298126,0.000012504938,0.00008008463,0.0000053917006,0.000003275485,0.000012527128,0.000008085692,0.99477226,0.00021923099,0.0047557713,0.00012410259,0.000002943221],"about_ca_topic_score_codex":0.00860944,"about_ca_topic_score_gemma":0.0073704673,"teacher_disagreement_score":0.00860944,"about_ca_system_score_codex":0.002285183,"about_ca_system_score_gemma":0.0013989215,"threshold_uncertainty_score":0.018398702},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0071918727,0.0014790444,0.93821234,0.0005877269,0.001396712,0.00016963296,0.00066779274,0.0122417705,0.038053118],"genre_scores_gemma":[0.108099945,0.0012489303,0.834584,0.00079835206,0.0005831863,0.00044564804,0.0011996622,0.006882908,0.04615742],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99829,0.0002448829,0.00016291528,0.00021256854,0.0008920753,0.00019757188],"domain_scores_gemma":[0.9973086,0.00074609125,0.00010382063,0.0012822533,0.0004517248,0.000107486485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015724001,0.0009183664,0.0015365346,0.0021182983,0.0021460066,0.004347281,0.003936729,0.0017031489,0.033425387],"category_scores_gemma":[0.0077907955,0.0011380623,0.0014268454,0.003921225,0.0019815622,0.009175182,0.005726436,0.0022781563,0.009336059],"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.0003853531,0.000057323035,0.00026267837,0.00041979348,0.00004123393,0.00012084482,0.00033451238,0.0028922767,0.0046587302,0.6604289,0.032078404,0.29832003],"study_design_scores_gemma":[0.00014645483,0.00008924465,0.00017310692,0.00015823556,0.00008080286,0.00035327923,0.000115624156,0.027146107,0.011808684,0.6733721,0.286461,0.000095388525],"about_ca_topic_score_codex":0.0011913582,"about_ca_topic_score_gemma":0.0020161537,"teacher_disagreement_score":0.033425387,"about_ca_system_score_codex":0.0008829331,"about_ca_system_score_gemma":0.0013336901,"threshold_uncertainty_score":0.11181909},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008098343,0.00015989793,0.9900643,0.00007684434,0.000020136446,0.000035425055,0.000035705893,0.00025372993,0.001255504],"genre_scores_gemma":[0.109845534,0.00020190426,0.8880304,0.000090508394,0.000029837738,0.00013072071,0.0002692438,0.00013685011,0.0012649653],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9964779,0.00070177956,0.00032138947,0.00076678337,0.001582897,0.00014923407],"domain_scores_gemma":[0.99349,0.0033044224,0.0005974167,0.0011168866,0.0013842512,0.000107161446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004653323,0.00064898963,0.0013874368,0.001611398,0.0010138284,0.0015186317,0.0025624742,0.0015070431,0.0026138967],"category_scores_gemma":[0.018450845,0.0007974409,0.0012061388,0.0012173292,0.0014262497,0.003822373,0.0017673571,0.0015244074,0.00091484596],"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.00020236922,0.000052382846,0.0009421627,0.000118975135,0.000044214295,0.00019101989,0.00020490549,0.65507615,0.006148479,0.09074475,0.0020264725,0.2442481],"study_design_scores_gemma":[0.000014366924,0.000041503223,0.0001883088,0.000030509429,0.000011531758,0.00009213005,0.00002205153,0.9627913,0.0040255804,0.030693073,0.0020696078,0.000019935582],"about_ca_topic_score_codex":0.0041599735,"about_ca_topic_score_gemma":0.0042507406,"teacher_disagreement_score":0.004653323,"about_ca_system_score_codex":0.0012413935,"about_ca_system_score_gemma":0.0012211622,"threshold_uncertainty_score":0.024609387},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09234258,0.0006286766,0.87701863,0.0005501271,0.00014259655,0.00023093559,0.00029604568,0.00025723543,0.028533202],"genre_scores_gemma":[0.33667412,0.0017749729,0.63436633,0.0002043785,0.00025061847,0.00040500806,0.0013656552,0.00074466807,0.024214253],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993686,0.00016012699,0.00003433017,0.00010699421,0.000252503,0.00007759239],"domain_scores_gemma":[0.99719656,0.0020816494,0.00022027807,0.0001980376,0.00018045497,0.00012302533],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077248045,0.0012066483,0.0019810118,0.0016911301,0.0012524204,0.0022828977,0.0024436587,0.0022634529,0.008811067],"category_scores_gemma":[0.0070432466,0.00108334,0.001277593,0.0025602498,0.0024878972,0.0031581228,0.0034629018,0.002747438,0.0010215616],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00067729957,0.00019513155,0.0020490861,0.000833308,0.000084075844,0.0006144199,0.0012222223,0.44239,0.012053739,0.36360848,0.009798843,0.1664734],"study_design_scores_gemma":[0.000056466622,0.00018272642,0.0007599887,0.00014345684,0.000034712386,0.0003780332,0.00038091518,0.64450157,0.002359398,0.3437479,0.0074132793,0.00004157763],"about_ca_topic_score_codex":0.0029506187,"about_ca_topic_score_gemma":0.0023712555,"teacher_disagreement_score":0.008811067,"about_ca_system_score_codex":0.00087002007,"about_ca_system_score_gemma":0.00045002848,"threshold_uncertainty_score":0.029475927},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16615513,0.0018479357,0.6634383,0.00060345733,0.00066143397,0.00018595958,0.0016336773,0.0019567183,0.16351736],"genre_scores_gemma":[0.6206068,0.001256303,0.28452677,0.0002545764,0.00012225115,0.00013122527,0.0022090755,0.0011482796,0.08974476],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99947625,0.000059570953,0.000031643114,0.000119398115,0.00022448828,0.00008858372],"domain_scores_gemma":[0.99861264,0.00058674865,0.00011055772,0.0002903769,0.0002550856,0.00014452307],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003071425,0.00070620026,0.0010762428,0.0016172287,0.0007782365,0.0016318145,0.001148611,0.0011627018,0.013450977],"category_scores_gemma":[0.0027163154,0.00093417894,0.00049962936,0.0013026351,0.00077008764,0.0022435992,0.002567526,0.0022328917,0.0034216226],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048621756,0.000091749425,0.0014397284,0.0006286706,0.00004466519,0.00074579625,0.0006804912,0.021067891,0.026614403,0.7700817,0.018632995,0.15948568],"study_design_scores_gemma":[0.00012117222,0.00015814601,0.0012950095,0.00024477765,0.000047808433,0.0017123119,0.0005819068,0.11432199,0.023673084,0.780856,0.076923005,0.00006483031],"about_ca_topic_score_codex":0.00072170584,"about_ca_topic_score_gemma":0.0015434633,"teacher_disagreement_score":0.013450977,"about_ca_system_score_codex":0.0005025903,"about_ca_system_score_gemma":0.00029571482,"threshold_uncertainty_score":0.04499799},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16420315,0.0057956628,0.7841548,0.0013346204,0.00034779712,0.0002784944,0.0035972518,0.0005657841,0.039722476],"genre_scores_gemma":[0.8404847,0.0029561082,0.13050114,0.00039426674,0.00025330018,0.00035043375,0.0042560063,0.00028986833,0.020514162],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99919504,0.00026732622,0.000037380436,0.00016831266,0.00016015889,0.00017168258],"domain_scores_gemma":[0.9965881,0.0022002666,0.0003911102,0.00020852647,0.00030196292,0.00030999465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009510643,0.00068576576,0.0013168168,0.0015707308,0.0011173051,0.0022593732,0.0020194117,0.0016121806,0.00923845],"category_scores_gemma":[0.005318359,0.00060279603,0.001087563,0.0012699928,0.0012187219,0.0018961366,0.0017771418,0.00097550196,0.0015223033],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026116124,0.00009366017,0.0033446178,0.00041348184,0.00014771704,0.0004658541,0.00029574742,0.476453,0.0016407075,0.48027748,0.009324758,0.027281718],"study_design_scores_gemma":[0.00004095276,0.000031209012,0.0005859327,0.00003481557,0.000014807388,0.00022950115,0.00009252931,0.7450543,0.00032944887,0.2461073,0.0074528307,0.000026403442],"about_ca_topic_score_codex":0.007579784,"about_ca_topic_score_gemma":0.006377455,"teacher_disagreement_score":0.00923845,"about_ca_system_score_codex":0.0011721267,"about_ca_system_score_gemma":0.0011038397,"threshold_uncertainty_score":0.030905724},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015948934,0.00024236919,0.97925,0.0002933946,0.00008294505,0.00004765233,0.000027003307,0.00014461088,0.0039630937],"genre_scores_gemma":[0.47693983,0.00032922986,0.5082606,0.0002640657,0.00015602523,0.00028646793,0.00012869977,0.00024027973,0.01339479],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99944776,0.00019869773,0.000026958165,0.000100952224,0.00017688812,0.000048738642],"domain_scores_gemma":[0.9989478,0.00068381266,0.00007706205,0.00007480245,0.00013557122,0.00008099358],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014036648,0.00061885547,0.0016689108,0.0007793152,0.0012676126,0.0015587222,0.0022048748,0.0027685566,0.0035647983],"category_scores_gemma":[0.0030196356,0.0013698146,0.0008992948,0.0013452773,0.0014603656,0.0016266861,0.0025050987,0.0014427087,0.00048425834],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008182096,0.000034210796,0.00021458314,0.000044698892,0.000026835363,0.000059107573,0.000038582457,0.9721931,0.0008870234,0.016429516,0.00047359802,0.0095169395],"study_design_scores_gemma":[0.000010879956,0.000007160901,0.000035444653,0.0000017611179,0.0000030838096,0.0000064077485,0.0000028684021,0.99670726,0.00017247062,0.0028724086,0.00017643895,0.000003828366],"about_ca_topic_score_codex":0.004577785,"about_ca_topic_score_gemma":0.0025339434,"teacher_disagreement_score":0.004577785,"about_ca_system_score_codex":0.0012135186,"about_ca_system_score_gemma":0.001065291,"threshold_uncertainty_score":0.011925459},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09076804,0.00017749718,0.9010318,0.00012965429,0.000054003125,0.000070691895,0.0001729851,0.0005901588,0.0070052263],"genre_scores_gemma":[0.6195539,0.00021103947,0.37491181,0.00006283316,0.000025708765,0.00008143011,0.00040460768,0.00024994023,0.0044987076],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991628,0.00013032605,0.000039206734,0.00013560428,0.00042552114,0.000106493564],"domain_scores_gemma":[0.99877065,0.00053501746,0.00011875927,0.00025328642,0.00023782556,0.00008450191],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010781253,0.00068846927,0.0010960115,0.0016074743,0.0003735614,0.0017670828,0.0016018089,0.0016229323,0.004557091],"category_scores_gemma":[0.006920856,0.0008333657,0.00063336204,0.0014441842,0.00084937795,0.0021669876,0.0027959915,0.0012095625,0.0010270668],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007598851,0.00017642543,0.0028949392,0.0002387901,0.000075402015,0.0003153599,0.00021408967,0.73406965,0.012649126,0.10899803,0.004036649,0.13557167],"study_design_scores_gemma":[0.000017365055,0.000040907657,0.00014881526,0.000009742214,0.000006598692,0.00007303122,0.000027242215,0.98245126,0.0022340554,0.013994294,0.0009909599,0.0000058496307],"about_ca_topic_score_codex":0.0033189214,"about_ca_topic_score_gemma":0.002803932,"teacher_disagreement_score":0.004557091,"about_ca_system_score_codex":0.001151314,"about_ca_system_score_gemma":0.0010043374,"threshold_uncertainty_score":0.01524502},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21696022,0.010149424,0.61065525,0.002854576,0.0003988847,0.00019428153,0.0007380547,0.00142752,0.15662168],"genre_scores_gemma":[0.8223919,0.0041502584,0.12728807,0.0002458111,0.00021365423,0.00019957162,0.0005630443,0.0012483378,0.04369935],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99789315,0.00082165614,0.000096968,0.0002370467,0.00070778246,0.00024337541],"domain_scores_gemma":[0.98758173,0.009480285,0.0007122892,0.0011060836,0.00062864757,0.0004909347],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026144052,0.0012316639,0.0014812166,0.0017660267,0.0012081618,0.0039525507,0.0024589216,0.002881466,0.026529072],"category_scores_gemma":[0.022182155,0.0014601133,0.00077483885,0.0032282637,0.0017930834,0.007532929,0.0026925348,0.0025190543,0.0026239569],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00050138356,0.0001510273,0.0011289072,0.00039053673,0.00004767733,0.00019591188,0.00028423552,0.25306392,0.0025695025,0.56318396,0.014360304,0.16412266],"study_design_scores_gemma":[0.000041468596,0.00011276881,0.0004117091,0.00011186638,0.000038168717,0.000256341,0.00014630532,0.42477658,0.0011125548,0.5645267,0.008433032,0.000032523785],"about_ca_topic_score_codex":0.0008158941,"about_ca_topic_score_gemma":0.0013513286,"teacher_disagreement_score":0.026529072,"about_ca_system_score_codex":0.001834878,"about_ca_system_score_gemma":0.00055587396,"threshold_uncertainty_score":0.088748574},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.565537,0.0044985106,0.2718066,0.0011967398,0.00051111344,0.00007286305,0.00082093565,0.0006185806,0.15493774],"genre_scores_gemma":[0.9281444,0.0030381598,0.03454557,0.0001708322,0.0005094826,0.00008384476,0.0005624631,0.00075314986,0.03219204],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99945277,0.000104590596,0.000023671551,0.00014509643,0.00019365268,0.00008022245],"domain_scores_gemma":[0.9964005,0.0018924122,0.00048194418,0.00045852995,0.00036515624,0.0004015888],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006057558,0.0008473926,0.000571148,0.0020962579,0.0006715098,0.0022776166,0.0016835798,0.0007049006,0.008650261],"category_scores_gemma":[0.005075188,0.0010206806,0.0006539533,0.001582437,0.0026489354,0.0043813796,0.0017760524,0.002391078,0.000920553],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019295936,0.00005412982,0.0021226392,0.00026436846,0.000031870815,0.00019597709,0.000645405,0.02567897,0.0129916845,0.8910086,0.00477454,0.062038902],"study_design_scores_gemma":[0.000019122623,0.00004160029,0.0019701456,0.00006075865,0.000030982417,0.0003536055,0.00022190787,0.030778246,0.0046613,0.95432764,0.007503186,0.000031482086],"about_ca_topic_score_codex":0.001033339,"about_ca_topic_score_gemma":0.0008893848,"teacher_disagreement_score":0.008650261,"about_ca_system_score_codex":0.00096184225,"about_ca_system_score_gemma":0.0003248215,"threshold_uncertainty_score":0.028938055},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43993828,0.0006918538,0.53832126,0.00032681,0.000118933815,0.00023335151,0.0017293543,0.002512866,0.016127357],"genre_scores_gemma":[0.4908152,0.00029542114,0.49688455,0.00008764909,0.000035870846,0.00017999,0.004042454,0.0010092636,0.0066496357],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993843,0.00011614903,0.00004361541,0.00014991633,0.00017394382,0.00013214257],"domain_scores_gemma":[0.9979504,0.0012493695,0.00015733055,0.00030958618,0.00017657563,0.00015690381],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039964644,0.0012917627,0.0018414968,0.0012711878,0.0008009231,0.002368634,0.001681807,0.0012795414,0.008663675],"category_scores_gemma":[0.0036975998,0.0013700266,0.0011349212,0.0017846072,0.00090821786,0.0026107957,0.0022667935,0.0012174567,0.0014539486],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002117927,0.00030463398,0.0034873455,0.00082178804,0.00012767961,0.00037383262,0.00082086964,0.6713502,0.025927791,0.049394544,0.013040881,0.23223253],"study_design_scores_gemma":[0.000106829764,0.00017658526,0.00066211744,0.000053092568,0.000026391432,0.00009939441,0.00024074804,0.9498277,0.0050419397,0.04108303,0.0026599858,0.000022171631],"about_ca_topic_score_codex":0.0041201124,"about_ca_topic_score_gemma":0.009619813,"teacher_disagreement_score":0.008663675,"about_ca_system_score_codex":0.0008099249,"about_ca_system_score_gemma":0.0008776828,"threshold_uncertainty_score":0.028982937},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37866357,0.000743673,0.6031487,0.0011535124,0.00015722257,0.00037830832,0.0017614737,0.0051601892,0.008833277],"genre_scores_gemma":[0.6096282,0.00021929058,0.38336334,0.00019944797,0.00007181359,0.00017173759,0.004368767,0.0005527321,0.0014246701],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99487644,0.00073538505,0.00038851073,0.0012046612,0.0020012527,0.0007937392],"domain_scores_gemma":[0.98998874,0.0053898613,0.0010180965,0.0016842168,0.0014268389,0.0004923127],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010867056,0.0009525043,0.00231911,0.0024118826,0.0012247423,0.0033722138,0.003228276,0.0019541273,0.0058996337],"category_scores_gemma":[0.018220639,0.0013677465,0.0016857056,0.0027017184,0.0017312693,0.0042773415,0.0038906196,0.0018497241,0.0017323886],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004175058,0.0007015852,0.040198,0.001280425,0.00031756892,0.0018477478,0.0009991574,0.1566524,0.123304084,0.052775025,0.019608656,0.59814024],"study_design_scores_gemma":[0.00015220589,0.00034694886,0.0071913986,0.00006334535,0.000051577408,0.000760547,0.0008504213,0.85865724,0.0639183,0.062139463,0.0057793083,0.000089310735],"about_ca_topic_score_codex":0.0023126826,"about_ca_topic_score_gemma":0.0022974615,"teacher_disagreement_score":0.0058996337,"about_ca_system_score_codex":0.0012649177,"about_ca_system_score_gemma":0.0014328839,"threshold_uncertainty_score":0.01973623},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3184685,0.0011403125,0.5265411,0.0021375478,0.00019081667,0.0002291364,0.0018554096,0.00041801514,0.1490192],"genre_scores_gemma":[0.88481164,0.0014724289,0.055011626,0.0003001989,0.00013827051,0.00017499564,0.0026444716,0.00025063023,0.055195767],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99967396,0.00006816766,0.000013358417,0.000056280955,0.00013186247,0.000056324876],"domain_scores_gemma":[0.9990019,0.0004490576,0.00016653165,0.000106467494,0.00015630912,0.00011968464],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018986472,0.00045529357,0.00037874098,0.0012030413,0.0007712083,0.001051447,0.00082514354,0.0006323725,0.008449732],"category_scores_gemma":[0.0016952448,0.00040962506,0.00034828106,0.0009670583,0.0011114754,0.0011069519,0.0011518773,0.0010128649,0.0013800366],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000072374525,0.00003815874,0.0006371926,0.00013649972,0.000022082626,0.0005007718,0.00018534824,0.1073189,0.003959229,0.8530359,0.0073523135,0.02674119],"study_design_scores_gemma":[0.000032319283,0.000026265046,0.0010366093,0.000029640822,0.000012092785,0.00027938324,0.00013589083,0.16576019,0.0012958875,0.8110329,0.020341909,0.000016890152],"about_ca_topic_score_codex":0.003399361,"about_ca_topic_score_gemma":0.0052287197,"teacher_disagreement_score":0.008449732,"about_ca_system_score_codex":0.0006483368,"about_ca_system_score_gemma":0.00040803806,"threshold_uncertainty_score":0.028267145},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012035125,0.00004765494,0.9938672,0.000021924543,0.000039340397,0.000021844044,0.000048313337,0.0018568394,0.0028932975],"genre_scores_gemma":[0.04021622,0.00016566692,0.947724,0.0000764886,0.000026435036,0.000091076705,0.00035545338,0.0008603277,0.0104843965],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99978846,0.00001681418,0.0000070750148,0.000019335033,0.00015846979,0.000009816364],"domain_scores_gemma":[0.99981064,0.00006411859,0.0000075635407,0.000048813938,0.000059745264,0.00000921546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025808907,0.00044299185,0.0005192452,0.0005248567,0.00025667684,0.0005777304,0.0014832104,0.00081647397,0.008846147],"category_scores_gemma":[0.00060650706,0.0005197874,0.00048887334,0.0005762431,0.0002462169,0.0006075537,0.00088330545,0.0010126468,0.003317453],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000120690034,0.00010468736,0.00037783838,0.00019834914,0.000041015825,0.00019982894,0.00014951974,0.19337894,0.08085531,0.052741945,0.019135352,0.6526966],"study_design_scores_gemma":[0.000014433565,0.000027563854,0.00012733309,0.000012875204,0.000009857331,0.00015732806,0.000007933485,0.9541567,0.016839223,0.007822385,0.020811146,0.000013270992],"about_ca_topic_score_codex":0.0007386407,"about_ca_topic_score_gemma":0.0013204959,"teacher_disagreement_score":0.008846147,"about_ca_system_score_codex":0.00021650069,"about_ca_system_score_gemma":0.00041637738,"threshold_uncertainty_score":0.029593289},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.085914105,0.0035346984,0.7998788,0.00109475,0.0003597537,0.00009898673,0.0006955108,0.0003203502,0.10810307],"genre_scores_gemma":[0.53459644,0.003466506,0.40072572,0.00039500833,0.00043067537,0.00038123023,0.0023581325,0.0011582867,0.05648799],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99930656,0.00015227536,0.000035771234,0.0001525598,0.00025977867,0.00009306532],"domain_scores_gemma":[0.9987721,0.0006975628,0.00009379972,0.00016086397,0.00016552996,0.00011010763],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005825315,0.0010201144,0.0014220848,0.0013651302,0.0011646498,0.0026113158,0.0016266163,0.0011945952,0.010099255],"category_scores_gemma":[0.0041828994,0.0012778784,0.0010296436,0.001582498,0.0020506177,0.0040949536,0.0026900903,0.004014981,0.001146528],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018952883,0.00004896542,0.00021623044,0.000446915,0.000022479167,0.00008588119,0.00021591413,0.041416425,0.0038514065,0.88764346,0.008722876,0.057139877],"study_design_scores_gemma":[0.000031551153,0.00004293384,0.000409445,0.000115047354,0.000016884043,0.00022083058,0.00015791474,0.06520102,0.0030436483,0.91683364,0.013903975,0.000023122759],"about_ca_topic_score_codex":0.00052244315,"about_ca_topic_score_gemma":0.0006842991,"teacher_disagreement_score":0.010099255,"about_ca_system_score_codex":0.0007615453,"about_ca_system_score_gemma":0.00032852445,"threshold_uncertainty_score":0.033785403},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05148074,0.0003403834,0.9320168,0.00013456166,0.00014298873,0.00020082526,0.0005559003,0.0038829043,0.011244931],"genre_scores_gemma":[0.39084688,0.00032008305,0.5907564,0.00012380086,0.000077532975,0.0001964146,0.0018254046,0.0011179751,0.014735562],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991211,0.0001107543,0.000056483022,0.0002642336,0.00027819182,0.00016917208],"domain_scores_gemma":[0.99874485,0.00057845947,0.00007844247,0.0003801391,0.00011917939,0.00009884409],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070965727,0.0013438066,0.0020385163,0.00092993496,0.0006529706,0.0014177779,0.002198804,0.0013266961,0.017963367],"category_scores_gemma":[0.0032466252,0.0010045144,0.0018252365,0.0007088056,0.0011316346,0.0028014104,0.005275823,0.001764076,0.0023317547],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00094381854,0.00022946057,0.0010803951,0.0005645992,0.000120855424,0.00026250066,0.00037719286,0.37258092,0.019036477,0.06457159,0.016893936,0.5233383],"study_design_scores_gemma":[0.00004882224,0.0001171599,0.00023948327,0.000040664174,0.000018514967,0.00008325434,0.000117076925,0.9320489,0.003180527,0.060773056,0.0033146022,0.00001802343],"about_ca_topic_score_codex":0.0036208783,"about_ca_topic_score_gemma":0.0051729134,"teacher_disagreement_score":0.017963367,"about_ca_system_score_codex":0.00058759394,"about_ca_system_score_gemma":0.0006542298,"threshold_uncertainty_score":0.060093462},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008478586,0.015640412,0.019063348,0.009451459,0.007430661,0.00003891114,0.00016735226,0.00050474936,0.94685525],"genre_scores_gemma":[0.017502494,0.013219794,0.008041368,0.0054860064,0.0022636082,0.00008986094,0.000381472,0.00087001163,0.95214534],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995092,0.00013356654,0.000018843295,0.00009478841,0.00018125388,0.00006232379],"domain_scores_gemma":[0.99960953,0.00010135746,0.00001497494,0.000110973735,0.0000846539,0.000078592486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004736784,0.0008126968,0.0005150494,0.0014301357,0.0029729116,0.006027606,0.0008547674,0.0014594544,0.10228303],"category_scores_gemma":[0.001485213,0.00039456695,0.00069096114,0.0020549821,0.003022922,0.009411131,0.004291143,0.0031052276,0.038856428],"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.000010204108,0.000011195803,0.000079930775,0.00014376156,0.0000068313366,0.00006281531,0.0015463113,0.00013883907,0.00034232604,0.5081495,0.3795416,0.109966636],"study_design_scores_gemma":[8.191323e-7,0.0000029036526,0.00003777888,0.000053051896,0.0000017198798,0.00005303818,0.00026102277,0.000033763186,0.000041241703,0.041550428,0.9579617,0.000002592613],"about_ca_topic_score_codex":0.0012007019,"about_ca_topic_score_gemma":0.0032313815,"teacher_disagreement_score":0.10228303,"about_ca_system_score_codex":0.001314677,"about_ca_system_score_gemma":0.0009924519,"threshold_uncertainty_score":0.34217083},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0062815417,0.00011125287,0.9923539,0.00004408064,0.00003415949,0.000045595683,0.00006613276,0.00038846844,0.00067488034],"genre_scores_gemma":[0.065059416,0.00018846572,0.93244123,0.000036587004,0.000021101876,0.00017018212,0.0003207887,0.00013496194,0.0016271872],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993303,0.00010771751,0.000046842302,0.00013325334,0.000310933,0.00007101845],"domain_scores_gemma":[0.9986217,0.0007250445,0.00008938312,0.00015814815,0.00032130347,0.00008443928],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00097563904,0.0012658928,0.0015498284,0.001964136,0.0008656263,0.0015670275,0.0026188216,0.0015806983,0.0037440988],"category_scores_gemma":[0.0050186682,0.0007827519,0.0011524304,0.00284701,0.00076994643,0.002054369,0.0023005141,0.0016075462,0.0009768788],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023618505,0.00011603289,0.00081345375,0.00020999902,0.00007403483,0.00008329407,0.00017038026,0.67235374,0.004066165,0.026429826,0.0033673916,0.29207948],"study_design_scores_gemma":[0.000015690686,0.000022114526,0.000065400316,0.000009390018,0.000008846092,0.000024270876,0.000024155257,0.9912964,0.0006890074,0.006816784,0.001021498,0.0000064204482],"about_ca_topic_score_codex":0.009710218,"about_ca_topic_score_gemma":0.011679637,"teacher_disagreement_score":0.009710218,"about_ca_system_score_codex":0.0013416219,"about_ca_system_score_gemma":0.0017670139,"threshold_uncertainty_score":0.019307435},"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":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019496342,0.0025733162,0.013014181,0.7091244,0.0361679,0.000036507776,0.0002458838,0.0004862604,0.23640198],"genre_scores_gemma":[0.07609355,0.002745411,0.011250842,0.28009182,0.01641626,0.00017714703,0.0002520411,0.0012801478,0.61169267],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997198,0.00088566035,0.000109930006,0.00046724797,0.0009182102,0.00042097698],"domain_scores_gemma":[0.992679,0.0030992886,0.00032827002,0.0013425495,0.0017139467,0.0008369153],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037597462,0.00072512357,0.00077239354,0.0011438357,0.0075946944,0.0059253112,0.002051498,0.010408938,0.10835916],"category_scores_gemma":[0.03555221,0.00041168183,0.0007672525,0.0008857412,0.009534938,0.010869914,0.00619375,0.014409,0.033372138],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003812405,0.000014455334,0.00012270802,0.000031697316,0.0000056085364,0.00025501812,0.00044323492,0.000083194536,0.000086261236,0.26033044,0.72119284,0.017396437],"study_design_scores_gemma":[0.00001990467,0.000008457168,0.00007495749,0.00006885535,0.0000038686007,0.0005517126,0.0008661966,0.00018429758,0.00009687268,0.1637946,0.8343116,0.00001862595],"about_ca_topic_score_codex":0.0048251837,"about_ca_topic_score_gemma":0.006227728,"teacher_disagreement_score":0.10835916,"about_ca_system_score_codex":0.0019958634,"about_ca_system_score_gemma":0.002061572,"threshold_uncertainty_score":0.3624975},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08393648,0.0064617717,0.77210724,0.0048049153,0.00063426304,0.0008056113,0.0021559277,0.0048303823,0.12426343],"genre_scores_gemma":[0.5845473,0.004151711,0.37609223,0.0020380171,0.001246931,0.0013283751,0.003772091,0.002826486,0.023996975],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99049824,0.0018523921,0.00041743641,0.0015717351,0.0031623247,0.0024978644],"domain_scores_gemma":[0.961601,0.025428254,0.0025711535,0.004916996,0.0031029978,0.0023795685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0052493587,0.0032367015,0.00275108,0.002882495,0.0035254334,0.007934424,0.008434386,0.004102716,0.02433653],"category_scores_gemma":[0.038619924,0.0015358047,0.0025200597,0.0041383994,0.0032459958,0.013271951,0.007035111,0.0046652732,0.006340487],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020492503,0.0008856223,0.003695541,0.001507033,0.00022972882,0.00047392666,0.00064726436,0.43977186,0.011141057,0.35643777,0.036004994,0.14715585],"study_design_scores_gemma":[0.0001435773,0.00022172106,0.0005585675,0.00014507468,0.00011380387,0.00043558262,0.00018019608,0.862464,0.0042634043,0.11957005,0.0118323425,0.00007168394],"about_ca_topic_score_codex":0.0071415617,"about_ca_topic_score_gemma":0.009051842,"teacher_disagreement_score":0.02433653,"about_ca_system_score_codex":0.007573534,"about_ca_system_score_gemma":0.003965565,"threshold_uncertainty_score":0.081413746},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0870551,0.0011529031,0.8863273,0.0021267664,0.0002748772,0.000158763,0.00059102935,0.00026819363,0.022044994],"genre_scores_gemma":[0.60470265,0.0022458844,0.3179042,0.0003493609,0.0007442137,0.00057313184,0.0022100827,0.0006617722,0.07060866],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99776924,0.0008648277,0.00012854075,0.0004725921,0.00051952695,0.000245251],"domain_scores_gemma":[0.99113023,0.0065240115,0.0007229891,0.00058090594,0.0004600433,0.00058177725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032106966,0.0011634085,0.003012216,0.0019982413,0.0023928476,0.0037156048,0.0042473953,0.006285064,0.015901728],"category_scores_gemma":[0.023320444,0.0012831673,0.0022469575,0.0028232895,0.0029629937,0.008314324,0.005736447,0.004774624,0.0016058917],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033009605,0.00013365112,0.00077234645,0.00020256106,0.00005959182,0.00025246834,0.00026003737,0.19599108,0.0005829488,0.76239324,0.008516802,0.030505113],"study_design_scores_gemma":[0.000059390462,0.00006938206,0.00018300845,0.00004151591,0.000020640626,0.00014167727,0.00015054538,0.37455082,0.0004012557,0.6203192,0.0040298565,0.000032689455],"about_ca_topic_score_codex":0.0037063337,"about_ca_topic_score_gemma":0.003012786,"teacher_disagreement_score":0.015901728,"about_ca_system_score_codex":0.0019007256,"about_ca_system_score_gemma":0.0017025716,"threshold_uncertainty_score":0.05319655},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31838378,0.0040550125,0.64498174,0.0011248834,0.00040087616,0.000095328556,0.0010039703,0.002549242,0.027405089],"genre_scores_gemma":[0.786001,0.0023497855,0.19828402,0.00020684776,0.0003754624,0.00012354049,0.0014160671,0.0012948506,0.009948341],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989588,0.00020152036,0.000033899545,0.00022377948,0.00043525037,0.00014663479],"domain_scores_gemma":[0.9953425,0.0028187933,0.0002995592,0.00091482676,0.00036920296,0.00025501326],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012353943,0.0018401212,0.0014968864,0.002196744,0.00063128886,0.0017514643,0.0026706427,0.0014584679,0.0071065254],"category_scores_gemma":[0.011599466,0.00078821747,0.0007446528,0.0026338615,0.0016505867,0.0044935904,0.0021417292,0.0020782028,0.0013825025],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010855304,0.00021391298,0.004341809,0.0005410566,0.00013777293,0.0002179134,0.0002953634,0.61765903,0.021962881,0.114029475,0.014261861,0.22525337],"study_design_scores_gemma":[0.000037934227,0.00009941436,0.0008782406,0.000033834644,0.000030300964,0.00014460016,0.00007352045,0.88927704,0.003785449,0.10276298,0.0028583785,0.000018304021],"about_ca_topic_score_codex":0.003272508,"about_ca_topic_score_gemma":0.0043443884,"teacher_disagreement_score":0.0071065254,"about_ca_system_score_codex":0.0018484956,"about_ca_system_score_gemma":0.0006982187,"threshold_uncertainty_score":0.02377367},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0074621835,0.00043128018,0.98035634,0.00017518488,0.00011509851,0.00004648188,0.00023610512,0.0018072776,0.009370138],"genre_scores_gemma":[0.14188097,0.0018041348,0.83535326,0.0002953289,0.000080991915,0.00024775328,0.0013854293,0.0016588797,0.017293293],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996792,0.00009232109,0.00002236825,0.000072602,0.00009680207,0.000036736805],"domain_scores_gemma":[0.99928266,0.00029617845,0.000038033308,0.00022973031,0.000111196634,0.000042294527],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004147312,0.0010881138,0.0011362431,0.0013429328,0.00086990686,0.0023534724,0.0019956545,0.001038592,0.01082869],"category_scores_gemma":[0.0022227522,0.0007269879,0.0010815206,0.002827665,0.0011990686,0.0048392625,0.0034051037,0.0020091208,0.0023043882],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015313776,0.000042068936,0.00027022036,0.0003620499,0.00004060348,0.00014844291,0.0008286433,0.17423667,0.0060006604,0.53848475,0.01450235,0.2649305],"study_design_scores_gemma":[0.00002206002,0.000033322092,0.00008186011,0.00012267524,0.000028993118,0.00014664153,0.00026241856,0.5004873,0.0037373628,0.444391,0.050651494,0.000034752145],"about_ca_topic_score_codex":0.0049091964,"about_ca_topic_score_gemma":0.005001399,"teacher_disagreement_score":0.01082869,"about_ca_system_score_codex":0.0006672732,"about_ca_system_score_gemma":0.0003341776,"threshold_uncertainty_score":0.036225617},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14912741,0.00051082944,0.8354454,0.00093006954,0.0000503356,0.0000803102,0.00062919833,0.0006167759,0.0126097],"genre_scores_gemma":[0.9541383,0.0006228648,0.035927434,0.00016495338,0.000072032424,0.00016105818,0.0007449958,0.00023851075,0.00792994],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99906355,0.00027501362,0.000056905046,0.00016361973,0.00029863635,0.00014226635],"domain_scores_gemma":[0.988672,0.006098683,0.0023310403,0.0009490529,0.0011362989,0.0008130197],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002178847,0.0009439875,0.0018061118,0.002004058,0.0014144045,0.0044418657,0.0032998794,0.0029751034,0.007883503],"category_scores_gemma":[0.015028385,0.0012225866,0.0014880827,0.0021863896,0.0019229851,0.005191033,0.00311674,0.0019494893,0.001080869],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016197156,0.00008476879,0.0021365175,0.000065573615,0.00005025278,0.00011088478,0.00019413227,0.6662406,0.0011111301,0.31726682,0.0016563141,0.010921061],"study_design_scores_gemma":[0.000009745989,0.000020212481,0.00012719794,0.00001038868,0.0000099988165,0.0000351344,0.000031092342,0.93521416,0.0001878602,0.06392615,0.00041411904,0.000013860473],"about_ca_topic_score_codex":0.0051417425,"about_ca_topic_score_gemma":0.0028756845,"teacher_disagreement_score":0.007883503,"about_ca_system_score_codex":0.0020622106,"about_ca_system_score_gemma":0.0013804705,"threshold_uncertainty_score":0.02637291},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03443387,0.00015856199,0.9611497,0.00019809442,0.00010021078,0.00007680467,0.00011871578,0.0004423078,0.0033217391],"genre_scores_gemma":[0.5954807,0.0004781181,0.38460752,0.00035729245,0.0002876615,0.00024013687,0.0011092416,0.00071232935,0.016727146],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9960039,0.00097345514,0.00021187234,0.0010309395,0.001469484,0.00031039823],"domain_scores_gemma":[0.99279356,0.002496726,0.0008041408,0.0023732178,0.0010953035,0.00043699867],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002748678,0.0011953203,0.0018975387,0.002835211,0.0010044125,0.0034823385,0.0034629395,0.0035294455,0.007269444],"category_scores_gemma":[0.02114738,0.0015631373,0.001744614,0.003020059,0.0025270935,0.0063644596,0.009785271,0.0033685444,0.0027944762],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00084784365,0.00029963543,0.0036493428,0.00058625446,0.00021063548,0.00062842923,0.0006526191,0.1607947,0.03560574,0.56088537,0.008575687,0.22726376],"study_design_scores_gemma":[0.000052404328,0.00017986172,0.00058488996,0.000048280348,0.000041409003,0.0003060581,0.00015810465,0.4651278,0.013576857,0.51398784,0.00590572,0.000030860254],"about_ca_topic_score_codex":0.0006632651,"about_ca_topic_score_gemma":0.0005653659,"teacher_disagreement_score":0.007269444,"about_ca_system_score_codex":0.0010405554,"about_ca_system_score_gemma":0.0007881036,"threshold_uncertainty_score":0.024318695},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024111569,0.00014848608,0.97146106,0.00017024209,0.00003205604,0.000022286245,0.00020794642,0.0004274428,0.00341882],"genre_scores_gemma":[0.4719207,0.00063643645,0.51158917,0.00014162008,0.00007101044,0.00009485968,0.0011767021,0.00044933002,0.013920174],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996176,0.00007383408,0.00001581742,0.00010553111,0.000118494296,0.00006876969],"domain_scores_gemma":[0.9987431,0.000446312,0.00020988894,0.00028343318,0.00018547187,0.00013178642],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044441188,0.0005568901,0.00054532057,0.001403592,0.00069290353,0.0017736617,0.001182638,0.0010850701,0.008167466],"category_scores_gemma":[0.0041933777,0.00073844125,0.0007579131,0.0017066177,0.001415357,0.0029006714,0.0021733006,0.0016335525,0.0012757642],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018433171,0.00008025309,0.0020427327,0.0001855271,0.000048541857,0.00013179134,0.00023445598,0.4166535,0.0062488397,0.44799665,0.0059830793,0.12021019],"study_design_scores_gemma":[0.000028620025,0.000053429736,0.0005178504,0.00003253327,0.000027177693,0.000117384174,0.00008821508,0.63169193,0.0019947765,0.3592451,0.00617737,0.000025573458],"about_ca_topic_score_codex":0.0024083252,"about_ca_topic_score_gemma":0.0037903087,"teacher_disagreement_score":0.008167466,"about_ca_system_score_codex":0.0007439219,"about_ca_system_score_gemma":0.0005801268,"threshold_uncertainty_score":0.027322948},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5568163,0.0010598295,0.4235568,0.00068651116,0.00010299243,0.00021717686,0.0028959622,0.0013381653,0.013326214],"genre_scores_gemma":[0.55126214,0.0009741718,0.43389305,0.00010538086,0.000037532016,0.00015987403,0.007480926,0.00036132502,0.0057256813],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995652,0.000078341836,0.000035865418,0.00008760258,0.00015825471,0.00007474746],"domain_scores_gemma":[0.9973907,0.001380844,0.00033086966,0.00037580723,0.00036916105,0.00015265554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028263568,0.00045483178,0.00082550885,0.0022510204,0.00092797104,0.001474105,0.0010842418,0.0011041289,0.0052459734],"category_scores_gemma":[0.005035614,0.0005421583,0.0006654134,0.0027560347,0.000988144,0.0024242003,0.0015083805,0.0009816132,0.0008523709],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038401783,0.00019683495,0.018048678,0.0013016971,0.00014272383,0.0009957997,0.0012797476,0.2879666,0.023003435,0.28599322,0.021303158,0.3593841],"study_design_scores_gemma":[0.00007297855,0.00012643293,0.005097728,0.0002111322,0.00008202453,0.000850952,0.0012156831,0.5726679,0.014100571,0.3861571,0.01936244,0.000055089364],"about_ca_topic_score_codex":0.002670188,"about_ca_topic_score_gemma":0.0046363194,"teacher_disagreement_score":0.0052459734,"about_ca_system_score_codex":0.0008195189,"about_ca_system_score_gemma":0.00055007,"threshold_uncertainty_score":0.017549574},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35119113,0.005068612,0.38701236,0.0030510686,0.00038394122,0.00015493385,0.0009131296,0.00038919805,0.2518357],"genre_scores_gemma":[0.81987894,0.006542125,0.11575458,0.00075503305,0.0006476451,0.0001958723,0.0015889499,0.00059647963,0.054040372],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995739,0.00010520384,0.000020147807,0.0000886572,0.000148872,0.000063340565],"domain_scores_gemma":[0.9986682,0.00074430037,0.00017326737,0.00012758488,0.00018737922,0.00009938131],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047092,0.00090608775,0.00063158316,0.0023796875,0.0010803537,0.0022644233,0.0013407603,0.0009633431,0.009856295],"category_scores_gemma":[0.004044903,0.0009910841,0.0010200042,0.0018734836,0.0020434891,0.0036727462,0.0024719716,0.0041929735,0.0011902297],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007552098,0.0000202456,0.00054066477,0.00015972719,0.00001583883,0.000102852806,0.00028923296,0.0073260753,0.0031217136,0.95293015,0.00358726,0.03183069],"study_design_scores_gemma":[0.000015424152,0.000033037926,0.00054622674,0.00006537643,0.000031081756,0.00027254055,0.00022423409,0.020804208,0.002008879,0.9638645,0.012117524,0.000016861799],"about_ca_topic_score_codex":0.0015425561,"about_ca_topic_score_gemma":0.0013991565,"teacher_disagreement_score":0.009856295,"about_ca_system_score_codex":0.0008493485,"about_ca_system_score_gemma":0.00027154913,"threshold_uncertainty_score":0.032972574},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049537744,0.00040148728,0.93467396,0.0001538303,0.000079212994,0.000042069703,0.00039480603,0.0004115941,0.014305277],"genre_scores_gemma":[0.41022056,0.0011554599,0.5710636,0.00007796674,0.00009825559,0.00012737853,0.001147341,0.00055916613,0.01555039],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99955636,0.000079648555,0.000026138368,0.00006546852,0.00024023883,0.000032183536],"domain_scores_gemma":[0.99926585,0.0003131125,0.00006676998,0.00019347195,0.00010481087,0.00005594723],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030920174,0.00063057936,0.0007675959,0.0011155747,0.00037043358,0.0013141255,0.0015548147,0.0008248098,0.004662376],"category_scores_gemma":[0.00221334,0.00064592774,0.00052856276,0.0015020903,0.0007107855,0.00243987,0.0025256863,0.002193164,0.0013683934],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015974417,0.00009850127,0.0005098561,0.0003824242,0.000048818245,0.00023941047,0.00045548848,0.17888168,0.01501844,0.56398356,0.0087762885,0.23144577],"study_design_scores_gemma":[0.00002150557,0.000059320035,0.00028288047,0.00006093846,0.000021880678,0.00030431917,0.00009963601,0.5353281,0.0059126224,0.44123772,0.016644185,0.000026902582],"about_ca_topic_score_codex":0.0006378474,"about_ca_topic_score_gemma":0.0010110943,"teacher_disagreement_score":0.004662376,"about_ca_system_score_codex":0.00036938832,"about_ca_system_score_gemma":0.00023792911,"threshold_uncertainty_score":0.015597165},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13395621,0.0014924236,0.77284324,0.0027511667,0.0006607496,0.00017099032,0.0009718871,0.0006246674,0.08652868],"genre_scores_gemma":[0.68351847,0.0016968487,0.23727739,0.00053596654,0.00031728754,0.00024235464,0.0019619637,0.00054007233,0.07390968],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996631,0.0000854479,0.000013734155,0.00008970112,0.00007802418,0.0000699419],"domain_scores_gemma":[0.9994635,0.0002639148,0.000043982152,0.00008427481,0.000036527883,0.00010780649],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034755448,0.0006493485,0.0011778977,0.00047467076,0.00082851015,0.0016222232,0.0015296552,0.0023875022,0.014255577],"category_scores_gemma":[0.0024174121,0.00051385583,0.0006615461,0.00092611834,0.00110266,0.0026700026,0.0020510373,0.002171775,0.0018867933],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000410609,0.00019451478,0.00053648587,0.00039863496,0.00004727769,0.000536699,0.00024061764,0.11958772,0.0028577032,0.7247204,0.029080493,0.12138877],"study_design_scores_gemma":[0.00013092092,0.000056185017,0.00022734348,0.000049071477,0.000016519545,0.0002180369,0.00016089028,0.30106604,0.0012264178,0.6807186,0.016106654,0.000023445065],"about_ca_topic_score_codex":0.0013043812,"about_ca_topic_score_gemma":0.0011615958,"teacher_disagreement_score":0.014255577,"about_ca_system_score_codex":0.00041040423,"about_ca_system_score_gemma":0.0006035146,"threshold_uncertainty_score":0.047689676},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14563993,0.0020188373,0.5411479,0.0011373372,0.00032449706,0.000369408,0.0027333824,0.0017905628,0.30483815],"genre_scores_gemma":[0.50514734,0.0038209234,0.27562636,0.0005070627,0.00018962931,0.0003482562,0.005629408,0.0011519784,0.20757903],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998522,0.00002118301,0.0000069500775,0.00004577468,0.000047994246,0.000025949117],"domain_scores_gemma":[0.9996525,0.000103124206,0.000035329373,0.00011654108,0.000060237522,0.00003232731],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000947299,0.0005650168,0.00041140095,0.00072592346,0.00054320577,0.000841,0.0009604375,0.00045514468,0.01566753],"category_scores_gemma":[0.00070781563,0.0004996003,0.0004263174,0.0009959808,0.00047996745,0.0015474637,0.00091134245,0.0008730594,0.0044257175],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015309636,0.000083744795,0.0007639072,0.0012201222,0.00006461756,0.00059635175,0.00038813122,0.022521323,0.046735514,0.6726679,0.034430664,0.22037469],"study_design_scores_gemma":[0.00006029815,0.000106764935,0.0019001858,0.00016552089,0.00012799262,0.00204267,0.0002883646,0.04263588,0.03819251,0.7470595,0.16738868,0.00003162208],"about_ca_topic_score_codex":0.00061597564,"about_ca_topic_score_gemma":0.0013389584,"teacher_disagreement_score":0.01566753,"about_ca_system_score_codex":0.00035862086,"about_ca_system_score_gemma":0.00023422536,"threshold_uncertainty_score":0.052413106},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011194887,0.00019478513,0.98559463,0.000046268877,0.000031867166,0.000084820815,0.00017425892,0.001268931,0.0014094897],"genre_scores_gemma":[0.15804914,0.00046747655,0.8356174,0.00005714022,0.00006439304,0.00013490919,0.0012093729,0.0011449126,0.0032552301],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99864644,0.00020140817,0.00004297058,0.00020112717,0.0007641957,0.00014385526],"domain_scores_gemma":[0.9984541,0.00063911563,0.00009557307,0.00029250045,0.00039116203,0.0001275552],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007438117,0.0015034246,0.002517629,0.0019546472,0.0005015396,0.0019634191,0.0019355393,0.0014026973,0.010718277],"category_scores_gemma":[0.0039831456,0.0012934566,0.0013542436,0.001992761,0.0005193828,0.0014836427,0.0025166185,0.0020657915,0.004914223],"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.00067379413,0.00012628274,0.0011292347,0.0005116856,0.000105782994,0.00041834018,0.00033039585,0.08483848,0.1085704,0.0155849485,0.01417963,0.7735311],"study_design_scores_gemma":[0.00004292844,0.00010601874,0.00048737557,0.00003750979,0.000018487042,0.0003118484,0.0001093541,0.95591444,0.02969076,0.0085153775,0.004737965,0.00002786901],"about_ca_topic_score_codex":0.0014219906,"about_ca_topic_score_gemma":0.0026949432,"teacher_disagreement_score":0.010718277,"about_ca_system_score_codex":0.00045498554,"about_ca_system_score_gemma":0.00047197047,"threshold_uncertainty_score":0.035856247},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5595967,0.0007131843,0.35760117,0.0007046956,0.0002581847,0.000108624015,0.0005284063,0.00089261995,0.07959635],"genre_scores_gemma":[0.9452396,0.00037748506,0.035144366,0.00016603903,0.000116400224,0.000056729103,0.00050360896,0.0003411466,0.018054562],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994105,0.00012903516,0.00003196672,0.00010681375,0.00014847041,0.0001732965],"domain_scores_gemma":[0.99838126,0.00057653803,0.00029184166,0.00026020678,0.0002014461,0.00028870744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047638055,0.0004395657,0.0005345474,0.0018819064,0.001097757,0.0022742026,0.000873485,0.0008245018,0.0077234693],"category_scores_gemma":[0.0031126419,0.00041438386,0.0006896164,0.0009748511,0.002077225,0.0029015501,0.0027017763,0.0013563425,0.0014878552],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008669553,0.000040867406,0.0012227778,0.00006590544,0.000011790676,0.00018033489,0.0004241754,0.003395791,0.002838158,0.96584344,0.0036697017,0.02222045],"study_design_scores_gemma":[0.000023783266,0.00003340609,0.0009803079,0.000037754195,0.000015553018,0.00035972794,0.00036094463,0.022239259,0.0027062935,0.96608824,0.0071316576,0.000023106755],"about_ca_topic_score_codex":0.0015415591,"about_ca_topic_score_gemma":0.0020403487,"teacher_disagreement_score":0.0077234693,"about_ca_system_score_codex":0.0010485501,"about_ca_system_score_gemma":0.00031526582,"threshold_uncertainty_score":0.0258376},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24408484,0.0024685934,0.6125607,0.0023654206,0.00071847386,0.0004100305,0.0040317094,0.0021700037,0.13119027],"genre_scores_gemma":[0.6890797,0.0019699356,0.27944186,0.0009511393,0.0004741167,0.00029927143,0.006784598,0.00040787287,0.02059145],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986124,0.00018973113,0.00009564896,0.0004324527,0.00048042214,0.00018930856],"domain_scores_gemma":[0.9980392,0.0006442632,0.00037686512,0.00040063323,0.0003324678,0.0002066642],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00044408478,0.0008209598,0.00057046686,0.0017134382,0.00082897005,0.0014413855,0.00102182,0.00103859,0.008274732],"category_scores_gemma":[0.002375635,0.00032607125,0.0004641991,0.0016582847,0.0019589188,0.0023925207,0.0017320209,0.0009799303,0.0026249879],"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.00037840335,0.00020529775,0.0072270017,0.0007110466,0.00016915798,0.0010922197,0.00058454723,0.02530634,0.03996761,0.72828513,0.03208321,0.16398992],"study_design_scores_gemma":[0.00004652471,0.00038169677,0.007320957,0.00025159755,0.00012158551,0.0053105713,0.00076419365,0.08082967,0.022376627,0.59500635,0.28747308,0.00011709916],"about_ca_topic_score_codex":0.0005515476,"about_ca_topic_score_gemma":0.0007989027,"teacher_disagreement_score":0.99172527,"about_ca_system_score_codex":0.0006797095,"about_ca_system_score_gemma":0.0004464496,"threshold_uncertainty_score":0},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5090694,0.0015219606,0.45278257,0.0014451257,0.00010705006,0.0002460629,0.0024086277,0.0007211736,0.03169808],"genre_scores_gemma":[0.73421717,0.0017243607,0.24354358,0.00031929603,0.00008252426,0.00027778462,0.0041337027,0.00020239869,0.015499194],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99929905,0.00018390508,0.00004271126,0.00019478805,0.00016980435,0.000109669476],"domain_scores_gemma":[0.9979874,0.001091363,0.00038562436,0.00021559032,0.00017594105,0.00014414814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003889867,0.00061942055,0.000627325,0.0013904043,0.0006529929,0.0012640251,0.0009872731,0.00087060465,0.005657987],"category_scores_gemma":[0.0037617774,0.0006677254,0.00051232136,0.002216396,0.0009469512,0.002062238,0.0016070503,0.0008765566,0.000773623],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00050404714,0.00010286294,0.0042925645,0.00037677353,0.00008418856,0.0012278188,0.00077306555,0.34274393,0.011560435,0.5532786,0.009248951,0.07580667],"study_design_scores_gemma":[0.00010898445,0.0000794879,0.002906093,0.00009990471,0.000033619533,0.0005124513,0.00042853813,0.47403446,0.0030599032,0.49752897,0.021172147,0.000035419274],"about_ca_topic_score_codex":0.0030066434,"about_ca_topic_score_gemma":0.0035522373,"teacher_disagreement_score":0.005657987,"about_ca_system_score_codex":0.00095811195,"about_ca_system_score_gemma":0.0003161875,"threshold_uncertainty_score":0.018927872},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035513586,0.00005748873,0.99012345,0.000051565992,0.000057871475,0.000036138004,0.000108172404,0.0014053673,0.004608646],"genre_scores_gemma":[0.17277762,0.00041978183,0.81388915,0.00017846037,0.000050754014,0.00021613688,0.00059565867,0.0019330555,0.009939477],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99969697,0.000036111716,0.000017260194,0.000029012042,0.00020051764,0.000020037685],"domain_scores_gemma":[0.9995004,0.00019756822,0.000025366795,0.00013943385,0.00011221565,0.00002498972],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049905386,0.00068151,0.00080115243,0.0006879587,0.0005392249,0.0012407245,0.0020324867,0.0013354104,0.008955751],"category_scores_gemma":[0.0014675949,0.00075641007,0.0012963099,0.0007686913,0.0007480497,0.00075807166,0.00204424,0.0011295236,0.0026831042],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003595989,0.000049123315,0.0006405969,0.00020418919,0.000051710434,0.00022540809,0.00020991436,0.7657885,0.011848152,0.062724106,0.0039207353,0.15430163],"study_design_scores_gemma":[0.000005008912,0.000009545451,0.000034747027,0.000010549258,0.000006192334,0.000067912166,0.000017305427,0.97908884,0.0038657365,0.008890363,0.0079964325,0.0000073898827],"about_ca_topic_score_codex":0.0035155271,"about_ca_topic_score_gemma":0.004409368,"teacher_disagreement_score":0.008955751,"about_ca_system_score_codex":0.00047320407,"about_ca_system_score_gemma":0.00054369244,"threshold_uncertainty_score":0.029959977},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05055131,0.031342234,0.7545923,0.08230911,0.0038901814,0.00010189729,0.0015290185,0.0024300746,0.07325385],"genre_scores_gemma":[0.62108505,0.025957858,0.27642807,0.024901252,0.008596698,0.0006042423,0.0026508307,0.004893859,0.03488218],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99228466,0.0026749556,0.00028168198,0.001496198,0.0021725479,0.0010899517],"domain_scores_gemma":[0.90062225,0.06893673,0.0029632272,0.017324243,0.006033467,0.004120092],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011436196,0.0031699121,0.0038840282,0.0037744183,0.0029651173,0.008750706,0.006195972,0.0057567656,0.026795296],"category_scores_gemma":[0.074672,0.0021854963,0.0023067873,0.0045210584,0.01009516,0.05030024,0.01225183,0.022879811,0.0064363857],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003880429,0.000128861,0.0010710733,0.0007159903,0.00010392279,0.00006193121,0.00040112922,0.022483794,0.001051085,0.8781023,0.041444063,0.05404772],"study_design_scores_gemma":[0.000019671586,0.000024944551,0.0001269038,0.000116114235,0.00002779339,0.000033949895,0.00009895292,0.01296762,0.00029644332,0.97867006,0.0076021,0.000015385902],"about_ca_topic_score_codex":0.0023125329,"about_ca_topic_score_gemma":0.0025760124,"teacher_disagreement_score":0.026795296,"about_ca_system_score_codex":0.0037247052,"about_ca_system_score_gemma":0.0018798565,"threshold_uncertainty_score":0.08963919},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13625135,0.0020529116,0.7970045,0.0032002523,0.0004083545,0.00008891616,0.0005602812,0.00050593645,0.05992755],"genre_scores_gemma":[0.80479467,0.0028303477,0.1371085,0.0006655328,0.00046386936,0.000192052,0.0006948274,0.00055166875,0.052698515],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99965024,0.000107872,0.000016669193,0.00007524434,0.000111573274,0.000038427523],"domain_scores_gemma":[0.9983575,0.00071038684,0.00021991349,0.00019853267,0.00030023142,0.00021336711],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007384556,0.00065217604,0.00081939274,0.0024707443,0.0013684442,0.0014980428,0.0015112378,0.0016112508,0.007806572],"category_scores_gemma":[0.0045287823,0.0005119289,0.00075852004,0.002195086,0.0025701786,0.003813106,0.0024125746,0.0023201208,0.0009175888],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019578732,0.000013064542,0.00016609863,0.00003701728,0.000005280194,0.00002105166,0.00004869441,0.010217613,0.00048346102,0.9824562,0.0011528082,0.005379035],"study_design_scores_gemma":[0.0000072122516,0.000009004411,0.00009776737,0.000010569776,0.000004338229,0.000043713513,0.000029614142,0.05789206,0.00029434997,0.93879336,0.002808146,0.000009805266],"about_ca_topic_score_codex":0.0016697119,"about_ca_topic_score_gemma":0.0015248815,"teacher_disagreement_score":0.007806572,"about_ca_system_score_codex":0.001164098,"about_ca_system_score_gemma":0.00079086993,"threshold_uncertainty_score":0.026115596},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0354322,0.00045494677,0.8543366,0.00022144718,0.0006960908,0.00018122474,0.00058101164,0.0016908814,0.1064056],"genre_scores_gemma":[0.24641405,0.0012921556,0.6790872,0.00026003126,0.00022792703,0.00018577899,0.0011841507,0.0013522574,0.06999643],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996935,0.000045816723,0.00001857554,0.000058600148,0.00014126467,0.000042237334],"domain_scores_gemma":[0.9996247,0.00006167165,0.000030001895,0.00013471805,0.00010834691,0.000040525876],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002039955,0.0007535129,0.00059383013,0.0010992714,0.00038248932,0.000930986,0.00062737643,0.000585148,0.024388194],"category_scores_gemma":[0.00099433,0.0006781918,0.0004623089,0.0009356457,0.0006464204,0.0009294753,0.0014071019,0.0010775488,0.006828588],"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.0004826935,0.000091987764,0.00060876523,0.0003923245,0.000043558364,0.00041298103,0.00022160131,0.026094673,0.058250763,0.25990957,0.034281265,0.61920977],"study_design_scores_gemma":[0.00022627403,0.0005936286,0.0028750894,0.00028835208,0.00012662378,0.0053556,0.0005744172,0.32806826,0.0823431,0.22082995,0.35855335,0.00016533765],"about_ca_topic_score_codex":0.00057392503,"about_ca_topic_score_gemma":0.001014093,"teacher_disagreement_score":0.024388194,"about_ca_system_score_codex":0.00015932095,"about_ca_system_score_gemma":0.00038750548,"threshold_uncertainty_score":0.08158666},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13097838,0.0009987007,0.83662766,0.00026382366,0.00010541404,0.00014717336,0.0008201316,0.00030534578,0.02975346],"genre_scores_gemma":[0.7959853,0.0011094745,0.18789358,0.000095644195,0.00014738328,0.00022499621,0.0013139431,0.00014744459,0.01308229],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99864763,0.00026741865,0.0000949583,0.00022048861,0.00064148626,0.00012808708],"domain_scores_gemma":[0.99837625,0.00064898725,0.00024897055,0.00012453865,0.00047771103,0.00012346041],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057114306,0.00035744722,0.00046251275,0.0023474412,0.0007885735,0.0030416513,0.0009202378,0.00043913975,0.004664217],"category_scores_gemma":[0.004035716,0.00028104146,0.00051424734,0.0012114916,0.0016749972,0.0018117118,0.0013976044,0.0007189836,0.00084724324],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026007625,0.0000084896565,0.0005178258,0.000058185997,0.000007878938,0.000061418636,0.00030664133,0.019620849,0.0012868842,0.9611594,0.00060140813,0.01634502],"study_design_scores_gemma":[0.000017712051,0.000023356732,0.0006354721,0.00003756929,0.000007103205,0.00023542943,0.0002583734,0.114190005,0.0014497727,0.85794157,0.025181642,0.00002190127],"about_ca_topic_score_codex":0.002506251,"about_ca_topic_score_gemma":0.0018775807,"teacher_disagreement_score":0.004664217,"about_ca_system_score_codex":0.0011356139,"about_ca_system_score_gemma":0.0005792519,"threshold_uncertainty_score":0.0156033635},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05798138,0.0015985324,0.92771095,0.0009923261,0.00014971143,0.00011994518,0.00042735745,0.0006799697,0.010339956],"genre_scores_gemma":[0.22923437,0.0021361674,0.7541631,0.000169495,0.00012812481,0.00025232462,0.0011181771,0.0002874034,0.012510872],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994748,0.00014925798,0.000034937013,0.00013160857,0.00012857642,0.00008087341],"domain_scores_gemma":[0.99943846,0.0002756828,0.000070775415,0.000091105656,0.0000810973,0.000042766544],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000553426,0.00064748153,0.000853118,0.00082736026,0.00076434633,0.001336672,0.001711697,0.00094663276,0.005079574],"category_scores_gemma":[0.003313895,0.00063868845,0.0009209799,0.0015234787,0.0005793916,0.004679732,0.0011157183,0.001188605,0.0010698778],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030039775,0.00014377761,0.00137236,0.0003133929,0.00005388396,0.00025421847,0.00030154787,0.56498414,0.00267089,0.21633601,0.02068902,0.19258039],"study_design_scores_gemma":[0.00003088386,0.00005484168,0.0002065141,0.0000274065,0.0000140986585,0.00011109037,0.00011822768,0.91914225,0.0009020183,0.06741144,0.011969275,0.0000119060605],"about_ca_topic_score_codex":0.013614399,"about_ca_topic_score_gemma":0.011338406,"teacher_disagreement_score":0.013614399,"about_ca_system_score_codex":0.001327205,"about_ca_system_score_gemma":0.00097210385,"threshold_uncertainty_score":0.027070284},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0842876,0.0012359441,0.8997373,0.0016518888,0.00026681603,0.000119651704,0.00028236053,0.00015874815,0.012259611],"genre_scores_gemma":[0.8028117,0.0013826732,0.1868901,0.00028104964,0.00015834528,0.00018658808,0.00026586847,0.00016033958,0.007863399],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996656,0.000107677646,0.000016594535,0.000049379352,0.00012477182,0.00003597097],"domain_scores_gemma":[0.9974928,0.00204263,0.00011950384,0.00008113077,0.00018378971,0.00008013871],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000918247,0.0006501033,0.0005696179,0.0009479397,0.00040138938,0.0006840781,0.0012265963,0.0011352423,0.0043635066],"category_scores_gemma":[0.0064023985,0.0003623214,0.00035278907,0.0009901904,0.0010995279,0.0011816673,0.0014359991,0.0006099319,0.00025076946],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015122074,0.000024904886,0.0008050183,0.00016202233,0.0000147731025,0.000052286465,0.00008979223,0.9248376,0.002522855,0.03979398,0.0020601018,0.029485455],"study_design_scores_gemma":[0.000005512333,0.000019119354,0.00011249668,0.000008243029,0.0000030558456,0.000015465648,0.000026221913,0.99371207,0.0002721837,0.0054836995,0.00033787798,0.000004097285],"about_ca_topic_score_codex":0.0065927757,"about_ca_topic_score_gemma":0.005084225,"teacher_disagreement_score":0.0065927757,"about_ca_system_score_codex":0.001431916,"about_ca_system_score_gemma":0.0007376668,"threshold_uncertainty_score":0.014597356},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044990435,0.00009439983,0.919009,0.00013781279,0.00014502338,0.000101178346,0.00010781715,0.0002792998,0.035135075],"genre_scores_gemma":[0.5097299,0.00023774718,0.46389142,0.00009217954,0.000050062594,0.000204387,0.00047776967,0.00040196802,0.024914553],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994962,0.00006150825,0.000022015936,0.000067350586,0.0002998335,0.000053139258],"domain_scores_gemma":[0.99969983,0.000056981815,0.000021777,0.000071902876,0.00009890747,0.000050628598],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024347857,0.00048253866,0.0007569971,0.0006629577,0.0006957912,0.0011488572,0.001168054,0.0006449896,0.0077197463],"category_scores_gemma":[0.0009659886,0.00043283918,0.00066373625,0.00063620304,0.0011333509,0.00073830853,0.0018369464,0.0015057563,0.0011449493],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016296335,0.00015913065,0.0005404498,0.00018461255,0.00002940686,0.00045276363,0.000663557,0.33225602,0.036185686,0.467191,0.00579815,0.15637633],"study_design_scores_gemma":[0.00003276421,0.00007839072,0.00028802318,0.00003550103,0.000010914224,0.00024637076,0.00019015213,0.8811178,0.004533305,0.094458066,0.018983888,0.00002477549],"about_ca_topic_score_codex":0.0023184756,"about_ca_topic_score_gemma":0.0025268123,"teacher_disagreement_score":0.0077197463,"about_ca_system_score_codex":0.00044050865,"about_ca_system_score_gemma":0.0006950963,"threshold_uncertainty_score":0.025825143},"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":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6437455,0.000937341,0.31976888,0.0012897096,0.00014493833,0.00016204451,0.0016543892,0.00090238545,0.031394828],"genre_scores_gemma":[0.81202304,0.0011360851,0.17106095,0.00039197475,0.00014169008,0.00018667274,0.0025260341,0.00027323308,0.01226028],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99842775,0.000290151,0.0001525769,0.00040294672,0.00034156005,0.00038501862],"domain_scores_gemma":[0.99624544,0.0016098223,0.000652168,0.00093815156,0.00021226068,0.0003422538],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010749246,0.0011450605,0.0021623063,0.0013309942,0.0018129997,0.0028340777,0.002090392,0.0020203718,0.011086527],"category_scores_gemma":[0.008306067,0.0011803473,0.0012887255,0.004210713,0.0017238978,0.0069825007,0.004375711,0.0016257152,0.002195908],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001956349,0.00040038273,0.009078757,0.0007245878,0.00041639135,0.0012440507,0.00082149485,0.34327483,0.024239648,0.45565417,0.0159509,0.1462385],"study_design_scores_gemma":[0.0001911193,0.0004964382,0.0025213498,0.00011515514,0.00017710387,0.0011595835,0.0006507206,0.4395299,0.020069642,0.51862836,0.016360022,0.000100685415],"about_ca_topic_score_codex":0.0015634685,"about_ca_topic_score_gemma":0.00108334,"teacher_disagreement_score":0.011086527,"about_ca_system_score_codex":0.0010957845,"about_ca_system_score_gemma":0.0005730374,"threshold_uncertainty_score":0.037088096},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057457216,0.009550153,0.8389286,0.0010847965,0.00042874244,0.00008341561,0.0007469854,0.0009917788,0.09072836],"genre_scores_gemma":[0.48437032,0.015904536,0.44046387,0.0004123296,0.0006179915,0.00018928609,0.0019645144,0.001193253,0.054883868],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996823,0.00004643211,0.000019633144,0.00006756258,0.00015293027,0.000031139887],"domain_scores_gemma":[0.99938226,0.00029353308,0.000064758045,0.00015066464,0.00007189868,0.00003681103],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026922877,0.00073804794,0.0008006746,0.001216045,0.00044495834,0.0023383764,0.0013121251,0.0009944575,0.0088400245],"category_scores_gemma":[0.002134381,0.00071593584,0.0006937013,0.0024351568,0.0011202146,0.0036171523,0.0014400821,0.003049435,0.0024120375],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000105716914,0.000045949302,0.00032792843,0.00030282498,0.000020680127,0.00011806594,0.00030866987,0.03642648,0.0045962147,0.71702474,0.012333579,0.22838911],"study_design_scores_gemma":[0.000026631496,0.000039097034,0.000354061,0.000077497156,0.00002381874,0.00041488183,0.0001154603,0.08446974,0.0029332568,0.86662036,0.04490344,0.000021739019],"about_ca_topic_score_codex":0.0011352521,"about_ca_topic_score_gemma":0.001313809,"teacher_disagreement_score":0.0088400245,"about_ca_system_score_codex":0.0007843826,"about_ca_system_score_gemma":0.00029202693,"threshold_uncertainty_score":0.029572845},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.091991,0.016693367,0.7945149,0.0049282373,0.0008595837,0.00007001538,0.0004950459,0.0003385873,0.09010928],"genre_scores_gemma":[0.81097895,0.0072817514,0.13456404,0.0006844895,0.0010354269,0.00014447846,0.0007737532,0.00037976244,0.04415733],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99904305,0.00036909265,0.00005716834,0.00025261505,0.00020740308,0.00007072596],"domain_scores_gemma":[0.99769235,0.0010600503,0.0003090784,0.0002961349,0.0004175785,0.00022478921],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011167858,0.00061752397,0.0005946349,0.0031920597,0.001438138,0.0040179132,0.00089624734,0.0013739556,0.0072533847],"category_scores_gemma":[0.0054306504,0.00046378555,0.0005300114,0.0025708668,0.005359932,0.010414893,0.0019697458,0.0028402344,0.00085140456],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000075050134,0.0000039944944,0.00012644232,0.000024290495,0.000004416491,0.000018160792,0.00014048725,0.0006750527,0.00022068656,0.99118984,0.00079699454,0.0067920103],"study_design_scores_gemma":[0.0000031179356,0.000009929401,0.000110786794,0.000011451298,0.0000034609038,0.00005819499,0.00010342056,0.0021656062,0.0001435395,0.98804396,0.009340628,0.0000059779272],"about_ca_topic_score_codex":0.0016112721,"about_ca_topic_score_gemma":0.0011724846,"teacher_disagreement_score":0.0072533847,"about_ca_system_score_codex":0.00095247076,"about_ca_system_score_gemma":0.00042986302,"threshold_uncertainty_score":0.024264991},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010985692,0.052611038,0.45402768,0.0021224876,0.0026628498,0.00009629581,0.00038219916,0.00083279755,0.47627902],"genre_scores_gemma":[0.2463811,0.13024594,0.36271128,0.0011652631,0.004763908,0.00030895957,0.0015832644,0.0007788575,0.25206146],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99967754,0.00006074236,0.000015013912,0.000067416855,0.00015415515,0.000025091735],"domain_scores_gemma":[0.99967515,0.00013883773,0.000022562777,0.00006459676,0.000067108725,0.000031813186],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032006172,0.0009491991,0.00053309975,0.0016179302,0.00052271783,0.0016517091,0.0011166715,0.0009312202,0.018079719],"category_scores_gemma":[0.0010841262,0.00038878707,0.00051024597,0.0023646972,0.0009405458,0.0023039477,0.0020984486,0.0014228082,0.004167287],"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.000021396017,0.000025907979,0.00015304006,0.00029462692,0.000018871999,0.00009853711,0.00010006373,0.01992774,0.0023954748,0.739002,0.021576162,0.21638615],"study_design_scores_gemma":[0.000005669068,0.000026064185,0.00018045072,0.00015731838,0.000012205906,0.0004450522,0.00006457497,0.040096864,0.0014871235,0.74092656,0.21658166,0.000016473474],"about_ca_topic_score_codex":0.00051770086,"about_ca_topic_score_gemma":0.00079836085,"teacher_disagreement_score":0.018079719,"about_ca_system_score_codex":0.00078184827,"about_ca_system_score_gemma":0.0004151432,"threshold_uncertainty_score":0.06048274},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20482363,0.0014634359,0.6149057,0.0012874785,0.0003120902,0.00016300159,0.0008063937,0.00058435503,0.17565383],"genre_scores_gemma":[0.7197906,0.0025796029,0.20544824,0.0005922602,0.00037605874,0.00017222931,0.0012928648,0.0006604737,0.069087595],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99961096,0.000046479123,0.000017895594,0.00009873715,0.00017298841,0.00005295543],"domain_scores_gemma":[0.99743646,0.0011502454,0.0003078814,0.00039314802,0.00047785504,0.00023445264],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033477513,0.0004651069,0.00059697684,0.0013050298,0.0010612716,0.002497658,0.0014251535,0.00096053135,0.013607178],"category_scores_gemma":[0.0036064426,0.0005387535,0.0005785848,0.0017428087,0.0013442521,0.0031009007,0.0012115539,0.002119938,0.0019236287],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039506944,0.000037877646,0.00045002298,0.00012383837,0.000007765184,0.00009381927,0.00034117777,0.010990448,0.0021577622,0.9537001,0.004399547,0.02765818],"study_design_scores_gemma":[0.00001161116,0.000026051217,0.0003986091,0.000025463472,0.000012361335,0.0003803442,0.00021327767,0.049817484,0.0015792804,0.9325868,0.014934591,0.000014116684],"about_ca_topic_score_codex":0.0018944687,"about_ca_topic_score_gemma":0.002866773,"teacher_disagreement_score":0.013607178,"about_ca_system_score_codex":0.0010811095,"about_ca_system_score_gemma":0.00039540118,"threshold_uncertainty_score":0.045520544},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6414687,0.0025932977,0.2969603,0.00031013982,0.0005689952,0.00007818544,0.0007180837,0.0007494283,0.056552842],"genre_scores_gemma":[0.88178486,0.0017732574,0.102193676,0.00013199527,0.00013989973,0.000071887946,0.0010833768,0.00031991987,0.012501097],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992107,0.0001452996,0.000072005176,0.00018488799,0.00027548205,0.00011149997],"domain_scores_gemma":[0.99793917,0.00071364146,0.00042032773,0.00022126417,0.0004652959,0.00024031816],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008590353,0.00053501077,0.00038913134,0.0019289403,0.0009605702,0.0013653089,0.00056592526,0.0003878392,0.0066123856],"category_scores_gemma":[0.0027750283,0.0003572631,0.00055978616,0.0017655063,0.0011795656,0.0021276798,0.0010768197,0.00090902485,0.0010784972],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037890187,0.000047331734,0.0061731627,0.00035900914,0.00005275847,0.00062581914,0.0010172285,0.01716994,0.011541525,0.85286313,0.008411301,0.101359874],"study_design_scores_gemma":[0.000028083814,0.00042280953,0.006799048,0.0001697626,0.000083745676,0.002456095,0.00059715443,0.035295986,0.020909535,0.8619083,0.071223296,0.00010610209],"about_ca_topic_score_codex":0.00051409856,"about_ca_topic_score_gemma":0.00053060456,"teacher_disagreement_score":0.0066123856,"about_ca_system_score_codex":0.00052220066,"about_ca_system_score_gemma":0.0003320245,"threshold_uncertainty_score":0.022120655},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015122124,0.0028282078,0.5396698,0.0044296444,0.002859658,0.00007819067,0.00042402957,0.0004879163,0.4341004],"genre_scores_gemma":[0.46072647,0.0072256955,0.20394349,0.006374675,0.0042343554,0.00023450448,0.0006255773,0.00081404595,0.3158212],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996799,0.00006357356,0.0000151831355,0.00009885798,0.000104475694,0.000038057864],"domain_scores_gemma":[0.9994916,0.00018978177,0.00003460457,0.00014196697,0.00010250923,0.000039641924],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007389502,0.00075438444,0.00057830365,0.001239669,0.0010864132,0.0021972854,0.0009175613,0.0012339466,0.015769167],"category_scores_gemma":[0.001707683,0.00033905313,0.0011243975,0.0010421234,0.0034678485,0.0036972256,0.0018607032,0.0034770179,0.0031586273],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000427634,0.0000038099606,0.00001526083,0.000016242915,0.0000020769269,0.000019895297,0.0000423312,0.00021708815,0.00037264163,0.99075454,0.0026867965,0.0058651627],"study_design_scores_gemma":[0.000004538956,0.000008692032,0.0000476471,0.000011947955,0.0000033679032,0.00009673447,0.000014218116,0.0013676891,0.00027830913,0.9684913,0.029668272,0.000007343126],"about_ca_topic_score_codex":0.0012418902,"about_ca_topic_score_gemma":0.0009468934,"teacher_disagreement_score":0.015769167,"about_ca_system_score_codex":0.0010926827,"about_ca_system_score_gemma":0.0006511457,"threshold_uncertainty_score":0.05275309},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.745643,0.0005978609,0.18864042,0.00042236657,0.0000731324,0.000116312985,0.0010994966,0.0013964261,0.062011037],"genre_scores_gemma":[0.9632488,0.00049852184,0.021342913,0.00008744337,0.000060744373,0.000086654225,0.0012401529,0.00023962145,0.013195267],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99944013,0.00007992584,0.000036889283,0.00018120385,0.00015082043,0.000110973124],"domain_scores_gemma":[0.99918133,0.00018783541,0.0001666742,0.00012360993,0.00018626775,0.00015427376],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022831916,0.000868359,0.00055746525,0.0018017568,0.0012597668,0.0024187337,0.0004846529,0.00051831803,0.0058949683],"category_scores_gemma":[0.0010840441,0.0005056057,0.00094718614,0.001143833,0.0021444336,0.0029783128,0.0032142254,0.00084673596,0.0019662506],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027372714,0.00006122766,0.0030174567,0.00016982092,0.00005952509,0.00095455925,0.0030941882,0.012833342,0.018968593,0.9117182,0.003866725,0.044982664],"study_design_scores_gemma":[0.000056660607,0.00022560044,0.007201336,0.0000647949,0.000116380485,0.001772976,0.0022862912,0.029564053,0.02656573,0.8628506,0.06918161,0.000113889626],"about_ca_topic_score_codex":0.002899225,"about_ca_topic_score_gemma":0.0023580976,"teacher_disagreement_score":0.0058949683,"about_ca_system_score_codex":0.00075827894,"about_ca_system_score_gemma":0.0003641227,"threshold_uncertainty_score":0.019720614},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31557995,0.00029588165,0.66220087,0.00015302736,0.00014696078,0.00006415852,0.00018893438,0.00024959218,0.021120744],"genre_scores_gemma":[0.79438597,0.0005128542,0.16556206,0.00013775771,0.00013835123,0.00020599258,0.0006245007,0.0002962364,0.03813622],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990834,0.00016761136,0.000077717006,0.0001756346,0.00040151048,0.00009412893],"domain_scores_gemma":[0.9981029,0.00071668986,0.0002683718,0.00026079747,0.00037178455,0.0002793709],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070064235,0.0007221234,0.0009660251,0.002390615,0.00071183866,0.0018338994,0.0015502557,0.00078014145,0.0068770302],"category_scores_gemma":[0.0038296354,0.00067692745,0.0006662221,0.0015805658,0.0011304315,0.0026773748,0.003861799,0.0016105014,0.00088308245],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014348085,0.00009545861,0.0012714386,0.000101993806,0.000058539397,0.00025338473,0.0003205042,0.033893704,0.00788182,0.8977743,0.0013559812,0.056849413],"study_design_scores_gemma":[0.000016130489,0.000119962366,0.0007557758,0.000039552942,0.00003571583,0.00034504003,0.00017238967,0.15447582,0.0043969536,0.8345767,0.005044792,0.00002105637],"about_ca_topic_score_codex":0.00032150184,"about_ca_topic_score_gemma":0.00058828684,"teacher_disagreement_score":0.0068770302,"about_ca_system_score_codex":0.00036778636,"about_ca_system_score_gemma":0.00023394212,"threshold_uncertainty_score":0.023005962},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009473587,0.00043158658,0.96614975,0.00022723849,0.00020404912,0.00035307638,0.0018254592,0.010806899,0.010528225],"genre_scores_gemma":[0.07791246,0.0001983821,0.90425545,0.0002536371,0.000034714078,0.0010919038,0.0050060432,0.0028240373,0.008423347],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992741,0.00020071324,0.000057092577,0.00018909936,0.00016840834,0.00011060447],"domain_scores_gemma":[0.997879,0.0012033955,0.000087069246,0.00026457742,0.00050292216,0.00006296635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012693458,0.0019896924,0.0016948832,0.0015580568,0.001023761,0.0016251698,0.0032069357,0.0017547039,0.034003362],"category_scores_gemma":[0.0049882918,0.0011906781,0.001767474,0.0014121326,0.00085015164,0.0009213906,0.0024242073,0.0018091619,0.007862994],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000766637,0.00021898307,0.0029396494,0.0010132317,0.0003907306,0.0003078974,0.00044378004,0.47086796,0.005104357,0.029253837,0.051227063,0.43746594],"study_design_scores_gemma":[0.00008454782,0.000036535286,0.00019263073,0.000037074406,0.000021862974,0.00004479108,0.00008869454,0.97192466,0.0012230886,0.009299295,0.01703305,0.000013802921],"about_ca_topic_score_codex":0.018023215,"about_ca_topic_score_gemma":0.029138284,"teacher_disagreement_score":0.034003362,"about_ca_system_score_codex":0.0010284695,"about_ca_system_score_gemma":0.0022353246,"threshold_uncertainty_score":0.113752544},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1190754,0.0008615629,0.85344297,0.000949065,0.000087127526,0.00026610092,0.00095380546,0.0003736191,0.023990363],"genre_scores_gemma":[0.650826,0.0020881963,0.3327371,0.0006112617,0.0003726095,0.00042570068,0.0037528258,0.0005046751,0.008681614],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980823,0.0003965822,0.00013589134,0.000540599,0.0005322464,0.00031251804],"domain_scores_gemma":[0.99366885,0.002665961,0.0011390507,0.0011821436,0.0009905148,0.0003534965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009417744,0.0010663916,0.00072054926,0.0024846392,0.0021206916,0.003079119,0.0015341458,0.0017523776,0.0043361993],"category_scores_gemma":[0.0088700345,0.0007848761,0.0013254219,0.004401943,0.0036576025,0.0075761657,0.002593276,0.002191055,0.000850894],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006998379,0.00008781919,0.005161647,0.0003131563,0.000040241233,0.0006131461,0.0014400679,0.039979495,0.009579943,0.90115696,0.0030797995,0.038477737],"study_design_scores_gemma":[0.000021511718,0.00007441823,0.0020665375,0.000104944724,0.000045615114,0.00084378914,0.00092581566,0.05558443,0.005098196,0.91001755,0.025174934,0.00004237369],"about_ca_topic_score_codex":0.004793813,"about_ca_topic_score_gemma":0.004312951,"teacher_disagreement_score":0.004793813,"about_ca_system_score_codex":0.001618552,"about_ca_system_score_gemma":0.0008360652,"threshold_uncertainty_score":0.014506042},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019635461,0.00004098421,0.9752656,0.00006386244,0.00006984013,0.00006459735,0.000031127744,0.00085410534,0.003974371],"genre_scores_gemma":[0.24573398,0.00011605382,0.7491864,0.00008815373,0.00002548968,0.00009562829,0.00024046225,0.00050889235,0.0040049762],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991849,0.00009342978,0.000045870776,0.00012317991,0.00048946,0.000063162064],"domain_scores_gemma":[0.998998,0.00028478564,0.00006310631,0.00036176454,0.0002432052,0.000049134633],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069058686,0.00044406616,0.0006644793,0.0006521822,0.0004441536,0.0011093213,0.0014349123,0.0009154406,0.002877267],"category_scores_gemma":[0.0021601696,0.00037728707,0.000851239,0.00036550293,0.001024935,0.0009874932,0.0024373657,0.0012469805,0.0012705377],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017042163,0.000119307864,0.0034421324,0.00037263072,0.00007016771,0.0007601536,0.0010025922,0.53470874,0.11712655,0.06346064,0.0035197283,0.27524698],"study_design_scores_gemma":[0.000018517514,0.00010546993,0.00031937595,0.000035894536,0.00001349863,0.00020088546,0.00011165414,0.9519043,0.02248642,0.008637962,0.016141945,0.000024157405],"about_ca_topic_score_codex":0.00085439085,"about_ca_topic_score_gemma":0.0008189116,"teacher_disagreement_score":0.002877267,"about_ca_system_score_codex":0.0003985507,"about_ca_system_score_gemma":0.0006112587,"threshold_uncertainty_score":0.009625435},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013559933,0.00012076648,0.9972777,0.00006470207,0.000024461018,0.000014246965,0.00005655123,0.000322664,0.0007629216],"genre_scores_gemma":[0.13144998,0.0007845149,0.85840654,0.00012802324,0.00006891545,0.0001693779,0.00067051395,0.00055808556,0.007764024],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99956673,0.000055392735,0.000026308398,0.000068820314,0.00025798898,0.000024678464],"domain_scores_gemma":[0.999666,0.000074928364,0.00002815605,0.00012320303,0.00008896571,0.000018715036],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034946474,0.0006105935,0.0008007456,0.0010197592,0.0003320837,0.0017977733,0.0016123848,0.0016403735,0.0034191406],"category_scores_gemma":[0.0012450205,0.0006449051,0.0012720296,0.0012101065,0.0005237228,0.002233443,0.0014045627,0.001525042,0.0019637295],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000089001885,0.000054755503,0.0005003829,0.00027678633,0.00007743828,0.00039173776,0.0003046536,0.5781614,0.042940624,0.14062066,0.006294388,0.23028818],"study_design_scores_gemma":[0.0000052330465,0.000017435406,0.000072406685,0.0000097578295,0.000008678074,0.0001432014,0.000013873514,0.9799747,0.0036225326,0.008959546,0.0071582985,0.00001434958],"about_ca_topic_score_codex":0.0014676823,"about_ca_topic_score_gemma":0.0014886636,"teacher_disagreement_score":0.0034191406,"about_ca_system_score_codex":0.00050579634,"about_ca_system_score_gemma":0.000515112,"threshold_uncertainty_score":0.011438131},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052306972,0.06262703,0.6439126,0.0076375254,0.0049546706,0.00020014925,0.0011018272,0.0009262154,0.226333],"genre_scores_gemma":[0.47978005,0.06801097,0.3097091,0.006958524,0.012791321,0.00081211334,0.003618614,0.0019880221,0.11633122],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99721813,0.0008335839,0.00014643553,0.00068954163,0.00076694397,0.00034524463],"domain_scores_gemma":[0.9941076,0.0032500809,0.0005139011,0.000794101,0.00082461454,0.0005097916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026000424,0.0020447148,0.0019816472,0.0047540627,0.0022526467,0.004510518,0.0026842235,0.0029326824,0.012609129],"category_scores_gemma":[0.013502442,0.0015144928,0.0023188693,0.0060880766,0.0051789437,0.010511009,0.005483592,0.006153222,0.006964033],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001302362,0.00004900776,0.0010933129,0.00036613218,0.00004202952,0.00012811148,0.00032861144,0.013220983,0.0014723957,0.9175839,0.019408137,0.046177242],"study_design_scores_gemma":[0.000017587681,0.00010708,0.000834791,0.00024775174,0.000026736832,0.00029671236,0.00018687912,0.021571694,0.0009527668,0.92939717,0.046317704,0.000043187843],"about_ca_topic_score_codex":0.0016019722,"about_ca_topic_score_gemma":0.0007708068,"teacher_disagreement_score":0.012609129,"about_ca_system_score_codex":0.002656673,"about_ca_system_score_gemma":0.0010928493,"threshold_uncertainty_score":0.04218173},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.068120934,0.00045462465,0.9253842,0.0002484321,0.000057850426,0.00008265492,0.00020298823,0.00057811855,0.004870197],"genre_scores_gemma":[0.27196434,0.0004139385,0.7234735,0.0001006336,0.0000887345,0.00013209581,0.0006749873,0.00024964663,0.0029021557],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99921584,0.00021510787,0.00006009877,0.00015952428,0.00026987624,0.00007941629],"domain_scores_gemma":[0.9969434,0.0022187755,0.0001639739,0.0003173099,0.00026001476,0.00009644108],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010633735,0.0008829268,0.0015034477,0.001172278,0.00067381636,0.0012013024,0.0018030067,0.0017048928,0.003872114],"category_scores_gemma":[0.0073578805,0.0004694231,0.0009837708,0.0019107288,0.001293288,0.002742368,0.0019230758,0.0014269244,0.00065686315],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020336648,0.0001039162,0.0014386153,0.00021468353,0.00002922115,0.00021291272,0.00023011719,0.84852946,0.0035010446,0.047346167,0.001930486,0.09626005],"study_design_scores_gemma":[0.000015606509,0.00003078761,0.0001438749,0.000012790783,0.000003227306,0.000067033485,0.00003631308,0.97000533,0.0009944012,0.027866865,0.0008163387,0.0000074707796],"about_ca_topic_score_codex":0.0030461997,"about_ca_topic_score_gemma":0.003719471,"teacher_disagreement_score":0.003872114,"about_ca_system_score_codex":0.0005878583,"about_ca_system_score_gemma":0.0004986801,"threshold_uncertainty_score":0.012953579},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08996995,0.0006164692,0.8237034,0.0007515602,0.00047249338,0.00014819774,0.00083412445,0.0010377485,0.08246603],"genre_scores_gemma":[0.5505601,0.0012634369,0.42196846,0.00051794143,0.00020345472,0.00022140243,0.0015550377,0.0008580481,0.022852048],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990158,0.0002015878,0.00007384693,0.00017169828,0.0003698959,0.00016716679],"domain_scores_gemma":[0.99859625,0.00032295633,0.00018322746,0.00029153726,0.00044126902,0.00016479145],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005801229,0.0005800356,0.00038565713,0.001100482,0.0012678837,0.0017176316,0.00083312474,0.0006482571,0.007878805],"category_scores_gemma":[0.0029900116,0.0004500038,0.000770367,0.0013988786,0.0020005684,0.0019384394,0.0019389127,0.002019011,0.0019132849],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034333767,0.000014386958,0.00066538044,0.00007464144,0.000006438506,0.0001855926,0.0002504388,0.0044007697,0.0032718799,0.95205843,0.004603129,0.034434635],"study_design_scores_gemma":[0.000022152399,0.00005876391,0.0007178141,0.000062020554,0.000023949508,0.000601836,0.00052179716,0.035517547,0.011560938,0.8615845,0.089278966,0.000049684957],"about_ca_topic_score_codex":0.0020924858,"about_ca_topic_score_gemma":0.004524697,"teacher_disagreement_score":0.007878805,"about_ca_system_score_codex":0.00088179053,"about_ca_system_score_gemma":0.0011494237,"threshold_uncertainty_score":0.026357234},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47177497,0.0002611659,0.48305687,0.00035023165,0.00015949474,0.00013865312,0.00038847275,0.00071853615,0.043151725],"genre_scores_gemma":[0.85957503,0.00014951573,0.13160498,0.00011554034,0.000028766022,0.00008431292,0.00049057876,0.00025665297,0.007694639],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995067,0.00006146845,0.00003489564,0.00014066443,0.0001687051,0.000087496424],"domain_scores_gemma":[0.9988362,0.0002695862,0.00020656137,0.0004233545,0.00016440559,0.00009977773],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031596783,0.00030483407,0.0003535289,0.00040036466,0.0005451841,0.0010488719,0.00082255644,0.0005302446,0.004323571],"category_scores_gemma":[0.002371039,0.0003276046,0.0004921706,0.0003306583,0.0015519209,0.0017560557,0.0017376298,0.0012092199,0.00050728855],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00059894554,0.00012037348,0.005477448,0.00040272126,0.00004579244,0.0017476273,0.0014568033,0.054415904,0.17429265,0.59875,0.004715317,0.15797643],"study_design_scores_gemma":[0.00015232565,0.000660859,0.006900811,0.00020985547,0.000057585235,0.0034763517,0.0012738676,0.33068678,0.1842042,0.37582022,0.096417546,0.00013955632],"about_ca_topic_score_codex":0.0006308041,"about_ca_topic_score_gemma":0.0007773167,"teacher_disagreement_score":0.004323571,"about_ca_system_score_codex":0.00032054115,"about_ca_system_score_gemma":0.00034766368,"threshold_uncertainty_score":0.014463782},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007413194,0.00017315555,0.97949135,0.000107389504,0.00022095963,0.00012104436,0.00020443962,0.0064637666,0.0058045667],"genre_scores_gemma":[0.025423996,0.000095064046,0.96317565,0.00007885883,0.00004480049,0.00012945561,0.00066835125,0.0007703967,0.009613346],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99903655,0.00008319588,0.000075858356,0.00017972899,0.00048965024,0.0001350776],"domain_scores_gemma":[0.9989723,0.00019756347,0.000031258034,0.0004199365,0.00032624908,0.000052720803],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043756462,0.0014047989,0.0015204925,0.0018199147,0.00093120727,0.0014662909,0.002930724,0.0013396293,0.023526525],"category_scores_gemma":[0.0016445653,0.0009297219,0.0013075897,0.0028328327,0.0006460158,0.0023964574,0.0027365282,0.0019221068,0.007972362],"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.0005035228,0.00022320572,0.00036622124,0.00025804288,0.00006814346,0.00015807275,0.00021734611,0.015399799,0.06237759,0.023027709,0.023956563,0.87344384],"study_design_scores_gemma":[0.0005371033,0.00043854341,0.0015182692,0.000077387245,0.00026624723,0.0011367771,0.00016195842,0.7730435,0.0665355,0.046762817,0.10934661,0.00017526017],"about_ca_topic_score_codex":0.0060218005,"about_ca_topic_score_gemma":0.010349323,"teacher_disagreement_score":0.023526525,"about_ca_system_score_codex":0.0008204065,"about_ca_system_score_gemma":0.001408401,"threshold_uncertainty_score":0.07870406},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043797303,0.000420762,0.914347,0.00030647425,0.00019926044,0.00023895547,0.0009954713,0.0036205547,0.03607412],"genre_scores_gemma":[0.20531109,0.00095475104,0.7734772,0.0001497948,0.00007396141,0.0001957415,0.0014800383,0.0013865855,0.016970802],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999744,0.00003050864,0.000017186645,0.000057943835,0.000112796915,0.000037605983],"domain_scores_gemma":[0.9996513,0.00013259223,0.000023917928,0.00007603611,0.00007598869,0.00004008503],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023796153,0.0011284353,0.00091850024,0.0008843855,0.0004895194,0.0015413366,0.0013313568,0.0011417788,0.018038595],"category_scores_gemma":[0.0014392355,0.0009032363,0.00085925293,0.0011631642,0.00056131795,0.0017385919,0.0017772805,0.001955693,0.0036138596],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038947508,0.00017071867,0.000888239,0.00096333295,0.00010869282,0.0004410409,0.00072992855,0.116586156,0.053427156,0.19277176,0.03348217,0.6000414],"study_design_scores_gemma":[0.00015819818,0.0002564418,0.0010175915,0.0002465396,0.00011547786,0.0010398139,0.00046576382,0.5411292,0.043066546,0.30643088,0.10598778,0.000085884305],"about_ca_topic_score_codex":0.0011889605,"about_ca_topic_score_gemma":0.0037642103,"teacher_disagreement_score":0.018038595,"about_ca_system_score_codex":0.0005490797,"about_ca_system_score_gemma":0.00035279713,"threshold_uncertainty_score":0.060345113},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0068147746,0.00015138759,0.9888093,0.00013848889,0.00009567346,0.000052526673,0.0000490678,0.0006413263,0.0032474857],"genre_scores_gemma":[0.18330893,0.000261754,0.798164,0.00022990024,0.000081480015,0.00032005523,0.0002736407,0.0013126971,0.016047511],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99962854,0.00009615477,0.000016109336,0.000038807604,0.00019087149,0.000029482273],"domain_scores_gemma":[0.999258,0.00030600827,0.000043887765,0.00015408678,0.00018132258,0.000056773653],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077866454,0.0006510129,0.0008967423,0.0008598079,0.00063954026,0.0008665143,0.0020869044,0.0012466201,0.008461183],"category_scores_gemma":[0.0028871119,0.00044473397,0.0005301847,0.0006156027,0.0008545198,0.0012125935,0.002194848,0.0020716013,0.0016506269],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007033389,0.0005572784,0.0009287722,0.0005826601,0.000072088376,0.00030132596,0.00024157511,0.38091093,0.038777966,0.16192147,0.011996228,0.40300635],"study_design_scores_gemma":[0.000023158249,0.000032872696,0.000054552398,0.000009268341,0.000004825238,0.0000350316,0.000007913643,0.9879117,0.0019457528,0.0077708187,0.0021954647,0.0000085811225],"about_ca_topic_score_codex":0.0015697955,"about_ca_topic_score_gemma":0.0021775756,"teacher_disagreement_score":0.008461183,"about_ca_system_score_codex":0.00037363014,"about_ca_system_score_gemma":0.0011066066,"threshold_uncertainty_score":0.028305471},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021014566,0.000572899,0.9380253,0.0004583979,0.00017865947,0.000072925664,0.00011481924,0.0008460938,0.038716376],"genre_scores_gemma":[0.32543483,0.001377954,0.65460813,0.00021202078,0.00024107304,0.00024095444,0.0003609217,0.00034174786,0.017182343],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999482,0.00007902345,0.00002386289,0.00009472095,0.00026407652,0.000056482193],"domain_scores_gemma":[0.9995359,0.00012320979,0.000032291187,0.00021614571,0.00006791629,0.000024498717],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034555898,0.00067727716,0.00053845067,0.00055763684,0.00068569265,0.0014174944,0.001102158,0.0006378131,0.006829095],"category_scores_gemma":[0.0015062855,0.00034684877,0.00070151687,0.00092505163,0.0013291789,0.002704455,0.0021909103,0.0012225057,0.0016113067],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000087398264,0.000041186333,0.00038967305,0.00018374727,0.000030604402,0.00018088163,0.00019339808,0.09631146,0.014464508,0.79102933,0.005292651,0.091795176],"study_design_scores_gemma":[0.00003962203,0.000040827945,0.0002031987,0.000018360439,0.00001805785,0.0002738579,0.00004775124,0.33856538,0.0055608684,0.6129195,0.042298853,0.000013753038],"about_ca_topic_score_codex":0.0006088243,"about_ca_topic_score_gemma":0.0009909199,"teacher_disagreement_score":0.006829095,"about_ca_system_score_codex":0.0006089096,"about_ca_system_score_gemma":0.00062308065,"threshold_uncertainty_score":0.022845566},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1642559,0.00034880816,0.80661184,0.00030600422,0.00008317751,0.00007232655,0.00022114876,0.0003006388,0.027800139],"genre_scores_gemma":[0.7871712,0.00050329795,0.17883664,0.000087149754,0.00007102652,0.00014211505,0.0006441455,0.00036621085,0.03217817],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99927026,0.00015053902,0.000041279174,0.00015764021,0.00029271108,0.00008756755],"domain_scores_gemma":[0.9986713,0.0006003246,0.00019863826,0.00020144142,0.00015798357,0.0001703157],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005815812,0.00047396185,0.00070685375,0.0017785034,0.001333636,0.0023638448,0.0013771829,0.0010335757,0.012565328],"category_scores_gemma":[0.003826977,0.00090383034,0.0006391287,0.0016333325,0.0023105412,0.0041879835,0.0033208258,0.002143951,0.0013859267],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008834835,0.00004153753,0.00062658224,0.00008115176,0.0000125670085,0.00016506243,0.00047032183,0.0696205,0.0020286962,0.88435197,0.0018011611,0.04071201],"study_design_scores_gemma":[0.000019781965,0.00006108704,0.0004473511,0.000041347084,0.000012396107,0.0002863727,0.00045857683,0.21056835,0.0017225309,0.77810156,0.0082586985,0.000021922338],"about_ca_topic_score_codex":0.0010849213,"about_ca_topic_score_gemma":0.0014685652,"teacher_disagreement_score":0.012565328,"about_ca_system_score_codex":0.00075121253,"about_ca_system_score_gemma":0.00033741072,"threshold_uncertainty_score":0.042035162},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012270183,0.021565128,0.85792464,0.012171166,0.01237391,0.000056502104,0.00027616575,0.0006979631,0.08266446],"genre_scores_gemma":[0.23371927,0.028718866,0.65899307,0.0036789603,0.014941903,0.00015360581,0.0004153904,0.0022946002,0.05708432],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989737,0.00025760956,0.0000739439,0.00025183315,0.00038167016,0.00006120234],"domain_scores_gemma":[0.9952453,0.0031524196,0.00012991093,0.00086582056,0.00042554253,0.00018097513],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016580794,0.00093945366,0.0010321784,0.001728607,0.0016052718,0.002797179,0.0021907862,0.0017491666,0.0063337726],"category_scores_gemma":[0.008388922,0.0006125724,0.0012515796,0.0015237893,0.0062544513,0.006480792,0.0038742665,0.006402811,0.0022496637],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000094699935,0.00001825512,0.0003881407,0.00034563898,0.000018572822,0.00053156464,0.0004380961,0.010700068,0.004875535,0.83381516,0.026879538,0.12189475],"study_design_scores_gemma":[0.000013133448,0.00007406368,0.000440976,0.00014101565,0.00002697467,0.0009199051,0.00017596238,0.023528783,0.0038572277,0.7570504,0.21372312,0.000048382273],"about_ca_topic_score_codex":0.0007364215,"about_ca_topic_score_gemma":0.0009452776,"teacher_disagreement_score":0.0063337726,"about_ca_system_score_codex":0.0006304423,"about_ca_system_score_gemma":0.0004827402,"threshold_uncertainty_score":0.021188557},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0063372757,0.00015996558,0.9902783,0.000088424415,0.000043014796,0.000076187214,0.00007883312,0.0005698045,0.0023681526],"genre_scores_gemma":[0.09470711,0.00028822158,0.9013457,0.000058420334,0.00006048924,0.00025964878,0.00033153602,0.00056723214,0.0023815285],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99904436,0.00018829513,0.00005538956,0.00016452174,0.0004497725,0.00009759664],"domain_scores_gemma":[0.9977729,0.0014096483,0.00014011422,0.00024018051,0.00034796406,0.00008921886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011694852,0.0012756585,0.0015446527,0.002026392,0.0009380329,0.0016571522,0.0021401064,0.0015131306,0.011612841],"category_scores_gemma":[0.0076161805,0.0014268762,0.0013890589,0.0022292328,0.0010933799,0.0023387845,0.0040624696,0.0022069686,0.0020525],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029627714,0.00010325267,0.0008311121,0.00042257574,0.000076697215,0.0001375893,0.0005274669,0.46563783,0.0070328284,0.093403704,0.0101355165,0.42139506],"study_design_scores_gemma":[0.000070007016,0.000045933622,0.00013090562,0.000032011256,0.000019985631,0.00006490455,0.0000938928,0.9289917,0.0018283273,0.06477725,0.003931445,0.000013776867],"about_ca_topic_score_codex":0.0024446563,"about_ca_topic_score_gemma":0.003974793,"teacher_disagreement_score":0.011612841,"about_ca_system_score_codex":0.0009239963,"about_ca_system_score_gemma":0.0008221862,"threshold_uncertainty_score":0.038848817},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011622781,0.0038310485,0.7872698,0.0077604195,0.0554948,0.00010853871,0.005207114,0.004756865,0.12394873],"genre_scores_gemma":[0.2678884,0.0033385123,0.4337688,0.003181564,0.011740712,0.00018554172,0.006109934,0.0056731356,0.2681134],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99947006,0.000087096865,0.000034680837,0.00011834819,0.0002468706,0.00004303322],"domain_scores_gemma":[0.9983126,0.0004366541,0.000057688914,0.00069099036,0.0004285165,0.00007352696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049880537,0.00089705427,0.0008671142,0.0010295048,0.00049026235,0.0013517496,0.0013500835,0.0010916631,0.084061995],"category_scores_gemma":[0.007051999,0.00037278072,0.00060893426,0.0017551165,0.0008265415,0.0019430973,0.0012732678,0.0020994702,0.019294046],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034504576,0.000059296057,0.0005498131,0.00045832962,0.00005401414,0.00037654905,0.00007676269,0.029276771,0.006599642,0.1294556,0.44121194,0.39153633],"study_design_scores_gemma":[0.0000876129,0.00013688629,0.0014801989,0.00014852463,0.000060127266,0.001404342,0.000104658604,0.26630232,0.013494193,0.2260294,0.49069118,0.000060538314],"about_ca_topic_score_codex":0.0011916182,"about_ca_topic_score_gemma":0.003121385,"teacher_disagreement_score":0.084061995,"about_ca_system_score_codex":0.0005359792,"about_ca_system_score_gemma":0.00039186823,"threshold_uncertainty_score":0.28121537},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031924837,0.00075946137,0.9922462,0.00017574776,0.00016328199,0.00004920089,0.00013865651,0.0010528773,0.0022220912],"genre_scores_gemma":[0.07817269,0.0011078202,0.9101517,0.00012560128,0.00020360594,0.0003860127,0.0009518882,0.0007334783,0.008167242],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996637,0.00064358907,0.00016904219,0.000628413,0.0016552751,0.00026665992],"domain_scores_gemma":[0.9926225,0.0039608884,0.00032418553,0.001732701,0.0011234329,0.00023621508],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024743397,0.0031682656,0.0028541596,0.004406434,0.0019452892,0.0042038085,0.004654783,0.0028930756,0.014982145],"category_scores_gemma":[0.018804414,0.0016543106,0.0019032104,0.0060634445,0.002330374,0.00737029,0.006272315,0.006398104,0.00535996],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036260908,0.00013186653,0.00080067443,0.00050960574,0.00011472364,0.00007446104,0.0002957874,0.18126528,0.003584133,0.2477859,0.019484809,0.5455902],"study_design_scores_gemma":[0.00011503533,0.00006120105,0.0002612399,0.000055843728,0.000043565902,0.00012191868,0.00008772249,0.6468684,0.0031292457,0.33455718,0.014657818,0.000040760875],"about_ca_topic_score_codex":0.0053474903,"about_ca_topic_score_gemma":0.007217478,"teacher_disagreement_score":0.014982145,"about_ca_system_score_codex":0.002899035,"about_ca_system_score_gemma":0.0018531695,"threshold_uncertainty_score":0.050120234},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5614416,0.0038140775,0.38746515,0.0067886757,0.00042895155,0.00018154415,0.0013694239,0.0005881273,0.037922405],"genre_scores_gemma":[0.8480338,0.0029127148,0.13610156,0.00078796677,0.000460127,0.00022106343,0.0010209434,0.0005274127,0.009934493],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99858785,0.0005880651,0.000086242886,0.00027945545,0.00024004384,0.00021843091],"domain_scores_gemma":[0.96258026,0.031376217,0.001949672,0.0015614401,0.0010250888,0.0015073103],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002961802,0.0011967283,0.0017122208,0.0026496628,0.0017688172,0.0034974925,0.003604519,0.0027672881,0.009374524],"category_scores_gemma":[0.02458485,0.0016514803,0.0010557546,0.0023166698,0.0034876661,0.01024763,0.0028789572,0.0027740125,0.0006754501],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014311244,0.0002556778,0.005881459,0.0012061485,0.00015526701,0.00036590375,0.0008183516,0.19415045,0.014801925,0.68758607,0.012563778,0.08078387],"study_design_scores_gemma":[0.00011221874,0.0001381743,0.0018931713,0.00015129612,0.000078052624,0.00027290694,0.00036789422,0.22499523,0.0030448162,0.76562095,0.003280341,0.000044947785],"about_ca_topic_score_codex":0.00089972967,"about_ca_topic_score_gemma":0.0017590952,"teacher_disagreement_score":0.009374524,"about_ca_system_score_codex":0.0015968888,"about_ca_system_score_gemma":0.00061277155,"threshold_uncertainty_score":0.031360924},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006581885,0.00008404813,0.99151623,0.0000487653,0.000031462372,0.000028123564,0.00012411007,0.0007662547,0.0008192023],"genre_scores_gemma":[0.14326395,0.00028650515,0.85090303,0.00009490624,0.000047792542,0.00013838809,0.00090962625,0.00072573335,0.003630041],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99924684,0.000107351036,0.000054844713,0.00025067356,0.0002742186,0.00006613055],"domain_scores_gemma":[0.9986884,0.0005521559,0.00014685337,0.0003796955,0.00013908163,0.000093826304],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006406787,0.0011859349,0.0012975112,0.0014049975,0.00048036317,0.0018423295,0.0018626436,0.0019318867,0.0048058764],"category_scores_gemma":[0.0045372644,0.0013833487,0.0014688987,0.001401621,0.0011382614,0.002357096,0.0022871415,0.0016425906,0.0018605492],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005381951,0.000025251124,0.00050829607,0.00011144931,0.00003568482,0.0001794769,0.00010651945,0.8886838,0.0064737513,0.022415688,0.0022667926,0.0791396],"study_design_scores_gemma":[0.000010032236,0.000016669452,0.00007175827,0.0000105819345,0.000005798742,0.000054744043,0.000027697593,0.97310233,0.0028069343,0.021462744,0.0024188275,0.000011865295],"about_ca_topic_score_codex":0.0023892587,"about_ca_topic_score_gemma":0.003773608,"teacher_disagreement_score":0.0048058764,"about_ca_system_score_codex":0.0008623037,"about_ca_system_score_gemma":0.0007550364,"threshold_uncertainty_score":0.01607722},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033478294,0.0013877385,0.94944227,0.00087334344,0.00022116702,0.00028635393,0.0012883757,0.008170976,0.004851589],"genre_scores_gemma":[0.2588568,0.0006708289,0.7259616,0.0003828649,0.00023472437,0.000439275,0.004969203,0.0015086901,0.00697587],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99477357,0.00071127294,0.00042573936,0.0011563617,0.0022924102,0.0006407332],"domain_scores_gemma":[0.9893707,0.0055714017,0.00053052703,0.002916466,0.0012477371,0.00036318006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002436647,0.0021025934,0.0038801336,0.0037082888,0.0020145588,0.0058496697,0.006129287,0.0039826934,0.01852621],"category_scores_gemma":[0.020355508,0.0014119396,0.0022143754,0.008616387,0.0016467269,0.012802411,0.007588462,0.0036042042,0.0059731514],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016488926,0.000524363,0.0030007144,0.0009199167,0.00021271971,0.00024447034,0.0008119924,0.130671,0.010913202,0.11757132,0.050222512,0.68325883],"study_design_scores_gemma":[0.00020240499,0.0001410965,0.0004664508,0.000049291477,0.00006845663,0.00026387713,0.00039220997,0.78010434,0.005246453,0.20473619,0.008279704,0.000049601666],"about_ca_topic_score_codex":0.006019135,"about_ca_topic_score_gemma":0.010068715,"teacher_disagreement_score":0.01852621,"about_ca_system_score_codex":0.003306388,"about_ca_system_score_gemma":0.0026152334,"threshold_uncertainty_score":0.061976314},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1908747,0.00046003214,0.7474937,0.000893649,0.00022015675,0.0002337407,0.00085500843,0.00036932205,0.05859977],"genre_scores_gemma":[0.6569282,0.00042410498,0.30828187,0.0003334034,0.00014756627,0.00031351345,0.0012139773,0.0004984936,0.03185894],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99936444,0.0002343366,0.000028127299,0.0001120478,0.00016178394,0.00009932784],"domain_scores_gemma":[0.9988242,0.00057908526,0.00012297864,0.00015315409,0.00015316228,0.00016748352],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005893116,0.00081827305,0.0008424713,0.0016531054,0.0009623041,0.002833319,0.0014713822,0.0015737466,0.014388156],"category_scores_gemma":[0.003588419,0.0010367186,0.0007273642,0.0010506,0.0012439099,0.0023548745,0.0027775378,0.002263609,0.001450066],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000570083,0.00027206333,0.00087298045,0.00023173545,0.000060114566,0.0003914465,0.00029594533,0.1324514,0.0057512466,0.78828394,0.010788546,0.060030382],"study_design_scores_gemma":[0.00009581619,0.00006617509,0.00048838835,0.00006198258,0.000030010517,0.00032794382,0.00022465074,0.3701289,0.0028931666,0.6172976,0.008356903,0.000028543285],"about_ca_topic_score_codex":0.00081965554,"about_ca_topic_score_gemma":0.0011411307,"teacher_disagreement_score":0.014388156,"about_ca_system_score_codex":0.0006682048,"about_ca_system_score_gemma":0.00040364757,"threshold_uncertainty_score":0.048133135},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016841963,0.0006239192,0.97657824,0.0002686408,0.000074208816,0.000053768297,0.00043379632,0.002898478,0.0022269792],"genre_scores_gemma":[0.3275436,0.001597695,0.664092,0.000115994335,0.00008502495,0.00010740179,0.0017595156,0.00055920356,0.00413953],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99956626,0.000052127627,0.000035355104,0.00008093065,0.00023077721,0.00003442529],"domain_scores_gemma":[0.9992618,0.0002022512,0.000067782115,0.00023951958,0.00019206756,0.00003659784],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042217452,0.0006283985,0.0007689221,0.0017836246,0.0005624292,0.0011290002,0.0008632828,0.000893475,0.0042756074],"category_scores_gemma":[0.0029592477,0.00043396998,0.00064181816,0.0026454106,0.0006636496,0.0019321807,0.0018603003,0.00064988737,0.0017210214],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003044368,0.00006423411,0.0024227635,0.00039798053,0.000042286196,0.0005196252,0.00039800865,0.1551042,0.05165975,0.03813746,0.010386182,0.74056304],"study_design_scores_gemma":[0.00001075674,0.00005622509,0.0013868308,0.000042767228,0.00001554695,0.00053365465,0.00013752368,0.91970146,0.031365115,0.029543981,0.017169485,0.00003671016],"about_ca_topic_score_codex":0.0013398877,"about_ca_topic_score_gemma":0.0014186328,"teacher_disagreement_score":0.0042756074,"about_ca_system_score_codex":0.0004620421,"about_ca_system_score_gemma":0.0004995203,"threshold_uncertainty_score":0.014303386},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052485865,0.0002391658,0.9114362,0.00030180212,0.000117900556,0.00011705827,0.0006078613,0.0013220498,0.033372086],"genre_scores_gemma":[0.36664522,0.0007321065,0.6092891,0.00010172133,0.00003698585,0.00011525855,0.0014167124,0.00074320205,0.020919777],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99967563,0.000077741504,0.000020082387,0.0000445255,0.00013251544,0.00004943021],"domain_scores_gemma":[0.99927706,0.00024245368,0.00005305004,0.00019898196,0.00016899995,0.000059482507],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002482353,0.0005827692,0.00042546968,0.001009396,0.0006393382,0.0015170866,0.00087139435,0.0006294424,0.010664981],"category_scores_gemma":[0.0017853057,0.0004898237,0.0004969368,0.0010311528,0.00068262126,0.0011458937,0.0011608121,0.0012818481,0.0019775303],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020932397,0.000095936724,0.0020576557,0.0003023282,0.000024725141,0.00067494926,0.00096459326,0.10997882,0.025213644,0.57831746,0.020438517,0.261722],"study_design_scores_gemma":[0.00008139318,0.00008707473,0.0012567432,0.00011737239,0.00003928222,0.0007530015,0.000540034,0.39543396,0.030806355,0.45013806,0.120693654,0.000053023436],"about_ca_topic_score_codex":0.00247005,"about_ca_topic_score_gemma":0.005497189,"teacher_disagreement_score":0.010664981,"about_ca_system_score_codex":0.0005146742,"about_ca_system_score_gemma":0.00038015118,"threshold_uncertainty_score":0.03567785},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.093315914,0.0013881,0.8601084,0.001904255,0.0005606257,0.00024388108,0.0017076512,0.0071202014,0.033650957],"genre_scores_gemma":[0.37165585,0.00057106203,0.60193527,0.00065832725,0.0002950837,0.00035332408,0.0036370347,0.001957275,0.018936759],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982834,0.00036092944,0.000098638564,0.00048503332,0.00043881376,0.00033328953],"domain_scores_gemma":[0.9968399,0.0019525058,0.00012761402,0.0006337435,0.0002163587,0.00022982336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016101833,0.0018524034,0.0023635735,0.0011718621,0.0010402373,0.003007757,0.0027466696,0.0019727047,0.029571345],"category_scores_gemma":[0.008080897,0.0008731959,0.001410112,0.0022918887,0.0016353483,0.0066185645,0.0031478535,0.002695156,0.0066286456],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002380331,0.0005469225,0.0024785579,0.0009524226,0.00024290167,0.00025618784,0.000339352,0.3095192,0.011941216,0.14830764,0.06444227,0.458593],"study_design_scores_gemma":[0.00023121871,0.00017305164,0.0003640447,0.000042240263,0.000062091174,0.00014049317,0.00018728393,0.66891104,0.0027133,0.32228842,0.0048611704,0.000025680089],"about_ca_topic_score_codex":0.0027559914,"about_ca_topic_score_gemma":0.0070175882,"teacher_disagreement_score":0.029571345,"about_ca_system_score_codex":0.0015241374,"about_ca_system_score_gemma":0.002138597,"threshold_uncertainty_score":0.09892601},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44997877,0.00026317948,0.54611665,0.00006826372,0.000021998938,0.000097013435,0.0005210777,0.000958357,0.0019747526],"genre_scores_gemma":[0.7593458,0.00033097088,0.23887335,0.000027073444,0.000011197849,0.00010449002,0.00037487719,0.00008427472,0.0008478776],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9997776,0.0000188414,0.00001770825,0.00004988845,0.00011817919,0.000017702187],"domain_scores_gemma":[0.99947745,0.00012591128,0.00011023689,0.00011479057,0.00013834795,0.000033386725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030450005,0.000404759,0.00037175824,0.0009893342,0.00016952372,0.00044721694,0.00042575534,0.0004884073,0.00082451233],"category_scores_gemma":[0.0006963249,0.00025596152,0.0002049936,0.0007084105,0.00034732162,0.0005579306,0.00032419316,0.00041867516,0.00019829572],"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.00013509928,0.00006260021,0.009284694,0.00018402576,0.000026119875,0.00026318574,0.00017681795,0.0138560785,0.9157253,0.0014539869,0.00031474556,0.05851723],"study_design_scores_gemma":[0.000021370379,0.00018346598,0.05273049,0.000022036385,0.000048583566,0.001189662,0.00012155655,0.19603156,0.74639136,0.00082765723,0.0023425308,0.00008971997],"about_ca_topic_score_codex":0.0010319105,"about_ca_topic_score_gemma":0.0014452573,"teacher_disagreement_score":0.0010319105,"about_ca_system_score_codex":0.00021646396,"about_ca_system_score_gemma":0.0003082499,"threshold_uncertainty_score":0.0027582645},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004315606,0.0002140976,0.9913885,0.00012406426,0.000083855106,0.00003709624,0.00011069887,0.0005198701,0.0032062314],"genre_scores_gemma":[0.2866461,0.0006797879,0.70239055,0.00018319758,0.000110930196,0.00020053293,0.0007776352,0.0015030421,0.0075082514],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99911875,0.00019976968,0.00005341117,0.00006692295,0.0004935401,0.00006767998],"domain_scores_gemma":[0.9980976,0.0006353263,0.0001244379,0.0004406875,0.00062881625,0.000073076706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013560292,0.00067086343,0.0007978262,0.0012483781,0.00042901764,0.0015017692,0.0014803606,0.0011396338,0.0066038272],"category_scores_gemma":[0.008410296,0.0005319957,0.0007089475,0.0013422244,0.0007580547,0.0019387493,0.0016418643,0.0018689085,0.0014385621],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025955067,0.00011186699,0.0005947058,0.00019556232,0.000035341985,0.000072639916,0.000110492445,0.4614708,0.0073199896,0.23048885,0.009071427,0.29026887],"study_design_scores_gemma":[0.000018845818,0.000028034516,0.00008618496,0.000021833988,0.0000080303,0.00002939707,0.000015105294,0.9459991,0.001942835,0.048997477,0.0028427737,0.000010446631],"about_ca_topic_score_codex":0.003052697,"about_ca_topic_score_gemma":0.002536432,"teacher_disagreement_score":0.0066038272,"about_ca_system_score_codex":0.0010171245,"about_ca_system_score_gemma":0.00081140344,"threshold_uncertainty_score":0.022092044},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20214094,0.00040004594,0.7889256,0.0003896495,0.000056542096,0.0002437333,0.0012508109,0.001319623,0.005273076],"genre_scores_gemma":[0.403981,0.00020729574,0.58654624,0.00011715611,0.000028023664,0.00016335936,0.0039645615,0.0003261305,0.00466625],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999514,0.00006787019,0.000026635544,0.0001678684,0.00012272381,0.00010081651],"domain_scores_gemma":[0.99838233,0.0008160709,0.00023181531,0.00020851495,0.00017075003,0.00019049359],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005870297,0.0008687455,0.0011389349,0.001617737,0.0010765904,0.001249457,0.001547153,0.0012877409,0.009090993],"category_scores_gemma":[0.0043848464,0.00074853783,0.00075390795,0.0018583031,0.00094433373,0.0035635603,0.0024449483,0.0010260551,0.0013010188],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001388369,0.00037157763,0.011033921,0.0008867535,0.0001778271,0.0007714901,0.0006663529,0.49940366,0.013467338,0.08401433,0.0139207505,0.37389767],"study_design_scores_gemma":[0.00012369527,0.00026861098,0.0009738271,0.00005628889,0.000047654226,0.0002962226,0.0004963345,0.8456358,0.007829822,0.13519481,0.009034499,0.000042397238],"about_ca_topic_score_codex":0.0027910182,"about_ca_topic_score_gemma":0.005106653,"teacher_disagreement_score":0.009090993,"about_ca_system_score_codex":0.0005694667,"about_ca_system_score_gemma":0.001075404,"threshold_uncertainty_score":0.030412376},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3647443,0.00053673185,0.577274,0.000576272,0.00020212425,0.00010009446,0.0002831445,0.00031660052,0.05596671],"genre_scores_gemma":[0.88463455,0.0007597167,0.07541422,0.0003034831,0.00014451407,0.00011533649,0.00054959004,0.0002934275,0.03778526],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994486,0.00013698191,0.000024113251,0.00010054291,0.0001887288,0.00010105663],"domain_scores_gemma":[0.9985876,0.0006339761,0.0001921169,0.00019061202,0.00016750119,0.00022825044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059589726,0.0010963801,0.0010840523,0.0013878915,0.0008515461,0.0014091582,0.00137437,0.0011335787,0.010599563],"category_scores_gemma":[0.0033507103,0.00059893104,0.0005604401,0.0011464303,0.0017046527,0.002816296,0.005610228,0.0017473749,0.00136866],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023858312,0.000075781485,0.0009334977,0.00010534941,0.000027616421,0.00022841724,0.00023876909,0.09049388,0.004813084,0.86970127,0.002728547,0.030415174],"study_design_scores_gemma":[0.00003292771,0.00010665465,0.00042806784,0.000044961584,0.000015926367,0.00016880101,0.00021991778,0.22297075,0.0019486365,0.76961565,0.004430403,0.000017248633],"about_ca_topic_score_codex":0.00057578133,"about_ca_topic_score_gemma":0.0008725625,"teacher_disagreement_score":0.010599563,"about_ca_system_score_codex":0.0004689088,"about_ca_system_score_gemma":0.0002635286,"threshold_uncertainty_score":0.03545904},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050214715,0.00015489616,0.9416386,0.00023139517,0.000044667227,0.00004907808,0.00017597388,0.00080668327,0.0066839154],"genre_scores_gemma":[0.47140697,0.00033297949,0.518598,0.00013353652,0.00003443305,0.00009300507,0.00054241956,0.00048075695,0.008377801],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996537,0.00009358993,0.000013552392,0.00008271509,0.00010623137,0.000050240575],"domain_scores_gemma":[0.9993992,0.00026861147,0.00006842936,0.00014958894,0.00005656171,0.000057585446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048815648,0.0007159881,0.0011980606,0.00076973,0.00051425124,0.0011971918,0.0014917927,0.0014445446,0.0068503898],"category_scores_gemma":[0.001954063,0.0006423597,0.0007107411,0.0012745581,0.00080557104,0.0020543183,0.0015302496,0.001222553,0.00078622915],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002429549,0.00010886048,0.0006398916,0.0001552144,0.000038380862,0.00012366865,0.00015081084,0.6496206,0.00467323,0.1737684,0.0063561588,0.16412184],"study_design_scores_gemma":[0.000018262319,0.000015660336,0.000057434005,0.000005518259,0.00000602964,0.00001924255,0.000017888624,0.96312106,0.00059986574,0.035218153,0.00091406517,0.0000067484607],"about_ca_topic_score_codex":0.0049715326,"about_ca_topic_score_gemma":0.00762258,"teacher_disagreement_score":0.0068503898,"about_ca_system_score_codex":0.00084566517,"about_ca_system_score_gemma":0.0007642672,"threshold_uncertainty_score":0.022916853},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029734464,0.00004605375,0.97579706,0.00009344147,0.000052971554,0.00012796307,0.00014016943,0.018475067,0.0022938391],"genre_scores_gemma":[0.14339091,0.00030574875,0.83001715,0.00042019712,0.00008963803,0.0007881811,0.0026989917,0.011183591,0.011105696],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9976859,0.00021074146,0.00022089307,0.00034660753,0.0013670648,0.00016889346],"domain_scores_gemma":[0.9970228,0.0005004725,0.00009847953,0.0014408637,0.0007632225,0.00017419936],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020462272,0.0011135553,0.0015071033,0.0015843033,0.00094870495,0.0038861854,0.0045015924,0.0017052784,0.0070312307],"category_scores_gemma":[0.008642699,0.0011398733,0.0013796962,0.0014503151,0.0013612878,0.0046577402,0.005042978,0.002608152,0.0044737835],"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.0013383934,0.00061773387,0.007870865,0.0010230271,0.00037351326,0.0010667626,0.0022543762,0.053185057,0.11793349,0.25012022,0.06192604,0.50229055],"study_design_scores_gemma":[0.00024644853,0.0003159409,0.002085992,0.00013140043,0.00024754304,0.0010948548,0.00026534137,0.5488734,0.13998148,0.056575518,0.24995737,0.00022475718],"about_ca_topic_score_codex":0.0021725015,"about_ca_topic_score_gemma":0.0015606825,"teacher_disagreement_score":0.0070312307,"about_ca_system_score_codex":0.0010151167,"about_ca_system_score_gemma":0.0023085834,"threshold_uncertainty_score":0.02352184},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006777856,0.00021263771,0.9842003,0.00013342361,0.00008931825,0.000066678964,0.0005617947,0.0017053094,0.006252652],"genre_scores_gemma":[0.30949718,0.00093029474,0.6747597,0.00017149275,0.00015936632,0.00041046215,0.002781258,0.0012993009,0.009991005],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99864763,0.0001445841,0.000072867486,0.00026851034,0.00075221114,0.00011412963],"domain_scores_gemma":[0.998738,0.00028001642,0.00010259873,0.0004216806,0.00037972556,0.000078055076],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004582668,0.0010242552,0.0008729289,0.0027042108,0.00084319577,0.0035271673,0.0019225212,0.0012727318,0.0112116225],"category_scores_gemma":[0.0043489984,0.0005012985,0.0012233369,0.0027013356,0.001009357,0.004955335,0.0032781744,0.001624077,0.0036442429],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001530294,0.000073017894,0.0016522272,0.0002836085,0.00004939502,0.00023299962,0.00049672724,0.19560437,0.011913779,0.39639944,0.016856074,0.3762853],"study_design_scores_gemma":[0.000028415614,0.0000892323,0.0007386539,0.00004795151,0.000025212896,0.0004158726,0.00021590521,0.68440545,0.009821565,0.20023242,0.10389947,0.000079894],"about_ca_topic_score_codex":0.002157419,"about_ca_topic_score_gemma":0.001351899,"teacher_disagreement_score":0.0112116225,"about_ca_system_score_codex":0.00093084015,"about_ca_system_score_gemma":0.0009259259,"threshold_uncertainty_score":0.03750664},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010513535,0.0002998801,0.9787481,0.00028389966,0.00007667188,0.000103864746,0.00022557867,0.0018098336,0.007938693],"genre_scores_gemma":[0.16932492,0.0005029238,0.8159925,0.00017468518,0.00008888119,0.00020945536,0.0012784301,0.0008286794,0.011599603],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99877936,0.00017024596,0.000053619387,0.00017345995,0.0006676163,0.00015576335],"domain_scores_gemma":[0.99824595,0.00069717166,0.00009598424,0.0004898874,0.00038687902,0.000084149746],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000630649,0.0013272004,0.0014513755,0.0018265975,0.0009970855,0.0019275106,0.0024010283,0.0013911189,0.01655786],"category_scores_gemma":[0.0047935676,0.0008706577,0.0012586328,0.0030709067,0.0008899168,0.003186169,0.0040704836,0.0025952465,0.0040830094],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043858908,0.0002572885,0.00060739263,0.0002743894,0.00006644411,0.00009542428,0.00017570738,0.23712882,0.008818447,0.076964304,0.02151154,0.6536617],"study_design_scores_gemma":[0.0000817446,0.00007092962,0.00017743224,0.000019157602,0.000019170066,0.00006882699,0.00007388566,0.9344301,0.0060355933,0.05242997,0.0065774587,0.000015671689],"about_ca_topic_score_codex":0.0043242653,"about_ca_topic_score_gemma":0.006577045,"teacher_disagreement_score":0.01655786,"about_ca_system_score_codex":0.0010689971,"about_ca_system_score_gemma":0.0013075679,"threshold_uncertainty_score":0.05539161},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07154549,0.00089532085,0.89213204,0.0005181428,0.000261702,0.00007335873,0.00019515298,0.0008087566,0.033570003],"genre_scores_gemma":[0.52469885,0.0019628955,0.42219177,0.00033514987,0.00023053325,0.00012550034,0.00047973034,0.0010065055,0.048968945],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996295,0.00008497963,0.000023124356,0.00007461587,0.00012736312,0.000060427737],"domain_scores_gemma":[0.9991904,0.00033465566,0.00008306716,0.00019527871,0.00012430274,0.00007226153],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000553373,0.00055656635,0.0006459065,0.001971143,0.001062689,0.0023356916,0.0012661392,0.0011330206,0.010598384],"category_scores_gemma":[0.0035144764,0.00045951217,0.00063435215,0.0021532902,0.0013985478,0.002765767,0.002618914,0.0016858788,0.0013454906],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046947323,0.000023527014,0.00020898208,0.000051050734,0.0000050322883,0.00009001117,0.00020782833,0.012855272,0.0020162796,0.91456044,0.002432362,0.067502275],"study_design_scores_gemma":[0.000012493221,0.000035261626,0.00022109122,0.00004774885,0.000013480247,0.00022882823,0.00026939498,0.16068238,0.0038185515,0.82162493,0.013016239,0.000029686526],"about_ca_topic_score_codex":0.0015614525,"about_ca_topic_score_gemma":0.0027546736,"teacher_disagreement_score":0.010598384,"about_ca_system_score_codex":0.00086390536,"about_ca_system_score_gemma":0.00047062204,"threshold_uncertainty_score":0.035455167},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014027408,0.0024170042,0.9657329,0.0015363691,0.003281846,0.00004705393,0.00015148372,0.001202701,0.024227858],"genre_scores_gemma":[0.054046072,0.0101941135,0.8893746,0.0013571664,0.0033537524,0.00013364543,0.0005459149,0.0015499336,0.03944476],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991609,0.0001600986,0.000053582815,0.00013150551,0.00045343515,0.000040434858],"domain_scores_gemma":[0.9984274,0.00069605233,0.00003987583,0.00045904552,0.00029060777,0.00008706593],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006961438,0.0009691917,0.0007501617,0.001742068,0.0008685696,0.002049763,0.002011925,0.0014734552,0.022568218],"category_scores_gemma":[0.0040682554,0.00080136704,0.001162747,0.0028254138,0.0015089004,0.003560749,0.002897574,0.0037107454,0.004620336],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008224348,0.000044113007,0.0002769303,0.0003192739,0.000035588495,0.0003477578,0.00016372236,0.026193883,0.0062305196,0.36853153,0.08222591,0.51554847],"study_design_scores_gemma":[0.000020823514,0.000048428865,0.0003991113,0.00013429353,0.000033203924,0.0009468779,0.00008886958,0.12924565,0.006416735,0.36720556,0.4953797,0.0000808195],"about_ca_topic_score_codex":0.0023421294,"about_ca_topic_score_gemma":0.0040936917,"teacher_disagreement_score":0.022568218,"about_ca_system_score_codex":0.0006074778,"about_ca_system_score_gemma":0.00047892434,"threshold_uncertainty_score":0.07549822},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003335606,0.00020189416,0.9925235,0.000071369424,0.000040010953,0.00007060565,0.000052470667,0.00047799264,0.0032266304],"genre_scores_gemma":[0.082299866,0.000375941,0.91226393,0.00006240196,0.00003499458,0.00023480732,0.00028841774,0.00030840523,0.004131171],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995951,0.000080251404,0.00002926573,0.00008908243,0.00016415046,0.000042081767],"domain_scores_gemma":[0.99922025,0.0004618917,0.00006522562,0.000093779454,0.00013161056,0.000027211901],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008697001,0.0013516858,0.0010591086,0.001408191,0.0007328004,0.0014210275,0.0015795368,0.0017184452,0.008657812],"category_scores_gemma":[0.003579384,0.00088133407,0.0013612838,0.0009557383,0.0009960268,0.0014578126,0.0015384743,0.001445963,0.0021396363],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006374009,0.000048652473,0.0007253329,0.00024350118,0.00004124229,0.00008338373,0.00012381014,0.67608184,0.0025027457,0.060338307,0.004231144,0.25551626],"study_design_scores_gemma":[0.000022806526,0.000026904272,0.000061994804,0.000031257016,0.000008883805,0.00004134382,0.000028578936,0.97303087,0.0007660639,0.021646602,0.0043271845,0.0000074769496],"about_ca_topic_score_codex":0.002293157,"about_ca_topic_score_gemma":0.0039935354,"teacher_disagreement_score":0.008657812,"about_ca_system_score_codex":0.0006264473,"about_ca_system_score_gemma":0.0009830194,"threshold_uncertainty_score":0.028963268},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042842958,0.00043545358,0.9434938,0.00014925482,0.00012383316,0.00008819599,0.0001664207,0.00058963854,0.0121104475],"genre_scores_gemma":[0.28141284,0.00038786506,0.7088071,0.00008259006,0.000033872013,0.00016437922,0.00042910886,0.00047440032,0.008207878],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99949634,0.00009207307,0.000039049333,0.00009028998,0.00021981022,0.000062334875],"domain_scores_gemma":[0.9992136,0.00037575405,0.000067451474,0.000158212,0.00013409313,0.000050935294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005881865,0.0006273369,0.0007647444,0.0010060042,0.000717447,0.0015371492,0.0013407775,0.0010494116,0.0077409907],"category_scores_gemma":[0.0029066398,0.0007023816,0.0006610942,0.00092918746,0.0008910415,0.0012882327,0.001674212,0.0014003916,0.0012674677],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036438042,0.000122023994,0.0013167837,0.00033133075,0.00004026788,0.0002785395,0.0008072176,0.15832505,0.018294446,0.5109613,0.009647631,0.29951116],"study_design_scores_gemma":[0.00009845484,0.00013991159,0.00063757773,0.0000927836,0.00002445421,0.00040532395,0.00037681067,0.70343596,0.0100185415,0.25979376,0.024928104,0.0000483688],"about_ca_topic_score_codex":0.0012482081,"about_ca_topic_score_gemma":0.0015692471,"teacher_disagreement_score":0.0077409907,"about_ca_system_score_codex":0.0005058983,"about_ca_system_score_gemma":0.00037869313,"threshold_uncertainty_score":0.025896251},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048998,0.0010624521,0.9250552,0.0007946395,0.00020293563,0.00007473769,0.00042117987,0.001333679,0.022057254],"genre_scores_gemma":[0.5952639,0.0007396656,0.3755717,0.0004977711,0.0002724156,0.00015525238,0.0008760151,0.0009316733,0.025691656],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986051,0.00027093038,0.0000444347,0.00029067256,0.0005909811,0.0001980072],"domain_scores_gemma":[0.9979323,0.0010152241,0.00012013642,0.00046239505,0.00031042253,0.00015959765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011697214,0.0012283952,0.001690532,0.0015762157,0.0008428294,0.0019619958,0.0021532727,0.001942108,0.012481945],"category_scores_gemma":[0.0083901,0.00078537886,0.00095313066,0.001077727,0.0014228257,0.003737971,0.0045381347,0.0028639403,0.0023705156],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007610337,0.00013737204,0.0023038806,0.00029258826,0.00008685704,0.00019993709,0.00027415322,0.26022598,0.008284854,0.38495272,0.021334406,0.32114622],"study_design_scores_gemma":[0.000026377655,0.000057248933,0.00023854087,0.00003821228,0.000020283884,0.00011537515,0.00005689586,0.84416157,0.0028267915,0.14641395,0.006030965,0.000013793414],"about_ca_topic_score_codex":0.002900513,"about_ca_topic_score_gemma":0.0053717224,"teacher_disagreement_score":0.012481945,"about_ca_system_score_codex":0.0017169873,"about_ca_system_score_gemma":0.00100539,"threshold_uncertainty_score":0.041756332},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15179108,0.0019562775,0.8214183,0.002790351,0.00014246887,0.00020324033,0.004221537,0.007859988,0.009616667],"genre_scores_gemma":[0.73735225,0.0008253185,0.24615408,0.0005201155,0.00025655408,0.00028850324,0.008609942,0.0005308743,0.005462378],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9958198,0.0007984762,0.00037165362,0.00096713164,0.0014324427,0.0006103446],"domain_scores_gemma":[0.98741734,0.0066469186,0.00088698714,0.00391506,0.00070412265,0.00042958334],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019173018,0.0010324941,0.0020571952,0.0014431415,0.00077709416,0.0035106624,0.003853829,0.0028306015,0.009432733],"category_scores_gemma":[0.019457148,0.0006607396,0.0010181726,0.0036672174,0.0014462308,0.011478321,0.0041487683,0.002707966,0.0022470152],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0032243312,0.00055587076,0.0052491967,0.00095158734,0.00017486053,0.00035160247,0.00061809696,0.4272511,0.011593935,0.22038819,0.028047284,0.30159396],"study_design_scores_gemma":[0.00017964668,0.00014205695,0.0007654519,0.000040402832,0.000040022176,0.00030234322,0.0001813958,0.7686484,0.0050274925,0.220028,0.004610915,0.000033884782],"about_ca_topic_score_codex":0.0025019336,"about_ca_topic_score_gemma":0.0032821952,"teacher_disagreement_score":0.009432733,"about_ca_system_score_codex":0.0024569295,"about_ca_system_score_gemma":0.0013756715,"threshold_uncertainty_score":0.031555653},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.088741474,0.0005020271,0.7403422,0.0013653977,0.00056786306,0.00011225441,0.00044821933,0.00042858804,0.16749191],"genre_scores_gemma":[0.7632083,0.0018372482,0.123299524,0.0013025705,0.00094153296,0.0004075662,0.0015766267,0.0009912775,0.10643531],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99900985,0.0001840759,0.000058287278,0.00016268394,0.00041830627,0.00016692572],"domain_scores_gemma":[0.9972556,0.0014270298,0.00023271152,0.00033991376,0.0005344301,0.00021037774],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011957928,0.0009436808,0.0006965924,0.0033907082,0.0020028206,0.0032712533,0.0015966546,0.0011586407,0.018139819],"category_scores_gemma":[0.0058016134,0.0007644439,0.0016609915,0.0014497967,0.0029446098,0.0060399114,0.0036636512,0.0044549014,0.0023979773],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001283881,0.000011239229,0.00010917402,0.000015752343,0.000004125205,0.000025515059,0.0000640178,0.00088608917,0.00026557906,0.9934667,0.0012299626,0.003909033],"study_design_scores_gemma":[0.000011115799,0.000011294573,0.00011122114,0.000011280343,0.0000074462014,0.0000750578,0.00005055306,0.008129461,0.0005588261,0.987328,0.0036964393,0.000009310548],"about_ca_topic_score_codex":0.0011784862,"about_ca_topic_score_gemma":0.000996705,"teacher_disagreement_score":0.018139819,"about_ca_system_score_codex":0.0012723792,"about_ca_system_score_gemma":0.0006009283,"threshold_uncertainty_score":0.060683727},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13952231,0.00489245,0.5761182,0.019003192,0.003412475,0.00014772706,0.0008423703,0.0003509028,0.25571042],"genre_scores_gemma":[0.7492397,0.004717634,0.12784909,0.002682397,0.0029113644,0.00024627606,0.0007541386,0.00058055425,0.1110189],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988223,0.00034429386,0.000070823444,0.00029869896,0.00034207944,0.00012177216],"domain_scores_gemma":[0.9956601,0.0029781368,0.00030703252,0.00043042074,0.00038899182,0.000235276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020050262,0.00075933797,0.0010499752,0.0026223762,0.0026790383,0.002334043,0.0016248217,0.002783281,0.011187275],"category_scores_gemma":[0.011182206,0.0005899865,0.0010745595,0.001982119,0.0039939834,0.007767854,0.0033494348,0.004278706,0.0013624124],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027086387,0.000015568576,0.000093657305,0.000049145252,0.0000081720555,0.000054895492,0.000083142666,0.002307676,0.00037514223,0.9876602,0.0030289628,0.006296387],"study_design_scores_gemma":[0.0000092483715,0.0000064992405,0.00006625869,0.000010865594,0.0000049010487,0.00007119198,0.000033198183,0.007491436,0.00032386975,0.9867237,0.0052506425,0.000008333308],"about_ca_topic_score_codex":0.0011732773,"about_ca_topic_score_gemma":0.0006377696,"teacher_disagreement_score":0.011187275,"about_ca_system_score_codex":0.0014025084,"about_ca_system_score_gemma":0.0007594581,"threshold_uncertainty_score":0.03742522},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.58488655,0.0030485508,0.3627056,0.00066925946,0.00038897758,0.00015403122,0.0014700047,0.00070871453,0.04596831],"genre_scores_gemma":[0.9088664,0.00049005233,0.08110254,0.00018510481,0.00014144363,0.00019934025,0.0010946179,0.00009702392,0.007823527],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993824,0.000067828645,0.00002724426,0.00019550818,0.0001902715,0.00013676111],"domain_scores_gemma":[0.9986265,0.00038414926,0.00023901624,0.00022793715,0.00025220047,0.0002702137],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005451995,0.00050780864,0.0009926595,0.0018134327,0.0010837328,0.0020726023,0.0010975836,0.000818431,0.0035056348],"category_scores_gemma":[0.0017055789,0.00045832776,0.00072592736,0.0007977244,0.0029885948,0.001505798,0.003951473,0.0008716799,0.000639451],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004447969,0.00011467814,0.0052935258,0.0005705619,0.000120523815,0.0009352588,0.0005978853,0.008675626,0.06350141,0.8599218,0.006721548,0.053102218],"study_design_scores_gemma":[0.00027939273,0.00075650227,0.0139298495,0.00025988554,0.00022117198,0.008824747,0.0011621864,0.076027736,0.12383362,0.6606419,0.11373922,0.0003238423],"about_ca_topic_score_codex":0.0003728758,"about_ca_topic_score_gemma":0.0003621767,"teacher_disagreement_score":0.0035056348,"about_ca_system_score_codex":0.0006502474,"about_ca_system_score_gemma":0.00054007774,"threshold_uncertainty_score":0.0117275715},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20607354,0.0020192675,0.7450256,0.002547263,0.0005814586,0.00022369006,0.00033357865,0.0008093382,0.042386305],"genre_scores_gemma":[0.78591216,0.0011210941,0.19669911,0.00047007942,0.00026219035,0.0004078788,0.0004714159,0.00063210115,0.014023953],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969099,0.001304822,0.00013913748,0.00039267316,0.0009493063,0.00030415037],"domain_scores_gemma":[0.963805,0.027625347,0.0017839738,0.0024575233,0.0023211818,0.0020069773],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00536351,0.00081207213,0.0017407152,0.0034133578,0.0022889616,0.0026423917,0.0026402439,0.002598249,0.008973887],"category_scores_gemma":[0.05394539,0.0010764279,0.00082006765,0.0021386042,0.0043533617,0.005033689,0.0033867757,0.0030516784,0.0011844452],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00064720085,0.00008078943,0.0020783707,0.00021013038,0.000037265152,0.00010829983,0.0003244629,0.261442,0.0039639734,0.6796364,0.0061973813,0.045273747],"study_design_scores_gemma":[0.000045417128,0.00008898349,0.0004726394,0.00006316365,0.00001860193,0.000075856835,0.00008352404,0.77337795,0.0012365268,0.22217816,0.0023251993,0.000033884662],"about_ca_topic_score_codex":0.0031654148,"about_ca_topic_score_gemma":0.0028247812,"teacher_disagreement_score":0.008973887,"about_ca_system_score_codex":0.002129597,"about_ca_system_score_gemma":0.00150699,"threshold_uncertainty_score":0.030020654},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000050841907,0.0045298934,0.00013501725,0.020898603,0.965076,0.000032599324,0.00007183081,0.000071611656,0.009133556],"genre_scores_gemma":[0.0009917013,0.0048774886,0.00019759197,0.021589177,0.89270204,0.000052739826,0.00014574883,0.00008881283,0.079354726],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99754614,0.000397658,0.00025845616,0.00033357457,0.001218816,0.00024545137],"domain_scores_gemma":[0.9886736,0.0026546419,0.0009953047,0.00062381406,0.0049886378,0.0020639768],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032714147,0.002122555,0.0024050074,0.0035847093,0.0023372697,0.0055348733,0.0021542287,0.008447895,0.06608459],"category_scores_gemma":[0.016866146,0.0007848129,0.0015615186,0.0014031122,0.0012217078,0.0025052738,0.0016798452,0.008839455,0.040464483],"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.000016866321,0.000004969241,0.000010073117,0.000066679284,0.000004731303,0.00006903955,0.0000031592563,0.000008722563,0.000026576434,0.00010347206,0.9945738,0.0051119425],"study_design_scores_gemma":[0.000026450356,0.000009451973,0.0001087444,0.00013265801,0.000015013863,0.0001574258,0.000011779313,0.00003625119,0.000051331812,0.00028406156,0.9991615,0.0000053854847],"about_ca_topic_score_codex":0.0010272162,"about_ca_topic_score_gemma":0.0026296035,"teacher_disagreement_score":0.06608459,"about_ca_system_score_codex":0.0016893663,"about_ca_system_score_gemma":0.001992831,"threshold_uncertainty_score":0},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1733579,0.00318343,0.7733056,0.010105918,0.0006189403,0.00015300894,0.00085661665,0.000437077,0.037981544],"genre_scores_gemma":[0.75307405,0.0021888546,0.22211622,0.0013566699,0.0016837212,0.00049485505,0.0008638837,0.0005988346,0.017622849],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99562055,0.0015615743,0.00034010276,0.00101225,0.0008234877,0.000641973],"domain_scores_gemma":[0.974171,0.017637054,0.0019311875,0.001973017,0.0019507735,0.0023370024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0064853993,0.0018360933,0.0032267035,0.002128903,0.0027396895,0.005301726,0.0042875563,0.0029685097,0.007080621],"category_scores_gemma":[0.029133426,0.00102722,0.002878218,0.0026804833,0.0042872876,0.016159512,0.0069592926,0.0073852357,0.0004122863],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027234235,0.00014543679,0.0006860752,0.00023099314,0.00009107123,0.0000748873,0.00027231974,0.017463304,0.0011442201,0.956715,0.0043238956,0.018580498],"study_design_scores_gemma":[0.00003617325,0.00010455574,0.00037943549,0.00003553173,0.000039561543,0.00013771564,0.00016571044,0.05457368,0.0009252055,0.94170254,0.0018758778,0.000023988654],"about_ca_topic_score_codex":0.0006153596,"about_ca_topic_score_gemma":0.0006660358,"teacher_disagreement_score":0.007080621,"about_ca_system_score_codex":0.0024056218,"about_ca_system_score_gemma":0.0017125818,"threshold_uncertainty_score":0.03429848},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055149585,0.0027096395,0.73364466,0.007736352,0.001135864,0.00007313902,0.00048456618,0.00059572427,0.19847047],"genre_scores_gemma":[0.786861,0.0023863888,0.14947622,0.0016243167,0.0011821077,0.00019905956,0.00055665115,0.0005906507,0.057123557],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99889886,0.00034300814,0.000052476164,0.00021430956,0.00037014543,0.00012118206],"domain_scores_gemma":[0.99758685,0.0012395865,0.00014658512,0.0005278909,0.00034312243,0.00015597284],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016372871,0.0005877541,0.00090062513,0.0018308382,0.002473222,0.0041188523,0.001556616,0.0015787926,0.015297329],"category_scores_gemma":[0.0058721406,0.0006580376,0.0012592701,0.0013338678,0.0059891036,0.009088004,0.0036107465,0.004041297,0.0022330477],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005765814,0.00000293895,0.00001601734,0.000007278086,0.0000015504601,0.000008241876,0.000035240722,0.0002726967,0.000077081684,0.99699295,0.0008464616,0.001733793],"study_design_scores_gemma":[0.0000029880134,0.000002888006,0.000012981058,0.000003814885,0.0000010910821,0.000013374793,0.000009884052,0.0012841559,0.00007970935,0.9965372,0.0020490605,0.0000028542645],"about_ca_topic_score_codex":0.001090727,"about_ca_topic_score_gemma":0.0010201859,"teacher_disagreement_score":0.015297329,"about_ca_system_score_codex":0.0015790421,"about_ca_system_score_gemma":0.00081598706,"threshold_uncertainty_score":0.05117464},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006386587,0.00013057402,0.9848306,0.00021485641,0.000058409456,0.00010376063,0.0001664421,0.0018057069,0.006303002],"genre_scores_gemma":[0.08918969,0.00011277574,0.90271306,0.00016544978,0.000044838005,0.00033795348,0.00078329083,0.0007902779,0.005862614],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990282,0.00021294819,0.00004611454,0.0002362284,0.00035143862,0.00012506993],"domain_scores_gemma":[0.998486,0.0008207584,0.00007719159,0.00037163013,0.00016715065,0.00007732539],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010566058,0.001643048,0.0016234778,0.0011649783,0.00089761475,0.001719667,0.0029825978,0.002052949,0.017363766],"category_scores_gemma":[0.0053976434,0.00084599474,0.0012810383,0.0017303843,0.0010755868,0.0023812775,0.0034880836,0.003118926,0.0044278903],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004522594,0.0003157659,0.00072789454,0.00037354018,0.00008856908,0.00019199005,0.00023041858,0.26220316,0.010025273,0.11371523,0.031473856,0.58020204],"study_design_scores_gemma":[0.00014320313,0.00009014688,0.00021339953,0.000030155765,0.000033593547,0.0001231013,0.000054151584,0.87159485,0.002625852,0.11893895,0.006130809,0.000021732441],"about_ca_topic_score_codex":0.0025061963,"about_ca_topic_score_gemma":0.0044460003,"teacher_disagreement_score":0.017363766,"about_ca_system_score_codex":0.0011877206,"about_ca_system_score_gemma":0.0019224315,"threshold_uncertainty_score":0.058087528},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024569761,0.000054723765,0.9723254,0.00008043811,0.00004162672,0.000029125586,0.0000747548,0.00071979215,0.0021043937],"genre_scores_gemma":[0.3195161,0.00009016927,0.6776154,0.00004074897,0.00003480183,0.00005704716,0.00024825265,0.0005889116,0.0018086454],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995944,0.00007514354,0.000022291499,0.000093081835,0.00015947015,0.000055712833],"domain_scores_gemma":[0.99869424,0.0007598591,0.00008430557,0.00026154544,0.00012349137,0.00007657501],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041239124,0.0005607121,0.0010658705,0.0008070159,0.00068248896,0.0014245124,0.0011160526,0.00080054,0.0049117873],"category_scores_gemma":[0.003745006,0.00066301617,0.00077564485,0.0007835799,0.0009314438,0.001988724,0.0019303884,0.0015095501,0.0007851469],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005421436,0.00016986488,0.0027055684,0.00037107457,0.00011198164,0.00039598957,0.0004600701,0.47513974,0.022198167,0.122465625,0.006724459,0.36871544],"study_design_scores_gemma":[0.000032712553,0.000048788996,0.00018137203,0.000013636009,0.000012977577,0.000053516,0.000058615347,0.9498138,0.005158042,0.041749705,0.0028663883,0.000010464377],"about_ca_topic_score_codex":0.0025718415,"about_ca_topic_score_gemma":0.004055314,"teacher_disagreement_score":0.0049117873,"about_ca_system_score_codex":0.00041805799,"about_ca_system_score_gemma":0.0006541079,"threshold_uncertainty_score":0.01643157},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14846046,0.000475994,0.7869186,0.0010474588,0.0005762461,0.0001620724,0.00026780803,0.0014173661,0.060674045],"genre_scores_gemma":[0.54919225,0.0002310922,0.42871553,0.00019033489,0.00008642271,0.00013469569,0.00027647542,0.0004965568,0.020676639],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99938285,0.0001238102,0.000031594023,0.00019731792,0.00017073315,0.00009372381],"domain_scores_gemma":[0.99927217,0.00019475514,0.00007181072,0.00022735485,0.00016020426,0.00007369533],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006046278,0.0006388114,0.0009837502,0.0012867888,0.0014981811,0.0017665253,0.0015682143,0.0023431377,0.012846611],"category_scores_gemma":[0.0033756725,0.00060501724,0.0005658102,0.0008296279,0.0013720086,0.0025376978,0.004334347,0.0011573419,0.0050389506],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014316005,0.00010905044,0.0026382403,0.000607801,0.000064782755,0.0013967922,0.001898777,0.059163008,0.06448752,0.61458284,0.020146724,0.23347296],"study_design_scores_gemma":[0.00017134141,0.00058871164,0.0015646087,0.00021599703,0.000072678224,0.0025757907,0.0013334383,0.45819932,0.09673941,0.2622383,0.17612092,0.00017954098],"about_ca_topic_score_codex":0.000586219,"about_ca_topic_score_gemma":0.0007088975,"teacher_disagreement_score":0.012846611,"about_ca_system_score_codex":0.0006553081,"about_ca_system_score_gemma":0.0006406546,"threshold_uncertainty_score":0.0429762},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.103438176,0.00007293936,0.89010966,0.00006594714,0.00004848408,0.00008364747,0.000067094865,0.0008845409,0.0052296035],"genre_scores_gemma":[0.61737084,0.00006826558,0.3792802,0.00004976321,0.000011944196,0.000066242166,0.00015577389,0.0003760864,0.0026209082],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994331,0.00013324583,0.000032320335,0.00007182325,0.00028479612,0.000044757293],"domain_scores_gemma":[0.9991357,0.00033581717,0.00008024727,0.00028198672,0.00013030201,0.000036003847],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006252439,0.00040262318,0.000534868,0.0005146112,0.00024251475,0.00061570684,0.0006260906,0.00031431238,0.0017511443],"category_scores_gemma":[0.002474475,0.0002720218,0.00037499238,0.00033828148,0.00056170544,0.00036159696,0.0012744034,0.00058692956,0.00040072357],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020707092,0.00006415528,0.0030389132,0.00015958621,0.000056342895,0.00026178616,0.0004822659,0.65748143,0.10863998,0.026204044,0.0015559435,0.20184857],"study_design_scores_gemma":[0.000016055155,0.000033216875,0.00049027655,0.000007221011,0.0000072403604,0.000078167184,0.000043984895,0.9718478,0.019384135,0.003989586,0.00409137,0.00001098281],"about_ca_topic_score_codex":0.0018309279,"about_ca_topic_score_gemma":0.0025942062,"teacher_disagreement_score":0.0018309279,"about_ca_system_score_codex":0.0003177974,"about_ca_system_score_gemma":0.00033965762,"threshold_uncertainty_score":0.005858183},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41652322,0.00459088,0.5040091,0.0045176283,0.0006012766,0.0001306567,0.001732228,0.00078395143,0.067111015],"genre_scores_gemma":[0.90322584,0.0016192478,0.080899715,0.00052668713,0.00061345997,0.00018312162,0.0012809957,0.000796374,0.0108546335],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967637,0.0010551879,0.00019887161,0.0005075336,0.0010021274,0.00047247933],"domain_scores_gemma":[0.9777779,0.01802642,0.0007829607,0.001791984,0.00074378063,0.00087693037],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031571423,0.0015391088,0.002311621,0.0018480496,0.0013604965,0.005244242,0.0043533077,0.0017781876,0.011324042],"category_scores_gemma":[0.028670464,0.0012454974,0.0016107798,0.0023438905,0.0034288855,0.013434972,0.0052977144,0.004644096,0.0010047479],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007137501,0.00016624134,0.0025718366,0.00065002375,0.00013706535,0.00017901583,0.00054750795,0.15651695,0.00365956,0.7710406,0.0105829425,0.053234465],"study_design_scores_gemma":[0.000023325105,0.00004163546,0.00063523016,0.000043126103,0.000031217412,0.000121804886,0.00010470988,0.2124938,0.0012743179,0.78342164,0.0017813339,0.00002787276],"about_ca_topic_score_codex":0.0011029247,"about_ca_topic_score_gemma":0.0016705943,"teacher_disagreement_score":0.011324042,"about_ca_system_score_codex":0.0020513565,"about_ca_system_score_gemma":0.0012425807,"threshold_uncertainty_score":0.037882686},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007406607,0.0009519268,0.9879358,0.0003713515,0.00007909502,0.00005219542,0.00011619541,0.00049046805,0.0025963879],"genre_scores_gemma":[0.20212547,0.00233021,0.7901056,0.00019826098,0.00023891269,0.0002812506,0.0012456775,0.00025454783,0.0032201181],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983652,0.000494059,0.00009784108,0.00030059044,0.0004892736,0.00025307736],"domain_scores_gemma":[0.9968645,0.002004119,0.0002235413,0.00046337035,0.000292132,0.00015234674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017890672,0.0018791168,0.0014702681,0.0015280959,0.0008842756,0.0019884224,0.0030812086,0.0021161635,0.00431677],"category_scores_gemma":[0.01139346,0.00062952185,0.0010794563,0.0033434108,0.0013866924,0.0046431064,0.0027661999,0.002992711,0.0014157797],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023993259,0.000154545,0.0006974224,0.00031218558,0.000098902565,0.00008560683,0.00017419847,0.71579677,0.0010446527,0.12116728,0.007678828,0.15254965],"study_design_scores_gemma":[0.000053895594,0.00004701893,0.00007895966,0.00002723695,0.000019135812,0.00006195476,0.00005416151,0.8316089,0.00055924506,0.16365622,0.0038233264,0.00000996686],"about_ca_topic_score_codex":0.0028149276,"about_ca_topic_score_gemma":0.0025718708,"teacher_disagreement_score":0.00431677,"about_ca_system_score_codex":0.0017754025,"about_ca_system_score_gemma":0.0014003697,"threshold_uncertainty_score":0.014441073},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034720358,0.005376857,0.9499157,0.00046781232,0.0004126772,0.00022760856,0.00017685376,0.002175956,0.006526209],"genre_scores_gemma":[0.26614147,0.0029254928,0.72348195,0.0002777489,0.00020263398,0.00042283811,0.00046119787,0.0015662143,0.004520513],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99685043,0.0008467721,0.00017619118,0.00023167937,0.0017588221,0.00013603359],"domain_scores_gemma":[0.9935546,0.0038060835,0.0003207823,0.0007476786,0.0014261813,0.00014478937],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030281474,0.0011933589,0.0022167673,0.0027202596,0.00063550944,0.0015104718,0.0022115684,0.0023253763,0.003717708],"category_scores_gemma":[0.010348101,0.0006137596,0.0015371902,0.0023879078,0.0007221014,0.0017814247,0.001518994,0.001469678,0.00084346056],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020390537,0.000755406,0.0023194412,0.0014122751,0.0005035502,0.00008233185,0.00025126166,0.19585554,0.01857604,0.016244,0.0040049986,0.757956],"study_design_scores_gemma":[0.00024683186,0.0005188757,0.002340606,0.00006560596,0.00013357092,0.00014054065,0.00005270672,0.97902256,0.01083618,0.0030264312,0.0035505402,0.00006544167],"about_ca_topic_score_codex":0.0036996065,"about_ca_topic_score_gemma":0.0038566713,"teacher_disagreement_score":0.003717708,"about_ca_system_score_codex":0.000716836,"about_ca_system_score_gemma":0.0011254449,"threshold_uncertainty_score":0.016014576},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12487743,0.00014701216,0.85703546,0.0003157474,0.00005715405,0.000092092494,0.000296213,0.0007147814,0.016464151],"genre_scores_gemma":[0.63126475,0.00033617715,0.3596097,0.000111120215,0.000040877672,0.00015447229,0.00074126973,0.00028265902,0.0074589783],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99956197,0.000119976925,0.00002089843,0.00010950037,0.00013705586,0.000050602404],"domain_scores_gemma":[0.99794143,0.00084923714,0.00023694063,0.0005000632,0.00035818276,0.00011413009],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034130123,0.00057285966,0.00054526416,0.0014251011,0.00071375625,0.001148361,0.0013596197,0.0010198039,0.007502304],"category_scores_gemma":[0.0036863482,0.0004306928,0.000728813,0.0014296998,0.0014257962,0.0017905375,0.0023864065,0.0013546797,0.0010648338],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033318138,0.000238146,0.0032644412,0.00036545173,0.000056844918,0.00045357153,0.000633351,0.38593203,0.019528517,0.3225137,0.005457706,0.26122308],"study_design_scores_gemma":[0.000037839254,0.00014182151,0.000701111,0.0000528891,0.000033757795,0.0001697378,0.00020129354,0.7492453,0.0068276734,0.22747387,0.015081796,0.000032940872],"about_ca_topic_score_codex":0.002110939,"about_ca_topic_score_gemma":0.00339385,"teacher_disagreement_score":0.007502304,"about_ca_system_score_codex":0.00049786654,"about_ca_system_score_gemma":0.00046558862,"threshold_uncertainty_score":0.025097728},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31438175,0.00021331404,0.659613,0.00042346795,0.00013582478,0.0005862334,0.00097039744,0.001643498,0.022032492],"genre_scores_gemma":[0.50122255,0.00013079778,0.48945823,0.00005723938,0.000017901282,0.00028627468,0.0012653143,0.00030031375,0.0072614234],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994137,0.00008001861,0.00003513126,0.00012625917,0.0002130779,0.00013179143],"domain_scores_gemma":[0.9991021,0.00033931062,0.00009887096,0.00016502391,0.00020086578,0.00009395222],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037248162,0.0009944073,0.0013228065,0.0014032472,0.0012636676,0.0011948501,0.0014713521,0.0016001367,0.009276235],"category_scores_gemma":[0.003092866,0.0008292324,0.0008586572,0.0009393776,0.00059429865,0.0016040326,0.001763939,0.0009614203,0.0018806368],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0024953084,0.0007064877,0.012097379,0.00083096424,0.00030306506,0.0013526757,0.0013246114,0.45090404,0.094016336,0.036587026,0.01153069,0.38785145],"study_design_scores_gemma":[0.00015285001,0.00090282405,0.0029847973,0.0001606352,0.00013180793,0.0005245891,0.00082561525,0.8976529,0.04380885,0.035791002,0.017007323,0.00005665557],"about_ca_topic_score_codex":0.0024347433,"about_ca_topic_score_gemma":0.004760052,"teacher_disagreement_score":0.009276235,"about_ca_system_score_codex":0.0005308259,"about_ca_system_score_gemma":0.0011642377,"threshold_uncertainty_score":0.031032145},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45911968,0.0008264575,0.5111296,0.0008761641,0.000053660144,0.00016237993,0.0005802479,0.00070328685,0.026548605],"genre_scores_gemma":[0.804865,0.0005315539,0.18663253,0.00011827239,0.000038826518,0.00017347981,0.0010827646,0.00011973526,0.006437798],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995246,0.00013114403,0.000017202994,0.00008264377,0.00012345021,0.00012106085],"domain_scores_gemma":[0.99878544,0.00076310727,0.000120331584,0.00016865958,0.00006709979,0.00009523225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032704038,0.00042155257,0.00059739174,0.00046099946,0.00045386012,0.001180314,0.00077940506,0.00076505676,0.006033571],"category_scores_gemma":[0.002735849,0.00038256333,0.000686422,0.00090634415,0.0006794478,0.0013487185,0.00082804164,0.00076519244,0.00037986352],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035016905,0.0001357723,0.0024663447,0.00023648371,0.00005303657,0.00019306119,0.0003807963,0.76009,0.004575187,0.12990129,0.008778911,0.09283894],"study_design_scores_gemma":[0.000070292226,0.000113087866,0.0009896616,0.00003116831,0.0000196704,0.0001982045,0.0001301704,0.90407604,0.0018161586,0.0852234,0.0073201307,0.000011973421],"about_ca_topic_score_codex":0.0032114629,"about_ca_topic_score_gemma":0.0032776215,"teacher_disagreement_score":0.006033571,"about_ca_system_score_codex":0.0012974142,"about_ca_system_score_gemma":0.00063691894,"threshold_uncertainty_score":0.020184278},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47498888,0.0005128956,0.49068642,0.00044202807,0.00008974627,0.0001788904,0.0005622354,0.0023713857,0.030167568],"genre_scores_gemma":[0.7997019,0.00027401478,0.18967278,0.000097796845,0.000045766228,0.00008891199,0.0013223808,0.0001493296,0.0086470535],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995561,0.000056001278,0.000033647186,0.00013269676,0.00012776007,0.00009380444],"domain_scores_gemma":[0.99909127,0.0002872561,0.00013741512,0.00029227207,0.000056537272,0.00013518785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024806755,0.00060168334,0.0005755616,0.00050797226,0.00039691615,0.00078607554,0.0008470934,0.0005858634,0.0061065815],"category_scores_gemma":[0.0016071697,0.0003019794,0.00046515188,0.00073932915,0.000496656,0.0023616347,0.002245829,0.0005310547,0.001554868],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013427136,0.00036262002,0.008665677,0.0006638438,0.00014341138,0.0013247161,0.0007853857,0.1944323,0.06643328,0.2185082,0.013008928,0.4943289],"study_design_scores_gemma":[0.00017225751,0.0009013739,0.0024977587,0.000109446504,0.0000657121,0.0018986948,0.00052449043,0.44097662,0.048459057,0.47203,0.03229074,0.000073832234],"about_ca_topic_score_codex":0.00037127905,"about_ca_topic_score_gemma":0.0008649737,"teacher_disagreement_score":0.0061065815,"about_ca_system_score_codex":0.00031197927,"about_ca_system_score_gemma":0.00029723183,"threshold_uncertainty_score":0.020428538},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.67327356,0.0003777743,0.31683332,0.0008719206,0.00006991861,0.00013702149,0.0011427809,0.0007855619,0.0065081385],"genre_scores_gemma":[0.8448274,0.00018587538,0.15054831,0.00006299851,0.00004976155,0.000049047005,0.0014066919,0.00026838927,0.002601596],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995869,0.00009687208,0.000016607746,0.00012818762,0.000090302114,0.00008117326],"domain_scores_gemma":[0.99727196,0.0018846671,0.0002220166,0.00022811913,0.00015928516,0.0002338339],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046172293,0.0006208562,0.0013263065,0.0013016708,0.0009494174,0.0016886065,0.0012702438,0.0013320924,0.004272192],"category_scores_gemma":[0.005093167,0.0008481442,0.0009469638,0.0013103,0.0011307934,0.002268892,0.0013207695,0.0010020388,0.00040239657],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020872026,0.00049096247,0.015886424,0.00073652173,0.00033072545,0.0009923042,0.00091941765,0.72657514,0.026566653,0.06394501,0.0113426605,0.15012698],"study_design_scores_gemma":[0.00007787602,0.000083142215,0.0017088702,0.000019711824,0.000036099747,0.00010424572,0.00021025143,0.9450856,0.0033869187,0.047940813,0.0013311423,0.00001540231],"about_ca_topic_score_codex":0.0068848305,"about_ca_topic_score_gemma":0.011036671,"teacher_disagreement_score":0.0068848305,"about_ca_system_score_codex":0.0006423551,"about_ca_system_score_gemma":0.0008423874,"threshold_uncertainty_score":0.0142918825},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04267592,0.00017518678,0.9455155,0.00019814665,0.00009829956,0.00015805705,0.00021705423,0.0012987434,0.009663024],"genre_scores_gemma":[0.2093336,0.00018538567,0.7847786,0.00004865245,0.00002292363,0.00009971027,0.00040809377,0.0003689303,0.004754129],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990784,0.0002119986,0.00003887379,0.00017991589,0.00035872354,0.00013210124],"domain_scores_gemma":[0.99926,0.00026293795,0.0000735343,0.00016702629,0.00017763702,0.00005891676],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069154747,0.0010467761,0.0009100019,0.0011976492,0.0008940085,0.0014300621,0.0016754902,0.0012438281,0.005747303],"category_scores_gemma":[0.0029244868,0.0007885428,0.00069626054,0.0012071622,0.00072059047,0.0012550069,0.0023742984,0.0009655158,0.0026752406],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016583893,0.0003051557,0.0075222263,0.0006068231,0.000118339936,0.0019071233,0.0010089932,0.384606,0.107166044,0.11209474,0.018973732,0.36403242],"study_design_scores_gemma":[0.00007502958,0.00020952955,0.0010731412,0.000056457557,0.000030168037,0.0005600279,0.0003609855,0.92960286,0.037173443,0.01525117,0.015562513,0.000044645807],"about_ca_topic_score_codex":0.0028448852,"about_ca_topic_score_gemma":0.0032614665,"teacher_disagreement_score":0.005747303,"about_ca_system_score_codex":0.0006740264,"about_ca_system_score_gemma":0.00096425036,"threshold_uncertainty_score":0.01922661},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018271053,0.00007735447,0.9699743,0.0002280134,0.00010828978,0.00018014704,0.00029106898,0.00088863604,0.009981199],"genre_scores_gemma":[0.1370415,0.00018665502,0.85279757,0.00013797655,0.000067458604,0.00023760382,0.00063566194,0.0003713902,0.008524088],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99936336,0.00013754658,0.00003515741,0.00015497183,0.00022381524,0.00008508406],"domain_scores_gemma":[0.9991411,0.00022655044,0.000057091675,0.00024253334,0.00024090885,0.000091839465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006151147,0.0007910965,0.00088358496,0.0016046758,0.001535861,0.0014403565,0.0024279463,0.0013734846,0.015627488],"category_scores_gemma":[0.0034333854,0.0005637551,0.000858577,0.0019341736,0.0008353931,0.0018744486,0.0027261064,0.0017167071,0.003124927],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038882878,0.00033374128,0.001048011,0.00037328908,0.00003537172,0.00017840728,0.00036900066,0.12072556,0.012366914,0.1739746,0.025783645,0.66442275],"study_design_scores_gemma":[0.000102593884,0.00019296401,0.00064097403,0.00009181787,0.000049165126,0.00024980522,0.0002615831,0.6729781,0.009506087,0.29065728,0.025227016,0.000042537955],"about_ca_topic_score_codex":0.0024202506,"about_ca_topic_score_gemma":0.0026481596,"teacher_disagreement_score":0.015627488,"about_ca_system_score_codex":0.0007230606,"about_ca_system_score_gemma":0.0009155436,"threshold_uncertainty_score":0.052279115},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6759723,0.0006492022,0.2538225,0.0012063563,0.00023866627,0.00010660936,0.00058882916,0.00030016515,0.06711536],"genre_scores_gemma":[0.95818007,0.0004990901,0.031129975,0.00020496883,0.00009508719,0.000051168463,0.00051840174,0.00014314371,0.009178088],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99963546,0.00006998246,0.000016512688,0.00008118936,0.00011497372,0.000081778395],"domain_scores_gemma":[0.9983846,0.00078919117,0.00027659658,0.00019476483,0.000164656,0.00019023316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027064554,0.00037006612,0.0006310564,0.0011052934,0.00090379635,0.0019797657,0.0008586535,0.00079003605,0.0070808353],"category_scores_gemma":[0.0029572716,0.00048469013,0.00043346098,0.0009958213,0.001834727,0.002450629,0.0013899932,0.0010605272,0.0005759979],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014718244,0.000049071597,0.0010055634,0.00017577168,0.000029622774,0.00032306433,0.0006278361,0.01133836,0.005846788,0.94078624,0.004150547,0.03551985],"study_design_scores_gemma":[0.000048092377,0.00003179761,0.0008013428,0.000025411342,0.000019243398,0.00022475029,0.00029508685,0.0256917,0.0019721352,0.9649186,0.0059574456,0.000014412433],"about_ca_topic_score_codex":0.0010600424,"about_ca_topic_score_gemma":0.0010111227,"teacher_disagreement_score":0.0070808353,"about_ca_system_score_codex":0.00059250573,"about_ca_system_score_gemma":0.00045408192,"threshold_uncertainty_score":0.02368772},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033082403,0.0011037737,0.9567497,0.00030711255,0.00010873408,0.000049841707,0.00007139256,0.00012531207,0.008401713],"genre_scores_gemma":[0.6875702,0.0034804537,0.2928577,0.00033181912,0.00060092495,0.00023408693,0.0004143129,0.000967855,0.013542655],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99863976,0.00041649546,0.00006434385,0.00016414752,0.00061093515,0.00010438331],"domain_scores_gemma":[0.99072766,0.0058329497,0.00076767465,0.00066447473,0.001459619,0.0005476044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027570205,0.0010908814,0.0010650981,0.003723852,0.00090989395,0.0031246566,0.0019376599,0.0014727316,0.0034466737],"category_scores_gemma":[0.017778242,0.00092715526,0.0013374335,0.002178926,0.002196722,0.0032466515,0.0024658004,0.0022375325,0.00057809666],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056118188,0.000047272246,0.000981539,0.00012595719,0.00003746146,0.000096010874,0.00022159789,0.08532407,0.0041801906,0.8659844,0.0019824335,0.04096297],"study_design_scores_gemma":[0.000005761128,0.000037353246,0.0005609101,0.000040970244,0.000019227107,0.00013733664,0.00006564013,0.6889079,0.0011019765,0.30625468,0.0028387383,0.000029517869],"about_ca_topic_score_codex":0.0014516957,"about_ca_topic_score_gemma":0.0011611698,"teacher_disagreement_score":0.003723852,"about_ca_system_score_codex":0.0015150714,"about_ca_system_score_gemma":0.00076088234,"threshold_uncertainty_score":0.014580727},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17136177,0.0006305744,0.8007366,0.0010930495,0.0004354714,0.00009786177,0.00017185156,0.00032312484,0.025149718],"genre_scores_gemma":[0.7684058,0.00097069505,0.1823636,0.00025704943,0.0003361952,0.00012575205,0.0003154684,0.00039631518,0.046829037],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99929595,0.00015141601,0.000035222994,0.00015168544,0.00028664657,0.00007907296],"domain_scores_gemma":[0.99819654,0.00068741676,0.00023894431,0.00019893653,0.000398963,0.00027918056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008620958,0.0007240143,0.00085291895,0.002278874,0.0010926136,0.0021492857,0.0014925665,0.002562764,0.007622844],"category_scores_gemma":[0.005565466,0.0004445136,0.0007018921,0.001125005,0.0021390296,0.00340686,0.0030063016,0.002198422,0.0012199914],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010126172,0.000047890437,0.0005299565,0.00008813702,0.00001979507,0.00012677624,0.00025024664,0.03857456,0.003939448,0.9172199,0.002180677,0.03692144],"study_design_scores_gemma":[0.000032525837,0.00017315289,0.00031002413,0.00004496059,0.000012512425,0.00021149481,0.00013729378,0.31088692,0.0021852097,0.6745035,0.011451934,0.000050507657],"about_ca_topic_score_codex":0.00175887,"about_ca_topic_score_gemma":0.0009673486,"teacher_disagreement_score":0.007622844,"about_ca_system_score_codex":0.0012980872,"about_ca_system_score_gemma":0.0006491471,"threshold_uncertainty_score":0.025500953},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48191878,0.0014904434,0.45513126,0.0026137438,0.00019940457,0.0000758119,0.0002177588,0.00050780154,0.057844862],"genre_scores_gemma":[0.9702509,0.0004922136,0.022033606,0.00019183704,0.00019684178,0.00005770131,0.00007812974,0.00009780703,0.006600892],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993826,0.00022492131,0.000019757497,0.00007125276,0.00018069953,0.00012070832],"domain_scores_gemma":[0.9986583,0.0005242969,0.00023371144,0.00023741992,0.00013684618,0.00020946321],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011774214,0.00060073927,0.00062644965,0.0013323595,0.00073426706,0.0018263924,0.0010856496,0.0014252226,0.0035913428],"category_scores_gemma":[0.0034537239,0.00026531957,0.0008483709,0.0006125482,0.0027715876,0.0038380711,0.0011175291,0.0010481381,0.00033835456],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007867446,0.000011054638,0.00014381828,0.00001156913,0.000002460803,0.00005000112,0.00005205704,0.007224868,0.00055178313,0.99072415,0.00024195672,0.0009783584],"study_design_scores_gemma":[0.000007742781,0.000020999805,0.00022597362,0.0000079938,0.0000034216926,0.000101414735,0.00006171927,0.18000278,0.00045344813,0.81833106,0.00077152223,0.000011823086],"about_ca_topic_score_codex":0.0010932565,"about_ca_topic_score_gemma":0.0007611216,"teacher_disagreement_score":0.0035913428,"about_ca_system_score_codex":0.0010592318,"about_ca_system_score_gemma":0.00049805094,"threshold_uncertainty_score":0.01201421},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06260448,0.000055516604,0.9292585,0.000052542666,0.00006083169,0.000057559802,0.000081381455,0.00067722035,0.0071519385],"genre_scores_gemma":[0.39895332,0.000072798095,0.5944596,0.000060855084,0.000017276312,0.000077531164,0.00023038335,0.00041567377,0.0057125473],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996586,0.000047520894,0.000015953554,0.000070526316,0.00014200437,0.00006540813],"domain_scores_gemma":[0.9995055,0.00009833133,0.000031403175,0.00020098234,0.00011685646,0.00004685083],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004149195,0.0004579611,0.0006502709,0.00064791925,0.00051601033,0.00073440844,0.0010495275,0.0006415567,0.007963935],"category_scores_gemma":[0.0013968213,0.00047073598,0.0004904428,0.00053215347,0.000683521,0.001064919,0.0019875292,0.0011247221,0.0013411726],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00068380847,0.0005158655,0.0026414995,0.00026440236,0.000053362914,0.00031284304,0.00053328497,0.23786919,0.08978898,0.20829609,0.0068736165,0.45216712],"study_design_scores_gemma":[0.000050068036,0.00020126374,0.0007438984,0.00004368703,0.000027021737,0.0002705525,0.00018751241,0.8704261,0.033350598,0.08257673,0.012096902,0.000025675863],"about_ca_topic_score_codex":0.0005527044,"about_ca_topic_score_gemma":0.00101374,"teacher_disagreement_score":0.007963935,"about_ca_system_score_codex":0.00023438242,"about_ca_system_score_gemma":0.0003356836,"threshold_uncertainty_score":0.026641965},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11216059,0.0005662036,0.82837564,0.00055619224,0.00017549089,0.00029801403,0.0018476403,0.0016410418,0.05437927],"genre_scores_gemma":[0.47895828,0.0016752336,0.48147932,0.00022823612,0.00008553461,0.00028002716,0.0042934758,0.000850107,0.032149777],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996531,0.000095531665,0.000015302363,0.00007637898,0.00012005173,0.000039674807],"domain_scores_gemma":[0.9992779,0.00023648424,0.000098336786,0.00015664588,0.00013930858,0.000091369075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016028564,0.0010977685,0.00052212976,0.0011092172,0.00066433457,0.0013566583,0.0011892744,0.001031533,0.0138339335],"category_scores_gemma":[0.0020445911,0.0008767992,0.00053808664,0.0015542278,0.0006426625,0.0012139896,0.0009909548,0.001669816,0.0026420837],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027016312,0.00015851035,0.0018921958,0.00064437534,0.00008018271,0.0013459356,0.00083134,0.14904091,0.039315928,0.52560955,0.033762593,0.24704832],"study_design_scores_gemma":[0.0001425889,0.0001720733,0.0024843968,0.00018225088,0.00009968113,0.0013932503,0.0006045479,0.25607243,0.01752048,0.6164549,0.10478305,0.00009032456],"about_ca_topic_score_codex":0.001488573,"about_ca_topic_score_gemma":0.003468679,"teacher_disagreement_score":0.0138339335,"about_ca_system_score_codex":0.0004627776,"about_ca_system_score_gemma":0.00033665853,"threshold_uncertainty_score":0.046279132},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5066612,0.0006981292,0.2447109,0.007395659,0.00094292255,0.0002946529,0.0011414076,0.0011916425,0.23696347],"genre_scores_gemma":[0.96373403,0.0002609691,0.018697152,0.00069917255,0.00040871577,0.00018697458,0.0011451904,0.00027042945,0.0145972865],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99635184,0.00055659283,0.00035810468,0.0009907669,0.00087834825,0.00086435804],"domain_scores_gemma":[0.960455,0.02323337,0.0024617687,0.0065122563,0.0050872616,0.0022503738],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039932756,0.0005951708,0.0014563015,0.001809402,0.0030475305,0.0032519225,0.0024463825,0.0034014308,0.021057075],"category_scores_gemma":[0.032085154,0.0010026514,0.0019331282,0.0012019067,0.004918572,0.01161699,0.0076610735,0.006077177,0.003186004],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006170701,0.00028740714,0.00662445,0.00015224215,0.000044371165,0.0008270339,0.0009978701,0.003197676,0.004370903,0.96602464,0.005060899,0.011795318],"study_design_scores_gemma":[0.00011619561,0.0002424782,0.0020010166,0.000096731375,0.000047550933,0.001158899,0.000717689,0.022254936,0.008641108,0.95138586,0.01328633,0.00005119362],"about_ca_topic_score_codex":0.0004410843,"about_ca_topic_score_gemma":0.00042144413,"teacher_disagreement_score":0.021057075,"about_ca_system_score_codex":0.00068009435,"about_ca_system_score_gemma":0.0009917879,"threshold_uncertainty_score":0.070442915},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17299935,0.00080060714,0.77855885,0.0011764662,0.00021518375,0.00026887198,0.0011715487,0.0005331729,0.044275917],"genre_scores_gemma":[0.50800526,0.0008558243,0.45843682,0.0002940261,0.00016516067,0.00039599926,0.0023666152,0.00075716263,0.02872309],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993073,0.00019221373,0.000035783476,0.00013191205,0.00023149014,0.00010140493],"domain_scores_gemma":[0.9986463,0.0006573996,0.000120691184,0.00026783408,0.00018499479,0.00012271017],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006656849,0.0012944444,0.0013746893,0.0013663151,0.0010619634,0.0023088183,0.0016704887,0.0016327385,0.013942278],"category_scores_gemma":[0.005082081,0.0010916002,0.0009678712,0.0016724373,0.0008542561,0.0030683898,0.0029025588,0.0023184349,0.0017608075],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001052933,0.00026698568,0.0013042499,0.00065360893,0.00015730703,0.00041682553,0.00045341597,0.23398826,0.017036187,0.47575316,0.026644142,0.24227297],"study_design_scores_gemma":[0.000111802154,0.00017615488,0.0008163283,0.00009259731,0.00008401879,0.00040028006,0.00023786671,0.48292437,0.0071043214,0.49764407,0.010383475,0.000024760113],"about_ca_topic_score_codex":0.00043403057,"about_ca_topic_score_gemma":0.0009686766,"teacher_disagreement_score":0.013942278,"about_ca_system_score_codex":0.00081399234,"about_ca_system_score_gemma":0.00060465955,"threshold_uncertainty_score":0.04664153},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32630238,0.010854557,0.23777147,0.18166882,0.0029717477,0.000051642877,0.00080018106,0.0012158199,0.23836343],"genre_scores_gemma":[0.9430269,0.0038522684,0.020921765,0.007303485,0.0029492965,0.000073568684,0.00033550226,0.0003902666,0.021146968],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980793,0.0006589559,0.000065748165,0.00044922277,0.00049180194,0.0002549732],"domain_scores_gemma":[0.9885998,0.008778317,0.00050231646,0.00086285226,0.0007472173,0.0005096495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022794944,0.0005263516,0.0016009558,0.0016366115,0.003400915,0.005220217,0.0014950709,0.0036932603,0.009299529],"category_scores_gemma":[0.025273263,0.0005803248,0.0009239611,0.0024261673,0.010998352,0.01439741,0.0050918525,0.0069157975,0.0018093867],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000098057826,0.000018348472,0.00045215542,0.000053576012,0.000007879216,0.00006876416,0.00043640044,0.0011739333,0.00036934006,0.9794448,0.008888864,0.008987889],"study_design_scores_gemma":[0.00001528434,0.000013345332,0.0001743594,0.00001763951,0.000004076883,0.00008892541,0.00022441098,0.0009263788,0.00020156185,0.989546,0.008778176,0.0000098818255],"about_ca_topic_score_codex":0.0018155678,"about_ca_topic_score_gemma":0.00071491493,"teacher_disagreement_score":0.009299529,"about_ca_system_score_codex":0.0023251306,"about_ca_system_score_gemma":0.0008332442,"threshold_uncertainty_score":0.031109989},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37216672,0.00044649676,0.60203224,0.000563829,0.0002797421,0.00026007922,0.00030334952,0.0010748069,0.02287266],"genre_scores_gemma":[0.72930765,0.00048386463,0.2606551,0.000082202285,0.00006276301,0.00018809114,0.00037521828,0.00024080269,0.008604327],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99941945,0.000115068215,0.00004691936,0.00012262436,0.00016756335,0.000128477],"domain_scores_gemma":[0.9991302,0.00033437202,0.00010153722,0.00024742764,0.000053232277,0.0001332939],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028259607,0.0008710166,0.0014018974,0.0011572085,0.0014148989,0.0018563722,0.0017457919,0.0014364887,0.0066378764],"category_scores_gemma":[0.0019259023,0.00096992566,0.0006802194,0.0023496724,0.0010189571,0.0021325275,0.005218989,0.0011128352,0.0015313639],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0023385782,0.0007375616,0.0029772616,0.0005159406,0.00013817384,0.0041063842,0.0010458131,0.6999426,0.04243101,0.080906555,0.006567527,0.15829262],"study_design_scores_gemma":[0.0002668763,0.00058391073,0.0006152907,0.000056060642,0.00006299467,0.000660352,0.0006354369,0.8968417,0.017308556,0.07043804,0.012480206,0.000050678842],"about_ca_topic_score_codex":0.0009321163,"about_ca_topic_score_gemma":0.0007930933,"teacher_disagreement_score":0.0066378764,"about_ca_system_score_codex":0.00036032993,"about_ca_system_score_gemma":0.00037127818,"threshold_uncertainty_score":0.02220589},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3307382,0.0033972356,0.61466444,0.0015464637,0.00017653685,0.00038315429,0.005286669,0.011587859,0.032219324],"genre_scores_gemma":[0.6908139,0.00065701385,0.29190317,0.00029008306,0.00006404997,0.0002262332,0.005530969,0.00051185326,0.010002776],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992155,0.00012898169,0.000058930487,0.0002195794,0.00017474304,0.00020221774],"domain_scores_gemma":[0.99918133,0.0002962337,0.00010711912,0.00026053752,0.0000950569,0.000059701564],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029672586,0.000573428,0.00081218896,0.00068246387,0.00047156576,0.0012578568,0.0014910628,0.0008124939,0.010038261],"category_scores_gemma":[0.001977056,0.00030067138,0.0004475193,0.0023482386,0.00058085384,0.0027548152,0.0017180494,0.00047380416,0.0026006151],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.003855182,0.000599046,0.008001187,0.0011098811,0.000140536,0.0008655187,0.0006229313,0.30125666,0.062225476,0.037623607,0.06841187,0.5152882],"study_design_scores_gemma":[0.0002833499,0.0005389691,0.0017294842,0.0000560549,0.000046310197,0.00045478647,0.00045206325,0.91454834,0.03384455,0.032009423,0.01598111,0.000055513436],"about_ca_topic_score_codex":0.0040080464,"about_ca_topic_score_gemma":0.0043823887,"teacher_disagreement_score":0.010038261,"about_ca_system_score_codex":0.00057807023,"about_ca_system_score_gemma":0.0010448397,"threshold_uncertainty_score":0.033581316},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003187373,0.00017500186,0.99321294,0.00020583734,0.00012047424,0.000026549538,0.00027867776,0.0002383232,0.0025547484],"genre_scores_gemma":[0.17240988,0.0013362974,0.8051516,0.00033081122,0.0005132182,0.00022651257,0.0021215524,0.0007217382,0.017188367],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99892396,0.00025591697,0.000084716456,0.0001963211,0.0004482225,0.000090874055],"domain_scores_gemma":[0.9976217,0.0007016286,0.00014813119,0.00090910087,0.00049623766,0.0001231292],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010830449,0.00065461145,0.0012147584,0.0018627979,0.0007311755,0.0021270278,0.002523872,0.0015278553,0.013814872],"category_scores_gemma":[0.008416328,0.00074211176,0.0007862269,0.0027072204,0.0011726164,0.0042149834,0.0033737463,0.002413317,0.0037246656],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015153912,0.000086546774,0.00056853466,0.00019503832,0.000031961474,0.00018305062,0.000120182944,0.09141524,0.0042415187,0.5753895,0.01886788,0.308749],"study_design_scores_gemma":[0.000025928013,0.00004465656,0.00012872079,0.00003576411,0.000012802706,0.0002006054,0.000033747623,0.717536,0.002008922,0.2603055,0.019643035,0.000024370125],"about_ca_topic_score_codex":0.001397307,"about_ca_topic_score_gemma":0.0018202887,"teacher_disagreement_score":0.013814872,"about_ca_system_score_codex":0.0006319607,"about_ca_system_score_gemma":0.000919548,"threshold_uncertainty_score":0.046215355},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8212174,0.0010960733,0.16137648,0.0005282932,0.000048633985,0.000054086922,0.0002051672,0.00008352225,0.0153903775],"genre_scores_gemma":[0.96321857,0.00050058943,0.03409317,0.0000688089,0.000035791774,0.000035943962,0.00015514092,0.000030497793,0.0018615472],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990252,0.00040012598,0.000069686874,0.0001548194,0.00021933836,0.00013078694],"domain_scores_gemma":[0.9983224,0.0009023271,0.00028604415,0.00020093271,0.00013780355,0.00015033415],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010662869,0.00036534734,0.0005519013,0.0009982898,0.00062972377,0.0013639845,0.0007016289,0.0007420276,0.0020255647],"category_scores_gemma":[0.0051343767,0.0003391545,0.00037927786,0.00083516585,0.0015615871,0.002196955,0.0014891855,0.00056596304,0.00021932095],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027241473,0.000031048392,0.0029581396,0.0002779787,0.000034915036,0.00054753467,0.0006144862,0.11317787,0.010491222,0.8336254,0.001574268,0.036394738],"study_design_scores_gemma":[0.00006752697,0.00014710448,0.0036965997,0.000118200864,0.000034439443,0.0011618044,0.0009581756,0.37317288,0.013200912,0.5931917,0.014203732,0.000046916095],"about_ca_topic_score_codex":0.0010596788,"about_ca_topic_score_gemma":0.00049329316,"teacher_disagreement_score":0.0020255647,"about_ca_system_score_codex":0.0009042778,"about_ca_system_score_gemma":0.00024942556,"threshold_uncertainty_score":0.0067762136},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10290884,0.00037413934,0.88060474,0.00039354106,0.00007640988,0.00024330438,0.0006156068,0.0018869158,0.012896568],"genre_scores_gemma":[0.47637504,0.00027001314,0.5122521,0.00021497802,0.000023670224,0.00018288394,0.0021991874,0.00055163214,0.007930412],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996275,0.00006206874,0.000019278456,0.00009868568,0.00012851243,0.00006404402],"domain_scores_gemma":[0.99954396,0.000085953325,0.000035983194,0.00017120386,0.0001126126,0.000050219587],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002704766,0.00038267914,0.00041749622,0.00078753126,0.0005792017,0.0008516569,0.001017789,0.00046455231,0.0052703535],"category_scores_gemma":[0.001114856,0.000332991,0.00042700127,0.0008813555,0.0006144488,0.0011470928,0.0021367692,0.00050546526,0.0009035716],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038767883,0.00011520009,0.0033377404,0.00032040913,0.00006417625,0.00040119115,0.00066315144,0.2721666,0.022486906,0.18426743,0.041166075,0.47462347],"study_design_scores_gemma":[0.00007063215,0.000076738,0.0009946676,0.000049642254,0.000023116174,0.0003001978,0.00038961237,0.81249845,0.0124527775,0.13186015,0.041255992,0.000027906359],"about_ca_topic_score_codex":0.004567169,"about_ca_topic_score_gemma":0.0071250875,"teacher_disagreement_score":0.0052703535,"about_ca_system_score_codex":0.000695422,"about_ca_system_score_gemma":0.00071794767,"threshold_uncertainty_score":0.017631114},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13237433,0.00049091724,0.81790143,0.0012767155,0.0003553582,0.0001211441,0.00027130812,0.00062291545,0.046585806],"genre_scores_gemma":[0.71750283,0.0010985457,0.23552072,0.00052496494,0.00027814019,0.00026197618,0.0003327947,0.00035479027,0.0441253],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995546,0.000110393536,0.000017409418,0.000099310455,0.00013761934,0.00008066772],"domain_scores_gemma":[0.9986625,0.00051279395,0.00016391552,0.00025105505,0.00022338584,0.00018634902],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005826509,0.0005090718,0.0006878298,0.0011757873,0.0008491033,0.0016960972,0.001055393,0.0010279381,0.008426369],"category_scores_gemma":[0.0036260034,0.00051966036,0.00038047894,0.00089154294,0.0012295821,0.0029207477,0.0030200994,0.0014789454,0.0011240115],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028607546,0.00007788584,0.0005509455,0.000112099464,0.000026001206,0.00012062803,0.00014618783,0.07102289,0.008394357,0.82240164,0.007032588,0.08982883],"study_design_scores_gemma":[0.000054662596,0.00007077132,0.00032461068,0.000026581974,0.000020755953,0.00017328156,0.000108432374,0.51008767,0.0042472617,0.47302866,0.011832129,0.000025183634],"about_ca_topic_score_codex":0.0010339061,"about_ca_topic_score_gemma":0.0013597771,"teacher_disagreement_score":0.008426369,"about_ca_system_score_codex":0.0009937808,"about_ca_system_score_gemma":0.00052039843,"threshold_uncertainty_score":0.028189003},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02362939,0.00050598086,0.93820477,0.0003236588,0.00015029946,0.00018618467,0.000514754,0.0011328219,0.035352178],"genre_scores_gemma":[0.36821207,0.001039523,0.5902662,0.00024126188,0.00016019991,0.00036333918,0.0022988154,0.0008531989,0.03656532],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981173,0.0003658653,0.00007522014,0.00041206094,0.0008967925,0.00013281316],"domain_scores_gemma":[0.9980939,0.00059198326,0.000114944865,0.00073273893,0.00037271663,0.000093700364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059236406,0.0011381768,0.0013175406,0.0022851904,0.0009576689,0.0031705075,0.0016609068,0.0021015622,0.031604353],"category_scores_gemma":[0.008100076,0.0009655751,0.0010311464,0.002665789,0.0008447805,0.0038244363,0.0034533923,0.0025351958,0.0070211347],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004956056,0.00019511505,0.0011968889,0.00038079676,0.00006966748,0.00043445366,0.00038214936,0.13472402,0.011204676,0.3400855,0.02424207,0.486589],"study_design_scores_gemma":[0.000086723914,0.0001930476,0.0006109845,0.00010039217,0.000051301526,0.00090877595,0.00030167817,0.62397027,0.012720599,0.2930015,0.06801589,0.00003891501],"about_ca_topic_score_codex":0.0010105844,"about_ca_topic_score_gemma":0.0016184733,"teacher_disagreement_score":0.031604353,"about_ca_system_score_codex":0.00088692864,"about_ca_system_score_gemma":0.0005626297,"threshold_uncertainty_score":0.10572708},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014302247,0.00014952639,0.9830434,0.00005910599,0.00003419644,0.0000969825,0.00015416168,0.0010953516,0.0010649661],"genre_scores_gemma":[0.20648429,0.000327324,0.7884975,0.00007090763,0.00006144315,0.00014233563,0.0010715583,0.00092081,0.002423865],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99870133,0.00020047429,0.000043170436,0.00020351927,0.00070870575,0.00014272782],"domain_scores_gemma":[0.9982942,0.00066291663,0.00011034037,0.0002941885,0.00049191806,0.00014645269],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078511884,0.0013549603,0.0023009793,0.002084225,0.0005440045,0.0018113633,0.001828251,0.0015402114,0.007183524],"category_scores_gemma":[0.0044846493,0.0011635261,0.0013062386,0.0017191545,0.0005600727,0.0012552064,0.0023125305,0.0020316744,0.0033504567],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000823548,0.00016547478,0.0018738164,0.00046363252,0.00012962167,0.00056713255,0.00042978808,0.12872933,0.10326858,0.014896083,0.014694192,0.73395884],"study_design_scores_gemma":[0.00003743382,0.000079727855,0.00039919512,0.000026755783,0.000014252315,0.00019894485,0.00008953168,0.9697409,0.020897696,0.005610877,0.0028834927,0.000021077782],"about_ca_topic_score_codex":0.0018138316,"about_ca_topic_score_gemma":0.0032388065,"teacher_disagreement_score":0.007183524,"about_ca_system_score_codex":0.00047835786,"about_ca_system_score_gemma":0.00063504477,"threshold_uncertainty_score":0.024031281},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015859563,0.13556872,0.47052357,0.021982493,0.021927113,0.00010317253,0.00078831194,0.00082249765,0.3324246],"genre_scores_gemma":[0.31338662,0.1532912,0.2448141,0.0036772145,0.021900557,0.00021818276,0.0012507979,0.00091813353,0.2605432],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99923563,0.00015940775,0.00003989198,0.0001580371,0.00035522017,0.000051808514],"domain_scores_gemma":[0.9988675,0.00039492577,0.000040200775,0.00030263912,0.00027842054,0.00011627467],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010384322,0.0008335968,0.0012255528,0.0023106346,0.00086707005,0.0025590628,0.0010372541,0.0010387815,0.014348988],"category_scores_gemma":[0.002429521,0.0004571298,0.00070860767,0.0025096785,0.0024064826,0.0029053534,0.0024976055,0.003550484,0.0053029456],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001632632,0.000022548806,0.00013722747,0.00019018073,0.00001377097,0.000025582622,0.000098213655,0.0023445182,0.00088293466,0.8854726,0.022439316,0.0883568],"study_design_scores_gemma":[0.000014676246,0.000028198996,0.00040338244,0.0001131142,0.000016078126,0.00016128182,0.000061511615,0.0122242095,0.0011468296,0.54342145,0.44239357,0.00001573497],"about_ca_topic_score_codex":0.00107272,"about_ca_topic_score_gemma":0.0009830296,"teacher_disagreement_score":0.014348988,"about_ca_system_score_codex":0.0018365487,"about_ca_system_score_gemma":0.0011977599,"threshold_uncertainty_score":0.048002124},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028452033,0.00013958766,0.9520887,0.00016946126,0.00009250955,0.0001526335,0.00036341752,0.00042091165,0.018120795],"genre_scores_gemma":[0.30709153,0.00026080463,0.679221,0.000100455014,0.000052411087,0.00031802943,0.0009808083,0.00047325122,0.011501759],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99944776,0.000096298325,0.00003481952,0.00012556149,0.0002398737,0.000055700784],"domain_scores_gemma":[0.99943095,0.00018709686,0.00005637846,0.00014750878,0.00013666046,0.00004140667],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000375464,0.0008531518,0.0010051673,0.0006863464,0.00043923163,0.0007325571,0.0017538345,0.0012221995,0.010075989],"category_scores_gemma":[0.0029886346,0.00054349634,0.0005538424,0.0008252465,0.00049586693,0.001110204,0.0019138942,0.0012176196,0.0024773073],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010518917,0.00025954333,0.0023908706,0.0009582526,0.00009178587,0.00074548443,0.000533829,0.326926,0.07901501,0.15576656,0.017639281,0.41462144],"study_design_scores_gemma":[0.0002082614,0.00041135872,0.0007555863,0.00010215895,0.00004724946,0.000807514,0.00022853175,0.8708653,0.026477536,0.06690214,0.033153255,0.000041160733],"about_ca_topic_score_codex":0.00072655367,"about_ca_topic_score_gemma":0.0010307692,"teacher_disagreement_score":0.010075989,"about_ca_system_score_codex":0.00031892527,"about_ca_system_score_gemma":0.00047452733,"threshold_uncertainty_score":0.03370756},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88537997,0.0007220593,0.03426417,0.0006475366,0.00022845212,0.00005535653,0.00038767233,0.0002093839,0.078105405],"genre_scores_gemma":[0.97461355,0.00034203826,0.013719134,0.00014029615,0.00007573478,0.000044051932,0.00039144338,0.0000880305,0.010585823],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99954516,0.000071546885,0.000031590418,0.00010799333,0.00012505935,0.00011861912],"domain_scores_gemma":[0.99799085,0.0008595689,0.0005052429,0.00013970127,0.00020269002,0.00030193554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043491626,0.00041606254,0.00041111672,0.0022939467,0.0016410274,0.0029054377,0.0007860474,0.0010311415,0.012656896],"category_scores_gemma":[0.0027295647,0.00033395368,0.0003436954,0.0020644502,0.0020052132,0.0017405412,0.0010588972,0.0012888531,0.0009898536],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002242635,0.00007274544,0.0035415618,0.00009512691,0.000019356527,0.0003037855,0.00050002453,0.01202005,0.004565369,0.9349685,0.005422743,0.038266517],"study_design_scores_gemma":[0.00004548682,0.0000886824,0.004367062,0.00005467171,0.000036008165,0.00064574974,0.00058717484,0.03277529,0.004575636,0.9395161,0.017247636,0.000060356982],"about_ca_topic_score_codex":0.0023865574,"about_ca_topic_score_gemma":0.0026934864,"teacher_disagreement_score":0.012656896,"about_ca_system_score_codex":0.0010136527,"about_ca_system_score_gemma":0.00057788513,"threshold_uncertainty_score":0.04234153},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004737469,0.013143105,0.008244927,0.006477421,0.0061236112,0.0005949874,0.016416095,0.00485675,0.9394057],"genre_scores_gemma":[0.034552854,0.012831619,0.004694144,0.0021828203,0.00093445624,0.0005540033,0.017646296,0.0018051564,0.9247987],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99901056,0.00013873113,0.000043231274,0.00028616574,0.00039386834,0.00012740705],"domain_scores_gemma":[0.9990414,0.00015616139,0.000059594062,0.0002053159,0.00021783306,0.0003197157],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008319455,0.0013267038,0.0019258498,0.001790137,0.0011052355,0.0033882307,0.0020707261,0.0023124635,0.7640969],"category_scores_gemma":[0.0026091745,0.00079267245,0.0007088434,0.0013025898,0.00097279606,0.0016278449,0.0033670126,0.0024889898,0.6266606],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0028714468,0.0004930442,0.00056967855,0.0034600983,0.00011771847,0.0009707922,0.00016062272,0.00058298075,0.016922556,0.012822678,0.54665613,0.4143722],"study_design_scores_gemma":[0.00015227735,0.00016426525,0.00035898408,0.00020599924,0.000027474789,0.00034544177,0.00002953552,0.00014959562,0.0026544237,0.0014041285,0.99449676,0.000011215401],"about_ca_topic_score_codex":0.00095284067,"about_ca_topic_score_gemma":0.0008121743,"teacher_disagreement_score":0.7640969,"about_ca_system_score_codex":0.0006839145,"about_ca_system_score_gemma":0.0013785812,"threshold_uncertainty_score":0},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15151197,0.006389629,0.7544766,0.013132584,0.0018402174,0.00019933123,0.00037363847,0.0005129099,0.07156315],"genre_scores_gemma":[0.53171325,0.008449457,0.373906,0.0020712435,0.0015594354,0.00019574285,0.00093818497,0.0010207159,0.08014599],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986811,0.00048348375,0.00007899877,0.0003211685,0.00024637385,0.00018887238],"domain_scores_gemma":[0.9964318,0.0024273184,0.00013389465,0.000554035,0.00023416044,0.00021879317],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020272252,0.00093592564,0.0022330775,0.0011674878,0.0027750072,0.0034541094,0.0028003065,0.0040691597,0.010920148],"category_scores_gemma":[0.0112456,0.0013388724,0.0021163386,0.0024277407,0.0031651633,0.008159748,0.0050607617,0.004329376,0.0019278857],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013772372,0.000049886214,0.0002972127,0.00015892861,0.000026370446,0.00024458682,0.00042043458,0.023567745,0.0014264984,0.9236798,0.010919021,0.039071888],"study_design_scores_gemma":[0.000046637968,0.000039866998,0.00018994321,0.000067510315,0.00002214569,0.00025772088,0.0004630118,0.06442342,0.0010499118,0.907519,0.0258846,0.000036311016],"about_ca_topic_score_codex":0.0022236302,"about_ca_topic_score_gemma":0.0012466689,"teacher_disagreement_score":0.010920148,"about_ca_system_score_codex":0.000990657,"about_ca_system_score_gemma":0.0007220329,"threshold_uncertainty_score":0.036531508},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31954375,0.00075726537,0.66599756,0.0012557206,0.000081625694,0.0001418248,0.00025578216,0.00073298893,0.011233409],"genre_scores_gemma":[0.8779949,0.00030517316,0.118213125,0.00016981216,0.000056203447,0.00013554057,0.0003270245,0.00037161872,0.002426517],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99790275,0.0010231842,0.00007357188,0.00023929421,0.00047271437,0.00028846037],"domain_scores_gemma":[0.9499377,0.043722346,0.0015667409,0.0020671468,0.0016665763,0.0010395257],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0056386804,0.0006342657,0.0012957471,0.00212906,0.0018268967,0.0018841139,0.0027657328,0.0018273628,0.005266295],"category_scores_gemma":[0.04214465,0.00094507687,0.0011993598,0.0018316103,0.003266968,0.0031896816,0.002239329,0.0016342758,0.00032798084],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005126331,0.00008979261,0.0020812105,0.0001704899,0.0000865467,0.00007255481,0.00025063404,0.79435796,0.0025241666,0.17819716,0.0022170264,0.019439913],"study_design_scores_gemma":[0.000031737363,0.000038341026,0.00028851337,0.000013550071,0.00001372391,0.000022319166,0.000025707168,0.9535628,0.0003746647,0.04541604,0.0002017974,0.000010872401],"about_ca_topic_score_codex":0.004640621,"about_ca_topic_score_gemma":0.004807466,"teacher_disagreement_score":0.0056386804,"about_ca_system_score_codex":0.002806561,"about_ca_system_score_gemma":0.0025057814,"threshold_uncertainty_score":0.029820502},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035475463,0.0016145591,0.8950151,0.00074401405,0.00038049146,0.00021815076,0.0032199589,0.007975995,0.055356298],"genre_scores_gemma":[0.32932273,0.0019936478,0.61792916,0.00035404688,0.00019028617,0.0004562304,0.010621184,0.0036087525,0.035524085],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984409,0.00021725206,0.00012198795,0.00026166422,0.0007627411,0.00019549712],"domain_scores_gemma":[0.99673456,0.0010489576,0.0002612048,0.0011490075,0.000710224,0.00009604185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009100452,0.000969788,0.0012217276,0.0011113585,0.0009335998,0.0015912979,0.00097149797,0.0011750102,0.03156899],"category_scores_gemma":[0.007968951,0.0007178105,0.0008632458,0.0018024002,0.0007689338,0.0022438157,0.0024896825,0.00085675664,0.014699531],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036763903,0.00007848476,0.0042341575,0.0013014423,0.00010529912,0.0004952203,0.0009253565,0.034185566,0.033070363,0.061827634,0.06215197,0.80125695],"study_design_scores_gemma":[0.00012059207,0.00023185748,0.0071089845,0.000514573,0.00008672785,0.0031278564,0.0014409043,0.14007686,0.08047251,0.1420641,0.6245839,0.00017106],"about_ca_topic_score_codex":0.0012033703,"about_ca_topic_score_gemma":0.00198771,"teacher_disagreement_score":0.03156899,"about_ca_system_score_codex":0.000379794,"about_ca_system_score_gemma":0.00049458677,"threshold_uncertainty_score":0.10560876},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017183876,0.00010408591,0.9932376,0.00013225451,0.0002651077,0.00007781421,0.000066621215,0.0008368869,0.0035612273],"genre_scores_gemma":[0.03496271,0.00018368795,0.94796365,0.0001883191,0.00014552174,0.00029801368,0.00021293001,0.0012093907,0.014835836],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992932,0.00009870238,0.000038799768,0.00007551941,0.0004546822,0.000039019404],"domain_scores_gemma":[0.9989126,0.00033613452,0.00005220713,0.00026847096,0.00032736556,0.000103289814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007006691,0.0008996041,0.0011409916,0.001179301,0.0010629654,0.0013876661,0.0021677362,0.0016793029,0.022204904],"category_scores_gemma":[0.0033161493,0.00056829554,0.0010689971,0.0010057976,0.0006577289,0.0018711184,0.0025565934,0.0024990777,0.006642544],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002832975,0.00031833714,0.0006763026,0.00070278684,0.00011695131,0.00039485304,0.0003379161,0.09320386,0.042681888,0.1690874,0.030989563,0.6612069],"study_design_scores_gemma":[0.00018866082,0.000107792475,0.00032941054,0.00006328815,0.000042722393,0.0005171454,0.00008761185,0.82606953,0.0111762015,0.08966512,0.071664914,0.00008753593],"about_ca_topic_score_codex":0.0018801687,"about_ca_topic_score_gemma":0.0033800595,"teacher_disagreement_score":0.022204904,"about_ca_system_score_codex":0.00042241527,"about_ca_system_score_gemma":0.0011804051,"threshold_uncertainty_score":0.074282825},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0042662374,0.0001597197,0.9660543,0.00021848112,0.00012479952,0.00014803869,0.0007515007,0.02448321,0.0037937118],"genre_scores_gemma":[0.077038206,0.0002763551,0.9016438,0.00023420471,0.0000932505,0.0006332745,0.003918695,0.0068183397,0.009343883],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986607,0.00018262972,0.00013373907,0.00021178873,0.0007228821,0.000088324494],"domain_scores_gemma":[0.9976687,0.00081299106,0.000095389216,0.0010387471,0.00027581945,0.0001083432],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010884398,0.0012972954,0.0011823429,0.001552572,0.0012808314,0.0021899743,0.0030882617,0.0017000904,0.018609531],"category_scores_gemma":[0.004997028,0.00095761043,0.0015123441,0.0016226813,0.0012782862,0.0029801938,0.0061996523,0.0019435495,0.0055838744],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010632867,0.00019317353,0.0023490752,0.0008428036,0.000099468794,0.0011607159,0.0022963423,0.024401888,0.07190497,0.14493634,0.07939951,0.67135245],"study_design_scores_gemma":[0.00026255686,0.00033236796,0.0010533088,0.00015839258,0.00005925006,0.001321909,0.0002269162,0.2575592,0.08777041,0.07244676,0.57861984,0.00018918261],"about_ca_topic_score_codex":0.0010734843,"about_ca_topic_score_gemma":0.0016236741,"teacher_disagreement_score":0.018609531,"about_ca_system_score_codex":0.0006992369,"about_ca_system_score_gemma":0.0006006477,"threshold_uncertainty_score":0.062255085},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003678198,0.000058449674,0.99251384,0.000038521586,0.00004039196,0.00004820712,0.00006906096,0.002738234,0.0008150639],"genre_scores_gemma":[0.050434306,0.00014649265,0.9447587,0.00007202226,0.000027831611,0.00014875417,0.00040216214,0.0016851855,0.0023245425],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993393,0.000070935144,0.000029769311,0.00010367903,0.00040349888,0.000052754363],"domain_scores_gemma":[0.99926895,0.00023634707,0.000044994893,0.00022669355,0.00017670341,0.000046380344],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063850614,0.0011554599,0.0013126376,0.0017647679,0.0008056117,0.0012654949,0.0031014597,0.0016223475,0.0102788275],"category_scores_gemma":[0.0026959057,0.0010051515,0.0011266946,0.0017021626,0.00083781936,0.0018220474,0.003737756,0.0018464511,0.0030294778],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003158406,0.00008076729,0.0010356439,0.00029020171,0.00008717084,0.00025275926,0.00037151785,0.089432396,0.033410575,0.0202297,0.01689953,0.8375939],"study_design_scores_gemma":[0.000065777735,0.000085897416,0.0003592043,0.00003730842,0.00003473106,0.00024926243,0.00009428491,0.93984455,0.01902622,0.018422287,0.02173557,0.000044897475],"about_ca_topic_score_codex":0.0030046315,"about_ca_topic_score_gemma":0.004426566,"teacher_disagreement_score":0.0102788275,"about_ca_system_score_codex":0.00044006394,"about_ca_system_score_gemma":0.00081894465,"threshold_uncertainty_score":0.0343861},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33612183,0.0013793831,0.53861153,0.0007922117,0.00019305678,0.000120712226,0.00037812348,0.00057849917,0.121824704],"genre_scores_gemma":[0.8426364,0.0018820979,0.10117981,0.0005937233,0.0002532142,0.00027102002,0.0006703327,0.00033601592,0.052177407],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99960774,0.00007836124,0.000018915229,0.00010656253,0.00010682943,0.00008155082],"domain_scores_gemma":[0.99865615,0.0006736879,0.00018539134,0.00015365673,0.00013384742,0.00019732077],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005522633,0.0011398628,0.00096673396,0.0011649278,0.0013235512,0.0018480152,0.0012769081,0.0012388794,0.0073140874],"category_scores_gemma":[0.0026669162,0.0005952127,0.0008347748,0.0015782762,0.0016237485,0.0028744913,0.00243298,0.002053635,0.001126171],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004947852,0.000031971213,0.00026873683,0.00006065479,0.000016371741,0.00011477318,0.00016243833,0.010144929,0.0023130511,0.97056246,0.002069733,0.014205452],"study_design_scores_gemma":[0.000021373578,0.000060426275,0.0002225004,0.000029116034,0.00001690212,0.00026081243,0.00009401703,0.033204168,0.00072950305,0.9613697,0.0039771576,0.000014313214],"about_ca_topic_score_codex":0.0004207669,"about_ca_topic_score_gemma":0.0005420036,"teacher_disagreement_score":0.0073140874,"about_ca_system_score_codex":0.00058668345,"about_ca_system_score_gemma":0.0004160877,"threshold_uncertainty_score":0.024468064},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027281063,0.00077053317,0.96659106,0.00039875356,0.000055951274,0.00009732433,0.00018590243,0.000543995,0.0040755216],"genre_scores_gemma":[0.30290776,0.0008928043,0.6908094,0.00032550693,0.00013805076,0.0003922456,0.0009195361,0.0002647153,0.0033498956],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9953329,0.0017853027,0.0002589535,0.00067905284,0.0013233522,0.0006204808],"domain_scores_gemma":[0.9863061,0.009155728,0.0010170165,0.0022326605,0.00073624874,0.00055220973],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004273799,0.0017303901,0.00206917,0.0016711688,0.0010330752,0.003000622,0.0042456314,0.0012055793,0.003661636],"category_scores_gemma":[0.016398208,0.0011173956,0.0018469125,0.0040999292,0.0017050877,0.005611806,0.0037201035,0.0034698544,0.0009722497],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011535175,0.00033539737,0.00272772,0.00046222663,0.00020909139,0.00011219501,0.0004105753,0.6751057,0.0054728077,0.16099283,0.0067340676,0.14628385],"study_design_scores_gemma":[0.00006668038,0.0000908789,0.00022363896,0.000035116285,0.000029430465,0.000066103705,0.000062032035,0.925658,0.0019191931,0.069933675,0.0018958799,0.000019417985],"about_ca_topic_score_codex":0.0032924004,"about_ca_topic_score_gemma":0.003095215,"teacher_disagreement_score":0.004273799,"about_ca_system_score_codex":0.002377782,"about_ca_system_score_gemma":0.0015525979,"threshold_uncertainty_score":0.02260232},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.059171945,0.0003326803,0.93375736,0.00029008507,0.00007439437,0.0000685782,0.0003655359,0.0003898068,0.005549542],"genre_scores_gemma":[0.38069668,0.00039893924,0.6125324,0.000086697466,0.000050982377,0.00018370176,0.0013868124,0.0004534196,0.0042104246],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994435,0.00012653609,0.000030075082,0.00008098015,0.0002452428,0.000073836],"domain_scores_gemma":[0.9983967,0.00095357833,0.00013952902,0.00017538153,0.0002391167,0.000095745294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007794295,0.00090306083,0.0017886031,0.0014570083,0.0006183447,0.0018150121,0.002089282,0.0017750527,0.0067677344],"category_scores_gemma":[0.0077300756,0.00095653767,0.001151862,0.0012013047,0.00082504406,0.0017682288,0.002705336,0.002343935,0.0010169573],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004105665,0.00015266119,0.0018502551,0.0006252024,0.00007972428,0.00015855899,0.00039422576,0.70671165,0.005304683,0.12275806,0.0078056073,0.15374875],"study_design_scores_gemma":[0.000022319826,0.000025176862,0.0001812468,0.000037341197,0.000007822685,0.000042772383,0.00006270577,0.9557533,0.00080728665,0.041756026,0.0012969539,0.0000070138744],"about_ca_topic_score_codex":0.0033129328,"about_ca_topic_score_gemma":0.0052470984,"teacher_disagreement_score":0.0067677344,"about_ca_system_score_codex":0.0013306261,"about_ca_system_score_gemma":0.0006474538,"threshold_uncertainty_score":0.022640288},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7074735,0.0017395074,0.20387587,0.0012830104,0.00036076273,0.00007772172,0.00040660365,0.00022336804,0.08455964],"genre_scores_gemma":[0.9442154,0.0014066935,0.033436295,0.00017928243,0.00021248673,0.00003189528,0.00053398754,0.00022391441,0.019760037],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995515,0.00010690577,0.00002621903,0.00008253226,0.00012847902,0.000104413266],"domain_scores_gemma":[0.9971572,0.0016266223,0.00033772658,0.0002948933,0.00022500058,0.0003585617],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006062305,0.0008204014,0.0008595097,0.0017685445,0.0011554137,0.0021421309,0.0015959267,0.001359261,0.0057409387],"category_scores_gemma":[0.0051529068,0.0006919061,0.00074515824,0.0012797358,0.0026925413,0.004388995,0.0026808747,0.0022528847,0.0004141179],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010837078,0.00005083171,0.0010720588,0.000087760745,0.000008110434,0.000315139,0.0005129204,0.011879709,0.0014431328,0.9680005,0.0019711312,0.014550308],"study_design_scores_gemma":[0.000013582597,0.000027429622,0.0006765335,0.000041778298,0.000012395599,0.00020374644,0.0003371048,0.026929496,0.0006775588,0.96781373,0.0032560483,0.000010475718],"about_ca_topic_score_codex":0.0010995829,"about_ca_topic_score_gemma":0.00169679,"teacher_disagreement_score":0.0057409387,"about_ca_system_score_codex":0.0007890249,"about_ca_system_score_gemma":0.00028959732,"threshold_uncertainty_score":0.019205332},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46797904,0.0005135871,0.5019941,0.00070308975,0.00014121692,0.00011386959,0.00021544132,0.000440935,0.02789873],"genre_scores_gemma":[0.92972815,0.0007261491,0.050549436,0.00013864563,0.00011946758,0.00006762231,0.00033779428,0.0004287182,0.017904047],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997379,0.000074152624,0.000009213067,0.00005463017,0.00008468771,0.000039329465],"domain_scores_gemma":[0.99889165,0.0005392764,0.00018419618,0.00016055201,0.000098122226,0.00012626112],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032474188,0.00055190234,0.0007545592,0.001298789,0.00070357,0.0010605014,0.0009886515,0.0007934629,0.004813077],"category_scores_gemma":[0.002517915,0.00042803906,0.00045043213,0.0010601782,0.001927295,0.0017905001,0.0020886213,0.0013517117,0.0005943403],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016553872,0.00010554221,0.0010222523,0.000110065994,0.000022215325,0.00026025655,0.0005243384,0.24040857,0.008554983,0.7092422,0.0035830336,0.036001027],"study_design_scores_gemma":[0.000024659625,0.000060904254,0.0005952181,0.000015847934,0.0000097584525,0.00009957116,0.00022614987,0.44577488,0.0018143073,0.5486763,0.0026860586,0.000016451482],"about_ca_topic_score_codex":0.0018819333,"about_ca_topic_score_gemma":0.0019220655,"teacher_disagreement_score":0.004813077,"about_ca_system_score_codex":0.0005922458,"about_ca_system_score_gemma":0.00025369713,"threshold_uncertainty_score":0.01610136},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040253013,0.00097395823,0.90795124,0.0018685176,0.0012926062,0.0001292513,0.0004425861,0.0011234898,0.045965277],"genre_scores_gemma":[0.339404,0.0016158487,0.6064212,0.00097123923,0.0009574947,0.00038122284,0.0009015656,0.0017631978,0.047584333],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986229,0.0002535225,0.00007217065,0.00028424573,0.0006310979,0.00013617451],"domain_scores_gemma":[0.99733436,0.0006886805,0.0001568503,0.0010251055,0.00050763413,0.00028735757],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082195783,0.0008723118,0.00083002215,0.0023086525,0.0018492427,0.0030263513,0.0020048039,0.0015107767,0.007888401],"category_scores_gemma":[0.004741852,0.0007816848,0.00083532906,0.0015779269,0.003958405,0.005527747,0.0052186274,0.0033067854,0.0020131604],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033431796,0.000021013864,0.00018329763,0.000061084495,0.000007384408,0.0000679016,0.00020841455,0.0026371612,0.0019162862,0.95009637,0.0062616593,0.038505886],"study_design_scores_gemma":[0.000024957108,0.000042042433,0.0001335703,0.00004590919,0.000024886782,0.00039634306,0.00010468088,0.021852104,0.004956373,0.9110356,0.06134436,0.000039198356],"about_ca_topic_score_codex":0.00053851045,"about_ca_topic_score_gemma":0.0008357697,"teacher_disagreement_score":0.007888401,"about_ca_system_score_codex":0.0009836194,"about_ca_system_score_gemma":0.00070081133,"threshold_uncertainty_score":0.02638936},"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":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20637193,0.0022630827,0.15364996,0.0037885448,0.0010808199,0.0001354151,0.0010621564,0.00046446227,0.6311837],"genre_scores_gemma":[0.77544254,0.0009040134,0.036768675,0.0003355265,0.00024598895,0.00008513239,0.0005626368,0.00033535596,0.18532012],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993338,0.00008870651,0.000022569553,0.000178027,0.00026338626,0.00011347446],"domain_scores_gemma":[0.99949837,0.00010086303,0.0000721332,0.000085029445,0.000117054165,0.0001266139],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034623727,0.00053440547,0.0005978337,0.001903694,0.0027171993,0.0047447835,0.00148176,0.0016796595,0.024440376],"category_scores_gemma":[0.0020900527,0.00060598593,0.0005942151,0.0011764226,0.004378847,0.0030199944,0.0031222547,0.0028163653,0.0031510976],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055351382,0.0000061908986,0.00014000447,0.000025890346,0.0000038900184,0.00015968867,0.00024021082,0.0020600492,0.00067913067,0.9848453,0.0037682,0.008016059],"study_design_scores_gemma":[0.00004250959,0.000068686175,0.0009389859,0.0000524492,0.000015969701,0.0013160496,0.0011510848,0.008872824,0.0022151489,0.885086,0.10018283,0.000057444315],"about_ca_topic_score_codex":0.004818701,"about_ca_topic_score_gemma":0.0045375116,"teacher_disagreement_score":0.024440376,"about_ca_system_score_codex":0.00152073,"about_ca_system_score_gemma":0.0010373994,"threshold_uncertainty_score":0.08176118},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7624642,0.0032214823,0.21289358,0.003004138,0.00024434313,0.00015027309,0.0026032713,0.00044223497,0.014976421],"genre_scores_gemma":[0.918318,0.0015178343,0.07215799,0.00016517947,0.0001787098,0.00013486213,0.002259441,0.00022824785,0.005039761],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983975,0.00047025701,0.00013931215,0.0003464592,0.00044106678,0.00020531002],"domain_scores_gemma":[0.95471215,0.038657952,0.0022163608,0.0012677072,0.0015148453,0.0016310423],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002504604,0.0008769217,0.0015752579,0.002974334,0.001383713,0.0026471927,0.0026650552,0.0014742799,0.0071453694],"category_scores_gemma":[0.03387286,0.0006709331,0.0006367053,0.0030062103,0.00210803,0.004360359,0.0019740872,0.0019217894,0.00035532765],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019497364,0.0002502594,0.022129979,0.0009826706,0.00026186623,0.00025491562,0.00058872363,0.7574972,0.0064551653,0.12212473,0.008754803,0.07874995],"study_design_scores_gemma":[0.00008416553,0.00017614792,0.003866367,0.000062319064,0.000056499375,0.00021173018,0.00026523808,0.91587996,0.0014364708,0.07604933,0.0018823349,0.000029409157],"about_ca_topic_score_codex":0.0033984468,"about_ca_topic_score_gemma":0.0049914406,"teacher_disagreement_score":0.0071453694,"about_ca_system_score_codex":0.0017565315,"about_ca_system_score_gemma":0.0012571872,"threshold_uncertainty_score":0.023903668},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.085062064,0.0005198298,0.80022186,0.0009940679,0.0003066257,0.00021453881,0.0011469957,0.0023237055,0.10921029],"genre_scores_gemma":[0.49132374,0.0010203392,0.41893026,0.00042912227,0.00015954253,0.00029906977,0.0024048968,0.0015573343,0.08387576],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994591,0.00013109966,0.000022799117,0.00012821855,0.00020138337,0.00005748722],"domain_scores_gemma":[0.99881303,0.00031393796,0.00010712254,0.0004234133,0.00020942674,0.00013302697],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025013715,0.00092941546,0.0006681188,0.001207215,0.0009801936,0.0018123232,0.0010520112,0.0014032987,0.027633226],"category_scores_gemma":[0.0030550081,0.00089371816,0.00058197405,0.0012349365,0.0008282477,0.002244625,0.0014662567,0.0025056647,0.008849568],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002575258,0.00012318407,0.0009214783,0.00034354362,0.000043333734,0.00070238457,0.00043148274,0.035582475,0.025183856,0.7090645,0.031551894,0.19579433],"study_design_scores_gemma":[0.00008182496,0.00010184873,0.0008065581,0.00008317251,0.000044585784,0.00082619564,0.00027051236,0.10973955,0.010375908,0.8017564,0.0758711,0.000042375403],"about_ca_topic_score_codex":0.0006194247,"about_ca_topic_score_gemma":0.0015956834,"teacher_disagreement_score":0.027633226,"about_ca_system_score_codex":0.00043945128,"about_ca_system_score_gemma":0.00039078284,"threshold_uncertainty_score":0.09244233},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1936033,0.00020118267,0.7233618,0.0009678139,0.0005417442,0.00048581642,0.0009809233,0.0014958814,0.078361616],"genre_scores_gemma":[0.693788,0.00034788364,0.26261786,0.0001233323,0.000057389097,0.00031680078,0.0012343391,0.00044829675,0.041066084],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996126,0.000079085956,0.00001906084,0.000051883646,0.00019022153,0.000047188725],"domain_scores_gemma":[0.99932265,0.00011935734,0.0001019742,0.00009596304,0.00027414865,0.000085999636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026680683,0.0007004975,0.00031033048,0.0013799131,0.00088460086,0.0016621288,0.00096345006,0.0010800754,0.017384842],"category_scores_gemma":[0.0022707777,0.0003587575,0.00029376216,0.0014911004,0.0010372649,0.0010950122,0.0013080301,0.001383999,0.0030739782],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009440035,0.0002948869,0.0056245467,0.00027273048,0.0000621376,0.0013026701,0.0022994273,0.093616806,0.051180564,0.5081614,0.022322992,0.31391793],"study_design_scores_gemma":[0.00031773277,0.00052793906,0.004810279,0.00014889422,0.000050771985,0.0012856429,0.0030718825,0.46549696,0.078110896,0.24863477,0.19738477,0.00015946163],"about_ca_topic_score_codex":0.0027667682,"about_ca_topic_score_gemma":0.0020559465,"teacher_disagreement_score":0.017384842,"about_ca_system_score_codex":0.0006346548,"about_ca_system_score_gemma":0.00058931607,"threshold_uncertainty_score":0.05815816},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35735694,0.0013276696,0.58155775,0.0014463956,0.00017866214,0.00010615761,0.0008108787,0.00044851433,0.056767106],"genre_scores_gemma":[0.8564095,0.0025217426,0.11686175,0.00033834775,0.00030726608,0.00010148623,0.0016523859,0.0006956625,0.021111766],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99959475,0.000099632154,0.000015659434,0.00009467898,0.00012652518,0.00006873855],"domain_scores_gemma":[0.99698275,0.0017631403,0.00045362182,0.00024319699,0.00029621963,0.0002610218],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036637872,0.0007913965,0.0009344919,0.0019675123,0.0010629416,0.0020418796,0.0011818109,0.0010086591,0.007098928],"category_scores_gemma":[0.00438782,0.0007078524,0.0006328102,0.0014884094,0.00227455,0.0031760866,0.0018897043,0.0022157107,0.0009547049],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002086219,0.0000694602,0.0013914355,0.0001742787,0.000027699905,0.00042426554,0.00068158115,0.02887116,0.0056215785,0.903268,0.006360437,0.052901592],"study_design_scores_gemma":[0.000031395237,0.000044384466,0.0012550919,0.000046227608,0.00002117421,0.00028031258,0.0002994799,0.08539784,0.0018162756,0.90359557,0.007191755,0.000020498475],"about_ca_topic_score_codex":0.0025039,"about_ca_topic_score_gemma":0.0019848524,"teacher_disagreement_score":0.007098928,"about_ca_system_score_codex":0.0005991631,"about_ca_system_score_gemma":0.00037068632,"threshold_uncertainty_score":0.023748338},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21311504,0.005645375,0.7165974,0.0048181834,0.00047510446,0.000623082,0.0032222958,0.0025274465,0.052976023],"genre_scores_gemma":[0.63292867,0.0038072935,0.33847138,0.00078057917,0.0006053121,0.00054898794,0.005722307,0.00055818714,0.016577277],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99819297,0.00041088703,0.000081525766,0.0005116699,0.00050208374,0.00030096047],"domain_scores_gemma":[0.9963341,0.00255997,0.00021643152,0.000491959,0.00024312802,0.00015439853],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090960745,0.0012099843,0.0018515114,0.0012421156,0.0012604737,0.0024784436,0.0021137844,0.0018427076,0.011528422],"category_scores_gemma":[0.007221956,0.0005593352,0.0010576784,0.0033848335,0.0013728947,0.005225021,0.00202345,0.0017661008,0.0016746959],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015019769,0.00052851485,0.0021509551,0.0010584662,0.00014847664,0.00063438056,0.0004542995,0.48999125,0.0042823795,0.13992533,0.057114147,0.30220985],"study_design_scores_gemma":[0.00017010761,0.00011768017,0.00068929954,0.000093735616,0.00005764391,0.00054827734,0.00023523839,0.7942967,0.0032711595,0.18245494,0.018019605,0.000045643417],"about_ca_topic_score_codex":0.0043352135,"about_ca_topic_score_gemma":0.0025054477,"teacher_disagreement_score":0.011528422,"about_ca_system_score_codex":0.002165252,"about_ca_system_score_gemma":0.0013123051,"threshold_uncertainty_score":0.03856647},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3354442,0.002797442,0.51328063,0.002402694,0.0009763939,0.0002696581,0.001849237,0.00094471633,0.14203511],"genre_scores_gemma":[0.72710043,0.0027795637,0.22613189,0.00067869475,0.00027541336,0.0004987016,0.0029459991,0.0004887807,0.039100453],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988405,0.00022289639,0.00008098226,0.0003217317,0.00028435566,0.00024953333],"domain_scores_gemma":[0.99708134,0.0013864617,0.00038862924,0.00058758794,0.00025163835,0.00030431524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039887053,0.0008340537,0.00075450016,0.00082143676,0.0016362057,0.0022090436,0.0010309299,0.0014233406,0.01701162],"category_scores_gemma":[0.008010171,0.0008459968,0.00086365844,0.001179288,0.0015775829,0.0035318043,0.0037855778,0.0028205132,0.003384991],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001029318,0.00013789983,0.0025805435,0.00052528066,0.00006927442,0.0006192389,0.0005984828,0.056270428,0.011742911,0.79048276,0.013850531,0.12209339],"study_design_scores_gemma":[0.00025969034,0.00027531997,0.001102989,0.00023198774,0.00007107973,0.00091298536,0.00061552355,0.085452646,0.008420899,0.8257356,0.076852724,0.00006850708],"about_ca_topic_score_codex":0.0009589362,"about_ca_topic_score_gemma":0.0011524584,"teacher_disagreement_score":0.01701162,"about_ca_system_score_codex":0.0006355289,"about_ca_system_score_gemma":0.00061393366,"threshold_uncertainty_score":0.0569095},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043022107,0.0022704431,0.89790374,0.0026537322,0.0003367866,0.00007831774,0.00026038577,0.000121312565,0.053353153],"genre_scores_gemma":[0.51018447,0.0040303404,0.42263496,0.00088178855,0.0010479946,0.00033840633,0.0010159599,0.0005220757,0.059344027],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99929214,0.000286599,0.00003527079,0.00013977222,0.00018707673,0.00005919615],"domain_scores_gemma":[0.99705017,0.002306593,0.00021589518,0.00011792728,0.00017014533,0.00013920803],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013598625,0.0012148989,0.0011376347,0.00078580406,0.00084976293,0.0021337648,0.001203138,0.0021672433,0.008116374],"category_scores_gemma":[0.0090443725,0.0008780299,0.001079955,0.0011756854,0.0015820091,0.0029032861,0.0022718443,0.0029807892,0.00075222016],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013352094,0.000112488015,0.0008168048,0.00028872746,0.00005327882,0.00015327563,0.00020343729,0.23598637,0.0013151928,0.698654,0.00954953,0.052733455],"study_design_scores_gemma":[0.000053469408,0.000050287235,0.00033962683,0.000043804663,0.000025214777,0.00011635526,0.0000786253,0.40584373,0.0006305968,0.5848011,0.007998657,0.000018598135],"about_ca_topic_score_codex":0.0010200619,"about_ca_topic_score_gemma":0.0009595234,"teacher_disagreement_score":0.008116374,"about_ca_system_score_codex":0.0008651587,"about_ca_system_score_gemma":0.00054806774,"threshold_uncertainty_score":0.027151942},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82234967,0.001094144,0.15168576,0.000993504,0.00023672816,0.000080284946,0.0004838245,0.00040814735,0.022667931],"genre_scores_gemma":[0.9582558,0.00082682585,0.020961508,0.00009991229,0.00014398352,0.000059600083,0.00053129083,0.00031578692,0.018805282],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999511,0.000097783035,0.000037297592,0.00008886239,0.00016336021,0.00010166576],"domain_scores_gemma":[0.9975266,0.0007031311,0.00043061154,0.00028830435,0.00044834695,0.00060308806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008490227,0.0010824094,0.00089935947,0.0036891566,0.0016511235,0.0032161234,0.0015451491,0.001405132,0.011471873],"category_scores_gemma":[0.005039888,0.00074700755,0.0007477497,0.0017821345,0.0030205215,0.003459305,0.0034220438,0.0020071904,0.0011131788],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016427199,0.00012728492,0.0027444293,0.00013216933,0.000019817411,0.00035830546,0.0011288661,0.019372666,0.004143042,0.94781303,0.0019352299,0.022060923],"study_design_scores_gemma":[0.000026676173,0.00008980296,0.002548559,0.00008889175,0.000013811491,0.0003059458,0.00060846965,0.12299417,0.0015048406,0.8669309,0.0048438436,0.0000441514],"about_ca_topic_score_codex":0.0024189465,"about_ca_topic_score_gemma":0.0029436396,"teacher_disagreement_score":0.011471873,"about_ca_system_score_codex":0.0017783967,"about_ca_system_score_gemma":0.00063993444,"threshold_uncertainty_score":0.038377225},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5718945,0.0026275287,0.27223063,0.0279751,0.0013931204,0.00021140369,0.0026642752,0.0031325473,0.11787092],"genre_scores_gemma":[0.95240945,0.00054677814,0.029303879,0.0013406905,0.00046779992,0.00020702487,0.0013298182,0.0003319923,0.014062588],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980698,0.00039041808,0.00009338267,0.00058175484,0.0003491048,0.00051555247],"domain_scores_gemma":[0.9796728,0.015416876,0.0011786151,0.0018397676,0.0008857752,0.0010061156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025924128,0.0011258514,0.0022302405,0.001014599,0.0035721804,0.0063958676,0.0029048687,0.003748817,0.016637962],"category_scores_gemma":[0.036427964,0.00080442504,0.0012313776,0.0011014647,0.003971485,0.008837768,0.0045730458,0.0039818427,0.0014106815],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0023768782,0.00025377204,0.0046855803,0.0010238437,0.00017965364,0.00039724706,0.0008839996,0.075491086,0.008058444,0.85093117,0.02998933,0.025729008],"study_design_scores_gemma":[0.0001801457,0.00010263199,0.0009614218,0.000058414847,0.000050275798,0.00013444202,0.00032856222,0.1728997,0.0016748204,0.8199668,0.0036045483,0.000038208073],"about_ca_topic_score_codex":0.0033028682,"about_ca_topic_score_gemma":0.0043216688,"teacher_disagreement_score":0.016637962,"about_ca_system_score_codex":0.0028021312,"about_ca_system_score_gemma":0.0033867548,"threshold_uncertainty_score":0.055659473},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11091349,0.00015392211,0.8553457,0.00018002494,0.00019076304,0.00020493349,0.00029447852,0.0007118563,0.032004893],"genre_scores_gemma":[0.5898848,0.00022316932,0.38953343,0.00008848752,0.000048903905,0.00017372763,0.00082787283,0.00060126424,0.01861834],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995658,0.00011580167,0.000020169673,0.00006974846,0.00018167413,0.000046853205],"domain_scores_gemma":[0.99889094,0.00056633283,0.00006328733,0.00016736091,0.00021772571,0.000094480405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005109059,0.00047025093,0.0006179455,0.001482829,0.0006344084,0.0010379322,0.000959117,0.00084941526,0.009199416],"category_scores_gemma":[0.003512488,0.00052680913,0.00068755524,0.0007631377,0.000669613,0.001286624,0.0019192017,0.00092866534,0.0014515567],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015372019,0.00011023363,0.0009722181,0.00033830135,0.00004691108,0.00058571756,0.00068259356,0.11008916,0.017520232,0.6984574,0.009084181,0.16195928],"study_design_scores_gemma":[0.00006779344,0.00007721452,0.00027510023,0.000077336044,0.000028209726,0.00030009873,0.00024883874,0.44131815,0.011246423,0.5230844,0.02324161,0.000034807592],"about_ca_topic_score_codex":0.0004136604,"about_ca_topic_score_gemma":0.0010616726,"teacher_disagreement_score":0.009199416,"about_ca_system_score_codex":0.00044881867,"about_ca_system_score_gemma":0.00028911262,"threshold_uncertainty_score":0.03077507},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18968993,0.0024184948,0.64270324,0.0013158085,0.00044220703,0.00012470952,0.0014619019,0.00059951615,0.16124429],"genre_scores_gemma":[0.77334666,0.0017835669,0.16036917,0.00038923873,0.00024392852,0.00017294582,0.0021078098,0.0003940189,0.061192576],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995832,0.00011351912,0.000023229664,0.00008271871,0.00011389226,0.00008341456],"domain_scores_gemma":[0.9990669,0.00044058237,0.00008955934,0.00014678664,0.000117759926,0.0001383612],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039346694,0.0005311698,0.00057627686,0.0017588524,0.001213251,0.0025673697,0.0010303559,0.0008326878,0.0156642],"category_scores_gemma":[0.0025849347,0.00045226756,0.0006820793,0.0014701631,0.0014755304,0.00354872,0.0026193324,0.0019520648,0.0021656714],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025632451,0.000015333973,0.00016721824,0.00003726449,0.0000060766793,0.00004710529,0.00010417103,0.0034417564,0.00039812262,0.97531784,0.002343768,0.01809569],"study_design_scores_gemma":[0.000008595192,0.000013534625,0.00010445536,0.000029135621,0.000005873947,0.00006374142,0.00009160715,0.009500362,0.00036215925,0.9821269,0.007687225,0.0000064270243],"about_ca_topic_score_codex":0.0015562737,"about_ca_topic_score_gemma":0.0029786231,"teacher_disagreement_score":0.0156642,"about_ca_system_score_codex":0.0008822066,"about_ca_system_score_gemma":0.0004282797,"threshold_uncertainty_score":0.05240196},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17801093,0.0019669055,0.8039733,0.0012530129,0.00017464007,0.00014043917,0.0011611264,0.0044710096,0.008848581],"genre_scores_gemma":[0.578103,0.00052731857,0.4150061,0.00019360245,0.00008575987,0.00015957806,0.0022078953,0.0003077412,0.0034089796],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990852,0.00017871783,0.00006144897,0.00021597448,0.00031265698,0.00014599119],"domain_scores_gemma":[0.9980203,0.0011837905,0.00019401594,0.00032969943,0.00017284315,0.00009925992],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083406875,0.0006996055,0.0011890619,0.00069104705,0.00042151543,0.0011337018,0.0015765401,0.00088175863,0.0037353723],"category_scores_gemma":[0.006720169,0.00030855037,0.0005188835,0.0016300078,0.00039062506,0.0031954492,0.0012509015,0.0007763092,0.0010264115],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011480178,0.00025409926,0.0033454548,0.0005936065,0.00012317896,0.0003348597,0.0002865573,0.57274044,0.011601419,0.041313026,0.023256361,0.34500304],"study_design_scores_gemma":[0.00003487318,0.000040973024,0.0002330454,0.000008517888,0.000009038004,0.00007821722,0.000039729424,0.9776689,0.0013072563,0.019483874,0.0010915434,0.0000041853423],"about_ca_topic_score_codex":0.0028671206,"about_ca_topic_score_gemma":0.0042136367,"teacher_disagreement_score":0.0037353723,"about_ca_system_score_codex":0.0009312579,"about_ca_system_score_gemma":0.0008021482,"threshold_uncertainty_score":0.012496054},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2254721,0.00069314585,0.6678268,0.0006704552,0.00023045666,0.00017385573,0.0007634213,0.0012525603,0.1029173],"genre_scores_gemma":[0.7411366,0.0015697426,0.21098556,0.00021188574,0.0001361854,0.00015650556,0.0016429345,0.00047236524,0.04368829],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997893,0.000051426658,0.0000074542545,0.000047957412,0.00007879005,0.000025098705],"domain_scores_gemma":[0.9992347,0.00027787342,0.000106089356,0.0001930597,0.000103775405,0.000084494335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001630853,0.00061309955,0.0003460594,0.00085567066,0.00053950766,0.00096027326,0.000727594,0.0005583482,0.010513712],"category_scores_gemma":[0.0017478964,0.00038381392,0.0003170073,0.0012465928,0.0006058144,0.0013694793,0.000737927,0.0010572477,0.0009761964],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019483408,0.00008482028,0.0009773911,0.0001905425,0.00002803606,0.0005273303,0.0003177988,0.08616562,0.022686407,0.74153376,0.015279744,0.13201377],"study_design_scores_gemma":[0.00009290276,0.00012287703,0.0016238781,0.000046607733,0.00006133018,0.0007524414,0.00030003113,0.17160839,0.016142346,0.74181664,0.067398936,0.000033605014],"about_ca_topic_score_codex":0.0008673452,"about_ca_topic_score_gemma":0.0022723023,"teacher_disagreement_score":0.010513712,"about_ca_system_score_codex":0.0003581699,"about_ca_system_score_gemma":0.0002218604,"threshold_uncertainty_score":0.035171926},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15254544,0.0025153768,0.7331773,0.0028742752,0.000503454,0.00009059791,0.00046215314,0.00021319902,0.10761814],"genre_scores_gemma":[0.7921034,0.001243898,0.18659686,0.0007397388,0.00047780006,0.00020963451,0.0004992825,0.00015634915,0.017973095],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973494,0.00069348037,0.00011923168,0.00030353927,0.0012389917,0.0002953991],"domain_scores_gemma":[0.99557614,0.0026211091,0.00030400974,0.0003160472,0.0008876908,0.00029490175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033584773,0.00062117877,0.0006955959,0.0027908338,0.0014203469,0.0027115624,0.0015169746,0.0009895463,0.0074517224],"category_scores_gemma":[0.010075594,0.0004064896,0.0008942612,0.0014026212,0.0038247507,0.003689255,0.0039414023,0.0029418864,0.0007773364],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031452924,0.000008039031,0.00014072019,0.000025053509,0.000004520187,0.000029122177,0.00008163957,0.0021067115,0.0009793404,0.9899374,0.0007800108,0.005875866],"study_design_scores_gemma":[0.000010329481,0.000020149062,0.00012205712,0.000013908665,0.0000031908303,0.00005759734,0.000053657805,0.015733486,0.0011880998,0.9781908,0.004598628,0.00000802578],"about_ca_topic_score_codex":0.0012491221,"about_ca_topic_score_gemma":0.0013518229,"teacher_disagreement_score":0.0074517224,"about_ca_system_score_codex":0.0019893793,"about_ca_system_score_gemma":0.00055491267,"threshold_uncertainty_score":0.02492845},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015745679,0.00011802041,0.9929299,0.000038877195,0.00004514158,0.000033643257,0.000039982126,0.00076992053,0.004450062],"genre_scores_gemma":[0.071706995,0.00030738316,0.9004037,0.00008881567,0.00007021323,0.0001523567,0.00030578498,0.0005762692,0.026388524],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993563,0.00007886957,0.000028113016,0.00014866411,0.00033416713,0.000053821524],"domain_scores_gemma":[0.9991598,0.00017132422,0.00006844613,0.00038634735,0.00017862672,0.000035395875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006335757,0.0013416455,0.0011944132,0.0014066282,0.00085613725,0.0018924645,0.0020054681,0.0016313251,0.030332897],"category_scores_gemma":[0.0018551367,0.00085066905,0.0011581905,0.001190219,0.00061142567,0.0021898253,0.0029997474,0.0014154857,0.009391095],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018810354,0.00011693524,0.000673344,0.0002564779,0.00011987152,0.00015130061,0.00018502008,0.15487382,0.013913562,0.12337621,0.012136508,0.6940088],"study_design_scores_gemma":[0.000044437304,0.00015060697,0.00044060152,0.00004272894,0.000056979505,0.00035738517,0.00006646349,0.8897533,0.013319475,0.045373354,0.05036374,0.00003102274],"about_ca_topic_score_codex":0.0011134036,"about_ca_topic_score_gemma":0.0021740505,"teacher_disagreement_score":0.030332897,"about_ca_system_score_codex":0.0005176098,"about_ca_system_score_gemma":0.0006686156,"threshold_uncertainty_score":0.10147363},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007457044,0.05631466,0.09039928,0.05175653,0.08892086,0.00020586514,0.0040131556,0.003018732,0.69791394],"genre_scores_gemma":[0.025391635,0.02338871,0.054250993,0.0030518498,0.009686464,0.00013920256,0.002757264,0.0011548599,0.8801789],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99875045,0.0002668915,0.000041395684,0.00031932557,0.00042550336,0.00019642034],"domain_scores_gemma":[0.99862635,0.00023193192,0.000030446035,0.00022193872,0.00036801555,0.0005213509],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003009186,0.001483618,0.0015431914,0.0021892814,0.0023472055,0.0061311554,0.0023082374,0.0017262594,0.1418265],"category_scores_gemma":[0.0025105309,0.000564211,0.0010040585,0.0019519429,0.0013263198,0.0024073962,0.0037345914,0.0038083815,0.056322552],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.00011383312,0.000064991116,0.0002462724,0.00011317208,0.0000306556,0.00007569194,0.00011085461,0.0013507265,0.0004435144,0.05246904,0.80002004,0.14496115],"study_design_scores_gemma":[0.00003193898,0.000038000453,0.00083627953,0.00017478541,0.000017564973,0.000071286195,0.00016319625,0.002611347,0.0005748435,0.029837191,0.9656243,0.000019260686],"about_ca_topic_score_codex":0.018273707,"about_ca_topic_score_gemma":0.05543285,"teacher_disagreement_score":0.9817263,"about_ca_system_score_codex":0.005618097,"about_ca_system_score_gemma":0.0042233714,"threshold_uncertainty_score":0.4744569},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10505403,0.004067337,0.8318484,0.0024588027,0.0003863386,0.00010738799,0.00032154808,0.00016730944,0.05558874],"genre_scores_gemma":[0.79610246,0.0031124926,0.17235842,0.0002956473,0.0006225395,0.00022285759,0.0007273443,0.00042228083,0.026135929],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992237,0.0003528118,0.000033344648,0.00009757451,0.00020205785,0.00009056861],"domain_scores_gemma":[0.99734527,0.0018458252,0.00027023707,0.0001273946,0.00021989112,0.00019145108],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015106832,0.0010007961,0.0015360753,0.0021335708,0.001144651,0.002522356,0.0017270098,0.0018573675,0.004621595],"category_scores_gemma":[0.009664186,0.0010114614,0.0009372731,0.0011337552,0.0022928733,0.002587807,0.002811859,0.0034205497,0.00035346352],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000107893815,0.000048144986,0.0004445856,0.00018069106,0.00004490389,0.00014285241,0.00013813165,0.10017448,0.0010340441,0.8733527,0.004679849,0.019651685],"study_design_scores_gemma":[0.000017802171,0.000024418045,0.00023012537,0.000046856203,0.000014784509,0.00010084329,0.00007567882,0.3525453,0.00042515298,0.6435275,0.0029769435,0.000014541521],"about_ca_topic_score_codex":0.0010111497,"about_ca_topic_score_gemma":0.0012202262,"teacher_disagreement_score":0.004621595,"about_ca_system_score_codex":0.0010719544,"about_ca_system_score_gemma":0.00048362956,"threshold_uncertainty_score":0.015460789},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.078719325,0.0008937851,0.9039265,0.0008601873,0.00028533788,0.00014724709,0.0011654233,0.003343367,0.010658862],"genre_scores_gemma":[0.57346237,0.0003039981,0.41420344,0.0003341298,0.00011239674,0.00009545339,0.0016882913,0.00021974732,0.009580277],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987534,0.00022125135,0.00008851248,0.00029985709,0.00047311917,0.00016387699],"domain_scores_gemma":[0.9985316,0.00040016268,0.000114635346,0.0006813618,0.00020766494,0.00006457106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050196913,0.0005549412,0.0013997923,0.0009861538,0.0007351457,0.0011870916,0.002276163,0.0012343992,0.009164586],"category_scores_gemma":[0.003312621,0.00040916415,0.0005873515,0.0021969874,0.0006029078,0.0027537148,0.0023930569,0.0007331944,0.002417434],"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.0019834924,0.0004930861,0.004728704,0.00069114874,0.0001949341,0.00056877726,0.0005623154,0.20133474,0.042091597,0.047506537,0.04085092,0.6589937],"study_design_scores_gemma":[0.00020829862,0.00023038554,0.0011321128,0.000040298008,0.00003652425,0.00043534764,0.00026266678,0.88098073,0.030342696,0.058825877,0.02745061,0.0000544353],"about_ca_topic_score_codex":0.0026133175,"about_ca_topic_score_gemma":0.0044984673,"teacher_disagreement_score":0.009164586,"about_ca_system_score_codex":0.00064981123,"about_ca_system_score_gemma":0.0006223628,"threshold_uncertainty_score":0.030658543},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95066357,0.002722281,0.03999964,0.00044323198,0.00005563806,0.000020382624,0.00022455884,0.00010107596,0.005769676],"genre_scores_gemma":[0.996985,0.0003771768,0.0019307012,0.00003457551,0.000048104943,0.0000122819365,0.0001170047,0.000020973566,0.0004742093],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99963653,0.00007609439,0.000022564187,0.00007730803,0.00009623581,0.00009120874],"domain_scores_gemma":[0.9971194,0.0015305303,0.00056389614,0.00032003902,0.0001751585,0.00029095318],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076358876,0.00030670385,0.0005220638,0.002128966,0.0006519116,0.0016844166,0.0007436852,0.00073360745,0.0012329645],"category_scores_gemma":[0.0067465967,0.00039658917,0.00029553304,0.000829694,0.0027904662,0.0023209334,0.00139895,0.0006765582,0.00014505174],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005307708,0.00012478975,0.018615833,0.00023008362,0.000077601,0.00032190728,0.00085041695,0.072877154,0.019652063,0.8665295,0.0022246167,0.017965285],"study_design_scores_gemma":[0.000044628094,0.00016743717,0.036863573,0.000118248456,0.000046321027,0.00073215755,0.00062032015,0.3241133,0.014083965,0.6200633,0.0030514514,0.000095221214],"about_ca_topic_score_codex":0.0009197662,"about_ca_topic_score_gemma":0.0004839065,"teacher_disagreement_score":0.002128966,"about_ca_system_score_codex":0.0009565062,"about_ca_system_score_gemma":0.00017638704,"threshold_uncertainty_score":0.0069399476},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38264036,0.00033409445,0.51578873,0.0005963235,0.0002967816,0.00013682069,0.00031667712,0.00089633797,0.09899392],"genre_scores_gemma":[0.83910835,0.00034537294,0.1042847,0.00021477237,0.00016694186,0.00018893066,0.00044857524,0.0005962609,0.05464612],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99959904,0.000074926415,0.000015825997,0.00010308526,0.00013921893,0.00006799692],"domain_scores_gemma":[0.9985033,0.0006421234,0.00016409584,0.00032511962,0.00015773316,0.00020754502],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036888212,0.00066880556,0.0005697031,0.0011641879,0.00090442784,0.0013044011,0.0010263778,0.00072650553,0.016440896],"category_scores_gemma":[0.002580185,0.00046886608,0.00041892685,0.0010760854,0.0014144637,0.0024372914,0.0024570287,0.0013974527,0.0018394862],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016032706,0.00007558061,0.00075516454,0.00009809873,0.000018666115,0.00014332808,0.00022585236,0.030723205,0.010483958,0.9108039,0.004926072,0.041585807],"study_design_scores_gemma":[0.000036461683,0.0001055244,0.00054359,0.000020443556,0.000017677463,0.0001817387,0.00011922614,0.073404625,0.007277338,0.90915525,0.009117534,0.00002052909],"about_ca_topic_score_codex":0.0004082618,"about_ca_topic_score_gemma":0.0009238833,"teacher_disagreement_score":0.016440896,"about_ca_system_score_codex":0.0005303253,"about_ca_system_score_gemma":0.0003900461,"threshold_uncertainty_score":0.055000305},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49538139,0.0012021968,0.44538927,0.0101225665,0.00029791,0.00020483023,0.0018833493,0.0019961724,0.043522317],"genre_scores_gemma":[0.8100084,0.0018710367,0.17348497,0.0011326051,0.00033080135,0.00018655213,0.003231297,0.000498127,0.009256202],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978549,0.0003826412,0.00011803304,0.0008226055,0.00047335803,0.00034850396],"domain_scores_gemma":[0.98099935,0.014352877,0.0012915808,0.0021790825,0.0006302303,0.00054694404],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011912703,0.0012002478,0.0014114751,0.00091524224,0.0015200279,0.0037247157,0.0027560284,0.002525947,0.0075939763],"category_scores_gemma":[0.011873999,0.0014963968,0.002078803,0.0018773556,0.0031582997,0.009729946,0.00394185,0.006701498,0.0011508294],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012503389,0.00064254936,0.0072766924,0.0017138629,0.00024419982,0.0013819651,0.0008652089,0.37888464,0.02645474,0.4116366,0.029917749,0.1397315],"study_design_scores_gemma":[0.00015364544,0.00015109037,0.001733275,0.00009973938,0.00014626344,0.0012432961,0.00037496377,0.20444039,0.013332128,0.76490796,0.013338068,0.00007914149],"about_ca_topic_score_codex":0.0012870363,"about_ca_topic_score_gemma":0.0018730867,"teacher_disagreement_score":0.0075939763,"about_ca_system_score_codex":0.0014263564,"about_ca_system_score_gemma":0.0011527707,"threshold_uncertainty_score":0.025404453},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2494609,0.0014355489,0.7248862,0.00089080783,0.00018789081,0.00034508778,0.0017311566,0.005979586,0.015082978],"genre_scores_gemma":[0.7140118,0.00069865765,0.27437693,0.00016381309,0.00010169212,0.00012107399,0.003647594,0.0012001778,0.005678205],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99780387,0.0003220762,0.00018021908,0.0003661551,0.00097029394,0.00035743442],"domain_scores_gemma":[0.99451643,0.003148444,0.00036045606,0.0013961617,0.0003555391,0.00022296947],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008533758,0.0008977499,0.0021246164,0.0011408553,0.0011659159,0.0035585219,0.0021240755,0.0015128916,0.0057413364],"category_scores_gemma":[0.009026458,0.0010054101,0.0011600372,0.003010455,0.0012852987,0.0073862704,0.004648083,0.0014688475,0.0012185948],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0031094295,0.00055944244,0.0060409475,0.0014083077,0.00021381036,0.0015598622,0.002162348,0.14483863,0.058967154,0.20285566,0.041849457,0.53643495],"study_design_scores_gemma":[0.0003615465,0.00025618347,0.0012892352,0.000085826585,0.00009150939,0.00061476324,0.00084378856,0.578571,0.028672807,0.36674055,0.02241361,0.00005917888],"about_ca_topic_score_codex":0.0023386166,"about_ca_topic_score_gemma":0.0035593065,"teacher_disagreement_score":0.0057413364,"about_ca_system_score_codex":0.00076223974,"about_ca_system_score_gemma":0.0007698261,"threshold_uncertainty_score":0.019206643},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04837444,0.00033830322,0.92560387,0.00023625931,0.000066684115,0.00016065026,0.0007142334,0.0007580701,0.023747576],"genre_scores_gemma":[0.41189283,0.0017158225,0.559305,0.00011836668,0.0000693123,0.00026756382,0.00267965,0.00079956325,0.023151813],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994143,0.000111389505,0.000023801002,0.00008832913,0.00030932855,0.00005280554],"domain_scores_gemma":[0.99902904,0.00031289476,0.000117686526,0.00021649891,0.00024165146,0.000082245926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028155933,0.00090082386,0.00068525266,0.0016031624,0.00059439323,0.0015567065,0.001507282,0.001206341,0.014455275],"category_scores_gemma":[0.003180607,0.0007906755,0.0004738968,0.0027813625,0.00081056997,0.001842918,0.0016531331,0.001449081,0.0019220436],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012769196,0.00008646402,0.00082038675,0.0003168064,0.00003425007,0.00037333276,0.00039463886,0.29583007,0.019081304,0.3928304,0.017153433,0.27295136],"study_design_scores_gemma":[0.000053279786,0.00006034328,0.00052466843,0.00008786748,0.000024888352,0.00030030633,0.00019692411,0.609946,0.009621862,0.33210188,0.047043122,0.000038924714],"about_ca_topic_score_codex":0.002901898,"about_ca_topic_score_gemma":0.0056592887,"teacher_disagreement_score":0.014455275,"about_ca_system_score_codex":0.000651665,"about_ca_system_score_gemma":0.0005668054,"threshold_uncertainty_score":0.048357785},"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":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024755422,0.11885369,0.7986555,0.0028361073,0.0009445161,0.00013608459,0.00054142845,0.0006402479,0.052636985],"genre_scores_gemma":[0.18908922,0.28875542,0.48430297,0.0018691513,0.005326555,0.0002797632,0.0028896248,0.000932511,0.026554735],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984763,0.00033391235,0.0001130686,0.0004625739,0.00047693294,0.00013721234],"domain_scores_gemma":[0.99682945,0.0019741692,0.0001846165,0.00054369704,0.00033551705,0.00013252068],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016870751,0.0016907235,0.0029861305,0.0033000815,0.001264033,0.0044840146,0.0034897034,0.002495346,0.011013348],"category_scores_gemma":[0.005097008,0.0013854754,0.0014971587,0.00808763,0.0027549735,0.0115146,0.004107024,0.0034322306,0.0043838327],"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.00009499455,0.00023641087,0.0017678643,0.0024122235,0.0000870546,0.00015172648,0.00036186058,0.04015447,0.0012986786,0.4413831,0.017602962,0.49444857],"study_design_scores_gemma":[0.000025578807,0.00014207854,0.00077473075,0.00075420586,0.000057457226,0.0006799022,0.00043407342,0.089862734,0.001480306,0.79866475,0.10706936,0.000054895863],"about_ca_topic_score_codex":0.0009387231,"about_ca_topic_score_gemma":0.0010926089,"teacher_disagreement_score":0.011013348,"about_ca_system_score_codex":0.0008671803,"about_ca_system_score_gemma":0.0008939613,"threshold_uncertainty_score":0.03684336},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00875773,0.00008426798,0.9890099,0.00005300163,0.000040243063,0.000026407353,0.000020256182,0.00028781424,0.0017204541],"genre_scores_gemma":[0.26112705,0.00025147048,0.7335861,0.00012219281,0.000035251585,0.00014370204,0.00015332902,0.0003478875,0.0042331503],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99948967,0.00010407229,0.000031067506,0.00008300643,0.00025853995,0.00003362833],"domain_scores_gemma":[0.99923646,0.0003032199,0.000048336868,0.00017147436,0.00021239907,0.000028151604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005943394,0.0004839233,0.00081551366,0.00058938714,0.00035801728,0.00084767473,0.0013917278,0.00087776716,0.0022409854],"category_scores_gemma":[0.002193118,0.00051004667,0.0005548999,0.00063887413,0.0006440731,0.00082176796,0.0016225799,0.00086080265,0.00065795647],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029334263,0.000106394364,0.0012927045,0.00023052587,0.00009259178,0.00015992473,0.000484553,0.62505364,0.06591409,0.020311918,0.0038864757,0.28217384],"study_design_scores_gemma":[0.000009040005,0.000012056761,0.00009530341,0.000005364287,0.000006253301,0.000050401293,0.000015561267,0.9929022,0.0035762885,0.0014134363,0.001902566,0.000011607641],"about_ca_topic_score_codex":0.0020805409,"about_ca_topic_score_gemma":0.002957256,"teacher_disagreement_score":0.0022409854,"about_ca_system_score_codex":0.0003477154,"about_ca_system_score_gemma":0.00053410325,"threshold_uncertainty_score":0.007496834},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.061254174,0.00014352506,0.93148494,0.00010462303,0.000054069405,0.00008522454,0.00024610636,0.0014269389,0.005200342],"genre_scores_gemma":[0.60953295,0.000117165364,0.38598797,0.000059633076,0.000035733283,0.00010137129,0.00052048545,0.00070738373,0.0029371888],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995944,0.000105935425,0.000014963622,0.00006858988,0.00015910558,0.00005697254],"domain_scores_gemma":[0.99904865,0.0005193497,0.00006654259,0.00014259743,0.00016669612,0.000056122033],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004225395,0.0008227771,0.0011903351,0.00091573066,0.00046063226,0.0008176332,0.0014827529,0.0011751815,0.005240104],"category_scores_gemma":[0.0029977574,0.0008637341,0.00068623485,0.0011491894,0.0005481753,0.0010861165,0.0010777721,0.0008619689,0.00084897625],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000555165,0.000034523488,0.00029642184,0.000030561187,0.000015828662,0.000033619133,0.000029392731,0.9770529,0.0013525402,0.0022312307,0.00073383085,0.018133534],"study_design_scores_gemma":[0.000007053247,0.000007402582,0.000029568537,0.0000011493813,0.0000017796501,0.000005376559,0.000005314878,0.99878865,0.00023412208,0.0007651378,0.00015269946,0.0000017663615],"about_ca_topic_score_codex":0.010823797,"about_ca_topic_score_gemma":0.0144299865,"teacher_disagreement_score":0.010823797,"about_ca_system_score_codex":0.000783789,"about_ca_system_score_gemma":0.0008802832,"threshold_uncertainty_score":0.021521568},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53711766,0.0068739345,0.36613014,0.004768324,0.0004557599,0.00011010473,0.0014329685,0.0005269295,0.08258413],"genre_scores_gemma":[0.8832171,0.005178385,0.08856727,0.00081863307,0.0008323498,0.00017369188,0.0010412899,0.0006860547,0.019485325],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990727,0.00028878837,0.000049964274,0.00020775883,0.00021268144,0.0001679853],"domain_scores_gemma":[0.9915358,0.005430727,0.00091891893,0.00070094183,0.00056247704,0.00085119053],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017326016,0.0012545043,0.0013127414,0.0040349145,0.0010886985,0.0035302006,0.002912317,0.0019005556,0.011525444],"category_scores_gemma":[0.013292493,0.0012041458,0.0009190032,0.0035110814,0.0035831465,0.009206072,0.0034645344,0.0043435055,0.0011447202],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026615843,0.00005019374,0.0015405619,0.00017210754,0.000031547574,0.00008986073,0.000531319,0.018436467,0.0022395276,0.93791264,0.004742799,0.033986755],"study_design_scores_gemma":[0.00004173596,0.0000418375,0.00081257476,0.000084138104,0.00003194753,0.000115798626,0.00027534043,0.041177243,0.000717147,0.9518654,0.00481478,0.000021879769],"about_ca_topic_score_codex":0.0018399162,"about_ca_topic_score_gemma":0.0016538099,"teacher_disagreement_score":0.011525444,"about_ca_system_score_codex":0.0013951223,"about_ca_system_score_gemma":0.00043526344,"threshold_uncertainty_score":0.038556457},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9778742,0.00028312916,0.015589231,0.00007691087,0.00002190008,0.00001767235,0.000085118365,0.00005969352,0.005992122],"genre_scores_gemma":[0.99346536,0.00014827863,0.0044064913,0.000021135942,0.000026011712,0.000022359054,0.000178034,0.000034868983,0.0016973282],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99952686,0.00006762387,0.00004793751,0.00010206353,0.0001392689,0.00011624628],"domain_scores_gemma":[0.9972862,0.00072156335,0.0008585799,0.00024450608,0.00039755856,0.0004916019],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005512935,0.00034747747,0.0006342488,0.0014170457,0.0011744031,0.0015116862,0.00077767606,0.00059337466,0.0035207893],"category_scores_gemma":[0.0038386197,0.00048525963,0.00069259875,0.00054565875,0.0012023877,0.0013006422,0.0012270281,0.00061923225,0.00039899015],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0027309286,0.00042736996,0.07747935,0.0007320345,0.00033702434,0.0145844035,0.005804737,0.08630069,0.15109745,0.6039781,0.004437575,0.05209025],"study_design_scores_gemma":[0.00037593377,0.0020684514,0.085905135,0.00044333306,0.00031129958,0.018882552,0.009669811,0.34948015,0.098927535,0.39056018,0.043099746,0.00027582797],"about_ca_topic_score_codex":0.0010483898,"about_ca_topic_score_gemma":0.0006439212,"teacher_disagreement_score":0.0035207893,"about_ca_system_score_codex":0.001077459,"about_ca_system_score_gemma":0.0002508369,"threshold_uncertainty_score":0.011778176},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5471389,0.0022195235,0.38797572,0.004194591,0.00021762487,0.00012679065,0.0022854148,0.0010458264,0.054795504],"genre_scores_gemma":[0.9192745,0.0012020624,0.06840726,0.00022220454,0.00017683182,0.00007199602,0.00097450713,0.0003966479,0.009273966],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985904,0.000304895,0.0000773714,0.00024033719,0.0005007333,0.00028625657],"domain_scores_gemma":[0.990464,0.007176042,0.0006893959,0.00076823327,0.0004737132,0.0004286069],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011061123,0.0005339307,0.001272121,0.0010956785,0.00090476655,0.0037979123,0.0021094016,0.0016613061,0.015572627],"category_scores_gemma":[0.013981101,0.0008022204,0.0007523843,0.0017245165,0.0019290698,0.009931034,0.0028017408,0.0023659226,0.0010831521],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007437623,0.00013321031,0.0053660134,0.0004129712,0.00006409055,0.00021710356,0.0006286795,0.32613602,0.0046819635,0.538603,0.014354584,0.1086586],"study_design_scores_gemma":[0.00005608997,0.000050847728,0.001143216,0.000030024576,0.000023273218,0.00012954515,0.00019299024,0.560128,0.0014050564,0.43408692,0.002726814,0.000027233911],"about_ca_topic_score_codex":0.0041449033,"about_ca_topic_score_gemma":0.003855014,"teacher_disagreement_score":0.015572627,"about_ca_system_score_codex":0.0014744104,"about_ca_system_score_gemma":0.0009219259,"threshold_uncertainty_score":0.05209565},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40692586,0.00047213043,0.5637405,0.00075113715,0.00006917308,0.000377043,0.0008464977,0.001486211,0.025331471],"genre_scores_gemma":[0.6943868,0.00057322584,0.29819337,0.00016420675,0.00006142925,0.0003490066,0.0012136708,0.00013762328,0.0049207984],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991873,0.00020779773,0.00005302838,0.0001610781,0.00029298282,0.000097802185],"domain_scores_gemma":[0.99737537,0.0010384972,0.0006383715,0.0005032358,0.00027041257,0.00017415894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003023556,0.00088178343,0.0004945516,0.00060250686,0.0005633926,0.0007616658,0.0013631061,0.0006472816,0.0024383618],"category_scores_gemma":[0.0037270712,0.00051482185,0.0006245748,0.00090867194,0.00089047913,0.0022097372,0.0018617236,0.00112538,0.0005985886],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00084011897,0.00024907585,0.0038391072,0.0006192407,0.00007321204,0.0011862963,0.00041311092,0.61029947,0.1020822,0.13627143,0.0042489124,0.13987787],"study_design_scores_gemma":[0.0001259137,0.0008579824,0.003395884,0.00009677618,0.000112152535,0.0017149785,0.0003114258,0.71812415,0.04969814,0.19250445,0.03298301,0.00007518242],"about_ca_topic_score_codex":0.0006094687,"about_ca_topic_score_gemma":0.00081461656,"teacher_disagreement_score":0.0024383618,"about_ca_system_score_codex":0.0005421232,"about_ca_system_score_gemma":0.00040969145,"threshold_uncertainty_score":0.008157134},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03988159,0.0037591353,0.89880085,0.003054768,0.0008562245,0.00005998871,0.0001814137,0.00052027544,0.052885707],"genre_scores_gemma":[0.7059444,0.0036678698,0.19470158,0.0009980825,0.0014253261,0.0003381682,0.00041435054,0.0014466131,0.091063626],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977435,0.0006002867,0.00011771165,0.00038663394,0.00089597073,0.00025584915],"domain_scores_gemma":[0.9901626,0.0055254195,0.0005731547,0.0012953728,0.0017338254,0.00070954993],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030037416,0.0019034722,0.0015291788,0.0035965675,0.0016191409,0.0030931276,0.002673648,0.002931737,0.009667505],"category_scores_gemma":[0.022942323,0.0009499232,0.0010199264,0.001991535,0.0038409468,0.010214293,0.0068761534,0.005407141,0.0018170798],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059670252,0.00002217466,0.00017365986,0.00007805033,0.000014167616,0.000048853555,0.00008687064,0.01353538,0.00084276125,0.96501833,0.0026481065,0.017471863],"study_design_scores_gemma":[0.000010997079,0.000043017426,0.00012939234,0.000026668917,0.00001417708,0.00015450978,0.000029727333,0.10468711,0.0011210283,0.88538605,0.00837212,0.00002513392],"about_ca_topic_score_codex":0.0015653364,"about_ca_topic_score_gemma":0.0009450264,"teacher_disagreement_score":0.009667505,"about_ca_system_score_codex":0.0018801867,"about_ca_system_score_gemma":0.0010801969,"threshold_uncertainty_score":0.032341063},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15267737,0.00045490667,0.8261158,0.0013394884,0.00008290674,0.00016615691,0.00034359057,0.00019089703,0.018628929],"genre_scores_gemma":[0.6999457,0.0014564188,0.28592914,0.00034098423,0.00018867718,0.00055517006,0.0010194394,0.0003782596,0.010186247],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983663,0.00055064156,0.00012745705,0.0003010506,0.00046782952,0.00018669285],"domain_scores_gemma":[0.971467,0.02273024,0.0012501779,0.0017168517,0.0019060627,0.00092964625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040555643,0.0009922406,0.0021441702,0.002270206,0.0016247899,0.0029001571,0.0020856506,0.0032163404,0.007178921],"category_scores_gemma":[0.029199496,0.0010806898,0.0014528414,0.0017340158,0.004856364,0.006121664,0.006218006,0.0030443738,0.0010985516],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0021318495,0.00022686658,0.005440983,0.0008738228,0.00009807321,0.0010958484,0.0013352063,0.17646621,0.02705191,0.7098553,0.004530755,0.07089316],"study_design_scores_gemma":[0.00013631902,0.0003767218,0.0013970227,0.00037409773,0.00008102966,0.00088154,0.0007866951,0.5722776,0.019680716,0.39864734,0.0052744863,0.00008643234],"about_ca_topic_score_codex":0.0004516065,"about_ca_topic_score_gemma":0.0003912827,"teacher_disagreement_score":0.007178921,"about_ca_system_score_codex":0.0009175429,"about_ca_system_score_gemma":0.00085835694,"threshold_uncertainty_score":0.024015903},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11660557,0.00017957226,0.86649364,0.00019299422,0.0001859909,0.00015046382,0.00028408083,0.0019429747,0.013964698],"genre_scores_gemma":[0.45781004,0.0003953888,0.5260818,0.00008174544,0.000039127448,0.00011347088,0.00047444215,0.0009257034,0.014078299],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997148,0.000044814416,0.00001790447,0.00007755446,0.00011597302,0.000028943636],"domain_scores_gemma":[0.9995059,0.00016007005,0.000059146398,0.0001621334,0.00006874607,0.000044076394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026563875,0.0008646383,0.0005626547,0.0010249745,0.00042107483,0.0008994383,0.0008587484,0.00085758447,0.0078118145],"category_scores_gemma":[0.0018022311,0.00080247497,0.00065957813,0.00089565705,0.00063679536,0.0013049529,0.0018713474,0.0013663553,0.0010765371],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019397524,0.00012783427,0.0012826881,0.0003654317,0.00008216437,0.0007566605,0.0006799857,0.26768985,0.062293395,0.13059007,0.010070908,0.5258671],"study_design_scores_gemma":[0.000074138305,0.00023968112,0.00093038706,0.00010146986,0.00008940945,0.00090197916,0.00043407702,0.7809477,0.032231145,0.15072325,0.03325309,0.00007369653],"about_ca_topic_score_codex":0.0011169779,"about_ca_topic_score_gemma":0.002279892,"teacher_disagreement_score":0.0078118145,"about_ca_system_score_codex":0.0003371337,"about_ca_system_score_gemma":0.00023575542,"threshold_uncertainty_score":0.02613312},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016307678,0.000119737415,0.98037887,0.00011341237,0.000055592813,0.000055593766,0.00007797706,0.0006350043,0.002256109],"genre_scores_gemma":[0.20706727,0.00018527114,0.78729665,0.000067792935,0.000050136234,0.00017178712,0.00036577924,0.00024392249,0.0045514065],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99936146,0.00011553225,0.000037261154,0.00008291967,0.00030501085,0.00009785581],"domain_scores_gemma":[0.9990495,0.00040123466,0.00007606036,0.00023083988,0.0001650588,0.000077209384],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007678113,0.0007515365,0.001123046,0.0010059357,0.00065571914,0.0013922063,0.0026037053,0.0013345426,0.0061652716],"category_scores_gemma":[0.0040080007,0.0006015366,0.00078950025,0.002002421,0.0007855424,0.0019546119,0.0027605037,0.0016367502,0.0011936454],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008106515,0.00016899852,0.0007211955,0.0003021408,0.00005507879,0.00013707456,0.0002909345,0.5170786,0.016218355,0.061506074,0.007617738,0.3950931],"study_design_scores_gemma":[0.00004034442,0.000029877418,0.000047599722,0.000008118578,0.0000068671216,0.00001940245,0.000020542027,0.985135,0.0014863798,0.011909519,0.0012904878,0.0000058563483],"about_ca_topic_score_codex":0.0053153937,"about_ca_topic_score_gemma":0.007463755,"teacher_disagreement_score":0.0061652716,"about_ca_system_score_codex":0.0011305258,"about_ca_system_score_gemma":0.0009094281,"threshold_uncertainty_score":0.020624876},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07599007,0.0041477615,0.5693093,0.026897727,0.001954326,0.00016751577,0.0006769133,0.000511752,0.32034472],"genre_scores_gemma":[0.692959,0.004218674,0.19179632,0.0025269291,0.0023235723,0.00026219172,0.0008976106,0.00062240986,0.10439329],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990056,0.00019848884,0.000041043775,0.00016497506,0.00048647,0.000103386155],"domain_scores_gemma":[0.99698395,0.0017719482,0.00020129718,0.0005127549,0.0003608662,0.00016921412],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009100561,0.00057877396,0.00070376555,0.0011985229,0.0025339818,0.0036272837,0.001681795,0.002513268,0.01197959],"category_scores_gemma":[0.009255788,0.0005685228,0.0011420073,0.0017842649,0.00467271,0.00722568,0.0030226505,0.0041666045,0.0013459534],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002637103,0.000012071418,0.00010589606,0.00007075266,0.000003993138,0.000104157705,0.00027996406,0.0026566763,0.00033519889,0.9748871,0.005390634,0.016127184],"study_design_scores_gemma":[0.000008984346,0.0000075126895,0.0001190199,0.000015909765,0.0000044747176,0.00019959855,0.0001739504,0.005433115,0.00045455658,0.97529435,0.018279666,0.000008819863],"about_ca_topic_score_codex":0.0015442873,"about_ca_topic_score_gemma":0.0010544739,"teacher_disagreement_score":0.01197959,"about_ca_system_score_codex":0.0011473551,"about_ca_system_score_gemma":0.00059627567,"threshold_uncertainty_score":0.04007566},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8003844,0.00072865497,0.17927022,0.00039818056,0.00009453938,0.000045510762,0.00041149696,0.00021060323,0.018456372],"genre_scores_gemma":[0.94328934,0.0006830922,0.049698688,0.00007681227,0.00007969651,0.00006530541,0.00047285066,0.000118837175,0.005515352],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99942374,0.00012699976,0.000029478455,0.00014721176,0.00019274573,0.00007989298],"domain_scores_gemma":[0.9957367,0.0022841748,0.0008274079,0.0003653704,0.00033909356,0.00044710457],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085971167,0.0005905722,0.0005826067,0.0034124418,0.00091218384,0.0020032998,0.0014105211,0.0010054087,0.005135234],"category_scores_gemma":[0.008026461,0.0004975186,0.00045225813,0.0027262424,0.0015194968,0.0032279936,0.0012178342,0.0011327098,0.00034985444],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046391785,0.0001615878,0.008901457,0.00027419123,0.00009761572,0.00031740803,0.00047666422,0.1993831,0.014208932,0.69915205,0.0034768467,0.07308628],"study_design_scores_gemma":[0.00002954887,0.00007581533,0.005049574,0.000041865733,0.00006844121,0.00041767725,0.00021943482,0.29555407,0.0053246287,0.68959796,0.003586843,0.00003417372],"about_ca_topic_score_codex":0.000602516,"about_ca_topic_score_gemma":0.0007451412,"teacher_disagreement_score":0.005135234,"about_ca_system_score_codex":0.0009226539,"about_ca_system_score_gemma":0.00031061168,"threshold_uncertainty_score":0.017179072},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27552116,0.00042829578,0.71380025,0.00019258953,0.00008244468,0.00005383962,0.00060256105,0.0016286061,0.0076902322],"genre_scores_gemma":[0.9108436,0.00010107013,0.08725754,0.000018592735,0.000022387352,0.000026981621,0.00042112995,0.00017367885,0.0011351305],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995958,0.00004963879,0.000022288345,0.000049679704,0.00023206521,0.00005059611],"domain_scores_gemma":[0.99866986,0.00054959056,0.00011679841,0.0002977564,0.00025791954,0.00010815002],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004427478,0.0004470341,0.001182281,0.0017488478,0.0006342542,0.0018260368,0.0015917791,0.00091997435,0.004560465],"category_scores_gemma":[0.003749793,0.00045821615,0.00051111344,0.0014346616,0.0010823512,0.002896982,0.0017377804,0.0007833585,0.0008394284],"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.00044699086,0.00014490246,0.0064884233,0.000377767,0.00008668247,0.00040746748,0.000711604,0.6100003,0.010621658,0.20485441,0.0042946963,0.16156505],"study_design_scores_gemma":[0.000023277853,0.000018968576,0.0005223291,0.0000075028506,0.000005096319,0.000050622108,0.00006276958,0.95539653,0.0014258183,0.041627716,0.0008471607,0.000012169319],"about_ca_topic_score_codex":0.0049557206,"about_ca_topic_score_gemma":0.008559536,"teacher_disagreement_score":0.0049557206,"about_ca_system_score_codex":0.0010973639,"about_ca_system_score_gemma":0.0010794325,"threshold_uncertainty_score":0.015256286},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08690856,0.0017595838,0.88258976,0.0022367924,0.0002622969,0.00052273483,0.005565465,0.0058007995,0.014353995],"genre_scores_gemma":[0.63405436,0.0011550642,0.34471357,0.00045703436,0.00022821141,0.00036563203,0.010721299,0.0014024632,0.006902455],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9942345,0.0015071325,0.00056283124,0.00078755827,0.0024379543,0.00046996583],"domain_scores_gemma":[0.9886875,0.0076336223,0.00040506382,0.0021360707,0.00075340096,0.00038432685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021571994,0.00086653937,0.002610951,0.0025936512,0.0015298963,0.0049763895,0.0022838002,0.0027645994,0.009419074],"category_scores_gemma":[0.028033454,0.00089230185,0.0012523696,0.0053775236,0.0015727661,0.012538076,0.0062090848,0.0019118168,0.0021568318],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0021626528,0.00037349027,0.005924363,0.0012150764,0.00022702325,0.000906805,0.0018212663,0.16428457,0.0064574736,0.4594012,0.060456045,0.29677007],"study_design_scores_gemma":[0.00018476273,0.00009341147,0.00037846479,0.00008395795,0.000058620484,0.00039634033,0.00054655387,0.395637,0.0066718236,0.5631127,0.032802336,0.00003404345],"about_ca_topic_score_codex":0.0029592335,"about_ca_topic_score_gemma":0.003294443,"teacher_disagreement_score":0.009419074,"about_ca_system_score_codex":0.0017540284,"about_ca_system_score_gemma":0.001035726,"threshold_uncertainty_score":0.031509995},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014792796,0.0039568082,0.9348606,0.00878236,0.0017354339,0.00011495525,0.00045741658,0.00033099868,0.03496858],"genre_scores_gemma":[0.31083307,0.015527997,0.62267905,0.004164635,0.005808912,0.0008580853,0.0016530944,0.002031235,0.03644394],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9943125,0.0022716308,0.0003242541,0.0012840157,0.0014325274,0.00037494977],"domain_scores_gemma":[0.9504348,0.042353317,0.00097130344,0.0036262556,0.001914859,0.00069941377],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0069260886,0.0018477426,0.002571652,0.0021142582,0.0027761976,0.003915034,0.006257327,0.0033371972,0.013276804],"category_scores_gemma":[0.058478795,0.0013907606,0.0038651277,0.0037431153,0.007807569,0.014761781,0.0083297575,0.017214794,0.002025852],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003402289,0.000101058344,0.000537367,0.0007623757,0.000110004534,0.00040559535,0.0004944986,0.09888848,0.0023849076,0.8098644,0.021036157,0.065074906],"study_design_scores_gemma":[0.000038810165,0.000050699793,0.00013212048,0.000099770856,0.000033557433,0.00010159913,0.00006130534,0.116830826,0.00088069343,0.8684462,0.01328362,0.000040907587],"about_ca_topic_score_codex":0.0042118765,"about_ca_topic_score_gemma":0.0022281394,"teacher_disagreement_score":0.013276804,"about_ca_system_score_codex":0.0016614754,"about_ca_system_score_gemma":0.0019699447,"threshold_uncertainty_score":0.044415355},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09001806,0.0001246646,0.88951844,0.00013598503,0.00005260379,0.00009823765,0.00029108132,0.0010472729,0.018713607],"genre_scores_gemma":[0.60317653,0.0002813069,0.36936775,0.00016975148,0.000031010568,0.00014197531,0.0012323689,0.0007050973,0.024894131],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993331,0.000121581164,0.000027692284,0.00018912027,0.00022292783,0.00010570471],"domain_scores_gemma":[0.9985164,0.00046359317,0.00015599495,0.00035632422,0.0003674059,0.00014018147],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038940037,0.00091147446,0.0006277598,0.0013917324,0.000773449,0.0018051751,0.0018679012,0.0011410568,0.008480137],"category_scores_gemma":[0.0026574237,0.00081825745,0.00071590894,0.0016193559,0.00085570704,0.0026358312,0.0028410894,0.0012662346,0.0018817694],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033655186,0.00016360103,0.0025354568,0.00029425262,0.00007111722,0.0009827762,0.0007215811,0.27266514,0.039374363,0.52193886,0.0077671995,0.15314914],"study_design_scores_gemma":[0.00004086007,0.00012041118,0.0008961168,0.000063645566,0.000050914703,0.00052675867,0.00038470776,0.5954083,0.02125302,0.36009338,0.021125318,0.000036581216],"about_ca_topic_score_codex":0.0021471484,"about_ca_topic_score_gemma":0.0025785055,"teacher_disagreement_score":0.008480137,"about_ca_system_score_codex":0.0007936523,"about_ca_system_score_gemma":0.00043215312,"threshold_uncertainty_score":0.02836889},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017827531,0.0010404068,0.97108614,0.0014502765,0.00024253369,0.000111665184,0.0002706916,0.0009564945,0.0070142727],"genre_scores_gemma":[0.19474596,0.0016262833,0.780612,0.0005704462,0.0006210969,0.00045110966,0.0017542114,0.0009447174,0.018674165],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99825484,0.000383128,0.00012744246,0.0005649902,0.00048789152,0.00018163599],"domain_scores_gemma":[0.9853262,0.010579658,0.0006842767,0.002005394,0.0009568846,0.00044758208],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026680897,0.0019469721,0.0022643749,0.0032417807,0.0017039354,0.0044778395,0.0061275824,0.0034654222,0.014865583],"category_scores_gemma":[0.021481896,0.0014484788,0.0021793968,0.003906838,0.0034046925,0.013371513,0.0056602224,0.006286112,0.002647228],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039879375,0.0003238734,0.0014464533,0.00071063865,0.000107681546,0.00011528859,0.0005655286,0.091806434,0.0023569942,0.53740114,0.026478838,0.33828825],"study_design_scores_gemma":[0.00008086071,0.000041745094,0.00015990905,0.0000487969,0.000037199738,0.0000889814,0.00012602957,0.25102812,0.001271995,0.74151325,0.0055819065,0.000021277148],"about_ca_topic_score_codex":0.0016426139,"about_ca_topic_score_gemma":0.002267773,"teacher_disagreement_score":0.014865583,"about_ca_system_score_codex":0.0020162505,"about_ca_system_score_gemma":0.0010630069,"threshold_uncertainty_score":0.0497303},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033691912,0.00004454971,0.9944155,0.00002559983,0.000019731051,0.000032676548,0.00004175757,0.000579014,0.0014720113],"genre_scores_gemma":[0.06617462,0.000086063796,0.93186826,0.000042829295,0.000013846676,0.0001530363,0.0002522954,0.00025759166,0.0011514543],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99949265,0.000102250604,0.0000302147,0.00006431422,0.0002665491,0.000043923028],"domain_scores_gemma":[0.99956113,0.00014494814,0.000033931825,0.00013325337,0.00010308685,0.000023620782],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054536783,0.00060089276,0.0005959677,0.00070472795,0.000562218,0.00046847697,0.0010700953,0.00053273304,0.0032239181],"category_scores_gemma":[0.0013626997,0.0004179729,0.0009389056,0.0006556529,0.00043824108,0.0007494111,0.0012247616,0.0009036142,0.0010611113],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011472099,0.00010431101,0.0017417213,0.00031745888,0.00007406316,0.00020594161,0.0003265228,0.61467785,0.041358307,0.06085625,0.006716385,0.27350646],"study_design_scores_gemma":[0.000018237173,0.000023900659,0.00018452157,0.000010820244,0.00000841671,0.000046392233,0.000022958573,0.97966546,0.0043770373,0.008300716,0.0073298845,0.00001157948],"about_ca_topic_score_codex":0.0034714213,"about_ca_topic_score_gemma":0.0047301804,"teacher_disagreement_score":0.0034714213,"about_ca_system_score_codex":0.0004574456,"about_ca_system_score_gemma":0.00086330634,"threshold_uncertainty_score":0.010785103},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10804064,0.0013511644,0.6957539,0.0013467455,0.00088155107,0.0001329937,0.00075653434,0.0013526911,0.19038378],"genre_scores_gemma":[0.64177936,0.0014806469,0.25787616,0.0005526258,0.00034923677,0.0002731551,0.0019321252,0.0025527421,0.093203865],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990841,0.0002445279,0.000059174006,0.00019797016,0.0002705067,0.00014370627],"domain_scores_gemma":[0.998809,0.000491948,0.00008200688,0.00029798114,0.00018700502,0.00013203427],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006684312,0.0009848276,0.0009632366,0.0021949136,0.0025665956,0.003420579,0.0015948617,0.001090607,0.013047192],"category_scores_gemma":[0.0043700207,0.0011879478,0.001641243,0.0014754604,0.0031420141,0.0037959698,0.005318884,0.004490439,0.0031283721],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033046228,0.000010161694,0.000086462096,0.00006154133,0.000006380275,0.00008258001,0.00025825642,0.0012693292,0.0006025149,0.9838489,0.0026950412,0.011045755],"study_design_scores_gemma":[0.000016568807,0.0000199959,0.00013376007,0.000045996687,0.000022772227,0.00024715473,0.00020880406,0.0060929647,0.0020366868,0.9581545,0.033003252,0.000017537974],"about_ca_topic_score_codex":0.00062315486,"about_ca_topic_score_gemma":0.0006462627,"teacher_disagreement_score":0.013047192,"about_ca_system_score_codex":0.0011538739,"about_ca_system_score_gemma":0.00054222887,"threshold_uncertainty_score":0.04364717},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82542074,0.00066116476,0.14461109,0.0005691571,0.00012074823,0.0000916824,0.00030908434,0.00023017671,0.027986072],"genre_scores_gemma":[0.9444931,0.00046510674,0.048010927,0.00008638306,0.000101918646,0.00011294165,0.0007397015,0.000094669325,0.0058953064],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978818,0.0006683701,0.0001069232,0.00037582254,0.00057611725,0.000390947],"domain_scores_gemma":[0.99256825,0.004247607,0.0011889214,0.0005965338,0.0008181661,0.00058046967],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010923934,0.00071257603,0.0011830402,0.0019437697,0.0035526918,0.0022803294,0.0021501193,0.00271987,0.008004975],"category_scores_gemma":[0.009377203,0.0011038838,0.0008711486,0.0022071714,0.0023185285,0.00367799,0.0028828639,0.0017493906,0.0010363464],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019221525,0.00023097055,0.011926152,0.0005249623,0.00018230059,0.004854203,0.002608697,0.19099367,0.009377008,0.6943876,0.010080151,0.072912104],"study_design_scores_gemma":[0.00019644284,0.00028935572,0.004402237,0.00019071368,0.000076872086,0.0019966085,0.0025711248,0.4321369,0.012532134,0.529705,0.015773313,0.00012936654],"about_ca_topic_score_codex":0.0018066164,"about_ca_topic_score_gemma":0.0010713087,"teacher_disagreement_score":0.008004975,"about_ca_system_score_codex":0.0013420046,"about_ca_system_score_gemma":0.00038906327,"threshold_uncertainty_score":0.026779294},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016237069,0.00019295655,0.97716093,0.00013482606,0.0000851851,0.00007536798,0.000071743045,0.00069376995,0.005348104],"genre_scores_gemma":[0.43540958,0.00029115338,0.5555293,0.00017295517,0.0000732478,0.00014430481,0.00040205344,0.00061938516,0.007358022],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990243,0.00016127912,0.000031512893,0.000082693994,0.00064352935,0.000056657187],"domain_scores_gemma":[0.9985856,0.00041250675,0.00006978527,0.000494934,0.00038449562,0.000052744846],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009825302,0.00067152164,0.0010225631,0.0010284637,0.00038467182,0.0012882862,0.0011662001,0.0014405842,0.008078501],"category_scores_gemma":[0.005093899,0.00051086943,0.00066977163,0.0008417672,0.0007541332,0.0010155999,0.0017521925,0.0010434492,0.0014810552],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00053605146,0.0001094237,0.0016134765,0.00023042975,0.00006599934,0.00018643143,0.00012836153,0.5822651,0.027305935,0.045740113,0.0060698637,0.3357489],"study_design_scores_gemma":[0.000026199154,0.000041381492,0.00019577221,0.000008703041,0.000010014121,0.000106002706,0.000015148944,0.98404247,0.0051736217,0.008120452,0.002252116,0.000008177512],"about_ca_topic_score_codex":0.0011431032,"about_ca_topic_score_gemma":0.0017695045,"teacher_disagreement_score":0.008078501,"about_ca_system_score_codex":0.000695894,"about_ca_system_score_gemma":0.00060936535,"threshold_uncertainty_score":0.027025223},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13619338,0.0023157997,0.84273577,0.0019570817,0.00015870825,0.000055369976,0.0003150821,0.00030675996,0.015962105],"genre_scores_gemma":[0.8104047,0.0026834072,0.17792541,0.00022598807,0.00037066825,0.000105271254,0.00051472796,0.00023898616,0.007530763],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99917907,0.00021946063,0.00005247897,0.00017679573,0.00027325083,0.000098923476],"domain_scores_gemma":[0.990752,0.006177518,0.0009495017,0.0009818681,0.0006162528,0.0005228576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00108732,0.00072881434,0.0012704742,0.0019494996,0.0013268852,0.004734953,0.002174817,0.0019496054,0.004293597],"category_scores_gemma":[0.011075059,0.00076374674,0.0010638022,0.0023719133,0.0043286444,0.008462311,0.004287247,0.0030208,0.00043619424],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008963648,0.000033273845,0.00093846803,0.00012912553,0.000017517956,0.0000960126,0.00024492294,0.021093344,0.0015718759,0.9448983,0.0020859458,0.02880159],"study_design_scores_gemma":[0.000011973919,0.000010715841,0.0002338283,0.00001439715,0.0000073620736,0.00008115581,0.00006737601,0.095417134,0.0006025452,0.9018041,0.0017387128,0.000010685635],"about_ca_topic_score_codex":0.0016546273,"about_ca_topic_score_gemma":0.0012221355,"teacher_disagreement_score":0.004734953,"about_ca_system_score_codex":0.0010839929,"about_ca_system_score_gemma":0.0006252227,"threshold_uncertainty_score":0.014363468},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026696954,0.00032654803,0.9578785,0.00011334186,0.00006815318,0.00008916121,0.00024269185,0.0037189533,0.0108657265],"genre_scores_gemma":[0.201722,0.00032992393,0.78922266,0.00010371769,0.000056018664,0.00021148866,0.0010866687,0.00079330645,0.006474266],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994709,0.00005483379,0.000035060937,0.00011085268,0.00022711486,0.000101295765],"domain_scores_gemma":[0.99914575,0.0003289095,0.0000819047,0.00024170666,0.00015254879,0.000049119175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003566133,0.0015359634,0.00084743055,0.0014131712,0.0006760877,0.0012864849,0.0022280249,0.00085579586,0.012530044],"category_scores_gemma":[0.0027057235,0.00048657603,0.00084047805,0.002397415,0.0006954806,0.002940547,0.0029481703,0.0012527723,0.0030032236],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038499187,0.00024101231,0.0012940153,0.00044533057,0.00006529883,0.00013540906,0.00029775468,0.16743201,0.018633267,0.0648122,0.014784509,0.73147416],"study_design_scores_gemma":[0.00012394774,0.00013395312,0.0003819993,0.000037607642,0.00004211069,0.00011117482,0.00020210065,0.865157,0.018179804,0.10703235,0.008571619,0.000026337873],"about_ca_topic_score_codex":0.001919561,"about_ca_topic_score_gemma":0.0049260645,"teacher_disagreement_score":0.012530044,"about_ca_system_score_codex":0.00070938305,"about_ca_system_score_gemma":0.00083899335,"threshold_uncertainty_score":0.041917205},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10766142,0.00043377717,0.84311306,0.0004130828,0.00015668049,0.00017696022,0.0011976304,0.001255149,0.045592263],"genre_scores_gemma":[0.55545443,0.0011888705,0.41458338,0.00013877919,0.000041629348,0.00022715818,0.0020912788,0.00055696745,0.025717357],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99963415,0.00010552742,0.000020986963,0.00006461734,0.00011779398,0.000056928533],"domain_scores_gemma":[0.9991259,0.00035349018,0.00009754319,0.00019424902,0.00014654954,0.00008236049],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020424169,0.0005431217,0.00053781795,0.00090820197,0.0005357517,0.0014785053,0.0011225974,0.0007633432,0.012951842],"category_scores_gemma":[0.0019321007,0.0005697455,0.0004801292,0.0014953293,0.0006625187,0.0010566576,0.0010772239,0.0010694931,0.001985714],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002697178,0.000082416096,0.0014445877,0.00039937886,0.000042124022,0.0006260344,0.0006309863,0.26153535,0.014958266,0.5358246,0.016371265,0.16781533],"study_design_scores_gemma":[0.000107413296,0.000060235066,0.0010737506,0.000084670966,0.000029609477,0.00044082015,0.00030509703,0.3948344,0.007144202,0.5423575,0.0535241,0.000038126473],"about_ca_topic_score_codex":0.0027892392,"about_ca_topic_score_gemma":0.0047929035,"teacher_disagreement_score":0.012951842,"about_ca_system_score_codex":0.0006179505,"about_ca_system_score_gemma":0.0003518038,"threshold_uncertainty_score":0.043328285},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016087709,0.000173135,0.97833705,0.000048189948,0.00005059572,0.000080297476,0.00021943203,0.0018603508,0.0031433164],"genre_scores_gemma":[0.1686904,0.00029631378,0.82454634,0.0000393281,0.00004876765,0.00018509928,0.0020445087,0.0006636308,0.003485634],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974368,0.00024826705,0.00016042967,0.000567758,0.0013285357,0.00025831448],"domain_scores_gemma":[0.9976803,0.00084377103,0.0002517418,0.0003397219,0.00078876753,0.000095618576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007691163,0.0015185738,0.002202107,0.0035722298,0.0015308631,0.003219811,0.002834885,0.0014098905,0.016828377],"category_scores_gemma":[0.00760552,0.00083021435,0.0012517972,0.0031426656,0.00094567623,0.005095412,0.0038242927,0.0016799035,0.0061729397],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00059864187,0.00018009568,0.004031241,0.00063246366,0.00015329807,0.0006252393,0.0006386174,0.16866153,0.019697772,0.08589624,0.010822366,0.70806247],"study_design_scores_gemma":[0.000103134174,0.00029381004,0.0011101831,0.000105658604,0.0000671329,0.00074027444,0.00057389267,0.81469786,0.047165144,0.101850115,0.033174902,0.000117891825],"about_ca_topic_score_codex":0.0016605502,"about_ca_topic_score_gemma":0.0013647551,"teacher_disagreement_score":0.016828377,"about_ca_system_score_codex":0.0009937576,"about_ca_system_score_gemma":0.0010518784,"threshold_uncertainty_score":0.056296587},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04762813,0.0015371668,0.94312125,0.00028155508,0.00037982923,0.00013833727,0.00011096585,0.0015681485,0.0052346694],"genre_scores_gemma":[0.3656607,0.002085486,0.6262437,0.00014877121,0.000120717596,0.00021994564,0.00056463765,0.0009853275,0.003970743],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981286,0.00036576795,0.000118437114,0.00012269967,0.0011766155,0.00008789613],"domain_scores_gemma":[0.9948933,0.002613545,0.0002405483,0.00084455014,0.0012668325,0.00014123032],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015956652,0.00047384773,0.00072184927,0.0014723642,0.00048285385,0.0009899659,0.0007948239,0.0008192999,0.0013773363],"category_scores_gemma":[0.009712016,0.00025696456,0.00085788226,0.0013447125,0.000463466,0.00097417104,0.0009885926,0.00079289946,0.000499268],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009935681,0.00020254256,0.003911954,0.000983428,0.00025660443,0.00021484212,0.000720792,0.24740106,0.042232648,0.02959643,0.0038258021,0.66966033],"study_design_scores_gemma":[0.00013467376,0.00048793765,0.004129426,0.00015496789,0.00012514628,0.00041033182,0.00035115384,0.9108974,0.049379557,0.012352356,0.021475608,0.00010148041],"about_ca_topic_score_codex":0.0014979808,"about_ca_topic_score_gemma":0.0014336789,"teacher_disagreement_score":0.0015956652,"about_ca_system_score_codex":0.0002731234,"about_ca_system_score_gemma":0.0006731158,"threshold_uncertainty_score":0.008438766},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04319636,0.0023017053,0.6623841,0.0033836395,0.0015084936,0.00012065031,0.0007824849,0.0007760773,0.28554648],"genre_scores_gemma":[0.57522786,0.0034765243,0.20328186,0.003353367,0.0020943112,0.0004772771,0.001761594,0.0020401056,0.20828712],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99891746,0.000159045,0.00005493162,0.00027644954,0.0004600759,0.00013201336],"domain_scores_gemma":[0.9979911,0.00084925507,0.00010982727,0.0005948136,0.00029453513,0.0001604475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011184968,0.0009724684,0.0013507206,0.0026925476,0.0026326878,0.004369892,0.0018458473,0.002057775,0.021235129],"category_scores_gemma":[0.006747865,0.00077592285,0.0020482205,0.0013051492,0.003918386,0.005826911,0.005604214,0.005986396,0.003936652],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000399465,0.000015190712,0.00012914222,0.000074277705,0.000017435063,0.000038757225,0.00012429712,0.0023496733,0.00068316556,0.966247,0.008729663,0.02155144],"study_design_scores_gemma":[0.0000128895745,0.000014783566,0.00019571235,0.00003079829,0.000014137607,0.000100267236,0.000037439626,0.009820439,0.00081649655,0.97261727,0.01632245,0.000017207376],"about_ca_topic_score_codex":0.0013836187,"about_ca_topic_score_gemma":0.0012976138,"teacher_disagreement_score":0.021235129,"about_ca_system_score_codex":0.0010053718,"about_ca_system_score_gemma":0.00066580356,"threshold_uncertainty_score":0.071038604},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16974276,0.00019392703,0.8030771,0.00027175827,0.00010739441,0.0003430362,0.0017024276,0.0018171077,0.022744518],"genre_scores_gemma":[0.79441947,0.00020860495,0.1899374,0.0001200864,0.00006120978,0.00026924998,0.003730559,0.0007284181,0.010525024],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968886,0.00044384916,0.00016592361,0.0010265281,0.0012038888,0.00027136458],"domain_scores_gemma":[0.9907554,0.003939094,0.0008041754,0.0024771374,0.0013413095,0.00068286713],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012404136,0.0006679237,0.0009641052,0.0037144755,0.0013750219,0.0036704317,0.0023612306,0.0019356672,0.017968917],"category_scores_gemma":[0.021665957,0.0008237008,0.001183486,0.0026374615,0.0014329037,0.0068350234,0.003858995,0.0015245932,0.0023258517],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011353216,0.0005138443,0.016348576,0.00062058534,0.00019067568,0.002237748,0.0021429036,0.058472987,0.029818306,0.5876153,0.008149594,0.2927543],"study_design_scores_gemma":[0.0000686439,0.00019865081,0.004067395,0.00011332922,0.00012675444,0.0009507632,0.0011465433,0.22404307,0.03462746,0.7168584,0.01774846,0.00005042804],"about_ca_topic_score_codex":0.0018604172,"about_ca_topic_score_gemma":0.002083972,"teacher_disagreement_score":0.017968917,"about_ca_system_score_codex":0.00077231514,"about_ca_system_score_gemma":0.0005997639,"threshold_uncertainty_score":0.06011206},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022009661,0.0006898856,0.95307374,0.0008493785,0.00020730503,0.00021830597,0.0007512034,0.00015177496,0.02204879],"genre_scores_gemma":[0.31649464,0.000937771,0.6531709,0.00051404774,0.00044931477,0.0009645384,0.0012573169,0.00060439593,0.025607133],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991574,0.0003613228,0.00003313339,0.00013899562,0.00017081448,0.00013837345],"domain_scores_gemma":[0.9982882,0.0012444856,0.00013797345,0.000075412536,0.00012921765,0.00012468215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017362525,0.0018294392,0.0019743934,0.0011731152,0.0007001601,0.002855141,0.0027399294,0.0031655142,0.0149770165],"category_scores_gemma":[0.0050925747,0.0016275157,0.0015347551,0.0016304486,0.0012127571,0.0024602907,0.0022658242,0.0020329035,0.0010750679],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000064889675,0.00006175957,0.00023027732,0.00022035016,0.00003517834,0.00013487267,0.000056129546,0.91637415,0.0005418631,0.066078395,0.003683675,0.012518523],"study_design_scores_gemma":[0.000015309037,0.000019429921,0.000041454095,0.000022950879,0.000008566839,0.000024608755,0.000032184817,0.9787088,0.00013509295,0.019590948,0.00139448,0.0000062570566],"about_ca_topic_score_codex":0.004619656,"about_ca_topic_score_gemma":0.0036631166,"teacher_disagreement_score":0.0149770165,"about_ca_system_score_codex":0.0013465438,"about_ca_system_score_gemma":0.0011343387,"threshold_uncertainty_score":0.05010307},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053926732,0.0045089596,0.8423297,0.010553881,0.0009248009,0.0002837981,0.0008556412,0.0010280142,0.08558851],"genre_scores_gemma":[0.37392983,0.0065739285,0.52952534,0.005100151,0.0019447624,0.00047263855,0.0030211937,0.0013558023,0.07807636],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99782914,0.0005752523,0.00008188199,0.000687403,0.00052233407,0.00030404635],"domain_scores_gemma":[0.99630487,0.0017896487,0.00024358807,0.0011541063,0.00031475927,0.00019310352],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001729277,0.001675909,0.0014282329,0.0013146157,0.0027456551,0.0030151429,0.002981183,0.0032110037,0.027666353],"category_scores_gemma":[0.006876854,0.00089136575,0.0026521601,0.003740696,0.0037485356,0.013856897,0.0035999685,0.0045868694,0.0032805547],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017220617,0.0001530223,0.0010452085,0.0003717263,0.000056864905,0.000326114,0.0006145569,0.049023602,0.0020825416,0.8258211,0.030048624,0.090284415],"study_design_scores_gemma":[0.000078203266,0.0001318121,0.0005933585,0.00012552759,0.000041479132,0.0005097388,0.00029809133,0.059668165,0.0015697601,0.86182094,0.075102225,0.000060679235],"about_ca_topic_score_codex":0.0051961965,"about_ca_topic_score_gemma":0.0051000626,"teacher_disagreement_score":0.027666353,"about_ca_system_score_codex":0.0023090304,"about_ca_system_score_gemma":0.0011215995,"threshold_uncertainty_score":0.0925532},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6403646,0.00087194564,0.34847382,0.00043844766,0.00016465041,0.00044183127,0.00016636644,0.0016306891,0.007447698],"genre_scores_gemma":[0.8653333,0.00021223715,0.13294794,0.000059640177,0.000027952494,0.000116705894,0.00027150518,0.000089093395,0.0009414694],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986947,0.0004533144,0.00012041731,0.00020516284,0.0003760833,0.00015031607],"domain_scores_gemma":[0.99269027,0.0051605045,0.00031451313,0.00085020496,0.0006952064,0.00028921716],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027471294,0.0006956699,0.00075100287,0.0011289417,0.0005192237,0.001123673,0.0016025793,0.0010875708,0.0010530861],"category_scores_gemma":[0.011457574,0.00027040104,0.0004865213,0.0007513196,0.0005684729,0.0020857023,0.0010906559,0.00079737365,0.00023984096],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018310967,0.0007560269,0.005567301,0.00018896563,0.0001707395,0.000059222475,0.00023199966,0.740279,0.0077726897,0.013462897,0.0020921526,0.22758797],"study_design_scores_gemma":[0.000059683734,0.00019167367,0.0007538848,0.000004169476,0.000013468183,0.000022752381,0.00006051802,0.9925558,0.0027922778,0.0031322828,0.0004048864,0.000008600636],"about_ca_topic_score_codex":0.003721143,"about_ca_topic_score_gemma":0.0025733355,"teacher_disagreement_score":0.003721143,"about_ca_system_score_codex":0.001115985,"about_ca_system_score_gemma":0.0006967265,"threshold_uncertainty_score":0.014528394},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6731862,0.00070586917,0.30211633,0.0004995035,0.00032020418,0.00037900478,0.0015774872,0.006708836,0.014506621],"genre_scores_gemma":[0.8681135,0.00037786955,0.12439871,0.0000792675,0.00001843064,0.00011418776,0.0013309674,0.0010884776,0.00447846],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99945027,0.00009538702,0.000036379024,0.00009961025,0.00021028207,0.00010812425],"domain_scores_gemma":[0.99757487,0.0012689121,0.000098037,0.0006121846,0.00031697596,0.00012914451],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007897738,0.0011720458,0.0009494039,0.0008102244,0.0005205056,0.0010035473,0.0015375688,0.001361562,0.008343531],"category_scores_gemma":[0.004026209,0.0005053195,0.0006535193,0.0013392965,0.00061146007,0.0016738693,0.0013571093,0.0014028796,0.0012496718],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0026005162,0.0017819987,0.0010601676,0.00094554573,0.00020372927,0.0003197215,0.0005178051,0.63811296,0.21754903,0.0064716446,0.0056164186,0.12482043],"study_design_scores_gemma":[0.00020225128,0.0009975024,0.00076612015,0.00003483972,0.00006867387,0.000107357075,0.00027655863,0.87580377,0.115289964,0.003059108,0.0033437584,0.000050131024],"about_ca_topic_score_codex":0.0045358385,"about_ca_topic_score_gemma":0.0023890552,"teacher_disagreement_score":0.008343531,"about_ca_system_score_codex":0.00044705966,"about_ca_system_score_gemma":0.00058113236,"threshold_uncertainty_score":0.027911842},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029754988,0.000072933304,0.9931028,0.000032216205,0.000031856824,0.000053076612,0.00007257764,0.002516582,0.0011424078],"genre_scores_gemma":[0.030137783,0.0000805903,0.96512866,0.000047308193,0.000017388233,0.00006328248,0.00046669407,0.00035600385,0.0037023153],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992943,0.00004924703,0.000052733376,0.00020250966,0.0003451606,0.000056067292],"domain_scores_gemma":[0.99918276,0.00013909183,0.000038472794,0.0003104643,0.00026632697,0.00006287322],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061172585,0.0012243598,0.001621045,0.0018323471,0.0009954756,0.0011288926,0.0025464552,0.0017073334,0.014949979],"category_scores_gemma":[0.0017538305,0.0009125711,0.0014576446,0.001590068,0.000672681,0.0018967955,0.0036634754,0.0014315275,0.0059850574],"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.00012381077,0.000094060466,0.0006351268,0.00016907939,0.00008348409,0.00011998148,0.00007155225,0.035369627,0.025028128,0.008150987,0.007321644,0.9228325],"study_design_scores_gemma":[0.000096314165,0.00016379249,0.0011598432,0.0000389829,0.000117328134,0.0006509914,0.00007795193,0.9206171,0.03386972,0.023516143,0.019626169,0.000065620574],"about_ca_topic_score_codex":0.0019995482,"about_ca_topic_score_gemma":0.0038477657,"teacher_disagreement_score":0.014949979,"about_ca_system_score_codex":0.00036246947,"about_ca_system_score_gemma":0.0014544618,"threshold_uncertainty_score":0.050012648},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8619854,0.0022179177,0.110737324,0.0012509356,0.0001450535,0.000061774976,0.0007859082,0.0004858635,0.02232987],"genre_scores_gemma":[0.97621834,0.0009720446,0.019723581,0.000073988296,0.0001114266,0.000056548226,0.00038887808,0.00018975735,0.0022654405],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992404,0.00018299159,0.000054121,0.00012672241,0.00029457128,0.00010125869],"domain_scores_gemma":[0.9880531,0.008345018,0.00083169434,0.0008600434,0.00085845945,0.0010517903],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094669854,0.00045967512,0.0007901291,0.0015205177,0.0007565875,0.001984093,0.0013605179,0.0012552531,0.0044354643],"category_scores_gemma":[0.020402066,0.0006081272,0.00029263538,0.0010529632,0.001292298,0.003937548,0.0017946135,0.0008139675,0.00037337467],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011560497,0.00016960522,0.008157542,0.0005642998,0.00007983203,0.00060458115,0.0013948557,0.12678623,0.043456417,0.684347,0.011418901,0.121864714],"study_design_scores_gemma":[0.000094169016,0.00023458648,0.0066614533,0.00011725381,0.00007126814,0.0011425605,0.0009209486,0.44282255,0.017735546,0.5220011,0.008136082,0.00006249458],"about_ca_topic_score_codex":0.0004907734,"about_ca_topic_score_gemma":0.00031680395,"teacher_disagreement_score":0.0044354643,"about_ca_system_score_codex":0.0005423224,"about_ca_system_score_gemma":0.00033058453,"threshold_uncertainty_score":0.01483804},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1204813,0.0015849055,0.8587426,0.00051594124,0.00007759667,0.00007392141,0.0006695701,0.0006658465,0.017188396],"genre_scores_gemma":[0.8108711,0.0013682033,0.17914528,0.00013517177,0.00034215505,0.00019211984,0.0015332849,0.0006564226,0.005756169],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996405,0.0006494544,0.00020526796,0.0009025084,0.0014375725,0.0004002474],"domain_scores_gemma":[0.96504563,0.023382707,0.0038953673,0.0023871316,0.003841905,0.0014472514],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003792771,0.0013034801,0.0011003106,0.0071825106,0.0009828283,0.00506117,0.0028679792,0.0014970518,0.006624618],"category_scores_gemma":[0.041542403,0.0012212495,0.001639037,0.002177958,0.004070638,0.010081308,0.00441529,0.0030077468,0.000844576],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026537388,0.00004568892,0.0050472277,0.0005211783,0.000076133925,0.00022328083,0.00086868485,0.049205527,0.00978405,0.8965443,0.0018245145,0.035594076],"study_design_scores_gemma":[0.000032683223,0.00014748865,0.0079277335,0.0002721747,0.000094366995,0.0004969404,0.00060786796,0.35646808,0.012397519,0.6123783,0.009035004,0.00014182087],"about_ca_topic_score_codex":0.0033969642,"about_ca_topic_score_gemma":0.002062304,"teacher_disagreement_score":0.0071825106,"about_ca_system_score_codex":0.0034966613,"about_ca_system_score_gemma":0.0008689194,"threshold_uncertainty_score":0.02537018},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047046587,0.00010754283,0.95038563,0.00005382131,0.000020119209,0.00006641039,0.000024588491,0.00059206184,0.0017033576],"genre_scores_gemma":[0.40815544,0.00009112994,0.5906089,0.000025585423,0.0000069208795,0.00006291424,0.00010383612,0.00021749466,0.00072790193],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99751234,0.00064338016,0.00017633308,0.00022426307,0.0013242576,0.00011949797],"domain_scores_gemma":[0.9932029,0.0036437237,0.00057264644,0.0014825482,0.001002643,0.00009553268],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028385944,0.0005738561,0.00060103193,0.0007190233,0.0003264647,0.0008096216,0.0012898768,0.0006514725,0.0015886736],"category_scores_gemma":[0.013616109,0.00041209848,0.00046671435,0.0006462917,0.00089714996,0.0009872824,0.0016288976,0.0006486449,0.0003917414],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032353585,0.000089381036,0.0036890472,0.00021166714,0.00006607574,0.00011215128,0.00026968354,0.7623878,0.03143004,0.019887844,0.0012852233,0.18024759],"study_design_scores_gemma":[0.000019981117,0.000060713395,0.00028070327,0.000008557516,0.000004908421,0.00004618629,0.000018680588,0.9853021,0.011804954,0.0017132263,0.00073077256,0.000009185595],"about_ca_topic_score_codex":0.00224385,"about_ca_topic_score_gemma":0.0022363288,"teacher_disagreement_score":0.0028385944,"about_ca_system_score_codex":0.000685106,"about_ca_system_score_gemma":0.00058658083,"threshold_uncertainty_score":0.015012085},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049519222,0.00024938158,0.92858523,0.0003785147,0.000074392,0.00019783345,0.0050394707,0.010668803,0.005287128],"genre_scores_gemma":[0.4098468,0.00027409327,0.5726739,0.00014737225,0.00004384256,0.00030517983,0.012863521,0.0009804668,0.0028648141],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987507,0.00014026946,0.00012130607,0.0002516295,0.0006296353,0.00010650255],"domain_scores_gemma":[0.99622226,0.00068167126,0.00020367224,0.0023247118,0.00044731726,0.00012032993],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007197655,0.0006061768,0.001140551,0.0010284533,0.00065509515,0.001729841,0.0018024183,0.0010849502,0.0063622836],"category_scores_gemma":[0.006132291,0.000695258,0.0011677564,0.0016977934,0.0010329448,0.0035228576,0.003722331,0.0012389112,0.0018724157],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010190915,0.00037601942,0.0054813493,0.00087049167,0.000114469156,0.00054144574,0.0005599618,0.14668866,0.10495351,0.13974798,0.037015673,0.56263137],"study_design_scores_gemma":[0.00021158096,0.0004031143,0.0018855677,0.00011815718,0.00006518343,0.0010185848,0.00019128059,0.75531954,0.06842386,0.124713436,0.04754964,0.00010011329],"about_ca_topic_score_codex":0.0012321566,"about_ca_topic_score_gemma":0.001605352,"teacher_disagreement_score":0.0063622836,"about_ca_system_score_codex":0.00045150876,"about_ca_system_score_gemma":0.0012079172,"threshold_uncertainty_score":0.021283984},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05675811,0.00027156933,0.903312,0.00015840092,0.00024703876,0.00023498353,0.0010921546,0.021112952,0.016812727],"genre_scores_gemma":[0.23464933,0.0002764459,0.75535446,0.00006905801,0.000028316335,0.0004227271,0.0017999919,0.0015658404,0.005833782],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990953,0.00023023662,0.00006138077,0.00011643103,0.0004082597,0.00008846142],"domain_scores_gemma":[0.9989875,0.00019534132,0.000053921034,0.00035313936,0.00036816622,0.00004185884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064601516,0.00076046406,0.000962163,0.0011260278,0.00073146506,0.0013756178,0.0014625053,0.0006283281,0.0084507195],"category_scores_gemma":[0.0022073593,0.00056994753,0.000765475,0.0017879715,0.0004002122,0.0010431241,0.0011861438,0.0006789316,0.002073936],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00051668583,0.0001398788,0.002916857,0.000450534,0.00015378249,0.0007316199,0.0008706403,0.5819717,0.034496278,0.031598136,0.03470113,0.3114527],"study_design_scores_gemma":[0.00005849384,0.00005220328,0.00068981125,0.000025813433,0.000010092156,0.0001259515,0.000058200432,0.9536788,0.013371256,0.00449263,0.02739942,0.00003735699],"about_ca_topic_score_codex":0.005933659,"about_ca_topic_score_gemma":0.005405882,"teacher_disagreement_score":0.0084507195,"about_ca_system_score_codex":0.00069095293,"about_ca_system_score_gemma":0.00085283275,"threshold_uncertainty_score":0.028270483},"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":"commentary","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000071051225,0.0014292381,0.00031368618,0.730846,0.26419815,0.000017041628,0.00027849094,0.00006794662,0.0027783995],"genre_scores_gemma":[0.0011841219,0.0013674826,0.0005912677,0.8599102,0.121256664,0.000107738044,0.00011442761,0.00015106838,0.0153169865],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.986511,0.0024501795,0.002129562,0.0020419322,0.0056637856,0.0012036009],"domain_scores_gemma":[0.9483872,0.029550925,0.0021974612,0.0015671819,0.01664021,0.0016569727],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008698246,0.0023056704,0.0031781043,0.003897843,0.008300437,0.006567512,0.008852751,0.051810246,0.015467858],"category_scores_gemma":[0.097748116,0.0020870327,0.0031492303,0.003118668,0.01390808,0.008462007,0.0051415446,0.06665411,0.012763922],"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.000009218654,0.000002124144,0.000011057311,0.000037217134,0.000004139337,0.000038087725,0.000027258386,0.00001807226,0.000012721197,0.0024611542,0.9966922,0.0006868585],"study_design_scores_gemma":[0.000054760905,0.000018822304,0.00036737134,0.00051621016,0.000054029526,0.00013512361,0.00020105921,0.00020337533,0.00018788989,0.01239328,0.9857971,0.000070956776],"about_ca_topic_score_codex":0.06318443,"about_ca_topic_score_gemma":0.06444792,"teacher_disagreement_score":0.06318443,"about_ca_system_score_codex":0.012386327,"about_ca_system_score_gemma":0.01344362,"threshold_uncertainty_score":0.12563336},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.058757115,0.0004312265,0.9329737,0.000424428,0.000042845517,0.000100217236,0.0009364326,0.00488132,0.0014527084],"genre_scores_gemma":[0.69046664,0.0004952627,0.30225706,0.00011140541,0.00008647615,0.00026978643,0.0029650226,0.00044934588,0.0028989953],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974928,0.00037889427,0.0001957452,0.00036584985,0.0013006909,0.0002660782],"domain_scores_gemma":[0.99040097,0.0035563875,0.00078086485,0.0040427526,0.000924306,0.00029464686],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014994286,0.0006789982,0.0019571371,0.001732176,0.0009752375,0.0021282143,0.0033186455,0.001226201,0.0034214081],"category_scores_gemma":[0.015483748,0.0007757328,0.00065375236,0.003914234,0.0018222219,0.0042961924,0.0050724703,0.0016890382,0.0015219302],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0023216514,0.00020873094,0.0055450685,0.00028133203,0.000084840634,0.00037052837,0.0007753782,0.39872825,0.03016762,0.09075332,0.016663061,0.45410022],"study_design_scores_gemma":[0.00011039247,0.00016635304,0.0008100016,0.000023329458,0.000022735196,0.00022169716,0.00012853811,0.8951681,0.019773442,0.07732144,0.0061999466,0.000053879965],"about_ca_topic_score_codex":0.0031906911,"about_ca_topic_score_gemma":0.002613316,"teacher_disagreement_score":0.0034214081,"about_ca_system_score_codex":0.0014194625,"about_ca_system_score_gemma":0.0011839647,"threshold_uncertainty_score":0.011445701},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010724393,0.00060360815,0.9741484,0.00038974997,0.0001914382,0.00004838645,0.00016385231,0.00048555844,0.0132446],"genre_scores_gemma":[0.32537606,0.00303903,0.6270183,0.00058612553,0.0009504371,0.0002989068,0.0011614515,0.0015552784,0.040014423],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991522,0.00015370137,0.00004612836,0.00027206846,0.00026583872,0.00011006731],"domain_scores_gemma":[0.99713755,0.0011915623,0.00023284691,0.00046157558,0.0007042226,0.00027230143],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012049272,0.0009638012,0.0011873099,0.0030979319,0.0014573594,0.0030492002,0.0021782543,0.0014494405,0.014485202],"category_scores_gemma":[0.006500065,0.0011305786,0.0014987676,0.002689819,0.0026332177,0.004525619,0.003979604,0.0054043466,0.0028278208],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007376567,0.000048119073,0.00044652238,0.00011102046,0.000022735414,0.00006443381,0.00024354686,0.01090372,0.0039871866,0.8997677,0.008058645,0.07627245],"study_design_scores_gemma":[0.000050891773,0.000073803094,0.00044930022,0.00006711784,0.000030633666,0.00023138119,0.00016965317,0.1266725,0.0050111185,0.8417093,0.025488503,0.00004574587],"about_ca_topic_score_codex":0.002781864,"about_ca_topic_score_gemma":0.0021894502,"teacher_disagreement_score":0.014485202,"about_ca_system_score_codex":0.001143021,"about_ca_system_score_gemma":0.00079504895,"threshold_uncertainty_score":0.04845786},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016652951,0.00012698228,0.9772295,0.00006822426,0.000054231263,0.00003608091,0.000030340263,0.00030050558,0.005501244],"genre_scores_gemma":[0.379895,0.0006069103,0.603563,0.00009540562,0.0000444182,0.00011462243,0.00021104411,0.00026393824,0.015205617],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998049,0.00003195891,0.000010572371,0.000016064034,0.00011736027,0.000019063527],"domain_scores_gemma":[0.99956936,0.00017016432,0.000038096863,0.000060891623,0.00014364916,0.000017773906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039768103,0.0006558223,0.00047115638,0.0006084803,0.0003879799,0.00091860624,0.0009658562,0.0008012544,0.0025458338],"category_scores_gemma":[0.0013082493,0.00034420154,0.0006111294,0.000494769,0.00064824725,0.0010943803,0.00077423477,0.000857915,0.000874854],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001522797,0.00009490186,0.000994683,0.00021022974,0.000048218793,0.0004020531,0.0004452914,0.6397617,0.061464984,0.1608453,0.002930801,0.13264948],"study_design_scores_gemma":[0.000011786345,0.0000107593405,0.00009206652,0.000008662663,0.000004011364,0.00005902808,0.000015617752,0.98871744,0.004716679,0.0048258365,0.0015255029,0.000012704918],"about_ca_topic_score_codex":0.0025022037,"about_ca_topic_score_gemma":0.0021665134,"teacher_disagreement_score":0.0025458338,"about_ca_system_score_codex":0.0006418472,"about_ca_system_score_gemma":0.0006604245,"threshold_uncertainty_score":0.008516669},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22019672,0.00028025132,0.7506237,0.00022064304,0.00018704009,0.00006800832,0.0005679586,0.000671019,0.027184606],"genre_scores_gemma":[0.71322876,0.00037042997,0.26467606,0.0002199347,0.000066870954,0.0001821941,0.0010881658,0.00060266803,0.019564927],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999012,0.00014468418,0.000039395472,0.00018546678,0.00046732472,0.00015112548],"domain_scores_gemma":[0.99870276,0.0003096164,0.000110928384,0.00021223036,0.00035210163,0.00031237787],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060214463,0.00079120765,0.00070687965,0.0018758613,0.0012862497,0.002659765,0.0015864877,0.0009084849,0.006894371],"category_scores_gemma":[0.0023220864,0.00075804634,0.0006269514,0.0012017911,0.0013164192,0.002058332,0.0031711406,0.0015595506,0.0012820282],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034830294,0.00015615966,0.002536142,0.00017214462,0.00008271421,0.00050217053,0.0006623877,0.043719485,0.033408847,0.8447329,0.0048668925,0.06881186],"study_design_scores_gemma":[0.00004891061,0.00013803024,0.0019721517,0.00011456726,0.000055498404,0.0008119171,0.00074778876,0.2759393,0.024578197,0.6717224,0.023778047,0.00009316171],"about_ca_topic_score_codex":0.0012821546,"about_ca_topic_score_gemma":0.0013037111,"teacher_disagreement_score":0.006894371,"about_ca_system_score_codex":0.0005543869,"about_ca_system_score_gemma":0.0005221788,"threshold_uncertainty_score":0.023064017},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.096623115,0.009667381,0.44413397,0.014908756,0.007981532,0.00032342196,0.0019003208,0.0011336695,0.4233279],"genre_scores_gemma":[0.65444523,0.010266761,0.17814784,0.007110191,0.009293335,0.0005424578,0.0026989274,0.0013481259,0.13614714],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99808645,0.00040194963,0.00014121119,0.0005466976,0.00058882573,0.00023481427],"domain_scores_gemma":[0.99401087,0.0025048049,0.00046391287,0.0014549309,0.0008904312,0.0006750711],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018173652,0.001812294,0.0024132885,0.005022253,0.0033492185,0.0033965153,0.0031811118,0.0020737476,0.024916336],"category_scores_gemma":[0.010900728,0.0007880398,0.0041124476,0.003856453,0.0034850717,0.010934062,0.010490695,0.0046502254,0.0038133452],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018175253,0.00014178464,0.00080397277,0.00036446156,0.00006444813,0.0003138842,0.00041683714,0.0027057477,0.0023536298,0.9507885,0.015190389,0.0266747],"study_design_scores_gemma":[0.000038096707,0.00008089939,0.00072941784,0.00007139366,0.000077609875,0.0004016501,0.00016360245,0.010129639,0.00080323394,0.9532425,0.03422316,0.000038761314],"about_ca_topic_score_codex":0.0012002953,"about_ca_topic_score_gemma":0.0008330918,"teacher_disagreement_score":0.024916336,"about_ca_system_score_codex":0.0012198822,"about_ca_system_score_gemma":0.0010438444,"threshold_uncertainty_score":0.0833534},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036846402,0.00027441117,0.980145,0.001027447,0.00078611454,0.00017123121,0.0002290291,0.0022876835,0.011394443],"genre_scores_gemma":[0.048029184,0.00017824749,0.92886186,0.0006584433,0.00030204465,0.00036609775,0.00076820387,0.0013210282,0.01951487],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99767286,0.00036294854,0.00015434258,0.00056577066,0.0010186961,0.00022542197],"domain_scores_gemma":[0.99775606,0.00069870544,0.00007283869,0.00080389564,0.00051107194,0.00015745134],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001680872,0.0019345925,0.0017397585,0.0024794352,0.0013215275,0.003070209,0.0035869703,0.0028361091,0.04770912],"category_scores_gemma":[0.0072352295,0.0007370924,0.0024211959,0.002454961,0.0013527155,0.004841452,0.0048534777,0.0052106157,0.017025372],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004028265,0.00039438996,0.0005590468,0.00058611634,0.00019488335,0.00019619394,0.00029988113,0.023473471,0.018440478,0.22142306,0.048380587,0.6856491],"study_design_scores_gemma":[0.00067352987,0.00028194173,0.0011575468,0.00012655059,0.00017536203,0.000727353,0.00023883171,0.35816854,0.018134547,0.49962056,0.12053704,0.00015823124],"about_ca_topic_score_codex":0.0034430544,"about_ca_topic_score_gemma":0.005088255,"teacher_disagreement_score":0.04770912,"about_ca_system_score_codex":0.0012852681,"about_ca_system_score_gemma":0.0020762684,"threshold_uncertainty_score":0.15960288},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10579775,0.0013223224,0.8832584,0.00028930805,0.00019180814,0.000037333506,0.00019848516,0.00041199825,0.008492572],"genre_scores_gemma":[0.66547436,0.0009938177,0.32832384,0.000044992266,0.00016292921,0.000046866895,0.00046388924,0.00036188264,0.00412742],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995927,0.000116348885,0.000026788432,0.000058148675,0.00016348438,0.000042443844],"domain_scores_gemma":[0.9987218,0.00068359374,0.00011367046,0.00014886643,0.00022976808,0.00010226571],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008839766,0.00050180766,0.00072555174,0.0010527957,0.00029286422,0.0011033467,0.00092474325,0.00071427505,0.001119904],"category_scores_gemma":[0.0079543,0.0004074519,0.0005245366,0.00058886746,0.0006750321,0.0013029918,0.0014845054,0.0007266703,0.0004520596],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008624301,0.000085233805,0.0089463405,0.00044183963,0.000042737724,0.00041080345,0.0003107774,0.628331,0.019787561,0.15572187,0.017070461,0.16798896],"study_design_scores_gemma":[0.00001305141,0.00004323775,0.0004964024,0.000025639125,0.000011802993,0.00015309332,0.000036993082,0.9745657,0.0019839732,0.01917447,0.0034851956,0.0000105051695],"about_ca_topic_score_codex":0.0015690372,"about_ca_topic_score_gemma":0.0017359838,"teacher_disagreement_score":0.0015690372,"about_ca_system_score_codex":0.00035678796,"about_ca_system_score_gemma":0.00046193623,"threshold_uncertainty_score":0.004674971},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5511532,0.00043436754,0.40046868,0.00059746904,0.00011519895,0.00016668907,0.00045234716,0.0012346951,0.04537743],"genre_scores_gemma":[0.85786253,0.00041052978,0.12867188,0.000112115886,0.000063980966,0.00013478164,0.0007142434,0.00025027402,0.011779669],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99975115,0.000069397625,0.000011518563,0.000053274252,0.00007496777,0.000039600334],"domain_scores_gemma":[0.9984676,0.00081890955,0.00019493396,0.00021532473,0.0001423883,0.00016078581],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022020371,0.00039152618,0.0004210341,0.0009353965,0.0006876614,0.001060271,0.0009454109,0.00067191856,0.007948884],"category_scores_gemma":[0.00203001,0.00043504316,0.00050074403,0.00090935006,0.00094673375,0.0015291527,0.001477471,0.0011684374,0.0008219038],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047453627,0.00032307155,0.0038584548,0.00042410818,0.000036719062,0.0008291583,0.00094284286,0.1516464,0.030752819,0.6092049,0.010221904,0.19128509],"study_design_scores_gemma":[0.00006782572,0.00021800611,0.002194723,0.00007889351,0.000044104705,0.00076650607,0.000460405,0.4566003,0.011518138,0.51195115,0.016066948,0.000032960743],"about_ca_topic_score_codex":0.00079590396,"about_ca_topic_score_gemma":0.0010115751,"teacher_disagreement_score":0.007948884,"about_ca_system_score_codex":0.0003621175,"about_ca_system_score_gemma":0.00025777676,"threshold_uncertainty_score":0.026591659},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7355903,0.00049932,0.23624179,0.00028763586,0.00021989334,0.000058960173,0.000119718454,0.00025376686,0.026728656],"genre_scores_gemma":[0.97621286,0.00015733254,0.014720087,0.00003748326,0.000020152549,0.00003027978,0.00006250997,0.000077909914,0.008681308],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998223,0.000027980157,0.00000956343,0.000040220864,0.000051603653,0.00004834174],"domain_scores_gemma":[0.9994267,0.00016681533,0.000095106,0.00010913716,0.00007276955,0.00012946645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019672043,0.00020559828,0.00036905252,0.0005761168,0.0008001015,0.0016088655,0.0007404654,0.0008396555,0.006843833],"category_scores_gemma":[0.0014579617,0.00033834617,0.00023386006,0.0004524707,0.0017856897,0.001272719,0.0011928412,0.00069266977,0.00044261152],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00050095556,0.00017449462,0.0018641358,0.000103430786,0.000025369343,0.00044948148,0.00057751976,0.25885618,0.019498665,0.6718289,0.0016336748,0.044487197],"study_design_scores_gemma":[0.00006242157,0.000129956,0.0008601309,0.00003096316,0.0000140873435,0.00012906807,0.00046527956,0.70248365,0.006154766,0.28450805,0.005131044,0.000030618892],"about_ca_topic_score_codex":0.0011817793,"about_ca_topic_score_gemma":0.0013875993,"teacher_disagreement_score":0.006843833,"about_ca_system_score_codex":0.00033135066,"about_ca_system_score_gemma":0.0003887122,"threshold_uncertainty_score":0.022894919},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29928723,0.0001170999,0.6913754,0.00034034383,0.000054575306,0.00014793612,0.00035493582,0.0019467836,0.00637568],"genre_scores_gemma":[0.5327167,0.00007009148,0.46248278,0.00004865506,0.00002423235,0.00006745648,0.0007195255,0.00050686585,0.003363687],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997094,0.000049027516,0.000013477939,0.000089569185,0.00008006671,0.000058433878],"domain_scores_gemma":[0.9990356,0.0005786626,0.00008698937,0.000102190395,0.00009981936,0.0000968531],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033081818,0.00096491206,0.0014648484,0.00078649214,0.00080071704,0.001271031,0.001382779,0.0017519206,0.0059049777],"category_scores_gemma":[0.0021851885,0.00087019167,0.00087075727,0.0010287993,0.0008350461,0.001385476,0.0013211513,0.0012805583,0.00090279366],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013731106,0.0002703409,0.0024585554,0.00039835114,0.000083257444,0.00041537077,0.00044509373,0.76214606,0.040985797,0.014555784,0.0051373225,0.171731],"study_design_scores_gemma":[0.000044161436,0.00011188576,0.0001818945,0.000007682499,0.000012346716,0.000029204688,0.00009119492,0.9881196,0.0053751385,0.0054344577,0.0005846494,0.00000776667],"about_ca_topic_score_codex":0.004568132,"about_ca_topic_score_gemma":0.0072448635,"teacher_disagreement_score":0.0059049777,"about_ca_system_score_codex":0.000772525,"about_ca_system_score_gemma":0.0011206601,"threshold_uncertainty_score":0.019754112},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04947751,0.00028235346,0.92738634,0.00032724536,0.00013298783,0.00027036716,0.00073384255,0.0021917112,0.019197667],"genre_scores_gemma":[0.24313752,0.00059611385,0.7458204,0.00013814885,0.000055993332,0.00023171217,0.0010628379,0.00087989087,0.008077468],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99964464,0.00005209206,0.000023553874,0.00007356927,0.00015586634,0.000050221293],"domain_scores_gemma":[0.99944276,0.00026094817,0.000041308595,0.00009574694,0.00010783552,0.000051388637],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032287702,0.0009871518,0.00091778114,0.0011075563,0.0005780815,0.0016699473,0.0013730243,0.0012990655,0.012318143],"category_scores_gemma":[0.0023155017,0.00085816317,0.0009499015,0.0012791101,0.00066434126,0.0016864062,0.0017891856,0.0018083147,0.0021123386],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046403764,0.00022825434,0.0014730976,0.0008120529,0.000113579335,0.00061602873,0.00080527185,0.2580882,0.040193774,0.17478304,0.024371779,0.49805087],"study_design_scores_gemma":[0.00011288078,0.00016864673,0.00058770715,0.00012468075,0.00006695405,0.0005024239,0.00032481135,0.77854663,0.022037087,0.15904133,0.03844038,0.000046556393],"about_ca_topic_score_codex":0.0014991396,"about_ca_topic_score_gemma":0.00475785,"teacher_disagreement_score":0.012318143,"about_ca_system_score_codex":0.00066215167,"about_ca_system_score_gemma":0.00051508745,"threshold_uncertainty_score":0.041208267},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.078551,0.0002168759,0.90790105,0.00013760147,0.0000409606,0.00009929984,0.0000928871,0.00036406956,0.012596208],"genre_scores_gemma":[0.6666157,0.00026334738,0.3219462,0.000094486386,0.000043223514,0.00016484802,0.00029073076,0.00050893653,0.010072519],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990324,0.00023121202,0.00006231539,0.00015113663,0.00042940784,0.000093522394],"domain_scores_gemma":[0.9978612,0.001003984,0.00012695268,0.0006333207,0.0003061896,0.0000683942],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089576194,0.00036030397,0.00078101247,0.0012087903,0.0006711339,0.0013166392,0.0012425464,0.0007330264,0.006464387],"category_scores_gemma":[0.0065803234,0.00047958628,0.00039035614,0.0011294015,0.0011355306,0.0018467586,0.0027331377,0.0011692457,0.00068566547],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042326585,0.00014617092,0.0018062522,0.0002235397,0.000032063257,0.0002970273,0.0008938834,0.32687384,0.019294353,0.33089894,0.0027625628,0.3163481],"study_design_scores_gemma":[0.0000484299,0.00011030759,0.00045634276,0.000043344353,0.000024425768,0.0002671386,0.00024993555,0.75197655,0.013342976,0.21959694,0.013868932,0.000014647294],"about_ca_topic_score_codex":0.00079545134,"about_ca_topic_score_gemma":0.0015081313,"teacher_disagreement_score":0.006464387,"about_ca_system_score_codex":0.00051656883,"about_ca_system_score_gemma":0.00028665396,"threshold_uncertainty_score":0.021625519},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026608419,0.00015100118,0.9607004,0.00029351283,0.000062529216,0.00017890072,0.00033372268,0.002346557,0.009324983],"genre_scores_gemma":[0.34622133,0.00017995133,0.6386584,0.00016459807,0.000043169213,0.00035903757,0.001293383,0.00072622614,0.012353971],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99933296,0.00012008141,0.000032716755,0.0001458526,0.00026474113,0.000103551],"domain_scores_gemma":[0.99848735,0.0007506315,0.00008821969,0.0004465888,0.00014612007,0.00008108435],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006217263,0.0009375321,0.0010395794,0.0009222904,0.0007441091,0.001765241,0.002877237,0.0013747448,0.026189296],"category_scores_gemma":[0.0045864563,0.00058666524,0.00094307953,0.0015028965,0.00081602467,0.004443833,0.0035719564,0.001824863,0.002557408],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044340317,0.00038853608,0.00072952575,0.00043687408,0.000052262178,0.0001257203,0.00039407203,0.2804327,0.004225343,0.17828394,0.021197353,0.5132902],"study_design_scores_gemma":[0.000098865006,0.00006492357,0.000109984656,0.000021643635,0.000016958144,0.000055612632,0.000118892276,0.8759683,0.0019428855,0.11774133,0.003847218,0.000013359816],"about_ca_topic_score_codex":0.0031308758,"about_ca_topic_score_gemma":0.006442011,"teacher_disagreement_score":0.026189296,"about_ca_system_score_codex":0.001084872,"about_ca_system_score_gemma":0.0010354132,"threshold_uncertainty_score":0.08761191},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014598373,0.00008852014,0.9799269,0.0001248534,0.00006495099,0.00016315306,0.0001093474,0.0005185488,0.004405429],"genre_scores_gemma":[0.1520622,0.00012528886,0.8408426,0.00008182027,0.000042687556,0.00024847945,0.00044180796,0.00025652768,0.0058986293],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99858737,0.00028451523,0.00010086964,0.00037924421,0.00046794873,0.00018014846],"domain_scores_gemma":[0.9980155,0.0012085214,0.000104603074,0.00030685528,0.00024521936,0.00011934568],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014193653,0.0006604229,0.0013593464,0.0011809365,0.001157707,0.0019218597,0.003088855,0.0013390171,0.013594269],"category_scores_gemma":[0.0057196235,0.0008874992,0.0013692687,0.0012905409,0.0012831998,0.0027463236,0.003660782,0.0024376172,0.0016792334],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00065270066,0.000255651,0.0007033343,0.00037344525,0.00006941635,0.00018498547,0.00025464094,0.15319955,0.009623676,0.33358738,0.007276939,0.4938183],"study_design_scores_gemma":[0.00014703134,0.00016552855,0.00012844229,0.00004760539,0.00003981378,0.000116634495,0.00008575698,0.8125871,0.009054958,0.16947404,0.0081171915,0.00003590953],"about_ca_topic_score_codex":0.001753297,"about_ca_topic_score_gemma":0.0021218017,"teacher_disagreement_score":0.013594269,"about_ca_system_score_codex":0.0010619446,"about_ca_system_score_gemma":0.0014512691,"threshold_uncertainty_score":0.04547739},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001975508,0.00007950417,0.9957491,0.000051644434,0.00005882274,0.000023349676,0.000013931444,0.00006709189,0.0019809841],"genre_scores_gemma":[0.12014583,0.00086840196,0.8688358,0.00013431018,0.00017027222,0.00016356456,0.00016029572,0.00035468003,0.009166762],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995433,0.00009541928,0.000022729218,0.00004892022,0.00026420987,0.000025509104],"domain_scores_gemma":[0.9991296,0.0003849655,0.000043317727,0.00016701149,0.00023718088,0.00003793425],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011463452,0.0007100739,0.0009002635,0.0014012314,0.0005507145,0.0014802665,0.0015460263,0.0015429659,0.0031776784],"category_scores_gemma":[0.0034559744,0.00045930198,0.0011527165,0.0010030341,0.0010316506,0.0013931182,0.0020372663,0.0021183447,0.0011126158],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055613553,0.000081158665,0.00044292587,0.00023562355,0.000033278306,0.00026668626,0.00019638555,0.57529825,0.017030837,0.24945216,0.0025968237,0.15431027],"study_design_scores_gemma":[0.000005909061,0.000012331243,0.000041868585,0.000009903595,0.000003951968,0.000038671704,0.00000850796,0.97147727,0.0013368401,0.02282701,0.0042318315,0.0000059330773],"about_ca_topic_score_codex":0.002370783,"about_ca_topic_score_gemma":0.0027620161,"teacher_disagreement_score":0.0031776784,"about_ca_system_score_codex":0.00039952603,"about_ca_system_score_gemma":0.0009107712,"threshold_uncertainty_score":0.010630369},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11830736,0.00034296454,0.8328355,0.0004212522,0.00024295009,0.00033500107,0.000962395,0.0025173083,0.044035263],"genre_scores_gemma":[0.3918137,0.00053782633,0.54357666,0.00017346375,0.00006363714,0.00033640233,0.0028514627,0.0018686997,0.058778204],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997857,0.0000398905,0.000010429167,0.00005222128,0.000059443297,0.000052169315],"domain_scores_gemma":[0.99936,0.00024558904,0.000055890054,0.00013377376,0.00008995409,0.00011481825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028435848,0.0005738567,0.0006680205,0.00091694423,0.0011448921,0.0012312745,0.0011938217,0.0007747274,0.020193912],"category_scores_gemma":[0.0026423063,0.00055505626,0.00080829766,0.0007581645,0.00080479536,0.0015549243,0.00230811,0.0011769689,0.0023204784],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00062656123,0.00013859376,0.002151462,0.0004089522,0.000049478476,0.0007114937,0.0012415221,0.16754769,0.00949707,0.580005,0.03771477,0.19990747],"study_design_scores_gemma":[0.000077329634,0.00014568638,0.0006011762,0.00011965517,0.000029831943,0.00029359598,0.00070860836,0.6579238,0.0047925697,0.27704358,0.05822456,0.00003962367],"about_ca_topic_score_codex":0.004066811,"about_ca_topic_score_gemma":0.007142745,"teacher_disagreement_score":0.020193912,"about_ca_system_score_codex":0.0006931194,"about_ca_system_score_gemma":0.00065288594,"threshold_uncertainty_score":0.06755537},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70652914,0.0007302714,0.27372915,0.00028575046,0.00012936941,0.00016825082,0.0003222998,0.0066676466,0.01143805],"genre_scores_gemma":[0.82632697,0.00023072411,0.16941659,0.000035824523,0.000020246765,0.00009890243,0.00082764344,0.0004178493,0.0026251937],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992211,0.00014458134,0.00005320606,0.00014846577,0.00030161714,0.00013099759],"domain_scores_gemma":[0.9969741,0.0016302073,0.00012348188,0.0005152989,0.00053834205,0.00021847364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010640027,0.0006765653,0.0009536253,0.0007284835,0.0006292381,0.00072664575,0.0013752222,0.001562542,0.004405767],"category_scores_gemma":[0.0033579506,0.00022461738,0.00041105834,0.0014620278,0.00065263174,0.0012335718,0.0006450511,0.0006585744,0.0009811611],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0044020107,0.001105447,0.005089192,0.0004358749,0.0001602117,0.00024044984,0.00034534663,0.5707189,0.11568698,0.0067024804,0.004943019,0.29017007],"study_design_scores_gemma":[0.00010431273,0.00047414657,0.0013570625,0.0000079185065,0.000015530632,0.00008879711,0.00007318447,0.96509415,0.031057894,0.0007423784,0.00097057887,0.000014106454],"about_ca_topic_score_codex":0.002469654,"about_ca_topic_score_gemma":0.0013317182,"teacher_disagreement_score":0.004405767,"about_ca_system_score_codex":0.0005706746,"about_ca_system_score_gemma":0.0009701683,"threshold_uncertainty_score":0.014738739},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09763142,0.00030742216,0.8983423,0.0001408929,0.000059734833,0.00008650625,0.00016714365,0.00039766697,0.0028669892],"genre_scores_gemma":[0.43733317,0.00059052743,0.5538583,0.00006372644,0.00004662112,0.00029952612,0.00074450596,0.0004661541,0.006597454],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991732,0.00022592943,0.00004598249,0.00014498863,0.00033319747,0.00007671124],"domain_scores_gemma":[0.99737716,0.0018027091,0.00018383325,0.00022966276,0.00027625737,0.00013034276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000978689,0.0012977275,0.0015222433,0.00234676,0.0005548915,0.0014289239,0.002264473,0.001498418,0.0038109964],"category_scores_gemma":[0.00845504,0.0011675985,0.00087349,0.0023186388,0.0012207633,0.0025126871,0.0026849958,0.0017407316,0.000605507],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001928167,0.000074838594,0.0008456463,0.00018160188,0.0000470913,0.00008336914,0.00015516457,0.8583431,0.0030261541,0.064023204,0.0019279383,0.07109897],"study_design_scores_gemma":[0.000012514964,0.000025077868,0.00007640659,0.000011620814,0.000006438797,0.000017489869,0.00002962861,0.95419407,0.00060748524,0.044328142,0.0006868483,0.0000042506417],"about_ca_topic_score_codex":0.0034093799,"about_ca_topic_score_gemma":0.0044176024,"teacher_disagreement_score":0.0038109964,"about_ca_system_score_codex":0.0012226432,"about_ca_system_score_gemma":0.00060371973,"threshold_uncertainty_score":0.012749076},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24913612,0.0012663091,0.5185163,0.0025955485,0.0008007599,0.00020763921,0.0011676728,0.001281545,0.22502807],"genre_scores_gemma":[0.78296864,0.0008175312,0.18039401,0.00044260232,0.000080071775,0.0001615937,0.0011106523,0.00051518116,0.03350962],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99959713,0.0000999637,0.000020834053,0.0001228953,0.00007674833,0.00008248905],"domain_scores_gemma":[0.9989944,0.0003556023,0.00013484049,0.00016939713,0.00019401351,0.00015183703],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030843215,0.0005345545,0.00073317735,0.0010270086,0.0013190566,0.002195955,0.0011291202,0.0017446912,0.02140923],"category_scores_gemma":[0.0041392483,0.00053887937,0.00060601765,0.0008903366,0.0013418025,0.0045232605,0.0012179206,0.0011782285,0.0036033532],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002592189,0.00003517594,0.0016892496,0.0003080365,0.000028012653,0.00056182453,0.00074430974,0.012342054,0.004347319,0.90851086,0.011821284,0.05935256],"study_design_scores_gemma":[0.000038982336,0.000024984432,0.0007144697,0.00021185022,0.000022967992,0.00041450106,0.0012968127,0.035471745,0.0032976354,0.89399356,0.06446264,0.00004987624],"about_ca_topic_score_codex":0.0014058757,"about_ca_topic_score_gemma":0.002350294,"teacher_disagreement_score":0.02140923,"about_ca_system_score_codex":0.00057345483,"about_ca_system_score_gemma":0.00036978946,"threshold_uncertainty_score":0.07162106},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016975071,0.00004941028,0.98005795,0.000031847507,0.000016201555,0.00008120952,0.00009573803,0.0008794356,0.0018131926],"genre_scores_gemma":[0.098278955,0.000097852855,0.8989304,0.000021804064,0.0000138214655,0.00011165878,0.00047977478,0.00021145107,0.0018542266],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99967897,0.0000362998,0.000029423256,0.00006804863,0.00014731551,0.00004001784],"domain_scores_gemma":[0.99934,0.00017656134,0.00006461101,0.0001390295,0.00022930857,0.000050471077],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035602122,0.00066739495,0.00056650356,0.0013615945,0.00054151326,0.0007979806,0.0009291667,0.0005455345,0.007430866],"category_scores_gemma":[0.0022110338,0.00042679618,0.0006326552,0.0013325715,0.0006678963,0.001441945,0.0015631864,0.0007192646,0.0014895791],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026771662,0.000106784624,0.0019812905,0.00035497214,0.000061525105,0.00028732434,0.00034061438,0.069922216,0.067540884,0.07483404,0.005305071,0.7789975],"study_design_scores_gemma":[0.00012256234,0.00037720837,0.0015229154,0.00007812537,0.00005277175,0.0006318582,0.000257672,0.7804042,0.038786564,0.1567693,0.020920902,0.000075914984],"about_ca_topic_score_codex":0.0008765311,"about_ca_topic_score_gemma":0.0019510569,"teacher_disagreement_score":0.007430866,"about_ca_system_score_codex":0.00029493545,"about_ca_system_score_gemma":0.00055977365,"threshold_uncertainty_score":0.024858654},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.58661026,0.0007326119,0.33583233,0.00064414693,0.00021351122,0.00010491299,0.00029828443,0.00032748078,0.075236514],"genre_scores_gemma":[0.9549029,0.0003303628,0.03509483,0.000099884914,0.00003325177,0.00004883095,0.00012857589,0.00017404812,0.00918724],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998597,0.00003133842,0.0000065751947,0.000022735892,0.00005370831,0.000025849009],"domain_scores_gemma":[0.9996333,0.00009440484,0.000052775922,0.00004706,0.000105057596,0.00006735571],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017895765,0.00023906745,0.00023877289,0.000895436,0.0005523455,0.0013884235,0.00046527715,0.0006007708,0.003684893],"category_scores_gemma":[0.001614684,0.00028309983,0.00022073345,0.0006629349,0.0011048707,0.0008289918,0.0008875821,0.0005432547,0.00047347933],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015188735,0.000034157663,0.0014386036,0.000059281232,0.0000081664,0.00018355827,0.0005713411,0.039940145,0.0085743265,0.8761099,0.002924011,0.070004575],"study_design_scores_gemma":[0.00003378418,0.00008331084,0.0016720652,0.000054187516,0.000009882934,0.000528713,0.0007417551,0.32786855,0.004761981,0.63722473,0.02696674,0.000054271713],"about_ca_topic_score_codex":0.0014736594,"about_ca_topic_score_gemma":0.0010719202,"teacher_disagreement_score":0.003684893,"about_ca_system_score_codex":0.0003826943,"about_ca_system_score_gemma":0.00049532176,"threshold_uncertainty_score":0.012327135},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08451462,0.0022088424,0.76352197,0.0012518247,0.00049722113,0.000060141407,0.00031887557,0.00047816875,0.1471484],"genre_scores_gemma":[0.8508427,0.0029004696,0.101068795,0.00076281436,0.0011232225,0.00017126885,0.0008747353,0.0005975072,0.0416586],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983941,0.00031875682,0.00010720563,0.00024018592,0.0007413184,0.00019833195],"domain_scores_gemma":[0.99806315,0.00081148715,0.00017094209,0.00023563273,0.00047274464,0.00024604792],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017898175,0.0008603672,0.0007335232,0.0026630256,0.0016321734,0.0024085657,0.0013197233,0.00052809744,0.012297548],"category_scores_gemma":[0.002766017,0.0003985372,0.0011201389,0.0016201764,0.0033036703,0.0071311216,0.004859359,0.002525409,0.0020323552],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010061983,0.0000084847725,0.00013763578,0.0000398841,0.000007996883,0.000043033335,0.00008466728,0.0007845871,0.0004167344,0.9897165,0.0011625857,0.007587904],"study_design_scores_gemma":[0.000005738282,0.000023527047,0.00016115505,0.000011584909,0.00000950807,0.00021128997,0.00006127867,0.0040114303,0.0012580877,0.9872722,0.006962732,0.00001148327],"about_ca_topic_score_codex":0.00045034863,"about_ca_topic_score_gemma":0.00029304298,"teacher_disagreement_score":0.012297548,"about_ca_system_score_codex":0.0008018249,"about_ca_system_score_gemma":0.00041000912,"threshold_uncertainty_score":0.041139364},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012331262,0.000046923455,0.98052967,0.00007211888,0.000031103544,0.00015530639,0.00013599731,0.002473263,0.0042244564],"genre_scores_gemma":[0.08886632,0.000039688613,0.90701336,0.00003658187,0.00001027146,0.00022920738,0.00042676544,0.000496523,0.0028813703],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99948657,0.000056392997,0.00004169627,0.000111357724,0.00022312289,0.000080835496],"domain_scores_gemma":[0.9987984,0.0004529543,0.00006230144,0.00033602543,0.00030032275,0.000050111157],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053338974,0.00065044913,0.0005319886,0.00091834634,0.0008474834,0.0008588048,0.0011875774,0.0009250486,0.010202984],"category_scores_gemma":[0.002932734,0.00052281626,0.00092146563,0.0005631362,0.0007071276,0.0012377842,0.0026828274,0.00096172077,0.0030263658],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001995935,0.00016032252,0.002012947,0.0003816023,0.000057712314,0.0002951958,0.0005734976,0.06789205,0.037859943,0.14679089,0.015578166,0.72819805],"study_design_scores_gemma":[0.00031645256,0.00031728402,0.00088448107,0.00010067839,0.00007279946,0.0009795001,0.00030193222,0.6213807,0.077316634,0.23609725,0.062108066,0.00012419537],"about_ca_topic_score_codex":0.000845276,"about_ca_topic_score_gemma":0.001607351,"teacher_disagreement_score":0.010202984,"about_ca_system_score_codex":0.000415986,"about_ca_system_score_gemma":0.00086407905,"threshold_uncertainty_score":0.03413236},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015922558,0.00006487172,0.9770299,0.000130279,0.000022878627,0.000055208868,0.00008491367,0.00059265137,0.00609671],"genre_scores_gemma":[0.3039036,0.00010023969,0.689015,0.00013022353,0.000015965785,0.00017779903,0.0003146372,0.00058715354,0.005755354],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996723,0.00006184463,0.000016331904,0.000059730046,0.00014984589,0.000039963987],"domain_scores_gemma":[0.9993799,0.00029558726,0.00004467363,0.00010133011,0.00014862906,0.000029768136],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090429984,0.0007618868,0.0007209239,0.0003820684,0.00032642146,0.00090078864,0.0009904603,0.0009889934,0.0047788406],"category_scores_gemma":[0.0022181429,0.00045806068,0.0005524734,0.00035642978,0.0007187599,0.0006741491,0.00126011,0.0012352619,0.0009790909],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060922153,0.00003451467,0.00065277924,0.000106553525,0.000012463506,0.00012412862,0.000113570364,0.91768306,0.0062317005,0.0179259,0.002638605,0.054415826],"study_design_scores_gemma":[0.000006722966,0.00001130712,0.000035679957,0.0000063574353,0.0000013550485,0.00001849062,0.000014402953,0.9940229,0.001446983,0.00367393,0.0007588712,0.0000030045696],"about_ca_topic_score_codex":0.0022482546,"about_ca_topic_score_gemma":0.0028667373,"teacher_disagreement_score":0.0047788406,"about_ca_system_score_codex":0.00055059744,"about_ca_system_score_gemma":0.0008892827,"threshold_uncertainty_score":0.0159868},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.062711015,0.0008636583,0.92667055,0.00095888984,0.000101565594,0.00008556645,0.0003498667,0.00016367447,0.00809528],"genre_scores_gemma":[0.5113872,0.002442555,0.443783,0.00034243197,0.000357414,0.00037187338,0.00204505,0.00061018206,0.03866028],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99925715,0.00024993924,0.000042885673,0.00022487399,0.00014902694,0.000076170836],"domain_scores_gemma":[0.99527836,0.0035302066,0.00038171036,0.00026358277,0.00025145922,0.00029479613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011825693,0.0017429207,0.0014987135,0.0013495531,0.00076607923,0.002152613,0.002312327,0.0034504395,0.0072552213],"category_scores_gemma":[0.009798901,0.0013823754,0.0010395928,0.0014027988,0.0018249708,0.0065824934,0.0041038757,0.003903377,0.0007639705],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002568535,0.0001831022,0.0007450154,0.0005395033,0.000071241244,0.00024963386,0.00041404468,0.37960416,0.0025395502,0.5403616,0.0066723255,0.068363056],"study_design_scores_gemma":[0.000039892537,0.000066449626,0.00014096702,0.000053362768,0.000021476206,0.00011265849,0.00013078588,0.47054508,0.00071700057,0.52407265,0.0040775635,0.00002212204],"about_ca_topic_score_codex":0.0020127813,"about_ca_topic_score_gemma":0.0016207951,"teacher_disagreement_score":0.0072552213,"about_ca_system_score_codex":0.0009632261,"about_ca_system_score_gemma":0.00067646627,"threshold_uncertainty_score":0.02427113},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6318461,0.002192502,0.2715111,0.0009153211,0.00028928817,0.00012604163,0.0005424867,0.00044967467,0.0921275],"genre_scores_gemma":[0.92249227,0.0013200844,0.057414472,0.00014759135,0.00014540364,0.000058538273,0.0004275153,0.00017135138,0.017822832],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99909616,0.00013413683,0.000052335483,0.00015371284,0.00045221305,0.000111556736],"domain_scores_gemma":[0.99884725,0.00023327595,0.00022609341,0.00012811439,0.0004098793,0.00015534298],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006151192,0.00063378224,0.00042011804,0.0029456837,0.0008089677,0.0021969676,0.00082381535,0.0007316529,0.004996568],"category_scores_gemma":[0.004436553,0.00023232306,0.00031811386,0.0015597377,0.0022923509,0.0031853924,0.0020198356,0.0014519279,0.0009223739],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010405195,0.000020257527,0.001031596,0.000088691595,0.000012775079,0.00024157346,0.00036792492,0.008880989,0.006055687,0.95153666,0.0012427637,0.030416988],"study_design_scores_gemma":[0.00004087184,0.00014193481,0.0019343158,0.00012243155,0.000017506254,0.0010597402,0.000675933,0.07045349,0.009758754,0.8726723,0.04304087,0.00008180627],"about_ca_topic_score_codex":0.0014013828,"about_ca_topic_score_gemma":0.0007472852,"teacher_disagreement_score":0.004996568,"about_ca_system_score_codex":0.0013087197,"about_ca_system_score_gemma":0.00028529126,"threshold_uncertainty_score":0.016715169},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32814556,0.0004950992,0.6126883,0.00062234997,0.00049382175,0.00014884667,0.0003509674,0.0011732153,0.055881824],"genre_scores_gemma":[0.66545236,0.0006593511,0.30431113,0.00019831772,0.000082683815,0.00007928212,0.00051469385,0.0010100318,0.02769214],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994438,0.00012214508,0.000035845747,0.00011331079,0.00016677906,0.000118037475],"domain_scores_gemma":[0.997315,0.0012608166,0.00018100711,0.0007028207,0.00033596068,0.00020443987],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006016989,0.00066534395,0.0007880211,0.001675286,0.0009772712,0.0017960148,0.0011417663,0.0010571021,0.011038118],"category_scores_gemma":[0.003880327,0.00083255686,0.0006850065,0.0013986636,0.0019979521,0.002562461,0.0034774374,0.0019568559,0.001389438],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045118402,0.00011076592,0.0021098265,0.00030794553,0.00003900639,0.0004651992,0.0012528509,0.060067594,0.03956748,0.72049075,0.0073158895,0.16782153],"study_design_scores_gemma":[0.000069796195,0.00011673046,0.0011751015,0.00012696469,0.000048996324,0.00051001087,0.0006033245,0.14293508,0.023871437,0.8009795,0.02951036,0.0000526032],"about_ca_topic_score_codex":0.00161474,"about_ca_topic_score_gemma":0.002909622,"teacher_disagreement_score":0.011038118,"about_ca_system_score_codex":0.0008824866,"about_ca_system_score_gemma":0.0003746222,"threshold_uncertainty_score":0.03692621},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38052315,0.00036824142,0.57881963,0.00080697244,0.00032044458,0.00008393318,0.00031612164,0.0009937079,0.037767842],"genre_scores_gemma":[0.8525153,0.00040250822,0.1251805,0.00012399079,0.00014653779,0.00008338871,0.00036965375,0.0005154735,0.020662775],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996822,0.000054908392,0.000012207747,0.000083822924,0.00012300756,0.00004400306],"domain_scores_gemma":[0.9986066,0.0005082293,0.00020200184,0.00028783092,0.00025684823,0.00013837357],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003949036,0.0004186424,0.0004451991,0.0012748562,0.0011983898,0.0018350938,0.0007189583,0.0010503833,0.006236086],"category_scores_gemma":[0.0046745865,0.0005244616,0.00024901022,0.0008160554,0.0013021214,0.002306684,0.0025621988,0.0010298761,0.0014392143],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014523929,0.00018662596,0.007326903,0.00027947238,0.00004927884,0.001176105,0.0013765681,0.21965477,0.048656028,0.4310772,0.011878282,0.27688634],"study_design_scores_gemma":[0.00009083078,0.00026683108,0.0031756011,0.00009598108,0.00004329033,0.0007486415,0.0009566904,0.63008404,0.029729478,0.30221915,0.03251513,0.0000742955],"about_ca_topic_score_codex":0.00056514214,"about_ca_topic_score_gemma":0.00074551406,"teacher_disagreement_score":0.006236086,"about_ca_system_score_codex":0.00036584676,"about_ca_system_score_gemma":0.00028603207,"threshold_uncertainty_score":0.020861745},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43777272,0.0017371761,0.36996448,0.002025846,0.00030514147,0.00008633759,0.00064963993,0.00047547626,0.18698326],"genre_scores_gemma":[0.9283039,0.0011660533,0.022500645,0.00034413277,0.00027511446,0.000108747685,0.0006745446,0.0002139892,0.04641291],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99943036,0.00009841203,0.000018338409,0.00010540373,0.00024979928,0.000097581105],"domain_scores_gemma":[0.99900764,0.00034751368,0.00010902972,0.00018711339,0.00016918706,0.00017948997],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064460497,0.0006475056,0.00075780763,0.0018498974,0.0014532765,0.0015475765,0.00081707747,0.00085305993,0.009441488],"category_scores_gemma":[0.0024400789,0.00042123263,0.0007348753,0.0009919944,0.0015658455,0.002993445,0.0026804823,0.001780526,0.0007432983],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034647113,0.000010991876,0.00022589676,0.000032560616,0.0000118003245,0.00009379841,0.00013771835,0.0029726746,0.00096428726,0.98626316,0.001678418,0.007574066],"study_design_scores_gemma":[0.000017196468,0.000021709184,0.00040936796,0.000016135371,0.000013901576,0.000283249,0.00009385152,0.016200172,0.0008523349,0.9739455,0.008135732,0.0000108409295],"about_ca_topic_score_codex":0.0005567083,"about_ca_topic_score_gemma":0.0005516504,"teacher_disagreement_score":0.009441488,"about_ca_system_score_codex":0.00095722225,"about_ca_system_score_gemma":0.00037132474,"threshold_uncertainty_score":0.03158492},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06062192,0.0060908776,0.86956984,0.007767146,0.00036190735,0.00045396943,0.0033807901,0.0012390498,0.05051446],"genre_scores_gemma":[0.658579,0.011257838,0.29324007,0.0013094925,0.0016393809,0.0018720819,0.009684093,0.001608292,0.020809708],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99084914,0.0024250601,0.0006605537,0.0021618996,0.0029118045,0.0009915007],"domain_scores_gemma":[0.96529794,0.025910834,0.0015975782,0.005336847,0.0012290515,0.0006277207],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033385328,0.0022003748,0.0027660802,0.0021716282,0.0020238457,0.009519055,0.0052949637,0.0031470666,0.023125187],"category_scores_gemma":[0.03324318,0.0014935725,0.0038779727,0.0062920507,0.0035172112,0.01931891,0.0044643832,0.0082581565,0.0022296994],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017425798,0.00018773874,0.0017508864,0.0010379829,0.00019406504,0.00018593093,0.00041521786,0.15501177,0.001436332,0.76379305,0.013135908,0.06267682],"study_design_scores_gemma":[0.000039314502,0.000028474566,0.00049467274,0.00007241416,0.000045430206,0.00020741377,0.00010913336,0.1022026,0.0006777915,0.88504577,0.011052124,0.00002482696],"about_ca_topic_score_codex":0.0022762355,"about_ca_topic_score_gemma":0.00204442,"teacher_disagreement_score":0.023125187,"about_ca_system_score_codex":0.0057553165,"about_ca_system_score_gemma":0.0022162127,"threshold_uncertainty_score":0.077361524},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022740662,0.0017648782,0.9561255,0.0023425887,0.00018094236,0.00018471076,0.00096379855,0.0015734081,0.014123577],"genre_scores_gemma":[0.57796025,0.0029787773,0.3681215,0.0013524038,0.0012078456,0.000766718,0.0062220804,0.0012588892,0.04013157],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970066,0.0007577512,0.00014727689,0.0008607722,0.00090941327,0.00031812204],"domain_scores_gemma":[0.9939121,0.0035802727,0.00031687954,0.0014121225,0.000576689,0.00020204845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017734676,0.001323642,0.003067061,0.0014718188,0.0012721714,0.003804328,0.0037608533,0.0034628755,0.025011027],"category_scores_gemma":[0.01225807,0.000925948,0.0011904547,0.0029996291,0.002219792,0.007189246,0.0053353524,0.0032821952,0.0045418926],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00079673604,0.00031965278,0.0010504406,0.001127557,0.00015527342,0.0006358725,0.00051791035,0.18426247,0.008143317,0.5145055,0.07147648,0.21700883],"study_design_scores_gemma":[0.00015247522,0.00014070768,0.00028550415,0.00005472773,0.000066208115,0.000530598,0.00030639445,0.5360088,0.0046741436,0.43729007,0.02045515,0.000035259745],"about_ca_topic_score_codex":0.001529508,"about_ca_topic_score_gemma":0.0015795609,"teacher_disagreement_score":0.025011027,"about_ca_system_score_codex":0.0016838216,"about_ca_system_score_gemma":0.001082111,"threshold_uncertainty_score":0.08367026},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0076708714,0.013940735,0.93358517,0.0027065738,0.0017524587,0.000056506167,0.00021121286,0.0006303391,0.03944616],"genre_scores_gemma":[0.14922804,0.028334964,0.7804791,0.0017419673,0.004095793,0.0003465333,0.0009736933,0.0019788004,0.03282114],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99771714,0.00058547664,0.00012323262,0.0004908308,0.00092550594,0.00015791722],"domain_scores_gemma":[0.99420786,0.0030988415,0.00020451163,0.0016335822,0.0006699823,0.00018519147],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033628007,0.0021829002,0.0020843777,0.003499916,0.0012099941,0.0022174772,0.0038797266,0.0022787102,0.013695068],"category_scores_gemma":[0.014122581,0.0014364442,0.00164193,0.005679061,0.0027487604,0.008882946,0.007939575,0.006308452,0.003821658],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026403225,0.00008695739,0.00028951705,0.0012415245,0.00008788958,0.000081095495,0.0001971693,0.044633422,0.0039692465,0.5561491,0.021920612,0.3710794],"study_design_scores_gemma":[0.00007220115,0.00007350227,0.0003378951,0.0003650917,0.000096802294,0.00016032523,0.00006694513,0.16118875,0.0045092506,0.7414662,0.09162652,0.000036379042],"about_ca_topic_score_codex":0.0011259667,"about_ca_topic_score_gemma":0.0012187185,"teacher_disagreement_score":0.013695068,"about_ca_system_score_codex":0.0013283822,"about_ca_system_score_gemma":0.0009110529,"threshold_uncertainty_score":0.045814514},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11713279,0.04438126,0.65554833,0.066784464,0.0072507137,0.000106913954,0.0022357986,0.008754558,0.09780513],"genre_scores_gemma":[0.81542104,0.009349426,0.1474761,0.004563513,0.0034421065,0.00013694268,0.0008388379,0.0029265217,0.015845556],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973851,0.0006132653,0.00010987317,0.00073372916,0.0008305515,0.0003275927],"domain_scores_gemma":[0.9840352,0.0098130135,0.00075464085,0.0028545707,0.0015886549,0.0009538327],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041837916,0.0010605772,0.0017055593,0.0015573537,0.0013356043,0.003609374,0.002992493,0.0042828666,0.014446596],"category_scores_gemma":[0.041685253,0.00058413745,0.0006591342,0.0014183923,0.0032638935,0.014299465,0.002248615,0.0038838454,0.0039156605],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010998232,0.00038765054,0.008679911,0.0011045911,0.0002367643,0.00023716023,0.0003190941,0.06465422,0.009991308,0.30517122,0.07162493,0.53649336],"study_design_scores_gemma":[0.00010437968,0.00042370765,0.0035278695,0.0005122645,0.0001528159,0.0005471692,0.00042114066,0.27824235,0.011686343,0.6681639,0.03604193,0.00017601355],"about_ca_topic_score_codex":0.0024412633,"about_ca_topic_score_gemma":0.0018323829,"teacher_disagreement_score":0.014446596,"about_ca_system_score_codex":0.0017861053,"about_ca_system_score_gemma":0.001390256,"threshold_uncertainty_score":0.048328638},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09322341,0.0147450045,0.7486243,0.016602242,0.0014638476,0.00030894313,0.002060841,0.0016377541,0.121333696],"genre_scores_gemma":[0.5867971,0.010878966,0.35470453,0.0041104387,0.002197227,0.0009766027,0.0030343356,0.002213646,0.035087146],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9935061,0.0022639427,0.0002788544,0.0009708389,0.0019407312,0.0010397044],"domain_scores_gemma":[0.95179987,0.038823754,0.0014642219,0.004211459,0.0016660868,0.0020345852],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00813034,0.0037707423,0.0041106087,0.004130126,0.00302756,0.0089905085,0.0076481793,0.0042394167,0.021029865],"category_scores_gemma":[0.044724196,0.0018584852,0.0020231178,0.0057134572,0.005757664,0.018732492,0.010952349,0.011366616,0.0034182712],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010532284,0.00038421966,0.0011280605,0.0009573931,0.0001573663,0.00013555592,0.00054755004,0.14598711,0.0027553535,0.75095075,0.031167418,0.064776085],"study_design_scores_gemma":[0.00012043364,0.00007823914,0.00027641217,0.00013314195,0.00007131402,0.0001060093,0.00018523575,0.18674397,0.0010609259,0.80406266,0.0071148584,0.000046778066],"about_ca_topic_score_codex":0.0023074863,"about_ca_topic_score_gemma":0.0042664027,"teacher_disagreement_score":0.021029865,"about_ca_system_score_codex":0.005813127,"about_ca_system_score_gemma":0.0031568022,"threshold_uncertainty_score":0.0703519},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019183299,0.0072637447,0.9331501,0.0040118457,0.00056423765,0.00020289788,0.0002900582,0.002380884,0.032952946],"genre_scores_gemma":[0.25961864,0.004568242,0.70616406,0.0029254712,0.0013265088,0.0007019152,0.0007726208,0.0037772341,0.020145416],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9769241,0.008298696,0.0011378883,0.0029271767,0.0084755495,0.0022365658],"domain_scores_gemma":[0.8968215,0.07825243,0.0027267307,0.01672801,0.0041278456,0.0013434839],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.02331717,0.0045222924,0.0038449299,0.004099581,0.0030702674,0.0060848603,0.005930884,0.003391804,0.018876132],"category_scores_gemma":[0.11087898,0.0019441888,0.0030161021,0.0082525825,0.012128766,0.034808293,0.011323199,0.012436364,0.0058512697],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0021231156,0.00036947595,0.0021561284,0.0007597763,0.0001182724,0.00015347725,0.00059204653,0.07438835,0.004039153,0.71099985,0.016465412,0.18783498],"study_design_scores_gemma":[0.0002298161,0.00025985236,0.00036384648,0.00019883104,0.00010896403,0.000214509,0.0001331104,0.17410062,0.004983029,0.8047987,0.014547637,0.000060995288],"about_ca_topic_score_codex":0.0038250939,"about_ca_topic_score_gemma":0.0053749867,"teacher_disagreement_score":0.02331717,"about_ca_system_score_codex":0.0055700145,"about_ca_system_score_gemma":0.005374026,"threshold_uncertainty_score":0.1233145},"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":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025588986,0.053194042,0.8997035,0.0013478926,0.002365817,0.000039585455,0.000113382695,0.00028973867,0.04038713],"genre_scores_gemma":[0.08177104,0.05285496,0.80228853,0.0009938352,0.0028899824,0.00015415743,0.0003097113,0.00069928635,0.05803856],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990472,0.00028195855,0.000050177303,0.00018043333,0.00039444328,0.000045766887],"domain_scores_gemma":[0.99838567,0.0008086618,0.00007321912,0.00026141055,0.00037691862,0.0000941454],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019246404,0.00095664244,0.0011184029,0.0018775353,0.00061795226,0.0016822226,0.0016554064,0.0015208791,0.0059558805],"category_scores_gemma":[0.0047653317,0.0008279146,0.0009060432,0.002277038,0.002402702,0.0023313197,0.0022677148,0.003784918,0.0036682459],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012255459,0.00007022699,0.00023617857,0.00054963405,0.000043982403,0.000044261124,0.00015425832,0.022525864,0.0019808984,0.4276967,0.016677372,0.5298981],"study_design_scores_gemma":[0.000044376844,0.00014838208,0.00054270885,0.00045716256,0.00004044787,0.00043526402,0.000083706815,0.21318568,0.0038900194,0.3894595,0.39159337,0.000119374374],"about_ca_topic_score_codex":0.0016587576,"about_ca_topic_score_gemma":0.0012348449,"teacher_disagreement_score":0.0059558805,"about_ca_system_score_codex":0.00059596397,"about_ca_system_score_gemma":0.001053538,"threshold_uncertainty_score":0.019924402},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0750067,0.0029217459,0.8496522,0.003337757,0.0006896495,0.00031348015,0.0013516685,0.0016150809,0.0651117],"genre_scores_gemma":[0.57743114,0.003441779,0.37523478,0.0014850545,0.0007548877,0.0011679383,0.0030869804,0.0028198373,0.034577537],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9940924,0.0014624506,0.0002851858,0.0010849381,0.0019863518,0.0010886355],"domain_scores_gemma":[0.94071555,0.043249093,0.002554055,0.0071336427,0.0028954209,0.0034522302],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0067620794,0.0034271358,0.0044265157,0.0051645697,0.004353781,0.007470116,0.011210138,0.0063441014,0.033545386],"category_scores_gemma":[0.07139934,0.0031620206,0.0027659999,0.0059453314,0.006167624,0.018002337,0.013403308,0.012173495,0.0045190975],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005315543,0.0002620151,0.0009929122,0.0006038797,0.00007955052,0.00015289722,0.00057230046,0.14182658,0.0030944555,0.79980403,0.014560019,0.037519746],"study_design_scores_gemma":[0.00007265324,0.000091977636,0.00029578994,0.0001231075,0.00008070962,0.00010891669,0.00017552557,0.22823793,0.0016328399,0.76390666,0.005233768,0.000040137053],"about_ca_topic_score_codex":0.0032118538,"about_ca_topic_score_gemma":0.005364517,"teacher_disagreement_score":0.033545386,"about_ca_system_score_codex":0.0029977958,"about_ca_system_score_gemma":0.0024450994,"threshold_uncertainty_score":0.112220466},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10607864,0.00045589817,0.88423246,0.00043381177,0.00016158009,0.000054177337,0.0003000628,0.0008086041,0.0074746693],"genre_scores_gemma":[0.76632184,0.00034534684,0.23036972,0.00014742049,0.000091833455,0.000044763987,0.00033771657,0.00013970622,0.0022016468],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988117,0.00039282447,0.000040571576,0.00030928833,0.00030776122,0.00013782507],"domain_scores_gemma":[0.99820304,0.0006848647,0.00030765083,0.0004395583,0.00024709574,0.000117814845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007934243,0.00068911194,0.0009897533,0.0012769994,0.00046968245,0.0015349407,0.0010477094,0.0009850904,0.0020985345],"category_scores_gemma":[0.004987201,0.00060800003,0.0005677273,0.001842868,0.0008006487,0.0024469155,0.0017729038,0.001052181,0.000549019],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015176567,0.00017830783,0.014464798,0.00018764273,0.00020469713,0.00034828242,0.00042793434,0.5144386,0.060449447,0.0625657,0.0077346736,0.3374823],"study_design_scores_gemma":[0.000036955345,0.00011290727,0.0019664494,0.000016594546,0.00003516994,0.00013648953,0.00014083226,0.959297,0.009796101,0.024936613,0.0034943204,0.00003058976],"about_ca_topic_score_codex":0.0016937789,"about_ca_topic_score_gemma":0.0017294358,"teacher_disagreement_score":0.0020985345,"about_ca_system_score_codex":0.0005380266,"about_ca_system_score_gemma":0.0005031746,"threshold_uncertainty_score":0.0070202947},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12561536,0.0021137462,0.7781333,0.002041421,0.00085683586,0.00007289709,0.0003710984,0.0012640789,0.08953121],"genre_scores_gemma":[0.71000016,0.0021087555,0.19288638,0.00039484582,0.0003582729,0.0000883804,0.0006991348,0.0011243206,0.09233975],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99967575,0.00008691008,0.000018123817,0.00007084625,0.00011125491,0.00003714413],"domain_scores_gemma":[0.9994019,0.00022260835,0.00004655719,0.00016381974,0.00009875577,0.00006626147],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030934066,0.0005567558,0.0006002111,0.0012905569,0.0007118155,0.0020712782,0.00066001236,0.00079042016,0.010612193],"category_scores_gemma":[0.0018691211,0.00055509515,0.00050644716,0.0010083959,0.0013777792,0.002216994,0.0026329271,0.0021206178,0.0021587147],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037303435,0.000019246789,0.00026563063,0.000057741003,0.00001003346,0.0000567079,0.00022758586,0.014040026,0.0020123515,0.93476903,0.004452381,0.04405192],"study_design_scores_gemma":[0.000011377312,0.000020897023,0.00019011114,0.00002686757,0.000007961216,0.000093320166,0.00013789261,0.051913127,0.0015792558,0.91913086,0.02687838,0.00000982023],"about_ca_topic_score_codex":0.0009876724,"about_ca_topic_score_gemma":0.0010294871,"teacher_disagreement_score":0.010612193,"about_ca_system_score_codex":0.00061586854,"about_ca_system_score_gemma":0.0002467014,"threshold_uncertainty_score":0.0355013},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22407211,0.00051277346,0.7624981,0.00076684385,0.0001286273,0.00017353983,0.0009009505,0.00240024,0.008546852],"genre_scores_gemma":[0.5096605,0.00019950453,0.4844594,0.00014747454,0.000066070286,0.00021314004,0.0019441114,0.00033954813,0.0029702343],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999385,0.00010409126,0.000028926694,0.00017327076,0.00015361379,0.00015515737],"domain_scores_gemma":[0.9983348,0.0010722642,0.00014446027,0.0001564036,0.0001661187,0.00012595773],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086409145,0.0014111928,0.0017743009,0.0012914176,0.00086562126,0.0015631893,0.0023758735,0.0024796014,0.006413935],"category_scores_gemma":[0.0048505445,0.00064997975,0.0011448817,0.0014364012,0.0010712729,0.003049235,0.0023278832,0.0013634539,0.0009960448],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022012046,0.0000854,0.0012904532,0.00011343502,0.000031151467,0.000103405284,0.000093108036,0.9612878,0.0011129165,0.0077540027,0.0024082183,0.025499988],"study_design_scores_gemma":[0.000017133656,0.000017540087,0.00008768405,0.000004597778,0.0000024256701,0.000014253858,0.00003396838,0.9933036,0.0002089418,0.006022582,0.00028470196,0.0000026015005],"about_ca_topic_score_codex":0.010432619,"about_ca_topic_score_gemma":0.011435446,"teacher_disagreement_score":0.010432619,"about_ca_system_score_codex":0.0014166207,"about_ca_system_score_gemma":0.0013158777,"threshold_uncertainty_score":0.021456778},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08395982,0.0006547829,0.90353125,0.0010535425,0.00010879038,0.00010421342,0.00041483188,0.001960343,0.008212548],"genre_scores_gemma":[0.82966727,0.00030748974,0.1641907,0.00027271843,0.00017811949,0.00024961837,0.0006521588,0.0006266384,0.0038553146],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9936015,0.0015758629,0.00038735862,0.0015063935,0.001961391,0.0009675925],"domain_scores_gemma":[0.93904215,0.033629358,0.0061576595,0.017028397,0.0025347087,0.0016077958],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0055394894,0.0013878423,0.0027022297,0.0008657385,0.001336243,0.0050656283,0.005522614,0.0022498309,0.0076302965],"category_scores_gemma":[0.03763207,0.0012646833,0.0013369475,0.0014839696,0.0034707075,0.012388474,0.00538887,0.0040967236,0.0012376215],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019496129,0.00053915975,0.0037891674,0.0005478739,0.00021923316,0.00046807312,0.0003960673,0.56424636,0.012564093,0.25374556,0.010450895,0.15108383],"study_design_scores_gemma":[0.00005067092,0.00012311971,0.00029604865,0.000014481828,0.000034531702,0.00018067179,0.000047200865,0.8542818,0.0042065457,0.13946465,0.0012795865,0.000020750134],"about_ca_topic_score_codex":0.0013581772,"about_ca_topic_score_gemma":0.0016156742,"teacher_disagreement_score":0.0076302965,"about_ca_system_score_codex":0.0022569762,"about_ca_system_score_gemma":0.0021153018,"threshold_uncertainty_score":0.02929598},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.74340045,0.0014511945,0.22988321,0.0003425706,0.000047358335,0.000050440434,0.00048277728,0.00026019677,0.02408185],"genre_scores_gemma":[0.9663302,0.00044380693,0.03153327,0.000018879979,0.000055997873,0.000049396836,0.00018693336,0.00008245453,0.0012990433],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99942374,0.00021645869,0.000036203484,0.00011699632,0.0001530366,0.000053514268],"domain_scores_gemma":[0.99466574,0.0038963107,0.0005545281,0.00021298011,0.0003194604,0.00035093425],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008707519,0.0005353446,0.0007846869,0.0011285761,0.00046719486,0.0018873967,0.00094918004,0.0005946916,0.0013760548],"category_scores_gemma":[0.009450697,0.00058335747,0.00031392818,0.0009099377,0.0016392212,0.0014934827,0.0012783087,0.00055740436,0.00022096696],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013998903,0.00015628361,0.017525993,0.0005093006,0.000071985894,0.0008825832,0.0010228278,0.36254808,0.033325642,0.46568504,0.0036472154,0.11322527],"study_design_scores_gemma":[0.00007018057,0.00020146601,0.0065476373,0.00006132255,0.000037139915,0.0012737842,0.00042134957,0.7029902,0.012600415,0.2716491,0.004106312,0.000041167536],"about_ca_topic_score_codex":0.0002669216,"about_ca_topic_score_gemma":0.00020623892,"teacher_disagreement_score":0.0018873967,"about_ca_system_score_codex":0.00040443984,"about_ca_system_score_gemma":0.00023797857,"threshold_uncertainty_score":0.0046049953},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010777463,0.000053641073,0.98694175,0.00007487276,0.000048100927,0.00003605927,0.000033372602,0.00060771964,0.0014270467],"genre_scores_gemma":[0.37689373,0.000057869558,0.62002385,0.00009397439,0.000030115756,0.00013723673,0.00014330696,0.00043670632,0.0021830914],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989717,0.0002758017,0.000055466986,0.000100086334,0.000535178,0.000061809485],"domain_scores_gemma":[0.99644214,0.0014179735,0.00018867427,0.00096920546,0.0008216375,0.0001604021],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016873435,0.0006546411,0.0010570146,0.0007884143,0.0004947935,0.0010170523,0.0023395836,0.0012923202,0.0039759655],"category_scores_gemma":[0.009058183,0.0005280174,0.0005214096,0.00050974893,0.00094333745,0.0013341836,0.0026200935,0.0012907326,0.00082785037],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004973089,0.00016009196,0.001248877,0.0002794014,0.000049710994,0.000113953916,0.000189115,0.6782524,0.024040725,0.07872973,0.0057133334,0.21072535],"study_design_scores_gemma":[0.000033211254,0.000021569671,0.00006143625,0.000005372875,0.0000038667417,0.000018294842,0.000006381579,0.98438036,0.0024278902,0.012476457,0.0005581187,0.0000069276803],"about_ca_topic_score_codex":0.0017872509,"about_ca_topic_score_gemma":0.003251558,"teacher_disagreement_score":0.0039759655,"about_ca_system_score_codex":0.00068684365,"about_ca_system_score_gemma":0.00085713185,"threshold_uncertainty_score":0.013300896},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09481899,0.0029567746,0.87678564,0.0016476448,0.0002192251,0.00009571218,0.0003175888,0.00019098465,0.022967285],"genre_scores_gemma":[0.63716817,0.003966077,0.3433277,0.00041232517,0.0004678632,0.00021916558,0.0007413537,0.00029404624,0.013403255],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993699,0.00023313217,0.0000344247,0.000113774826,0.00018141813,0.00006727635],"domain_scores_gemma":[0.99586654,0.002944653,0.0002744294,0.00027936208,0.0004406759,0.00019427342],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011604114,0.0007371742,0.0013127563,0.001501986,0.0011105409,0.0016100629,0.002130556,0.0014007417,0.0048855306],"category_scores_gemma":[0.013111434,0.00067158946,0.0007630185,0.0021693944,0.0013241097,0.0047650016,0.0024179698,0.0015419908,0.0005161852],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002292361,0.000083874154,0.0008624844,0.0002722685,0.00003976929,0.00012739966,0.000323263,0.15863162,0.0021077837,0.7551854,0.0075401952,0.07459666],"study_design_scores_gemma":[0.000023749255,0.000042923217,0.00031186073,0.00005074598,0.000021958416,0.00012510964,0.00010837697,0.3477725,0.00049933325,0.64729923,0.0037312955,0.000012910891],"about_ca_topic_score_codex":0.0011522329,"about_ca_topic_score_gemma":0.002028908,"teacher_disagreement_score":0.0048855306,"about_ca_system_score_codex":0.0010445063,"about_ca_system_score_gemma":0.00063782226,"threshold_uncertainty_score":0.016343713},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10843338,0.0018729506,0.81599635,0.0036137134,0.00056528416,0.00034583878,0.0019183677,0.005064288,0.06218992],"genre_scores_gemma":[0.54756206,0.0021237985,0.39818904,0.0013871297,0.0005921022,0.000464256,0.0046344805,0.0029333457,0.042113744],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99649364,0.0005043493,0.00014597204,0.0008117118,0.0011827081,0.00086165743],"domain_scores_gemma":[0.9841211,0.010251377,0.00065183686,0.003535248,0.0007269845,0.00071339874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019670741,0.002800927,0.0025666053,0.001926874,0.0023466975,0.00531019,0.007824521,0.0031660076,0.02703508],"category_scores_gemma":[0.017137261,0.0015884186,0.002899836,0.003894484,0.0035765215,0.015888741,0.008443115,0.007559491,0.006862234],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019126334,0.0007599482,0.0022209396,0.0013958005,0.00014917247,0.00040082945,0.00087070354,0.2968305,0.016898492,0.35660565,0.041996848,0.27995843],"study_design_scores_gemma":[0.00014900486,0.00019478894,0.00043474042,0.0000798271,0.00011393253,0.00019548718,0.00019349022,0.49225008,0.006576438,0.49048927,0.009277537,0.00004540748],"about_ca_topic_score_codex":0.0053624134,"about_ca_topic_score_gemma":0.009667308,"teacher_disagreement_score":0.02703508,"about_ca_system_score_codex":0.0031320117,"about_ca_system_score_gemma":0.0023842982,"threshold_uncertainty_score":0.090441406},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45047286,0.0024832506,0.49278784,0.0012308531,0.0003059687,0.00012855975,0.00055544014,0.00075672596,0.05127845],"genre_scores_gemma":[0.85534745,0.0017718197,0.12313095,0.0002381893,0.00024890495,0.00010805325,0.001089578,0.00042781723,0.01763726],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992812,0.00018323271,0.000040408195,0.00014223318,0.00022632586,0.00012665968],"domain_scores_gemma":[0.997419,0.001519515,0.00030264675,0.00046104915,0.00013153392,0.00016632804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042822128,0.00061652367,0.0010042198,0.0015484485,0.0012958173,0.0025762024,0.0013388615,0.0018323654,0.00853193],"category_scores_gemma":[0.0060680015,0.0009771786,0.0009581822,0.0033170336,0.0021563002,0.004143886,0.0026792078,0.0016338114,0.00096521777],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026381382,0.000121028956,0.002303213,0.00031849774,0.0000299947,0.00052826817,0.0011213461,0.099481255,0.0046446207,0.7545179,0.0086968085,0.12797321],"study_design_scores_gemma":[0.000033776938,0.000052151558,0.00087191956,0.00005733992,0.000027089203,0.0004991525,0.00038123762,0.16103283,0.0031828561,0.8248292,0.009012619,0.000019871972],"about_ca_topic_score_codex":0.0016898682,"about_ca_topic_score_gemma":0.0013967116,"teacher_disagreement_score":0.00853193,"about_ca_system_score_codex":0.0006295189,"about_ca_system_score_gemma":0.00032074592,"threshold_uncertainty_score":0.028542161},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09474459,0.0019892652,0.837627,0.003806828,0.0002850405,0.00045789912,0.0038192903,0.033073116,0.024196994],"genre_scores_gemma":[0.440813,0.001088911,0.5254131,0.0006821676,0.00025719422,0.0005703285,0.007798114,0.0029763978,0.02040084],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964818,0.0003656994,0.00024720965,0.00067978736,0.0015348418,0.0006906064],"domain_scores_gemma":[0.99386626,0.0019169954,0.00043517182,0.003126733,0.00040449755,0.0002503058],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009830114,0.0019396105,0.0020181139,0.001391309,0.0014592619,0.003379012,0.0050878082,0.0017713087,0.019773511],"category_scores_gemma":[0.0058071553,0.0010362072,0.0016574875,0.0046669166,0.0015948003,0.013450358,0.0052760663,0.0026244048,0.0061852206],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0039647627,0.00072496553,0.003173765,0.00094721344,0.00027486208,0.00050766923,0.0008632924,0.14514442,0.050968315,0.06766508,0.06606752,0.659698],"study_design_scores_gemma":[0.0011623125,0.00050289603,0.0017032055,0.00009367649,0.00028715402,0.0010213129,0.0006533336,0.6829229,0.061846655,0.20274493,0.04691023,0.00015142073],"about_ca_topic_score_codex":0.0059376066,"about_ca_topic_score_gemma":0.010061242,"teacher_disagreement_score":0.019773511,"about_ca_system_score_codex":0.002308747,"about_ca_system_score_gemma":0.0017833564,"threshold_uncertainty_score":0.066149},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02933404,0.0003013567,0.96559906,0.00025869985,0.00012954652,0.000091961374,0.00037778073,0.0007595458,0.0031480377],"genre_scores_gemma":[0.305233,0.0008231144,0.68266326,0.00017794165,0.00022416837,0.00048091737,0.0021055788,0.00038824393,0.007903763],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998171,0.0002793865,0.00009735364,0.0004951198,0.00084052363,0.00011664491],"domain_scores_gemma":[0.9981964,0.0005373589,0.00015943858,0.00031629868,0.0006179589,0.00017255379],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014566504,0.0007938902,0.0017264747,0.002267705,0.00078535,0.0028021752,0.0010865146,0.001564423,0.005546497],"category_scores_gemma":[0.0073726624,0.0005483075,0.0011976412,0.0020490412,0.0013459981,0.0027129876,0.0028806867,0.0016981864,0.0019990697],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011295931,0.0001969372,0.005845343,0.0005416685,0.0002833392,0.00038971705,0.00048640496,0.16070612,0.050230946,0.111002885,0.009439981,0.65974706],"study_design_scores_gemma":[0.00009522163,0.0008404518,0.0041580014,0.00018784069,0.00009380599,0.0008409505,0.0004442573,0.778788,0.03545653,0.15197764,0.027007733,0.000109600056],"about_ca_topic_score_codex":0.00091164774,"about_ca_topic_score_gemma":0.0008531506,"teacher_disagreement_score":0.005546497,"about_ca_system_score_codex":0.0006173992,"about_ca_system_score_gemma":0.0013384535,"threshold_uncertainty_score":0.018554926},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12226258,0.0013089954,0.36044332,0.0010196674,0.0014480666,0.00047223433,0.005964697,0.0044644806,0.5026159],"genre_scores_gemma":[0.5614298,0.0008713789,0.20341693,0.00026883528,0.00016380059,0.0002747377,0.0060783173,0.0009312996,0.22656496],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997297,0.000027939705,0.00001363653,0.00007256068,0.00010319287,0.000052950767],"domain_scores_gemma":[0.9996823,0.000055153956,0.000023133121,0.00008839664,0.000094559946,0.000056562465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009957798,0.0006952,0.0005111432,0.0005209369,0.00065539515,0.0012095857,0.0007337281,0.0006563938,0.082266256],"category_scores_gemma":[0.001188743,0.00042301402,0.00028556856,0.00083802774,0.00055548764,0.0008061688,0.0010608571,0.00061588676,0.011768224],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016029708,0.00028332134,0.0021796005,0.0006271029,0.00008639436,0.0013401519,0.00060766406,0.089178674,0.07346899,0.36042333,0.18992226,0.28027946],"study_design_scores_gemma":[0.00044575962,0.00047069122,0.0044029104,0.00018130087,0.00006471773,0.0010942103,0.0005563808,0.12812683,0.027069682,0.1300827,0.70741963,0.00008516596],"about_ca_topic_score_codex":0.0033039418,"about_ca_topic_score_gemma":0.0048477137,"teacher_disagreement_score":0.082266256,"about_ca_system_score_codex":0.00047259394,"about_ca_system_score_gemma":0.00034377308,"threshold_uncertainty_score":0.27520806},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015922613,0.074915566,0.013631642,0.033408605,0.16274148,0.00026865155,0.014525407,0.0019731699,0.6969432],"genre_scores_gemma":[0.007294011,0.043942448,0.008615161,0.005257829,0.064178854,0.00020924184,0.021569785,0.0022603853,0.8466723],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99870074,0.000092077455,0.000075982054,0.0003257864,0.00068518985,0.00012020417],"domain_scores_gemma":[0.9962697,0.00057925505,0.00013568698,0.00036604443,0.0016957083,0.0009536385],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00079042953,0.0017771738,0.0018699158,0.004760129,0.001577202,0.006238536,0.001843513,0.0014422518,0.38960418],"category_scores_gemma":[0.0034882727,0.0008187816,0.0013453331,0.0061966274,0.0009997254,0.003479325,0.0028829924,0.0037362953,0.18748564],"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.000023772376,0.000025635398,0.0000629448,0.00022845315,0.00000835368,0.000028498245,0.000006994587,0.00018267783,0.00023396156,0.00501189,0.9433613,0.05082554],"study_design_scores_gemma":[0.000010192245,0.000022112423,0.00034991105,0.00019860074,0.000007041323,0.00011714539,0.000020745792,0.00020075658,0.00024427724,0.0082372185,0.9905821,0.000009833058],"about_ca_topic_score_codex":0.0041576987,"about_ca_topic_score_gemma":0.0117314635,"teacher_disagreement_score":0.6103958,"about_ca_system_score_codex":0.0028195493,"about_ca_system_score_gemma":0.0036593892,"threshold_uncertainty_score":0.87065554},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013676165,0.00007128193,0.98025686,0.000083230596,0.00007430905,0.000058345533,0.000109165674,0.0003220486,0.00534866],"genre_scores_gemma":[0.2591054,0.00039595747,0.7331845,0.00009196561,0.0000471026,0.00013145905,0.00036375894,0.00025488887,0.0064249597],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99979717,0.000033028402,0.00001143416,0.00004104172,0.000102699014,0.0000145515305],"domain_scores_gemma":[0.9996555,0.000067981506,0.000035411176,0.00011702188,0.00009580531,0.00002834737],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027585187,0.0005462473,0.00028523823,0.0003723483,0.0002856146,0.00067632,0.0008281849,0.0004035183,0.0026706858],"category_scores_gemma":[0.00081872434,0.00023365369,0.00056315714,0.00054244546,0.00062551064,0.0007235314,0.001097029,0.00093624357,0.0006401193],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002067238,0.00012792372,0.003101848,0.00039227877,0.000041090963,0.0006296626,0.00043939258,0.37247783,0.1448598,0.250096,0.0066227997,0.2210046],"study_design_scores_gemma":[0.000014802658,0.00011374802,0.0006763585,0.000019248027,0.000009035076,0.0005177347,0.00004143574,0.94867086,0.015361029,0.016979719,0.017568616,0.000027335736],"about_ca_topic_score_codex":0.0016028212,"about_ca_topic_score_gemma":0.0013945133,"teacher_disagreement_score":0.0026706858,"about_ca_system_score_codex":0.0002721149,"about_ca_system_score_gemma":0.00071161473,"threshold_uncertainty_score":0.008934319},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008849078,0.00006981676,0.98561513,0.00011820162,0.000050219784,0.000046908433,0.000082724546,0.00097541785,0.0041925083],"genre_scores_gemma":[0.1738504,0.00018678851,0.82033676,0.00010253767,0.00004890136,0.00015348225,0.0003313202,0.0006470863,0.004342725],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992011,0.00017315446,0.00003936184,0.00012110492,0.00039043292,0.0000749246],"domain_scores_gemma":[0.9990727,0.0003645763,0.000072202325,0.0002524041,0.00017030002,0.00006784909],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062890566,0.0009224276,0.0010815952,0.0016131779,0.000509007,0.0014719225,0.0016074544,0.0010759337,0.008374369],"category_scores_gemma":[0.003462094,0.00076980115,0.0010471342,0.0017060449,0.00090574165,0.0016146678,0.0028244373,0.0016209239,0.0014545122],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034338946,0.0001954122,0.0009984806,0.00027915943,0.000087442924,0.00017518892,0.00025057027,0.2784278,0.013684995,0.1614154,0.014845549,0.5292966],"study_design_scores_gemma":[0.00005129047,0.000046646863,0.00014977947,0.000018253086,0.000023456634,0.00011391643,0.00003932018,0.9102789,0.0059591173,0.07613042,0.007168495,0.000020431164],"about_ca_topic_score_codex":0.0018638932,"about_ca_topic_score_gemma":0.0034856114,"teacher_disagreement_score":0.008374369,"about_ca_system_score_codex":0.00057952356,"about_ca_system_score_gemma":0.00075439597,"threshold_uncertainty_score":0.028015018},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04267306,0.0008980338,0.93753433,0.0023667396,0.00012671367,0.00022513108,0.0007927977,0.0018041921,0.013578922],"genre_scores_gemma":[0.48990306,0.0012742698,0.49573725,0.0007452141,0.0004803995,0.00064134033,0.0026721116,0.00057848677,0.007967795],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99856865,0.0003315006,0.00006895976,0.00042259172,0.00045977492,0.00014859538],"domain_scores_gemma":[0.99508274,0.0026610787,0.0003873917,0.001317626,0.0004153507,0.00013582448],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079250627,0.0009168224,0.0009179198,0.0015673588,0.00088290026,0.0015785625,0.0022677332,0.0013222949,0.009314627],"category_scores_gemma":[0.009555043,0.00070635846,0.0009405324,0.003337778,0.001563464,0.0062501226,0.004300505,0.0017351188,0.0012271275],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036708772,0.00016339235,0.0032596537,0.00070089684,0.00007319445,0.0003924651,0.0004390352,0.25247473,0.01046912,0.3731921,0.030169416,0.32829896],"study_design_scores_gemma":[0.00007318158,0.00012883196,0.00069986796,0.00005204175,0.000042503885,0.00055175996,0.0001598355,0.56242824,0.006795624,0.39615417,0.032878432,0.000035427744],"about_ca_topic_score_codex":0.0017073398,"about_ca_topic_score_gemma":0.002071771,"teacher_disagreement_score":0.009314627,"about_ca_system_score_codex":0.0011771292,"about_ca_system_score_gemma":0.0008443169,"threshold_uncertainty_score":0.031160533},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84953785,0.0011939084,0.14068468,0.0005306229,0.0002997891,0.000117079224,0.000866435,0.0009781257,0.005791477],"genre_scores_gemma":[0.932066,0.00025159467,0.06413728,0.00005413147,0.000024073095,0.00002792741,0.0014627231,0.00028639345,0.0016898977],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9935051,0.0014197879,0.00047663093,0.0007915052,0.0035341738,0.00027271546],"domain_scores_gemma":[0.9316059,0.04437937,0.0050121094,0.0097931195,0.008308012,0.00090158405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043076184,0.0009472065,0.000761093,0.0021969613,0.00047567108,0.00200395,0.001962927,0.0023563951,0.0064206664],"category_scores_gemma":[0.056669246,0.00076249446,0.0009440126,0.0016105567,0.0017945401,0.0022104785,0.0017120318,0.00063995493,0.0008993496],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.007096786,0.0008733601,0.059189696,0.0014322462,0.00056158076,0.0007667709,0.00058061926,0.55485386,0.078644745,0.03010948,0.004538496,0.26135236],"study_design_scores_gemma":[0.00024031085,0.002248348,0.017183099,0.00011393965,0.00016935237,0.00073559873,0.00039144332,0.8777981,0.085156456,0.01250896,0.0033891962,0.00006517656],"about_ca_topic_score_codex":0.0017349331,"about_ca_topic_score_gemma":0.0014108407,"teacher_disagreement_score":0.0064206664,"about_ca_system_score_codex":0.0008778789,"about_ca_system_score_gemma":0.00058308645,"threshold_uncertainty_score":0.022781134},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2438231,0.006920542,0.5887644,0.017277485,0.00131008,0.00029640875,0.0017995358,0.0007131693,0.13909534],"genre_scores_gemma":[0.59131056,0.0051843454,0.31981784,0.0021026656,0.0011681543,0.00036025202,0.004529275,0.00038431445,0.075142615],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999206,0.0002532792,0.000044502503,0.00018393356,0.00020825375,0.00010408652],"domain_scores_gemma":[0.99744534,0.0016143109,0.00028016037,0.00025554426,0.00016506968,0.00023960507],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078724494,0.00096294575,0.0009544811,0.000906628,0.0021201465,0.0018050581,0.0014048083,0.0037928445,0.012990547],"category_scores_gemma":[0.007221426,0.00044623943,0.0011793262,0.0023249593,0.0022093009,0.0048625534,0.0021964847,0.0027929621,0.0010848246],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025766014,0.00021691697,0.0014401025,0.0005876749,0.000057846373,0.0007746945,0.0009129424,0.09000832,0.002028872,0.757581,0.04608633,0.10004762],"study_design_scores_gemma":[0.0001463858,0.00011678254,0.0011247968,0.00013121201,0.000029944138,0.0010879595,0.001013241,0.1139167,0.0014510021,0.77695197,0.10396982,0.00006011031],"about_ca_topic_score_codex":0.0022402916,"about_ca_topic_score_gemma":0.0018479502,"teacher_disagreement_score":0.012990547,"about_ca_system_score_codex":0.00085836306,"about_ca_system_score_gemma":0.000583776,"threshold_uncertainty_score":0.043457687},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.101154335,0.00062301895,0.8787775,0.0005694835,0.00012131765,0.0002441763,0.0005628166,0.0058345543,0.012112673],"genre_scores_gemma":[0.44129026,0.00022018664,0.54795,0.00015422751,0.00006511399,0.00026020795,0.0014143653,0.0010394396,0.007606117],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99786156,0.0003557647,0.00014208596,0.00039894017,0.00077108934,0.00047062148],"domain_scores_gemma":[0.99600536,0.0018879734,0.00029929192,0.0011800695,0.0004215355,0.00020576548],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011173711,0.0018214805,0.0025472424,0.0016462589,0.0020930097,0.002999615,0.005408439,0.0019855346,0.013525347],"category_scores_gemma":[0.0062528066,0.0014216447,0.0016371921,0.0039128014,0.0015970158,0.005252517,0.0057945405,0.0021638556,0.002038627],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0025975222,0.0006061159,0.0026503243,0.00038547834,0.00018430858,0.00016409473,0.0006512042,0.54221606,0.007749288,0.038742445,0.017089013,0.3869641],"study_design_scores_gemma":[0.00010452985,0.00008949494,0.00029277397,0.00001079739,0.000030676318,0.00004069424,0.00011456701,0.9723846,0.0038153257,0.021855634,0.0012423537,0.000018594528],"about_ca_topic_score_codex":0.0120638115,"about_ca_topic_score_gemma":0.026095243,"teacher_disagreement_score":0.013525347,"about_ca_system_score_codex":0.0031569428,"about_ca_system_score_gemma":0.00371178,"threshold_uncertainty_score":0.04524678},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5861648,0.0012437665,0.37534544,0.0014660967,0.0001084653,0.00022313716,0.001303634,0.0004213629,0.033723377],"genre_scores_gemma":[0.93123525,0.00067944225,0.06345463,0.0001811712,0.00010363356,0.00016634594,0.0006087096,0.00009051924,0.0034802975],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986858,0.0003007047,0.00008626451,0.00044776595,0.0003373635,0.00014205478],"domain_scores_gemma":[0.9872246,0.00831062,0.0020590264,0.0008038851,0.0008160595,0.00078584114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000960783,0.00063942233,0.0006065241,0.0023537725,0.0017289255,0.0019500342,0.0013793369,0.0012529531,0.0049889167],"category_scores_gemma":[0.012201487,0.00047611177,0.0005926755,0.0034717827,0.0022322766,0.0040783645,0.0019082678,0.0015498888,0.000396734],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034780838,0.00014817338,0.0108745815,0.00060097163,0.00007217242,0.00075921044,0.001185707,0.030669963,0.008930516,0.8752451,0.0035818587,0.06758403],"study_design_scores_gemma":[0.000058030826,0.00021020108,0.009441619,0.0001445766,0.00011163398,0.0042948076,0.0020897384,0.09350164,0.010756462,0.8610872,0.01821571,0.0000883854],"about_ca_topic_score_codex":0.0008581284,"about_ca_topic_score_gemma":0.00074675836,"teacher_disagreement_score":0.0049889167,"about_ca_system_score_codex":0.0011822974,"about_ca_system_score_gemma":0.00045504168,"threshold_uncertainty_score":0.016689539},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01591218,0.0005106406,0.96319914,0.00052957505,0.0002948949,0.0002722779,0.0007220686,0.0032178238,0.015341368],"genre_scores_gemma":[0.121651925,0.00022824279,0.8649433,0.00027471848,0.00009980683,0.00015948204,0.0012533581,0.0005496889,0.010839433],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99904245,0.0002069292,0.00008490591,0.00016780921,0.0003297514,0.00016810297],"domain_scores_gemma":[0.998195,0.00066456967,0.000102735685,0.00033603722,0.0005174896,0.00018419028],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012979296,0.0007791088,0.0013011334,0.0015005792,0.0012024736,0.0018066501,0.0031914315,0.0015407394,0.02068657],"category_scores_gemma":[0.005333984,0.00082326453,0.0007951974,0.001777426,0.0004829105,0.0023004736,0.0021994256,0.0017364302,0.004608279],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016224163,0.0007668245,0.0021151905,0.00081460027,0.0001097214,0.00029417034,0.00031477257,0.11794032,0.012110041,0.059849966,0.042902153,0.7611598],"study_design_scores_gemma":[0.00034483217,0.0005959029,0.0005804756,0.00009389986,0.00012036795,0.0004137595,0.00017680206,0.8711601,0.012405241,0.08217034,0.031879477,0.0000587696],"about_ca_topic_score_codex":0.0020788112,"about_ca_topic_score_gemma":0.0049074474,"teacher_disagreement_score":0.02068657,"about_ca_system_score_codex":0.0007765201,"about_ca_system_score_gemma":0.0025983169,"threshold_uncertainty_score":0.06920344},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020839257,0.003259788,0.91206753,0.0029818069,0.00056995294,0.00019358727,0.0009911389,0.0008766353,0.058220297],"genre_scores_gemma":[0.43687,0.0066197617,0.49885026,0.001363168,0.003002093,0.0008387969,0.0029012165,0.00045869028,0.049096007],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99638534,0.0010423654,0.0002233791,0.0008314581,0.0011924055,0.00032497186],"domain_scores_gemma":[0.99511296,0.0023595025,0.00036436474,0.001464866,0.00051672047,0.00018151589],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024924693,0.0012791192,0.0021408552,0.0015912441,0.0016354604,0.0038984574,0.0036089572,0.0020593766,0.017959924],"category_scores_gemma":[0.015636066,0.00055088487,0.0015347945,0.0031733871,0.0026512193,0.011268985,0.006336081,0.0060281684,0.007150978],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010764072,0.000057318714,0.00027438567,0.00022909281,0.000022168813,0.00013085509,0.00023231357,0.025687281,0.0005723697,0.90105903,0.011652792,0.05997467],"study_design_scores_gemma":[0.000038230737,0.000045676457,0.00018294399,0.000053410204,0.000014604935,0.00021173316,0.00013905359,0.11001345,0.0005006691,0.86662585,0.022151606,0.000022822824],"about_ca_topic_score_codex":0.0018015407,"about_ca_topic_score_gemma":0.0012729731,"teacher_disagreement_score":0.017959924,"about_ca_system_score_codex":0.0013577614,"about_ca_system_score_gemma":0.0009426537,"threshold_uncertainty_score":0.0600819},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1554169,0.00077413564,0.7925404,0.00053084735,0.0002333523,0.00011087675,0.00016856134,0.00059281156,0.04963209],"genre_scores_gemma":[0.628154,0.0006416512,0.3136712,0.00018254128,0.00012511574,0.00022900794,0.0003438464,0.00064683123,0.0560058],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99951756,0.00011908804,0.000024210292,0.00006939743,0.00020658916,0.000063135514],"domain_scores_gemma":[0.9984926,0.0007316565,0.00010230555,0.00024553112,0.0002432271,0.00018472887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054271263,0.0005712855,0.0007604314,0.0017934856,0.0009336504,0.0020071436,0.0011099455,0.0010859314,0.009907246],"category_scores_gemma":[0.005235093,0.00064382085,0.0005984346,0.00097147154,0.0015521329,0.0014450077,0.0021823198,0.002560554,0.0019465671],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012946532,0.000055516273,0.0005506893,0.00009247565,0.000013468946,0.00007976987,0.0002542769,0.04509535,0.0072557735,0.8774847,0.002905461,0.06608294],"study_design_scores_gemma":[0.000031823354,0.00004749468,0.00037777852,0.000041352494,0.000012520398,0.00010829793,0.000082009305,0.31464195,0.0036204604,0.67219234,0.008822232,0.000021613736],"about_ca_topic_score_codex":0.0016564644,"about_ca_topic_score_gemma":0.0021804825,"teacher_disagreement_score":0.009907246,"about_ca_system_score_codex":0.0010528318,"about_ca_system_score_gemma":0.0005417557,"threshold_uncertainty_score":0.033143044},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.73619336,0.0009200217,0.14997683,0.0019904135,0.00039244298,0.00011292037,0.0008516912,0.00028748898,0.109274745],"genre_scores_gemma":[0.9636646,0.0004065215,0.021326274,0.0002252804,0.00023900036,0.000080054786,0.0005795832,0.00013449798,0.013344305],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99919826,0.00016689861,0.000033221408,0.00011052079,0.00030772388,0.00018344811],"domain_scores_gemma":[0.996135,0.0019580203,0.0004191781,0.0004773683,0.000415368,0.0005950184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009985551,0.0006444483,0.0009976617,0.0017666322,0.0015194742,0.0024936907,0.0021337636,0.0011748218,0.009900924],"category_scores_gemma":[0.005857175,0.0004915255,0.00065905665,0.0012536847,0.004399474,0.0033457614,0.0024110877,0.0023306,0.00072257465],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003038099,0.000049524093,0.0015927423,0.0000996724,0.000018393319,0.00008124526,0.0004176604,0.019531332,0.0023797594,0.9454794,0.0050510336,0.02499551],"study_design_scores_gemma":[0.00002706109,0.00003321693,0.0009127733,0.00002284033,0.000008943481,0.000081296894,0.00019523903,0.06373371,0.0010847771,0.93142766,0.0024466773,0.000025833424],"about_ca_topic_score_codex":0.0029181077,"about_ca_topic_score_gemma":0.0028179488,"teacher_disagreement_score":0.009900924,"about_ca_system_score_codex":0.0012617043,"about_ca_system_score_gemma":0.00090417487,"threshold_uncertainty_score":0.033121884},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22615725,0.0012809191,0.7164426,0.0020031717,0.00027128396,0.0002228178,0.0022620047,0.02430985,0.027050128],"genre_scores_gemma":[0.5834731,0.0004652573,0.400804,0.0004885439,0.00014318318,0.00018803903,0.0057969536,0.0012534125,0.007387476],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99692047,0.00027506644,0.00019625854,0.0012691565,0.00074679015,0.0005923178],"domain_scores_gemma":[0.9936566,0.0030991028,0.000661296,0.0016074299,0.0006989516,0.00027654922],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085222756,0.0015688586,0.0015541523,0.0011797149,0.0011898527,0.0037722725,0.0025591466,0.0015334053,0.013648167],"category_scores_gemma":[0.008629056,0.0007270485,0.0015001842,0.0026681356,0.0011306448,0.0069843233,0.0017474813,0.0018896636,0.00460222],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0032576139,0.0007185547,0.012063727,0.0012793599,0.00049654255,0.000704744,0.000605769,0.2589249,0.052303966,0.049705725,0.051536858,0.56840223],"study_design_scores_gemma":[0.00040406774,0.00030480194,0.002979723,0.00006275737,0.00022243035,0.00079787505,0.0003008363,0.76016647,0.028099915,0.19258194,0.013986275,0.00009290971],"about_ca_topic_score_codex":0.0041396455,"about_ca_topic_score_gemma":0.007312771,"teacher_disagreement_score":0.013648167,"about_ca_system_score_codex":0.002389511,"about_ca_system_score_gemma":0.0025453945,"threshold_uncertainty_score":0.045657694},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20282346,0.0011287151,0.78010625,0.0016535011,0.00009032455,0.00026601844,0.0007123077,0.0020234904,0.01119586],"genre_scores_gemma":[0.8590447,0.0008316253,0.13225386,0.0003589419,0.00013599584,0.00042689766,0.0009698986,0.0002895958,0.0056884796],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977654,0.00094077905,0.00007022806,0.00032425005,0.00045584474,0.00044358382],"domain_scores_gemma":[0.99016654,0.006849217,0.0008091794,0.0014464954,0.0004442915,0.00028430048],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020367245,0.00073042605,0.0014897522,0.0013623558,0.001065188,0.0014409072,0.0020657463,0.0013312515,0.002958371],"category_scores_gemma":[0.013795794,0.00073159224,0.00073993776,0.0013619745,0.0016075071,0.003173696,0.0024064346,0.001085919,0.00075587333],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014196167,0.00013658486,0.0017985454,0.00047398673,0.00011080956,0.00026953864,0.00065793924,0.7234397,0.013460309,0.18693405,0.01299045,0.058308594],"study_design_scores_gemma":[0.00016136414,0.00008510229,0.0003479834,0.000026481388,0.000034727327,0.00007744197,0.00009071212,0.9038934,0.0026298373,0.09010426,0.0025332756,0.000015358499],"about_ca_topic_score_codex":0.0027280024,"about_ca_topic_score_gemma":0.002736527,"teacher_disagreement_score":0.002958371,"about_ca_system_score_codex":0.0025921725,"about_ca_system_score_gemma":0.0010650519,"threshold_uncertainty_score":0.01880765},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20471872,0.0011269776,0.7415626,0.0010628811,0.0002781749,0.0003794579,0.01143348,0.02905409,0.010383629],"genre_scores_gemma":[0.81641,0.00049815385,0.1645337,0.00021492864,0.00017907715,0.00024354096,0.0151192555,0.0008448294,0.0019564822],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9898837,0.0011610336,0.001268371,0.0016229082,0.0051454003,0.0009185084],"domain_scores_gemma":[0.9679249,0.014152102,0.0029199626,0.010609295,0.0035755492,0.00081826095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027916753,0.001429256,0.0026213538,0.005065208,0.001521003,0.004760142,0.003958121,0.0027014525,0.007772272],"category_scores_gemma":[0.028168615,0.00092616596,0.0012825778,0.006486198,0.0014334128,0.012798951,0.0066590137,0.0022289697,0.0022746269],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004969657,0.0008902014,0.06812987,0.0018855468,0.0005312965,0.0019308027,0.0016899403,0.08317793,0.051700894,0.09214378,0.05216327,0.6407868],"study_design_scores_gemma":[0.00021108087,0.0007331085,0.0075770146,0.00021781455,0.00034323096,0.0023271414,0.001355358,0.7167558,0.121830225,0.11506658,0.033374507,0.00020811698],"about_ca_topic_score_codex":0.0020051694,"about_ca_topic_score_gemma":0.0017972003,"teacher_disagreement_score":0.007772272,"about_ca_system_score_codex":0.0010476022,"about_ca_system_score_gemma":0.0017200452,"threshold_uncertainty_score":0.026000798},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52391416,0.0011303445,0.44276443,0.00037508085,0.00020690032,0.00011670415,0.00034891814,0.00085167843,0.030291725],"genre_scores_gemma":[0.92540944,0.0005453137,0.0643289,0.000082341205,0.00013164463,0.00007041297,0.0006811723,0.00026796403,0.008482846],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995975,0.000033802255,0.000027288612,0.000076369775,0.00020392853,0.000061230734],"domain_scores_gemma":[0.99965096,0.00007215942,0.000076623954,0.000050098002,0.000105862746,0.0000443112],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020865299,0.0006063643,0.0005175474,0.0020890485,0.0007520696,0.0019443607,0.0006623789,0.00071503513,0.0035077462],"category_scores_gemma":[0.0009889322,0.00022320132,0.00048726943,0.001176437,0.0016749415,0.0019321155,0.0013721955,0.0010430878,0.0009736514],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001232614,0.000043608765,0.0040860027,0.00016994897,0.000022305958,0.0005309191,0.0007824216,0.02008309,0.026794503,0.84101415,0.0032402,0.10310952],"study_design_scores_gemma":[0.000032275206,0.00037797377,0.007195034,0.000075395605,0.000042384436,0.0018817937,0.00094317115,0.16957277,0.027125886,0.7425278,0.050145295,0.00008023288],"about_ca_topic_score_codex":0.0006308802,"about_ca_topic_score_gemma":0.0003359437,"teacher_disagreement_score":0.0035077462,"about_ca_system_score_codex":0.00045824668,"about_ca_system_score_gemma":0.00025066978,"threshold_uncertainty_score":0.011734545},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.070942834,0.00030919132,0.92593384,0.00040813023,0.000076879514,0.00003838933,0.00012087421,0.0003809351,0.0017888643],"genre_scores_gemma":[0.43956465,0.0003172089,0.55114824,0.00014140792,0.00008375154,0.00014333891,0.00056906417,0.00061348686,0.007418886],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998566,0.00045685028,0.000091348404,0.00021385784,0.0005819641,0.000090043664],"domain_scores_gemma":[0.9902935,0.0071243136,0.00054739724,0.0009175068,0.0008046925,0.00031266952],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003271595,0.0013077684,0.0015968044,0.0012750408,0.00050864863,0.0019538975,0.002053937,0.0034050955,0.0025145449],"category_scores_gemma":[0.014845967,0.0008912711,0.00074939,0.0011311792,0.0020255395,0.003041335,0.0036526464,0.0025529854,0.0008199418],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001005809,0.00012239984,0.0012039142,0.00042049034,0.000101122554,0.0001175989,0.00024431842,0.8234577,0.014402097,0.039453354,0.0023870554,0.11708412],"study_design_scores_gemma":[0.000011466402,0.000044894616,0.00008439645,0.00001627283,0.0000045308543,0.000021694614,0.000021567952,0.9873301,0.0029619515,0.009130203,0.0003648351,0.000008212027],"about_ca_topic_score_codex":0.0018113186,"about_ca_topic_score_gemma":0.001734379,"teacher_disagreement_score":0.0034050955,"about_ca_system_score_codex":0.0012091536,"about_ca_system_score_gemma":0.0011537672,"threshold_uncertainty_score":0.017302036},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038525466,0.00036030568,0.95354414,0.00020476042,0.00017689537,0.00022574248,0.00010620826,0.001447116,0.005409335],"genre_scores_gemma":[0.21898459,0.00032872122,0.7755984,0.0001018627,0.000036831025,0.00048335115,0.00031363117,0.00096776447,0.0031847856],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995066,0.00015292614,0.000041300947,0.000049762235,0.00019610075,0.000053275646],"domain_scores_gemma":[0.99837947,0.0009220867,0.0001145991,0.00017548658,0.00035335112,0.000055037606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012498444,0.000902632,0.0010406878,0.0007675549,0.000595192,0.0009396336,0.0016986406,0.001971052,0.0034532412],"category_scores_gemma":[0.004857307,0.00053327356,0.00095032697,0.00068802753,0.00071847026,0.0007275982,0.0010133818,0.0015382642,0.0007728372],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007518239,0.00007420239,0.0008289697,0.00014604205,0.000031655305,0.00012244411,0.00023051226,0.93536484,0.007494269,0.011652214,0.00069254165,0.043287158],"study_design_scores_gemma":[0.000009769192,0.000012030472,0.00007349449,0.000011288334,0.0000024194355,0.000014103059,0.000014551154,0.9950134,0.0018079515,0.0014317407,0.0016030086,0.0000061374544],"about_ca_topic_score_codex":0.005021321,"about_ca_topic_score_gemma":0.0035086614,"teacher_disagreement_score":0.005021321,"about_ca_system_score_codex":0.0007832099,"about_ca_system_score_gemma":0.0008262494,"threshold_uncertainty_score":0.011552274},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14442721,0.00029328436,0.83744675,0.00023043765,0.00008624083,0.00013729127,0.00097385794,0.0009282388,0.015476702],"genre_scores_gemma":[0.5016366,0.0006685777,0.4826136,0.00006115163,0.000050038278,0.00019789665,0.0024122337,0.00074674835,0.011613078],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99928635,0.000122144,0.00005218445,0.0001326784,0.00033333214,0.00007331614],"domain_scores_gemma":[0.9984218,0.0006715995,0.00014672613,0.00037390678,0.0002572338,0.00012877345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042535228,0.0007466919,0.0008653414,0.0013674372,0.00052001566,0.0023769452,0.0016203645,0.0011893043,0.0075266967],"category_scores_gemma":[0.0047348836,0.0008637202,0.000808387,0.0016725536,0.00084824965,0.002981991,0.002341763,0.0019070457,0.0016939653],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033942828,0.00016697806,0.0018964199,0.00049688667,0.00006002526,0.0005640043,0.0012596122,0.1806724,0.013107373,0.5888612,0.009144419,0.2034311],"study_design_scores_gemma":[0.000051081246,0.000119385324,0.00076675386,0.0001168178,0.000046620447,0.00058593013,0.00052681204,0.48356232,0.0090360325,0.4845528,0.020593539,0.000041862735],"about_ca_topic_score_codex":0.0007198245,"about_ca_topic_score_gemma":0.0012919878,"teacher_disagreement_score":0.0075266967,"about_ca_system_score_codex":0.0007204287,"about_ca_system_score_gemma":0.00031425396,"threshold_uncertainty_score":0.025179327},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029921109,0.0182351,0.83868796,0.022255715,0.0051881587,0.00023027156,0.0011499888,0.0013451774,0.08298662],"genre_scores_gemma":[0.3878342,0.014537457,0.56182826,0.008256264,0.005198525,0.000484379,0.00160935,0.0015269794,0.018724615],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98773474,0.0021542495,0.0007615756,0.002136409,0.0050403294,0.0021726782],"domain_scores_gemma":[0.9581083,0.031405617,0.0010102659,0.005425669,0.002950079,0.001100094],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009155561,0.0024346171,0.0027766346,0.0033744564,0.0036748163,0.0049745506,0.007824802,0.0027453273,0.01258352],"category_scores_gemma":[0.039238665,0.002097475,0.004787309,0.004426661,0.008922828,0.01650323,0.009158179,0.02537385,0.003306859],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007123156,0.0002328416,0.002330421,0.0009571347,0.00012642259,0.0006446841,0.0009218457,0.029222706,0.007840865,0.8001765,0.045126144,0.111708],"study_design_scores_gemma":[0.000080824604,0.000253657,0.0011968078,0.00033156053,0.00012455066,0.00043995172,0.0002091917,0.051740807,0.009105585,0.880053,0.056337617,0.00012637711],"about_ca_topic_score_codex":0.0048046126,"about_ca_topic_score_gemma":0.0037201564,"teacher_disagreement_score":0.01258352,"about_ca_system_score_codex":0.004249104,"about_ca_system_score_gemma":0.001872904,"threshold_uncertainty_score":0.048419774},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03931862,0.00021112636,0.95141983,0.00039824483,0.00009634989,0.00007663258,0.00017323838,0.00035838704,0.007947642],"genre_scores_gemma":[0.3019404,0.001426982,0.67348653,0.0003035964,0.00013507476,0.00017588898,0.001287468,0.0008150417,0.020429004],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99958104,0.00011778143,0.000020004241,0.000093838906,0.00014385703,0.00004351065],"domain_scores_gemma":[0.9986607,0.00068031164,0.000109800705,0.00030221773,0.00017513269,0.00007187842],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054611586,0.0013741873,0.00096973486,0.0014061715,0.00082076545,0.0012935657,0.0015377179,0.0014072325,0.005501724],"category_scores_gemma":[0.004742305,0.0007210311,0.0006492538,0.0018200558,0.0019308516,0.00457029,0.004559307,0.0019040104,0.0011360386],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027453018,0.000110603636,0.0011284703,0.00037628986,0.000040675845,0.00022898524,0.0008885062,0.27719325,0.011808363,0.47567323,0.009095644,0.22318132],"study_design_scores_gemma":[0.000026073529,0.00010450918,0.00040259978,0.00006980533,0.000032957578,0.00014678598,0.0003104028,0.5290332,0.004283497,0.45328498,0.012275806,0.000029539966],"about_ca_topic_score_codex":0.0024226937,"about_ca_topic_score_gemma":0.0031483532,"teacher_disagreement_score":0.005501724,"about_ca_system_score_codex":0.0005546792,"about_ca_system_score_gemma":0.00028219973,"threshold_uncertainty_score":0.01840508},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2936568,0.0006958255,0.6629476,0.0008485185,0.0005505048,0.00030694573,0.00052544614,0.0011810053,0.03928731],"genre_scores_gemma":[0.6802107,0.0005309915,0.30398077,0.000106352665,0.000084210384,0.00016591238,0.000723176,0.00028367757,0.013914188],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994134,0.000092083246,0.0000508149,0.00012931801,0.00018750796,0.00012689421],"domain_scores_gemma":[0.9993106,0.00025537566,0.000071913404,0.00023850439,0.000050335726,0.000073128824],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025312716,0.00070637866,0.0014014302,0.0008946783,0.0011117042,0.0017955464,0.001401282,0.0017518955,0.009696774],"category_scores_gemma":[0.0020845057,0.0008486074,0.00065841747,0.0022581867,0.00086878485,0.002057355,0.003502989,0.000994883,0.0020786251],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0027360308,0.0006666837,0.0035213106,0.0009935284,0.00017314755,0.006410744,0.0013677761,0.41981554,0.0549642,0.15226279,0.016245991,0.34084228],"study_design_scores_gemma":[0.0003317627,0.00060730457,0.0010403007,0.00010465963,0.000080097445,0.0015862751,0.0008792233,0.8012497,0.031396423,0.12383735,0.038827125,0.00005979658],"about_ca_topic_score_codex":0.0007034484,"about_ca_topic_score_gemma":0.00048605408,"teacher_disagreement_score":0.009696774,"about_ca_system_score_codex":0.00035734178,"about_ca_system_score_gemma":0.00036133075,"threshold_uncertainty_score":0.032438993},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0053624846,0.000041478357,0.9896125,0.000045770357,0.000066386674,0.000054855856,0.000022283642,0.0005398896,0.0042543584],"genre_scores_gemma":[0.16061363,0.00009981668,0.8334153,0.000090769514,0.0000329527,0.00012550563,0.00013089896,0.00034649283,0.005144607],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99972814,0.0000418351,0.000012925115,0.00003538603,0.00015561793,0.000026074287],"domain_scores_gemma":[0.9995995,0.0001593907,0.000018180912,0.00009035158,0.000113426395,0.000019091573],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029287988,0.0004360294,0.00057490094,0.00073608785,0.00041130077,0.0005250881,0.00086966244,0.001041637,0.008605412],"category_scores_gemma":[0.0014161816,0.00038558122,0.00045882634,0.0006589156,0.00039613352,0.00079900626,0.0010806745,0.0009187383,0.0015472317],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002848471,0.00012294632,0.0003783436,0.0003042897,0.00003149102,0.0003817549,0.00031539908,0.18078227,0.20640668,0.050874785,0.0073987297,0.5527185],"study_design_scores_gemma":[0.000027004327,0.00005560716,0.00010312344,0.000015247162,0.0000109470675,0.00019538024,0.000022651744,0.9629413,0.026153702,0.004772593,0.005688564,0.00001396074],"about_ca_topic_score_codex":0.0007831181,"about_ca_topic_score_gemma":0.0012797755,"teacher_disagreement_score":0.008605412,"about_ca_system_score_codex":0.00018924027,"about_ca_system_score_gemma":0.00038142008,"threshold_uncertainty_score":0.02878797},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14279966,0.00034326932,0.74578464,0.000638136,0.0005331003,0.00017201803,0.0015270038,0.0009041372,0.10729801],"genre_scores_gemma":[0.68394965,0.0005708492,0.26549405,0.00032876586,0.000095055206,0.00027791812,0.0038130893,0.0009954065,0.04447528],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994912,0.00006508031,0.000029174857,0.00015349203,0.00019709178,0.00006397999],"domain_scores_gemma":[0.9993198,0.00013145633,0.00007343785,0.00017961851,0.00021062227,0.00008516226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022202756,0.0004580574,0.00042074645,0.0008943144,0.0011350282,0.001269451,0.0007929372,0.0007103095,0.014420061],"category_scores_gemma":[0.0014130359,0.00040238377,0.00046103288,0.0006782331,0.0007949986,0.0015447021,0.0011665613,0.0011673799,0.004220455],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035882654,0.00013168063,0.0040605078,0.00038942602,0.000058731042,0.0007750764,0.0007972733,0.013543675,0.061850596,0.71955496,0.012672247,0.18580697],"study_design_scores_gemma":[0.000059270285,0.00029970036,0.009628172,0.000156703,0.00006288235,0.0021145658,0.001656673,0.05813902,0.03565221,0.7386247,0.15348375,0.00012233571],"about_ca_topic_score_codex":0.0012968854,"about_ca_topic_score_gemma":0.0015508588,"teacher_disagreement_score":0.014420061,"about_ca_system_score_codex":0.00026676513,"about_ca_system_score_gemma":0.00042194378,"threshold_uncertainty_score":0.048239887},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010643197,0.000043248758,0.98833746,0.000018303004,0.000005338586,0.00001817951,0.000025962485,0.00026976527,0.0006386283],"genre_scores_gemma":[0.20099105,0.00008393616,0.7980822,0.0000117854925,0.000006910695,0.00005832003,0.000107807005,0.00010566125,0.0005523473],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992642,0.00018155732,0.00003152148,0.000100078985,0.00036518523,0.000057430316],"domain_scores_gemma":[0.9986099,0.0007544349,0.00008887055,0.00031252106,0.00019212869,0.00004205264],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009941534,0.00027385217,0.00066131196,0.0011046492,0.0004351564,0.0008790545,0.0011533787,0.00043384172,0.0012913493],"category_scores_gemma":[0.0050225602,0.0003779226,0.0006460922,0.00088675035,0.0007919559,0.0012210952,0.0015124385,0.0006904112,0.0004819218],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015100001,0.00005013445,0.0028598052,0.00014116177,0.00004196195,0.00017363924,0.0005250677,0.5096244,0.037732016,0.15740728,0.0012056079,0.29008794],"study_design_scores_gemma":[0.000024012652,0.000063992404,0.0006928212,0.00001790746,0.000012888385,0.00019757987,0.00004754714,0.93840295,0.01724609,0.03233236,0.010926673,0.000035262532],"about_ca_topic_score_codex":0.0027387256,"about_ca_topic_score_gemma":0.003729714,"teacher_disagreement_score":0.0027387256,"about_ca_system_score_codex":0.00052746636,"about_ca_system_score_gemma":0.00058900384,"threshold_uncertainty_score":0.00544554},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06787394,0.007024073,0.75133574,0.014738653,0.0014989112,0.0003677069,0.0034944618,0.0029052082,0.1507613],"genre_scores_gemma":[0.6261546,0.005248858,0.28657588,0.0050627906,0.0022040755,0.00086815836,0.0029418643,0.0031844892,0.067759305],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9942287,0.0009053723,0.00019442374,0.0010447603,0.0023822512,0.0012445262],"domain_scores_gemma":[0.9721309,0.019744145,0.00077021506,0.003996067,0.0016000473,0.0017586997],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005129926,0.0031877598,0.0034665207,0.0032957443,0.0025664894,0.0073589394,0.010487552,0.004941534,0.04504799],"category_scores_gemma":[0.031671714,0.002009835,0.0028590518,0.004595532,0.0057691834,0.020213146,0.01192767,0.01279962,0.0065416535],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010845382,0.00047630657,0.0023199143,0.0012772781,0.00016908094,0.00023816964,0.00054252334,0.09498472,0.009975777,0.7169397,0.048420705,0.123571225],"study_design_scores_gemma":[0.00011222313,0.00012994147,0.00068269373,0.00013132016,0.00011226638,0.00023368461,0.000083693376,0.22569883,0.0027177676,0.7601238,0.0099069355,0.00006696582],"about_ca_topic_score_codex":0.0037875404,"about_ca_topic_score_gemma":0.006249409,"teacher_disagreement_score":0.04504799,"about_ca_system_score_codex":0.0060712406,"about_ca_system_score_gemma":0.003179044,"threshold_uncertainty_score":0.15070057},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38247162,0.00088510715,0.58217645,0.0024095573,0.0002933295,0.00018599429,0.0015746059,0.0014371339,0.028566113],"genre_scores_gemma":[0.9392098,0.00058210286,0.052695833,0.0004070961,0.00024384417,0.00010273897,0.0010715345,0.00044900863,0.0052381014],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99446976,0.00089650904,0.0005134353,0.0012364058,0.0018028645,0.0010809571],"domain_scores_gemma":[0.9773103,0.013015085,0.0019769005,0.0036360926,0.0022977304,0.0017639571],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042457823,0.0010323024,0.0016941443,0.0035117604,0.0024300548,0.0069725593,0.0030126614,0.001890439,0.0072547337],"category_scores_gemma":[0.020845212,0.0012780476,0.0017812406,0.0034701796,0.0065215104,0.021440882,0.0074181203,0.0050438824,0.001001304],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00064689235,0.00013836919,0.005775269,0.00023256495,0.00004324483,0.00012586337,0.0012726755,0.02269879,0.0033209415,0.9230044,0.0035603705,0.03918069],"study_design_scores_gemma":[0.000070354865,0.00015699872,0.0015195078,0.000083365805,0.0000713292,0.00020389992,0.0006525762,0.061079595,0.004583436,0.9238137,0.0077050123,0.000060260172],"about_ca_topic_score_codex":0.0025188087,"about_ca_topic_score_gemma":0.0031113708,"teacher_disagreement_score":0.0072547337,"about_ca_system_score_codex":0.0022537047,"about_ca_system_score_gemma":0.001477146,"threshold_uncertainty_score":0.024269462},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.086764656,0.0003874123,0.85174817,0.00065378664,0.00008644559,0.00018414257,0.0014618438,0.0018534538,0.056860153],"genre_scores_gemma":[0.6762447,0.0010529258,0.27357027,0.00027194966,0.00011334658,0.0001673024,0.0056728823,0.0009899222,0.041916724],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99961543,0.00004589063,0.000014189219,0.00013230252,0.00012807068,0.000064084306],"domain_scores_gemma":[0.9990693,0.00023884326,0.00012158037,0.0003004615,0.00015841637,0.000111499925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018803071,0.0006186347,0.0006554405,0.00106071,0.00079797034,0.0016261139,0.0011641302,0.0009741093,0.017239084],"category_scores_gemma":[0.0018036161,0.0006376356,0.0005788104,0.0015119236,0.00091008417,0.0028500601,0.0020234913,0.0017858241,0.002480347],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046678667,0.00019955073,0.0017373492,0.00030446955,0.000071954615,0.00046967802,0.00048943935,0.06937627,0.031425707,0.5923553,0.023707267,0.2793963],"study_design_scores_gemma":[0.00009225992,0.00016872585,0.0023484866,0.00007339682,0.000079788064,0.00061369076,0.00035766442,0.24453148,0.02613979,0.6525218,0.0730312,0.00004179836],"about_ca_topic_score_codex":0.0018352048,"about_ca_topic_score_gemma":0.0021437267,"teacher_disagreement_score":0.017239084,"about_ca_system_score_codex":0.0005684954,"about_ca_system_score_gemma":0.00062438904,"threshold_uncertainty_score":0.057670534},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.107206024,0.0003210141,0.89051664,0.000081477614,0.000012251546,0.00011247385,0.00009349029,0.0006408008,0.0010157673],"genre_scores_gemma":[0.5320702,0.00016937932,0.46683177,0.000024722942,0.000013875154,0.00011312131,0.000250192,0.00011595774,0.00041077723],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99877256,0.00039401287,0.000074746546,0.00017272122,0.00041244374,0.00017351254],"domain_scores_gemma":[0.9936575,0.004650109,0.00060708827,0.00044227138,0.00044906803,0.00019393033],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001626357,0.000947899,0.0014953762,0.0023227758,0.00064161996,0.0017839167,0.0018695117,0.0012208946,0.001285778],"category_scores_gemma":[0.010088973,0.0009251551,0.0008056494,0.0014246345,0.00094083045,0.0018027407,0.0017282622,0.0007638147,0.00031703452],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002442769,0.0000839653,0.0029460008,0.00010397928,0.00004856935,0.00013567637,0.00015435307,0.91092914,0.0040281904,0.0054313764,0.0005745502,0.075320065],"study_design_scores_gemma":[0.000018288794,0.000053539698,0.00042870909,0.000011811704,0.0000121550065,0.000035346464,0.000052555595,0.9922896,0.002494658,0.004317523,0.00027419685,0.000011648371],"about_ca_topic_score_codex":0.0030237786,"about_ca_topic_score_gemma":0.003953989,"teacher_disagreement_score":0.0030237786,"about_ca_system_score_codex":0.0010032965,"about_ca_system_score_gemma":0.0010859894,"threshold_uncertainty_score":0.008601129},"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":"review","genre_gemma":"commentary","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"commentary","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002936714,0.94473976,0.010943108,0.009952157,0.011002716,0.00003960573,0.00045033536,0.00024919384,0.022329327],"genre_scores_gemma":[0.0029243787,0.9343678,0.008987641,0.0030616769,0.01154446,0.000110648856,0.0010141769,0.00032036105,0.037669044],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99847203,0.00021996432,0.00011744582,0.00028304537,0.0008137481,0.00009372486],"domain_scores_gemma":[0.99792176,0.00087059493,0.00014356003,0.000112472095,0.00078823196,0.00016340264],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001897228,0.0018319904,0.0022562686,0.0044441875,0.0011403217,0.0046407315,0.0018519344,0.001990382,0.026476614],"category_scores_gemma":[0.00479216,0.0013799301,0.0013956466,0.00766128,0.0024856545,0.006354757,0.002041895,0.005584049,0.029420733],"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.000023508674,0.000024195106,0.0001642826,0.002936885,0.000037733393,0.00005871429,0.00017535202,0.0015474268,0.00026738524,0.041996684,0.6760308,0.27673703],"study_design_scores_gemma":[0.000004305541,0.000017741271,0.00030401826,0.0010859222,0.000008390635,0.00022535953,0.00005183378,0.00033130002,0.00006612025,0.013418554,0.98446864,0.000017725104],"about_ca_topic_score_codex":0.0031294804,"about_ca_topic_score_gemma":0.0034365912,"teacher_disagreement_score":0.026476614,"about_ca_system_score_codex":0.0025333224,"about_ca_system_score_gemma":0.00347028,"threshold_uncertainty_score":0.0885731},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24414831,0.00017565596,0.74212205,0.00031516096,0.000056693545,0.000090803966,0.0007567886,0.003240187,0.009094333],"genre_scores_gemma":[0.7592745,0.00012978577,0.23722191,0.00004448886,0.000027301128,0.00008319901,0.00062199123,0.0002194491,0.0023773485],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998653,0.000012781635,0.000008903537,0.000035658974,0.00003269238,0.000044696095],"domain_scores_gemma":[0.99963355,0.00017259798,0.00004350389,0.000048490645,0.000057867084,0.000043910542],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017415168,0.0004498357,0.00048218374,0.00064744544,0.0005482007,0.0007379917,0.0012111743,0.00051495805,0.0032273834],"category_scores_gemma":[0.0019350058,0.00029132617,0.00036251455,0.0011656027,0.0005683792,0.0011445764,0.0007520671,0.00039080632,0.00038134554],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029455288,0.000064582244,0.0044807917,0.000097018434,0.000023943041,0.0002283157,0.0002310209,0.8777794,0.011037947,0.010930784,0.003386076,0.09144547],"study_design_scores_gemma":[0.000017236829,0.000008547534,0.0002233708,0.0000016427911,0.000001935127,0.000010958392,0.000023492084,0.99567103,0.0009858382,0.0026880833,0.00036541495,0.0000023689897],"about_ca_topic_score_codex":0.018246885,"about_ca_topic_score_gemma":0.018772362,"teacher_disagreement_score":0.018246885,"about_ca_system_score_codex":0.000778823,"about_ca_system_score_gemma":0.0007252462,"threshold_uncertainty_score":0.036281347},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.062797636,0.0015403942,0.81475365,0.000847642,0.00045015203,0.00038717623,0.004477494,0.011995018,0.102750815],"genre_scores_gemma":[0.3325387,0.0014429766,0.5733666,0.000754043,0.00018417483,0.00073392445,0.017685527,0.0048749703,0.06841904],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982293,0.00018103456,0.00013324611,0.0004101157,0.00084246474,0.00020372769],"domain_scores_gemma":[0.9962835,0.0004783804,0.00031501555,0.0011987212,0.0013267129,0.00039771182],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015023929,0.0010853772,0.0010150558,0.0022792742,0.0018921035,0.0023260799,0.0020243716,0.0017634169,0.02037327],"category_scores_gemma":[0.0068691107,0.0010285896,0.00090608944,0.0023378204,0.0012777621,0.0022802523,0.0027120833,0.0023289255,0.016190441],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001160918,0.0004357817,0.005319158,0.0010081712,0.00011544412,0.00069157605,0.000655865,0.030907454,0.038795296,0.31397045,0.12701151,0.47992834],"study_design_scores_gemma":[0.00017004894,0.0006131186,0.0042360593,0.00037120338,0.00009555342,0.0044135293,0.00090407144,0.21923165,0.062895395,0.14598404,0.56085503,0.00023037083],"about_ca_topic_score_codex":0.0030616699,"about_ca_topic_score_gemma":0.0028761649,"teacher_disagreement_score":0.02037327,"about_ca_system_score_codex":0.0008384031,"about_ca_system_score_gemma":0.0015103021,"threshold_uncertainty_score":0.06815535},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6705584,0.00081394747,0.25545424,0.0008475879,0.000105240986,0.00013003612,0.002137689,0.0014261277,0.06852669],"genre_scores_gemma":[0.96600205,0.0003293127,0.025575396,0.00006488151,0.0000329014,0.00007635074,0.0015242986,0.00062334473,0.0057715075],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99832565,0.0003051213,0.000065124295,0.000099415454,0.00097122556,0.00023345207],"domain_scores_gemma":[0.9941486,0.004013659,0.00039234996,0.0004076737,0.00070293806,0.0003347676],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005273075,0.00059554237,0.0008790838,0.0010727476,0.000493624,0.0016645074,0.0010590097,0.0010968476,0.013051472],"category_scores_gemma":[0.010335988,0.0005790708,0.00045973976,0.0013047035,0.00043848992,0.0016010313,0.0012452684,0.0005671354,0.00143],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010849332,0.00019370255,0.0033876773,0.000555579,0.000030747116,0.0007246821,0.0004827265,0.67230046,0.09215693,0.09946697,0.008827893,0.12078768],"study_design_scores_gemma":[0.000067090295,0.00033233702,0.0038413263,0.000044123186,0.000027840248,0.00071781984,0.00033891018,0.8826327,0.057900198,0.04687199,0.007181773,0.000043937085],"about_ca_topic_score_codex":0.0016242889,"about_ca_topic_score_gemma":0.0018378629,"teacher_disagreement_score":0.013051472,"about_ca_system_score_codex":0.00058687583,"about_ca_system_score_gemma":0.00041743572,"threshold_uncertainty_score":0.043661535},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03467441,0.0018951338,0.9525085,0.0013395952,0.00012240179,0.00014148439,0.00065391714,0.0019410859,0.006723483],"genre_scores_gemma":[0.37723473,0.0017055888,0.6075848,0.0010765876,0.0005436621,0.00049126527,0.0018456327,0.0008012881,0.008716422],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9914506,0.0022673726,0.00049277174,0.0014495968,0.0033073525,0.0010324345],"domain_scores_gemma":[0.9810924,0.010700718,0.0014538963,0.0048055397,0.0014724856,0.00047501668],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034871376,0.0016580564,0.0028087785,0.0021677478,0.0017087254,0.0029122932,0.0042895703,0.001956392,0.01054598],"category_scores_gemma":[0.02726675,0.0009704993,0.0016939121,0.0054261326,0.0027516035,0.0146083385,0.00802937,0.004417852,0.0021959718],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013672665,0.00041836323,0.004563786,0.0005808728,0.00014438735,0.00018189107,0.00067760365,0.15794687,0.0079333605,0.3398673,0.016497284,0.469821],"study_design_scores_gemma":[0.00012621497,0.00027943283,0.00073114387,0.00007164131,0.0000769069,0.00031146038,0.00017994744,0.6122334,0.0064510424,0.36761495,0.011858292,0.000065551634],"about_ca_topic_score_codex":0.0036645718,"about_ca_topic_score_gemma":0.0030893628,"teacher_disagreement_score":0.01054598,"about_ca_system_score_codex":0.0017624267,"about_ca_system_score_gemma":0.0019505983,"threshold_uncertainty_score":0.03527981},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010156459,0.00013394647,0.9858969,0.00017617816,0.000060131624,0.0000922865,0.0001508473,0.0016791304,0.0016541309],"genre_scores_gemma":[0.0896927,0.0000870134,0.90747017,0.00011567224,0.00004996426,0.00017458327,0.00037815757,0.00027278793,0.0017589249],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980977,0.00039302727,0.00014038752,0.0004971093,0.0005779173,0.00029383932],"domain_scores_gemma":[0.99824417,0.00059490907,0.00019639866,0.00052078126,0.00031499047,0.00012880297],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010983747,0.0009024892,0.0012955946,0.0011345748,0.0009891631,0.0013729093,0.0021837708,0.0012080582,0.01050391],"category_scores_gemma":[0.0058616246,0.00066404184,0.0010913418,0.0014114939,0.0011240735,0.003676987,0.00308703,0.0016906199,0.0027049065],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017010055,0.00030203376,0.0018855835,0.0003939364,0.00010857321,0.000117171025,0.0002878233,0.12925789,0.04301792,0.108208135,0.015229081,0.69949085],"study_design_scores_gemma":[0.0004964494,0.00051371957,0.00081053417,0.000042808922,0.00004943807,0.00025018048,0.00015278882,0.8244243,0.031222152,0.1293303,0.012598362,0.00010891775],"about_ca_topic_score_codex":0.0025303026,"about_ca_topic_score_gemma":0.004918119,"teacher_disagreement_score":0.01050391,"about_ca_system_score_codex":0.0013877486,"about_ca_system_score_gemma":0.0024440202,"threshold_uncertainty_score":0.035139084},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053340156,0.00046537354,0.932205,0.0005339626,0.0001877063,0.00010914191,0.00049373234,0.002450247,0.010214676],"genre_scores_gemma":[0.2837401,0.00048504202,0.7083703,0.00015764245,0.00011994567,0.00011862731,0.0010322199,0.00088568026,0.00509035],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99941397,0.0001037772,0.00003595166,0.000115877316,0.00025001494,0.000080374106],"domain_scores_gemma":[0.998159,0.0010808435,0.00008233604,0.0003929513,0.00019882283,0.00008602483],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047073598,0.0009214007,0.0014317736,0.0015959996,0.0007421329,0.0022781584,0.0012621694,0.0011741789,0.011829475],"category_scores_gemma":[0.006345767,0.0009329142,0.0011460421,0.0022179731,0.0009893813,0.002913242,0.0022047772,0.001374061,0.0021531056],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039547443,0.00012183125,0.0015867266,0.00042842256,0.00011668761,0.00027892055,0.00021740726,0.4707158,0.008213422,0.13046445,0.019773059,0.36768788],"study_design_scores_gemma":[0.00006684012,0.000047344518,0.00024817543,0.000022027452,0.000027668959,0.00010908037,0.000076861004,0.87161005,0.0027778074,0.11999959,0.005001384,0.00001305229],"about_ca_topic_score_codex":0.0031110467,"about_ca_topic_score_gemma":0.0065376265,"teacher_disagreement_score":0.011829475,"about_ca_system_score_codex":0.00075422344,"about_ca_system_score_gemma":0.0011646559,"threshold_uncertainty_score":0.03957349},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008178576,0.00003463803,0.9908346,0.00003218382,0.000027675376,0.00002551521,0.000016495364,0.00011071259,0.0007395457],"genre_scores_gemma":[0.18143462,0.00008899286,0.8159603,0.000044162727,0.000022710055,0.00011765568,0.000082319464,0.00012548317,0.002123709],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995932,0.00010212406,0.000021521322,0.00005304937,0.00020755251,0.00002244699],"domain_scores_gemma":[0.99937063,0.00021198358,0.000050392544,0.00018142052,0.00014264625,0.000042925938],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071081053,0.0003873631,0.0007421605,0.00054886995,0.0003623375,0.0005544905,0.0011876911,0.0009650321,0.0017979505],"category_scores_gemma":[0.00187524,0.00043444245,0.0005783874,0.00044853872,0.0006587985,0.0007545052,0.0014612568,0.0009916552,0.00050371594],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024334124,0.00014635823,0.0012757407,0.000206251,0.000055222034,0.00013369795,0.0002661499,0.7825227,0.04492477,0.03917251,0.0012403181,0.12981293],"study_design_scores_gemma":[0.000023400149,0.000030011677,0.000069326205,0.000005153195,0.0000063703537,0.000024353198,0.000007247569,0.9942187,0.0028979513,0.0018286251,0.0008801742,0.000008547864],"about_ca_topic_score_codex":0.0010402724,"about_ca_topic_score_gemma":0.0017370939,"teacher_disagreement_score":0.0017979505,"about_ca_system_score_codex":0.00032353762,"about_ca_system_score_gemma":0.00070347515,"threshold_uncertainty_score":0.0060147047},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21228379,0.001679763,0.76319164,0.0022497633,0.00015867218,0.00023560987,0.0056712627,0.006352401,0.008177031],"genre_scores_gemma":[0.68947995,0.0007119971,0.2917631,0.0004530345,0.00025030997,0.00042344187,0.010960321,0.0005367652,0.005421144],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99532604,0.0007655684,0.00066504854,0.0011595943,0.001608161,0.00047553767],"domain_scores_gemma":[0.98795635,0.005127537,0.0011799127,0.004374572,0.0008597525,0.0005019464],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021419118,0.0008922347,0.0020499288,0.0015615417,0.0007743369,0.002912102,0.0029229424,0.0019803783,0.007088672],"category_scores_gemma":[0.021519309,0.00061073434,0.00096062606,0.0035303547,0.0014540082,0.013908827,0.0046507,0.002152062,0.002084702],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0024253991,0.0005072534,0.00897964,0.00110283,0.00015601201,0.0003576921,0.0012199389,0.30345666,0.017648954,0.2808617,0.019417834,0.36386612],"study_design_scores_gemma":[0.00014732043,0.00032882183,0.0010435501,0.00007496458,0.000049053382,0.00047931026,0.0004544287,0.5819937,0.01111514,0.39379868,0.010454408,0.000060697977],"about_ca_topic_score_codex":0.0012513568,"about_ca_topic_score_gemma":0.0015184957,"teacher_disagreement_score":0.007088672,"about_ca_system_score_codex":0.001583391,"about_ca_system_score_gemma":0.0012958711,"threshold_uncertainty_score":0.023713946},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050918598,0.00007980975,0.94659376,0.00005289883,0.0000139208,0.000042309824,0.000100742254,0.00025668924,0.0019411859],"genre_scores_gemma":[0.36829484,0.00014569008,0.6291532,0.000023830544,0.000008164499,0.00012527569,0.0004542019,0.00012351885,0.0016713272],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99980885,0.000037535756,0.000012132861,0.000031672847,0.000078805264,0.00003103827],"domain_scores_gemma":[0.99948514,0.00033891975,0.000033982742,0.000039874092,0.00008100887,0.000021035108],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027165972,0.00040292114,0.00056243804,0.0006724794,0.00040069318,0.0005935885,0.00070244214,0.0006282003,0.0018573365],"category_scores_gemma":[0.0016506049,0.00027992632,0.0005649811,0.00059485034,0.00047770445,0.00088616874,0.0007957322,0.00047306606,0.0003045236],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010027204,0.00003440851,0.001075164,0.00014056993,0.000019669858,0.0002064416,0.00017497211,0.91862774,0.00770731,0.022417812,0.0012527844,0.048242904],"study_design_scores_gemma":[0.0000075298326,0.000016935259,0.000123332,0.0000058349574,0.0000025875138,0.00003278683,0.000029858047,0.9898663,0.001255542,0.007772817,0.0008826263,0.0000038043747],"about_ca_topic_score_codex":0.0040800096,"about_ca_topic_score_gemma":0.003597316,"teacher_disagreement_score":0.0040800096,"about_ca_system_score_codex":0.00043082642,"about_ca_system_score_gemma":0.0007243876,"threshold_uncertainty_score":0.00811249},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00503939,0.000059854276,0.9922576,0.000035332952,0.00003288021,0.00003231363,0.000111463065,0.0015388617,0.00089236983],"genre_scores_gemma":[0.13333136,0.00020971496,0.85958666,0.0001413264,0.000044842793,0.0001823431,0.0012565234,0.00052957435,0.004717736],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994186,0.000049466213,0.000026499738,0.00020178528,0.00024203751,0.000061622784],"domain_scores_gemma":[0.9995834,0.00004657395,0.000038451828,0.00014601121,0.00015557153,0.000029920195],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003421194,0.0007687302,0.001056783,0.0012432946,0.000588898,0.0009057727,0.001485257,0.000537686,0.004441444],"category_scores_gemma":[0.00097506697,0.0005560218,0.0011338136,0.0012866264,0.0005638172,0.0009989719,0.00130605,0.000845786,0.0032431677],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015288884,0.00012865916,0.0007598275,0.00008960553,0.000074687225,0.00007344325,0.0000717624,0.025932375,0.18328646,0.008105607,0.0063280505,0.77499676],"study_design_scores_gemma":[0.0000314871,0.00011979391,0.004140252,0.00001664228,0.00007292331,0.00040028608,0.00007866443,0.83154863,0.14236477,0.012531102,0.008629469,0.00006589617],"about_ca_topic_score_codex":0.0061903936,"about_ca_topic_score_gemma":0.01136226,"teacher_disagreement_score":0.0061903936,"about_ca_system_score_codex":0.00055405434,"about_ca_system_score_gemma":0.0011417685,"threshold_uncertainty_score":0.014858127},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18459684,0.0009555378,0.7757175,0.0005806052,0.0004275492,0.000049859085,0.00017264865,0.00083654444,0.036662996],"genre_scores_gemma":[0.853107,0.000484619,0.13162343,0.00013459001,0.00009148486,0.000062309,0.0002462461,0.00045393582,0.013796251],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995049,0.00012775547,0.00001297841,0.00011365604,0.00015628347,0.00008433956],"domain_scores_gemma":[0.9980469,0.0010268199,0.00016231072,0.00026231885,0.00031179964,0.0001898716],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013008508,0.0008224126,0.00068519125,0.0018340207,0.00055157364,0.0020015256,0.0014243746,0.0012635016,0.006844115],"category_scores_gemma":[0.0071852277,0.00044209266,0.00048548728,0.0010562309,0.001564981,0.0022297525,0.0016325044,0.002031889,0.0010769807],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039232738,0.00012834583,0.0030113922,0.00021885145,0.00004185198,0.00025100753,0.00023233648,0.39783284,0.010246832,0.5064,0.005850678,0.075393654],"study_design_scores_gemma":[0.000014227663,0.0000408732,0.00035054304,0.000022695991,0.000010136934,0.00007325768,0.000044759792,0.91646916,0.002539587,0.07779176,0.002626449,0.000016484937],"about_ca_topic_score_codex":0.0017792408,"about_ca_topic_score_gemma":0.0017059579,"teacher_disagreement_score":0.006844115,"about_ca_system_score_codex":0.0020496529,"about_ca_system_score_gemma":0.0006815357,"threshold_uncertainty_score":0.022895813},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2517566,0.00018856276,0.70174164,0.00020124519,0.00021019172,0.0001412565,0.00035086242,0.0008728098,0.044536885],"genre_scores_gemma":[0.6977044,0.0002808358,0.28429905,0.00006249714,0.000047126847,0.00009467977,0.00057769904,0.00030074912,0.01663295],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99969995,0.000032252654,0.000016936929,0.000075329925,0.000112741945,0.00006289353],"domain_scores_gemma":[0.99953353,0.0001936735,0.00004424671,0.00013291943,0.000042165062,0.000053534288],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020918963,0.00045695034,0.00068868056,0.00062847306,0.0007331134,0.0011904355,0.0008341852,0.0008171051,0.008020442],"category_scores_gemma":[0.00086595217,0.0006753712,0.00072518026,0.00071844633,0.00092025445,0.0008872612,0.0017807209,0.0008648711,0.001102877],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020944856,0.00027429376,0.0024524655,0.0004439793,0.00012253935,0.003790501,0.00095975475,0.29848045,0.17006409,0.29220694,0.008589693,0.22052076],"study_design_scores_gemma":[0.00025654997,0.0006287367,0.0016400098,0.000083588224,0.00008211012,0.0014304331,0.0006009838,0.77620304,0.05706353,0.12677523,0.035165302,0.000070352435],"about_ca_topic_score_codex":0.0009253417,"about_ca_topic_score_gemma":0.0008841753,"teacher_disagreement_score":0.008020442,"about_ca_system_score_codex":0.00034510676,"about_ca_system_score_gemma":0.00038901228,"threshold_uncertainty_score":0.02683103},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04925409,0.00018895666,0.9382392,0.00016609469,0.00006973517,0.00009029162,0.00018448675,0.00037159884,0.011435669],"genre_scores_gemma":[0.59636134,0.00037613377,0.38643205,0.00012543992,0.000049353403,0.00021837362,0.0008569941,0.0004939797,0.015086321],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992417,0.00021242327,0.00004647046,0.00011076027,0.00031675768,0.000071900766],"domain_scores_gemma":[0.9980981,0.0011168603,0.000101579186,0.00032895216,0.00021196839,0.00014251734],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062582694,0.00063766266,0.0009405535,0.00071411754,0.00050454173,0.001618448,0.0014781936,0.0008718358,0.006328694],"category_scores_gemma":[0.0047276984,0.00086843973,0.0005498097,0.0007635353,0.0011773087,0.0015018279,0.002574376,0.0018322025,0.0012075929],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00076335174,0.00014918268,0.0019655295,0.00047971754,0.00006948763,0.0006781432,0.00048049065,0.46800366,0.05710898,0.31832585,0.0066402825,0.14533535],"study_design_scores_gemma":[0.000038043654,0.000073470714,0.00047449043,0.00004094576,0.00001544986,0.00018769351,0.0000790004,0.9025453,0.009407826,0.08038237,0.0067416825,0.000013834247],"about_ca_topic_score_codex":0.00069331337,"about_ca_topic_score_gemma":0.0013167997,"teacher_disagreement_score":0.006328694,"about_ca_system_score_codex":0.00053238985,"about_ca_system_score_gemma":0.00038018016,"threshold_uncertainty_score":0.02117163},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27549255,0.0043390063,0.60687685,0.01848058,0.00082461396,0.00014541413,0.001376838,0.0005542324,0.091909975],"genre_scores_gemma":[0.8278141,0.0022743533,0.14964947,0.0015140189,0.0007297644,0.00016088199,0.0013654875,0.0003574477,0.016134419],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99779785,0.0005964338,0.00010876099,0.0005180931,0.0006642542,0.00031468127],"domain_scores_gemma":[0.9875551,0.008843774,0.00050167047,0.0017288389,0.00079415896,0.0005765306],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022077071,0.00084554305,0.0023721985,0.0013066155,0.0026613595,0.004789613,0.0027365386,0.003686301,0.011669872],"category_scores_gemma":[0.022889495,0.0010778214,0.00120584,0.002047669,0.003970035,0.009285236,0.0046588057,0.0049084183,0.0015864295],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025366683,0.000093022216,0.002020736,0.00029780998,0.000043300995,0.00016073303,0.00030469807,0.036231514,0.0013815251,0.8964779,0.01307428,0.049660824],"study_design_scores_gemma":[0.000042137435,0.0000301979,0.00023797608,0.00004595776,0.000012173367,0.00015815701,0.00020570261,0.047952306,0.0006028074,0.9458077,0.004887954,0.000016833454],"about_ca_topic_score_codex":0.002153456,"about_ca_topic_score_gemma":0.0020315459,"teacher_disagreement_score":0.011669872,"about_ca_system_score_codex":0.00095711334,"about_ca_system_score_gemma":0.000904336,"threshold_uncertainty_score":0.03903961},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5927062,0.00022309045,0.39942923,0.00028720702,0.000015116461,0.00013676012,0.001350716,0.0012359354,0.0046156542],"genre_scores_gemma":[0.72922534,0.00021730091,0.263747,0.00005230578,0.00001627663,0.00010153916,0.0046001947,0.00026366004,0.0017763878],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99877316,0.00018025072,0.00007994993,0.00030750906,0.00040487354,0.00025432522],"domain_scores_gemma":[0.9970893,0.0013472956,0.0005089528,0.0006249519,0.00021583696,0.00021360374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033392187,0.0006506159,0.0009386207,0.0012795683,0.0011476534,0.0027075436,0.0018892795,0.0010911822,0.0045457445],"category_scores_gemma":[0.0041210437,0.00094688707,0.001476573,0.0021783735,0.001511117,0.0040447144,0.0020238496,0.0015229934,0.0004971294],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012242808,0.0004482985,0.020121755,0.0008017331,0.00026880202,0.0014330967,0.0019542777,0.5936573,0.053070106,0.16675252,0.006483456,0.15378433],"study_design_scores_gemma":[0.000071059534,0.00012753505,0.004340559,0.00005279387,0.00004697017,0.0004340045,0.0006337464,0.89501035,0.01957421,0.07582018,0.003842179,0.000046426136],"about_ca_topic_score_codex":0.004846794,"about_ca_topic_score_gemma":0.005453473,"teacher_disagreement_score":0.004846794,"about_ca_system_score_codex":0.0010231384,"about_ca_system_score_gemma":0.00050100236,"threshold_uncertainty_score":0.015207052},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6237134,0.0019260179,0.3293141,0.0015771979,0.00014537132,0.00017646284,0.00061616604,0.00036357372,0.042167682],"genre_scores_gemma":[0.9353935,0.0015761373,0.0528367,0.00027468367,0.0002512752,0.00017033861,0.0008879891,0.0003040427,0.008305455],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99885154,0.00027624526,0.000075871576,0.0002701228,0.00033154394,0.00019475486],"domain_scores_gemma":[0.9813239,0.01163281,0.0026373938,0.0014944839,0.0018435327,0.0010678283],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013181907,0.00079143455,0.00087128807,0.0033912433,0.0019316081,0.003258569,0.0017721462,0.0015247959,0.008593765],"category_scores_gemma":[0.011600718,0.000806565,0.001100721,0.0035880422,0.0025152112,0.005234368,0.00172518,0.0017660336,0.0007149704],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011210351,0.00009316434,0.0049713785,0.00021483914,0.000033090393,0.0005061937,0.0010518358,0.041258972,0.0045357565,0.9240321,0.0021699206,0.021020774],"study_design_scores_gemma":[0.00003138048,0.000086931155,0.002431368,0.0000663639,0.00003264059,0.0009826295,0.00065939926,0.15510784,0.0026523469,0.8278348,0.01007577,0.000038465223],"about_ca_topic_score_codex":0.0027061354,"about_ca_topic_score_gemma":0.0023633633,"teacher_disagreement_score":0.008593765,"about_ca_system_score_codex":0.0017225286,"about_ca_system_score_gemma":0.0005795043,"threshold_uncertainty_score":0.02874899},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008120102,0.00002781636,0.99070436,0.00001963276,0.000009372694,0.000053287928,0.0000705558,0.0003161039,0.0006787829],"genre_scores_gemma":[0.11899562,0.000099011064,0.8786992,0.000031312993,0.000010908353,0.0002513464,0.00050365715,0.00043320103,0.00097584346],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989875,0.00013072937,0.00006750416,0.00018557528,0.00055098993,0.00007767725],"domain_scores_gemma":[0.9987697,0.000500373,0.00012632928,0.00028886466,0.00026475574,0.000049924645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007570862,0.00087299786,0.0014522383,0.0010450423,0.0005953815,0.0012292642,0.0019664743,0.00092898606,0.0031757413],"category_scores_gemma":[0.0045468756,0.001065636,0.0011988528,0.0009033267,0.0009309842,0.001333368,0.00264532,0.0015246049,0.00094164023],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010770499,0.000031929423,0.00097423466,0.00019488408,0.000051885472,0.0002485906,0.00047760084,0.7601721,0.020885915,0.04225553,0.0031573572,0.17144229],"study_design_scores_gemma":[0.000012769831,0.000028911749,0.00010924663,0.000017693921,0.000006247138,0.000064535285,0.00008751466,0.9759635,0.0048265746,0.014506532,0.0043589105,0.000017567196],"about_ca_topic_score_codex":0.0030747498,"about_ca_topic_score_gemma":0.00363398,"teacher_disagreement_score":0.0031757413,"about_ca_system_score_codex":0.00064360216,"about_ca_system_score_gemma":0.0011094407,"threshold_uncertainty_score":0.010623872},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0140523305,0.0005143195,0.9819549,0.00033485005,0.00009841879,0.000055338925,0.00012668414,0.00061024184,0.0022529585],"genre_scores_gemma":[0.28505898,0.0007269566,0.70600545,0.00017976318,0.00025738718,0.00035972052,0.00083469704,0.0005838537,0.0059931013],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99913424,0.0001990152,0.000053934873,0.00017119866,0.0003418947,0.000099643534],"domain_scores_gemma":[0.99569327,0.0027229215,0.0002221663,0.00060447876,0.0005002996,0.0002568829],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017494373,0.0012343763,0.0017479056,0.0014185571,0.0011101125,0.0013211947,0.0039501446,0.0016633937,0.008205175],"category_scores_gemma":[0.01020758,0.0010306721,0.0009214757,0.0021176906,0.0015747539,0.003722345,0.00392078,0.0024585824,0.0009809415],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00065310905,0.00018989689,0.00092956,0.00033210198,0.000054919066,0.000090628826,0.00030020787,0.6781006,0.0039070956,0.1309403,0.011122114,0.1733795],"study_design_scores_gemma":[0.00003935705,0.000021159958,0.00006752048,0.000008751931,0.0000049467185,0.000019558047,0.000019421064,0.9591885,0.00053204276,0.038871627,0.0012213025,0.0000057943075],"about_ca_topic_score_codex":0.0048869774,"about_ca_topic_score_gemma":0.005045378,"teacher_disagreement_score":0.008205175,"about_ca_system_score_codex":0.0013499414,"about_ca_system_score_gemma":0.0010495491,"threshold_uncertainty_score":0.027449071},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049576275,0.0014074572,0.70400923,0.001787255,0.0009549482,0.00014540252,0.0009753555,0.0013510723,0.23979299],"genre_scores_gemma":[0.5115004,0.002680194,0.35855564,0.0008899502,0.0008275179,0.00023498673,0.0023330199,0.0021763677,0.120801896],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994555,0.000121838544,0.000021791577,0.00012714438,0.00021746643,0.00005628916],"domain_scores_gemma":[0.9993419,0.00014562678,0.000048617432,0.00015219783,0.00020083466,0.000110809626],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037507567,0.0011249391,0.0008292975,0.0016156019,0.00091782794,0.0024001172,0.00053891324,0.0011813319,0.027859658],"category_scores_gemma":[0.002343809,0.0008206504,0.00088217296,0.0006766268,0.0010090552,0.0023480544,0.003060312,0.003137643,0.00656526],"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.00021605696,0.000030198482,0.00033064644,0.00014231142,0.000040308572,0.0002648228,0.00022332388,0.0048555783,0.013636435,0.8780876,0.020128371,0.082044296],"study_design_scores_gemma":[0.000065519955,0.00011112832,0.0007333169,0.00006998656,0.000042311414,0.0020643654,0.00029295826,0.057043005,0.00966872,0.84389174,0.08596025,0.000056669112],"about_ca_topic_score_codex":0.00043190026,"about_ca_topic_score_gemma":0.0005013358,"teacher_disagreement_score":0.027859658,"about_ca_system_score_codex":0.00036254482,"about_ca_system_score_gemma":0.00030172264,"threshold_uncertainty_score":0.09319985},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5894124,0.0023136826,0.08643328,0.02317078,0.0011941724,0.00009501031,0.002184512,0.0013122963,0.2938838],"genre_scores_gemma":[0.9669594,0.0006756553,0.013419222,0.0011481134,0.0005916721,0.000115338604,0.0012267848,0.00016582644,0.015697844],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985239,0.00021699285,0.00009252165,0.0004352478,0.0002650144,0.00046640154],"domain_scores_gemma":[0.9913316,0.005505396,0.00065962103,0.0014146607,0.00051158614,0.00057708984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018999152,0.0010554136,0.0020924688,0.002181402,0.003985246,0.0059138574,0.0029183354,0.0035293633,0.020628577],"category_scores_gemma":[0.010155805,0.0009497455,0.0017264155,0.0015351423,0.0075386385,0.012009816,0.004547037,0.0044942307,0.0020535863],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019594155,0.000041456722,0.0012715226,0.0001609237,0.000023731674,0.00011907236,0.0003298113,0.0023036005,0.001004608,0.9834257,0.0054744985,0.0056491205],"study_design_scores_gemma":[0.000040239283,0.000020686382,0.0006137388,0.00003420112,0.000019766965,0.00012262583,0.0001983923,0.0053626318,0.00087909197,0.9881109,0.00457712,0.000020561076],"about_ca_topic_score_codex":0.0011356799,"about_ca_topic_score_gemma":0.0013409083,"teacher_disagreement_score":0.020628577,"about_ca_system_score_codex":0.0018906515,"about_ca_system_score_gemma":0.0011278222,"threshold_uncertainty_score":0.06900942},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14558724,0.0004432697,0.8486679,0.00021690533,0.000030419462,0.000075078235,0.00024698218,0.0002453157,0.0044869483],"genre_scores_gemma":[0.6328238,0.0005807845,0.36302862,0.0000653501,0.000035092387,0.00016531328,0.0005482754,0.00010308228,0.0026497212],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99930716,0.00017624263,0.000041441992,0.00011747671,0.00025693086,0.000100683545],"domain_scores_gemma":[0.99815434,0.0011884088,0.00023854352,0.00018874342,0.00012396809,0.00010593566],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075006625,0.00068010564,0.0012203419,0.0011541668,0.00045056056,0.0015611189,0.0013822827,0.0012556136,0.0030362413],"category_scores_gemma":[0.005848962,0.00072128366,0.0007210775,0.0017243722,0.001026104,0.0018392884,0.0023635624,0.0012710509,0.00046075106],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011750405,0.000040394327,0.0018142932,0.00008974164,0.000023439388,0.00012958104,0.00013206019,0.9394724,0.001893515,0.03284481,0.00060063094,0.022841617],"study_design_scores_gemma":[0.000015375146,0.000033659006,0.00012286232,0.000021116528,0.0000033896883,0.000030387335,0.00003278674,0.97798514,0.0005928967,0.020510001,0.0006460477,0.0000062995337],"about_ca_topic_score_codex":0.0028330213,"about_ca_topic_score_gemma":0.0029125537,"teacher_disagreement_score":0.0030362413,"about_ca_system_score_codex":0.0009245296,"about_ca_system_score_gemma":0.0005128273,"threshold_uncertainty_score":0.0101572275},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33675843,0.00055869116,0.61515146,0.0010929971,0.00012251154,0.00020287483,0.0021811505,0.000833847,0.043097965],"genre_scores_gemma":[0.6616988,0.00072799774,0.30842546,0.00032567343,0.00011917916,0.00029968668,0.004840888,0.00031348722,0.023248816],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992361,0.00007001617,0.000056883946,0.00021639121,0.00028425,0.00013636681],"domain_scores_gemma":[0.9982084,0.00074388954,0.0002757014,0.00026808988,0.00031307034,0.00019078927],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026882018,0.0005674606,0.00112326,0.0021524879,0.0016132855,0.0028991355,0.0015672,0.0016852226,0.0090957405],"category_scores_gemma":[0.0022934393,0.0010369963,0.0007336896,0.0029860327,0.0012467448,0.004220589,0.002286961,0.0020362176,0.0024766098],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043176184,0.0003305373,0.0042702444,0.0006099736,0.000096489704,0.0008095639,0.0012265049,0.01620902,0.025071261,0.795115,0.011506757,0.14432284],"study_design_scores_gemma":[0.000098556535,0.0001740598,0.00362828,0.00014232585,0.00007288335,0.0020845716,0.00079792057,0.07583192,0.010435699,0.8703303,0.036349755,0.000053718475],"about_ca_topic_score_codex":0.0005872899,"about_ca_topic_score_gemma":0.00060718117,"teacher_disagreement_score":0.0090957405,"about_ca_system_score_codex":0.0005793295,"about_ca_system_score_gemma":0.0003142782,"threshold_uncertainty_score":0.03042823},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012958098,0.011957333,0.17572677,0.02073045,0.09709767,0.00022377876,0.0076344837,0.0031175113,0.67055386],"genre_scores_gemma":[0.16405691,0.013880274,0.08790831,0.0068600113,0.030429568,0.00031232584,0.0078118327,0.0026936485,0.6860471],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99963725,0.00007151909,0.000043793025,0.00007409123,0.00014783557,0.00002555426],"domain_scores_gemma":[0.9987281,0.00050442247,0.00011180337,0.00030197622,0.00027032444,0.00008335196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037231794,0.0006624549,0.00037666247,0.0017379423,0.00091302895,0.0017955106,0.000817602,0.0009400169,0.107484125],"category_scores_gemma":[0.0033485165,0.00029139727,0.00041372233,0.002575439,0.0017212091,0.002090563,0.0008353326,0.0016505271,0.026325343],"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.00012559716,0.000021372673,0.00033482004,0.00043490305,0.000018499786,0.00048783628,0.00023731883,0.002353371,0.00221752,0.29811537,0.60263395,0.09301953],"study_design_scores_gemma":[0.00001442469,0.0000279636,0.00060857175,0.00010748719,0.0000059856648,0.00072884414,0.00011284937,0.002679034,0.0012527457,0.06030983,0.93413585,0.000016486083],"about_ca_topic_score_codex":0.001475249,"about_ca_topic_score_gemma":0.0022128662,"teacher_disagreement_score":0.107484125,"about_ca_system_score_codex":0.00072814967,"about_ca_system_score_gemma":0.00040743363,"threshold_uncertainty_score":0.35957026},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056935392,0.00072039757,0.77757186,0.0006927256,0.0014532862,0.0004334263,0.00079431606,0.0017662159,0.15963243],"genre_scores_gemma":[0.5890199,0.0006275009,0.25810108,0.00053501414,0.00038839952,0.00069796236,0.0020339855,0.002208005,0.1463882],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99788755,0.00043810008,0.00012591881,0.00047774005,0.0007380769,0.00033244834],"domain_scores_gemma":[0.99757,0.00056098535,0.00023173165,0.00091586687,0.00045079426,0.00027055407],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009843882,0.0020755976,0.0015572795,0.0019410222,0.0025459148,0.0037952925,0.0027947621,0.002628863,0.04821879],"category_scores_gemma":[0.0063929777,0.0016906471,0.0017299553,0.0012756962,0.0029133917,0.004885195,0.009352347,0.0035164794,0.013380613],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005304438,0.00011840656,0.0007958016,0.00043308205,0.00008179794,0.001267463,0.0005757542,0.027863998,0.008482938,0.8582201,0.020597667,0.081032485],"study_design_scores_gemma":[0.0001681131,0.00024884558,0.0005297148,0.0001669925,0.0000616164,0.0017582938,0.00057010324,0.07213495,0.02055165,0.81372154,0.08997793,0.000110367095],"about_ca_topic_score_codex":0.00062132115,"about_ca_topic_score_gemma":0.00061747804,"teacher_disagreement_score":0.04821879,"about_ca_system_score_codex":0.0006688678,"about_ca_system_score_gemma":0.0006821888,"threshold_uncertainty_score":0.16130793},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46488,0.00058979425,0.44717985,0.0005417792,0.00014874198,0.00021065802,0.0017409513,0.00084672787,0.0838614],"genre_scores_gemma":[0.88351554,0.00050044834,0.09822534,0.00018373503,0.00004793362,0.00030817665,0.0019007329,0.0003870259,0.014931009],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985629,0.00019917834,0.00013442563,0.00037156872,0.00044185916,0.0002901288],"domain_scores_gemma":[0.997449,0.0011240117,0.00038499606,0.0004418213,0.0002773853,0.00032275883],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007430688,0.0007539913,0.0011730007,0.0021128021,0.0019882217,0.0031742305,0.0023907812,0.0018330354,0.008795505],"category_scores_gemma":[0.0052952175,0.0012117496,0.0013012697,0.0017684174,0.0023728386,0.003351161,0.004202615,0.0019127249,0.0011819134],"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.00026616998,0.00008472609,0.0014073317,0.0001617389,0.000027490118,0.00027292388,0.0009466263,0.018245133,0.003534915,0.9266908,0.0034550333,0.044907108],"study_design_scores_gemma":[0.000069655136,0.00007346496,0.0015052053,0.00013909089,0.00004539571,0.00033498948,0.0006055025,0.04977284,0.005475841,0.9319155,0.0100062145,0.000056410325],"about_ca_topic_score_codex":0.0016428143,"about_ca_topic_score_gemma":0.00188458,"teacher_disagreement_score":0.008795505,"about_ca_system_score_codex":0.0017478666,"about_ca_system_score_gemma":0.0005592236,"threshold_uncertainty_score":0.029423892},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45002645,0.0019156924,0.46027446,0.0013033237,0.0002941423,0.00018862619,0.0013556454,0.0009782223,0.083663285],"genre_scores_gemma":[0.81671256,0.001333371,0.16306281,0.0005181085,0.00014606952,0.00022366941,0.002104245,0.0004877387,0.015411442],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99741685,0.0004781399,0.00016309522,0.0004929372,0.00086703856,0.00058190647],"domain_scores_gemma":[0.99186665,0.005054712,0.00078289496,0.0013194991,0.0005408406,0.00043549988],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010877205,0.00092500495,0.0011510283,0.0011127499,0.0016921125,0.0037036652,0.0019445322,0.0008608276,0.009677086],"category_scores_gemma":[0.010021307,0.0012660536,0.0011159297,0.001924952,0.0029642845,0.0041079684,0.004544131,0.0032731364,0.0023101773],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011765265,0.00022008273,0.004800498,0.00074757414,0.00012264575,0.0013074225,0.0007939745,0.109422706,0.011144209,0.77837014,0.0112713,0.08062298],"study_design_scores_gemma":[0.00011399484,0.0001743638,0.0010847253,0.0001790646,0.00007378185,0.0011070577,0.00063943246,0.14153546,0.014546539,0.82049036,0.019995505,0.000059698592],"about_ca_topic_score_codex":0.0013521764,"about_ca_topic_score_gemma":0.0017249042,"teacher_disagreement_score":0.009677086,"about_ca_system_score_codex":0.0009792779,"about_ca_system_score_gemma":0.00060651894,"threshold_uncertainty_score":0.03237307},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025430243,0.00006167229,0.97172314,0.0000811264,0.000026322468,0.000051042138,0.00011898419,0.00043278042,0.0020747406],"genre_scores_gemma":[0.45827916,0.00028857827,0.5392366,0.000045172263,0.0000149417465,0.00030072412,0.00044210578,0.0001610265,0.0012316684],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996308,0.00009058011,0.000024254263,0.000055444805,0.00015955736,0.000039222963],"domain_scores_gemma":[0.9995454,0.00022650145,0.000046709134,0.000055796827,0.00008953356,0.0000361123],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005072646,0.0005438479,0.00066816946,0.00088691333,0.00060576934,0.001038878,0.0011325285,0.00092608074,0.0015058826],"category_scores_gemma":[0.0013617274,0.00037821278,0.0011384164,0.00088838255,0.00077433995,0.0009926973,0.0013863504,0.00063680846,0.00028307308],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014162027,0.000016123859,0.00072439975,0.000027995311,0.000007964279,0.000055645432,0.000084873755,0.9832985,0.0018677331,0.008093646,0.00016810776,0.005640792],"study_design_scores_gemma":[0.0000031975505,0.0000043990312,0.00004087154,0.0000022057532,0.0000011085895,0.000010072662,0.000013057239,0.99747914,0.00047818228,0.0013977693,0.0005664519,0.0000035296346],"about_ca_topic_score_codex":0.018046793,"about_ca_topic_score_gemma":0.007577739,"teacher_disagreement_score":0.018046793,"about_ca_system_score_codex":0.0007484344,"about_ca_system_score_gemma":0.001206196,"threshold_uncertainty_score":0.035883486},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45996746,0.0061465558,0.41707885,0.00351129,0.0004648156,0.000058936403,0.00026998357,0.00031044125,0.11219174],"genre_scores_gemma":[0.9421191,0.0027979612,0.041810323,0.0003591184,0.00050573266,0.000054834472,0.00017668236,0.00022678156,0.0119495345],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995745,0.0001306886,0.000018104309,0.00007743155,0.0001299096,0.00006935797],"domain_scores_gemma":[0.99766904,0.0014860439,0.00019242056,0.00018053323,0.00020004716,0.00027194506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085908227,0.000519592,0.000883835,0.0021577629,0.0011817265,0.0017412764,0.0007177719,0.0010620422,0.0069332686],"category_scores_gemma":[0.0060112746,0.00042351274,0.00041408394,0.0012739131,0.0024468445,0.0036056,0.0020482186,0.0014931771,0.0004360215],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031194304,0.000013261157,0.0002753204,0.000021622916,0.0000038206194,0.000048139034,0.0001481875,0.0046922434,0.0008455028,0.9807552,0.0015470418,0.011618531],"study_design_scores_gemma":[0.000011064465,0.000016607339,0.00031594414,0.000019744586,0.0000049717783,0.0000788759,0.00008997857,0.042540014,0.00028330178,0.95383906,0.002792865,0.000007531169],"about_ca_topic_score_codex":0.0010292389,"about_ca_topic_score_gemma":0.0007531597,"teacher_disagreement_score":0.0069332686,"about_ca_system_score_codex":0.00092754577,"about_ca_system_score_gemma":0.0003451359,"threshold_uncertainty_score":0.023194134},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7022244,0.00026787794,0.279851,0.00067828473,0.0001978412,0.000084957064,0.00048254075,0.0005041315,0.015708968],"genre_scores_gemma":[0.9458067,0.00016281464,0.050609134,0.000055063803,0.00003026383,0.000017476017,0.00029547646,0.000042341217,0.002980859],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99990785,0.000013125119,0.0000027998394,0.000020472668,0.00003454099,0.000021201025],"domain_scores_gemma":[0.99983513,0.0000638194,0.000016651398,0.00003058309,0.000020321017,0.000033514494],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009934571,0.0002367201,0.0003767539,0.00032070008,0.0007252541,0.0005349536,0.0005394997,0.00067241245,0.002356386],"category_scores_gemma":[0.00053646375,0.0002275839,0.00033165247,0.00043183565,0.00045026516,0.00053924,0.0007528455,0.0004941315,0.00020514651],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002963747,0.000077930745,0.0027864205,0.000082930586,0.00009597573,0.0009012505,0.0002075127,0.91827506,0.027882203,0.013414899,0.0024955599,0.033483807],"study_design_scores_gemma":[0.000015770524,0.00005229126,0.0008269187,0.0000046981054,0.0000075342186,0.00008298132,0.00007842545,0.993835,0.0009832634,0.0035685059,0.0005373386,0.0000073386204],"about_ca_topic_score_codex":0.007903563,"about_ca_topic_score_gemma":0.00576585,"teacher_disagreement_score":0.007903563,"about_ca_system_score_codex":0.00030531458,"about_ca_system_score_gemma":0.00034385832,"threshold_uncertainty_score":0.015715122},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01603288,0.00008481458,0.9756739,0.000045047687,0.00006007261,0.000029008297,0.000033486594,0.00027205452,0.0077687707],"genre_scores_gemma":[0.41826132,0.0002790549,0.5651984,0.00020835131,0.00009993421,0.000111598165,0.00025653446,0.0007881791,0.014796628],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994779,0.00014188599,0.000026685026,0.00009992881,0.00019379944,0.000059714046],"domain_scores_gemma":[0.99888843,0.00039502143,0.000061042476,0.00043584814,0.00017301296,0.000046586687],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000842782,0.00075802574,0.0006974818,0.0011659147,0.0004755312,0.0013668024,0.001070596,0.0010264585,0.0072652944],"category_scores_gemma":[0.004619248,0.0006419845,0.00071694667,0.0006793089,0.0010942296,0.0015085118,0.0031058826,0.0017833879,0.0011939558],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002196151,0.00011060437,0.0009492364,0.00014684358,0.00005918103,0.00024715668,0.00038821105,0.25687087,0.02380072,0.4915071,0.0038396022,0.2218608],"study_design_scores_gemma":[0.000020680547,0.000054279364,0.00022810636,0.000030570165,0.000023101506,0.00017110564,0.000084213716,0.72231936,0.0087903645,0.2579315,0.010330984,0.00001575407],"about_ca_topic_score_codex":0.0007962855,"about_ca_topic_score_gemma":0.0017790934,"teacher_disagreement_score":0.0072652944,"about_ca_system_score_codex":0.00042788038,"about_ca_system_score_gemma":0.00027352915,"threshold_uncertainty_score":0.024304867},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040349334,0.00060116226,0.9474444,0.00058673986,0.000131546,0.0001504661,0.00028070292,0.0033677462,0.007087947],"genre_scores_gemma":[0.25211972,0.00036249738,0.74002,0.0001873789,0.00008625658,0.0001815574,0.0011646494,0.0010153875,0.0048626014],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99813014,0.00037557114,0.00011854533,0.0004288075,0.0004884353,0.00045854508],"domain_scores_gemma":[0.99470997,0.003114584,0.00032300784,0.0012361519,0.00039490804,0.00022138773],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018764257,0.0021913627,0.0018241405,0.0016663572,0.0016649836,0.0025239824,0.0038949116,0.002212022,0.012011005],"category_scores_gemma":[0.00880221,0.0014605812,0.001956813,0.002261864,0.0022829499,0.0060256035,0.004030083,0.0028425462,0.0019106824],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008309725,0.00032142684,0.0011715384,0.0004256734,0.00008525159,0.00012624626,0.00030410974,0.6563628,0.004817795,0.060207423,0.015166791,0.26017997],"study_design_scores_gemma":[0.00007572306,0.000054644202,0.000113348375,0.00002030564,0.000030670693,0.000052725212,0.00012431503,0.8959647,0.002814214,0.09885154,0.0018839462,0.000013919455],"about_ca_topic_score_codex":0.0056895744,"about_ca_topic_score_gemma":0.01167654,"teacher_disagreement_score":0.012011005,"about_ca_system_score_codex":0.00232126,"about_ca_system_score_gemma":0.0026700993,"threshold_uncertainty_score":0.040180743},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13041808,0.00042181305,0.8512766,0.00069378415,0.00042981395,0.0000777104,0.00026109943,0.00064830563,0.015772806],"genre_scores_gemma":[0.6732343,0.00065741985,0.30111992,0.00034333876,0.00040125978,0.00013033123,0.0005121351,0.0008148966,0.022786463],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999428,0.00009625639,0.000038731054,0.00010703751,0.0002679734,0.0000619907],"domain_scores_gemma":[0.99896765,0.00026081488,0.00013105758,0.00042780186,0.00014547788,0.00006709564],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048454644,0.00048764257,0.0007234597,0.0007598588,0.00055615354,0.0015169841,0.00081373175,0.00066800293,0.0030874985],"category_scores_gemma":[0.002667099,0.0003526712,0.0007654856,0.00065102155,0.0010932898,0.0018342425,0.0014901048,0.0018102309,0.00086412684],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002746756,0.00020865681,0.0008732199,0.00017891191,0.000062088235,0.00015965,0.00050094066,0.11287879,0.037798826,0.6232174,0.010356703,0.21349002],"study_design_scores_gemma":[0.00004873737,0.00021811058,0.0010813915,0.000024024457,0.00004351417,0.00045686233,0.00026176026,0.4500755,0.03378601,0.49185818,0.022088222,0.00005760514],"about_ca_topic_score_codex":0.000675052,"about_ca_topic_score_gemma":0.00092188944,"teacher_disagreement_score":0.0030874985,"about_ca_system_score_codex":0.0004938384,"about_ca_system_score_gemma":0.00043282495,"threshold_uncertainty_score":0.01032871},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17626746,0.0006641466,0.57062,0.00097641576,0.0004619904,0.00020755672,0.0009209435,0.00096698455,0.24891448],"genre_scores_gemma":[0.6899117,0.00078175555,0.23526591,0.00033100156,0.00018299092,0.0001590538,0.001452037,0.0008159767,0.07109956],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99947137,0.00008745813,0.000024825194,0.000110922425,0.00021857892,0.000086833905],"domain_scores_gemma":[0.9992999,0.00018311893,0.00008925517,0.00017571084,0.00017415053,0.00007793338],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029794595,0.0006226609,0.00054577243,0.0007624483,0.0007426858,0.0015018007,0.0008616766,0.0005605561,0.017041856],"category_scores_gemma":[0.0021949552,0.00047376964,0.0005028136,0.0005384204,0.0010115544,0.0017050747,0.0017053247,0.0018563891,0.002840325],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024856738,0.000069100744,0.00045660193,0.0001360885,0.000009931654,0.000287347,0.00019915795,0.009794067,0.02312873,0.86320525,0.00855794,0.09390719],"study_design_scores_gemma":[0.0001024204,0.0003543143,0.0013323908,0.000074639094,0.000033074306,0.0023324308,0.0004228542,0.09871303,0.030041464,0.7446861,0.12186154,0.000045744033],"about_ca_topic_score_codex":0.00045648406,"about_ca_topic_score_gemma":0.0005539287,"teacher_disagreement_score":0.017041856,"about_ca_system_score_codex":0.00043985216,"about_ca_system_score_gemma":0.00032557826,"threshold_uncertainty_score":0.05701071},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37295467,0.0037622242,0.5832007,0.0067854375,0.0002965383,0.0001763155,0.0010771945,0.0009466212,0.030800233],"genre_scores_gemma":[0.90540284,0.0019552046,0.07540322,0.0011504369,0.0004659758,0.00057392113,0.0010570929,0.00066074583,0.013330667],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968991,0.0012842162,0.00015546242,0.0005071163,0.0007400948,0.00041397227],"domain_scores_gemma":[0.9280531,0.057325173,0.005520471,0.0034770968,0.002327097,0.003297136],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0056956713,0.0015349603,0.0029196632,0.004183414,0.0019971991,0.0057957773,0.0048025656,0.0042192065,0.0075177043],"category_scores_gemma":[0.06307461,0.002598234,0.0017430534,0.0023001747,0.0070398026,0.007325448,0.00583477,0.0044709346,0.00086392433],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00051049766,0.00008154645,0.0034172554,0.0004312248,0.00015297689,0.00033678437,0.00046659572,0.19481058,0.003949797,0.7778866,0.007249897,0.010706289],"study_design_scores_gemma":[0.00010245823,0.0000747675,0.0010061354,0.00011138145,0.0000527364,0.0002825999,0.00014522448,0.39630032,0.0018481279,0.5981366,0.0018813008,0.000058390466],"about_ca_topic_score_codex":0.0016096951,"about_ca_topic_score_gemma":0.0015656719,"teacher_disagreement_score":0.0075177043,"about_ca_system_score_codex":0.0032424,"about_ca_system_score_gemma":0.0010076977,"threshold_uncertainty_score":0.030121922},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26221415,0.0004681633,0.60719705,0.00058229704,0.0006456631,0.00034762517,0.0015135402,0.0025951616,0.12443639],"genre_scores_gemma":[0.51637566,0.0006491391,0.4395104,0.00028639653,0.000107893306,0.000245049,0.0023301723,0.0012090757,0.039286293],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99942964,0.0001177628,0.000028278466,0.00013983411,0.0001396931,0.00014481634],"domain_scores_gemma":[0.9989141,0.00027525506,0.00008548067,0.00036274706,0.00022882165,0.00013356165],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003755082,0.0007820312,0.0006287867,0.0009100677,0.0011213148,0.0016685535,0.0014126127,0.00063429837,0.02072809],"category_scores_gemma":[0.0013890464,0.00072150916,0.00063913054,0.0015978378,0.0006214091,0.0013694462,0.0015114235,0.001221606,0.003471413],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012692951,0.00044109687,0.0030733324,0.0005162228,0.00009670748,0.0005323332,0.00058517966,0.08077762,0.09116288,0.46489307,0.05369875,0.30295345],"study_design_scores_gemma":[0.0004013363,0.00043699023,0.0032963364,0.00013423263,0.000137907,0.0010860553,0.0010953624,0.3514215,0.09172221,0.45071527,0.099454656,0.00009823114],"about_ca_topic_score_codex":0.0019214583,"about_ca_topic_score_gemma":0.0032453046,"teacher_disagreement_score":0.02072809,"about_ca_system_score_codex":0.0007798928,"about_ca_system_score_gemma":0.0005214474,"threshold_uncertainty_score":0.069342315},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07389891,0.00012632435,0.9068474,0.0000909769,0.00013184763,0.00017305081,0.00038481693,0.0027166347,0.015629962],"genre_scores_gemma":[0.55959606,0.0001888821,0.41942775,0.00006612512,0.000026066971,0.000096758136,0.00079210114,0.0008331736,0.018973034],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996427,0.00002940881,0.000020276882,0.0001071644,0.00013719796,0.00006322355],"domain_scores_gemma":[0.99951506,0.00009199185,0.000037304468,0.00024304906,0.00006316198,0.00004945174],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030598423,0.0008533148,0.000916529,0.00083424844,0.00062949845,0.0011971821,0.0012428819,0.0009287069,0.011809342],"category_scores_gemma":[0.0013870047,0.0005633563,0.0011263598,0.00068882597,0.0011459554,0.0012388397,0.0035083832,0.001077167,0.0022424455],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00067655207,0.00016387964,0.002711922,0.00035517913,0.00007755343,0.00084466324,0.0006104531,0.37175786,0.059391115,0.089478016,0.011918139,0.46201468],"study_design_scores_gemma":[0.000032266198,0.00015053416,0.0008199474,0.000056666002,0.000031874297,0.0003802343,0.00021044882,0.91962415,0.02487348,0.03561688,0.018164588,0.00003891401],"about_ca_topic_score_codex":0.0025194508,"about_ca_topic_score_gemma":0.003874213,"teacher_disagreement_score":0.011809342,"about_ca_system_score_codex":0.00026572793,"about_ca_system_score_gemma":0.00044088165,"threshold_uncertainty_score":0.039506197},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038568728,0.0010246478,0.9211597,0.0010984751,0.00029084994,0.00010496301,0.00040847546,0.0007136344,0.036630504],"genre_scores_gemma":[0.4915247,0.0018536779,0.4585017,0.00040391803,0.00022171669,0.0002311962,0.0011886675,0.00047458924,0.045599874],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99957436,0.0001291361,0.000024962985,0.00009713443,0.00012519081,0.000049190883],"domain_scores_gemma":[0.998798,0.00039368242,0.00012865844,0.00030959776,0.00026257712,0.00010748041],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080484827,0.00044858982,0.0004809384,0.0017194729,0.0010064581,0.0015386137,0.001113819,0.00088513206,0.014374516],"category_scores_gemma":[0.0048080226,0.00042299976,0.0004840391,0.0014587875,0.0021001305,0.0029552432,0.0018230017,0.001449034,0.0017860016],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006852728,0.000032281092,0.001004376,0.0001069092,0.000012653915,0.00008382521,0.00014518367,0.06262108,0.0009672881,0.8385657,0.007269521,0.08912258],"study_design_scores_gemma":[0.000031196134,0.000054273114,0.00032786268,0.00006409418,0.000014104298,0.00019967496,0.00016584243,0.22575705,0.0014631224,0.7345563,0.03734774,0.000018719582],"about_ca_topic_score_codex":0.0013334875,"about_ca_topic_score_gemma":0.002690392,"teacher_disagreement_score":0.014374516,"about_ca_system_score_codex":0.00059691735,"about_ca_system_score_gemma":0.00051043084,"threshold_uncertainty_score":0.048087597},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34247634,0.004884756,0.62160397,0.0015649347,0.00009310107,0.00023043682,0.000626948,0.00095389015,0.027565656],"genre_scores_gemma":[0.915819,0.0010255575,0.07644429,0.00020225877,0.00008586027,0.00016768274,0.000613148,0.00036730806,0.005274963],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981219,0.0007420895,0.00006780638,0.00017900944,0.0006197612,0.0002693043],"domain_scores_gemma":[0.9674063,0.02882425,0.0009856876,0.0010066222,0.0012342617,0.00054284156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031181579,0.00046620614,0.001363084,0.0024796615,0.0008384466,0.0014717865,0.0022133433,0.0014120102,0.0071821604],"category_scores_gemma":[0.034355145,0.0006409947,0.00094418484,0.0020867675,0.0014468093,0.0028238425,0.002022168,0.0010456712,0.00061041483],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040646965,0.00012720992,0.003172997,0.0003070215,0.00007199606,0.00012592682,0.00017167795,0.8144604,0.0018987883,0.13795568,0.0043909587,0.036910895],"study_design_scores_gemma":[0.000017034667,0.000032086853,0.00030288688,0.0000202861,0.000011770549,0.000061861356,0.000031746797,0.97761494,0.0003355547,0.021182692,0.00038128268,0.000007842776],"about_ca_topic_score_codex":0.0021629918,"about_ca_topic_score_gemma":0.0020817826,"teacher_disagreement_score":0.0071821604,"about_ca_system_score_codex":0.0015590725,"about_ca_system_score_gemma":0.0011186599,"threshold_uncertainty_score":0.024026692},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0115041025,0.00020866639,0.98156273,0.00014715578,0.000043628123,0.00012625926,0.00019151391,0.0024523344,0.0037635053],"genre_scores_gemma":[0.13569352,0.00024921232,0.8578155,0.00007016665,0.00005145245,0.00028139507,0.001159822,0.000547509,0.004131398],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99895096,0.00012321028,0.00006384681,0.00016889228,0.00054591725,0.00014715265],"domain_scores_gemma":[0.9977957,0.0012060438,0.0001576403,0.0003715103,0.00036985832,0.00009937936],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055279606,0.0018918802,0.0014030059,0.0018440043,0.0011178188,0.002408716,0.0021858965,0.0012821608,0.014211379],"category_scores_gemma":[0.0046012113,0.00078794826,0.0012293983,0.0027743832,0.0010608167,0.0029279443,0.0028864737,0.0023224342,0.00400124],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005726293,0.00029428062,0.001420054,0.0004829671,0.00012380752,0.00022231374,0.0004810482,0.25934914,0.014555683,0.05405701,0.019609328,0.6488317],"study_design_scores_gemma":[0.000118451775,0.00007018016,0.00028172391,0.000019299121,0.000026950116,0.00007531896,0.00017039692,0.95039743,0.005695506,0.0386729,0.0044539087,0.000017889002],"about_ca_topic_score_codex":0.007122805,"about_ca_topic_score_gemma":0.0130620105,"teacher_disagreement_score":0.014211379,"about_ca_system_score_codex":0.001342828,"about_ca_system_score_gemma":0.0016056532,"threshold_uncertainty_score":0.047541797},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017241338,0.0002913176,0.92947835,0.0011411504,0.00073161116,0.0001109509,0.00030015426,0.0009989687,0.049706228],"genre_scores_gemma":[0.27751788,0.00044846622,0.6616796,0.0012300925,0.0003866345,0.00042004418,0.0009213854,0.0025441335,0.05485181],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984016,0.00030863928,0.00007974949,0.00033678504,0.0006836399,0.00018964658],"domain_scores_gemma":[0.99864644,0.00026903857,0.000058225414,0.00073636783,0.00017598893,0.00011400112],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001473371,0.001102712,0.001675137,0.0015995937,0.0020317924,0.001969148,0.002570654,0.001753397,0.03159206],"category_scores_gemma":[0.0050706295,0.0009760402,0.0017879835,0.0011801127,0.0022590228,0.005156912,0.00585865,0.006557281,0.0075424993],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023020497,0.000165384,0.00024741824,0.00032631625,0.000052490577,0.00017856406,0.00029298093,0.011873816,0.019209474,0.84440106,0.016338043,0.10668415],"study_design_scores_gemma":[0.00012325456,0.00019163641,0.0004568,0.00008568819,0.00006921706,0.0005325011,0.0001333147,0.054233473,0.017719237,0.84842855,0.07793057,0.00009574508],"about_ca_topic_score_codex":0.00039547487,"about_ca_topic_score_gemma":0.0008189291,"teacher_disagreement_score":0.03159206,"about_ca_system_score_codex":0.0006848717,"about_ca_system_score_gemma":0.0009854485,"threshold_uncertainty_score":0.10568601},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014131542,0.0003244206,0.9803718,0.00008566968,0.000035826608,0.000026832888,0.000041867614,0.00006840338,0.0049136505],"genre_scores_gemma":[0.5062688,0.00087635545,0.48614666,0.00009000066,0.00011574092,0.00014494007,0.0002571047,0.00015635364,0.005944101],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983045,0.00049742,0.000079264224,0.0003016283,0.0006893284,0.00012792175],"domain_scores_gemma":[0.9986738,0.00060251076,0.00017343416,0.00021345304,0.00025494388,0.000081934115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010789781,0.0003270105,0.0006555142,0.0015261278,0.00072240114,0.0017498145,0.00080832734,0.0006582506,0.0022988063],"category_scores_gemma":[0.005487434,0.0004365328,0.00055136497,0.0011258116,0.0025680587,0.0026936838,0.0024391075,0.000981472,0.00037135126],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022560691,0.0000054542024,0.0003520281,0.000058655314,0.0000090953545,0.000075324104,0.00022230088,0.042484708,0.0014679284,0.93239886,0.00040073085,0.022502253],"study_design_scores_gemma":[0.00001162424,0.000034335062,0.0003569344,0.000036170346,0.000007948641,0.00028042778,0.00022885187,0.21341938,0.0028939976,0.762158,0.020553736,0.000018590581],"about_ca_topic_score_codex":0.0012094871,"about_ca_topic_score_gemma":0.0009440864,"teacher_disagreement_score":0.0022988063,"about_ca_system_score_codex":0.0008592264,"about_ca_system_score_gemma":0.0004982753,"threshold_uncertainty_score":0.007690251},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0044120145,0.0002357215,0.99329823,0.00017214549,0.00004527674,0.00003288708,0.000049646835,0.0003660196,0.0013880968],"genre_scores_gemma":[0.16965142,0.00040598967,0.82405394,0.00015509425,0.00011839335,0.00018937509,0.00038105424,0.00046768755,0.0045770663],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968233,0.0009788979,0.00016301606,0.0009008119,0.0008856751,0.00024828714],"domain_scores_gemma":[0.9910353,0.0054614455,0.0006891794,0.0016670874,0.00087553554,0.00027148833],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028668274,0.0015328198,0.0021202343,0.001983822,0.0012403298,0.0024253193,0.0031007256,0.0029645576,0.006926735],"category_scores_gemma":[0.023683693,0.0015242309,0.0014236139,0.0024066314,0.0024873577,0.004439399,0.0044965586,0.0027487813,0.0017047526],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002720962,0.0001008027,0.00036739904,0.00023380425,0.00006556568,0.00007750748,0.00018039392,0.72743815,0.0025510686,0.09290715,0.005949541,0.16985652],"study_design_scores_gemma":[0.000030081934,0.000045653233,0.00008392383,0.000017844284,0.000015889513,0.000048625847,0.000040420568,0.91848963,0.0014017565,0.07801058,0.0018008515,0.00001478948],"about_ca_topic_score_codex":0.003975384,"about_ca_topic_score_gemma":0.0043553584,"teacher_disagreement_score":0.006926735,"about_ca_system_score_codex":0.00164841,"about_ca_system_score_gemma":0.0022108876,"threshold_uncertainty_score":0.02317226},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8788448,0.00048603935,0.10944428,0.00022253553,0.00018217432,0.000299161,0.0010483208,0.0027803245,0.00669242],"genre_scores_gemma":[0.8261971,0.0003380968,0.16685915,0.00008281004,0.00004297718,0.0002820528,0.0035224704,0.0006756039,0.0019997887],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971494,0.0006954419,0.00031092862,0.00061574084,0.00092686457,0.0003016519],"domain_scores_gemma":[0.9852046,0.008240857,0.0008984956,0.0031442633,0.0019043214,0.0006075294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028351936,0.0010613666,0.0009677062,0.0016427345,0.0007899763,0.0007177028,0.00216338,0.00121772,0.006454576],"category_scores_gemma":[0.01432826,0.00038916548,0.0008642417,0.0021768555,0.0011233215,0.0018753115,0.0017480364,0.0009417112,0.0013487475],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0034277327,0.003152922,0.013658113,0.0029561308,0.00042304557,0.0008208557,0.00093258603,0.43812123,0.19391955,0.018614182,0.008821506,0.3151522],"study_design_scores_gemma":[0.00036501235,0.005931551,0.0093071405,0.00015414557,0.00012951584,0.0010169912,0.00086235063,0.6342566,0.32641017,0.012898192,0.008545038,0.00012318269],"about_ca_topic_score_codex":0.00059010665,"about_ca_topic_score_gemma":0.0005494127,"teacher_disagreement_score":0.006454576,"about_ca_system_score_codex":0.00055808004,"about_ca_system_score_gemma":0.00042371044,"threshold_uncertainty_score":0.021592736},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1134458,0.0006752161,0.8777888,0.0006168354,0.000053262764,0.00017035031,0.00064995897,0.0006361864,0.005963617],"genre_scores_gemma":[0.61860853,0.00051171315,0.3750766,0.00014222099,0.000063723186,0.00019790712,0.0013366627,0.00014898236,0.0039136894],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994435,0.0001063277,0.00004295249,0.00020902342,0.00012621236,0.00007201508],"domain_scores_gemma":[0.998906,0.00057849183,0.00017383121,0.00012844957,0.00014170178,0.00007146937],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000596341,0.00064125995,0.0008498977,0.0010925455,0.0006686918,0.00089958357,0.0012105815,0.0010148068,0.0038789082],"category_scores_gemma":[0.0045948667,0.00041830412,0.00048489135,0.0012140295,0.00059621996,0.0031170808,0.001158425,0.00069052173,0.0007706768],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00062052277,0.00028631467,0.0049962965,0.0011948725,0.0001565957,0.00073135324,0.0006612061,0.5540157,0.03611775,0.056522783,0.012620513,0.33207607],"study_design_scores_gemma":[0.00002885156,0.00021927676,0.0011187685,0.00005204873,0.00004076983,0.00045540635,0.00018090823,0.9228627,0.007071323,0.06231585,0.0056274584,0.000026604408],"about_ca_topic_score_codex":0.00092979945,"about_ca_topic_score_gemma":0.0010926328,"teacher_disagreement_score":0.0038789082,"about_ca_system_score_codex":0.0005858913,"about_ca_system_score_gemma":0.00071403105,"threshold_uncertainty_score":0.012976289},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0041192244,0.0003152063,0.9891082,0.000104668674,0.00004737381,0.000056734294,0.00008653621,0.0015031988,0.0046587763],"genre_scores_gemma":[0.13848515,0.0006972564,0.842117,0.00016220528,0.00010807613,0.00021947545,0.0006613495,0.0005540716,0.016995328],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989385,0.0001493144,0.00005516461,0.00025733575,0.00046789992,0.00013190175],"domain_scores_gemma":[0.9980101,0.00048197366,0.00017146165,0.0009735986,0.0002990829,0.000063849126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086127355,0.0012662774,0.0013528952,0.0011990698,0.00078733166,0.0021260087,0.0028346775,0.0014968701,0.024030862],"category_scores_gemma":[0.0033327292,0.00076122896,0.0010390823,0.0015915979,0.0009767774,0.004544103,0.0029926866,0.001428039,0.0064417976],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032854278,0.0001406944,0.0009798855,0.00042680276,0.0001034063,0.0001848566,0.00021458388,0.19243558,0.010366723,0.16753443,0.013741653,0.6135428],"study_design_scores_gemma":[0.00007407144,0.00031885982,0.0006150629,0.000069369,0.000050461782,0.00053890457,0.000092826594,0.81398606,0.017636549,0.12183095,0.04474522,0.00004159932],"about_ca_topic_score_codex":0.0011447154,"about_ca_topic_score_gemma":0.0016527441,"teacher_disagreement_score":0.024030862,"about_ca_system_score_codex":0.0009588417,"about_ca_system_score_gemma":0.00072960416,"threshold_uncertainty_score":0.08039123},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.820177,0.0004495315,0.17481966,0.00015900377,0.000023290924,0.0000370017,0.0004444778,0.00096042105,0.002929708],"genre_scores_gemma":[0.89513373,0.00018876982,0.102715306,0.000020240024,0.000011954342,0.000027603666,0.00059138995,0.00017667061,0.0011342943],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996642,0.00006789839,0.000022327056,0.00007306601,0.00012535893,0.000047190977],"domain_scores_gemma":[0.9981614,0.00128668,0.00016370817,0.00011335754,0.00014817316,0.00012670926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005595618,0.0006774379,0.00079705496,0.002038137,0.00046828165,0.001178919,0.0010232847,0.0008816889,0.0020765786],"category_scores_gemma":[0.0059717586,0.0005417665,0.00045905903,0.0013658616,0.0006316837,0.0020690972,0.00089108094,0.000501873,0.0002888283],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00095147,0.00014570795,0.015686518,0.00022977733,0.00011290848,0.00025538835,0.00034858365,0.7828592,0.009414848,0.02165491,0.0018924379,0.16644825],"study_design_scores_gemma":[0.000014422117,0.000032041506,0.0012034792,0.0000051339503,0.000009168873,0.000056430745,0.000067491295,0.98901725,0.0017132087,0.007556044,0.00031647942,0.000008861649],"about_ca_topic_score_codex":0.005867352,"about_ca_topic_score_gemma":0.010878064,"teacher_disagreement_score":0.005867352,"about_ca_system_score_codex":0.00061024615,"about_ca_system_score_gemma":0.00046481457,"threshold_uncertainty_score":0.011666417},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37381986,0.0008596933,0.4562883,0.0025297448,0.00029217976,0.00014290433,0.0024109073,0.00044336353,0.163213],"genre_scores_gemma":[0.81879914,0.0014029691,0.1232218,0.00065511506,0.00013405418,0.000116408424,0.002664344,0.00027707883,0.05272917],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998629,0.00002637861,0.000004571499,0.00003997256,0.000041008698,0.00002522428],"domain_scores_gemma":[0.9996208,0.00009597821,0.000068526824,0.000064565655,0.000078422665,0.000071756695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012678998,0.00034046473,0.0003353989,0.0008603373,0.0007708725,0.0012342476,0.00078982423,0.0005452865,0.008933799],"category_scores_gemma":[0.0008883414,0.00020083519,0.00020349525,0.0007888223,0.0007295593,0.0015292744,0.00088778674,0.0011041763,0.0013022461],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014670129,0.000033816224,0.000994982,0.000090339454,0.000012797302,0.00019051283,0.00015712011,0.009227749,0.0042988164,0.92584,0.007995488,0.05101169],"study_design_scores_gemma":[0.00003212884,0.000032155294,0.0010200952,0.000027023323,0.000017899163,0.00034597176,0.0002260569,0.029868867,0.002055184,0.92090595,0.04545427,0.000014416328],"about_ca_topic_score_codex":0.0019735722,"about_ca_topic_score_gemma":0.0018561373,"teacher_disagreement_score":0.008933799,"about_ca_system_score_codex":0.00051631907,"about_ca_system_score_gemma":0.00039257866,"threshold_uncertainty_score":0.029886603},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002288877,0.00009031527,0.99623483,0.00006532719,0.000012855837,0.000039051003,0.000021363683,0.00016171995,0.0010856345],"genre_scores_gemma":[0.114991926,0.0002705462,0.8810919,0.0001412618,0.00005148909,0.000418408,0.000244406,0.00029540935,0.0024946593],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986817,0.0005037094,0.000045968776,0.00017355898,0.0004704622,0.0001245947],"domain_scores_gemma":[0.99726176,0.0017505583,0.0002784649,0.00020276321,0.00039703958,0.0001093643],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028104912,0.0018728131,0.0015322274,0.0014312358,0.0005349954,0.0018229123,0.0020577388,0.0018054827,0.0041475017],"category_scores_gemma":[0.006285999,0.0010291012,0.0010862568,0.0013087759,0.0017035024,0.0020036022,0.0018726278,0.0031368807,0.0012502451],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022971802,0.00012504199,0.0004926555,0.00021441007,0.000065008295,0.00011118156,0.0001561337,0.7799063,0.0029747786,0.12510647,0.0031977778,0.08742049],"study_design_scores_gemma":[0.000022642333,0.00003526109,0.000026478287,0.000012599076,0.000005685552,0.000018998364,0.000009859436,0.9802684,0.0007003126,0.017792642,0.0011012454,0.0000058472806],"about_ca_topic_score_codex":0.002214312,"about_ca_topic_score_gemma":0.0017774395,"teacher_disagreement_score":0.0041475017,"about_ca_system_score_codex":0.001322955,"about_ca_system_score_gemma":0.0014838807,"threshold_uncertainty_score":0.014863491},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0060862415,0.00013929364,0.9920345,0.0000663906,0.00003913838,0.00005425427,0.00006011784,0.00074477796,0.00077529],"genre_scores_gemma":[0.2171212,0.00014960741,0.7786116,0.00018618695,0.00007193751,0.0002715776,0.00058291317,0.00042718515,0.0025778217],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99614835,0.0011292117,0.0003262533,0.0005813779,0.0015658321,0.00024896662],"domain_scores_gemma":[0.98663944,0.009012174,0.00053627323,0.0013892517,0.0021879917,0.00023480674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048262896,0.0012286193,0.0022166257,0.001912105,0.0014560762,0.0029339544,0.003945647,0.002496717,0.006467793],"category_scores_gemma":[0.02609133,0.0010119472,0.0010219285,0.002036292,0.0013716728,0.003007807,0.0040721195,0.003074788,0.001606115],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00061266473,0.00022312919,0.0013694165,0.00024393348,0.00009033246,0.00009443065,0.00023954114,0.47530156,0.0042227553,0.041285995,0.004565534,0.47175068],"study_design_scores_gemma":[0.000021344102,0.000029012504,0.00012291859,0.000013990529,0.000011899601,0.000025920175,0.000018357805,0.97590566,0.0026174495,0.020604387,0.0006186398,0.000010297324],"about_ca_topic_score_codex":0.0039772536,"about_ca_topic_score_gemma":0.0047087967,"teacher_disagreement_score":0.006467793,"about_ca_system_score_codex":0.0018815321,"about_ca_system_score_gemma":0.0018793644,"threshold_uncertainty_score":0.025524199},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8092224,0.0005101474,0.041569237,0.0014972605,0.0004278773,0.00006175578,0.00087927026,0.00055001455,0.14528207],"genre_scores_gemma":[0.9717727,0.000276639,0.0126165375,0.00022793781,0.00007881558,0.000055836565,0.0005371622,0.0002438106,0.014190688],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99938226,0.00011439061,0.00002325902,0.00016477559,0.0001598608,0.0001554812],"domain_scores_gemma":[0.99807405,0.00092168816,0.00031891093,0.00020353522,0.00015118184,0.0003306448],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080393226,0.0005392555,0.0003634835,0.0026590114,0.001899944,0.0029764345,0.0009145527,0.0014340939,0.012864219],"category_scores_gemma":[0.004166713,0.00036585395,0.00038142715,0.0018629745,0.0016053941,0.0021998,0.0011856441,0.0014109147,0.0013180852],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004695506,0.00014590652,0.0075289914,0.0001548805,0.000046235666,0.00092749804,0.00059495267,0.016245306,0.01916803,0.87786347,0.017045408,0.05980978],"study_design_scores_gemma":[0.000047024772,0.000103507446,0.008934655,0.000091794034,0.000059233233,0.0020800754,0.00059478654,0.07263006,0.01803857,0.86961263,0.027730305,0.00007740684],"about_ca_topic_score_codex":0.001087749,"about_ca_topic_score_gemma":0.0015347784,"teacher_disagreement_score":0.012864219,"about_ca_system_score_codex":0.0012948329,"about_ca_system_score_gemma":0.00058947393,"threshold_uncertainty_score":0.04303515},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34804246,0.00302287,0.57018536,0.011862389,0.0005035655,0.00021220691,0.0015700327,0.0004391588,0.06416206],"genre_scores_gemma":[0.90626,0.00090468995,0.06643485,0.00045249943,0.00050827675,0.00021775503,0.0009645251,0.00018152,0.024075944],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99832934,0.0006102405,0.00007969498,0.0003179365,0.00035517427,0.00030759882],"domain_scores_gemma":[0.99070346,0.007176501,0.00079294096,0.00043393575,0.00034401947,0.0005491547],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001691775,0.0011172114,0.002122756,0.0014827374,0.0013031723,0.003296224,0.002530507,0.0048225513,0.017210132],"category_scores_gemma":[0.016008329,0.0007842313,0.0009790428,0.001855777,0.001923701,0.0044412985,0.00378697,0.0034582054,0.0009170321],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008250528,0.00030405828,0.0022010917,0.0006345071,0.00013365565,0.0022108469,0.000341417,0.30493915,0.0019721747,0.6027959,0.027390828,0.056251287],"study_design_scores_gemma":[0.00016179586,0.00008761449,0.00062180765,0.0000552397,0.00002898263,0.0007069932,0.00023073595,0.42032006,0.0007689849,0.5725759,0.0044011497,0.000040627656],"about_ca_topic_score_codex":0.0015361886,"about_ca_topic_score_gemma":0.001251669,"teacher_disagreement_score":0.017210132,"about_ca_system_score_codex":0.0010203486,"about_ca_system_score_gemma":0.0005929857,"threshold_uncertainty_score":0.057573617},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23264691,0.00052011124,0.72215647,0.00069629645,0.00040087497,0.0001035916,0.00063889596,0.0015271532,0.041309703],"genre_scores_gemma":[0.7077319,0.00047112803,0.26388246,0.0003453368,0.00018777854,0.00010458899,0.0010111608,0.00066084473,0.025604837],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986904,0.00022259164,0.000085016465,0.00028351825,0.00050192524,0.0002165366],"domain_scores_gemma":[0.99604475,0.00126036,0.00029958307,0.0017964658,0.0003882974,0.00021059896],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008692461,0.0006827644,0.0008243875,0.0016082198,0.0014766447,0.0019638417,0.0011894476,0.0012941473,0.009702491],"category_scores_gemma":[0.007850242,0.00060364866,0.00084849057,0.0008455366,0.0022958617,0.0036836434,0.004107514,0.002250515,0.002180714],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00053689396,0.00006184308,0.0017761311,0.0003047356,0.000040457162,0.0004930073,0.0008550202,0.0280066,0.016422436,0.83906066,0.00981196,0.102630265],"study_design_scores_gemma":[0.00004362068,0.00011714461,0.000542594,0.00009558848,0.00003416497,0.0005100559,0.00034295826,0.098251544,0.029358173,0.84218544,0.028461644,0.00005711089],"about_ca_topic_score_codex":0.0007289936,"about_ca_topic_score_gemma":0.0009242337,"teacher_disagreement_score":0.009702491,"about_ca_system_score_codex":0.0006757932,"about_ca_system_score_gemma":0.00052799226,"threshold_uncertainty_score":0.032458127},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.093832314,0.00082465104,0.8851955,0.00096401636,0.00010478974,0.0004011672,0.0019501246,0.009039912,0.0076876124],"genre_scores_gemma":[0.34068036,0.00025985332,0.6515525,0.00015350644,0.000050838804,0.00031304773,0.0033738825,0.00042349313,0.003192487],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99882656,0.00013879899,0.000090501366,0.0004191295,0.00023789558,0.00028714794],"domain_scores_gemma":[0.9968526,0.0018823633,0.0003457606,0.00051645964,0.00021156282,0.00019124303],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084235135,0.0015916813,0.0015754843,0.001864651,0.0011939058,0.0020492168,0.0029284733,0.0016616343,0.007881769],"category_scores_gemma":[0.0049053454,0.0008741415,0.001589956,0.0023501015,0.0012413445,0.0037406462,0.0025831575,0.0014836751,0.0014829132],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011772963,0.00027578848,0.0040589483,0.0008065925,0.00019727937,0.00031167862,0.00046605666,0.6142739,0.011988252,0.026797108,0.020238535,0.31940866],"study_design_scores_gemma":[0.00021056796,0.00013771298,0.0007030982,0.000030737676,0.00004831447,0.00016329072,0.0002022565,0.9557741,0.0030693333,0.036633957,0.0029974345,0.000029045676],"about_ca_topic_score_codex":0.0067598317,"about_ca_topic_score_gemma":0.01014617,"teacher_disagreement_score":0.007881769,"about_ca_system_score_codex":0.0020233903,"about_ca_system_score_gemma":0.0026632927,"threshold_uncertainty_score":0.026367128},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34687942,0.0005321301,0.58951044,0.00075940276,0.0002048104,0.00018799173,0.0010595821,0.0004976923,0.060368504],"genre_scores_gemma":[0.83771765,0.0006558614,0.13804537,0.00024328139,0.00015377448,0.00027280283,0.0023530761,0.0004402943,0.020117985],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99953365,0.00006746124,0.000023229335,0.00009188642,0.00020896115,0.00007478852],"domain_scores_gemma":[0.99935657,0.00018177213,0.00008734282,0.00012549663,0.00014246166,0.00010637576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024306387,0.0005668957,0.0009997693,0.0010738382,0.0010001813,0.0017245035,0.001457118,0.000822614,0.009060204],"category_scores_gemma":[0.0018087487,0.0006147704,0.0008361791,0.00097087334,0.00096309633,0.0011956624,0.0014079195,0.002106989,0.00083206204],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021465046,0.00015876644,0.0011766687,0.00019390682,0.00004670071,0.00016392734,0.00033533966,0.07898093,0.012638267,0.81888723,0.010474639,0.076728955],"study_design_scores_gemma":[0.00008694711,0.00013453834,0.001031105,0.0000730132,0.000030129437,0.00030231717,0.0003089303,0.2831583,0.002812059,0.69491065,0.017122785,0.00002926624],"about_ca_topic_score_codex":0.00091659575,"about_ca_topic_score_gemma":0.0013669957,"teacher_disagreement_score":0.009060204,"about_ca_system_score_codex":0.0005912489,"about_ca_system_score_gemma":0.00046172997,"threshold_uncertainty_score":0.03030938},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046664506,0.00026803752,0.9034487,0.0005618889,0.00024656675,0.0002426094,0.0014663571,0.0053150067,0.041786347],"genre_scores_gemma":[0.35131454,0.0008755601,0.61771995,0.00014852708,0.00006549358,0.00026514352,0.0030342985,0.0021709148,0.024405496],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99965,0.00008344608,0.000013342437,0.00005148731,0.0001620889,0.00003966364],"domain_scores_gemma":[0.9994067,0.00027503332,0.000033641703,0.00011221337,0.0001180054,0.000054517423],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032311073,0.0009613649,0.0005353903,0.00074651965,0.0005016424,0.0008683582,0.00088481914,0.0009784428,0.023862515],"category_scores_gemma":[0.0022857026,0.0005091281,0.00065304677,0.0010461091,0.0005004358,0.0009735902,0.001164586,0.0009843413,0.0019673326],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033265873,0.00008367782,0.0006690968,0.00034514916,0.000058309055,0.0005990896,0.00047797445,0.6503445,0.037867945,0.10084527,0.03369563,0.17468072],"study_design_scores_gemma":[0.00009010259,0.0000525441,0.0004002206,0.00005844336,0.000014489645,0.0001697983,0.00007517864,0.897373,0.009017417,0.03820799,0.054508675,0.000032198877],"about_ca_topic_score_codex":0.0027039484,"about_ca_topic_score_gemma":0.00404708,"teacher_disagreement_score":0.023862515,"about_ca_system_score_codex":0.00061556516,"about_ca_system_score_gemma":0.00042489957,"threshold_uncertainty_score":0.079828024},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13258258,0.0004368507,0.8558871,0.00030917293,0.000044625787,0.00013139911,0.00022283739,0.00029741376,0.010087905],"genre_scores_gemma":[0.620282,0.0005962661,0.37087372,0.000092609305,0.00007185706,0.00030864865,0.00081681414,0.00016607741,0.0067920554],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99798065,0.00045279888,0.00014174481,0.0004147604,0.00065916986,0.00035095928],"domain_scores_gemma":[0.99387133,0.0039751413,0.0008587882,0.00046154924,0.0003221322,0.00051106483],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009932994,0.0011101791,0.0011940594,0.0023564636,0.0020865004,0.002602486,0.002021127,0.00193892,0.004082965],"category_scores_gemma":[0.009636064,0.0010849424,0.0010191017,0.0021737278,0.0034278184,0.0040334202,0.0073119304,0.0018895558,0.0009358285],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041119842,0.00010132023,0.0018859063,0.00026752648,0.00007418092,0.0012777789,0.0010486244,0.51266164,0.0051790657,0.43122405,0.0014138465,0.044454835],"study_design_scores_gemma":[0.00008549142,0.00012134325,0.0003990754,0.000067759946,0.00003217012,0.00053712574,0.00060267147,0.5034417,0.004673328,0.47981393,0.010170905,0.000054628264],"about_ca_topic_score_codex":0.0014289682,"about_ca_topic_score_gemma":0.001142023,"teacher_disagreement_score":0.004082965,"about_ca_system_score_codex":0.0010237996,"about_ca_system_score_gemma":0.0006614976,"threshold_uncertainty_score":0.013658941},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047409493,0.0007892401,0.94155383,0.00063896325,0.00012119213,0.00031802294,0.0010179696,0.0040525985,0.0040987534],"genre_scores_gemma":[0.31878692,0.00063368503,0.6693311,0.00021188566,0.000111202346,0.0005592968,0.004171025,0.0009994534,0.0051954216],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960044,0.0005421607,0.00030938408,0.0008041966,0.0018488419,0.00049106556],"domain_scores_gemma":[0.9927349,0.0040727947,0.00035026736,0.0017879086,0.00079644227,0.00025759646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019982802,0.0017929537,0.0034443801,0.0023846738,0.0016006823,0.004326002,0.0054691243,0.002596575,0.009905683],"category_scores_gemma":[0.014294922,0.0013257614,0.001733094,0.0067160036,0.0015350751,0.010484677,0.0066553876,0.0028973483,0.0020806855],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001402192,0.00041359538,0.0020354714,0.0008027637,0.00019583649,0.00019509511,0.0006768399,0.47107136,0.008081797,0.09406059,0.022377657,0.3986867],"study_design_scores_gemma":[0.000095137904,0.000054433036,0.0001465032,0.000018073597,0.000025499505,0.000060909282,0.00017722884,0.9195784,0.0018140011,0.07576524,0.0022482835,0.000016368718],"about_ca_topic_score_codex":0.00740019,"about_ca_topic_score_gemma":0.009669504,"teacher_disagreement_score":0.009905683,"about_ca_system_score_codex":0.0025663332,"about_ca_system_score_gemma":0.0020796026,"threshold_uncertainty_score":0.033137858},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.76634794,0.0004988554,0.18362752,0.00020082323,0.00009382722,0.000102185506,0.0004438573,0.00039001094,0.048294846],"genre_scores_gemma":[0.96325064,0.0001729232,0.029077163,0.00005370251,0.00008609417,0.00017335449,0.00078448537,0.00014808886,0.0062535503],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99940515,0.000055482797,0.00005787649,0.00011121313,0.0002258752,0.00014433917],"domain_scores_gemma":[0.99849606,0.00052753923,0.0003282314,0.00016123506,0.0002606294,0.00022622698],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004133914,0.00052992173,0.0005396069,0.002546214,0.0012761184,0.0014878489,0.0005296481,0.0003419741,0.0056744744],"category_scores_gemma":[0.0027552317,0.00040257847,0.0006965472,0.00056101655,0.0020061715,0.0016034753,0.0017712,0.00086645974,0.00047625453],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015864904,0.000065513545,0.0031333182,0.000119616474,0.000027478722,0.00042225796,0.0006212294,0.015011396,0.019036038,0.93829525,0.0024583295,0.020650934],"study_design_scores_gemma":[0.00005559673,0.000119039,0.003665686,0.00006932877,0.000030920553,0.00035174997,0.00033087246,0.07328088,0.017504422,0.8955442,0.008976728,0.00007057067],"about_ca_topic_score_codex":0.00074615196,"about_ca_topic_score_gemma":0.0008660598,"teacher_disagreement_score":0.0056744744,"about_ca_system_score_codex":0.00096102373,"about_ca_system_score_gemma":0.0006468987,"threshold_uncertainty_score":0.018983006},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023155871,0.00007132782,0.9957826,0.00007504133,0.00005681724,0.000030684383,0.000019511344,0.00022242962,0.0014261184],"genre_scores_gemma":[0.072380036,0.0004550928,0.92054063,0.00011482376,0.00007534887,0.00013317387,0.00014625341,0.00030497357,0.0058496487],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99945635,0.00010054015,0.00002255713,0.000082798426,0.00030949764,0.000028237395],"domain_scores_gemma":[0.9991678,0.00026946183,0.00010053211,0.00025123166,0.00018428067,0.000026764712],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007480811,0.0005876279,0.00043109778,0.00074994296,0.0005418817,0.0012322624,0.0011126365,0.0008821549,0.0029079348],"category_scores_gemma":[0.002444433,0.0004886809,0.00069528015,0.00062710437,0.0008171748,0.0012160422,0.0012332969,0.0013633975,0.0012537183],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011009642,0.00006705739,0.0014942522,0.00034376618,0.00005994774,0.0003419678,0.0005330401,0.3399979,0.10262157,0.15932041,0.009264065,0.38584587],"study_design_scores_gemma":[0.000019034906,0.00005133796,0.00035895756,0.000041812284,0.000016471091,0.0002897823,0.000053563657,0.9209181,0.020752266,0.024192162,0.0332748,0.00003168821],"about_ca_topic_score_codex":0.001069321,"about_ca_topic_score_gemma":0.0011766764,"teacher_disagreement_score":0.0029079348,"about_ca_system_score_codex":0.00035533865,"about_ca_system_score_gemma":0.00065539865,"threshold_uncertainty_score":0.0097280145},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028285053,0.00030118568,0.96208304,0.00030590972,0.000064543034,0.00016595864,0.00039155263,0.003826248,0.0045765643],"genre_scores_gemma":[0.2608377,0.0002453043,0.7315397,0.0001376929,0.00006819049,0.00035445523,0.0018433316,0.00073395396,0.0042396164],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972568,0.0005185186,0.0002056893,0.0005791859,0.00095084007,0.0004890358],"domain_scores_gemma":[0.9966943,0.0012484408,0.00028844207,0.0012747579,0.0003322824,0.00016161997],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000880587,0.0012477273,0.0019813888,0.0010951338,0.0018275514,0.0021062023,0.004677722,0.0016137902,0.011030012],"category_scores_gemma":[0.0061947657,0.0009592843,0.0014807133,0.0028516555,0.0012655599,0.0041114166,0.004398417,0.0019241569,0.0028280055],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020027093,0.0007360796,0.0030991617,0.0008832222,0.0001582521,0.00028083083,0.00061417994,0.31875032,0.016954564,0.10716097,0.020417642,0.52894205],"study_design_scores_gemma":[0.00029445245,0.00022341813,0.00056060334,0.00002988047,0.000064333006,0.00026027448,0.00019383304,0.88390356,0.025988813,0.07757465,0.010844233,0.0000619283],"about_ca_topic_score_codex":0.0032594146,"about_ca_topic_score_gemma":0.0062800623,"teacher_disagreement_score":0.011030012,"about_ca_system_score_codex":0.0020568636,"about_ca_system_score_gemma":0.0022521955,"threshold_uncertainty_score":0.03689909},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010204669,0.000028759883,0.99818075,0.000023308994,0.000021775824,0.000017048444,0.000006697873,0.00016281186,0.0005384598],"genre_scores_gemma":[0.03462947,0.00007033177,0.96358216,0.00003894983,0.000021191203,0.00008633746,0.000066595574,0.00013527731,0.001369641],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995079,0.00011036122,0.000025654748,0.000109781875,0.00020360264,0.00004271025],"domain_scores_gemma":[0.9993711,0.00026570383,0.00008071862,0.00012731501,0.00012230496,0.000032732423],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00097032916,0.0009274251,0.0010560161,0.00070947706,0.0005992197,0.0007276478,0.0013557535,0.0013924555,0.0053965813],"category_scores_gemma":[0.0025676994,0.00045291733,0.00076249155,0.00045212533,0.0009772521,0.001116832,0.0019046448,0.0015111666,0.0016926506],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014287274,0.00006675403,0.0005130711,0.00025981132,0.00007097057,0.00019331933,0.00022068583,0.48375773,0.020651406,0.1284325,0.0044309474,0.36125994],"study_design_scores_gemma":[0.000037990838,0.00011643992,0.00011835718,0.00002086369,0.000015427968,0.00020491854,0.000039921728,0.9622282,0.0064948103,0.02175299,0.008931007,0.000039092345],"about_ca_topic_score_codex":0.00064141786,"about_ca_topic_score_gemma":0.00081931544,"teacher_disagreement_score":0.0053965813,"about_ca_system_score_codex":0.00029141977,"about_ca_system_score_gemma":0.0008844799,"threshold_uncertainty_score":0.018053353},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0071982886,0.00009647994,0.9891101,0.00014598091,0.000084374384,0.000030280054,0.00019857814,0.00055374036,0.0025822602],"genre_scores_gemma":[0.32239908,0.0005330669,0.66367304,0.00021505135,0.00010090622,0.0002614817,0.0013852494,0.00068112253,0.0107510565],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99902,0.00015557061,0.000079300604,0.00012555288,0.00054310483,0.00007656741],"domain_scores_gemma":[0.9988984,0.00034759182,0.00010173133,0.00035334736,0.00022594226,0.00007307885],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078185985,0.0005830884,0.00086562254,0.0010120046,0.00063831237,0.0015250136,0.0018613782,0.0010062697,0.005329932],"category_scores_gemma":[0.0041330317,0.000547764,0.0010624152,0.0011328242,0.0010738745,0.0020762614,0.003274053,0.0013685576,0.0015940511],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021350771,0.00004374437,0.0013355244,0.00028695058,0.000036234276,0.00018485448,0.0002782783,0.6151568,0.012312809,0.27156612,0.006578655,0.09200661],"study_design_scores_gemma":[0.000027166121,0.000022358307,0.00010254274,0.000016977312,0.0000045793713,0.00007712788,0.000029975066,0.9307669,0.0028221882,0.0564831,0.009632623,0.000014554364],"about_ca_topic_score_codex":0.0022334887,"about_ca_topic_score_gemma":0.002757752,"teacher_disagreement_score":0.005329932,"about_ca_system_score_codex":0.00072884245,"about_ca_system_score_gemma":0.0006886507,"threshold_uncertainty_score":0.017830431},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07289375,0.0026502635,0.911741,0.002515013,0.0010202467,0.000077388104,0.00030779737,0.0013017079,0.007492895],"genre_scores_gemma":[0.68718016,0.0012510201,0.2927375,0.0005329534,0.0004812836,0.0001391965,0.0006670647,0.0014973657,0.015513537],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99291116,0.0030835443,0.00040617283,0.0011312023,0.0021179444,0.00034995892],"domain_scores_gemma":[0.90269274,0.07759663,0.002345257,0.009445578,0.0070859846,0.00083387067],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008141638,0.0012831851,0.0017097081,0.0028839672,0.0012726706,0.002634772,0.0024712263,0.0030611008,0.006601807],"category_scores_gemma":[0.09654808,0.0010485452,0.00073641096,0.0031750859,0.0029809421,0.0065845763,0.0044570905,0.0036617406,0.0016615213],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011536987,0.00015994172,0.0060668923,0.0004085083,0.00014931358,0.00016431106,0.00036754718,0.5889947,0.00243345,0.16737139,0.010110774,0.22261949],"study_design_scores_gemma":[0.000035988236,0.0000654817,0.0006415178,0.000059169462,0.000031889347,0.00007744675,0.00007447491,0.8653046,0.003686737,0.12773788,0.0022652599,0.00001952445],"about_ca_topic_score_codex":0.004723164,"about_ca_topic_score_gemma":0.0044529242,"teacher_disagreement_score":0.008141638,"about_ca_system_score_codex":0.0018734613,"about_ca_system_score_gemma":0.0014009952,"threshold_uncertainty_score":0.04305762},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2395965,0.0009274994,0.4449154,0.0012675002,0.0010668939,0.00017695138,0.0011048851,0.0007139416,0.31023046],"genre_scores_gemma":[0.7432486,0.00079434144,0.08713921,0.00042099578,0.00034034252,0.00019932383,0.0019447916,0.0006642769,0.16524813],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996513,0.00004285732,0.000023210123,0.000082726,0.00015739171,0.000042389736],"domain_scores_gemma":[0.999405,0.00013726114,0.000073320654,0.000106951484,0.00017463855,0.000102864054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033955535,0.0005833544,0.0007245871,0.0017944367,0.0016610364,0.0018637344,0.00085822487,0.00093574496,0.021910658],"category_scores_gemma":[0.0020204536,0.0004502617,0.0007041311,0.000897294,0.0012713918,0.0017242942,0.0022785282,0.0019301203,0.0037963577],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009089487,0.000023161783,0.0004467509,0.000091927286,0.000017148936,0.00014064077,0.0002594221,0.0055384454,0.002904967,0.948843,0.007631186,0.034012545],"study_design_scores_gemma":[0.000038840717,0.000093408555,0.00072081655,0.00004659637,0.000015652564,0.00044549047,0.0003114064,0.03374773,0.004537181,0.9087292,0.05128896,0.000024765892],"about_ca_topic_score_codex":0.00051627745,"about_ca_topic_score_gemma":0.0005862578,"teacher_disagreement_score":0.021910658,"about_ca_system_score_codex":0.00076316285,"about_ca_system_score_gemma":0.00033287678,"threshold_uncertainty_score":0.073298514},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0066278973,0.00016237418,0.989908,0.00011066392,0.000043746622,0.000026559946,0.000047724225,0.00022081226,0.0028522492],"genre_scores_gemma":[0.17179538,0.00037737237,0.82035774,0.00011746529,0.00010967969,0.00019766932,0.00035712667,0.00044945395,0.006238119],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99917233,0.0002180277,0.00003795903,0.00012470728,0.00034230345,0.000104680184],"domain_scores_gemma":[0.9978662,0.0012203668,0.00012793316,0.00029206043,0.0003535009,0.00013996758],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011806784,0.0007805716,0.0012449903,0.0013347497,0.0010120985,0.0018576132,0.0016119297,0.00084974634,0.0046474654],"category_scores_gemma":[0.006620229,0.000653406,0.0013085615,0.0015717766,0.0015642085,0.0029670268,0.0031607416,0.0038852587,0.0009390506],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032026073,0.00020245994,0.001949648,0.00023442619,0.000048783448,0.000039559087,0.00025917232,0.21919549,0.0041678413,0.42372122,0.011338036,0.3385232],"study_design_scores_gemma":[0.000029048759,0.000036728776,0.00021332156,0.000020844505,0.000015108345,0.000032560813,0.000036143763,0.83429104,0.0018194119,0.15956339,0.003926296,0.000016052993],"about_ca_topic_score_codex":0.002522259,"about_ca_topic_score_gemma":0.0040477775,"teacher_disagreement_score":0.0046474654,"about_ca_system_score_codex":0.0010768889,"about_ca_system_score_gemma":0.0017025312,"threshold_uncertainty_score":0.015547335},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00784892,0.00080006354,0.9852704,0.00047340937,0.00014359911,0.00010582772,0.0002587551,0.00046394693,0.004635078],"genre_scores_gemma":[0.18929641,0.0012053078,0.79949623,0.0003424931,0.0003349085,0.0006854766,0.0013212946,0.0006345683,0.006683321],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99699044,0.001261808,0.00015861727,0.00044356403,0.00087317656,0.0002723231],"domain_scores_gemma":[0.98627937,0.009956959,0.00049892685,0.0017251737,0.0010185672,0.00052092085],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003918263,0.0024158198,0.0032674058,0.0029006263,0.0014394384,0.0038867965,0.0074747102,0.0032104878,0.009539285],"category_scores_gemma":[0.029486122,0.0019594426,0.0026289145,0.005033333,0.0021614549,0.0070899474,0.0062741316,0.005702548,0.0021850816],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00054613,0.00023197613,0.00076137116,0.00059083797,0.000160456,0.00008249648,0.00030745048,0.6392685,0.0009997018,0.23235331,0.013125213,0.11157256],"study_design_scores_gemma":[0.00005198746,0.000027332055,0.00008143929,0.000032978747,0.000021537715,0.000033357246,0.00003476977,0.8704271,0.00037454432,0.12747777,0.0014251794,0.000011982926],"about_ca_topic_score_codex":0.0028518303,"about_ca_topic_score_gemma":0.0033513072,"teacher_disagreement_score":0.009539285,"about_ca_system_score_codex":0.003433702,"about_ca_system_score_gemma":0.0023299793,"threshold_uncertainty_score":0.03191203},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026308164,0.0003013122,0.94269973,0.0004866199,0.000101142105,0.00008210664,0.00059386034,0.0007165797,0.028710483],"genre_scores_gemma":[0.38909653,0.0010552458,0.568699,0.00050003524,0.00032758742,0.0003719882,0.0035057878,0.0010552297,0.035388656],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99889,0.00022801557,0.00008072787,0.00020452111,0.00045307836,0.00014367698],"domain_scores_gemma":[0.99769574,0.0009955071,0.00013957714,0.00061573816,0.0004036958,0.00014971857],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007802255,0.00075218646,0.0012590098,0.0018292345,0.00111975,0.0035402772,0.002288464,0.00091553567,0.012280712],"category_scores_gemma":[0.004736769,0.0007607859,0.0014842439,0.0025167188,0.0012639469,0.0049907537,0.0036073509,0.0040393206,0.0028370167],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006783483,0.000103629776,0.00058212556,0.00013167631,0.000019304993,0.000060910166,0.00018999545,0.013245416,0.0019164499,0.88195646,0.008274723,0.09345144],"study_design_scores_gemma":[0.000011553336,0.000018354178,0.00017290376,0.000024069415,0.000011996487,0.00008256769,0.000058565456,0.06667483,0.0012696448,0.9240833,0.007579624,0.000012444417],"about_ca_topic_score_codex":0.0013628853,"about_ca_topic_score_gemma":0.0020672537,"teacher_disagreement_score":0.012280712,"about_ca_system_score_codex":0.0012411997,"about_ca_system_score_gemma":0.00074978394,"threshold_uncertainty_score":0.041083038},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013312555,0.0004490124,0.9759261,0.00082794524,0.0001579658,0.00023074305,0.001582467,0.0053935675,0.0021196245],"genre_scores_gemma":[0.18636794,0.00039972778,0.80099505,0.0005174698,0.00023962966,0.0011539492,0.0055866563,0.0007232495,0.0040163286],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99658406,0.00043736552,0.00040493198,0.00069956627,0.0015299792,0.0003441411],"domain_scores_gemma":[0.992374,0.001730205,0.00066247117,0.004009815,0.0008192474,0.0004042596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016334389,0.00094653445,0.0024415208,0.0020026583,0.0021283308,0.0028053802,0.005902851,0.0020018704,0.007106629],"category_scores_gemma":[0.010802305,0.0012621075,0.0015475309,0.0047343643,0.0018567152,0.008107661,0.0077090147,0.0028648353,0.0031817004],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017829165,0.0008646397,0.003631746,0.00063851767,0.00017425856,0.0004197653,0.00060648617,0.18988544,0.027833376,0.20856,0.060627256,0.5049755],"study_design_scores_gemma":[0.0003944906,0.00047452844,0.0005108601,0.00006345198,0.00006277318,0.0004374872,0.00014840247,0.82472575,0.01546964,0.118275404,0.03929243,0.00014476525],"about_ca_topic_score_codex":0.0029286875,"about_ca_topic_score_gemma":0.0036536148,"teacher_disagreement_score":0.007106629,"about_ca_system_score_codex":0.0019846766,"about_ca_system_score_gemma":0.0025304216,"threshold_uncertainty_score":0.023774028},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025375731,0.0006997694,0.9670358,0.0005152054,0.00007736395,0.00008511951,0.00022454529,0.000423621,0.005562855],"genre_scores_gemma":[0.75087374,0.0014279842,0.22995532,0.0003771739,0.00048014795,0.00040735464,0.001066684,0.0010628989,0.014348685],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99531376,0.0012214525,0.00017210373,0.00060620875,0.0018405798,0.00084573095],"domain_scores_gemma":[0.96419793,0.02844241,0.001626395,0.0015129987,0.003126622,0.0010936179],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005395015,0.0018240685,0.0015919995,0.0025757244,0.0011075933,0.0027843148,0.004002148,0.0012780745,0.011512479],"category_scores_gemma":[0.0373389,0.0009717275,0.0014692387,0.002384118,0.0019942988,0.004085188,0.0035274925,0.0023068388,0.0011181756],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007105108,0.000096679185,0.0026076436,0.00036702896,0.000088592846,0.00018672226,0.00026767602,0.83710545,0.0028079175,0.107010596,0.0043800133,0.04437114],"study_design_scores_gemma":[0.0000110504225,0.000047913083,0.00020984793,0.000017272085,0.0000267259,0.000058534333,0.000039892515,0.9772882,0.000895706,0.02078614,0.0006096463,0.000009061562],"about_ca_topic_score_codex":0.0051875054,"about_ca_topic_score_gemma":0.004534086,"teacher_disagreement_score":0.011512479,"about_ca_system_score_codex":0.0037560381,"about_ca_system_score_gemma":0.00268477,"threshold_uncertainty_score":0.038513124},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30859423,0.00049774913,0.6289422,0.00062618713,0.00014623313,0.0005949462,0.0040915855,0.0013351865,0.055171803],"genre_scores_gemma":[0.43497127,0.00073759677,0.51977384,0.000086754,0.000026148804,0.00042211005,0.0057837414,0.0005766477,0.037621886],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99974066,0.000027433645,0.000016932387,0.00006302904,0.000096427655,0.00005553324],"domain_scores_gemma":[0.99926275,0.0002522801,0.00006339583,0.000089233545,0.0002476864,0.00008471901],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025621083,0.0005280773,0.0005340292,0.0011730917,0.0010167428,0.0013288119,0.001129649,0.00070516864,0.014828422],"category_scores_gemma":[0.002856988,0.0003794685,0.00040217457,0.0010593099,0.00043280475,0.0012616575,0.0013219916,0.0011357702,0.0017953508],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00085049827,0.000399533,0.0054324693,0.0011065466,0.00008400779,0.00046327786,0.001549742,0.1542003,0.032694355,0.28602177,0.028302776,0.48889482],"study_design_scores_gemma":[0.00015581133,0.00043098273,0.0036702647,0.00042237097,0.00008708946,0.000630529,0.0022717041,0.5137971,0.04095543,0.3276769,0.10984352,0.000058245707],"about_ca_topic_score_codex":0.0031255586,"about_ca_topic_score_gemma":0.0072327224,"teacher_disagreement_score":0.014828422,"about_ca_system_score_codex":0.00083253987,"about_ca_system_score_gemma":0.0009721057,"threshold_uncertainty_score":0.049605966},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02637884,0.000105443476,0.9703466,0.0000524201,0.00007043805,0.0000727362,0.000029375637,0.0004778921,0.0024661615],"genre_scores_gemma":[0.23004705,0.00015654312,0.7660625,0.000088183326,0.00004181382,0.00015331368,0.0002370297,0.00031279778,0.002900686],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992613,0.000169905,0.000048322214,0.00010499667,0.0003597098,0.000055668144],"domain_scores_gemma":[0.99891305,0.0004913838,0.00007727101,0.00024181798,0.0002286445,0.00004778323],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001032441,0.0004769187,0.00087500364,0.0009840871,0.0004157315,0.0006765069,0.00068723195,0.00066311663,0.0019816444],"category_scores_gemma":[0.0033174988,0.00033899833,0.000673069,0.0005469611,0.0007433121,0.00068152917,0.001811679,0.0010072269,0.000609246],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015940101,0.000062243525,0.0015439667,0.00017413012,0.000041981457,0.00025614823,0.00033606196,0.66697943,0.061658364,0.031147366,0.0025524504,0.2350885],"study_design_scores_gemma":[0.000020491343,0.000031237403,0.00018664211,0.000013374063,0.000006947099,0.000045252935,0.000021837295,0.977513,0.009902946,0.007123229,0.005124906,0.000010120298],"about_ca_topic_score_codex":0.001379804,"about_ca_topic_score_gemma":0.0013746507,"teacher_disagreement_score":0.0019816444,"about_ca_system_score_codex":0.0003005768,"about_ca_system_score_gemma":0.00045700825,"threshold_uncertainty_score":0.006629288},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.084057204,0.00015932832,0.8609625,0.00023036373,0.0002857925,0.0001050973,0.000398722,0.0011805723,0.052620415],"genre_scores_gemma":[0.69903713,0.00030022959,0.19297935,0.0001828708,0.00015820746,0.00021617221,0.0014267217,0.0008451894,0.104854025],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99959916,0.00005266542,0.000018802895,0.00013230846,0.00013926953,0.000057764744],"domain_scores_gemma":[0.9995758,0.0000808293,0.00003240443,0.00012996429,0.00009159274,0.00008937454],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003520776,0.0007635673,0.00088240206,0.0007970834,0.00081861624,0.0010278411,0.0015253382,0.0009820159,0.02607548],"category_scores_gemma":[0.0011269695,0.00038019445,0.0006068433,0.00042887556,0.0009425284,0.0018699497,0.0041436693,0.0017601958,0.0058457996],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032889025,0.00013255372,0.0005097631,0.00014238918,0.00004169743,0.00032505702,0.0002473288,0.053588286,0.012949775,0.82373357,0.009282706,0.09871801],"study_design_scores_gemma":[0.00005821122,0.00019597466,0.00027972285,0.000027531878,0.000023761959,0.000344127,0.00019613377,0.27942967,0.01092926,0.6846843,0.023797762,0.000033543656],"about_ca_topic_score_codex":0.00039614123,"about_ca_topic_score_gemma":0.0005937192,"teacher_disagreement_score":0.02607548,"about_ca_system_score_codex":0.0003341712,"about_ca_system_score_gemma":0.00033187482,"threshold_uncertainty_score":0.08723116},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0835404,0.00025311275,0.8908547,0.0005049293,0.00015531757,0.000088204906,0.00046442501,0.0020920993,0.022046711],"genre_scores_gemma":[0.55227625,0.00042318343,0.4172434,0.00024997268,0.00009319025,0.0001616957,0.0008581106,0.0012296673,0.02746458],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994098,0.00014766584,0.000032219014,0.00014955702,0.00018220565,0.00007867441],"domain_scores_gemma":[0.9970335,0.0011639788,0.00037213994,0.00076601404,0.00033883273,0.00032555655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046139755,0.0007365303,0.00073759933,0.0018690911,0.0009111848,0.002324501,0.0015439941,0.0014929587,0.015637835],"category_scores_gemma":[0.0050112973,0.0011617866,0.00075744017,0.0014550096,0.0011693743,0.0032573023,0.003249321,0.0021518245,0.003131826],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025305455,0.00012422394,0.0012344202,0.0002834098,0.00005995979,0.00038903535,0.00048704512,0.11412847,0.019089673,0.7335199,0.013966965,0.11646377],"study_design_scores_gemma":[0.000065508386,0.00005423171,0.00040031012,0.000070425966,0.00003113365,0.00029953837,0.00018312594,0.39452603,0.007453789,0.5840223,0.01285348,0.00004010222],"about_ca_topic_score_codex":0.000643936,"about_ca_topic_score_gemma":0.0012226833,"teacher_disagreement_score":0.015637835,"about_ca_system_score_codex":0.00072023727,"about_ca_system_score_gemma":0.00045674393,"threshold_uncertainty_score":0.052313805},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014821786,0.0019496941,0.4949448,0.0034557555,0.0015139503,0.00010810122,0.00009712623,0.00069297734,0.48241583],"genre_scores_gemma":[0.34361196,0.0033105856,0.38488278,0.001598379,0.0009537569,0.0005370112,0.00022903986,0.00042281012,0.2644537],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99937135,0.00013690615,0.000024813098,0.0001764105,0.00021064199,0.000079889316],"domain_scores_gemma":[0.9992685,0.00014206313,0.000043457156,0.00030040683,0.00014804072,0.00009751637],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055154896,0.00044281498,0.00036093275,0.00080191507,0.001745713,0.0029593222,0.0016369552,0.0014165349,0.023796683],"category_scores_gemma":[0.00132722,0.00026153369,0.0005860422,0.0007785937,0.0033957553,0.005063944,0.0022814425,0.0015448653,0.004966959],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009943296,0.000012755943,0.00007975423,0.000034896282,0.0000027076062,0.000057577658,0.0002233591,0.0012797952,0.0011844436,0.97008675,0.00390877,0.023119234],"study_design_scores_gemma":[0.000011674127,0.000036085985,0.00016632053,0.000056659912,0.000005048492,0.00033281292,0.00022570978,0.011523376,0.0010516965,0.6215989,0.3649752,0.000016523527],"about_ca_topic_score_codex":0.0012536651,"about_ca_topic_score_gemma":0.0018956745,"teacher_disagreement_score":0.023796683,"about_ca_system_score_codex":0.0007417964,"about_ca_system_score_gemma":0.0008450944,"threshold_uncertainty_score":0.079607844},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020535098,0.0006037181,0.9175055,0.0025567508,0.0006883699,0.00025023049,0.0007382473,0.006224698,0.050897375],"genre_scores_gemma":[0.0966319,0.00061833824,0.8619056,0.0004165663,0.00005641716,0.00017547607,0.0011667865,0.0010297688,0.037999135],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999777,0.000037705224,0.000011202015,0.00006687074,0.00006806387,0.000039197927],"domain_scores_gemma":[0.99969995,0.000060869384,0.000015919455,0.00010243599,0.00006567987,0.00005516698],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002637073,0.00065031927,0.00056253216,0.0003227622,0.0012811389,0.0014239384,0.001323301,0.0012387596,0.037366126],"category_scores_gemma":[0.0017920688,0.0003795209,0.0005343991,0.00048478876,0.0006217948,0.003259023,0.0014281743,0.0010253794,0.0164036],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044070964,0.00015554154,0.0010545119,0.00033979875,0.00005678672,0.0002963968,0.00050971395,0.02415564,0.01023491,0.049979553,0.116784036,0.7959924],"study_design_scores_gemma":[0.0002077691,0.00028444696,0.0010654698,0.0002178298,0.00008492119,0.0009595838,0.0017069455,0.28013527,0.015626047,0.30017713,0.39939868,0.00013590201],"about_ca_topic_score_codex":0.0033339842,"about_ca_topic_score_gemma":0.008748278,"teacher_disagreement_score":0.037366126,"about_ca_system_score_codex":0.00034155577,"about_ca_system_score_gemma":0.00062216556,"threshold_uncertainty_score":0.12500215},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39728585,0.00080478285,0.5186018,0.0010339128,0.0004163429,0.0002308045,0.0006580322,0.00045715377,0.08051129],"genre_scores_gemma":[0.8282719,0.0006558586,0.117009476,0.00026041397,0.0001736156,0.00019994433,0.00094975723,0.0004055357,0.052073453],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994881,0.00010947849,0.000028280605,0.00008914147,0.00020305818,0.00008198207],"domain_scores_gemma":[0.9988146,0.00048939453,0.00016516767,0.00019307922,0.0001845512,0.00015331236],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005644761,0.00043072045,0.0005246666,0.0017029463,0.0010222893,0.0018917305,0.0012948219,0.00097096537,0.012445104],"category_scores_gemma":[0.0026512952,0.00054168,0.00087324326,0.0010511366,0.0010481417,0.0019210269,0.0017842989,0.0018374458,0.0012036768],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042040836,0.000045917564,0.00037952,0.00004741008,0.000009394841,0.00011376472,0.00020394742,0.0079102125,0.0027093848,0.960729,0.003077735,0.024731666],"study_design_scores_gemma":[0.000031091822,0.00004640583,0.0005133364,0.000030736188,0.000015227346,0.00036830964,0.00015297015,0.07816285,0.0034729724,0.9078824,0.009298647,0.00002507732],"about_ca_topic_score_codex":0.0005159754,"about_ca_topic_score_gemma":0.00061770884,"teacher_disagreement_score":0.012445104,"about_ca_system_score_codex":0.0007419335,"about_ca_system_score_gemma":0.00034483528,"threshold_uncertainty_score":0.04163301},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11709367,0.0005228548,0.856846,0.0004332048,0.000082170394,0.0001044404,0.0004192305,0.0004892683,0.024009172],"genre_scores_gemma":[0.66927373,0.00092124305,0.3112387,0.0001339526,0.00009412652,0.00030184496,0.0013641629,0.0004242908,0.01624794],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995828,0.000092470436,0.000017334249,0.000112662856,0.00013571045,0.000059015827],"domain_scores_gemma":[0.99868375,0.000661989,0.00017236527,0.00019947106,0.00017480685,0.000107671854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045411306,0.0003842886,0.00048998016,0.0013337535,0.0009696886,0.0013675101,0.0012200653,0.00069447357,0.009021955],"category_scores_gemma":[0.0038680495,0.0005753576,0.0004843158,0.0013941275,0.00094230846,0.002076546,0.001854013,0.0010269026,0.0007583076],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003249637,0.00008517786,0.0020999594,0.00022466463,0.000029901266,0.0003835587,0.0004585208,0.21798587,0.008025736,0.6406354,0.009172704,0.12057362],"study_design_scores_gemma":[0.00007687382,0.00006880195,0.00084782584,0.000054516742,0.000027024575,0.0004230682,0.00023409922,0.6194489,0.0036154224,0.3581577,0.017020436,0.00002537649],"about_ca_topic_score_codex":0.0018037922,"about_ca_topic_score_gemma":0.002039238,"teacher_disagreement_score":0.009021955,"about_ca_system_score_codex":0.000594578,"about_ca_system_score_gemma":0.00035064114,"threshold_uncertainty_score":0.030181468},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07025584,0.00023926033,0.85608643,0.0005845879,0.0002452968,0.00018240423,0.00081537676,0.0029618354,0.068628915],"genre_scores_gemma":[0.25545827,0.0004875905,0.7030078,0.00022145551,0.000034065884,0.00015616971,0.0008049257,0.0006528373,0.039176777],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997074,0.000036824233,0.000023548795,0.00007695755,0.000111658956,0.000043583354],"domain_scores_gemma":[0.99972445,0.00009998968,0.000029539338,0.00006855204,0.000042741958,0.000034683777],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023718277,0.0012389601,0.00073150545,0.0005355319,0.0006439148,0.0009595343,0.0012233678,0.0010123526,0.019737013],"category_scores_gemma":[0.0007359297,0.00073665346,0.00061106094,0.00091613166,0.00066125585,0.0011255558,0.0016834474,0.0012265648,0.0041332734],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00086006615,0.00023518653,0.0016117162,0.0007584663,0.0001492441,0.0008813773,0.00093763985,0.26012242,0.067783244,0.103332736,0.049512427,0.51381546],"study_design_scores_gemma":[0.0002633968,0.0003375103,0.0015741026,0.00015012994,0.000081009115,0.0010704192,0.00061337976,0.6619621,0.032362085,0.17848776,0.12298106,0.00011703221],"about_ca_topic_score_codex":0.0031481814,"about_ca_topic_score_gemma":0.009515548,"teacher_disagreement_score":0.019737013,"about_ca_system_score_codex":0.0005917924,"about_ca_system_score_gemma":0.00045886263,"threshold_uncertainty_score":0.06602687},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1824214,0.00030565605,0.7982593,0.00017510969,0.00018905888,0.0001887798,0.00041321237,0.0010019678,0.017045526],"genre_scores_gemma":[0.6714869,0.0007938623,0.29641786,0.000082538376,0.0000857043,0.000245121,0.001239137,0.00063015555,0.029018635],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99959725,0.0000939874,0.000023407252,0.00009189138,0.00014303486,0.000050538023],"domain_scores_gemma":[0.9988324,0.00023073515,0.00022462069,0.00014483568,0.00042047273,0.00014697951],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035843576,0.0006113313,0.00036526623,0.0019049358,0.0006803886,0.0016940096,0.00091407885,0.00069792534,0.008962689],"category_scores_gemma":[0.0027556259,0.0004071832,0.00037311154,0.0015287226,0.0009961326,0.0012702751,0.0017476785,0.0014127037,0.002166802],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00064359326,0.00028764855,0.0048565613,0.00035885198,0.00004531447,0.00067816215,0.0024827963,0.06685007,0.050780997,0.57840216,0.00848169,0.28613216],"study_design_scores_gemma":[0.00010465599,0.00066189043,0.004050965,0.00022174529,0.000043924683,0.0010661186,0.0031719094,0.5006627,0.044993185,0.36070818,0.08422526,0.00008945173],"about_ca_topic_score_codex":0.0015518308,"about_ca_topic_score_gemma":0.0018815321,"teacher_disagreement_score":0.008962689,"about_ca_system_score_codex":0.0005049452,"about_ca_system_score_gemma":0.00038157045,"threshold_uncertainty_score":0.029983163},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046772335,0.000112976,0.9445894,0.00015477018,0.00007829829,0.0002742586,0.00037474805,0.00073582964,0.0069074184],"genre_scores_gemma":[0.18197925,0.00021743562,0.81355375,0.000049516297,0.000016536227,0.00026701254,0.00078226824,0.0004382611,0.002695939],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991738,0.0001454997,0.000054444456,0.00012391341,0.00040092808,0.000101401434],"domain_scores_gemma":[0.99873215,0.0006402002,0.00011208011,0.00025061422,0.00015655093,0.00010838114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068258937,0.0012788415,0.001691754,0.0014933193,0.00085912156,0.0018775755,0.0017869226,0.001753322,0.007721631],"category_scores_gemma":[0.0040577166,0.0015094467,0.002049574,0.0015498608,0.0013517136,0.0014286988,0.004482602,0.0028753115,0.00173706],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00073884893,0.0003702106,0.0023155492,0.0010615849,0.00018899601,0.0018234529,0.0012763207,0.575363,0.033461478,0.11201336,0.008234504,0.26315272],"study_design_scores_gemma":[0.00010845337,0.00015647445,0.00050803786,0.00010602595,0.000040841853,0.00035695417,0.0004892756,0.9261121,0.010594152,0.051242072,0.010230108,0.000055539935],"about_ca_topic_score_codex":0.0026262403,"about_ca_topic_score_gemma":0.0037284351,"teacher_disagreement_score":0.007721631,"about_ca_system_score_codex":0.00073838595,"about_ca_system_score_gemma":0.00088838255,"threshold_uncertainty_score":0.025831461},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010277001,0.000025220448,0.9973037,0.000023967237,0.00006646306,0.0000398685,0.000024450044,0.00046325743,0.001025228],"genre_scores_gemma":[0.026420057,0.00006857937,0.96965665,0.000091722875,0.0000309844,0.00017009531,0.0001399334,0.0004910347,0.0029309574],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992311,0.00009787627,0.000039297272,0.000089064255,0.00050624076,0.00003635641],"domain_scores_gemma":[0.9991774,0.0003032153,0.000048075468,0.00015679437,0.00026655756,0.000047855032],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008702903,0.00083802413,0.001002078,0.001389784,0.0008192046,0.0010361844,0.0026307518,0.0015867038,0.00893559],"category_scores_gemma":[0.002419759,0.000723122,0.0011151636,0.0011917487,0.0007190775,0.0010845569,0.0024190939,0.0015156983,0.0027693375],"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.00014277286,0.00022685964,0.001009139,0.0004921947,0.00015060359,0.00029126357,0.0004238779,0.30417287,0.067881234,0.07046487,0.009951295,0.54479307],"study_design_scores_gemma":[0.000032214357,0.00006158783,0.00018849166,0.000035147055,0.00002922133,0.00015764139,0.000031378688,0.9656565,0.0077055166,0.009546556,0.016523749,0.00003199205],"about_ca_topic_score_codex":0.002223754,"about_ca_topic_score_gemma":0.0041540815,"teacher_disagreement_score":0.00893559,"about_ca_system_score_codex":0.0004783759,"about_ca_system_score_gemma":0.0012845717,"threshold_uncertainty_score":0.029892564},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042048924,0.000096820346,0.9548972,0.00010828938,0.00004311132,0.00009457363,0.0003143034,0.00066266244,0.0017340485],"genre_scores_gemma":[0.31836444,0.00020673704,0.6783488,0.000061838495,0.000026283962,0.00014142664,0.0010749875,0.00035714585,0.001418309],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99914324,0.00015416065,0.000043116073,0.00015501086,0.00041930957,0.000085139654],"domain_scores_gemma":[0.9978028,0.00094816147,0.0001991682,0.0005051337,0.00042636518,0.00011847538],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008760814,0.001048684,0.0014860429,0.0021468562,0.00075169554,0.0022007087,0.0021682458,0.002194852,0.003175305],"category_scores_gemma":[0.00680846,0.0016028382,0.0012588317,0.0018948817,0.001432686,0.0016834915,0.0026128318,0.0025461353,0.0013577336],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006044883,0.00021485129,0.004426592,0.00050560525,0.0000958078,0.0005802788,0.00047244772,0.581605,0.032361668,0.10397109,0.005467934,0.26969415],"study_design_scores_gemma":[0.00002176399,0.00002917759,0.00021306014,0.000025753308,0.000009981638,0.00010475957,0.000098323384,0.96974325,0.003575186,0.025004454,0.0011587455,0.000015461603],"about_ca_topic_score_codex":0.0024780699,"about_ca_topic_score_gemma":0.0042651654,"teacher_disagreement_score":0.003175305,"about_ca_system_score_codex":0.00058142236,"about_ca_system_score_gemma":0.0014156894,"threshold_uncertainty_score":0.010622501},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00450217,0.009092261,0.23043397,0.014982607,0.31311616,0.00025467612,0.01768603,0.004348583,0.4055835],"genre_scores_gemma":[0.07656703,0.009883151,0.15295456,0.0066669136,0.031924494,0.0003049759,0.019593842,0.0055419337,0.696563],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994838,0.000071728864,0.000053793396,0.00009454892,0.00025810042,0.000038094113],"domain_scores_gemma":[0.9987947,0.0002762735,0.000052522304,0.00030727094,0.0004912639,0.000077936034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037723783,0.0010799695,0.00089511956,0.001340339,0.00087740814,0.0016188772,0.0014987056,0.0011838621,0.19360878],"category_scores_gemma":[0.0038939756,0.0004001569,0.0006036961,0.0026987751,0.000868472,0.0015393097,0.000901479,0.0026354063,0.06103508],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010477475,0.00002312081,0.00007447634,0.00035545076,0.000012854735,0.00016935279,0.000029230732,0.0024567125,0.0012334957,0.049145937,0.83871555,0.107679054],"study_design_scores_gemma":[0.00001918133,0.000029702987,0.00023912646,0.00008266961,0.000007212652,0.00041865924,0.000026921616,0.0037055074,0.0013643842,0.02461641,0.9694756,0.0000145484355],"about_ca_topic_score_codex":0.0012135942,"about_ca_topic_score_gemma":0.002859472,"teacher_disagreement_score":0.19360878,"about_ca_system_score_codex":0.00051295856,"about_ca_system_score_gemma":0.00068042526,"threshold_uncertainty_score":0.6476859},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.077503145,0.00512515,0.58584833,0.0066787135,0.001786162,0.00008888089,0.00070077874,0.0006813925,0.32158747],"genre_scores_gemma":[0.7770225,0.0038773038,0.08244341,0.0022383195,0.0014429201,0.00018213372,0.00062271877,0.0010992285,0.13107142],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993754,0.00008945134,0.000028982027,0.00020033734,0.00021115672,0.00009479859],"domain_scores_gemma":[0.9992398,0.00030400325,0.00005995698,0.00017859417,0.00013917727,0.000078533005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009599925,0.0008465528,0.0008106712,0.001672177,0.0014129551,0.0017678645,0.0014177919,0.0010342834,0.017909199],"category_scores_gemma":[0.00312741,0.0004937558,0.0010159967,0.0010701439,0.0024763742,0.0055646687,0.0032848858,0.0025603033,0.0024195828],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025479969,0.000013449298,0.00017271639,0.0000462405,0.000013698772,0.000042491996,0.00009635326,0.001174665,0.0011555374,0.978681,0.0040508695,0.0145275025],"study_design_scores_gemma":[0.000013444239,0.000013410164,0.00023859431,0.000016646314,0.0000123831205,0.00014774418,0.000041105443,0.00580898,0.0009634333,0.9796404,0.013093342,0.000010482412],"about_ca_topic_score_codex":0.0012397092,"about_ca_topic_score_gemma":0.0012017076,"teacher_disagreement_score":0.017909199,"about_ca_system_score_codex":0.0010707123,"about_ca_system_score_gemma":0.00051036326,"threshold_uncertainty_score":0.059912264},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38719195,0.001092783,0.4464339,0.0028407266,0.00038516705,0.00014132068,0.0009881174,0.00068856764,0.16023745],"genre_scores_gemma":[0.8712607,0.00060950057,0.07245295,0.00037926657,0.00020143272,0.00019047836,0.0009201954,0.00062976155,0.05335576],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995629,0.00008786501,0.000020424992,0.000104638944,0.00015000149,0.0000741869],"domain_scores_gemma":[0.9989802,0.0003543205,0.0001385775,0.00024429016,0.00018011968,0.00010247614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003979922,0.0005778868,0.000756757,0.0012359405,0.0013704866,0.002529164,0.00080011145,0.001277433,0.011556613],"category_scores_gemma":[0.0036892726,0.0005750352,0.0007630934,0.0004807273,0.0013807393,0.0030687018,0.003054809,0.002680426,0.0014022753],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059687012,0.000018111474,0.00040218045,0.00006648263,0.000011426762,0.000068842506,0.00015994276,0.0034414576,0.0033414029,0.9741275,0.0036607403,0.014642307],"study_design_scores_gemma":[0.000023463417,0.000041325813,0.00095213077,0.000034675886,0.000022505597,0.00035535241,0.00019617165,0.020326328,0.0045038117,0.9563107,0.017217038,0.000016430608],"about_ca_topic_score_codex":0.00038161047,"about_ca_topic_score_gemma":0.00046523812,"teacher_disagreement_score":0.011556613,"about_ca_system_score_codex":0.00082430616,"about_ca_system_score_gemma":0.00040135684,"threshold_uncertainty_score":0.038660765},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034206584,0.004144482,0.8970897,0.0016655832,0.00045115486,0.0001832504,0.000738434,0.0016071802,0.05991357],"genre_scores_gemma":[0.5380781,0.0059906105,0.42369533,0.0014789796,0.0016975532,0.00075354765,0.0022367125,0.0026623385,0.023406724],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.98303586,0.004768284,0.0011081634,0.0028350968,0.0065049715,0.0017476414],"domain_scores_gemma":[0.87146646,0.09899094,0.0033516637,0.016643774,0.0059895515,0.0035574785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0147820525,0.0035810634,0.0041412516,0.0060445964,0.0019046565,0.008532463,0.009532975,0.0031554112,0.017581495],"category_scores_gemma":[0.07058668,0.002941126,0.0045528794,0.0044825017,0.008764684,0.017824713,0.017392337,0.017809978,0.005479147],"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.00089779636,0.0003069037,0.002031074,0.0007467344,0.00015873712,0.00032333384,0.00073109765,0.061139002,0.009426576,0.85642564,0.0068914136,0.0609217],"study_design_scores_gemma":[0.00009509504,0.00027502916,0.00079196686,0.0002736437,0.00015363721,0.00029393527,0.00016254476,0.21326976,0.007847182,0.7685391,0.00819063,0.00010753506],"about_ca_topic_score_codex":0.0009259158,"about_ca_topic_score_gemma":0.0010998222,"teacher_disagreement_score":0.017581495,"about_ca_system_score_codex":0.0029946608,"about_ca_system_score_gemma":0.0017311226,"threshold_uncertainty_score":0.0781759},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28869084,0.0024248154,0.59528935,0.0038086232,0.0005375424,0.00014588948,0.001134943,0.0008374081,0.107130535],"genre_scores_gemma":[0.82054067,0.0016468153,0.14179711,0.00056390784,0.00042084334,0.00028690783,0.0012145436,0.00061731454,0.032912],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979672,0.0005910186,0.00009767699,0.00045121706,0.0005637425,0.00032915125],"domain_scores_gemma":[0.9790558,0.013957385,0.0019454281,0.0018444229,0.0018837241,0.0013131902],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002405021,0.00088045275,0.0009997683,0.0025063537,0.0016402502,0.0038432686,0.002105479,0.001773145,0.021021394],"category_scores_gemma":[0.027110675,0.0008007933,0.0004981309,0.0018789663,0.002427503,0.008800454,0.00237653,0.0023595404,0.0022642908],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008615083,0.0001371786,0.0055444944,0.00025386928,0.000053040007,0.00014016585,0.00029536602,0.06791605,0.0065583494,0.7941782,0.0140689695,0.109992735],"study_design_scores_gemma":[0.000089702844,0.00012296865,0.0013773666,0.00009908956,0.000043151522,0.00028110752,0.00020800323,0.24595794,0.0031040441,0.7366677,0.012016866,0.000032145017],"about_ca_topic_score_codex":0.00096370484,"about_ca_topic_score_gemma":0.0013398093,"teacher_disagreement_score":0.021021394,"about_ca_system_score_codex":0.0013358912,"about_ca_system_score_gemma":0.00072587753,"threshold_uncertainty_score":0.07032359},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11807548,0.0008717684,0.810933,0.00053512433,0.00020605457,0.00020210323,0.00096759433,0.0016790015,0.06652994],"genre_scores_gemma":[0.50991774,0.0019129007,0.44909695,0.00016662282,0.00007681821,0.00019229103,0.0027878673,0.00047718376,0.035371568],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996669,0.00008596226,0.000018426892,0.000068675625,0.0001053327,0.000054675445],"domain_scores_gemma":[0.9992182,0.00029426513,0.000108956956,0.0001632124,0.00013908364,0.00007620231],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022684342,0.00060033693,0.0004792351,0.0011265535,0.00048267696,0.0013644095,0.0010683861,0.0006021351,0.016878303],"category_scores_gemma":[0.0022448963,0.0008961889,0.00046118716,0.0015890759,0.0006124539,0.001180381,0.0014110619,0.0012207696,0.0025135824],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024401383,0.00009254715,0.00130286,0.00033920884,0.00004466802,0.0003836547,0.0005236062,0.0974303,0.015792314,0.55989516,0.025740072,0.2982115],"study_design_scores_gemma":[0.00016059652,0.00015326156,0.0015514308,0.00013595766,0.00007758071,0.00071200787,0.000603322,0.3471911,0.013559995,0.52808124,0.1077113,0.000062172985],"about_ca_topic_score_codex":0.0022163908,"about_ca_topic_score_gemma":0.004284482,"teacher_disagreement_score":0.016878303,"about_ca_system_score_codex":0.00046902904,"about_ca_system_score_gemma":0.00037792764,"threshold_uncertainty_score":0.05646354},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3470944,0.00169404,0.6112934,0.0043356447,0.0003847197,0.0001646995,0.00071266334,0.00124098,0.03307951],"genre_scores_gemma":[0.7912549,0.0006293638,0.19144052,0.0004179144,0.00014826833,0.00014928919,0.00073661143,0.0008015092,0.01442165],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994797,0.00018246619,0.00001644283,0.000079364494,0.000114153394,0.00012788635],"domain_scores_gemma":[0.99800605,0.001484517,0.0000909546,0.00016258091,0.00012892524,0.00012692776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011294908,0.0013550331,0.0018361511,0.00075525447,0.00092719065,0.0012726214,0.0020105077,0.001956501,0.008251138],"category_scores_gemma":[0.0071606897,0.00059661333,0.00080711395,0.0010783133,0.0012958341,0.003089633,0.002060046,0.0020196731,0.0005696662],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014093057,0.00026887312,0.00091071974,0.0001772047,0.000070928094,0.00013489189,0.00014148823,0.8249805,0.0018277487,0.07033807,0.01310843,0.086631805],"study_design_scores_gemma":[0.00010429377,0.00005360909,0.00012523658,0.000011889834,0.00001707756,0.000021847469,0.000042936215,0.92139596,0.00046681086,0.076846905,0.0009061564,0.000007373349],"about_ca_topic_score_codex":0.0064322613,"about_ca_topic_score_gemma":0.006767244,"teacher_disagreement_score":0.008251138,"about_ca_system_score_codex":0.0009357638,"about_ca_system_score_gemma":0.001124171,"threshold_uncertainty_score":0.027602792},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02894273,0.000041157386,0.95223874,0.0001232635,0.00013201473,0.00037313785,0.0019182841,0.0062321206,0.009998479],"genre_scores_gemma":[0.20595284,0.00010150313,0.77923197,0.00008545725,0.000019099758,0.0006420682,0.003553288,0.0017320102,0.008681796],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99974674,0.000017225926,0.000013083778,0.000030317791,0.00016554902,0.000027012353],"domain_scores_gemma":[0.9995315,0.00014867628,0.000026923475,0.00009642495,0.00017683227,0.000019707257],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032643796,0.0006495224,0.00058503594,0.00103265,0.0003960089,0.0006323857,0.0008939395,0.0008282488,0.013616115],"category_scores_gemma":[0.0010845641,0.0005784533,0.00056823326,0.0005630801,0.00038071803,0.0003832832,0.00063378375,0.00072554074,0.0039190096],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036481398,0.00024118436,0.002089351,0.0007921268,0.000057333695,0.0007859613,0.0007366424,0.31033844,0.31507072,0.029180251,0.03643397,0.30390924],"study_design_scores_gemma":[0.000080552345,0.00014143257,0.001091336,0.000043536445,0.000026670768,0.0003667236,0.00016951654,0.78196824,0.1777482,0.0050022216,0.033303652,0.000057918394],"about_ca_topic_score_codex":0.0015186779,"about_ca_topic_score_gemma":0.0016101351,"teacher_disagreement_score":0.013616115,"about_ca_system_score_codex":0.00044064238,"about_ca_system_score_gemma":0.0008464887,"threshold_uncertainty_score":0.045550466},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54007536,0.0011345894,0.44418088,0.000662527,0.00009353386,0.00006337212,0.00033769998,0.00024960123,0.013202332],"genre_scores_gemma":[0.9817062,0.0002969011,0.015462826,0.00004516909,0.000032709228,0.000026522384,0.000105942425,0.000022003687,0.0023017658],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992157,0.00025096955,0.00003243628,0.000113809896,0.00014781918,0.00023922525],"domain_scores_gemma":[0.9951408,0.0036507458,0.00041187997,0.0002074605,0.00029970077,0.0002894093],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086868054,0.0006375797,0.0013236683,0.0007743775,0.0007354649,0.0012698922,0.0014827062,0.0017675203,0.0012841938],"category_scores_gemma":[0.005995815,0.0006998919,0.00066944107,0.0010752053,0.0010190008,0.0013766629,0.0025442555,0.00064403017,0.0003052258],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00055690657,0.000038564554,0.0034701235,0.00011427336,0.00007587857,0.00088017207,0.00019466435,0.9763485,0.0035645473,0.006584318,0.0006202326,0.0075517944],"study_design_scores_gemma":[0.000025735677,0.00006110028,0.00065937446,0.000011977826,0.000031932675,0.00020156508,0.00011290075,0.9935354,0.0009694391,0.004138617,0.00023857388,0.000013384396],"about_ca_topic_score_codex":0.004209871,"about_ca_topic_score_gemma":0.0027961046,"teacher_disagreement_score":0.004209871,"about_ca_system_score_codex":0.0005362797,"about_ca_system_score_gemma":0.0004180992,"threshold_uncertainty_score":0.008370757},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23621629,0.0007751662,0.74972695,0.0015164857,0.00021806343,0.00015514165,0.0008182473,0.0016497719,0.0089239],"genre_scores_gemma":[0.48738357,0.00030867272,0.50776714,0.00013226474,0.000073259165,0.0001329139,0.0011714414,0.00024843053,0.0027823313],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990878,0.00019043579,0.00006788268,0.0002688096,0.0002707588,0.00011436716],"domain_scores_gemma":[0.99757856,0.0013633388,0.00020236838,0.00039659627,0.00031249318,0.00014657089],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010112822,0.0009615064,0.001490962,0.0011455297,0.0008873689,0.0015205649,0.0022601269,0.0021471924,0.005309641],"category_scores_gemma":[0.011194201,0.00060982053,0.00079123554,0.0017830839,0.00074174406,0.0036341855,0.0017587127,0.0010669931,0.001129791],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010895082,0.0003246344,0.004173462,0.00061700033,0.00013583811,0.0002534097,0.00033619578,0.649925,0.017265314,0.039584134,0.01290547,0.27339],"study_design_scores_gemma":[0.00005431527,0.000098637145,0.00050682976,0.000018318517,0.000033066444,0.00015180277,0.00011470155,0.9701176,0.003592579,0.02391146,0.001391913,0.0000087032895],"about_ca_topic_score_codex":0.0014512995,"about_ca_topic_score_gemma":0.0026418779,"teacher_disagreement_score":0.005309641,"about_ca_system_score_codex":0.0011349455,"about_ca_system_score_gemma":0.0011240552,"threshold_uncertainty_score":0.017762542},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038682647,0.00008587056,0.95489085,0.000075820986,0.000048204176,0.0000791685,0.00014305994,0.0006725806,0.0053218678],"genre_scores_gemma":[0.42048433,0.00026027745,0.5729208,0.00005010608,0.000022062166,0.00009906303,0.0007780868,0.0006025338,0.004782772],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99918205,0.00014708887,0.000047017315,0.00014919745,0.00038630917,0.000088309105],"domain_scores_gemma":[0.9989249,0.00045876973,0.00008341379,0.0003726584,0.00011129727,0.000048920876],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064893026,0.00072441867,0.00092456304,0.0009240932,0.0006762974,0.0014497614,0.001614218,0.0012337944,0.0037070713],"category_scores_gemma":[0.0036445148,0.0009114336,0.00093491934,0.0010247125,0.0014024288,0.00158038,0.0030776423,0.001409506,0.00077172153],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001348461,0.000049529954,0.0008074331,0.00019212671,0.000031009866,0.0004719466,0.0004259756,0.79693085,0.011544451,0.09330302,0.0021662896,0.0939425],"study_design_scores_gemma":[0.000009829166,0.000039753228,0.00009702233,0.000026874815,0.00000947715,0.00015137246,0.000107309155,0.9581485,0.005992815,0.0305481,0.0048566735,0.00001244316],"about_ca_topic_score_codex":0.002166468,"about_ca_topic_score_gemma":0.0026609886,"teacher_disagreement_score":0.0037070713,"about_ca_system_score_codex":0.00052798796,"about_ca_system_score_gemma":0.0006739175,"threshold_uncertainty_score":0.012401402},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5359805,0.00067937677,0.42392945,0.0005342619,0.00017482832,0.00015695216,0.006817568,0.0046339473,0.027093107],"genre_scores_gemma":[0.7888488,0.00059013587,0.1846054,0.00010528493,0.00005988912,0.00006116796,0.011058324,0.0007789497,0.013892009],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99968386,0.000042324788,0.00002200609,0.000098106066,0.000084605876,0.00006908762],"domain_scores_gemma":[0.9981997,0.00087194925,0.00015686444,0.00035029958,0.00027030433,0.0001508086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023780821,0.00091646076,0.0007651366,0.0016777472,0.0005682969,0.001972147,0.0011336348,0.0007585258,0.014461424],"category_scores_gemma":[0.0032980086,0.0007191388,0.00070394896,0.0017921039,0.00059196446,0.0041684685,0.001868142,0.0012467211,0.0027190605],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008463792,0.00041812845,0.014904658,0.0012160935,0.00015991407,0.0010495029,0.0013715357,0.24986148,0.016004303,0.24636923,0.03457414,0.43322468],"study_design_scores_gemma":[0.00008315072,0.00023893264,0.0026183836,0.0001736009,0.00013564389,0.00034766897,0.0016285379,0.6420314,0.014074497,0.31192994,0.026685908,0.000052347616],"about_ca_topic_score_codex":0.0020592434,"about_ca_topic_score_gemma":0.005519797,"teacher_disagreement_score":0.014461424,"about_ca_system_score_codex":0.00061649457,"about_ca_system_score_gemma":0.00047804133,"threshold_uncertainty_score":0.04837829},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042552214,0.00054127607,0.9515601,0.00022033804,0.00007185738,0.00008849995,0.00031414581,0.0028682097,0.0017835352],"genre_scores_gemma":[0.21014115,0.00061346084,0.784661,0.00016826355,0.00007647217,0.00011411545,0.0011897432,0.0006924776,0.0023433478],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904114,0.0001593044,0.000067977715,0.00017346637,0.00042322252,0.00013475913],"domain_scores_gemma":[0.9975992,0.0012410277,0.00011545211,0.00057064276,0.0003225363,0.00015110444],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00105548,0.001611813,0.0024620618,0.0017493573,0.00089600444,0.0028218103,0.0024440284,0.0017805794,0.007973958],"category_scores_gemma":[0.005553381,0.0009229577,0.0016593989,0.002899177,0.0012889212,0.004217504,0.004222253,0.002043212,0.0014105828],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001246133,0.00019736157,0.0031142335,0.00045270968,0.0002077869,0.000337829,0.000788172,0.28942448,0.02532364,0.04740791,0.011459144,0.6200406],"study_design_scores_gemma":[0.00004787527,0.00010903205,0.00039478572,0.000020368423,0.000027310367,0.0000760398,0.0001639976,0.9706452,0.003671929,0.022612661,0.0022136117,0.000017151717],"about_ca_topic_score_codex":0.0073370314,"about_ca_topic_score_gemma":0.01544284,"teacher_disagreement_score":0.007973958,"about_ca_system_score_codex":0.0008132941,"about_ca_system_score_gemma":0.0009188674,"threshold_uncertainty_score":0.026675582},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09200083,0.0002724856,0.8400152,0.00035633746,0.00041418202,0.0005372498,0.0014197279,0.002131868,0.06285211],"genre_scores_gemma":[0.31869072,0.00039153534,0.649658,0.0001799393,0.00008165097,0.00041123162,0.0023374662,0.0007227621,0.027526658],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99932754,0.00010565917,0.000039297203,0.00010394354,0.00030466152,0.00011891131],"domain_scores_gemma":[0.9993111,0.00012353442,0.000052673546,0.00021955873,0.0002264395,0.00006665523],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030126708,0.00097488123,0.0009669974,0.0012268294,0.0006635971,0.0011065945,0.0010045856,0.00085713336,0.025560452],"category_scores_gemma":[0.001987969,0.0009346869,0.00074117386,0.0011578166,0.00065202534,0.00094084884,0.0022911788,0.0011247027,0.0055696927],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017233117,0.00036830024,0.003195042,0.0006173874,0.00012861911,0.00085495366,0.0003402198,0.072363,0.0945927,0.09972959,0.051056422,0.6750305],"study_design_scores_gemma":[0.0005886761,0.00070864067,0.006287403,0.00023871628,0.00014004674,0.0022847445,0.00077322905,0.6417841,0.113234565,0.10038748,0.13339446,0.00017801323],"about_ca_topic_score_codex":0.0012824343,"about_ca_topic_score_gemma":0.0025243089,"teacher_disagreement_score":0.025560452,"about_ca_system_score_codex":0.000289988,"about_ca_system_score_gemma":0.0007776735,"threshold_uncertainty_score":0.08550817},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012505712,0.000063503554,0.9799437,0.00008424519,0.00010415579,0.00013542437,0.000058348203,0.0032410352,0.0038639659],"genre_scores_gemma":[0.08287455,0.000061162806,0.90993905,0.00007562819,0.0000397516,0.00010917641,0.00041004148,0.0007814912,0.005709102],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99940395,0.000049190334,0.000032433265,0.00013102056,0.0002927673,0.00009072483],"domain_scores_gemma":[0.99895585,0.00036973928,0.000080620244,0.00031239743,0.00020426209,0.0000771212],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045926168,0.0013959934,0.0012992722,0.0012681892,0.0009879086,0.0009657471,0.001469089,0.00096351013,0.014470968],"category_scores_gemma":[0.0017816739,0.00074490474,0.0010594795,0.0010208518,0.00089026196,0.0012469431,0.0023202323,0.0013022306,0.0038265716],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004419888,0.00024628293,0.0006548531,0.0002767027,0.00006708119,0.0002689922,0.00020956888,0.034372065,0.05302154,0.013918835,0.013640426,0.88288164],"study_design_scores_gemma":[0.00039977278,0.0004657283,0.0009416157,0.000038835886,0.00014212786,0.0007749132,0.0002420805,0.84688145,0.074422345,0.046956755,0.028668704,0.00006571127],"about_ca_topic_score_codex":0.0015106335,"about_ca_topic_score_gemma":0.003180962,"teacher_disagreement_score":0.014470968,"about_ca_system_score_codex":0.00039904608,"about_ca_system_score_gemma":0.000936757,"threshold_uncertainty_score":0.048410177},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39568752,0.0019430186,0.5126998,0.0013663473,0.00048252477,0.00022102825,0.00066034065,0.00095930585,0.08598005],"genre_scores_gemma":[0.8853454,0.001291276,0.06749813,0.00033311592,0.00016650611,0.00013578782,0.0006797749,0.00038236903,0.044167496],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99973816,0.000056275607,0.000012710072,0.00005300881,0.00009093729,0.00004886797],"domain_scores_gemma":[0.99911803,0.00039595697,0.00012032586,0.00012757553,0.00013402764,0.000104203886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000350659,0.00043908219,0.0005820259,0.0017658359,0.0010346215,0.001251278,0.0008767028,0.0010831084,0.01144161],"category_scores_gemma":[0.0030982785,0.0005217283,0.000512602,0.0011367623,0.0014903693,0.002064741,0.0018215914,0.0014631609,0.0011601427],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008818522,0.000041318654,0.0007792451,0.00012652228,0.000015647774,0.00020041014,0.00029538025,0.035725933,0.0022277,0.8853899,0.006259599,0.06885019],"study_design_scores_gemma":[0.00001972171,0.000023069377,0.00029949305,0.000028607861,0.000013228009,0.00012672944,0.00016085841,0.056703735,0.00097438024,0.93544316,0.0061957566,0.000011327461],"about_ca_topic_score_codex":0.0015259294,"about_ca_topic_score_gemma":0.0017914565,"teacher_disagreement_score":0.01144161,"about_ca_system_score_codex":0.00055774715,"about_ca_system_score_gemma":0.00033810092,"threshold_uncertainty_score":0.038276017},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5753798,0.0005872324,0.39943048,0.0017641805,0.00021099226,0.00026133077,0.00036583212,0.00083386933,0.02116631],"genre_scores_gemma":[0.86784166,0.00032676055,0.11648814,0.00031889818,0.0000979948,0.0001961303,0.0008194225,0.00033473253,0.013576244],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99585897,0.0010860997,0.00025648327,0.00057294103,0.0016330588,0.0005925553],"domain_scores_gemma":[0.9828095,0.007053165,0.0020803027,0.004955567,0.0019838891,0.0011176748],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028447218,0.00083436375,0.0012151616,0.001622044,0.0015887393,0.0029684275,0.002168318,0.0010093864,0.0054982444],"category_scores_gemma":[0.01887699,0.0006989727,0.00093136885,0.0010129049,0.002101307,0.0040917094,0.0049148044,0.0018020759,0.00071698526],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0029586693,0.00039239053,0.062243327,0.00057948544,0.00058982475,0.0013945329,0.0017675051,0.21131186,0.04699864,0.2712249,0.01856868,0.3819702],"study_design_scores_gemma":[0.00009725819,0.0006862238,0.012436499,0.00019065633,0.00023584488,0.0012655045,0.00075353915,0.76363456,0.051623322,0.14266121,0.026318267,0.000097055825],"about_ca_topic_score_codex":0.0022519908,"about_ca_topic_score_gemma":0.002184417,"teacher_disagreement_score":0.0054982444,"about_ca_system_score_codex":0.0017230946,"about_ca_system_score_gemma":0.0011279575,"threshold_uncertainty_score":0.018393397},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004740053,0.00015536344,0.99172944,0.00005457266,0.000023271303,0.00003749655,0.000012535622,0.00023106075,0.0030161897],"genre_scores_gemma":[0.14663099,0.00034068592,0.8471574,0.000057199428,0.000034953304,0.00031712247,0.000077529105,0.00033174205,0.0050522764],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996979,0.0000982092,0.000014117445,0.000022068862,0.00014963867,0.000018111155],"domain_scores_gemma":[0.9995352,0.00022262064,0.000054525313,0.000116047755,0.000053965523,0.00001754656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008618774,0.00048357103,0.00036797347,0.00043135817,0.0004458136,0.0005326137,0.0007893133,0.00054538785,0.0034210584],"category_scores_gemma":[0.0017952655,0.00029173086,0.00041354133,0.00035838078,0.00094037247,0.00064428867,0.00095631124,0.00088537455,0.0010667101],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000714142,0.00009002627,0.000591998,0.00026788516,0.00002409748,0.0001910615,0.0003183288,0.19257782,0.03304447,0.5691114,0.002528549,0.2011829],"study_design_scores_gemma":[0.000037543992,0.00004292106,0.00014046484,0.000042761392,0.000008916886,0.00009986357,0.000036695033,0.86075485,0.007515427,0.1177997,0.013505023,0.000015869364],"about_ca_topic_score_codex":0.00063095056,"about_ca_topic_score_gemma":0.0012423333,"teacher_disagreement_score":0.0034210584,"about_ca_system_score_codex":0.0003505589,"about_ca_system_score_gemma":0.00061534194,"threshold_uncertainty_score":0.011444628},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016670518,0.0029675588,0.96741945,0.0012441525,0.00033751022,0.00013525698,0.0001513843,0.0012754021,0.009798732],"genre_scores_gemma":[0.31088138,0.0018753238,0.6739623,0.0008352218,0.0006832479,0.000273954,0.0005167071,0.0015935668,0.009378319],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9822666,0.007110037,0.001021466,0.0028451935,0.005630822,0.0011258405],"domain_scores_gemma":[0.9156028,0.057710838,0.0023655626,0.016405655,0.0066836774,0.0012314818],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.018983541,0.001997033,0.0025265997,0.0036520266,0.0023778272,0.0041820337,0.004811789,0.002274472,0.016156245],"category_scores_gemma":[0.11243956,0.0012750869,0.0020109832,0.006632801,0.006879274,0.020288276,0.0073642945,0.005411118,0.0031192696],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002070513,0.00025482455,0.003774743,0.000454189,0.000094086856,0.000119058015,0.0005839126,0.06632575,0.00295796,0.5419789,0.01195083,0.36943528],"study_design_scores_gemma":[0.00021207726,0.0005577201,0.00064614345,0.00022891058,0.00013072207,0.00028751494,0.000255713,0.2669539,0.0076918225,0.7014588,0.021509169,0.000067538116],"about_ca_topic_score_codex":0.004630966,"about_ca_topic_score_gemma":0.0042822855,"teacher_disagreement_score":0.018983541,"about_ca_system_score_codex":0.0032296972,"about_ca_system_score_gemma":0.0032687804,"threshold_uncertainty_score":0.1003958},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06747739,0.00059647363,0.9199116,0.0015993457,0.00017335016,0.00013553517,0.00043464708,0.00019066043,0.009480872],"genre_scores_gemma":[0.6456839,0.0010603563,0.31476858,0.00026324345,0.00039891058,0.00046072362,0.0014431775,0.00047101284,0.035450112],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976927,0.0009500318,0.00011469667,0.0004741148,0.0005337425,0.00023469611],"domain_scores_gemma":[0.99016577,0.0074280202,0.0007343613,0.000560575,0.0005057778,0.0006055714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003549074,0.0010600641,0.0027261325,0.0019503698,0.0019770665,0.0029073127,0.003735152,0.0057713306,0.011724406],"category_scores_gemma":[0.02360287,0.0012941782,0.0019408901,0.0022270542,0.0027274226,0.0065923976,0.0054749288,0.0038583975,0.0011387527],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036258993,0.00013798369,0.0011676428,0.00018011696,0.00006606276,0.00032168414,0.00026520801,0.50755566,0.0005131549,0.45330033,0.0066404366,0.029489135],"study_design_scores_gemma":[0.000047918544,0.00005713431,0.00016581421,0.00002598968,0.000015654772,0.000099970115,0.00010673149,0.71110314,0.0003576672,0.28574708,0.0022480604,0.000024825387],"about_ca_topic_score_codex":0.0050811237,"about_ca_topic_score_gemma":0.0040895375,"teacher_disagreement_score":0.011724406,"about_ca_system_score_codex":0.0017865382,"about_ca_system_score_gemma":0.0017909867,"threshold_uncertainty_score":0.03922206},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022341614,0.00016252467,0.99194664,0.00012980044,0.00007118605,0.00009351404,0.00021369617,0.0017982628,0.0033502216],"genre_scores_gemma":[0.025453389,0.00021407231,0.9681415,0.00007551536,0.00003691298,0.0002472122,0.0012679531,0.0005883731,0.003975162],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99811065,0.0003721521,0.00016598497,0.00028919513,0.0008086407,0.00025341666],"domain_scores_gemma":[0.9962773,0.0016071126,0.00015375232,0.00090610597,0.0009066834,0.00014901278],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011503169,0.0019139698,0.0021332074,0.0033009676,0.0019764598,0.002987572,0.0033835424,0.0017790528,0.01816083],"category_scores_gemma":[0.009587322,0.001327858,0.0019421598,0.0052708457,0.0012376839,0.0039950246,0.0052153934,0.0031125217,0.0078971535],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003080179,0.0001438571,0.0006088276,0.00049596373,0.00006775947,0.00017831638,0.00029384263,0.047895722,0.008375629,0.10627055,0.031542145,0.80381936],"study_design_scores_gemma":[0.0002476415,0.00014512453,0.0005235838,0.00017553807,0.00009813699,0.0005962306,0.00025665446,0.5774638,0.009743664,0.35802314,0.052642066,0.00008449585],"about_ca_topic_score_codex":0.0028271663,"about_ca_topic_score_gemma":0.0049342797,"teacher_disagreement_score":0.01816083,"about_ca_system_score_codex":0.0011414858,"about_ca_system_score_gemma":0.0022136897,"threshold_uncertainty_score":0.060754},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18188164,0.0006014575,0.7935611,0.0003727955,0.000079704376,0.00011374501,0.0005488405,0.0005254467,0.022315286],"genre_scores_gemma":[0.79690486,0.00069235,0.18934706,0.00018552724,0.000059253303,0.00025366258,0.0012448211,0.00033058942,0.010981826],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988416,0.00014382163,0.00009295498,0.00020203723,0.00054873974,0.00017073314],"domain_scores_gemma":[0.99767834,0.0011141071,0.00020633884,0.00039176494,0.0003757679,0.00023362263],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008054264,0.0005102081,0.0015802605,0.002967337,0.0018623201,0.0028292884,0.002235932,0.001264567,0.0064344495],"category_scores_gemma":[0.006707116,0.0008024402,0.001253769,0.0023066644,0.002731206,0.0032281056,0.0064348727,0.0025843286,0.00078150013],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000613513,0.000035101737,0.0005875747,0.000101503225,0.000018917444,0.000077459656,0.00044702584,0.023664102,0.0010809766,0.9359411,0.0015110825,0.03647382],"study_design_scores_gemma":[0.000020605128,0.000023880286,0.00025894665,0.00005154395,0.000016266176,0.00012290532,0.00023783412,0.08479358,0.0011568569,0.9084165,0.0048838546,0.000017127273],"about_ca_topic_score_codex":0.002098172,"about_ca_topic_score_gemma":0.0021380463,"teacher_disagreement_score":0.0064344495,"about_ca_system_score_codex":0.0012975656,"about_ca_system_score_gemma":0.0005834589,"threshold_uncertainty_score":0.021525323},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8167897,0.0004968029,0.16987751,0.0001384253,0.00018329735,0.00033410484,0.0009885558,0.0013778975,0.009813634],"genre_scores_gemma":[0.90585834,0.00026171436,0.08746167,0.00003359734,0.000011339799,0.00011961412,0.0014152841,0.0002613016,0.004577119],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99844176,0.0003573692,0.00010829003,0.00026274394,0.0006817483,0.00014808423],"domain_scores_gemma":[0.9927649,0.0036021245,0.00038675053,0.001995993,0.0010336562,0.0002166723],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008710955,0.0009751985,0.0008313364,0.00091975124,0.00074717944,0.0005435792,0.0016302615,0.00082716317,0.01462192],"category_scores_gemma":[0.006596424,0.00053364196,0.0005188007,0.0015672812,0.00082656596,0.0014653682,0.0013028323,0.000630153,0.0016479761],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00539648,0.002360624,0.0057287607,0.0012154481,0.00018988596,0.0005437941,0.0006248618,0.33093068,0.3057301,0.011687277,0.0037099507,0.3318821],"study_design_scores_gemma":[0.00028599115,0.004431616,0.0041665197,0.00008691672,0.00009873105,0.0006076026,0.0005095972,0.5676162,0.4124463,0.004073274,0.0055996436,0.000077670986],"about_ca_topic_score_codex":0.0016849876,"about_ca_topic_score_gemma":0.001492855,"teacher_disagreement_score":0.01462192,"about_ca_system_score_codex":0.00044901719,"about_ca_system_score_gemma":0.00034200904,"threshold_uncertainty_score":0.048915148},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.060447644,0.00037317342,0.92627096,0.00036736758,0.00005748615,0.00016821998,0.001050711,0.00022146925,0.011042932],"genre_scores_gemma":[0.45526537,0.00078068813,0.5194956,0.00024804575,0.00011002776,0.001002925,0.00447055,0.00082695246,0.017799813],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991435,0.00020416197,0.00004619866,0.00019887245,0.00031367518,0.000093530296],"domain_scores_gemma":[0.9987404,0.00064509804,0.00011292348,0.00017892981,0.00020384346,0.00011894836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071988796,0.001215551,0.0025525473,0.0019819802,0.00092775346,0.002550848,0.0021438652,0.0020121778,0.008558622],"category_scores_gemma":[0.004342048,0.0011925362,0.0010191484,0.0017531468,0.0012668999,0.0024890217,0.003815438,0.0023906776,0.0012196661],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000828484,0.00024518752,0.0012078859,0.00097427814,0.00018393845,0.00035648322,0.0005966057,0.5006463,0.023450218,0.3334627,0.013278202,0.12476973],"study_design_scores_gemma":[0.00007627879,0.00013405294,0.0007745854,0.000103572085,0.00004143537,0.00018037746,0.00015773861,0.8054873,0.004450421,0.18204562,0.0065180124,0.000030645704],"about_ca_topic_score_codex":0.0017275311,"about_ca_topic_score_gemma":0.0018075109,"teacher_disagreement_score":0.008558622,"about_ca_system_score_codex":0.0010158235,"about_ca_system_score_gemma":0.0009224926,"threshold_uncertainty_score":0.028631449},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19162449,0.00079073414,0.7905235,0.0005292948,0.00017729298,0.0002638835,0.0010831498,0.0012065825,0.013801049],"genre_scores_gemma":[0.43552056,0.00054047647,0.5545141,0.00011128193,0.00006389396,0.0001386304,0.0018993128,0.0007953025,0.0064163986],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99897444,0.00021234014,0.00008732241,0.00029057462,0.00029231905,0.00014298433],"domain_scores_gemma":[0.9959561,0.002739945,0.00029278133,0.0004789405,0.00032029397,0.00021186499],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007084247,0.0008647491,0.0017140002,0.0016589471,0.00094969105,0.0024063166,0.0017041944,0.0015372077,0.008363838],"category_scores_gemma":[0.010642525,0.0012867956,0.0011380819,0.0016809521,0.0014173823,0.003140266,0.0032164794,0.0017126431,0.0015649066],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001601674,0.0002817707,0.010200095,0.0016181958,0.0001831371,0.0012147232,0.0019390406,0.3177937,0.021542631,0.23066437,0.020933656,0.39202702],"study_design_scores_gemma":[0.0002092399,0.0002338714,0.0016368037,0.00022748696,0.000081512255,0.0006224764,0.0018720521,0.6462921,0.011070653,0.32292652,0.014780579,0.000046689336],"about_ca_topic_score_codex":0.0015510087,"about_ca_topic_score_gemma":0.0024436088,"teacher_disagreement_score":0.008363838,"about_ca_system_score_codex":0.0006690766,"about_ca_system_score_gemma":0.0005339022,"threshold_uncertainty_score":0.02797985},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44522405,0.0011996623,0.53344905,0.0004977619,0.00006238732,0.00009300854,0.00018718543,0.00032374126,0.018963164],"genre_scores_gemma":[0.9359397,0.00046428858,0.05667684,0.000072797535,0.000046905352,0.00006281768,0.00016566392,0.00016594918,0.0064051086],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99956423,0.000100551384,0.000017717339,0.000099196695,0.0001545625,0.00006371868],"domain_scores_gemma":[0.9983164,0.0007051984,0.0003341153,0.00029731312,0.00020315291,0.0001439117],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072082184,0.00036860266,0.00040160792,0.0012121421,0.0008027767,0.0012838673,0.0006562146,0.0008084217,0.003851256],"category_scores_gemma":[0.006024929,0.0003692202,0.0002861368,0.0004633033,0.0020649012,0.0022226528,0.0016659605,0.0007891238,0.00047647973],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000117323834,0.0000205669,0.0017717761,0.000108303335,0.0000138459145,0.00042811278,0.0006671068,0.0920978,0.015289172,0.8540825,0.0010307565,0.03437272],"study_design_scores_gemma":[0.000031940337,0.000163962,0.0020051491,0.00007294236,0.000019055464,0.00089189026,0.00057408423,0.40083885,0.011448768,0.5718001,0.012115069,0.00003827405],"about_ca_topic_score_codex":0.00088511565,"about_ca_topic_score_gemma":0.0010599974,"teacher_disagreement_score":0.003851256,"about_ca_system_score_codex":0.00053782255,"about_ca_system_score_gemma":0.00022763143,"threshold_uncertainty_score":0.012883782},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38967752,0.00030723898,0.60299456,0.00023127443,0.00006084951,0.000096755946,0.00035119045,0.00057172176,0.0057088654],"genre_scores_gemma":[0.66711414,0.000397439,0.32224652,0.00007312162,0.000048540336,0.00011089196,0.0011320742,0.00024886007,0.008628447],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99972254,0.000045619057,0.000019301555,0.00006573331,0.00009065679,0.000056137666],"domain_scores_gemma":[0.9992187,0.00041959644,0.000073543524,0.0001237887,0.000108366745,0.00005606605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002997995,0.00037714234,0.0005881885,0.00081721257,0.0005433865,0.0010256119,0.00064276974,0.0006086711,0.0029753805],"category_scores_gemma":[0.0019064306,0.0004300462,0.0005979215,0.00058973016,0.0012446601,0.0016579697,0.0014534212,0.0010202145,0.00058625836],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005399105,0.0001323416,0.005876207,0.0005562606,0.0000571483,0.0008823129,0.0011292747,0.15489258,0.06257852,0.5138154,0.0053577204,0.25418228],"study_design_scores_gemma":[0.00009689679,0.00021185225,0.0013934169,0.00009163895,0.00001554184,0.00039521692,0.0005337469,0.305853,0.022121178,0.65789896,0.011355051,0.000033524884],"about_ca_topic_score_codex":0.0009704405,"about_ca_topic_score_gemma":0.001029113,"teacher_disagreement_score":0.0029753805,"about_ca_system_score_codex":0.0005343439,"about_ca_system_score_gemma":0.00040197853,"threshold_uncertainty_score":0.009953618},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7702873,0.00372473,0.19494787,0.00034011176,0.00022318434,0.00023863031,0.0029030286,0.007586318,0.019748826],"genre_scores_gemma":[0.93401986,0.0009089236,0.057724643,0.000042824897,0.000029902982,0.00006261939,0.002248921,0.0016356921,0.0033265343],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99850285,0.0002484935,0.00008778757,0.00027477148,0.0007029562,0.00018304372],"domain_scores_gemma":[0.98901933,0.007064562,0.0006677337,0.0017263379,0.0011741674,0.00034781054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012047298,0.0010307049,0.0009075471,0.0014856565,0.0005197917,0.001066162,0.0013339822,0.0011026604,0.012858129],"category_scores_gemma":[0.009407132,0.0005072578,0.00044838357,0.0015165363,0.0008793017,0.0017482684,0.0013983853,0.00064746983,0.0013791353],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0060514966,0.0025202052,0.0049584885,0.0015257564,0.00014708044,0.000228737,0.000509279,0.097524986,0.5740397,0.0046841647,0.0075463355,0.30026382],"study_design_scores_gemma":[0.00034957172,0.0017199098,0.008780927,0.00011953038,0.00019780755,0.0004409945,0.00042247443,0.3978185,0.5832562,0.0034423799,0.003375143,0.0000765841],"about_ca_topic_score_codex":0.0031755012,"about_ca_topic_score_gemma":0.0019491322,"teacher_disagreement_score":0.012858129,"about_ca_system_score_codex":0.00039434512,"about_ca_system_score_gemma":0.0004600017,"threshold_uncertainty_score":0.043014705},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.099502176,0.00035084345,0.8907777,0.00025813555,0.00004801078,0.00009260712,0.0013070246,0.0012169721,0.0064466326],"genre_scores_gemma":[0.50994426,0.00065386645,0.4791142,0.000075734475,0.00007013364,0.00015730562,0.0026479217,0.00027355633,0.007062933],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994879,0.00014680957,0.000030665906,0.00012128845,0.000116001436,0.00009737365],"domain_scores_gemma":[0.99786514,0.0012690012,0.00031649446,0.00024706984,0.00017635524,0.00012591334],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067166914,0.00075598276,0.0008040024,0.0010988158,0.00065253815,0.0016714361,0.0015425244,0.0013063175,0.0067528654],"category_scores_gemma":[0.005959995,0.00086432113,0.0006586833,0.0023259216,0.00067443086,0.0021051373,0.0014459485,0.0006875811,0.0010308174],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011752895,0.00003325125,0.0016502879,0.00010080395,0.000026096817,0.00026553794,0.000109758184,0.9371604,0.0013736708,0.03007013,0.002508533,0.026583944],"study_design_scores_gemma":[0.000044744116,0.000042999887,0.00033778415,0.000014743088,0.000016691678,0.00010958802,0.00010234317,0.9524035,0.0010258242,0.041302107,0.004581035,0.000018668636],"about_ca_topic_score_codex":0.0039362037,"about_ca_topic_score_gemma":0.0060751806,"teacher_disagreement_score":0.0067528654,"about_ca_system_score_codex":0.0008369041,"about_ca_system_score_gemma":0.0007478587,"threshold_uncertainty_score":0.022590637},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.096165165,0.00012757292,0.90069264,0.0001211158,0.000025094183,0.000061937106,0.00006690378,0.00031660774,0.00242297],"genre_scores_gemma":[0.67370635,0.00016770986,0.32197967,0.0000544603,0.000037970425,0.00009046276,0.0002717531,0.00016419133,0.0035274257],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99960834,0.00006353968,0.000021485146,0.00008246299,0.00018092369,0.00004329065],"domain_scores_gemma":[0.998838,0.00045855792,0.00016665636,0.00017581483,0.0002442435,0.000116728974],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080475013,0.00048796154,0.0005254403,0.0017374065,0.0005408118,0.0015308288,0.00066413585,0.00069016614,0.0022887057],"category_scores_gemma":[0.0050857374,0.00031178838,0.00050929096,0.0004203754,0.0013482653,0.0014784498,0.0019138231,0.0011979069,0.0005284756],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00057152484,0.00007887399,0.0075113564,0.00016644405,0.000043588778,0.0004937551,0.0008035766,0.3593281,0.0392684,0.41056347,0.0026583534,0.17851253],"study_design_scores_gemma":[0.000017048298,0.00006580925,0.0006454866,0.000019243655,0.0000053494755,0.00014174239,0.000057976406,0.9294942,0.005645317,0.06111293,0.0027790656,0.000015880067],"about_ca_topic_score_codex":0.0014611823,"about_ca_topic_score_gemma":0.0010731764,"teacher_disagreement_score":0.0022887057,"about_ca_system_score_codex":0.0007490095,"about_ca_system_score_gemma":0.000533674,"threshold_uncertainty_score":0.007656455},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003238823,0.000046765268,0.99495417,0.000020656002,0.000012769998,0.000028209777,0.000031588148,0.00048413736,0.0011828839],"genre_scores_gemma":[0.07506392,0.00023963593,0.920919,0.000036702113,0.000025637677,0.0001459931,0.00033428954,0.0005670449,0.002667761],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992842,0.0001457316,0.00003416397,0.00010941295,0.00035489578,0.000071645634],"domain_scores_gemma":[0.997891,0.0011649176,0.00012280459,0.0003456374,0.00038294052,0.000092754555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011252456,0.0014439821,0.0011236287,0.0020038977,0.0008469215,0.002260271,0.0026465144,0.0013820765,0.00699872],"category_scores_gemma":[0.007023825,0.0011413438,0.001444517,0.0021495945,0.001297793,0.002571279,0.0034926678,0.0026224211,0.0022618135],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039405603,0.00012845402,0.0011281775,0.00033628885,0.00007225456,0.00013203088,0.00047734354,0.4218151,0.008549061,0.18081006,0.005538492,0.3806187],"study_design_scores_gemma":[0.00004858142,0.000036802667,0.000083507366,0.000024731506,0.000015892476,0.00004968173,0.00007390755,0.9349227,0.0030773163,0.058513727,0.0031392276,0.000013996413],"about_ca_topic_score_codex":0.0022930936,"about_ca_topic_score_gemma":0.003974451,"teacher_disagreement_score":0.00699872,"about_ca_system_score_codex":0.0008826879,"about_ca_system_score_gemma":0.000933698,"threshold_uncertainty_score":0.023413062},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06132705,0.0012293046,0.9341455,0.00094400503,0.00018751585,0.00009588495,0.00034713288,0.00074578373,0.0009778995],"genre_scores_gemma":[0.70870686,0.0012853672,0.28387472,0.0003532032,0.00088502344,0.00030865686,0.0014588285,0.00035712478,0.0027702677],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99732345,0.0008334891,0.00015876592,0.00058975106,0.00078409055,0.00031053],"domain_scores_gemma":[0.9833301,0.011640717,0.0018205403,0.0011272099,0.0014502124,0.0006312645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045796144,0.001486277,0.003318005,0.0013830338,0.0011767144,0.0021724706,0.0034929563,0.003279426,0.0017338499],"category_scores_gemma":[0.026090875,0.00097140024,0.0010069866,0.0029228493,0.0021240453,0.005936329,0.0033038838,0.002472256,0.0005386406],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013935964,0.00020736811,0.0055438597,0.00042586177,0.0001381181,0.0006336088,0.0004546428,0.87214756,0.002813418,0.040435944,0.008112846,0.06769321],"study_design_scores_gemma":[0.000044213182,0.000100880636,0.00033358874,0.00001381218,0.000014358629,0.00010761775,0.000071135066,0.9720713,0.0010974101,0.025170242,0.00095787435,0.000017597342],"about_ca_topic_score_codex":0.0028602825,"about_ca_topic_score_gemma":0.0014983267,"teacher_disagreement_score":0.0045796144,"about_ca_system_score_codex":0.0011630607,"about_ca_system_score_gemma":0.0007784053,"threshold_uncertainty_score":0.024219632},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008545138,0.00027950894,0.9871701,0.00017534212,0.000065409804,0.00006382029,0.000056669694,0.00015878651,0.0034851695],"genre_scores_gemma":[0.14836949,0.00047057038,0.8439097,0.0001295131,0.000055477365,0.0003851175,0.00027313453,0.00014572259,0.0062613217],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99971,0.000084616804,0.000017936154,0.00004315029,0.00010201178,0.000042228203],"domain_scores_gemma":[0.9991732,0.00057295954,0.000050269755,0.0000669162,0.00009343938,0.000043277458],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008874967,0.00066539785,0.0009249755,0.00070843654,0.0007569708,0.00077672664,0.001281762,0.0018579689,0.006633442],"category_scores_gemma":[0.0037644333,0.0004519706,0.0005495454,0.0007915195,0.0009590521,0.0016561332,0.0026973537,0.0011472108,0.0012358839],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011931691,0.000069055,0.0009263543,0.00033839518,0.000056302975,0.00023174899,0.0003067307,0.7909823,0.0029787086,0.10777635,0.0046914066,0.09152329],"study_design_scores_gemma":[0.00003361575,0.000031199263,0.00007430576,0.000016324928,0.000005632905,0.000043182787,0.00005435216,0.96006894,0.00065012916,0.036151104,0.0028623734,0.00000889827],"about_ca_topic_score_codex":0.0038071263,"about_ca_topic_score_gemma":0.0038574245,"teacher_disagreement_score":0.006633442,"about_ca_system_score_codex":0.000595333,"about_ca_system_score_gemma":0.00089702697,"threshold_uncertainty_score":0.022191048},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23045975,0.00084211945,0.7283008,0.00095989427,0.00014273652,0.00019395603,0.001016861,0.0005347877,0.037549175],"genre_scores_gemma":[0.60616505,0.0014675383,0.36533886,0.00028163183,0.00014799008,0.00032938126,0.002468772,0.0005233705,0.02327734],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99897635,0.00038271668,0.000043131575,0.00020659882,0.00027482316,0.00011643049],"domain_scores_gemma":[0.99633586,0.0019289878,0.00040130105,0.000513655,0.00049783965,0.0003222849],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077452883,0.0010900493,0.000725012,0.0017674471,0.0010002651,0.0027145788,0.0022127368,0.0017205905,0.010727489],"category_scores_gemma":[0.0070430594,0.0010700199,0.0008934486,0.0017302837,0.0012836251,0.0039353417,0.001850854,0.0022399484,0.0011029452],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015125687,0.000074389885,0.001009595,0.00022792304,0.000033167616,0.00024257538,0.00039191818,0.033908315,0.0046641617,0.9039891,0.006144463,0.04916315],"study_design_scores_gemma":[0.000064633416,0.00006867277,0.00068347435,0.000072852,0.000038367798,0.00033061125,0.00023952516,0.12187109,0.0028199274,0.8617967,0.01198836,0.000025901254],"about_ca_topic_score_codex":0.0011526769,"about_ca_topic_score_gemma":0.0021965913,"teacher_disagreement_score":0.010727489,"about_ca_system_score_codex":0.0011561916,"about_ca_system_score_gemma":0.0004620285,"threshold_uncertainty_score":0.035887063},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033568893,0.00014532809,0.9631083,0.00013206604,0.00003941754,0.00006195492,0.00008608375,0.0005707177,0.002287192],"genre_scores_gemma":[0.37113777,0.000115665265,0.62479156,0.000054369757,0.000041637788,0.00022593136,0.00029539736,0.00016261994,0.0031750111],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99903834,0.00020259782,0.000041433414,0.0002462698,0.0003519956,0.00011935115],"domain_scores_gemma":[0.99835193,0.00084756414,0.00016523735,0.00021503301,0.0003117507,0.00010861361],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008403507,0.00097101304,0.0016896294,0.0021933643,0.00079076184,0.001310416,0.0017233931,0.0024763225,0.004975868],"category_scores_gemma":[0.005647219,0.0008612859,0.0009643334,0.0017292104,0.000867778,0.0020393613,0.0030481422,0.0010178486,0.0011775246],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00096533063,0.00020817415,0.0033586859,0.00027137736,0.00011486387,0.00047650764,0.00033681226,0.6414464,0.020008676,0.023285802,0.0057552094,0.30377212],"study_design_scores_gemma":[0.000027415572,0.00014111002,0.0002054116,0.000014481643,0.000013356059,0.00011252052,0.00007157077,0.9865726,0.004591087,0.006846156,0.0013897889,0.000014399234],"about_ca_topic_score_codex":0.001460463,"about_ca_topic_score_gemma":0.0012908488,"teacher_disagreement_score":0.004975868,"about_ca_system_score_codex":0.00080421544,"about_ca_system_score_gemma":0.0008973932,"threshold_uncertainty_score":0.016645908},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07025102,0.0015988249,0.90742505,0.0011277647,0.00021746597,0.00012826663,0.0005847068,0.00078909076,0.017877862],"genre_scores_gemma":[0.71866345,0.0021042756,0.26131082,0.0006384671,0.000357505,0.00031588573,0.0015887672,0.0014560055,0.013564748],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99238443,0.0018397714,0.00043387868,0.0010340776,0.0030967854,0.0012109424],"domain_scores_gemma":[0.9674758,0.019093003,0.001692371,0.006975294,0.0030903188,0.0016731734],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044631246,0.002345674,0.002149212,0.0032282774,0.0021248802,0.005623329,0.0055279173,0.0026303164,0.011710088],"category_scores_gemma":[0.042122096,0.001873538,0.0016936798,0.0032104754,0.004484251,0.012558489,0.013846104,0.0057882704,0.0027451538],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016087552,0.00019059518,0.0035106188,0.00077970047,0.00011056638,0.00024903452,0.0011232962,0.29199114,0.009597778,0.58283406,0.009278641,0.09872579],"study_design_scores_gemma":[0.00007507679,0.0001548351,0.00075842877,0.000118961565,0.000053891577,0.00021165267,0.00027590315,0.42796466,0.006865452,0.5571174,0.0063532265,0.00005050079],"about_ca_topic_score_codex":0.0019203685,"about_ca_topic_score_gemma":0.0040268917,"teacher_disagreement_score":0.011710088,"about_ca_system_score_codex":0.0020747858,"about_ca_system_score_gemma":0.0011475283,"threshold_uncertainty_score":0.03917414},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20628558,0.00012027207,0.7899636,0.00012463583,0.000027740612,0.000062075706,0.000103096114,0.0011645851,0.0021483114],"genre_scores_gemma":[0.71607405,0.00010841263,0.28128695,0.000017584129,0.0000193376,0.00004452569,0.00035016058,0.00028042003,0.0018183858],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994991,0.00007091673,0.000028989789,0.00012418957,0.00015636648,0.00012056683],"domain_scores_gemma":[0.99797314,0.0008348203,0.00030720799,0.0005762974,0.00020223827,0.00010636758],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059876894,0.00034674795,0.0005855252,0.0005293165,0.00065823586,0.00093808793,0.0012366169,0.0004661117,0.002261678],"category_scores_gemma":[0.004563052,0.0004484248,0.0005637116,0.0006179794,0.00065114384,0.0018943631,0.0012982999,0.00055303314,0.0003405144],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0022706443,0.0001984483,0.016913071,0.00036120295,0.000101530844,0.0015162796,0.0018671228,0.4347205,0.12835288,0.050065406,0.004235894,0.3593971],"study_design_scores_gemma":[0.00003647932,0.00014631065,0.0017624971,0.000015805257,0.000038282316,0.00016096936,0.00022575274,0.9546184,0.031502403,0.008029363,0.0034427156,0.000021043903],"about_ca_topic_score_codex":0.0045239436,"about_ca_topic_score_gemma":0.00307778,"teacher_disagreement_score":0.0045239436,"about_ca_system_score_codex":0.00044813167,"about_ca_system_score_gemma":0.0005000605,"threshold_uncertainty_score":0.008995175},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.062628254,0.00071263604,0.9337693,0.00021745988,0.000033824035,0.00003179308,0.00011780028,0.0005716485,0.0019172521],"genre_scores_gemma":[0.3267605,0.000633307,0.67003566,0.00005301276,0.00009005134,0.00013589878,0.00043169767,0.0003213822,0.0015385067],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99919575,0.00019024905,0.000054036067,0.00016882061,0.00029955394,0.00009147804],"domain_scores_gemma":[0.99585223,0.002802695,0.00045674355,0.00036994496,0.0003297606,0.00018861418],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018566729,0.0012408013,0.0014114475,0.0013047428,0.00034489526,0.0009785206,0.0017430643,0.0012700447,0.0011307088],"category_scores_gemma":[0.0127878105,0.0007020025,0.00081099727,0.0011446172,0.0009180536,0.003035671,0.0019654965,0.0010738703,0.0004909685],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006591577,0.000106111096,0.004461686,0.00036163186,0.00005338106,0.00015406054,0.00025285414,0.79607147,0.01069506,0.06681596,0.0039561237,0.11641248],"study_design_scores_gemma":[0.000031481788,0.00004557388,0.00041413243,0.000015885176,0.000009704118,0.00006754017,0.000025466883,0.9736719,0.0029134925,0.02198331,0.00080832845,0.000013292449],"about_ca_topic_score_codex":0.001718797,"about_ca_topic_score_gemma":0.0014875598,"teacher_disagreement_score":0.0018566729,"about_ca_system_score_codex":0.0007810505,"about_ca_system_score_gemma":0.0007188435,"threshold_uncertainty_score":0.00981915},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042562302,0.00031687433,0.7110373,0.00043181176,0.0012854086,0.00037464398,0.00087671465,0.0067740604,0.23634088],"genre_scores_gemma":[0.494801,0.00059661875,0.2917702,0.0005207311,0.0002481708,0.0004252512,0.002340042,0.0032010458,0.20609689],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99933124,0.00006320133,0.000034946457,0.0002043174,0.00028424643,0.00008212092],"domain_scores_gemma":[0.99921393,0.000097916316,0.00008663248,0.00025095593,0.00027169526,0.00007887533],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025229255,0.0011012586,0.00039997458,0.0014686532,0.0010831227,0.0014340626,0.0010030479,0.00089885865,0.076483265],"category_scores_gemma":[0.001394156,0.00051365554,0.00041362393,0.0009650445,0.0008397391,0.0019222522,0.0016875,0.0016915584,0.019048333],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00050160446,0.00015673974,0.0012096735,0.0003222787,0.000035292735,0.0007836315,0.00048291212,0.024664734,0.058139905,0.2769908,0.043164983,0.59354734],"study_design_scores_gemma":[0.00013750908,0.0005655756,0.0013250725,0.00017469395,0.000053703116,0.0012891244,0.0006279677,0.099016935,0.16723031,0.12189636,0.6075857,0.00009699898],"about_ca_topic_score_codex":0.0006539246,"about_ca_topic_score_gemma":0.0008436824,"teacher_disagreement_score":0.076483265,"about_ca_system_score_codex":0.0003688807,"about_ca_system_score_gemma":0.0004280193,"threshold_uncertainty_score":0.255862},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026100665,0.001050337,0.9509411,0.0001456145,0.00017153966,0.000035448837,0.00011847512,0.0013987215,0.020038128],"genre_scores_gemma":[0.29338285,0.0009938843,0.67760396,0.00017081518,0.00018371745,0.00012786975,0.0005389009,0.0008086089,0.02618953],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997944,0.000040816893,0.000009429779,0.00004030783,0.0000742935,0.000040781448],"domain_scores_gemma":[0.9997644,0.000059799844,0.00001964974,0.00007189942,0.00005053765,0.000033750104],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025328554,0.0011006696,0.0008076444,0.00083198154,0.00042697336,0.00083567016,0.0009024496,0.0005628145,0.009404919],"category_scores_gemma":[0.0007754361,0.00037227073,0.00049921114,0.0013462001,0.00033734573,0.0015554307,0.001711582,0.0009996593,0.0028674353],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012046298,0.00038508154,0.0005574092,0.00036521812,0.00006296844,0.0002836047,0.00028314526,0.06827708,0.09828844,0.15885393,0.027509598,0.6439289],"study_design_scores_gemma":[0.00011406396,0.00025228047,0.00049615756,0.000041460415,0.000056601395,0.00041801197,0.00014351237,0.7717748,0.04491201,0.15909967,0.022642735,0.000048664355],"about_ca_topic_score_codex":0.00026464654,"about_ca_topic_score_gemma":0.00049777207,"teacher_disagreement_score":0.009404919,"about_ca_system_score_codex":0.00021946174,"about_ca_system_score_gemma":0.00024186358,"threshold_uncertainty_score":0.03146261},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013514719,0.000798613,0.9479521,0.0003352126,0.00015061854,0.00007381488,0.00022903134,0.001378567,0.035567306],"genre_scores_gemma":[0.36232886,0.001397206,0.59602845,0.000267,0.00017209783,0.00022950237,0.0010617357,0.0012600033,0.037255168],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99955696,0.000079136094,0.000018065135,0.00008687348,0.00020365478,0.000055270455],"domain_scores_gemma":[0.9996008,0.00014954295,0.00003188919,0.00011453113,0.00007536421,0.000027898135],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034698803,0.00065915333,0.0010654138,0.0009807718,0.00055796094,0.0009769431,0.0014541397,0.0012350202,0.0074622296],"category_scores_gemma":[0.0027436295,0.0006199861,0.00046904155,0.001075741,0.0008774754,0.0017698364,0.003492676,0.0012854682,0.001841411],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035986624,0.00008205685,0.00033299363,0.00046352373,0.000048020298,0.00016607982,0.00031729203,0.2376583,0.020469794,0.3417793,0.028054463,0.37026832],"study_design_scores_gemma":[0.000046948484,0.0000385414,0.00014728721,0.00004044909,0.000017406446,0.00020337343,0.00005177565,0.73090905,0.004939412,0.25027487,0.013310981,0.000019925761],"about_ca_topic_score_codex":0.0016585452,"about_ca_topic_score_gemma":0.001576029,"teacher_disagreement_score":0.0074622296,"about_ca_system_score_codex":0.0006763242,"about_ca_system_score_gemma":0.00060848496,"threshold_uncertainty_score":0.024963677},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04387821,0.0008263972,0.86729884,0.00090285466,0.0004062641,0.00008068546,0.00028083383,0.0010837828,0.0852422],"genre_scores_gemma":[0.52412057,0.0022086108,0.33696827,0.00082018063,0.0005611258,0.00023692854,0.0011044203,0.0029181603,0.1310617],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992525,0.00019924728,0.00003457601,0.00014211668,0.00028717972,0.000084377796],"domain_scores_gemma":[0.9985083,0.0006451182,0.0000710671,0.00045033547,0.00023265567,0.000092496826],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000704595,0.0010063646,0.001191932,0.001980873,0.0015757752,0.0018459414,0.0010426289,0.0009103353,0.017141165],"category_scores_gemma":[0.0057529733,0.00061353826,0.0009931201,0.0018618434,0.001794511,0.0045283413,0.004739283,0.0027774044,0.00447072],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000065856504,0.000030246514,0.00021406745,0.00006555047,0.000016402942,0.00009131993,0.00031316534,0.010688556,0.0018973638,0.9134173,0.008714204,0.06448587],"study_design_scores_gemma":[0.000012825345,0.000024909596,0.00013999782,0.0000201848,0.000017643144,0.00010453262,0.000068691465,0.046600346,0.0018849198,0.9231081,0.028006703,0.000011207661],"about_ca_topic_score_codex":0.0020652844,"about_ca_topic_score_gemma":0.0019743117,"teacher_disagreement_score":0.017141165,"about_ca_system_score_codex":0.00080950896,"about_ca_system_score_gemma":0.00043588105,"threshold_uncertainty_score":0.057342887},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7657931,0.0004965631,0.22769462,0.00061979645,0.000035891033,0.000053316817,0.0003299109,0.0003665303,0.004610241],"genre_scores_gemma":[0.98271495,0.00019144692,0.01586004,0.000037919017,0.000029455923,0.00006979266,0.0003444387,0.00011402158,0.0006379921],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99824214,0.0005169275,0.00007716155,0.0003290244,0.00062344386,0.00021135987],"domain_scores_gemma":[0.935215,0.053832285,0.004574582,0.0022296242,0.002293992,0.0018545326],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025766569,0.00062596356,0.00085699424,0.0017169537,0.0006384903,0.0020976157,0.0015632698,0.0012345533,0.0029532462],"category_scores_gemma":[0.046141654,0.00066722895,0.00040534456,0.0007269401,0.0024342777,0.004431404,0.0017749522,0.001213222,0.00026223806],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012009129,0.00033731555,0.03797196,0.0004749328,0.00012364105,0.0015780966,0.00084763125,0.5868412,0.073646285,0.25918502,0.0025699895,0.035222996],"study_design_scores_gemma":[0.000045952558,0.00014907,0.0064942264,0.00003912172,0.000019909632,0.00077542174,0.000145113,0.924212,0.01654237,0.050986834,0.0005266982,0.00006339228],"about_ca_topic_score_codex":0.0007408211,"about_ca_topic_score_gemma":0.00035305702,"teacher_disagreement_score":0.0029532462,"about_ca_system_score_codex":0.0014373604,"about_ca_system_score_gemma":0.0005622143,"threshold_uncertainty_score":0.0136268735},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06342205,0.0013956038,0.9322438,0.00045554736,0.00008412229,0.000041827923,0.00010038303,0.00037186118,0.0018847318],"genre_scores_gemma":[0.6616038,0.0024059864,0.327165,0.00016689693,0.00027554636,0.00028450607,0.000451278,0.00034092754,0.0073060095],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99908555,0.000254404,0.00006147583,0.0002863188,0.00019380117,0.00011852693],"domain_scores_gemma":[0.9947397,0.0039896374,0.00046776352,0.00037264937,0.00020278794,0.0002274698],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020180284,0.0013692896,0.0019194384,0.0009076089,0.00050546305,0.0014863252,0.0017502151,0.0015897395,0.002701149],"category_scores_gemma":[0.009185926,0.00085942657,0.00095385016,0.0015151622,0.0014043079,0.0039609154,0.0020724444,0.0019750013,0.00044717386],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003028058,0.000059868496,0.0008827244,0.00015628246,0.00007970003,0.0001275212,0.0001006984,0.8778149,0.0023702965,0.078381196,0.0015868787,0.038137097],"study_design_scores_gemma":[0.00001522,0.000030503254,0.00010603697,0.000006171633,0.00000664621,0.0000131204115,0.000009518948,0.974116,0.0004373206,0.024826348,0.00042868147,0.0000043513473],"about_ca_topic_score_codex":0.0034424819,"about_ca_topic_score_gemma":0.0014267837,"teacher_disagreement_score":0.0034424819,"about_ca_system_score_codex":0.0013590145,"about_ca_system_score_gemma":0.0006686434,"threshold_uncertainty_score":0.01067251},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05852039,0.00053328386,0.9302877,0.00089577277,0.00007187581,0.00021286696,0.00040891935,0.00083739613,0.008231785],"genre_scores_gemma":[0.596766,0.00061348756,0.39282614,0.00035273228,0.00029242647,0.00046660946,0.0019844514,0.0005045049,0.0061935824],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99557436,0.0009931717,0.00022016485,0.0009176213,0.0017315242,0.00056317064],"domain_scores_gemma":[0.9713865,0.019961575,0.002152425,0.00399519,0.0018041836,0.0007001559],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035336458,0.0012067604,0.0013082374,0.0015760658,0.0012316974,0.0035413203,0.0036617597,0.0015615426,0.008294555],"category_scores_gemma":[0.035498794,0.00097809,0.0023133394,0.0017024988,0.0036155495,0.007838904,0.0047903545,0.004204711,0.0014263135],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012730432,0.00024870943,0.010376813,0.0005166245,0.00020280525,0.000432493,0.0006356835,0.60244495,0.017643683,0.2248571,0.012114439,0.12925366],"study_design_scores_gemma":[0.000023231858,0.000045706798,0.0011283805,0.000022899925,0.000032377422,0.000109821456,0.00006164463,0.93656117,0.0030814616,0.057593267,0.0013263677,0.000013773494],"about_ca_topic_score_codex":0.003937488,"about_ca_topic_score_gemma":0.003136007,"teacher_disagreement_score":0.008294555,"about_ca_system_score_codex":0.003505262,"about_ca_system_score_gemma":0.0018191212,"threshold_uncertainty_score":0.027748048},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011919532,0.00007620451,0.9871826,0.00003679668,0.000008310908,0.000020996149,0.00007692687,0.00032038652,0.00035822543],"genre_scores_gemma":[0.311125,0.00033845365,0.6843989,0.00007787359,0.00007780434,0.00018605766,0.0012979886,0.00035111816,0.0021468098],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976649,0.000568117,0.00012485268,0.0004955899,0.0009671155,0.00017941085],"domain_scores_gemma":[0.99392396,0.0028864592,0.00082816754,0.0017451717,0.00044432393,0.00017184309],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022761563,0.0008356129,0.0019850566,0.0021788816,0.00077621604,0.0015167125,0.0028391476,0.0010591495,0.0022647036],"category_scores_gemma":[0.013844443,0.0009973039,0.0014256318,0.0024336237,0.0015679327,0.0025783498,0.0022762085,0.0022416764,0.00076546514],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002081535,0.0000456727,0.0025299808,0.000120906,0.00009046334,0.00018338833,0.00017789411,0.812744,0.009039699,0.022757944,0.0012005003,0.15090133],"study_design_scores_gemma":[0.000005471035,0.000025597377,0.00028019794,0.0000074554023,0.0000066609005,0.000060920494,0.000018190076,0.9887158,0.001994919,0.0076688183,0.0012063272,0.000009589063],"about_ca_topic_score_codex":0.0038325253,"about_ca_topic_score_gemma":0.0039048824,"teacher_disagreement_score":0.0038325253,"about_ca_system_score_codex":0.0010876708,"about_ca_system_score_gemma":0.0013086507,"threshold_uncertainty_score":0.012037575},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04700812,0.0003978353,0.938763,0.0005843039,0.00017453637,0.00008717048,0.00018001423,0.00038474408,0.012420243],"genre_scores_gemma":[0.56648797,0.00028452434,0.42378014,0.00021898314,0.000119998695,0.00017447473,0.00025304974,0.00049173244,0.0081891185],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99961877,0.00011978526,0.000016680307,0.00010714282,0.00009775684,0.00003987703],"domain_scores_gemma":[0.9989863,0.0006824279,0.00006153671,0.000081923805,0.00011189928,0.00007585151],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00091042765,0.00080778636,0.0016186652,0.00065018417,0.00049088546,0.0012656925,0.00148954,0.0026303339,0.005361234],"category_scores_gemma":[0.0044554723,0.00079796836,0.0006015822,0.0005785597,0.00097286777,0.0010905213,0.0020203632,0.0010963613,0.0006279076],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000096978656,0.000042361786,0.00026129858,0.00009323714,0.000016498285,0.00010887539,0.00003997601,0.9578908,0.0022952245,0.016324272,0.0018761109,0.020954348],"study_design_scores_gemma":[0.000009856253,0.000021947742,0.000030947143,0.0000057642046,0.000003837859,0.000018406497,0.000005212653,0.99615127,0.00030681244,0.002877637,0.00056526775,0.0000030225629],"about_ca_topic_score_codex":0.0021694172,"about_ca_topic_score_gemma":0.0016496079,"teacher_disagreement_score":0.005361234,"about_ca_system_score_codex":0.00077464175,"about_ca_system_score_gemma":0.0007180893,"threshold_uncertainty_score":0.017935097},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017130878,0.00009800115,0.979737,0.00016899509,0.000025182655,0.000045922538,0.000058579128,0.0005237533,0.0022116387],"genre_scores_gemma":[0.16716328,0.00012206413,0.8297279,0.00006293518,0.00002420326,0.00010832603,0.00020335788,0.0001167894,0.0024712023],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99963355,0.00005599013,0.000020081408,0.00009369146,0.00014676937,0.000049807015],"domain_scores_gemma":[0.9995403,0.00016555605,0.000047401718,0.000118268836,0.00009446449,0.000033945653],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027242902,0.0006185955,0.00078835414,0.00045108373,0.0007284939,0.0005854576,0.0011891451,0.0006331538,0.002478584],"category_scores_gemma":[0.00090815173,0.00043280804,0.0004990993,0.000981788,0.00073789747,0.0010916205,0.001104048,0.0007222346,0.00063013233],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029641922,0.000113254544,0.00086277135,0.00010550527,0.000044583852,0.00016830857,0.00011141899,0.75028807,0.021260535,0.01786228,0.003925945,0.20496084],"study_design_scores_gemma":[0.000031560827,0.000027438182,0.00009042161,0.0000015856975,0.0000045698,0.000033689405,0.000010559564,0.9887705,0.0050670397,0.0046998197,0.0012568359,0.000006042372],"about_ca_topic_score_codex":0.0030173627,"about_ca_topic_score_gemma":0.0035398635,"teacher_disagreement_score":0.0030173627,"about_ca_system_score_codex":0.00083367265,"about_ca_system_score_gemma":0.00083504844,"threshold_uncertainty_score":0.008291662},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09316052,0.0002354638,0.90099406,0.000120483775,0.00007131902,0.00008712468,0.00020213173,0.00080590264,0.0043230676],"genre_scores_gemma":[0.6597488,0.00020637005,0.33594343,0.00006708179,0.000030067025,0.00007604792,0.00057202193,0.0003167692,0.0030393691],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99919635,0.00015923161,0.000052475276,0.00012583374,0.0003779211,0.00008809318],"domain_scores_gemma":[0.9983242,0.0005234716,0.00014773673,0.000523251,0.00038659532,0.00009486176],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008242308,0.00038824763,0.0009913094,0.0020866233,0.00048180766,0.0015919844,0.0013309352,0.0011283186,0.005347982],"category_scores_gemma":[0.0083281,0.0004960433,0.00052722736,0.0017093428,0.0006761998,0.0022418802,0.0025087208,0.0007945441,0.00087939465],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010867344,0.0002320446,0.004041763,0.00032480364,0.00010938193,0.00037339632,0.00048207934,0.315139,0.028385995,0.13225968,0.006958394,0.51060677],"study_design_scores_gemma":[0.000031326446,0.00009127351,0.0005305525,0.000022521543,0.000016601593,0.00015307713,0.00011142483,0.9449824,0.005056416,0.04560723,0.0033843778,0.000012802001],"about_ca_topic_score_codex":0.0018770815,"about_ca_topic_score_gemma":0.001963707,"teacher_disagreement_score":0.005347982,"about_ca_system_score_codex":0.0007030995,"about_ca_system_score_gemma":0.00053550815,"threshold_uncertainty_score":0.017890811},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16624077,0.00038951746,0.81982785,0.00021305656,0.000032872525,0.0001537762,0.00030913253,0.00053618295,0.012296895],"genre_scores_gemma":[0.45051894,0.00030372632,0.54223734,0.00008307571,0.000018177489,0.0001587674,0.000829564,0.00016833063,0.0056820777],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99916816,0.00016752555,0.000057400208,0.00021764245,0.00026456296,0.00012473317],"domain_scores_gemma":[0.99852353,0.000601907,0.00021076758,0.00037312252,0.00017372522,0.00011692271],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045962082,0.0004138665,0.0005334205,0.00043658548,0.00038193184,0.00054028165,0.0007536425,0.0004834662,0.004493834],"category_scores_gemma":[0.0036770795,0.00053616497,0.00047827946,0.0007199041,0.0005710846,0.0014517101,0.0024356015,0.00057043665,0.0007158076],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00076790334,0.00014327264,0.0074476916,0.00062358665,0.00008194801,0.00064616883,0.001063376,0.3679996,0.05503817,0.18446687,0.0058472403,0.3758741],"study_design_scores_gemma":[0.00015528509,0.00042913837,0.0030650669,0.00011964364,0.00003984113,0.0010075453,0.0004865319,0.75197256,0.04832007,0.16632716,0.02803076,0.00004636675],"about_ca_topic_score_codex":0.0015061636,"about_ca_topic_score_gemma":0.0025486131,"teacher_disagreement_score":0.004493834,"about_ca_system_score_codex":0.00045592894,"about_ca_system_score_gemma":0.00043318095,"threshold_uncertainty_score":0.015033364},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10565527,0.0009788373,0.8045323,0.0011480858,0.00043383235,0.00007307932,0.00024696163,0.000333713,0.086597934],"genre_scores_gemma":[0.7541411,0.0019108746,0.20741136,0.0004937787,0.00036668484,0.00011731515,0.0004707303,0.00055516756,0.03453297],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996737,0.00008199886,0.000016939715,0.00006019143,0.00012365317,0.000043502485],"domain_scores_gemma":[0.99962187,0.0001254194,0.000046097433,0.00007141576,0.00007328832,0.00006186976],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038735018,0.0005295219,0.0006035431,0.0012577167,0.00096902787,0.0018491027,0.0010614966,0.0005451618,0.0076392014],"category_scores_gemma":[0.002047438,0.00045827273,0.00062646874,0.0010916279,0.0020933691,0.0028042493,0.0036768143,0.0023922431,0.0007759975],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002430131,0.000007910395,0.00012316943,0.000037195918,0.000004718236,0.00004214367,0.000092723734,0.007360604,0.0011682293,0.976588,0.0011868299,0.013364168],"study_design_scores_gemma":[0.000012181509,0.0000227779,0.00023424547,0.000020538397,0.0000086905675,0.00011484757,0.000103752376,0.037518166,0.0012237388,0.9446403,0.01608276,0.000017999977],"about_ca_topic_score_codex":0.0015949983,"about_ca_topic_score_gemma":0.0019185169,"teacher_disagreement_score":0.0076392014,"about_ca_system_score_codex":0.00073144096,"about_ca_system_score_gemma":0.00058557256,"threshold_uncertainty_score":0.02555567},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00049329345,0.014271979,0.00603459,0.01601164,0.0651021,0.000114330665,0.010412115,0.0030869176,0.88447297],"genre_scores_gemma":[0.002883776,0.011023849,0.0025859755,0.0038081366,0.018881822,0.00009715435,0.010356911,0.0027172372,0.9476451],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99885476,0.00008658574,0.0000652389,0.00029832067,0.00059537066,0.000099749515],"domain_scores_gemma":[0.9971294,0.0005036839,0.00011203116,0.00044195785,0.0011828579,0.00063019415],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005702214,0.0014792109,0.0017471662,0.0035647103,0.0013562766,0.0059394925,0.0012813135,0.0011800409,0.68723726],"category_scores_gemma":[0.0036712321,0.0006669152,0.0011434229,0.0052331886,0.0009052029,0.0031364784,0.0021763917,0.0030127612,0.55260897],"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.000006846884,0.000008470058,0.000037955822,0.000080914295,0.0000029412126,0.0000113190135,0.0000050614713,0.00007015523,0.00016797183,0.004097367,0.96467054,0.0308404],"study_design_scores_gemma":[0.0000026763696,0.0000070676942,0.00015674319,0.000075569056,0.0000019474903,0.000046412002,0.000008333563,0.00005409497,0.00008455806,0.0014158615,0.9981427,0.0000039920824],"about_ca_topic_score_codex":0.0026918193,"about_ca_topic_score_gemma":0.006879499,"teacher_disagreement_score":0.68723726,"about_ca_system_score_codex":0.0024193448,"about_ca_system_score_gemma":0.0020472403,"threshold_uncertainty_score":0.44611806},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015105638,0.00027943592,0.9816828,0.00012906398,0.000059040958,0.00008320125,0.000100871686,0.0017377133,0.0008222365],"genre_scores_gemma":[0.07447015,0.000247753,0.9226873,0.000082952116,0.00005804936,0.00012517431,0.00042630982,0.00039332762,0.0015089483],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99824464,0.00022412592,0.0001404958,0.00038824056,0.0008666462,0.00013576007],"domain_scores_gemma":[0.9969694,0.0008684515,0.00024118133,0.0012066297,0.00062281935,0.000091692826],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079622486,0.0011322907,0.0018094382,0.0014632333,0.0009186495,0.0017387411,0.0018376347,0.0011896794,0.007105445],"category_scores_gemma":[0.0058335,0.0009935478,0.00095577876,0.002215229,0.0008897125,0.003517248,0.0025571417,0.0012774257,0.0043440377],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005951506,0.00011764641,0.0019364757,0.0005241935,0.00010207426,0.00048127913,0.0006871937,0.076829314,0.08948958,0.0133147845,0.010696893,0.80522543],"study_design_scores_gemma":[0.00022393832,0.0005896192,0.0031199364,0.00011041793,0.00012521696,0.0021534818,0.0008613249,0.74828476,0.14476703,0.043543328,0.05602371,0.00019725655],"about_ca_topic_score_codex":0.0033978166,"about_ca_topic_score_gemma":0.0036277147,"teacher_disagreement_score":0.007105445,"about_ca_system_score_codex":0.00059126125,"about_ca_system_score_gemma":0.000906783,"threshold_uncertainty_score":0.023770094},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42134935,0.00040096417,0.47305188,0.00072278146,0.00018064557,0.00012956547,0.00048225358,0.00057901535,0.10310352],"genre_scores_gemma":[0.912408,0.00062965206,0.06219517,0.00008443706,0.00009282303,0.000057419526,0.0004316913,0.0003666663,0.023734119],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992512,0.00010813468,0.000037719157,0.000100092955,0.00038975384,0.000113014634],"domain_scores_gemma":[0.9985257,0.00060217327,0.00019464343,0.00017555397,0.00033600497,0.00016601867],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005757948,0.0006171751,0.00064033834,0.0032902637,0.0012541346,0.0036698978,0.0009622675,0.001187966,0.010812633],"category_scores_gemma":[0.0044132317,0.0005113658,0.0005056956,0.0023330739,0.0019026651,0.0024564269,0.0022587413,0.002130422,0.0022000493],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000094425086,0.000067262175,0.0020877619,0.000054785032,0.000009456887,0.00030338802,0.0003941046,0.02408098,0.0031915307,0.9245104,0.002644149,0.042561825],"study_design_scores_gemma":[0.000034079385,0.00004520153,0.0011036026,0.000048355436,0.000012568818,0.0005613736,0.0005031484,0.14375725,0.0052295416,0.83487,0.013803121,0.000031795276],"about_ca_topic_score_codex":0.0013692225,"about_ca_topic_score_gemma":0.0011345412,"teacher_disagreement_score":0.010812633,"about_ca_system_score_codex":0.0011356787,"about_ca_system_score_gemma":0.000499297,"threshold_uncertainty_score":0.036171913},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00553666,0.0005608933,0.98228574,0.00013236389,0.00019721857,0.000086571396,0.00019009515,0.0024570515,0.0085534295],"genre_scores_gemma":[0.0495905,0.00060163264,0.9347317,0.000101573736,0.00017786602,0.0001742635,0.00084047817,0.0008579579,0.012923972],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975932,0.00033088066,0.00016283216,0.0004379245,0.0012692919,0.00020585171],"domain_scores_gemma":[0.99710983,0.000727667,0.000116605945,0.0013376424,0.0006135558,0.00009464928],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012573621,0.0019456891,0.002219129,0.0031778174,0.0010848462,0.0026257494,0.0044528674,0.0018377334,0.026252558],"category_scores_gemma":[0.006708428,0.0011525655,0.0018626784,0.0052589937,0.0013680513,0.005876164,0.0050259545,0.003513521,0.009014097],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028197133,0.00013695085,0.00035991374,0.0002968431,0.000073936324,0.00006512791,0.00012801774,0.04062132,0.00921522,0.10231276,0.018052697,0.8284553],"study_design_scores_gemma":[0.00016368546,0.00016212228,0.0007792042,0.00008078959,0.000114386974,0.00051082927,0.00011603949,0.64192533,0.017262805,0.28585598,0.052944556,0.000084249295],"about_ca_topic_score_codex":0.002571965,"about_ca_topic_score_gemma":0.0033253233,"teacher_disagreement_score":0.026252558,"about_ca_system_score_codex":0.001348311,"about_ca_system_score_gemma":0.0011700289,"threshold_uncertainty_score":0.08782357},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38551143,0.0056312815,0.5745727,0.0026324873,0.00008935211,0.00042085463,0.00021198431,0.00055900356,0.030371014],"genre_scores_gemma":[0.84508836,0.0015527498,0.15032303,0.0001327668,0.000072572395,0.00021567452,0.00012342179,0.00020957603,0.0022818916],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99473697,0.0026487978,0.00015935555,0.00016986136,0.0019733608,0.0003116111],"domain_scores_gemma":[0.9624194,0.030978478,0.0014455892,0.0029640682,0.0019387088,0.00025380126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0062643965,0.0006815162,0.0007245561,0.001768138,0.00040596578,0.001098201,0.0010886063,0.0012753597,0.003473408],"category_scores_gemma":[0.040437765,0.00039849087,0.0007637747,0.0018713822,0.0012117911,0.0020176433,0.0014182086,0.0008108794,0.0005227049],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009729388,0.00026329985,0.0071928683,0.00045191307,0.00017144984,0.00015343328,0.00016038962,0.72849166,0.014914655,0.07232555,0.0010946261,0.17380722],"study_design_scores_gemma":[0.000119098826,0.0007200385,0.0057111518,0.000068861955,0.00017161648,0.00031001584,0.00011901819,0.9501692,0.012518923,0.02745782,0.0025946132,0.00003967124],"about_ca_topic_score_codex":0.0005608748,"about_ca_topic_score_gemma":0.0005348606,"teacher_disagreement_score":0.0062643965,"about_ca_system_score_codex":0.0007630061,"about_ca_system_score_gemma":0.0006583215,"threshold_uncertainty_score":0.03312975},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054868918,0.0008907216,0.8719539,0.0006735495,0.0005826573,0.00021836493,0.0010284454,0.00716829,0.06261516],"genre_scores_gemma":[0.24564055,0.0013279031,0.7358855,0.00024344426,0.00016616091,0.00020195908,0.0015011481,0.000821586,0.014211806],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995925,0.00012266863,0.00001992933,0.000099752484,0.00010490613,0.000060398997],"domain_scores_gemma":[0.9997218,0.000093525014,0.000025350018,0.00008158945,0.000047328736,0.000030360958],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020423644,0.0008323161,0.0005767299,0.0010584833,0.00084760616,0.0015152935,0.0008299806,0.00056024466,0.015454821],"category_scores_gemma":[0.001077438,0.00055569445,0.0009166425,0.0014824556,0.00074923044,0.0018329474,0.0011471731,0.00079553924,0.0025961872],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030252512,0.000055802786,0.0008820985,0.0005732788,0.00009718971,0.0008347384,0.0017491095,0.11397003,0.036176197,0.4006661,0.049468916,0.39522406],"study_design_scores_gemma":[0.00011032344,0.00024380456,0.0008090945,0.00016133828,0.00008413296,0.000772007,0.0010572053,0.20836827,0.013630034,0.45878482,0.31588522,0.00009372293],"about_ca_topic_score_codex":0.0025316048,"about_ca_topic_score_gemma":0.0038375515,"teacher_disagreement_score":0.015454821,"about_ca_system_score_codex":0.001078773,"about_ca_system_score_gemma":0.0005146097,"threshold_uncertainty_score":0.051701546},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12949553,0.001011465,0.85028714,0.00057024107,0.000100916506,0.00019923339,0.0020173583,0.0107244095,0.0055937488],"genre_scores_gemma":[0.41805783,0.0004029117,0.57056224,0.00020893334,0.00006858522,0.00042886435,0.0048095775,0.0008914146,0.004569645],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99840766,0.00022274369,0.00019528341,0.00037357694,0.0005957098,0.0002050147],"domain_scores_gemma":[0.9949115,0.001254598,0.0005976104,0.002401242,0.0006051047,0.00022994865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010213421,0.00092721486,0.0011469765,0.001456975,0.0009203175,0.0019922338,0.0030421708,0.00086658983,0.0040551503],"category_scores_gemma":[0.0057753106,0.0007535427,0.00079524174,0.002711485,0.0012180586,0.0047842045,0.004216799,0.0012877353,0.0013299767],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0032623538,0.0002851385,0.009780367,0.0005624885,0.00026679563,0.00056727714,0.0011590312,0.16445191,0.060125023,0.10050092,0.034335066,0.6247037],"study_design_scores_gemma":[0.00031631405,0.0005699808,0.0026712005,0.000104679515,0.00011681086,0.0007162012,0.0006967453,0.7224166,0.09891776,0.12207887,0.05124344,0.0001514275],"about_ca_topic_score_codex":0.0021945753,"about_ca_topic_score_gemma":0.0032944758,"teacher_disagreement_score":0.0040551503,"about_ca_system_score_codex":0.00090249267,"about_ca_system_score_gemma":0.0008033021,"threshold_uncertainty_score":0.013565779},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39783317,0.0003591336,0.57059425,0.0009084682,0.000032827174,0.00011808449,0.0010359746,0.0007041917,0.028413944],"genre_scores_gemma":[0.90095526,0.000335733,0.08914511,0.00014405132,0.000036975263,0.000102622704,0.0013506325,0.00021070291,0.007718965],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992712,0.00009994693,0.00003652273,0.0002443711,0.00019400992,0.00015388455],"domain_scores_gemma":[0.99782073,0.0011068624,0.0003931892,0.00038941237,0.00012975145,0.00015995554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000330058,0.00045114374,0.0005065471,0.0006416863,0.0009488735,0.001708091,0.0010409049,0.0006213241,0.0049315835],"category_scores_gemma":[0.0037375907,0.00043323298,0.00075696246,0.0008910724,0.0017720686,0.004014928,0.0018901008,0.0010185004,0.00033410112],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016095459,0.00005907758,0.002524826,0.00014770318,0.000027656457,0.00030923574,0.00051008235,0.1065726,0.0056485045,0.82889795,0.0029559263,0.052185442],"study_design_scores_gemma":[0.000028046512,0.00005555143,0.0017215622,0.00003439432,0.000026144618,0.00026143432,0.00026665998,0.2128008,0.0063606817,0.769008,0.009412831,0.000023976736],"about_ca_topic_score_codex":0.004681929,"about_ca_topic_score_gemma":0.0036871433,"teacher_disagreement_score":0.0049315835,"about_ca_system_score_codex":0.0012680244,"about_ca_system_score_gemma":0.0007581519,"threshold_uncertainty_score":0.016497731},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018083807,0.0011478851,0.95510674,0.00056097534,0.0003171461,0.000031553795,0.00007235614,0.00022060989,0.02445902],"genre_scores_gemma":[0.47798753,0.002291797,0.49622738,0.00080164743,0.0007367964,0.00013741657,0.00038830572,0.00082004763,0.020608993],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991967,0.00039459032,0.000026865733,0.00008262958,0.0002447561,0.000054345168],"domain_scores_gemma":[0.9980983,0.0010466035,0.000086642605,0.00038095383,0.00024745773,0.00014006291],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016630469,0.00081317057,0.0010298967,0.00130619,0.0007263591,0.0017067061,0.0011918996,0.00092209276,0.007140155],"category_scores_gemma":[0.0060165366,0.00057070394,0.00075637555,0.0011193654,0.0021207267,0.0033119754,0.0032237144,0.0031587277,0.001890108],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016622177,0.00005052994,0.00029614492,0.00009183035,0.000031830714,0.00008790527,0.0001660527,0.030028056,0.0021465325,0.8874763,0.006548284,0.07291023],"study_design_scores_gemma":[0.000021455766,0.000027521284,0.00009276572,0.00002830482,0.000011504242,0.000064724234,0.00003837363,0.19931251,0.0007126806,0.7938057,0.0058728647,0.0000115755665],"about_ca_topic_score_codex":0.0007157302,"about_ca_topic_score_gemma":0.0008422049,"teacher_disagreement_score":0.007140155,"about_ca_system_score_codex":0.00037555638,"about_ca_system_score_gemma":0.00040434903,"threshold_uncertainty_score":0.023886204},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0152043095,0.0015363139,0.96942925,0.0050403946,0.00024481298,0.00014458867,0.00071667595,0.0016907102,0.005993008],"genre_scores_gemma":[0.27902004,0.0033664757,0.6961744,0.001656035,0.0020293337,0.0006836662,0.0031057734,0.0011578333,0.012806515],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9904323,0.0015098031,0.0006806731,0.0026977211,0.0034868366,0.0011927522],"domain_scores_gemma":[0.9521408,0.024143567,0.0029374617,0.016198218,0.0035205963,0.0010593474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046015256,0.0017129561,0.002151252,0.0018479079,0.0027182875,0.0057762936,0.0075503564,0.0037096736,0.009901887],"category_scores_gemma":[0.028138952,0.001700244,0.0029144126,0.0056461105,0.005434466,0.022254383,0.009881315,0.008794151,0.0022644643],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000990857,0.000512012,0.003554422,0.0011093828,0.00017237275,0.00043774038,0.0011362663,0.12112276,0.0076904744,0.34378168,0.03714401,0.48234802],"study_design_scores_gemma":[0.0002469658,0.00031333612,0.0017744134,0.0001681963,0.000121424506,0.0013359168,0.0008662022,0.4305415,0.017950777,0.5034378,0.04303791,0.00020553828],"about_ca_topic_score_codex":0.005305208,"about_ca_topic_score_gemma":0.0022634421,"teacher_disagreement_score":0.009901887,"about_ca_system_score_codex":0.002954673,"about_ca_system_score_gemma":0.0020169846,"threshold_uncertainty_score":0.033125103},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031177917,0.00015268353,0.94999415,0.000141744,0.00015283548,0.00011271865,0.00016495855,0.0008731542,0.017229794],"genre_scores_gemma":[0.39610043,0.00054140127,0.5573639,0.00016524021,0.00006369752,0.00014932366,0.0007245237,0.0010216623,0.04386986],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99950504,0.00002519559,0.000019988418,0.00010151741,0.0002863161,0.0000619091],"domain_scores_gemma":[0.9996269,0.00006764515,0.00003136185,0.0001767163,0.000061018374,0.00003642232],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040471734,0.00104282,0.0012278641,0.0011570464,0.00085672963,0.0031663657,0.0013203324,0.0010768648,0.0075549707],"category_scores_gemma":[0.0011010766,0.0009925957,0.00090013444,0.00068732497,0.0011762438,0.0014444243,0.0044239652,0.0017414553,0.0044309245],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000572559,0.0002150022,0.0017244202,0.0006854117,0.000076905024,0.0006302589,0.00072545407,0.0929677,0.23860544,0.13400562,0.0057093925,0.5240818],"study_design_scores_gemma":[0.00013825083,0.0006457204,0.00267474,0.00028682707,0.00023299512,0.0017539884,0.0009190281,0.59570557,0.18544044,0.097760305,0.114316724,0.00012540637],"about_ca_topic_score_codex":0.0015947327,"about_ca_topic_score_gemma":0.002092451,"teacher_disagreement_score":0.0075549707,"about_ca_system_score_codex":0.00035795534,"about_ca_system_score_gemma":0.0011423761,"threshold_uncertainty_score":0.02527392},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031959463,0.0005852042,0.9450116,0.0002507655,0.0002158022,0.000065519234,0.00013075778,0.001415779,0.020365091],"genre_scores_gemma":[0.32239062,0.00048057662,0.65392905,0.0002104639,0.00016433345,0.00018017508,0.00051487196,0.0007981307,0.02133177],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99963653,0.00008091457,0.000018307031,0.000066128654,0.0001296444,0.000068361456],"domain_scores_gemma":[0.99960047,0.000104234015,0.000026534504,0.00013318734,0.00008282189,0.000052688396],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034469034,0.0010658975,0.0008497119,0.0010055625,0.00059879717,0.0011312589,0.0012477047,0.0007585027,0.013294996],"category_scores_gemma":[0.0014924685,0.000442972,0.00067683455,0.0012104962,0.00045753721,0.0017302354,0.0027378441,0.0013709468,0.0038238862],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001127548,0.00045750482,0.0008471285,0.0003617677,0.00007071914,0.00026650514,0.00033012443,0.090130545,0.048716463,0.18300408,0.03148389,0.64320374],"study_design_scores_gemma":[0.00013070434,0.00017707316,0.00033460566,0.000030950614,0.000040579653,0.00022786894,0.00013657835,0.7632954,0.023597408,0.19713053,0.01486825,0.000030049643],"about_ca_topic_score_codex":0.00035358281,"about_ca_topic_score_gemma":0.0007555003,"teacher_disagreement_score":0.013294996,"about_ca_system_score_codex":0.00028986446,"about_ca_system_score_gemma":0.00039370672,"threshold_uncertainty_score":0.04447621},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49531552,0.0007452795,0.492689,0.00038494484,0.000061500956,0.000050605566,0.000203573,0.00027176776,0.010277788],"genre_scores_gemma":[0.8712078,0.0004914522,0.121569246,0.00012466601,0.000027460785,0.00012330695,0.0003161246,0.00006909213,0.006070921],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998053,0.00005329299,0.00001575712,0.000032476317,0.00004646139,0.000046809673],"domain_scores_gemma":[0.99856573,0.00087911193,0.00016573472,0.00007298252,0.00013570275,0.00018079703],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077643176,0.00061894604,0.00046952468,0.001071154,0.00063988904,0.0009996269,0.0007408854,0.0005531363,0.0016865075],"category_scores_gemma":[0.0023074558,0.00042534212,0.00042861706,0.0004325824,0.0014125286,0.0015145108,0.0019672709,0.00090099,0.00020284225],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00058998656,0.00007245676,0.0053247353,0.00035418157,0.00006307731,0.0003454338,0.0002288508,0.38940394,0.01625874,0.5404806,0.0014494429,0.045428574],"study_design_scores_gemma":[0.00003432238,0.00014876593,0.0013634037,0.000057129793,0.00002645473,0.00013071056,0.000145767,0.55566037,0.007823421,0.43185776,0.0027250543,0.00002678059],"about_ca_topic_score_codex":0.00094701885,"about_ca_topic_score_gemma":0.0012286941,"teacher_disagreement_score":0.0016865075,"about_ca_system_score_codex":0.0006403148,"about_ca_system_score_gemma":0.00031327698,"threshold_uncertainty_score":0.0056419373},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0571284,0.0016245171,0.9379448,0.00040475393,0.00008425227,0.00007325803,0.00017290015,0.0009909329,0.0015761825],"genre_scores_gemma":[0.69417757,0.0013375097,0.3005818,0.00008893249,0.00008524412,0.00021573417,0.0004949416,0.00012989489,0.0028884173],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99930143,0.00023333952,0.00005254389,0.00009132219,0.0002613727,0.00005999648],"domain_scores_gemma":[0.99867517,0.0004808087,0.00017769585,0.00036811217,0.00024089571,0.000057242254],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080785336,0.0005414604,0.0009186285,0.0011939552,0.0007720094,0.0009982493,0.001767088,0.0006021082,0.0010969354],"category_scores_gemma":[0.0032794275,0.0005431654,0.00045328162,0.00204248,0.00077129394,0.0019565914,0.0016750803,0.00038092933,0.0003680433],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003343481,0.00003907075,0.0013779115,0.00026293338,0.00007830625,0.00021858684,0.0003777213,0.70193684,0.0092443125,0.027871272,0.0049859807,0.2532727],"study_design_scores_gemma":[0.000020226877,0.00009871551,0.00032721198,0.000015831623,0.000020992024,0.00014630295,0.00012892621,0.97085226,0.0041137077,0.021124495,0.0031315603,0.000019850755],"about_ca_topic_score_codex":0.0040224725,"about_ca_topic_score_gemma":0.0037714913,"teacher_disagreement_score":0.0040224725,"about_ca_system_score_codex":0.00085677375,"about_ca_system_score_gemma":0.0008330402,"threshold_uncertainty_score":0.007998109},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029380834,0.0004226065,0.9650806,0.000056238554,0.000016033,0.000027290067,0.0000856246,0.000086899614,0.0048438613],"genre_scores_gemma":[0.71664333,0.0017473312,0.27545497,0.000063833606,0.00010977557,0.000097228214,0.0005376244,0.00020583528,0.005140065],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996823,0.000081193786,0.000010496374,0.000046968416,0.00013631416,0.000042731066],"domain_scores_gemma":[0.9995177,0.00021750254,0.000058167054,0.000048652888,0.00012501002,0.000033065302],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052604516,0.0003217554,0.0004352012,0.001545245,0.00048735095,0.0010501991,0.0005620731,0.00036124498,0.0027162458],"category_scores_gemma":[0.0019463615,0.00019410356,0.00045628657,0.0012675081,0.00088027486,0.0015925673,0.0005633112,0.0005918302,0.00049598987],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046727742,0.00001801625,0.0011747013,0.00006680565,0.000013778909,0.00014230957,0.00016007497,0.19738773,0.0072088623,0.75411576,0.0010093709,0.038655907],"study_design_scores_gemma":[0.000006172188,0.000024443369,0.00040326195,0.000015600177,0.000006276391,0.00012453742,0.00005655522,0.68253124,0.0028858846,0.3070447,0.006887153,0.000014209868],"about_ca_topic_score_codex":0.002038781,"about_ca_topic_score_gemma":0.0009746133,"teacher_disagreement_score":0.0027162458,"about_ca_system_score_codex":0.0007231034,"about_ca_system_score_gemma":0.0003024891,"threshold_uncertainty_score":0.009086728},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7440307,0.00021259185,0.240655,0.0001228809,0.000019864168,0.00010028356,0.0006240511,0.00043095718,0.013803581],"genre_scores_gemma":[0.906283,0.0000992748,0.09027557,0.000038299335,0.000013702804,0.0000548361,0.0008994998,0.00006413619,0.0022716247],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991805,0.000097036354,0.00007594399,0.00024905326,0.00027431393,0.00012309388],"domain_scores_gemma":[0.9980677,0.00049489265,0.00061611633,0.0003970752,0.0002698861,0.00015449646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046496105,0.00031448863,0.0005474855,0.0015809617,0.00066273217,0.0012636182,0.0008199262,0.0006735374,0.004982608],"category_scores_gemma":[0.0038225455,0.00042676282,0.00033216443,0.0017234071,0.00078572996,0.0017896718,0.0013847497,0.0005616211,0.0005879634],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016582493,0.00029857812,0.026928125,0.0004989082,0.00011982427,0.0010592194,0.0013613973,0.062052667,0.15908632,0.5065596,0.004231507,0.2361456],"study_design_scores_gemma":[0.00015302135,0.0007409318,0.022353813,0.00014308363,0.00009775823,0.0034990276,0.0013649211,0.4038867,0.13197005,0.4147046,0.020962413,0.00012363681],"about_ca_topic_score_codex":0.0006571972,"about_ca_topic_score_gemma":0.0005793897,"teacher_disagreement_score":0.004982608,"about_ca_system_score_codex":0.0005277432,"about_ca_system_score_gemma":0.0002950426,"threshold_uncertainty_score":0.016668499},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018920211,0.001781635,0.9342333,0.0009425819,0.00026856703,0.00042209701,0.015479069,0.019633688,0.0083187325],"genre_scores_gemma":[0.22992074,0.0019931768,0.7000238,0.00058208016,0.00029969576,0.0014708018,0.048418626,0.0052273506,0.012063795],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997138,0.0002607161,0.00052185776,0.00045067494,0.0013620734,0.00026670084],"domain_scores_gemma":[0.98978746,0.0031154903,0.0005832256,0.0047447733,0.0014611816,0.0003077962],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015764448,0.00137277,0.0030942294,0.0033105623,0.001667872,0.006355769,0.0045878952,0.0021008165,0.02068288],"category_scores_gemma":[0.017055986,0.0015378344,0.0016368827,0.008811201,0.001292213,0.013437986,0.0064662984,0.0028835395,0.0073971855],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012758363,0.00035129493,0.0029000829,0.0013993337,0.00013423857,0.00027445404,0.0011207606,0.028948192,0.010881951,0.28310946,0.1145527,0.5550518],"study_design_scores_gemma":[0.00048967963,0.0002322784,0.0011354164,0.00034889972,0.00014318453,0.0007956271,0.0008729292,0.23576109,0.03230151,0.5614808,0.1662482,0.00019032645],"about_ca_topic_score_codex":0.0027729562,"about_ca_topic_score_gemma":0.0042711394,"teacher_disagreement_score":0.02068288,"about_ca_system_score_codex":0.0020831611,"about_ca_system_score_gemma":0.0018805759,"threshold_uncertainty_score":0.0691911},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22427808,0.00017012517,0.7416395,0.000969742,0.00025821404,0.00008779988,0.00025155293,0.0009887563,0.0313562],"genre_scores_gemma":[0.74770796,0.00023578265,0.22917564,0.00020065745,0.00007721595,0.00007067721,0.00024969366,0.0004628788,0.02181961],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997582,0.000043071617,0.000011172177,0.0000676703,0.000088213616,0.000031697477],"domain_scores_gemma":[0.9996201,0.0001312946,0.00003988621,0.00007858852,0.000051934727,0.00007808827],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022595449,0.00046600352,0.00044612418,0.001138089,0.0007726416,0.0018262237,0.00093702576,0.00137732,0.0066393265],"category_scores_gemma":[0.001143863,0.00044730818,0.0004865454,0.00067601644,0.001488585,0.001974477,0.002385267,0.0014019088,0.0015581532],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001438943,0.00013991675,0.0010997751,0.0002127685,0.000029598788,0.0007969237,0.000644864,0.08456756,0.03392084,0.8285401,0.0046210224,0.04528265],"study_design_scores_gemma":[0.0000457504,0.00010800534,0.00052091,0.00005978682,0.000018841252,0.0005643279,0.0005232352,0.3350363,0.0069521437,0.6371812,0.018955352,0.00003415695],"about_ca_topic_score_codex":0.00057032035,"about_ca_topic_score_gemma":0.0007703978,"teacher_disagreement_score":0.0066393265,"about_ca_system_score_codex":0.00050586264,"about_ca_system_score_gemma":0.00028953218,"threshold_uncertainty_score":0.022210777},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12859541,0.0027084057,0.84215313,0.0024843137,0.00021825024,0.00030956077,0.002543402,0.001899968,0.019087534],"genre_scores_gemma":[0.44249213,0.0010404801,0.54163426,0.0004269886,0.00024734414,0.00042520792,0.004388666,0.0005914382,0.0087534785],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977348,0.0007492114,0.00018198582,0.00067346764,0.00034540452,0.00031513043],"domain_scores_gemma":[0.9959544,0.0025409951,0.00037326012,0.00054494507,0.00028149635,0.0003049399],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002358635,0.001015805,0.003110608,0.0010418697,0.0015965392,0.0025530087,0.0029482266,0.0028470166,0.008298377],"category_scores_gemma":[0.009949421,0.0009244978,0.0014930974,0.0017360002,0.0016213576,0.00572676,0.0034110686,0.0014352362,0.00208003],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0023811169,0.00038396948,0.003979705,0.001720703,0.00019190904,0.0009561726,0.0013198066,0.46326545,0.007855823,0.23191454,0.05580163,0.23022915],"study_design_scores_gemma":[0.0003495671,0.00040051,0.0011656667,0.00017388114,0.00010598915,0.0011461591,0.0008351497,0.68008476,0.006385487,0.2783577,0.030906903,0.000088217384],"about_ca_topic_score_codex":0.001276133,"about_ca_topic_score_gemma":0.0011301575,"teacher_disagreement_score":0.008298377,"about_ca_system_score_codex":0.00076604454,"about_ca_system_score_gemma":0.0011921029,"threshold_uncertainty_score":0.027760804},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30408907,0.0011473959,0.6805301,0.00085459766,0.00016565566,0.00030039105,0.00052239606,0.0017537244,0.010636771],"genre_scores_gemma":[0.55486834,0.00069190294,0.4370011,0.00016756335,0.00006451493,0.00023014468,0.0010119376,0.00029644396,0.0056680418],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99934775,0.00013155682,0.000045537377,0.0001921427,0.00012966059,0.00015340181],"domain_scores_gemma":[0.99827063,0.00088133826,0.00027038675,0.00035624637,0.00011414553,0.00010721119],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000506819,0.00062029844,0.0012100673,0.0006774008,0.00090494106,0.000899539,0.0015087612,0.0008787019,0.003145399],"category_scores_gemma":[0.004069975,0.0005233051,0.0004872441,0.0013165592,0.00078593625,0.0017629687,0.0017203907,0.00063996436,0.0007146162],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012522796,0.00018832902,0.0025646354,0.00053697475,0.000064611355,0.00074526714,0.00040779592,0.6105392,0.03045786,0.044574168,0.008672625,0.2999963],"study_design_scores_gemma":[0.00021497623,0.00030026585,0.000708864,0.000046903097,0.00004357896,0.00049574446,0.00024125841,0.9134287,0.019132176,0.049170073,0.016185002,0.000032405896],"about_ca_topic_score_codex":0.0019610054,"about_ca_topic_score_gemma":0.0022926584,"teacher_disagreement_score":0.003145399,"about_ca_system_score_codex":0.00080010423,"about_ca_system_score_gemma":0.00079375785,"threshold_uncertainty_score":0.010522425},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40888393,0.001956906,0.52535605,0.0017611944,0.00021055542,0.00016925091,0.0017589587,0.0008727317,0.05903049],"genre_scores_gemma":[0.8183889,0.0009688609,0.1656163,0.0002714631,0.00014096191,0.00018025556,0.0013037561,0.00020382354,0.012925738],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970387,0.00073266827,0.0002297204,0.0008280502,0.00082469016,0.00034605234],"domain_scores_gemma":[0.99135876,0.0041348524,0.0014731577,0.0015182127,0.0007124041,0.0008027233],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001193094,0.00078451005,0.0007238542,0.0017464479,0.0013269894,0.0035530003,0.0014012521,0.0013224701,0.006965623],"category_scores_gemma":[0.010190362,0.00075436867,0.00066050974,0.0022869653,0.0022301704,0.0050450144,0.0026706883,0.0016418275,0.001092436],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002678703,0.00006230764,0.003788544,0.0002480414,0.000032344513,0.00020041731,0.00055149285,0.036704063,0.0077310107,0.886187,0.0050741015,0.05915277],"study_design_scores_gemma":[0.00006467807,0.00011904414,0.002165272,0.00007621048,0.000047877413,0.0009899165,0.00035619191,0.08045138,0.0111219315,0.874558,0.02999258,0.000056937435],"about_ca_topic_score_codex":0.00062696513,"about_ca_topic_score_gemma":0.00091483205,"teacher_disagreement_score":0.006965623,"about_ca_system_score_codex":0.0019567208,"about_ca_system_score_gemma":0.0005629535,"threshold_uncertainty_score":0.023302376},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052048065,0.0006390726,0.92264974,0.00043705956,0.00007243845,0.00012517233,0.0029136764,0.014336134,0.0067785685],"genre_scores_gemma":[0.37844652,0.00042479462,0.60652715,0.0001466344,0.00003259796,0.00038015883,0.00827791,0.0011759588,0.004588314],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994449,0.00009524234,0.000059829727,0.00011060967,0.00020010417,0.00008922794],"domain_scores_gemma":[0.9985304,0.0004187795,0.00015543077,0.0006531292,0.0001780256,0.00006419443],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036722142,0.0006704729,0.00056237984,0.0006302954,0.0006056106,0.0013703671,0.0022662664,0.0008435377,0.0053947615],"category_scores_gemma":[0.0034162367,0.00049251085,0.00043700353,0.0020944632,0.0006909842,0.003729551,0.0025590628,0.0008547523,0.0020617014],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018038569,0.0002977962,0.006439178,0.00086246326,0.00009029779,0.00048350517,0.0014230651,0.1424397,0.070096776,0.12274937,0.08984784,0.5634662],"study_design_scores_gemma":[0.00018468965,0.00035882226,0.0011734009,0.0000960548,0.000042930187,0.00038090211,0.00045075332,0.7586643,0.080043614,0.10184585,0.056678582,0.00008015666],"about_ca_topic_score_codex":0.0019331052,"about_ca_topic_score_gemma":0.0033868367,"teacher_disagreement_score":0.0053947615,"about_ca_system_score_codex":0.0007487622,"about_ca_system_score_gemma":0.0008791039,"threshold_uncertainty_score":0.018047273},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04239183,0.0051528364,0.8380089,0.0010469442,0.000441412,0.000112677495,0.00035211165,0.0003402676,0.112153046],"genre_scores_gemma":[0.34993148,0.013125271,0.5288012,0.00036873392,0.0004828922,0.0003607154,0.0010177692,0.00059033197,0.10532167],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997166,0.00006613837,0.000013301614,0.000045696946,0.00013374315,0.000024520466],"domain_scores_gemma":[0.99955744,0.0002634045,0.000032267748,0.000043080712,0.00007090234,0.00003288353],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033237858,0.00066939,0.00051484077,0.0010037046,0.00063446007,0.0013573664,0.0009733555,0.00071102363,0.007175027],"category_scores_gemma":[0.0019983144,0.0005893464,0.0005091567,0.0015967572,0.0017057599,0.0020227819,0.0013528005,0.0022149538,0.0009696018],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018108156,0.000011487654,0.00009633523,0.00010212494,0.000003896731,0.00003335326,0.000108648426,0.015132278,0.00078833074,0.92320925,0.0052214717,0.055274714],"study_design_scores_gemma":[0.000010703301,0.000019334764,0.000106357635,0.000049286016,0.000005086063,0.00010533188,0.000055457214,0.055950828,0.0004685533,0.91379464,0.029425854,0.000008703],"about_ca_topic_score_codex":0.0015526208,"about_ca_topic_score_gemma":0.0016952334,"teacher_disagreement_score":0.007175027,"about_ca_system_score_codex":0.0009595504,"about_ca_system_score_gemma":0.00044262083,"threshold_uncertainty_score":0.02400285},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54904914,0.0018375744,0.38028225,0.001702262,0.00088722457,0.00036429998,0.0045551723,0.0013633391,0.059958756],"genre_scores_gemma":[0.75609696,0.0005116288,0.21594359,0.0003729393,0.00011258968,0.00030593158,0.006034664,0.00082323636,0.019798415],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99727255,0.00035704617,0.00031166116,0.0005824396,0.0009253459,0.00055088085],"domain_scores_gemma":[0.9969795,0.0009309731,0.0003958849,0.00059306563,0.0008901679,0.00021049044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007465905,0.0012374128,0.0015828747,0.0014454997,0.0026269173,0.0029437488,0.0016217591,0.0014617877,0.020027466],"category_scores_gemma":[0.006102231,0.0008701659,0.0011783796,0.0028066211,0.0017298203,0.0038348052,0.0041854125,0.0020357815,0.005170578],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0048766825,0.0006471031,0.039497074,0.0021429705,0.0005951373,0.008040555,0.0025965022,0.06343911,0.056767285,0.44709203,0.048928574,0.32537696],"study_design_scores_gemma":[0.000370292,0.0007520847,0.014235196,0.00056944013,0.00033378426,0.009880181,0.0052255234,0.13555431,0.07373488,0.6218248,0.13704972,0.00046974758],"about_ca_topic_score_codex":0.00077618123,"about_ca_topic_score_gemma":0.0012150302,"teacher_disagreement_score":0.020027466,"about_ca_system_score_codex":0.00074600265,"about_ca_system_score_gemma":0.00055785937,"threshold_uncertainty_score":0.06699854},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039243415,0.0012690359,0.877453,0.0006876774,0.00036482868,0.00016916571,0.00049485185,0.0003614509,0.07995662],"genre_scores_gemma":[0.37691545,0.003514693,0.5402483,0.0007288664,0.00035794056,0.00081681414,0.0017436299,0.0016688175,0.07400554],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996092,0.00012567965,0.000016243517,0.000061208164,0.00014890764,0.00003880182],"domain_scores_gemma":[0.99907947,0.0005953698,0.00006569096,0.00012352993,0.0000929296,0.000042962078],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004545336,0.0011840459,0.0011325425,0.0012518764,0.00075749896,0.0012341182,0.0017392997,0.0013350613,0.025706895],"category_scores_gemma":[0.0043389527,0.0007847232,0.0006110988,0.0018490182,0.0011253393,0.0025287468,0.003122455,0.002274392,0.0021167235],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015052964,0.000075848584,0.00019846771,0.00032232006,0.00002416414,0.00011032031,0.00015357838,0.16882205,0.00309707,0.64109904,0.015661126,0.17028554],"study_design_scores_gemma":[0.00003996733,0.00005544053,0.00015285639,0.000115304385,0.000010306854,0.00013137769,0.00007385063,0.32258156,0.0012607995,0.6607523,0.014805266,0.000020957337],"about_ca_topic_score_codex":0.00094418315,"about_ca_topic_score_gemma":0.0012069455,"teacher_disagreement_score":0.025706895,"about_ca_system_score_codex":0.00054179574,"about_ca_system_score_gemma":0.00040671864,"threshold_uncertainty_score":0.08599812},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03485919,0.00042569754,0.94984174,0.00036312838,0.00006882181,0.00022573338,0.00034917184,0.00572768,0.008138795],"genre_scores_gemma":[0.16217189,0.00016822112,0.8290039,0.00015642085,0.000051909894,0.00033004134,0.0013084373,0.0004417876,0.006367477],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99899226,0.00012996673,0.00006660481,0.00019711893,0.00045436993,0.0001597108],"domain_scores_gemma":[0.9987943,0.00035228956,0.00009365154,0.0004411562,0.00023686173,0.00008173452],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004513739,0.0010349099,0.0013995937,0.0016855972,0.0008636358,0.0012658095,0.0027315565,0.0012001633,0.014946636],"category_scores_gemma":[0.002680973,0.00047194416,0.00074581435,0.0028140093,0.00064904836,0.0024331617,0.0026654343,0.0012258838,0.0044176695],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001070027,0.0004570227,0.00083869364,0.0002915101,0.000052053627,0.00029564335,0.0003068036,0.12024221,0.018127482,0.023340678,0.02128603,0.81369185],"study_design_scores_gemma":[0.0001974881,0.00013492897,0.00020472199,0.000015359832,0.000017730757,0.00020373103,0.00007026067,0.96545714,0.008330769,0.014301048,0.011042029,0.000024808065],"about_ca_topic_score_codex":0.0036009792,"about_ca_topic_score_gemma":0.004216791,"teacher_disagreement_score":0.014946636,"about_ca_system_score_codex":0.0012165038,"about_ca_system_score_gemma":0.0013261391,"threshold_uncertainty_score":0.050001502},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016826462,0.00041426977,0.44270402,0.0032578814,0.001411577,0.00034675185,0.11746145,0.14222747,0.290494],"genre_scores_gemma":[0.028677361,0.0015889138,0.3123768,0.0018692882,0.0007457999,0.0008781643,0.21757178,0.12214745,0.3141445],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99952495,0.000060478604,0.00005302,0.00006843236,0.0002500651,0.000043030446],"domain_scores_gemma":[0.9987645,0.0003445395,0.000069714086,0.0003107967,0.00042167288,0.000088698434],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00058461673,0.0015239228,0.0009941871,0.0020377317,0.0010259363,0.0044964883,0.003335664,0.0021195677,0.44092923],"category_scores_gemma":[0.003798441,0.0010433492,0.0009770995,0.002986727,0.0006701726,0.005257679,0.002113883,0.0023737224,0.2921074],"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.00007149121,0.000030940184,0.00014140269,0.00034510822,0.000009849152,0.000075176235,0.00009916726,0.0010437137,0.0025817,0.057838798,0.88343215,0.054330382],"study_design_scores_gemma":[0.000056470824,0.000015144137,0.00032778247,0.0000828131,0.000008663748,0.0002093812,0.000056393972,0.007813406,0.0076909745,0.037564114,0.94613254,0.000042332867],"about_ca_topic_score_codex":0.0057879575,"about_ca_topic_score_gemma":0.008645889,"teacher_disagreement_score":0.55907077,"about_ca_system_score_codex":0.0015114595,"about_ca_system_score_gemma":0.0012252482,"threshold_uncertainty_score":0.7974466},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.100324474,0.0006406212,0.87097615,0.00042759735,0.00028541783,0.00015360076,0.00046791937,0.00024058144,0.026483634],"genre_scores_gemma":[0.6552532,0.00188996,0.3061564,0.00038128224,0.00031502577,0.00036251155,0.0016517413,0.0006995174,0.03329045],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989241,0.00026687654,0.000050088696,0.0001475866,0.0005114892,0.00009981011],"domain_scores_gemma":[0.99836487,0.00082388305,0.00022186665,0.00019389958,0.00021671533,0.00017876568],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000646936,0.00096368365,0.0013293624,0.0021088498,0.0013011241,0.0024699818,0.0018286112,0.0012015881,0.0055667986],"category_scores_gemma":[0.0033700399,0.0009374625,0.0011429605,0.0020366926,0.002079957,0.0022349365,0.0040349374,0.003066924,0.001014111],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010490772,0.00006638215,0.00051178556,0.00015259559,0.000025644955,0.00017099727,0.00038418433,0.09239478,0.0031051903,0.864295,0.0025950875,0.036193494],"study_design_scores_gemma":[0.000027184744,0.000054370557,0.0003450159,0.00005714975,0.000011263514,0.00013973218,0.00014044801,0.23199221,0.001139847,0.7594269,0.0066466313,0.000019344201],"about_ca_topic_score_codex":0.0016386104,"about_ca_topic_score_gemma":0.0016622206,"teacher_disagreement_score":0.0055667986,"about_ca_system_score_codex":0.0008783809,"about_ca_system_score_gemma":0.00044573567,"threshold_uncertainty_score":0.018622816},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27985546,0.00093131524,0.4584694,0.0029355695,0.00062568136,0.00021290296,0.0014907653,0.0015513758,0.2539274],"genre_scores_gemma":[0.857958,0.0006467318,0.039499115,0.00097484747,0.0002261893,0.00018327414,0.0014786095,0.00061769196,0.09841554],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99969745,0.00006012424,0.000011894902,0.000092677925,0.00008575265,0.000052008036],"domain_scores_gemma":[0.9984926,0.00036902213,0.0001871147,0.000311789,0.00028923183,0.00035017086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003047588,0.0005928385,0.00087835867,0.0020430302,0.0016407259,0.0020019333,0.0010855389,0.0010525892,0.02543684],"category_scores_gemma":[0.0022323413,0.00045109793,0.00061880064,0.0011702324,0.001463475,0.0023177708,0.002536719,0.0023825238,0.0034646366],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053175434,0.000036665813,0.00046688406,0.000053089396,0.000015494501,0.00010228194,0.00011025375,0.003359096,0.0014049344,0.9718927,0.005819333,0.01668619],"study_design_scores_gemma":[0.000018058443,0.000019958681,0.00032496598,0.000019528345,0.00001379742,0.00014178081,0.00013676299,0.01258276,0.0009098394,0.9769503,0.0088708345,0.000011557105],"about_ca_topic_score_codex":0.0010571319,"about_ca_topic_score_gemma":0.0017099712,"teacher_disagreement_score":0.02543684,"about_ca_system_score_codex":0.00069892145,"about_ca_system_score_gemma":0.00063242315,"threshold_uncertainty_score":0.08509475},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09382423,0.0015125973,0.8759166,0.003777332,0.0002335632,0.0004203142,0.0016948528,0.00046433805,0.022156091],"genre_scores_gemma":[0.39748064,0.002177243,0.55548036,0.0007429427,0.00068727677,0.0006316759,0.005178423,0.001065727,0.036555775],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99889624,0.00038429754,0.00006444065,0.00030817764,0.00020819991,0.00013867862],"domain_scores_gemma":[0.994093,0.004722564,0.00035067066,0.00033161434,0.00025105148,0.0002511602],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002141619,0.002198803,0.003770696,0.0019393972,0.001777108,0.0031183003,0.0043751625,0.0070676897,0.021009736],"category_scores_gemma":[0.0122076655,0.0015906314,0.0018196487,0.0026842682,0.0026892999,0.007177208,0.0041570296,0.0034042706,0.0017055918],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00066334766,0.0002755641,0.0009837039,0.0008218237,0.00009234475,0.00035217663,0.00039723236,0.7531407,0.0015045949,0.13854706,0.01836629,0.084855236],"study_design_scores_gemma":[0.0001078013,0.00011673832,0.00021909384,0.00007057986,0.00002375735,0.00009651697,0.00022712236,0.8068912,0.0005277959,0.18881345,0.0028825502,0.00002344403],"about_ca_topic_score_codex":0.0066833696,"about_ca_topic_score_gemma":0.005135156,"teacher_disagreement_score":0.021009736,"about_ca_system_score_codex":0.0013051503,"about_ca_system_score_gemma":0.0012520249,"threshold_uncertainty_score":0.070284605},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010096116,0.00022825795,0.97716343,0.000074790136,0.000103533544,0.0001030365,0.00019390983,0.0027676525,0.009269246],"genre_scores_gemma":[0.17290421,0.0002878726,0.81951815,0.00015082805,0.00006420201,0.00025050598,0.0008527691,0.00059651455,0.0053749736],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987429,0.00017504308,0.00009981447,0.00025380042,0.00053977256,0.00018873208],"domain_scores_gemma":[0.99891734,0.00031398484,0.000087263055,0.00047829415,0.00015839288,0.000044682176],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007380044,0.001108934,0.00087780406,0.0010145163,0.000878509,0.0020273814,0.0014149676,0.0006385171,0.012067125],"category_scores_gemma":[0.004052721,0.0005029859,0.0009427435,0.0013665031,0.0010298642,0.002376346,0.0030997454,0.0014131208,0.0044186134],"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.0008367618,0.000147456,0.0015668574,0.00057208113,0.00006815114,0.00041155505,0.00055410364,0.15078503,0.03170568,0.18606241,0.01891483,0.6083751],"study_design_scores_gemma":[0.00013528427,0.00031145415,0.0006314599,0.0001586407,0.000050879484,0.00049964694,0.00037614626,0.67774236,0.040322445,0.22504102,0.05464559,0.000085127496],"about_ca_topic_score_codex":0.0012751392,"about_ca_topic_score_gemma":0.0015090938,"teacher_disagreement_score":0.012067125,"about_ca_system_score_codex":0.00064648234,"about_ca_system_score_gemma":0.0007719131,"threshold_uncertainty_score":0.040368617},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10604828,0.002607345,0.82039356,0.007905305,0.0010680078,0.00066685333,0.0011547658,0.0062358216,0.05392008],"genre_scores_gemma":[0.48107487,0.0013971956,0.48428318,0.001388658,0.00088333903,0.0011834188,0.0014382091,0.002412762,0.025938425],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99745864,0.001015464,0.00012047881,0.00042843036,0.00058386696,0.00039318018],"domain_scores_gemma":[0.98147327,0.011744908,0.0007591968,0.0045127682,0.00084669015,0.00066304643],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019084194,0.00222587,0.0019918696,0.0019979598,0.0018638595,0.0031803816,0.0039876713,0.003022133,0.022923011],"category_scores_gemma":[0.021303864,0.0011019626,0.0014457626,0.0032816804,0.0018264959,0.008650342,0.003779634,0.0041747005,0.0054601007],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0028352155,0.001116501,0.0015892145,0.0010541695,0.00024570708,0.00023583719,0.0003131836,0.39668965,0.0132551165,0.15133518,0.062905334,0.36842495],"study_design_scores_gemma":[0.00070320856,0.00026227187,0.00058394496,0.000070583425,0.00014479394,0.00015870642,0.00013141563,0.6220697,0.0064393445,0.36013243,0.0092655495,0.000038014674],"about_ca_topic_score_codex":0.0012878015,"about_ca_topic_score_gemma":0.0028183104,"teacher_disagreement_score":0.022923011,"about_ca_system_score_codex":0.0017909604,"about_ca_system_score_gemma":0.00279023,"threshold_uncertainty_score":0.07668513},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5790574,0.0012526533,0.40378097,0.00092624425,0.00007949618,0.00016156751,0.0063689714,0.0015451094,0.006827591],"genre_scores_gemma":[0.7892949,0.0004027275,0.19709568,0.0000839042,0.00006503195,0.00009574908,0.010382538,0.00020356789,0.0023759236],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994647,0.000056747394,0.000034271507,0.00015869716,0.00016677618,0.000118790806],"domain_scores_gemma":[0.9988795,0.00052762515,0.00018072434,0.0001299808,0.00012512776,0.00015702234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040048469,0.0006699057,0.0015760605,0.0018333888,0.0009870788,0.0015683225,0.0014342355,0.0011324611,0.0037430085],"category_scores_gemma":[0.0041743335,0.00065251364,0.0010850013,0.0016937412,0.0007099988,0.0037113358,0.0017475487,0.0011287335,0.00036725312],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010428672,0.0002996008,0.019781534,0.001013332,0.00019709191,0.00084345177,0.00080853456,0.69118315,0.015023996,0.034353204,0.013265561,0.22218764],"study_design_scores_gemma":[0.00009002948,0.00015226731,0.0061839498,0.000076002245,0.00006451678,0.00033783366,0.00074807095,0.9088735,0.0059502316,0.07197208,0.005497591,0.00005404374],"about_ca_topic_score_codex":0.004668729,"about_ca_topic_score_gemma":0.005052351,"teacher_disagreement_score":0.004668729,"about_ca_system_score_codex":0.0006750202,"about_ca_system_score_gemma":0.000872651,"threshold_uncertainty_score":0.012521684},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6128795,0.0013574669,0.36277908,0.0018176074,0.00008291356,0.00014174716,0.0011385753,0.0034833702,0.01631975],"genre_scores_gemma":[0.94860274,0.00049321173,0.04712024,0.00013210271,0.00003256076,0.0001327369,0.00062232267,0.00018123805,0.002682894],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99890006,0.00025114015,0.00011751635,0.00023301035,0.00021937363,0.00027890404],"domain_scores_gemma":[0.9915234,0.0055602463,0.00056250754,0.0018821143,0.00025811623,0.00021355897],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009876272,0.00053894636,0.00076901255,0.00065267313,0.00078646484,0.002114394,0.0022902272,0.0008587046,0.00852739],"category_scores_gemma":[0.0091254385,0.00044585016,0.00049149763,0.001234585,0.0008339774,0.00631172,0.0017145004,0.00067758287,0.0009741047],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0029440355,0.0002655108,0.00947599,0.0008629238,0.00013250248,0.000696582,0.0009059195,0.458901,0.03539913,0.1940836,0.012319326,0.28401354],"study_design_scores_gemma":[0.00016184247,0.00043396567,0.001499829,0.00007475699,0.00013049554,0.00058698555,0.00036791185,0.86295754,0.022649998,0.10540199,0.0056761527,0.0000586513],"about_ca_topic_score_codex":0.0018120678,"about_ca_topic_score_gemma":0.0031929475,"teacher_disagreement_score":0.00852739,"about_ca_system_score_codex":0.0013524895,"about_ca_system_score_gemma":0.0008842739,"threshold_uncertainty_score":0.028526962},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09458847,0.00032385785,0.88138926,0.0004761006,0.00009099,0.00013308311,0.00076198217,0.0005552676,0.021680994],"genre_scores_gemma":[0.36034358,0.00023823892,0.62856233,0.00011006095,0.000059707196,0.00021188449,0.001291755,0.00030587465,0.008876588],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99942183,0.00013294796,0.00004109766,0.00013147088,0.00019427785,0.00007834868],"domain_scores_gemma":[0.99893826,0.0004978754,0.0001276044,0.00021155142,0.0001586396,0.00006604038],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035823186,0.0005251309,0.00083491043,0.0007279956,0.00046423852,0.0006827553,0.0011658014,0.000984135,0.008226903],"category_scores_gemma":[0.004559714,0.00042039403,0.0005213013,0.0010275127,0.00057102606,0.0012357938,0.0018488792,0.0010974861,0.0016153305],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013457815,0.00016911865,0.0046986863,0.00068585714,0.00009194471,0.000812484,0.0008680044,0.4230589,0.055861734,0.13849203,0.019137356,0.35477814],"study_design_scores_gemma":[0.00025867292,0.00026357285,0.0012605299,0.00008820388,0.000034110537,0.0005515288,0.00030582552,0.86198956,0.0146274455,0.09687501,0.023713144,0.000032442516],"about_ca_topic_score_codex":0.0010955277,"about_ca_topic_score_gemma":0.0015036794,"teacher_disagreement_score":0.008226903,"about_ca_system_score_codex":0.0003133863,"about_ca_system_score_gemma":0.00032560065,"threshold_uncertainty_score":0.02752173},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.72558904,0.00095635856,0.18747535,0.0008674287,0.00033863212,0.000081174425,0.000555576,0.0006277748,0.08350865],"genre_scores_gemma":[0.96296173,0.00035280906,0.02429241,0.0001307728,0.00004832599,0.00005599811,0.00042656143,0.00021693038,0.011514496],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99960095,0.00006840598,0.00001839574,0.00011158309,0.000103562576,0.000097135526],"domain_scores_gemma":[0.999089,0.00023322518,0.00018518468,0.000121583354,0.00016330602,0.00020772479],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037503205,0.00057542365,0.00072441803,0.0012073934,0.0024533756,0.003050483,0.001036335,0.0014427471,0.012131713],"category_scores_gemma":[0.0022729328,0.00078109774,0.00034819523,0.0011458123,0.001665162,0.0028224275,0.0019493725,0.002020369,0.002219432],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00059241557,0.00019354394,0.0036603734,0.00013934665,0.000051520026,0.0014825276,0.0007189987,0.08447313,0.012819628,0.8620333,0.00509834,0.028736858],"study_design_scores_gemma":[0.000102097016,0.00019898727,0.003135194,0.00010033946,0.00003240998,0.0014319421,0.0014720918,0.16918609,0.005696209,0.80813944,0.010406017,0.00009913472],"about_ca_topic_score_codex":0.0008430423,"about_ca_topic_score_gemma":0.0010348062,"teacher_disagreement_score":0.012131713,"about_ca_system_score_codex":0.0008437752,"about_ca_system_score_gemma":0.0005380125,"threshold_uncertainty_score":0.040584624},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13094272,0.0061113667,0.80022246,0.002590013,0.00043253956,0.00035292786,0.0018522155,0.009268601,0.048227217],"genre_scores_gemma":[0.501885,0.003053965,0.46796945,0.00080901297,0.00032308482,0.00059466687,0.0050209174,0.0027847071,0.017559268],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996894,0.00051860185,0.00015470675,0.0004801583,0.0010724929,0.0008799214],"domain_scores_gemma":[0.9917563,0.0054635904,0.00047308466,0.0013531784,0.0005330706,0.00042069677],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002073558,0.0026579786,0.0020262655,0.0014800627,0.0011602151,0.0042565246,0.0026946755,0.0013030767,0.020885874],"category_scores_gemma":[0.010545119,0.0010054599,0.0018950846,0.0025562674,0.0015577556,0.0070382194,0.0036516641,0.0021806995,0.0041989987],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.005222025,0.00040876435,0.0031182847,0.0018492534,0.00024949643,0.00064478134,0.000572039,0.40912384,0.05192753,0.07927399,0.044023477,0.4035866],"study_design_scores_gemma":[0.00035490666,0.00027721544,0.0007898372,0.00013555429,0.00013809388,0.00026594492,0.00019695066,0.89647996,0.013443043,0.07703386,0.010837795,0.000046896246],"about_ca_topic_score_codex":0.0063914326,"about_ca_topic_score_gemma":0.010485671,"teacher_disagreement_score":0.020885874,"about_ca_system_score_codex":0.0025608828,"about_ca_system_score_gemma":0.002124116,"threshold_uncertainty_score":0.06987023},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47047502,0.0018562023,0.43622106,0.0014237474,0.00018576968,0.00017980758,0.0008402241,0.00068385934,0.08813432],"genre_scores_gemma":[0.84293765,0.0012854734,0.12150766,0.00043757408,0.000114542665,0.00018054046,0.0012657545,0.00030064362,0.031970114],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995696,0.00011546577,0.000012690538,0.00009559805,0.00012354752,0.0000829917],"domain_scores_gemma":[0.9991875,0.00026248267,0.0001725677,0.00014072696,0.000106555235,0.00013001247],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004079665,0.0006257395,0.00043812097,0.0011220034,0.00078559446,0.0013727198,0.0013432008,0.0012881083,0.0073102587],"category_scores_gemma":[0.0027532803,0.0005145349,0.0005567545,0.0006193961,0.0010978454,0.0023420146,0.0014325127,0.0013741945,0.00111414],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001142295,0.000038498172,0.000785378,0.00011268504,0.000025524338,0.00026442515,0.0002889619,0.08002396,0.0068143196,0.8842611,0.0044963104,0.022774674],"study_design_scores_gemma":[0.00008616252,0.0001982705,0.0013277762,0.00008168618,0.000041741834,0.00090026314,0.00043219098,0.33856952,0.0048939595,0.5988739,0.054534063,0.00006049539],"about_ca_topic_score_codex":0.0021062333,"about_ca_topic_score_gemma":0.0024282641,"teacher_disagreement_score":0.0073102587,"about_ca_system_score_codex":0.000709212,"about_ca_system_score_gemma":0.00038097816,"threshold_uncertainty_score":0.024455309},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8139843,0.00068020425,0.09122759,0.0004341031,0.00015782248,0.000059223854,0.0013240981,0.0003122563,0.09182046],"genre_scores_gemma":[0.9740898,0.00027351239,0.0155336475,0.00007534032,0.000031792733,0.00007136807,0.0013549579,0.00010253605,0.00846703],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996177,0.000052101386,0.000015297765,0.00008273206,0.00015360706,0.00007858316],"domain_scores_gemma":[0.9991351,0.00039697153,0.00008151389,0.000094821626,0.00018492513,0.00010674451],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030014812,0.0003428833,0.00036950348,0.0010205441,0.00080545555,0.0016089757,0.00073650747,0.00086381857,0.013365972],"category_scores_gemma":[0.0023243786,0.00041941117,0.0002942468,0.0009380821,0.0008365202,0.0013274597,0.0009252121,0.0004971521,0.0011989332],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00056199223,0.00036341776,0.02249421,0.00040446097,0.00012769664,0.0009875564,0.0002878627,0.55946004,0.032036833,0.2954223,0.017907226,0.069946416],"study_design_scores_gemma":[0.000016001786,0.00008569776,0.014762782,0.000046388184,0.000023913844,0.0005320707,0.00027248746,0.93777263,0.010412239,0.030786918,0.0052409377,0.000047854996],"about_ca_topic_score_codex":0.0025795663,"about_ca_topic_score_gemma":0.0023203958,"teacher_disagreement_score":0.013365972,"about_ca_system_score_codex":0.0006927143,"about_ca_system_score_gemma":0.0004553606,"threshold_uncertainty_score":0.044713676},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23490185,0.0003047729,0.75571907,0.0003559716,0.00010861677,0.00011039818,0.000044377386,0.00069911545,0.0077557573],"genre_scores_gemma":[0.7776629,0.00011094107,0.21732762,0.00008217296,0.000025553363,0.0001245915,0.00012821992,0.0004677538,0.0040703327],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990176,0.00023060876,0.00004468909,0.00012030596,0.00044665765,0.00014005014],"domain_scores_gemma":[0.9883441,0.0085352445,0.00065554207,0.00096848607,0.0012789603,0.0002176889],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020791693,0.0005716875,0.00052750733,0.00064467406,0.0007413893,0.0012766077,0.0012667092,0.0008339464,0.007611648],"category_scores_gemma":[0.019094924,0.0005733698,0.00042439075,0.0004716291,0.00098329,0.0013539019,0.0008641787,0.0009849586,0.00054709014],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016613452,0.0003466175,0.006645245,0.0002896737,0.000059041187,0.00035185943,0.000694144,0.6128643,0.04246885,0.09404425,0.0031392234,0.23743546],"study_design_scores_gemma":[0.00002500744,0.00007905108,0.00048685362,0.000012765391,0.000014626816,0.00006782827,0.0000850199,0.98448074,0.0076708584,0.006274053,0.0007908789,0.0000121927915],"about_ca_topic_score_codex":0.0012958568,"about_ca_topic_score_gemma":0.0020388055,"teacher_disagreement_score":0.007611648,"about_ca_system_score_codex":0.0006700848,"about_ca_system_score_gemma":0.0010413334,"threshold_uncertainty_score":0.025463521},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35088173,0.0023846142,0.59537387,0.008418076,0.00047718672,0.001245421,0.008142972,0.002515629,0.030560462],"genre_scores_gemma":[0.68158096,0.0007577014,0.29217476,0.0008202998,0.00017507758,0.000776495,0.0076767476,0.0005430708,0.015494825],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981055,0.0003586977,0.00014229525,0.00057577837,0.0005797389,0.00023802898],"domain_scores_gemma":[0.98671234,0.010892019,0.00068817195,0.000608476,0.0006104246,0.00048847264],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015407086,0.0010770157,0.0026041747,0.0012232547,0.0019415509,0.0026348599,0.0038329042,0.0036834734,0.017432109],"category_scores_gemma":[0.013344208,0.0012695676,0.0020816172,0.0022134273,0.0022862258,0.0064839153,0.0037454043,0.0031469963,0.0013820095],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014821006,0.0006853427,0.00616865,0.0022193315,0.00042667563,0.0009979004,0.0008295579,0.631151,0.0058907997,0.06858162,0.032742508,0.24882446],"study_design_scores_gemma":[0.00047109314,0.00035737373,0.0015611221,0.00016835512,0.00013947216,0.00060269417,0.0009231898,0.77508354,0.004009473,0.20704438,0.009584288,0.000054979675],"about_ca_topic_score_codex":0.006053128,"about_ca_topic_score_gemma":0.0080983555,"teacher_disagreement_score":0.017432109,"about_ca_system_score_codex":0.0026664422,"about_ca_system_score_gemma":0.0018699293,"threshold_uncertainty_score":0.05831629},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32647082,0.0026317143,0.5073944,0.0034968397,0.00033905526,0.00017677115,0.0008472337,0.00064891425,0.15799429],"genre_scores_gemma":[0.87010133,0.0022097905,0.09070312,0.00054434146,0.00026924763,0.00012531919,0.00068625546,0.0001341296,0.03522637],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99943346,0.00016647541,0.00002657641,0.00012330929,0.00014094738,0.00010924484],"domain_scores_gemma":[0.9981621,0.00088244874,0.00033641653,0.0002402325,0.00020600877,0.00017286722],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003992236,0.0003607611,0.00035492817,0.0009624482,0.0015260588,0.001671826,0.00064585666,0.0010250122,0.012155951],"category_scores_gemma":[0.003964115,0.000332078,0.00061189785,0.0016927449,0.0018533645,0.0026322599,0.0010931378,0.0012152339,0.0010192561],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015183415,0.000010902526,0.0003647698,0.000031671945,0.0000047006383,0.000082294035,0.00012292815,0.0033723968,0.00052777794,0.9773192,0.0031700926,0.0149780065],"study_design_scores_gemma":[0.00001432577,0.000022714496,0.0007056474,0.000029409994,0.000010721539,0.000406226,0.0002279893,0.020948254,0.00091788435,0.9402104,0.036491226,0.000015111791],"about_ca_topic_score_codex":0.0026485124,"about_ca_topic_score_gemma":0.0026447792,"teacher_disagreement_score":0.012155951,"about_ca_system_score_codex":0.0010608374,"about_ca_system_score_gemma":0.0004559105,"threshold_uncertainty_score":0.040665686},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006566284,0.0007577922,0.9816457,0.0010229277,0.000112881586,0.00005531628,0.00012134866,0.0002149973,0.009502819],"genre_scores_gemma":[0.18353349,0.005157281,0.78523827,0.0011991216,0.0017194389,0.0004955095,0.0012496437,0.00067828107,0.020728923],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979832,0.00074201263,0.000089128036,0.000495063,0.00052440463,0.00016615239],"domain_scores_gemma":[0.9962112,0.0025175826,0.00032349257,0.00049364934,0.0002988768,0.00015517419],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021587785,0.0020291428,0.001583366,0.0021122291,0.0011966047,0.002373421,0.0031063273,0.0021327678,0.011512479],"category_scores_gemma":[0.0079885805,0.00083101605,0.0016308399,0.0036424738,0.003872204,0.008624492,0.004098432,0.005450156,0.0021180313],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000114700895,0.00010057426,0.00038601767,0.00022607077,0.00003414734,0.00013276839,0.00018895656,0.16753067,0.0019143153,0.73152107,0.009025751,0.08882495],"study_design_scores_gemma":[0.000023758646,0.00008461955,0.00015877928,0.000032512427,0.0000141411165,0.0001278017,0.00005850117,0.31884724,0.00089531206,0.6677592,0.011972631,0.000025560825],"about_ca_topic_score_codex":0.0015335038,"about_ca_topic_score_gemma":0.0013051877,"teacher_disagreement_score":0.011512479,"about_ca_system_score_codex":0.0013486319,"about_ca_system_score_gemma":0.0009909086,"threshold_uncertainty_score":0.038513124},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16868328,0.0005818706,0.81400967,0.00041032446,0.000092803624,0.00024387018,0.00027552768,0.0012878187,0.014414931],"genre_scores_gemma":[0.53544,0.00076828245,0.45512366,0.00040563729,0.0002455371,0.0002914307,0.0014364594,0.00033600975,0.005952948],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997844,0.00037219358,0.00017916708,0.0006730479,0.0005401306,0.00039149792],"domain_scores_gemma":[0.99316883,0.003212709,0.0006032608,0.002065258,0.0007104076,0.00023965228],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011958942,0.00093331025,0.0010768181,0.0012258101,0.001069808,0.0021230944,0.0022398715,0.0011400139,0.0035849803],"category_scores_gemma":[0.009071864,0.00093739276,0.0017473083,0.0016116513,0.0023874706,0.00799846,0.002753119,0.0021328744,0.0010781125],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007515663,0.00042169023,0.01840045,0.00068783556,0.00008418496,0.0016797507,0.0018132875,0.20337197,0.046473604,0.2634446,0.008431324,0.45443982],"study_design_scores_gemma":[0.00003572874,0.0002132115,0.0038716055,0.00009675747,0.000033301418,0.0013063042,0.0004348602,0.7544368,0.017648574,0.20922223,0.012620081,0.0000806406],"about_ca_topic_score_codex":0.0039721737,"about_ca_topic_score_gemma":0.0037392054,"teacher_disagreement_score":0.0039721737,"about_ca_system_score_codex":0.0009803487,"about_ca_system_score_gemma":0.0007794563,"threshold_uncertainty_score":0.011992931},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09831044,0.008526066,0.81402564,0.0043748645,0.000792183,0.00028156635,0.0015014666,0.004266057,0.06792176],"genre_scores_gemma":[0.63538235,0.008865153,0.3106061,0.0017312682,0.0015201635,0.0006169514,0.0035641815,0.004779296,0.03293445],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99480706,0.0009251266,0.0002558773,0.00081931584,0.0019602056,0.0012324409],"domain_scores_gemma":[0.93852806,0.04513089,0.0023622778,0.00772259,0.0033986138,0.0028576052],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006045654,0.0038009824,0.003815286,0.006938326,0.0030018387,0.008179561,0.010743831,0.0036408994,0.022920506],"category_scores_gemma":[0.04330976,0.0019703722,0.003410989,0.006918104,0.0067895334,0.0216042,0.0111446865,0.011902846,0.0043335464],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013802402,0.00034046464,0.0029811596,0.0016922932,0.00019241987,0.0003259096,0.0016671628,0.20158392,0.0068763555,0.604335,0.02878483,0.1498402],"study_design_scores_gemma":[0.00006942735,0.00016630505,0.0009062192,0.00031910508,0.00024484735,0.00022681702,0.00029924116,0.3455288,0.004521362,0.6380219,0.009613242,0.000082640516],"about_ca_topic_score_codex":0.0040355893,"about_ca_topic_score_gemma":0.005699032,"teacher_disagreement_score":0.022920506,"about_ca_system_score_codex":0.0042093433,"about_ca_system_score_gemma":0.0015867619,"threshold_uncertainty_score":0.076676786},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010749676,0.03818625,0.1040391,0.10732792,0.054375272,0.0006281593,0.024596367,0.004520947,0.6555764],"genre_scores_gemma":[0.100095496,0.027207054,0.08893105,0.01868829,0.035815347,0.0013717823,0.09792961,0.004962955,0.62499845],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9953053,0.0006928601,0.00022504281,0.0006391588,0.0026616752,0.00047598692],"domain_scores_gemma":[0.99431264,0.0014940818,0.00016918922,0.0007743569,0.0020851973,0.0011645351],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027605968,0.0015237065,0.0014620404,0.0033410678,0.003920253,0.0071569383,0.0017393644,0.0032631317,0.070151195],"category_scores_gemma":[0.0130606275,0.000649862,0.0012772955,0.005942396,0.001190584,0.004578869,0.0043042386,0.0067408443,0.02532303],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010309637,0.00005787232,0.000235191,0.00027657568,0.000014015121,0.00011977492,0.000098897886,0.0015229263,0.00031959356,0.07292722,0.8506106,0.07371428],"study_design_scores_gemma":[0.000034956265,0.000023950946,0.00053235015,0.0001974354,0.000011305796,0.00017596998,0.000077402976,0.0026216214,0.0005245383,0.10346857,0.89230096,0.00003085509],"about_ca_topic_score_codex":0.013831911,"about_ca_topic_score_gemma":0.016308567,"teacher_disagreement_score":0.070151195,"about_ca_system_score_codex":0.006422772,"about_ca_system_score_gemma":0.004830338,"threshold_uncertainty_score":0.2346791},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07466224,0.00019157966,0.8912462,0.0001697399,0.00014205961,0.00015123925,0.0003025547,0.00037505344,0.03275938],"genre_scores_gemma":[0.58602035,0.0003029901,0.39365882,0.00009525083,0.00008210656,0.00026559256,0.000647962,0.00041277564,0.018514179],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988852,0.00020168218,0.000084599014,0.00021561682,0.0005206765,0.00009225287],"domain_scores_gemma":[0.9985998,0.00039842137,0.00016758329,0.00047817678,0.00024092187,0.00011503341],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000551693,0.00082747766,0.00061457534,0.0008378266,0.00046058683,0.0012931298,0.0012583834,0.0010957656,0.0071894396],"category_scores_gemma":[0.00423533,0.0006610205,0.0004197353,0.0006904855,0.0009574166,0.0014289859,0.0029405316,0.0016782648,0.0021454133],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00089422567,0.00022733792,0.0023661938,0.00046561312,0.000072463896,0.0007054283,0.00067598,0.14635664,0.098795295,0.455067,0.007118376,0.28725544],"study_design_scores_gemma":[0.000198329,0.00075686036,0.0019179557,0.00014294479,0.00005609036,0.0017642094,0.00049096544,0.70276177,0.084926076,0.14624009,0.060658358,0.0000863563],"about_ca_topic_score_codex":0.00037769388,"about_ca_topic_score_gemma":0.00048057907,"teacher_disagreement_score":0.0071894396,"about_ca_system_score_codex":0.00035035392,"about_ca_system_score_gemma":0.00028227348,"threshold_uncertainty_score":0.02405113},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30842915,0.0024743485,0.6171639,0.0011017963,0.00026899003,0.00014861814,0.0012758301,0.0014236292,0.0677138],"genre_scores_gemma":[0.8666094,0.0013446284,0.12058333,0.00041893197,0.00014846177,0.00022034034,0.0014176699,0.0003499725,0.008907311],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9971078,0.0005779298,0.00020241489,0.00069267064,0.0007544403,0.0006647102],"domain_scores_gemma":[0.9918296,0.0042311857,0.0012357733,0.0014809502,0.0005807719,0.0006417313],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016605408,0.0010115288,0.001042601,0.0027506368,0.0013188168,0.0038064665,0.0019516309,0.0011906084,0.012004652],"category_scores_gemma":[0.013268911,0.0010707123,0.0010471207,0.003234018,0.0017729459,0.005098079,0.003529058,0.002028639,0.001416636],"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.00045176942,0.00010816208,0.008779877,0.00036177778,0.00009328921,0.00040191703,0.00063492643,0.16002136,0.0076194876,0.7183002,0.010035176,0.093192026],"study_design_scores_gemma":[0.000055402987,0.0001164851,0.0030486793,0.00011916992,0.00007750165,0.0005897289,0.0002599782,0.4351222,0.0067895246,0.5360393,0.0177298,0.000052213385],"about_ca_topic_score_codex":0.0026682739,"about_ca_topic_score_gemma":0.0024889992,"teacher_disagreement_score":0.012004652,"about_ca_system_score_codex":0.002382762,"about_ca_system_score_gemma":0.00066204596,"threshold_uncertainty_score":0.040159523},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.73350537,0.00023484796,0.24270894,0.00040420293,0.00012844427,0.00016165835,0.0004936766,0.00054788176,0.021814989],"genre_scores_gemma":[0.96714514,0.00021520413,0.030092334,0.00011479677,0.000045509103,0.00007593452,0.00078757526,0.000105263905,0.0014182683],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985935,0.0002080991,0.000089397974,0.0002532396,0.00032577998,0.0005299336],"domain_scores_gemma":[0.9962812,0.0017910729,0.0006889201,0.0004671834,0.0003874976,0.00038405275],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063622155,0.00045715552,0.0006602108,0.0007044214,0.00125026,0.0015270116,0.00075075275,0.00084510894,0.003543448],"category_scores_gemma":[0.006411438,0.0005613728,0.00068920944,0.0006189331,0.0017490733,0.0036496818,0.0022675616,0.00122746,0.00033260428],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00084291666,0.00020495028,0.009322859,0.00042804776,0.00007888595,0.003812108,0.0018131123,0.039845556,0.058582753,0.8273622,0.0033923895,0.054314252],"study_design_scores_gemma":[0.00020837416,0.00036616556,0.006979001,0.00012257595,0.00010412176,0.0025741905,0.0031391433,0.085604735,0.050570447,0.8306199,0.019563869,0.00014745463],"about_ca_topic_score_codex":0.0015169726,"about_ca_topic_score_gemma":0.0016548226,"teacher_disagreement_score":0.003543448,"about_ca_system_score_codex":0.0003211933,"about_ca_system_score_gemma":0.0007416628,"threshold_uncertainty_score":0.011853993},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020445539,0.0006908892,0.90288347,0.00066495663,0.00053519604,0.00008796673,0.00042382293,0.00082141336,0.07344678],"genre_scores_gemma":[0.46299115,0.003197467,0.36704612,0.0009072601,0.00056761614,0.00024613892,0.0026032173,0.001639835,0.1608012],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99964905,0.00005919262,0.000012112253,0.000097035394,0.00014306327,0.000039400034],"domain_scores_gemma":[0.99972254,0.00007245456,0.000022683442,0.00008719816,0.00007524131,0.000019963845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022079491,0.000715152,0.0005167237,0.0013716918,0.00065891247,0.00086015573,0.00075590075,0.00058555696,0.017645655],"category_scores_gemma":[0.00134403,0.0003034446,0.00059003773,0.0015351153,0.0009458195,0.0016350243,0.0021588544,0.001713018,0.003945461],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007147129,0.00003224285,0.00021932038,0.0000653389,0.000017127233,0.00007470537,0.00012260182,0.02289281,0.004197822,0.7442507,0.013215081,0.2148409],"study_design_scores_gemma":[0.000016231465,0.00006039561,0.00028716872,0.000023988869,0.000016715607,0.00019686946,0.000101529404,0.11905885,0.0038628478,0.8121742,0.06418327,0.000017896205],"about_ca_topic_score_codex":0.0016105864,"about_ca_topic_score_gemma":0.0012202727,"teacher_disagreement_score":0.017645655,"about_ca_system_score_codex":0.00048765022,"about_ca_system_score_gemma":0.00044163968,"threshold_uncertainty_score":0.059030592},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009395873,0.00016637582,0.9870396,0.00010144805,0.000043124754,0.000076129334,0.000097212986,0.0014909154,0.001589337],"genre_scores_gemma":[0.114270896,0.00019037434,0.88155615,0.0000832371,0.00007675221,0.00024194275,0.0004857106,0.0003449394,0.002749983],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99897814,0.00014588438,0.00007355373,0.00018957558,0.0004991599,0.00011367156],"domain_scores_gemma":[0.99864596,0.0005104742,0.00009214067,0.00040637446,0.00025122668,0.000093906994],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008226309,0.0010970043,0.0013715697,0.00082354853,0.0006773081,0.0010912695,0.0023011325,0.0012281209,0.0068363566],"category_scores_gemma":[0.0050304136,0.00056529697,0.0007632494,0.0014826194,0.000806658,0.0028765013,0.0026996736,0.001426881,0.0023537467],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011548151,0.0002563972,0.0014356413,0.00042727144,0.00010091875,0.0002256855,0.00042458827,0.2675433,0.03856776,0.10651467,0.014883988,0.568465],"study_design_scores_gemma":[0.000113094655,0.000119897544,0.00019361681,0.000017996601,0.000016901373,0.000110718145,0.00003169334,0.93835086,0.0058456236,0.04956647,0.0056126355,0.000020530195],"about_ca_topic_score_codex":0.002107621,"about_ca_topic_score_gemma":0.0019997738,"teacher_disagreement_score":0.0068363566,"about_ca_system_score_codex":0.00078446034,"about_ca_system_score_gemma":0.0008429359,"threshold_uncertainty_score":0.022869885},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012892184,0.0007297622,0.97241896,0.00056201324,0.000113400965,0.000114096314,0.00018775278,0.0030167426,0.009965058],"genre_scores_gemma":[0.12216357,0.00043816134,0.86728215,0.00020633069,0.00011097382,0.00021939838,0.0008385356,0.0005372311,0.008203567],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988674,0.00017301478,0.000057570283,0.0002155256,0.0005043482,0.0001821427],"domain_scores_gemma":[0.9984378,0.00066501345,0.00009059806,0.00040622253,0.00032476426,0.00007556754],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064486056,0.0017241752,0.0016930881,0.0016261046,0.0013859253,0.0020063892,0.0028443767,0.0016597094,0.014354102],"category_scores_gemma":[0.004083869,0.0006785001,0.00091177586,0.0030728811,0.0011760348,0.003294794,0.0029507943,0.0019986245,0.003383944],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005496498,0.0003160149,0.00063522696,0.00026873307,0.000063832005,0.00007857321,0.00018758408,0.17511673,0.00866678,0.0585765,0.027195122,0.7283453],"study_design_scores_gemma":[0.00019418105,0.00009119363,0.00019707538,0.000017441896,0.00003636455,0.00009324732,0.000114409064,0.91530144,0.0063944845,0.06777414,0.009768704,0.000017201906],"about_ca_topic_score_codex":0.003399293,"about_ca_topic_score_gemma":0.008226421,"teacher_disagreement_score":0.014354102,"about_ca_system_score_codex":0.0011370226,"about_ca_system_score_gemma":0.0016687091,"threshold_uncertainty_score":0.04801929},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056570273,0.0006710651,0.92739975,0.0006223858,0.00016092391,0.00031235386,0.0030250535,0.0067747263,0.0044634445],"genre_scores_gemma":[0.42691088,0.00075582427,0.5580357,0.0005446491,0.00024111952,0.0007650696,0.007886987,0.00075608236,0.004103694],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99599,0.00052256975,0.0007320888,0.00054372405,0.0018478093,0.00036386843],"domain_scores_gemma":[0.9827276,0.0042144097,0.0018977545,0.008414159,0.0024123506,0.00033371776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019326204,0.0011096151,0.0021935783,0.002215284,0.0010564603,0.0035765707,0.0034077244,0.0012859502,0.006099591],"category_scores_gemma":[0.020087143,0.0009633706,0.0007903346,0.004894132,0.0014679821,0.012429755,0.0053298944,0.0016459596,0.0033375209],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0027345726,0.0005714316,0.010010347,0.0011545416,0.00013940176,0.00038806963,0.0011455984,0.123943605,0.062532865,0.17321911,0.028394062,0.5957664],"study_design_scores_gemma":[0.0005741,0.00129616,0.0021455395,0.00025002766,0.00016047663,0.0008623359,0.0007486383,0.61413205,0.1244321,0.18638024,0.068749905,0.00026839483],"about_ca_topic_score_codex":0.0011701103,"about_ca_topic_score_gemma":0.0016989398,"teacher_disagreement_score":0.006099591,"about_ca_system_score_codex":0.0011508403,"about_ca_system_score_gemma":0.0022519513,"threshold_uncertainty_score":0.020405114},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7179477,0.0017589869,0.24832211,0.0017741934,0.0000999881,0.000086187974,0.0022637376,0.0005722007,0.027174877],"genre_scores_gemma":[0.977191,0.0003488525,0.020066233,0.000084968815,0.000060643102,0.000084244406,0.0005666611,0.000051390427,0.001546074],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982383,0.0003805481,0.00009759661,0.0003034681,0.0004936096,0.00048648688],"domain_scores_gemma":[0.98867714,0.007962681,0.00081653765,0.0011016254,0.00065036543,0.0007917453],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011530201,0.0004450209,0.00086695695,0.0016580864,0.0009712656,0.0036584192,0.0012286362,0.00079743704,0.0044281175],"category_scores_gemma":[0.010314028,0.0005116421,0.0006226176,0.001729337,0.0021899366,0.0050233896,0.0030076653,0.0017244715,0.00019837779],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004200369,0.00008260962,0.0090378625,0.00033572668,0.0000749374,0.00021896606,0.00090004073,0.16058321,0.005916876,0.7799916,0.006400866,0.036037304],"study_design_scores_gemma":[0.00004501382,0.00005372744,0.0025856465,0.00006901412,0.000031725685,0.00025025036,0.00020525577,0.42370182,0.0029330538,0.5644492,0.0056412653,0.000034034354],"about_ca_topic_score_codex":0.0017124662,"about_ca_topic_score_gemma":0.0011780333,"teacher_disagreement_score":0.0044281175,"about_ca_system_score_codex":0.0014795582,"about_ca_system_score_gemma":0.000587176,"threshold_uncertainty_score":0.014813542},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06271581,0.0019417313,0.8599668,0.0037518642,0.0011704366,0.00020106148,0.0016053327,0.00055181206,0.06809517],"genre_scores_gemma":[0.6303889,0.0023617407,0.26581037,0.0010751768,0.0007824831,0.00039034983,0.004306527,0.0005006392,0.094383724],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991517,0.00019963154,0.000060295206,0.00023892401,0.0002558755,0.00009359951],"domain_scores_gemma":[0.99841595,0.0007815082,0.00013324777,0.0002812743,0.0002825842,0.00010537711],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096037483,0.0005598363,0.0015078821,0.0006533272,0.0010284891,0.0022764585,0.0033958103,0.002641149,0.012407951],"category_scores_gemma":[0.005793022,0.00040057002,0.0008600238,0.001064779,0.0011400861,0.0044784625,0.0021576693,0.002437485,0.0022871785],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047562242,0.00020531983,0.00089897297,0.0009813732,0.00009071805,0.0003739202,0.00019227296,0.19625464,0.0027088847,0.59864765,0.047509775,0.15166089],"study_design_scores_gemma":[0.000095025716,0.00006023388,0.0002251057,0.00006731851,0.00003698832,0.00051070884,0.00017425195,0.57338494,0.0019230536,0.40627393,0.01720819,0.00004020263],"about_ca_topic_score_codex":0.0016365586,"about_ca_topic_score_gemma":0.001411137,"teacher_disagreement_score":0.012407951,"about_ca_system_score_codex":0.0008504433,"about_ca_system_score_gemma":0.00091087545,"threshold_uncertainty_score":0.041508734},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.066983856,0.008237443,0.828518,0.0028777998,0.0005234134,0.000086754255,0.00063076435,0.0009893564,0.09115274],"genre_scores_gemma":[0.52939385,0.01379644,0.41332486,0.0016491872,0.0014852391,0.00041402338,0.0016966639,0.0017261654,0.036513526],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976084,0.000681748,0.00009644652,0.0005672101,0.0007845786,0.00026163485],"domain_scores_gemma":[0.98468494,0.009529073,0.0011208948,0.0023542724,0.001391978,0.00091883604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035764247,0.0023614573,0.0015543115,0.006349226,0.0016150345,0.00500668,0.0042867176,0.002400543,0.0136544015],"category_scores_gemma":[0.031404193,0.0014618399,0.001090135,0.0067516724,0.0045397333,0.014225796,0.0046329475,0.00935539,0.0031539057],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001168924,0.00008718775,0.001606146,0.000254163,0.0000179301,0.00008480414,0.0003003032,0.049859602,0.0017612017,0.8670618,0.011523628,0.06732641],"study_design_scores_gemma":[0.000012354767,0.000040514973,0.000671997,0.00013548258,0.000028000943,0.0002092879,0.0001250724,0.18969409,0.0018714373,0.79220307,0.014960893,0.000047860838],"about_ca_topic_score_codex":0.0024537048,"about_ca_topic_score_gemma":0.0029352952,"teacher_disagreement_score":0.0136544015,"about_ca_system_score_codex":0.0029486192,"about_ca_system_score_gemma":0.0010107986,"threshold_uncertainty_score":0.045678556},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020544457,0.00005335618,0.9931593,0.000055327782,0.00008019716,0.000077921315,0.00008426935,0.0023389522,0.0020961524],"genre_scores_gemma":[0.024092326,0.000056141023,0.9694595,0.000058215144,0.0000374397,0.0001899527,0.00058464,0.0008281248,0.0046936153],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980882,0.0003018141,0.00017178344,0.0004543219,0.0007731077,0.00021065741],"domain_scores_gemma":[0.99763334,0.00071403675,0.00008856427,0.0007313497,0.0007279407,0.000104651604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016017373,0.0017553453,0.001697994,0.0020937228,0.0011120633,0.0027395685,0.0030593243,0.0015629795,0.03001269],"category_scores_gemma":[0.0068480796,0.00081078085,0.0021413574,0.0022848663,0.00094649027,0.0029872353,0.0036146082,0.002122653,0.014033761],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040580425,0.000116819916,0.00095168443,0.00028725146,0.00011652883,0.00016889325,0.00031634915,0.102976605,0.013859353,0.08258235,0.020389704,0.7778287],"study_design_scores_gemma":[0.00019412646,0.0001591928,0.00031509477,0.00005053242,0.00005101459,0.00026066258,0.00015391079,0.83329624,0.015298835,0.098394535,0.051763717,0.00006211683],"about_ca_topic_score_codex":0.0045075133,"about_ca_topic_score_gemma":0.0049966695,"teacher_disagreement_score":0.03001269,"about_ca_system_score_codex":0.0011907802,"about_ca_system_score_gemma":0.0017830253,"threshold_uncertainty_score":0.100402474},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030834222,0.000962093,0.96271956,0.00017902984,0.000057708294,0.000026420932,0.00008948423,0.0004932605,0.004638155],"genre_scores_gemma":[0.44258362,0.00062062574,0.55191267,0.00015657807,0.00008191725,0.000100964535,0.00025885896,0.0002481348,0.0040366272],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99920017,0.00023434994,0.000052761607,0.000107906446,0.00032728777,0.000077465906],"domain_scores_gemma":[0.9972084,0.0019333618,0.000113101676,0.0004376132,0.00024752397,0.000060022547],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087924465,0.0004539499,0.0014266777,0.00123314,0.00044149382,0.0014359629,0.0012513698,0.0009942974,0.004598764],"category_scores_gemma":[0.007485812,0.00048759187,0.00054868683,0.0016876888,0.000899233,0.002830739,0.0023834433,0.0011369181,0.0005760245],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00053325196,0.0001284576,0.0019656965,0.0005298154,0.00009681454,0.00028733717,0.0003755798,0.53829896,0.007984934,0.15219712,0.0065612975,0.29104072],"study_design_scores_gemma":[0.000023212137,0.000039200284,0.0001455834,0.000014944863,0.000011964252,0.000115662355,0.0000378627,0.944451,0.002166654,0.051019456,0.0019640187,0.000010482124],"about_ca_topic_score_codex":0.001098222,"about_ca_topic_score_gemma":0.0013285537,"teacher_disagreement_score":0.004598764,"about_ca_system_score_codex":0.000424177,"about_ca_system_score_gemma":0.000346844,"threshold_uncertainty_score":0.015384436},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042309187,0.000087967324,0.9535024,0.00006884324,0.0000141832,0.000051146246,0.00009251201,0.0016361999,0.0022375786],"genre_scores_gemma":[0.3670257,0.00010264061,0.6297712,0.000044076776,0.000017793722,0.000095056224,0.00044537327,0.0003420912,0.0021560804],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999411,0.00009673457,0.000042172516,0.00010313439,0.00021643982,0.00013049936],"domain_scores_gemma":[0.9986093,0.0005395804,0.0001849292,0.00036124393,0.00021608685,0.00008889481],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042728346,0.0006529055,0.0007489977,0.0010060597,0.0005352196,0.0013425344,0.0011628884,0.0005272095,0.003386579],"category_scores_gemma":[0.0036890325,0.00045289614,0.00080183137,0.001173659,0.00085506716,0.0022533496,0.0018382925,0.0008508591,0.00062269234],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011812446,0.00015872774,0.0040057087,0.00032872782,0.000081321705,0.00044521262,0.00077788025,0.39627025,0.057108514,0.103192806,0.0052479133,0.4312017],"study_design_scores_gemma":[0.0000726818,0.00012417047,0.00045799575,0.000019176547,0.000016809874,0.00012538796,0.000093348965,0.9296785,0.021464618,0.04416727,0.0037583471,0.0000217621],"about_ca_topic_score_codex":0.004365749,"about_ca_topic_score_gemma":0.005402786,"teacher_disagreement_score":0.004365749,"about_ca_system_score_codex":0.00075260515,"about_ca_system_score_gemma":0.0009598547,"threshold_uncertainty_score":0.011329234},"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":"empirical","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5367442,0.0008136652,0.44184592,0.00034333736,0.00006751832,0.00014136806,0.0003833079,0.00038371517,0.019277077],"genre_scores_gemma":[0.8815945,0.0005652687,0.1123961,0.00006212731,0.000039491308,0.00009476707,0.0004326541,0.00009967865,0.004715317],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999171,0.00017975832,0.00005375779,0.00010526278,0.00029529392,0.00019503669],"domain_scores_gemma":[0.99733657,0.0011906539,0.00046875796,0.0004492671,0.00038289462,0.0001716955],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006393843,0.00042841912,0.00044600808,0.0012924352,0.0010968768,0.00096278155,0.0006700069,0.0009299461,0.008352808],"category_scores_gemma":[0.004350748,0.0005904644,0.00064915355,0.0013583389,0.0013277188,0.0020388144,0.0026548414,0.0009558111,0.0008806171],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017317235,0.00022095366,0.011746801,0.0004803929,0.00015634176,0.002390633,0.0015905326,0.3633882,0.056954585,0.2889974,0.0062131663,0.2661293],"study_design_scores_gemma":[0.00016716929,0.00031286126,0.0032405579,0.00012784268,0.00009966107,0.0013761566,0.0013657688,0.6506964,0.031270657,0.29507327,0.01620826,0.00006144421],"about_ca_topic_score_codex":0.002289847,"about_ca_topic_score_gemma":0.002683163,"teacher_disagreement_score":0.008352808,"about_ca_system_score_codex":0.0006252797,"about_ca_system_score_gemma":0.00035941304,"threshold_uncertainty_score":0.027942955},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.075502045,0.00012202575,0.914386,0.00008798092,0.00010430252,0.00011544421,0.0003853736,0.0019993463,0.0072974996],"genre_scores_gemma":[0.35777,0.00010171456,0.633977,0.000052946554,0.000020505158,0.00011034116,0.001246653,0.0005348443,0.006186073],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995633,0.000039832743,0.000027077234,0.0001083138,0.00017677603,0.000084701016],"domain_scores_gemma":[0.9991021,0.00024345567,0.000067909736,0.0003817565,0.0001379026,0.00006692663],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029391597,0.0006466888,0.00077008695,0.00063425663,0.0006892023,0.000656335,0.00090473203,0.0006757257,0.0076716663],"category_scores_gemma":[0.0016948736,0.00038936513,0.0006578398,0.00076346216,0.00079227786,0.0009134693,0.0027566326,0.0010000698,0.0015111221],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011675946,0.00022670261,0.00650664,0.0005476755,0.000121881465,0.0011922254,0.00087804714,0.3454928,0.054186422,0.07777782,0.016261565,0.4956406],"study_design_scores_gemma":[0.00008090707,0.00028897496,0.001625268,0.000049722144,0.00003400354,0.0005885556,0.00033502522,0.85605484,0.037733253,0.07736401,0.025801724,0.000043706357],"about_ca_topic_score_codex":0.0011428931,"about_ca_topic_score_gemma":0.002149155,"teacher_disagreement_score":0.0076716663,"about_ca_system_score_codex":0.0002919646,"about_ca_system_score_gemma":0.0002891231,"threshold_uncertainty_score":0.02566421},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17856666,0.00072223553,0.81266624,0.00059584714,0.000037733385,0.00009756448,0.000262185,0.00052129285,0.006530295],"genre_scores_gemma":[0.4239967,0.0007201064,0.56833124,0.000106664076,0.000039233197,0.00014705275,0.00062478194,0.00026938814,0.0057648337],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989742,0.0002867492,0.000058661048,0.00020464743,0.00029988476,0.00017585489],"domain_scores_gemma":[0.9971643,0.0017379113,0.000370829,0.0003620391,0.00017629575,0.00018852006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011993102,0.0010129686,0.0012503517,0.0013138871,0.00081676064,0.001559852,0.001582642,0.0018350572,0.0037503024],"category_scores_gemma":[0.007303089,0.00086451677,0.0008650095,0.0025473854,0.0012516654,0.003753541,0.00136913,0.00128795,0.0005939263],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039859442,0.00013304909,0.0014310948,0.00026404188,0.000052207026,0.000102475155,0.00016560405,0.82537663,0.009592824,0.05822394,0.003305414,0.10095416],"study_design_scores_gemma":[0.0000342408,0.00009132265,0.00041442836,0.000021290463,0.000021611595,0.0000811621,0.00009383577,0.9339591,0.0039604846,0.059884578,0.0014265375,0.000011317507],"about_ca_topic_score_codex":0.003402831,"about_ca_topic_score_gemma":0.0047998703,"teacher_disagreement_score":0.0037503024,"about_ca_system_score_codex":0.0014446073,"about_ca_system_score_gemma":0.0010988509,"threshold_uncertainty_score":0.012546003},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78651553,0.0009581335,0.1901394,0.00074929284,0.0000343419,0.00006837758,0.0003410222,0.00030694,0.020887025],"genre_scores_gemma":[0.96569324,0.00046515386,0.03076065,0.000089706555,0.00004642708,0.00005286346,0.00028674796,0.00006878,0.0025363935],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991485,0.00018095688,0.000038508515,0.0001964497,0.00029960374,0.00013608737],"domain_scores_gemma":[0.9926301,0.00417804,0.0015024121,0.0005160465,0.00052644,0.0006468502],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067350594,0.00045528554,0.0004613329,0.0020628339,0.00077665,0.0020435436,0.0011846545,0.0009722285,0.0039816326],"category_scores_gemma":[0.0064128446,0.000493115,0.000534633,0.0011858237,0.0018119066,0.0034739561,0.0011554076,0.0010852783,0.00035679474],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023783196,0.000107895685,0.008062985,0.00034766298,0.0000548878,0.00067310414,0.001855433,0.109889805,0.019431025,0.8210347,0.0021751435,0.036129557],"study_design_scores_gemma":[0.00006720041,0.00022061131,0.009964141,0.00008902209,0.000053121537,0.0018408461,0.0014663907,0.4427265,0.011796419,0.5174935,0.014185464,0.000096796546],"about_ca_topic_score_codex":0.0027038122,"about_ca_topic_score_gemma":0.0022937057,"teacher_disagreement_score":0.0039816326,"about_ca_system_score_codex":0.0013795655,"about_ca_system_score_gemma":0.00035490532,"threshold_uncertainty_score":0.01331985},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006228086,0.00078163383,0.9799329,0.00056343473,0.00010366273,0.00018153063,0.0006404984,0.0042148996,0.007353376],"genre_scores_gemma":[0.048551474,0.00053564284,0.9430778,0.00019037978,0.00006627487,0.00023471689,0.0015995536,0.00069467956,0.005049508],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985065,0.00023756638,0.00014633471,0.000402052,0.00045759787,0.00024997548],"domain_scores_gemma":[0.99736637,0.0012484061,0.000111569825,0.00076456857,0.0003938724,0.0001152694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011347914,0.001914285,0.0017442743,0.0013610467,0.0013659637,0.002411044,0.0035954728,0.0021177148,0.0149067845],"category_scores_gemma":[0.0056709,0.0012217765,0.0014148491,0.0033399279,0.0010109931,0.0057005994,0.0035078393,0.0033420748,0.00552543],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037552038,0.00034495952,0.0009880256,0.00074340624,0.00009586556,0.000208541,0.00035430686,0.20696814,0.004085648,0.120431304,0.04762376,0.61778057],"study_design_scores_gemma":[0.00019474671,0.000098295226,0.00018931205,0.00010321134,0.000044006276,0.00017880613,0.0001974752,0.62746876,0.0020827006,0.34358767,0.025815478,0.000039506907],"about_ca_topic_score_codex":0.00555042,"about_ca_topic_score_gemma":0.007862715,"teacher_disagreement_score":0.0149067845,"about_ca_system_score_codex":0.0016956507,"about_ca_system_score_gemma":0.0026491222,"threshold_uncertainty_score":0.049868166},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008882609,0.0005633813,0.97519976,0.0007881001,0.00011368774,0.00012094474,0.0006223295,0.0007353682,0.012973875],"genre_scores_gemma":[0.14804235,0.0009423187,0.83801615,0.0005116813,0.00017620037,0.00032260994,0.0027155953,0.0003712492,0.008901916],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99551827,0.0015516145,0.0002592882,0.0009909859,0.0013115793,0.0003682955],"domain_scores_gemma":[0.991366,0.006429484,0.0004290441,0.000555989,0.0010206404,0.00019894697],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027222666,0.0012810309,0.0012108496,0.0013135205,0.0010955955,0.0031086432,0.0019939248,0.0011272336,0.0125236325],"category_scores_gemma":[0.011545583,0.0009846387,0.0014411308,0.0033508393,0.0019850829,0.0043475516,0.0030540482,0.002986886,0.0022196507],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032342106,0.00017390602,0.0010137828,0.0010541182,0.00014207285,0.00045247452,0.00064032397,0.12583244,0.0044423244,0.4537407,0.039903633,0.37228087],"study_design_scores_gemma":[0.00009054233,0.000062202904,0.00026261027,0.00010932848,0.000042856704,0.00030840607,0.00030697993,0.45869136,0.0042654267,0.50560004,0.030216351,0.000043916392],"about_ca_topic_score_codex":0.003603824,"about_ca_topic_score_gemma":0.005713831,"teacher_disagreement_score":0.0125236325,"about_ca_system_score_codex":0.0015743581,"about_ca_system_score_gemma":0.0013580984,"threshold_uncertainty_score":0.041895688},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25904247,0.00078625075,0.7175728,0.00033637712,0.00012850881,0.00036768673,0.0015480616,0.002874919,0.017342815],"genre_scores_gemma":[0.5164033,0.00033251,0.4740184,0.000039669372,0.000023996046,0.00016505341,0.0022316375,0.0006061877,0.0061791902],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993767,0.00008809068,0.00004590812,0.00018064231,0.00013420753,0.00017443205],"domain_scores_gemma":[0.9992487,0.0003269892,0.000080418235,0.0001566262,0.00009011536,0.00009707074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003335302,0.0006759289,0.0012142343,0.0011397636,0.000888468,0.0010298883,0.00151701,0.00089568435,0.010445145],"category_scores_gemma":[0.0034733124,0.00067333365,0.0011191032,0.00064750283,0.000728979,0.0021833023,0.0026487126,0.0007753762,0.0019132976],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0031727517,0.0005834977,0.008827605,0.001779895,0.00018360745,0.0019521328,0.001634956,0.15927498,0.09587716,0.04098578,0.02349645,0.6622312],"study_design_scores_gemma":[0.00045757048,0.0015308586,0.006998332,0.00037759307,0.00026723064,0.0021972582,0.004045226,0.6887929,0.135097,0.10610235,0.053899612,0.00023415101],"about_ca_topic_score_codex":0.0009844492,"about_ca_topic_score_gemma":0.0017179421,"teacher_disagreement_score":0.010445145,"about_ca_system_score_codex":0.00022946164,"about_ca_system_score_gemma":0.0008068033,"threshold_uncertainty_score":0.034942508},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03088446,0.0000888522,0.9604009,0.00011051551,0.0000685398,0.00010520321,0.00015714344,0.0016740566,0.006510297],"genre_scores_gemma":[0.21747649,0.00022598583,0.774057,0.00008081637,0.000027151435,0.00013241345,0.0006416034,0.0005430504,0.00681556],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994295,0.0000636067,0.000036379308,0.000116547424,0.00027328572,0.00008059826],"domain_scores_gemma":[0.99935776,0.0001493074,0.0000782022,0.00024026074,0.00013184626,0.00004262803],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034008792,0.0005639725,0.0005489471,0.000883428,0.0005026183,0.00090397766,0.0008374793,0.0005536178,0.006645222],"category_scores_gemma":[0.0021528588,0.0005248762,0.0007285491,0.00080401386,0.0007511299,0.001455207,0.0023716185,0.001051467,0.0010546594],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021132024,0.00008105442,0.0011942048,0.00022235264,0.000040343904,0.00025473558,0.00031669482,0.088596314,0.04029445,0.17742229,0.0095526,0.6818136],"study_design_scores_gemma":[0.00010293776,0.0002086599,0.000928968,0.000057042264,0.00006757522,0.0008282285,0.00033960573,0.6299047,0.058499668,0.2255616,0.08341918,0.00008190384],"about_ca_topic_score_codex":0.0010044115,"about_ca_topic_score_gemma":0.0013112013,"teacher_disagreement_score":0.006645222,"about_ca_system_score_codex":0.00039541966,"about_ca_system_score_gemma":0.00034294522,"threshold_uncertainty_score":0.022230506},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012460583,0.00026775495,0.98409545,0.00017533793,0.00006887463,0.000049334143,0.00022526187,0.00060018577,0.0020572012],"genre_scores_gemma":[0.46316853,0.0011568489,0.52335,0.00037447654,0.0002348643,0.00036235264,0.0014027017,0.00040710263,0.009543156],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983359,0.00035250944,0.000080600876,0.00036910904,0.00063666306,0.00022521734],"domain_scores_gemma":[0.99672985,0.0010361611,0.0003402675,0.00066613645,0.00094653736,0.00028100048],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017264189,0.00091782835,0.0013066336,0.0017244631,0.0007517067,0.0021127216,0.0030303667,0.0023375913,0.0038021274],"category_scores_gemma":[0.012007474,0.00071496767,0.0013622604,0.001926652,0.0021802306,0.002633651,0.0038427904,0.0017198725,0.002395443],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006788472,0.00008058841,0.004514776,0.0003216235,0.000091201764,0.00051258766,0.0004255491,0.65845037,0.010198131,0.21080403,0.011596994,0.10232526],"study_design_scores_gemma":[0.000032686472,0.000076833254,0.00044414512,0.00003246379,0.00001700831,0.0001822514,0.00005244357,0.9594291,0.002576857,0.030091189,0.007029082,0.000035877885],"about_ca_topic_score_codex":0.010501293,"about_ca_topic_score_gemma":0.006275321,"teacher_disagreement_score":0.010501293,"about_ca_system_score_codex":0.0015904867,"about_ca_system_score_gemma":0.002048898,"threshold_uncertainty_score":0.020880342},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018752543,0.00050470565,0.9405771,0.0005853641,0.00016539122,0.00039677622,0.0008353005,0.012369171,0.025813663],"genre_scores_gemma":[0.07300325,0.00031824425,0.9080227,0.00015408805,0.000049103783,0.00033173925,0.0018531034,0.0011840672,0.015083655],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99957186,0.000056861667,0.00003220169,0.00013939368,0.00014086034,0.00005886359],"domain_scores_gemma":[0.9990545,0.00037463574,0.00011591929,0.0002441709,0.00013392788,0.00007686],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032187812,0.0010385691,0.0006699101,0.0010186228,0.00089467573,0.0014689729,0.0018589231,0.0010039251,0.03511042],"category_scores_gemma":[0.0017400401,0.00051824,0.00069591624,0.0017009677,0.00065232336,0.0019999975,0.0017804488,0.0009572529,0.012542729],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00066726183,0.0002701694,0.0008690688,0.0005968313,0.00005102241,0.00025062455,0.0002346807,0.018119859,0.030280974,0.011908759,0.064764835,0.8719859],"study_design_scores_gemma":[0.0011499434,0.00069291395,0.003680033,0.0002769267,0.00012513668,0.0021645706,0.00083358405,0.59374297,0.052934356,0.111679204,0.23253895,0.00018144859],"about_ca_topic_score_codex":0.0019431618,"about_ca_topic_score_gemma":0.004798666,"teacher_disagreement_score":0.03511042,"about_ca_system_score_codex":0.0007391991,"about_ca_system_score_gemma":0.0010766895,"threshold_uncertainty_score":0.11745602},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6927738,0.0008121741,0.2840851,0.0013809896,0.000063591586,0.00011230531,0.00088925275,0.0009947445,0.018888049],"genre_scores_gemma":[0.8813266,0.0006346755,0.10827617,0.00014471427,0.00009488874,0.00017141526,0.0015688891,0.0003741182,0.0074085123],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980793,0.0003749179,0.00011335384,0.00048513283,0.00043453675,0.00051272847],"domain_scores_gemma":[0.99371064,0.0035522208,0.0007470654,0.0011440564,0.00033300387,0.0005129386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084724155,0.00072823395,0.0013060855,0.0011183172,0.0018806993,0.0036447556,0.0018297553,0.0016669275,0.014206852],"category_scores_gemma":[0.009018626,0.0007486352,0.0010809762,0.0025072182,0.0020001193,0.007783541,0.0026162583,0.001991829,0.001927161],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009723097,0.00019121598,0.009333349,0.0005021741,0.00010926817,0.00052271504,0.0006528308,0.5317126,0.017814964,0.34127313,0.009533939,0.08738149],"study_design_scores_gemma":[0.000049595743,0.00014407284,0.0020017168,0.000033169155,0.000046201694,0.00033671272,0.00029920216,0.57628727,0.0058650817,0.40897888,0.0059181694,0.000039895942],"about_ca_topic_score_codex":0.0019174753,"about_ca_topic_score_gemma":0.002066829,"teacher_disagreement_score":0.014206852,"about_ca_system_score_codex":0.0020343484,"about_ca_system_score_gemma":0.0006650584,"threshold_uncertainty_score":0.047526658},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2279235,0.0005264342,0.76454526,0.00028754547,0.00011820227,0.0001177666,0.0011519378,0.0014208995,0.0039085452],"genre_scores_gemma":[0.6228578,0.00029799444,0.37284818,0.000040223153,0.00005154348,0.000067397086,0.0014864199,0.00019299878,0.0021574094],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99914646,0.0001611591,0.000056913406,0.00025609165,0.00028248073,0.00009680825],"domain_scores_gemma":[0.99651706,0.0021138887,0.0002431794,0.0004950084,0.0004401596,0.00019067757],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042545548,0.00072718813,0.001233459,0.0019043873,0.00062873727,0.0016748491,0.0015985691,0.0022247783,0.0036470923],"category_scores_gemma":[0.007842888,0.0010157842,0.0007845624,0.0011947094,0.00075596734,0.0018750097,0.0012407575,0.0013284936,0.0013021071],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00152601,0.0001765055,0.020670386,0.00044207694,0.00016259257,0.00050558825,0.00015956015,0.6100462,0.039770205,0.016932365,0.005156427,0.30445212],"study_design_scores_gemma":[0.000020903613,0.000055615586,0.0020815965,0.000020892892,0.000013698039,0.00012625408,0.000059292885,0.9835089,0.006768655,0.00652387,0.00080579286,0.000014505093],"about_ca_topic_score_codex":0.0032348314,"about_ca_topic_score_gemma":0.0034704218,"teacher_disagreement_score":0.0036470923,"about_ca_system_score_codex":0.0004514397,"about_ca_system_score_gemma":0.0005348498,"threshold_uncertainty_score":0.012200713},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10538456,0.00029486706,0.88426477,0.00011776838,0.00006300021,0.00006230848,0.0001470403,0.0003326565,0.0093329875],"genre_scores_gemma":[0.64870536,0.0006509688,0.34346247,0.000051225958,0.00004677852,0.00008160421,0.0002974048,0.00022698725,0.006477112],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99973756,0.000058524536,0.000011134623,0.000033769415,0.00013479816,0.000024313364],"domain_scores_gemma":[0.998917,0.0006027627,0.00009641071,0.00017545334,0.00014577464,0.000062569954],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040098856,0.0004638322,0.0005568248,0.0010296279,0.0003131405,0.0010739891,0.0008777928,0.00055390917,0.0023832766],"category_scores_gemma":[0.004069751,0.00045277615,0.00037986191,0.0008970453,0.00070545566,0.0009169137,0.0013360032,0.0010587212,0.00040842837],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027127637,0.000090062575,0.0011758719,0.00015415686,0.000028817367,0.00016083386,0.00033865834,0.7251454,0.00970925,0.13435453,0.0018542857,0.1267169],"study_design_scores_gemma":[0.000013059275,0.00003892668,0.000115137685,0.000013460812,0.0000061617684,0.000063966116,0.00003969849,0.9663314,0.0016903522,0.029107116,0.002575489,0.000005246799],"about_ca_topic_score_codex":0.0014680289,"about_ca_topic_score_gemma":0.001932717,"teacher_disagreement_score":0.0023832766,"about_ca_system_score_codex":0.00044652645,"about_ca_system_score_gemma":0.00033343225,"threshold_uncertainty_score":0.007972777},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29559347,0.0010504719,0.52368355,0.0028940856,0.0023502116,0.0005331143,0.0022956992,0.0061002187,0.16549912],"genre_scores_gemma":[0.7354436,0.000757698,0.1861821,0.00071728387,0.00015149973,0.000254441,0.0019935614,0.0015278885,0.072971955],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994498,0.00004891998,0.00002446581,0.00013226131,0.0001560254,0.00018848799],"domain_scores_gemma":[0.999204,0.000117191004,0.00007894198,0.000363543,0.0001021816,0.00013418356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039733012,0.0006766188,0.0007010291,0.0003797426,0.0015394607,0.0012706448,0.0010019104,0.001034015,0.03087728],"category_scores_gemma":[0.0024777493,0.00052601035,0.0011663046,0.00034546736,0.0016202119,0.002807418,0.0036155048,0.0012446726,0.00839514],"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.0023017658,0.0002442072,0.007956093,0.0006828018,0.00010641459,0.0035248818,0.001972648,0.026916264,0.09479748,0.31515932,0.086005814,0.46033236],"study_design_scores_gemma":[0.00018015226,0.0012239062,0.0052290037,0.00047657068,0.00013758444,0.0042622485,0.0036593245,0.11472383,0.12826298,0.25595006,0.4856161,0.00027816923],"about_ca_topic_score_codex":0.0011162907,"about_ca_topic_score_gemma":0.0014996657,"teacher_disagreement_score":0.03087728,"about_ca_system_score_codex":0.00048561548,"about_ca_system_score_gemma":0.00048945035,"threshold_uncertainty_score":0.10329485},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6667562,0.00096410816,0.30506203,0.0011738763,0.00006613913,0.00015215215,0.0006939573,0.000312304,0.024819195],"genre_scores_gemma":[0.9182664,0.00094466476,0.07564704,0.00014238781,0.00012988602,0.00013968545,0.0008247567,0.00016311301,0.0037419982],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99904495,0.00020656553,0.00006054972,0.00023562892,0.0002940955,0.00015823722],"domain_scores_gemma":[0.98514485,0.008597995,0.0026566368,0.0014907593,0.0012041715,0.00090544455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000794752,0.00063990394,0.0007912035,0.0029950037,0.0016187669,0.0028996347,0.0017772855,0.0011461115,0.0050637084],"category_scores_gemma":[0.010233836,0.0008951899,0.00083095476,0.0025307923,0.0031181725,0.005470499,0.0019694571,0.0016974395,0.0005414534],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002540543,0.00015678858,0.0075125815,0.00031460501,0.000048250058,0.0004589698,0.0014648132,0.16300635,0.010134009,0.7787126,0.0026827736,0.03525431],"study_design_scores_gemma":[0.00004125162,0.00014587998,0.0034331712,0.00006657296,0.000040914125,0.00083367724,0.0007298957,0.28512168,0.0042784465,0.69871217,0.006542606,0.000053772503],"about_ca_topic_score_codex":0.0023275942,"about_ca_topic_score_gemma":0.00277629,"teacher_disagreement_score":0.0050637084,"about_ca_system_score_codex":0.0017938482,"about_ca_system_score_gemma":0.00066602184,"threshold_uncertainty_score":0.016939819},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036854707,0.00010233552,0.94958264,0.00013107699,0.000048482907,0.0001922634,0.0003190403,0.0054490007,0.007320533],"genre_scores_gemma":[0.18949044,0.00016771107,0.80221176,0.00004976753,0.00002918019,0.00013984468,0.0016166491,0.00052800495,0.005766575],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99963737,0.000032720294,0.000023953386,0.000092848844,0.0001606561,0.000052471256],"domain_scores_gemma":[0.999428,0.00021539928,0.00007068557,0.00012593724,0.00011207971,0.000047858222],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018855621,0.0008794156,0.00070554344,0.0007563312,0.0005111429,0.0007997711,0.0012155327,0.0006182371,0.014057572],"category_scores_gemma":[0.0015995656,0.0003652523,0.0006451498,0.0008847838,0.00048631866,0.0014050438,0.0011337111,0.00052422343,0.0032310097],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040390284,0.00015648815,0.0024041783,0.00058327976,0.00007920396,0.0005397578,0.0003145592,0.06393049,0.07102049,0.014252038,0.013839188,0.8324764],"study_design_scores_gemma":[0.00022901448,0.00051575067,0.0028717087,0.00006211071,0.00007105351,0.0013989145,0.00054114754,0.8442459,0.05407025,0.057564028,0.038358428,0.00007167098],"about_ca_topic_score_codex":0.0018271045,"about_ca_topic_score_gemma":0.004670914,"teacher_disagreement_score":0.014057572,"about_ca_system_score_codex":0.00035327673,"about_ca_system_score_gemma":0.00070800725,"threshold_uncertainty_score":0.04702729},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0513347,0.00014320284,0.94000393,0.00014294658,0.000026200027,0.00006531017,0.00008914489,0.0010874268,0.007107081],"genre_scores_gemma":[0.3957506,0.000094855044,0.5988599,0.000056590212,0.000015626661,0.00011953432,0.00019216053,0.00010799047,0.004802745],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998454,0.000021528927,0.0000062715517,0.00003225452,0.000071470975,0.000023003215],"domain_scores_gemma":[0.9998147,0.00005557942,0.000017101383,0.00006587134,0.000030717594,0.000016084043],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015878088,0.00022813007,0.0005156261,0.000306508,0.00049742754,0.0004594811,0.00089164276,0.00044202292,0.0043654856],"category_scores_gemma":[0.0005560407,0.00021992234,0.00024606154,0.0006007906,0.00036310582,0.00064858154,0.000776761,0.0004098844,0.00063152774],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025274706,0.00008762914,0.001313211,0.00011046462,0.000035354085,0.00014301197,0.00016076231,0.7080958,0.019711496,0.032721285,0.004408145,0.23296013],"study_design_scores_gemma":[0.000030564253,0.000032780023,0.00017850094,0.0000025665065,0.000005104619,0.00003476707,0.000014966483,0.9847125,0.002948837,0.009117702,0.002916385,0.000005309113],"about_ca_topic_score_codex":0.0035675468,"about_ca_topic_score_gemma":0.006562975,"teacher_disagreement_score":0.0043654856,"about_ca_system_score_codex":0.00044433316,"about_ca_system_score_gemma":0.0006501907,"threshold_uncertainty_score":0.014603972},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014825059,0.00005858523,0.99616843,0.000038005575,0.000024739331,0.000063201274,0.000062133906,0.0003944956,0.0017078843],"genre_scores_gemma":[0.039426845,0.00014946466,0.9575817,0.00005074282,0.000014695958,0.00020446823,0.00029272915,0.0002704412,0.0020090195],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986713,0.00019244125,0.00008625881,0.00031551166,0.00063062366,0.00010382159],"domain_scores_gemma":[0.9989833,0.00025863975,0.00006992927,0.00034396537,0.00029224862,0.00005186137],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073107897,0.0006230361,0.0007828537,0.0013444071,0.00089527265,0.0013375627,0.0020357836,0.00097259576,0.010628541],"category_scores_gemma":[0.0037008564,0.0007985462,0.0008540018,0.0008166653,0.0010233369,0.0015662488,0.0044468613,0.0015645534,0.003212527],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013221533,0.000051695,0.001462554,0.00055822695,0.000067956586,0.00037011845,0.0006348205,0.18564847,0.044038456,0.24680495,0.015101022,0.5051296],"study_design_scores_gemma":[0.000052624895,0.00009525323,0.00043519223,0.00010087511,0.000028831888,0.00064675405,0.00022432882,0.7265223,0.03927926,0.12173937,0.11081915,0.000055947694],"about_ca_topic_score_codex":0.0014160649,"about_ca_topic_score_gemma":0.0015683941,"teacher_disagreement_score":0.010628541,"about_ca_system_score_codex":0.0005527194,"about_ca_system_score_gemma":0.00073574146,"threshold_uncertainty_score":0.03555602},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017022283,0.000060731207,0.9948447,0.00009044343,0.000029192723,0.00007147523,0.000081428625,0.00090390653,0.002215902],"genre_scores_gemma":[0.026597407,0.00009239968,0.9701522,0.000037682923,0.000020692243,0.00017982216,0.00035166732,0.0002920606,0.0022760362],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999201,0.00010447115,0.000047115525,0.00016865831,0.00037358401,0.00010516681],"domain_scores_gemma":[0.99929595,0.00023121019,0.000062750354,0.00013695145,0.00022209834,0.000051053736],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006591119,0.0011224584,0.001217999,0.0013512251,0.0013794767,0.001488094,0.0022487873,0.0011707776,0.013515592],"category_scores_gemma":[0.0023289078,0.0010687786,0.0011730817,0.0018409798,0.0008490943,0.002032833,0.0029570083,0.001873224,0.003442356],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030741846,0.00010673361,0.00076906447,0.0003251673,0.00005734611,0.00023406083,0.0003764354,0.16804291,0.01325194,0.068102404,0.026052158,0.7223743],"study_design_scores_gemma":[0.00014596681,0.0001162553,0.00033989153,0.00006115263,0.00003185599,0.00040955213,0.00020733093,0.8769741,0.010876136,0.06720507,0.043580852,0.000051839703],"about_ca_topic_score_codex":0.003029341,"about_ca_topic_score_gemma":0.00537107,"teacher_disagreement_score":0.013515592,"about_ca_system_score_codex":0.0010031817,"about_ca_system_score_gemma":0.00155633,"threshold_uncertainty_score":0.045214176},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043389317,0.002152508,0.84662014,0.0023178868,0.00053043925,0.0007555696,0.027290372,0.05419301,0.022750668],"genre_scores_gemma":[0.41311145,0.0019709868,0.48031136,0.0017276602,0.0005451442,0.0021231745,0.06629173,0.012809024,0.02110955],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958662,0.00041351336,0.0007353703,0.0005015412,0.0019900575,0.0004933588],"domain_scores_gemma":[0.9878434,0.0031318802,0.00063168415,0.0065771826,0.0013999564,0.0004159947],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028139385,0.0016523036,0.0024187877,0.003417851,0.0019173613,0.0054504303,0.0034468246,0.0021973052,0.02373577],"category_scores_gemma":[0.01647961,0.0014539431,0.0016480506,0.0069516385,0.0016852515,0.012493958,0.009253812,0.002934225,0.0074664964],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.003183522,0.0005297922,0.010198217,0.0017739173,0.00031512798,0.0006171233,0.002264478,0.028349271,0.025640521,0.32032248,0.20804508,0.39876056],"study_design_scores_gemma":[0.00077694486,0.0003621992,0.0032992503,0.0005063174,0.00029068766,0.000932952,0.0018320133,0.19185865,0.05917903,0.44733894,0.29332626,0.00029671003],"about_ca_topic_score_codex":0.0030348876,"about_ca_topic_score_gemma":0.0036265014,"teacher_disagreement_score":0.02373577,"about_ca_system_score_codex":0.002117055,"about_ca_system_score_gemma":0.0018371432,"threshold_uncertainty_score":0.079404056},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08503426,0.0016663552,0.8556445,0.008009024,0.0007917142,0.0001346726,0.00084288314,0.0019899441,0.045886684],"genre_scores_gemma":[0.41594592,0.0007957727,0.55531675,0.0015214669,0.00017391263,0.00016119008,0.00085106655,0.00070071814,0.024533272],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985581,0.00022308342,0.000066242545,0.00039028534,0.000628831,0.00013345065],"domain_scores_gemma":[0.9928271,0.0033212781,0.00053658715,0.0019135132,0.0009829858,0.00041851908],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001116657,0.00047080152,0.0010511416,0.0009909091,0.0016886218,0.0018505519,0.0014918625,0.0020389103,0.014823165],"category_scores_gemma":[0.011874687,0.00086955377,0.0010559523,0.00095634535,0.0015524767,0.0036385097,0.0018860032,0.0023323558,0.003331268],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008221146,0.00010460072,0.004017995,0.00056051963,0.00014748194,0.00058669725,0.00075550197,0.029859653,0.014643505,0.5986893,0.041706167,0.30810645],"study_design_scores_gemma":[0.00024519284,0.00029421513,0.0014748205,0.00018044093,0.00007408544,0.0014912337,0.00079151976,0.09036197,0.011252887,0.78331816,0.110418074,0.000097439945],"about_ca_topic_score_codex":0.0014790848,"about_ca_topic_score_gemma":0.002580508,"teacher_disagreement_score":0.014823165,"about_ca_system_score_codex":0.00059424795,"about_ca_system_score_gemma":0.0007123832,"threshold_uncertainty_score":0.04958844},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016176607,0.00009863057,0.98117226,0.00005627416,0.000042190186,0.00006329995,0.000056559045,0.00063211756,0.0017020045],"genre_scores_gemma":[0.23650675,0.00019417028,0.7590553,0.000047533264,0.000025973624,0.00011224465,0.00030194956,0.00033795278,0.0034181434],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996068,0.000054330565,0.000025878502,0.00009336357,0.00018613924,0.00003352966],"domain_scores_gemma":[0.99958056,0.00012637916,0.000044239005,0.000135113,0.000089394736,0.000024413397],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004405819,0.00054924353,0.0006547107,0.0010677075,0.00041009413,0.0007342317,0.0010621217,0.00078052626,0.0025371583],"category_scores_gemma":[0.0021479884,0.000496101,0.00068015716,0.0006897591,0.00091750926,0.00089431944,0.0018572677,0.00082339125,0.0005833018],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016820175,0.000033544224,0.0017493442,0.00021623263,0.00004492782,0.00025044283,0.00048439862,0.49516663,0.031704843,0.036009304,0.0037121188,0.43045998],"study_design_scores_gemma":[0.0000122460815,0.000043885822,0.00031700474,0.000014566178,0.00001030268,0.0001476477,0.00007022906,0.9714145,0.005243074,0.015556605,0.0071515255,0.000018436058],"about_ca_topic_score_codex":0.002419232,"about_ca_topic_score_gemma":0.0023941319,"teacher_disagreement_score":0.0025371583,"about_ca_system_score_codex":0.00037388026,"about_ca_system_score_gemma":0.00044045446,"threshold_uncertainty_score":0.008487642},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06663244,0.005786419,0.8558244,0.007021353,0.00069897814,0.00045478393,0.0022397935,0.002640861,0.058700945],"genre_scores_gemma":[0.427354,0.0057512266,0.5120028,0.0020910976,0.0021337834,0.0019945689,0.00656476,0.002095065,0.04001281],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9948224,0.0011439653,0.00030896591,0.0011303391,0.0017170398,0.0008772558],"domain_scores_gemma":[0.9802342,0.013266223,0.0009883839,0.0038863202,0.00087362557,0.00075134967],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037874072,0.0034623425,0.0040930775,0.002938705,0.0031581016,0.007834707,0.00900288,0.004495923,0.025394296],"category_scores_gemma":[0.025649833,0.0023663864,0.0042896923,0.0069427495,0.004556903,0.02042637,0.008745343,0.012605498,0.0040311664],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017340524,0.0011505949,0.0031392102,0.0020732733,0.0002850914,0.00027259512,0.0011140961,0.23322843,0.0034649558,0.4493818,0.04993907,0.25421682],"study_design_scores_gemma":[0.00018317724,0.0001042139,0.0006714684,0.0000901823,0.00009050746,0.00019750331,0.00022936954,0.22646472,0.0014312641,0.7621647,0.008333746,0.0000390826],"about_ca_topic_score_codex":0.0039837076,"about_ca_topic_score_gemma":0.0038357982,"teacher_disagreement_score":0.025394296,"about_ca_system_score_codex":0.004495404,"about_ca_system_score_gemma":0.00339525,"threshold_uncertainty_score":0.084952354},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17535204,0.0044584777,0.77626395,0.0035756691,0.00047095108,0.00018590265,0.00040675333,0.0021114224,0.037174813],"genre_scores_gemma":[0.7268087,0.0014118202,0.2614684,0.00035496373,0.00022840807,0.0002518729,0.00047055446,0.0011906856,0.00781464],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963838,0.0013620825,0.0001961787,0.00032463903,0.0010924938,0.00064079545],"domain_scores_gemma":[0.9782305,0.016176369,0.0006564344,0.0025239454,0.0015527764,0.00086001924],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0066195647,0.0017941472,0.0016398497,0.0019658483,0.0019520285,0.0040119276,0.0029655853,0.0032269675,0.019301983],"category_scores_gemma":[0.036028814,0.00082329515,0.0011598471,0.0027467273,0.0021879256,0.008909367,0.004250093,0.0026419845,0.0020502175],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0028909617,0.0005282525,0.0030355887,0.00056199945,0.00016784084,0.00011630165,0.000488966,0.53038996,0.008620987,0.19260034,0.012096058,0.24850282],"study_design_scores_gemma":[0.00008416305,0.00029878115,0.00038091745,0.000059622573,0.00008995788,0.00008327587,0.00016230078,0.885895,0.00312998,0.10727784,0.0025131465,0.000024940624],"about_ca_topic_score_codex":0.0020381245,"about_ca_topic_score_gemma":0.0035113515,"teacher_disagreement_score":0.019301983,"about_ca_system_score_codex":0.0021132757,"about_ca_system_score_gemma":0.002374746,"threshold_uncertainty_score":0.06457156},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21446557,0.0009036675,0.77494,0.00025134502,0.00010256792,0.00015341907,0.0005298572,0.001522121,0.0071313772],"genre_scores_gemma":[0.5296366,0.00088492455,0.46179217,0.00006529363,0.0000970985,0.00016651035,0.0017962017,0.00076305965,0.0047980687],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99924845,0.00019924915,0.00005727659,0.00016277588,0.00019123941,0.00014099939],"domain_scores_gemma":[0.9947994,0.0035039533,0.0005701605,0.0004028197,0.00045424656,0.0002694712],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010395077,0.0013949702,0.0013116859,0.0019855457,0.00080561824,0.0019154842,0.0014790313,0.0008494419,0.004963637],"category_scores_gemma":[0.011305154,0.0007976841,0.00079551083,0.0025719125,0.0011091057,0.003251527,0.0020839334,0.0011335058,0.0008650487],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00064214,0.00011564402,0.0050207777,0.00030601278,0.00008019049,0.0001836976,0.00039739558,0.8127377,0.0034543897,0.035884026,0.004371385,0.13680659],"study_design_scores_gemma":[0.000032280852,0.00010545733,0.0004963408,0.000025200892,0.000016229387,0.00003943378,0.00013808376,0.9728018,0.0015331503,0.023209263,0.0015859453,0.00001684865],"about_ca_topic_score_codex":0.0058758436,"about_ca_topic_score_gemma":0.0100304745,"teacher_disagreement_score":0.0058758436,"about_ca_system_score_codex":0.00085561443,"about_ca_system_score_gemma":0.000889498,"threshold_uncertainty_score":0.01660502},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15265061,0.00014842459,0.84355694,0.00019836209,0.00003716426,0.00006466843,0.00007238702,0.00024253888,0.0030287656],"genre_scores_gemma":[0.8459844,0.000106693864,0.15180731,0.00005330815,0.0000130318695,0.00012094359,0.00013313949,0.000072004965,0.0017091855],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993718,0.00017085472,0.000033566856,0.00008957736,0.0002558838,0.00007829195],"domain_scores_gemma":[0.9990946,0.0005118986,0.000094258445,0.000103895916,0.00012912619,0.00006624299],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083775504,0.0003379862,0.00085404364,0.00061519945,0.00081482925,0.00097099453,0.0012202198,0.00083721563,0.0014673007],"category_scores_gemma":[0.0024420575,0.0004531466,0.00054241606,0.0007079091,0.0009097145,0.0012556692,0.0012697013,0.0006102214,0.00017234925],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044262757,0.000023425684,0.00046714488,0.000017338356,0.000013111989,0.00005934172,0.00003581548,0.979814,0.0015995258,0.013735129,0.00011378327,0.0040770713],"study_design_scores_gemma":[0.000008393283,0.000007707554,0.00006868148,0.000001041905,0.000001747087,0.000009478483,0.000006559207,0.9960084,0.0007609057,0.0028727525,0.00025013436,0.0000041406365],"about_ca_topic_score_codex":0.0043494175,"about_ca_topic_score_gemma":0.0016847478,"teacher_disagreement_score":0.0043494175,"about_ca_system_score_codex":0.0011324055,"about_ca_system_score_gemma":0.0011028617,"threshold_uncertainty_score":0.008648217},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032554757,0.0002225659,0.9641587,0.00011400569,0.000024400075,0.000044517634,0.000024680914,0.00020691127,0.0026493939],"genre_scores_gemma":[0.4910778,0.0003524317,0.5046506,0.00010393161,0.000029526478,0.00010496786,0.00015311365,0.00026033155,0.003267297],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998697,0.00026298384,0.000078749545,0.00017075303,0.0006877779,0.00010289886],"domain_scores_gemma":[0.99789053,0.00080435985,0.00029690756,0.0006516986,0.00028179894,0.00007474651],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011669592,0.00060433085,0.0008097552,0.00062863185,0.00043974735,0.0010263909,0.0011841637,0.0008141285,0.002176167],"category_scores_gemma":[0.006073998,0.0005045643,0.0005221449,0.000539948,0.0012189599,0.0012782697,0.0023407615,0.0010816266,0.00044111646],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042893685,0.0001086546,0.0034194272,0.00047041883,0.00006609186,0.0005005152,0.00063787156,0.5203913,0.086187206,0.10059559,0.0019649016,0.28522906],"study_design_scores_gemma":[0.000026493692,0.00018790487,0.0011690463,0.000055914268,0.000014158483,0.0005008871,0.000112021895,0.91948766,0.042153135,0.028506095,0.0077564195,0.000030261968],"about_ca_topic_score_codex":0.0007389421,"about_ca_topic_score_gemma":0.00088818785,"teacher_disagreement_score":0.002176167,"about_ca_system_score_codex":0.00034001775,"about_ca_system_score_gemma":0.0004871301,"threshold_uncertainty_score":0.007279992},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50035477,0.009388068,0.40015924,0.005054051,0.0004902419,0.00023655985,0.0019715973,0.0017703868,0.080575086],"genre_scores_gemma":[0.90839785,0.0027461795,0.07948349,0.0005285825,0.00051815587,0.00027122666,0.0008201795,0.0003835257,0.006850785],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978625,0.0005151638,0.00010594428,0.00040045517,0.0005355359,0.0005803377],"domain_scores_gemma":[0.9857473,0.010954653,0.00066543295,0.0014577021,0.0004908542,0.00068400725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020220648,0.0012657752,0.0020999429,0.0016099496,0.0013393965,0.0034600152,0.0029071704,0.0018731509,0.0095823845],"category_scores_gemma":[0.017077329,0.0008211307,0.0012543866,0.0024149697,0.0022205792,0.005589278,0.0037902526,0.0020618122,0.0015720924],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0034887136,0.000509008,0.008587053,0.0015272722,0.0002761332,0.0007619281,0.0011314988,0.5200708,0.049043413,0.2223316,0.029273383,0.16299918],"study_design_scores_gemma":[0.00017890408,0.00045513743,0.0032557559,0.00018879157,0.00016229298,0.0010160934,0.00027304405,0.76750314,0.012340574,0.20004918,0.014489083,0.00008809205],"about_ca_topic_score_codex":0.0012617265,"about_ca_topic_score_gemma":0.00096569065,"teacher_disagreement_score":0.0095823845,"about_ca_system_score_codex":0.0018840822,"about_ca_system_score_gemma":0.0007282343,"threshold_uncertainty_score":0.032056212},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31487486,0.00085887074,0.6754834,0.0004751379,0.00005774872,0.000120288096,0.0015177365,0.003581911,0.0030300817],"genre_scores_gemma":[0.64698106,0.0005171358,0.34605318,0.00006379376,0.00007733702,0.000088195564,0.0044475617,0.0003772358,0.0013945014],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99810874,0.00017806346,0.00015281017,0.00045539273,0.00083984307,0.0002652103],"domain_scores_gemma":[0.9949391,0.0017156543,0.0008116727,0.0017315418,0.0005797365,0.00022230734],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094477704,0.0009401965,0.0023115186,0.0028976707,0.00136765,0.0025837524,0.0033022214,0.0015725453,0.0015460588],"category_scores_gemma":[0.009571872,0.0016036059,0.001334256,0.0053700157,0.00092104607,0.006159553,0.0039296714,0.0015898311,0.00079011323],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020610415,0.00040566106,0.01006918,0.000628923,0.00024673104,0.0009784402,0.0016405741,0.26455036,0.085893504,0.02086477,0.007695386,0.6049653],"study_design_scores_gemma":[0.0002576349,0.00048905803,0.0051491386,0.00008198241,0.00022418014,0.0006554694,0.0006801908,0.8563308,0.0748991,0.053134616,0.007963172,0.00013466217],"about_ca_topic_score_codex":0.007813316,"about_ca_topic_score_gemma":0.0073106843,"teacher_disagreement_score":0.007813316,"about_ca_system_score_codex":0.0009046265,"about_ca_system_score_gemma":0.001355097,"threshold_uncertainty_score":0.015535653},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0075579607,0.00021102671,0.98365927,0.00013243221,0.000042825028,0.00010496621,0.000219236,0.0038039999,0.004268118],"genre_scores_gemma":[0.09064168,0.0002832919,0.90019226,0.00007768478,0.00005721554,0.00024330373,0.002004875,0.00076195813,0.005737693],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989489,0.000114868686,0.00007525245,0.00023667775,0.00046030982,0.00016402914],"domain_scores_gemma":[0.9990096,0.00028637977,0.00007402119,0.00034757366,0.00023368977,0.000048633534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046379486,0.001226,0.0010945597,0.0014260908,0.0011370173,0.0016520787,0.002400132,0.0011279715,0.01760452],"category_scores_gemma":[0.00256885,0.00066783966,0.0009595298,0.0034470868,0.00084589317,0.003601181,0.0037122793,0.0016368093,0.006347887],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036420138,0.00023318938,0.0009890111,0.00032770354,0.00007759103,0.00016532543,0.00032679632,0.055126075,0.02308219,0.055257436,0.02121714,0.8428334],"study_design_scores_gemma":[0.00024964198,0.00037984538,0.000988039,0.00006416353,0.00008618959,0.0006972332,0.00032549645,0.73263925,0.05301733,0.13555318,0.07590108,0.000098584176],"about_ca_topic_score_codex":0.0019100104,"about_ca_topic_score_gemma":0.0021389674,"teacher_disagreement_score":0.01760452,"about_ca_system_score_codex":0.00068791246,"about_ca_system_score_gemma":0.0010125393,"threshold_uncertainty_score":0.058893025},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04539099,0.006282995,0.5419991,0.0033070983,0.0008056688,0.00011807633,0.0004285664,0.00046644855,0.40120107],"genre_scores_gemma":[0.7594488,0.0050715203,0.15933427,0.0012068835,0.000745903,0.00023320764,0.0005163553,0.00032264413,0.0731203],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994462,0.00010009626,0.000030334008,0.00012120234,0.00022401295,0.00007815753],"domain_scores_gemma":[0.9989089,0.000535565,0.00006303043,0.00025308435,0.00014868246,0.00009076727],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006155191,0.0006108455,0.00041990058,0.0015894179,0.0013886727,0.0029205282,0.0013904261,0.0011367996,0.011091799],"category_scores_gemma":[0.002719169,0.00056417764,0.0007104564,0.0015461766,0.004590191,0.0048475484,0.0027257733,0.0033763107,0.001589682],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000063703383,0.000003854792,0.000071141905,0.00003690121,0.000001977559,0.000027472175,0.00006778005,0.0017133005,0.0005219392,0.98803085,0.0014635208,0.008054987],"study_design_scores_gemma":[0.0000037411219,0.000009091607,0.00008279231,0.000019495048,0.0000036313145,0.00011923808,0.00004154179,0.0047075846,0.0005538813,0.97885054,0.015600764,0.000007691718],"about_ca_topic_score_codex":0.00083931314,"about_ca_topic_score_gemma":0.0010021529,"teacher_disagreement_score":0.011091799,"about_ca_system_score_codex":0.0017316813,"about_ca_system_score_gemma":0.00050670205,"threshold_uncertainty_score":0.03710574},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25119153,0.00020180854,0.74202013,0.0000765164,0.000027246828,0.00009156128,0.00028417824,0.00095584185,0.0051512094],"genre_scores_gemma":[0.65736765,0.00016888561,0.3391416,0.000023397773,0.000018844927,0.000056552868,0.0008420268,0.0002842044,0.0020969082],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99960536,0.000035777764,0.00003227631,0.00009322001,0.00016860836,0.00006474551],"domain_scores_gemma":[0.9993625,0.0001849711,0.00011318331,0.0001442228,0.00012438546,0.00007073751],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038737842,0.00037902087,0.0007835557,0.0009721183,0.0003382594,0.0011951653,0.00070410996,0.0002701127,0.0028653352],"category_scores_gemma":[0.0016102224,0.00022925477,0.0005902824,0.0004562426,0.0008020587,0.0015599456,0.0011868248,0.0006518358,0.00050637184],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00080950285,0.00017631316,0.007621294,0.00062204985,0.000109039895,0.00088529143,0.0009433041,0.25113946,0.09790456,0.22418177,0.00404032,0.41156712],"study_design_scores_gemma":[0.000052254934,0.0003867039,0.0032305745,0.00005926932,0.00004802404,0.0005414473,0.00024537696,0.8201202,0.0877146,0.07825719,0.009284391,0.00005989709],"about_ca_topic_score_codex":0.00088172755,"about_ca_topic_score_gemma":0.000651769,"teacher_disagreement_score":0.0028653352,"about_ca_system_score_codex":0.00057058426,"about_ca_system_score_gemma":0.00058267784,"threshold_uncertainty_score":0.009585559},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04014591,0.0000758488,0.9493344,0.0001720321,0.00024196919,0.00013487638,0.00021252045,0.001063203,0.008619278],"genre_scores_gemma":[0.32264292,0.00023763614,0.6682151,0.000095737276,0.00007034815,0.00021780281,0.0005989324,0.000779881,0.0071416423],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99945027,0.000073270996,0.000039646864,0.0001322359,0.00025757294,0.000046924208],"domain_scores_gemma":[0.9993216,0.00021393316,0.000056648005,0.00025513017,0.00011498565,0.00003769779],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004599215,0.00062322017,0.0008641433,0.00087488606,0.0005103496,0.0010384336,0.0011344862,0.0008250004,0.0062669176],"category_scores_gemma":[0.002670983,0.0005106058,0.000827201,0.0009689683,0.0009980486,0.001028297,0.002311179,0.0011020808,0.0019129234],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005777633,0.00022879131,0.0016101641,0.00052230223,0.00008100255,0.00097409874,0.0008588778,0.48062238,0.07181882,0.16732655,0.011207678,0.26417154],"study_design_scores_gemma":[0.00009341211,0.00029683672,0.0004386082,0.000039107766,0.00002605273,0.00031776036,0.00018343229,0.900693,0.021033335,0.05440981,0.02242984,0.000038818307],"about_ca_topic_score_codex":0.0013955422,"about_ca_topic_score_gemma":0.001330936,"teacher_disagreement_score":0.0062669176,"about_ca_system_score_codex":0.00040990845,"about_ca_system_score_gemma":0.0004169424,"threshold_uncertainty_score":0.02096492},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023172215,0.0007077422,0.9724337,0.00026731862,0.000070596216,0.0000818252,0.00027023375,0.0004957673,0.0025005986],"genre_scores_gemma":[0.26404858,0.0010531835,0.72726935,0.00010987586,0.00009207109,0.00023983765,0.0015051881,0.00034380853,0.0053382334],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991548,0.00019548064,0.00006165354,0.00015790276,0.0002965543,0.00013356122],"domain_scores_gemma":[0.9959721,0.0028854618,0.00019536815,0.00038602887,0.00036650262,0.00019455342],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001574772,0.0013164016,0.0018425706,0.0022788502,0.0010459861,0.0023247832,0.00304571,0.0015288849,0.005602495],"category_scores_gemma":[0.011096172,0.0009414868,0.0011395194,0.0039105215,0.0011601958,0.0032669818,0.0028075848,0.0028973126,0.000929157],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003048631,0.0001450113,0.001376239,0.00026217068,0.00006121712,0.00005808587,0.0003296082,0.78542084,0.0011637388,0.06389819,0.005862846,0.14111714],"study_design_scores_gemma":[0.000032560994,0.000024389778,0.00008918229,0.000017227614,0.000012240115,0.000025087891,0.00005965865,0.96565086,0.00028643306,0.03256192,0.0012342542,0.0000062705076],"about_ca_topic_score_codex":0.009816318,"about_ca_topic_score_gemma":0.010748352,"teacher_disagreement_score":0.009816318,"about_ca_system_score_codex":0.00206283,"about_ca_system_score_gemma":0.0014310265,"threshold_uncertainty_score":0.019518375},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80000216,0.002051153,0.1327729,0.0004054816,0.00026734133,0.00005699826,0.0007040827,0.00037169928,0.06336823],"genre_scores_gemma":[0.94867444,0.0012941877,0.036298662,0.00007932074,0.00017183827,0.00006897554,0.00065648573,0.00019994112,0.012556296],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994547,0.00009767817,0.00002776952,0.00015768586,0.00019144641,0.00007071928],"domain_scores_gemma":[0.9972475,0.001347747,0.0004788401,0.00023934997,0.00028176646,0.00040479907],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074546575,0.0005877315,0.00058324344,0.0038717112,0.0008999955,0.001873193,0.0013724798,0.00077916146,0.005199177],"category_scores_gemma":[0.0051849047,0.0005185471,0.0004267431,0.0032497563,0.001194882,0.0029680114,0.00097589334,0.00121653,0.00043681968],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003959103,0.00012928489,0.004798423,0.0002838635,0.00007989051,0.0002947781,0.0005041157,0.075746015,0.012573229,0.81750685,0.006666002,0.081021555],"study_design_scores_gemma":[0.000023850384,0.000083675906,0.005452734,0.00006270635,0.00007432444,0.00066521467,0.00023935684,0.15436031,0.0043669716,0.8270422,0.0075791734,0.00004944837],"about_ca_topic_score_codex":0.0006958828,"about_ca_topic_score_gemma":0.00077025715,"teacher_disagreement_score":0.005199177,"about_ca_system_score_codex":0.0009333969,"about_ca_system_score_gemma":0.00029670805,"threshold_uncertainty_score":0.017392933},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053775012,0.0005034014,0.9229009,0.00034778958,0.00010942402,0.00021765134,0.00038421646,0.0014518886,0.020309709],"genre_scores_gemma":[0.37337285,0.00066578016,0.6157194,0.0000668897,0.00006129685,0.00017104829,0.0008357845,0.00024682673,0.00886012],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99933916,0.000107292384,0.00004514574,0.00017267457,0.00021855273,0.00011707782],"domain_scores_gemma":[0.9995314,0.00015799842,0.00008148589,0.00013305208,0.000048966733,0.000047159607],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032180513,0.00088222796,0.0010750976,0.00084840646,0.0007762146,0.00089823204,0.0011666701,0.0013209871,0.007870505],"category_scores_gemma":[0.0022208674,0.00062260753,0.0006785279,0.00091709854,0.00070006365,0.001255671,0.0016538965,0.0004373832,0.001983051],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00054153084,0.0001920964,0.0013914369,0.000490584,0.000043108754,0.0005715981,0.00031253052,0.54990226,0.028403658,0.04876564,0.0120349405,0.35735062],"study_design_scores_gemma":[0.000101734324,0.00026119998,0.0006196857,0.0000449803,0.00002530767,0.00045601206,0.00023751616,0.918162,0.013239693,0.048791364,0.018029738,0.000030834566],"about_ca_topic_score_codex":0.0012600962,"about_ca_topic_score_gemma":0.001619567,"teacher_disagreement_score":0.007870505,"about_ca_system_score_codex":0.00052646076,"about_ca_system_score_gemma":0.0007608352,"threshold_uncertainty_score":0.026329458},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011030785,0.00015653769,0.97917145,0.000088477624,0.00002670393,0.000063409825,0.000065356195,0.00046252797,0.008934718],"genre_scores_gemma":[0.25670013,0.0004534001,0.7292804,0.00008875048,0.000046085624,0.00014345262,0.00035880343,0.0009592263,0.011969753],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99942684,0.00011050033,0.000021340578,0.00006746355,0.00033046427,0.000043386353],"domain_scores_gemma":[0.99887174,0.00070533605,0.00005731334,0.00016208431,0.00014301734,0.000060580922],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064843224,0.0007499312,0.0011197072,0.0011819674,0.00051496545,0.0014371203,0.0010335457,0.0011140221,0.0073457365],"category_scores_gemma":[0.003736155,0.0008112306,0.00091430347,0.0008267156,0.0010132486,0.0011824364,0.0031005263,0.0026426958,0.0013748189],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034580808,0.00011210888,0.00081620977,0.0005599951,0.00009548718,0.0004909873,0.00083729904,0.51554924,0.025976568,0.1963397,0.0071385014,0.25173813],"study_design_scores_gemma":[0.000034846184,0.00006164391,0.00015825826,0.000051523883,0.000013728902,0.0002111313,0.00010601879,0.91031545,0.009837338,0.072146,0.0070450935,0.000018879833],"about_ca_topic_score_codex":0.0012901274,"about_ca_topic_score_gemma":0.001376241,"teacher_disagreement_score":0.0073457365,"about_ca_system_score_codex":0.00047510373,"about_ca_system_score_gemma":0.00041649883,"threshold_uncertainty_score":0.024573922},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08086904,0.00061667006,0.90337634,0.00047105976,0.00013322518,0.00012522213,0.0002794274,0.00026954274,0.013859465],"genre_scores_gemma":[0.87027884,0.0010008849,0.1189545,0.000104234234,0.000097126605,0.00020253968,0.00026677398,0.00022326925,0.008871739],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99909234,0.0004212043,0.000041267733,0.00018336099,0.00013317805,0.00012872851],"domain_scores_gemma":[0.99743193,0.001420393,0.0003901974,0.00023760376,0.000332645,0.00018719654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010080588,0.001276702,0.0016298456,0.0015421052,0.0010512538,0.002917432,0.004188566,0.003323693,0.0033104587],"category_scores_gemma":[0.0068322974,0.0014538461,0.0014613805,0.0021392452,0.0030810223,0.0026190672,0.0025983748,0.0013982767,0.0009650619],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002433249,0.000008951645,0.00017333742,0.00002209329,0.000005335473,0.000038979146,0.000033238342,0.9785276,0.00012990089,0.019014753,0.00034007328,0.0016814263],"study_design_scores_gemma":[0.000005378267,0.0000061575047,0.00003631482,0.000004545094,0.0000030865294,0.0000123154505,0.000018204544,0.9892286,0.000080464124,0.01027304,0.00032730686,0.000004588467],"about_ca_topic_score_codex":0.011929841,"about_ca_topic_score_gemma":0.0076910527,"teacher_disagreement_score":0.011929841,"about_ca_system_score_codex":0.0024308607,"about_ca_system_score_gemma":0.0011907434,"threshold_uncertainty_score":0.0237208},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21446092,0.00008144959,0.7836361,0.000047878362,0.00003040975,0.00006182338,0.00005014069,0.00022850028,0.0014028411],"genre_scores_gemma":[0.8090921,0.00011828588,0.18936999,0.000034463723,0.000021739686,0.00006690122,0.00019291924,0.00013786736,0.000965697],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99723876,0.00045714923,0.00021943632,0.00034870673,0.0016582352,0.000077660865],"domain_scores_gemma":[0.9911458,0.0034921763,0.0015138605,0.0018405548,0.0016836344,0.00032385794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024411804,0.00056537346,0.00059551146,0.0018696968,0.00034247036,0.001227761,0.0008518999,0.0007501524,0.0009739932],"category_scores_gemma":[0.016414423,0.00031118077,0.00041852193,0.0009383471,0.0012894174,0.0018603675,0.0015645542,0.00076439686,0.00031039174],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005367858,0.00019215587,0.026529128,0.00047064075,0.0002005099,0.00041027882,0.0013857778,0.34323594,0.31523636,0.086263314,0.000619965,0.22491908],"study_design_scores_gemma":[0.000019615309,0.0004953467,0.015575514,0.000030870342,0.000041307583,0.0007835031,0.00033360228,0.8225908,0.114016905,0.04185923,0.0041142893,0.00013900168],"about_ca_topic_score_codex":0.00050659606,"about_ca_topic_score_gemma":0.0005251952,"teacher_disagreement_score":0.0024411804,"about_ca_system_score_codex":0.00045860393,"about_ca_system_score_gemma":0.0003590144,"threshold_uncertainty_score":0.012910366},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03908357,0.00052104366,0.85371995,0.00025258047,0.00021071552,0.00013329186,0.0007703049,0.0029870786,0.102321446],"genre_scores_gemma":[0.33311346,0.001529392,0.5944083,0.00024667484,0.00014856625,0.00016368712,0.0028511179,0.0022016775,0.06533712],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997788,0.0000384062,0.000008610574,0.00005387073,0.00009483351,0.000025420606],"domain_scores_gemma":[0.99974257,0.00007802421,0.00001638244,0.000086862354,0.000047235746,0.000029038942],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015809065,0.0008026065,0.0005255666,0.00078278093,0.00030646854,0.0009871959,0.0011638941,0.00051122013,0.024161989],"category_scores_gemma":[0.0008411486,0.0006930392,0.0004654175,0.0008910792,0.0005482427,0.0012725409,0.0014555639,0.0016473798,0.0050092028],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019404666,0.000091134345,0.00037733736,0.00063857,0.00006432135,0.00026633244,0.00037651727,0.07949364,0.038527593,0.22573373,0.037542637,0.61669415],"study_design_scores_gemma":[0.00008082014,0.00012768585,0.0009224665,0.00021750899,0.00006318962,0.0007668455,0.00041664444,0.3050378,0.025818886,0.48794436,0.17855467,0.00004910687],"about_ca_topic_score_codex":0.0010773224,"about_ca_topic_score_gemma":0.0022031467,"teacher_disagreement_score":0.024161989,"about_ca_system_score_codex":0.0003136628,"about_ca_system_score_gemma":0.00017845005,"threshold_uncertainty_score":0.08082992},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04413172,0.00038629168,0.9477652,0.00036023188,0.00005186775,0.00008460394,0.00013389153,0.0009331073,0.006153099],"genre_scores_gemma":[0.3675715,0.00027399752,0.62723154,0.00011910392,0.00006179548,0.00019154805,0.00052186253,0.00031180878,0.0037169429],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99900573,0.00025114493,0.00005724804,0.00023498773,0.00023031853,0.00022053087],"domain_scores_gemma":[0.997378,0.0016544661,0.00027049656,0.00038189816,0.00021464365,0.000100562225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082018407,0.00083699025,0.0010488654,0.00080789306,0.0008977524,0.0012605865,0.0016377681,0.0013511814,0.0032455868],"category_scores_gemma":[0.005175719,0.0005682346,0.00085311517,0.0014067802,0.0010545524,0.002446301,0.0019210131,0.0009640225,0.00045771434],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00052284775,0.00014818172,0.00102803,0.00021606626,0.000060337406,0.00011554147,0.0003648172,0.673187,0.008123775,0.09741434,0.007399592,0.21141945],"study_design_scores_gemma":[0.00008741589,0.000059021368,0.00019618406,0.000014094369,0.00001547118,0.00004172867,0.00007651646,0.91930175,0.0030746132,0.0746733,0.0024487008,0.000011180187],"about_ca_topic_score_codex":0.00408925,"about_ca_topic_score_gemma":0.004465761,"teacher_disagreement_score":0.00408925,"about_ca_system_score_codex":0.0015309098,"about_ca_system_score_gemma":0.0011664757,"threshold_uncertainty_score":0.011107624},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004092337,0.00025001026,0.91203094,0.00017691495,0.00018622467,0.00035382266,0.0014038429,0.071823426,0.009682476],"genre_scores_gemma":[0.038755555,0.0007227024,0.9164303,0.00022680737,0.00009314834,0.0013364616,0.004748178,0.021545129,0.016141642],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989436,0.000118571144,0.000118712116,0.00019644614,0.0005516303,0.000071010196],"domain_scores_gemma":[0.9968811,0.0008890095,0.00022969766,0.00042336097,0.0014309877,0.00014577572],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010226965,0.0010846251,0.0007506519,0.0018376827,0.00042673433,0.0010646518,0.0016248703,0.0005398227,0.041667122],"category_scores_gemma":[0.0060390495,0.0007161474,0.0008437684,0.0010514816,0.00027891694,0.0014260917,0.0011099544,0.0015258285,0.022218816],"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.00029419994,0.00022522314,0.0040288544,0.001597692,0.00011040393,0.0008088767,0.000768726,0.014051057,0.057406463,0.009478211,0.1261255,0.7851048],"study_design_scores_gemma":[0.00030453925,0.0004243807,0.008970091,0.00063746807,0.00017154514,0.002909363,0.00045731323,0.16815878,0.18142536,0.017618533,0.6185664,0.00035626252],"about_ca_topic_score_codex":0.0009793955,"about_ca_topic_score_gemma":0.0008288342,"teacher_disagreement_score":0.041667122,"about_ca_system_score_codex":0.00025236254,"about_ca_system_score_gemma":0.00087098917,"threshold_uncertainty_score":0.13939047},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3658285,0.001487394,0.61257637,0.0026395645,0.00011666792,0.00030754937,0.0022985372,0.0007399707,0.014005428],"genre_scores_gemma":[0.84186244,0.002319903,0.14171726,0.0003007083,0.0002491194,0.0002811935,0.004777854,0.00027429173,0.00821717],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988254,0.00019838981,0.00007329434,0.00040804018,0.0003283459,0.00016643158],"domain_scores_gemma":[0.99499184,0.0036857536,0.00050886977,0.00040361044,0.00022204536,0.00018788327],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063216547,0.0012376992,0.0012156785,0.00081108767,0.00096654333,0.002619645,0.0018891592,0.0023895167,0.0055954726],"category_scores_gemma":[0.005557955,0.00082825194,0.0014240784,0.001733481,0.0015975814,0.008171794,0.0021135914,0.0029092983,0.0007697663],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008115722,0.00048263645,0.004771544,0.0014739747,0.0002626525,0.0019006317,0.0015398223,0.48280758,0.027507013,0.307652,0.011091855,0.15969859],"study_design_scores_gemma":[0.00018215239,0.00022139623,0.001638055,0.00013584136,0.00014390008,0.0014977918,0.000911514,0.34642982,0.019712757,0.61677665,0.012264414,0.000085760395],"about_ca_topic_score_codex":0.0017473083,"about_ca_topic_score_gemma":0.0011811148,"teacher_disagreement_score":0.0055954726,"about_ca_system_score_codex":0.001252758,"about_ca_system_score_gemma":0.0005418197,"threshold_uncertainty_score":0.01871872},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07775894,0.0017163834,0.5336257,0.0026223962,0.001298958,0.001490843,0.08894106,0.07226583,0.22027995],"genre_scores_gemma":[0.40805343,0.0014558571,0.37695634,0.0006177375,0.00040582143,0.0008025719,0.11769353,0.018378494,0.07563611],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988834,0.000115698014,0.00009130462,0.00032462238,0.00043706803,0.000147947],"domain_scores_gemma":[0.99793124,0.00043993595,0.000139271,0.00048881746,0.0008492232,0.00015142454],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003728063,0.0008294355,0.0010210945,0.0018436532,0.001121113,0.00230535,0.0012086256,0.0011620822,0.060171563],"category_scores_gemma":[0.003742765,0.00034342404,0.00036123398,0.0018571774,0.0006536613,0.0019997756,0.0018173142,0.00067187723,0.03508265],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0037972243,0.00021729313,0.0049250526,0.0019849003,0.00006096526,0.001402066,0.0024249807,0.0069352086,0.10305613,0.078595124,0.40007785,0.39652315],"study_design_scores_gemma":[0.00019533797,0.00018781277,0.003866451,0.000182616,0.000046092482,0.0010179812,0.000892723,0.028477354,0.087979816,0.018546125,0.85851854,0.0000891219],"about_ca_topic_score_codex":0.005016209,"about_ca_topic_score_gemma":0.0030855192,"teacher_disagreement_score":0.060171563,"about_ca_system_score_codex":0.00062527606,"about_ca_system_score_gemma":0.0011425758,"threshold_uncertainty_score":0.20129395},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10013091,0.0019039015,0.808818,0.0058268467,0.00058891566,0.0006579246,0.0068703536,0.016062792,0.059140388],"genre_scores_gemma":[0.41557875,0.00077960384,0.546308,0.00085159484,0.00026929134,0.0006815212,0.0088668605,0.0017601666,0.024904286],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99561936,0.0007651767,0.0003683127,0.0010526946,0.0015276952,0.0006667663],"domain_scores_gemma":[0.9903308,0.004302834,0.00074852275,0.0036531421,0.00064465,0.0003200621],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014269127,0.0011499554,0.0018424726,0.0009755706,0.0014034676,0.005239806,0.003162966,0.0015699151,0.020159004],"category_scores_gemma":[0.0089499075,0.00081024645,0.001302898,0.003101943,0.001268403,0.0100636305,0.003639841,0.0019469805,0.0075294254],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00191408,0.0004062165,0.0028876155,0.00095606217,0.00022471073,0.0003253494,0.00068368856,0.12489616,0.014208112,0.14441425,0.066295676,0.6427881],"study_design_scores_gemma":[0.0005889499,0.00025169709,0.0015303824,0.00012728483,0.00013030841,0.00052445894,0.0004290238,0.4928026,0.014627113,0.4201265,0.06878643,0.00007521991],"about_ca_topic_score_codex":0.0064142393,"about_ca_topic_score_gemma":0.018216532,"teacher_disagreement_score":0.020159004,"about_ca_system_score_codex":0.003947416,"about_ca_system_score_gemma":0.0039742854,"threshold_uncertainty_score":0.0674386},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32481974,0.00028054087,0.6702289,0.00023309149,0.000015155413,0.0001093807,0.00042008035,0.0005285178,0.0033645616],"genre_scores_gemma":[0.80904293,0.00048927206,0.18529855,0.00004638725,0.000036224752,0.00014113684,0.0012994071,0.00025342152,0.0033925958],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999099,0.00018778983,0.000045775938,0.00022003612,0.00032215737,0.00012522105],"domain_scores_gemma":[0.99561936,0.0027249882,0.0005360582,0.0007265488,0.00020914708,0.00018385156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005682378,0.0009279135,0.0012330196,0.00086728734,0.0005725485,0.00147937,0.0020918986,0.0013650254,0.005073305],"category_scores_gemma":[0.006738833,0.0009994773,0.00096993346,0.0014765764,0.0012794738,0.00457264,0.0024463197,0.001584151,0.000563068],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033888922,0.0001242982,0.0017674257,0.0002983016,0.00007239747,0.000398275,0.00039054078,0.853829,0.014211677,0.065054215,0.0011144755,0.06240044],"study_design_scores_gemma":[0.000040735467,0.0001285707,0.0007707241,0.000028167782,0.000023436758,0.0002478934,0.0001496527,0.877114,0.008055096,0.11141965,0.001994162,0.000027858763],"about_ca_topic_score_codex":0.0013827723,"about_ca_topic_score_gemma":0.0012994157,"teacher_disagreement_score":0.005073305,"about_ca_system_score_codex":0.00087771076,"about_ca_system_score_gemma":0.0003558653,"threshold_uncertainty_score":0.016971886},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06767101,0.0008182736,0.91523826,0.00069162995,0.000020352662,0.00008148187,0.0000901726,0.00011418121,0.015274765],"genre_scores_gemma":[0.81529844,0.0010764232,0.17748633,0.00013192972,0.00013863137,0.0001886264,0.00012880868,0.00016517531,0.005385666],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975241,0.0008930429,0.00007544541,0.00045926528,0.00070001517,0.00034816537],"domain_scores_gemma":[0.9890298,0.008198882,0.0010883544,0.00064011884,0.00060014776,0.00044273393],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027793003,0.0010282912,0.002010545,0.00084709906,0.0011870391,0.001992962,0.0027951633,0.0016293034,0.0035030406],"category_scores_gemma":[0.025411349,0.0010553935,0.00088391505,0.001424357,0.002776513,0.0059899753,0.003156973,0.0014722303,0.0005815324],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030769582,0.00010297987,0.0030475503,0.00033235623,0.00010225684,0.0014988726,0.0009765651,0.44909877,0.0075378944,0.46350408,0.003722706,0.06976827],"study_design_scores_gemma":[0.00004624476,0.000097914155,0.00081342517,0.000044190565,0.000033365126,0.0007876367,0.0002542298,0.772274,0.0046122186,0.21760954,0.0033910435,0.000036176076],"about_ca_topic_score_codex":0.0017189778,"about_ca_topic_score_gemma":0.0014857732,"teacher_disagreement_score":0.0035030406,"about_ca_system_score_codex":0.0010379006,"about_ca_system_score_gemma":0.00059148535,"threshold_uncertainty_score":0.014698565},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00512157,0.00012949968,0.98569113,0.00009968326,0.000053437572,0.00018524214,0.0002400531,0.002403148,0.0060761822],"genre_scores_gemma":[0.04822853,0.00020689932,0.94587857,0.000061326835,0.000018413777,0.00026053752,0.0011130078,0.0005632808,0.0036694037],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99853265,0.0002281802,0.0001320194,0.00039126165,0.0004788517,0.00023701228],"domain_scores_gemma":[0.99785787,0.0008405317,0.00012122768,0.0007928927,0.00026835484,0.00011918194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009898188,0.0017603156,0.0013115673,0.0012134156,0.0015248938,0.0027693573,0.0034790789,0.0017686322,0.025779128],"category_scores_gemma":[0.0047423583,0.0015286782,0.002436924,0.0017030126,0.0012608381,0.0041992143,0.0050852383,0.0023174745,0.00796932],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033501638,0.00028647835,0.0017186283,0.00086186215,0.000088868175,0.00034186765,0.00062446424,0.15331642,0.0092287455,0.18580802,0.028580971,0.6188087],"study_design_scores_gemma":[0.0001776311,0.00014895474,0.0003393003,0.00013446984,0.00007008198,0.00034433702,0.0003953018,0.66426754,0.012487821,0.2608767,0.06068923,0.0000685564],"about_ca_topic_score_codex":0.0014695654,"about_ca_topic_score_gemma":0.0026140374,"teacher_disagreement_score":0.025779128,"about_ca_system_score_codex":0.0010824244,"about_ca_system_score_gemma":0.0012680963,"threshold_uncertainty_score":0.086239755},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08414239,0.0013672031,0.8626212,0.0028814508,0.00021561547,0.00039276457,0.0031631144,0.02461056,0.020605624],"genre_scores_gemma":[0.41741964,0.00080309046,0.55701697,0.0005518876,0.00017350006,0.0005254512,0.0062392983,0.0021562234,0.01511396],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99749315,0.00026866942,0.00018123412,0.00054906687,0.00106325,0.00044456203],"domain_scores_gemma":[0.9950659,0.0016335581,0.00034913907,0.0023374103,0.00041307547,0.00020093119],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074911764,0.0016047255,0.001543151,0.0009827773,0.0013303928,0.0029020372,0.0045925537,0.0015692583,0.015356837],"category_scores_gemma":[0.0051318686,0.00092404126,0.0012833555,0.003987698,0.0014042103,0.0121858185,0.004079498,0.0023522323,0.0046309466],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0027028448,0.00057385874,0.0030787096,0.0006525726,0.00019199216,0.0004165645,0.0007584923,0.13705762,0.047133274,0.068380594,0.060970664,0.67808276],"study_design_scores_gemma":[0.0007751306,0.0003940761,0.0016080361,0.00006872203,0.00019236295,0.00089380203,0.00062382384,0.7097997,0.058169793,0.17809865,0.049256194,0.000119745724],"about_ca_topic_score_codex":0.00548631,"about_ca_topic_score_gemma":0.007897098,"teacher_disagreement_score":0.015356837,"about_ca_system_score_codex":0.0020413985,"about_ca_system_score_gemma":0.0014741949,"threshold_uncertainty_score":0.05137372},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017202366,0.001977262,0.96365774,0.0067390623,0.0002909791,0.00015308245,0.0008097085,0.0016455968,0.0075241933],"genre_scores_gemma":[0.3118224,0.0036455533,0.6613129,0.0019712232,0.002200464,0.0007480731,0.0029206814,0.0011324658,0.01424623],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9904411,0.0016430343,0.0006657237,0.0025419216,0.0034972045,0.0012111036],"domain_scores_gemma":[0.95703685,0.021424362,0.0024906485,0.014900559,0.0031239968,0.0010236272],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048440835,0.0015477291,0.0019485924,0.0017645992,0.0026619923,0.005423318,0.0070181,0.0037026745,0.009668509],"category_scores_gemma":[0.028910507,0.0015537003,0.0027262738,0.004991533,0.005500928,0.020297525,0.009255486,0.00835741,0.0021463905],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010526788,0.0005128427,0.0031659778,0.0010103842,0.00016362933,0.00043982884,0.0011083774,0.10349696,0.0070040924,0.41023615,0.03860843,0.4332006],"study_design_scores_gemma":[0.00026570438,0.00028110208,0.0016976569,0.00016095878,0.00011366891,0.0012908517,0.0007432388,0.35505122,0.016120505,0.57727855,0.046808627,0.00018785121],"about_ca_topic_score_codex":0.0047488264,"about_ca_topic_score_gemma":0.002043353,"teacher_disagreement_score":0.009668509,"about_ca_system_score_codex":0.0030728593,"about_ca_system_score_gemma":0.0020342874,"threshold_uncertainty_score":0.03234434},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004147714,0.00018500169,0.9924344,0.000059012353,0.00008670442,0.000062310806,0.000076937264,0.0009198872,0.0020281195],"genre_scores_gemma":[0.05289839,0.00016267989,0.9405903,0.00008369708,0.00006892696,0.0002426493,0.0005057607,0.00063494133,0.0048126145],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99740845,0.00063343794,0.00017629135,0.00050666917,0.0010077117,0.0002674638],"domain_scores_gemma":[0.99483657,0.0019195981,0.00021064622,0.0018434478,0.0009936554,0.00019605797],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023110898,0.0015985568,0.0019681503,0.0028540564,0.0013463912,0.0023771883,0.0041266284,0.0015975693,0.016756931],"category_scores_gemma":[0.012921263,0.0015227202,0.0019114318,0.0031703415,0.0016841784,0.004355195,0.0060023353,0.0034491331,0.004231951],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007457053,0.00022292318,0.0010336036,0.00043586714,0.00011888203,0.000118743345,0.00048489528,0.22448093,0.009417241,0.18524979,0.017090708,0.56060076],"study_design_scores_gemma":[0.00014828041,0.00008653608,0.00031002445,0.000046020545,0.0000571943,0.00009962056,0.00007121517,0.886032,0.0052390425,0.09718057,0.010694737,0.000034737535],"about_ca_topic_score_codex":0.003552195,"about_ca_topic_score_gemma":0.006476367,"teacher_disagreement_score":0.016756931,"about_ca_system_score_codex":0.0015010328,"about_ca_system_score_gemma":0.0011730823,"threshold_uncertainty_score":0.056057513},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22182183,0.001914226,0.74049324,0.0010873557,0.00015547081,0.00007332305,0.001115962,0.0012940201,0.032044623],"genre_scores_gemma":[0.71770287,0.0014042719,0.2748382,0.00015153813,0.000100910154,0.00024034287,0.00093870785,0.00034089253,0.004282288],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999154,0.00017107328,0.00007748996,0.00019081363,0.00024675226,0.00015976377],"domain_scores_gemma":[0.995076,0.0032007091,0.00048615102,0.000681928,0.00028754096,0.00026775527],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008193818,0.0006396771,0.0009538084,0.0012034745,0.000732546,0.002883885,0.0018343095,0.0012248596,0.0065528504],"category_scores_gemma":[0.008435119,0.0005300799,0.00068963226,0.0017519622,0.0017645638,0.0041092834,0.0022471223,0.0012641912,0.000876689],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005981358,0.00008129143,0.0051412643,0.00084131106,0.0000764168,0.0004812151,0.0005684528,0.31399935,0.025704814,0.46059993,0.008134363,0.18377338],"study_design_scores_gemma":[0.000056358305,0.00012073155,0.0017194272,0.0001715758,0.000057808644,0.00064561685,0.00025112717,0.5034108,0.01895001,0.46187004,0.01269356,0.00005286306],"about_ca_topic_score_codex":0.00057077035,"about_ca_topic_score_gemma":0.0008764225,"teacher_disagreement_score":0.0065528504,"about_ca_system_score_codex":0.0007326852,"about_ca_system_score_gemma":0.00031063895,"threshold_uncertainty_score":0.021921456},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031862304,0.0015771862,0.94628936,0.0004244684,0.000095040516,0.00014535243,0.00025492487,0.0016626363,0.017688766],"genre_scores_gemma":[0.56124943,0.0013194386,0.4299423,0.00025454976,0.00012926357,0.00019637616,0.00079573167,0.00018274445,0.0059301425],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993376,0.00010397352,0.000039333296,0.00015187038,0.00025704483,0.00011017523],"domain_scores_gemma":[0.99916124,0.00027899237,0.00007645221,0.00031682823,0.00010564794,0.000060818253],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036513773,0.00039994274,0.000533833,0.00063360686,0.0003945403,0.00094779604,0.0017151689,0.0006736382,0.0059446525],"category_scores_gemma":[0.003113744,0.00021806921,0.00043535556,0.0022063062,0.0006382701,0.0022757028,0.0014832154,0.0004991179,0.0013096973],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009506944,0.00023749689,0.0027198358,0.00053066754,0.000062404724,0.00048182523,0.00047845193,0.18064839,0.027737701,0.17080328,0.020128911,0.5952203],"study_design_scores_gemma":[0.0000831564,0.00024375058,0.00045695042,0.000030636904,0.000033900316,0.0006677903,0.00018085714,0.9090177,0.010458158,0.059787426,0.019009955,0.000029690762],"about_ca_topic_score_codex":0.004154849,"about_ca_topic_score_gemma":0.0027432223,"teacher_disagreement_score":0.0059446525,"about_ca_system_score_codex":0.0005970203,"about_ca_system_score_gemma":0.0005875794,"threshold_uncertainty_score":0.019886792},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8189823,0.0010362135,0.04373656,0.001699304,0.0004656402,0.00009857071,0.0037550237,0.0006243535,0.12960209],"genre_scores_gemma":[0.92877245,0.0010449187,0.034550812,0.00036638716,0.00009756758,0.00010038066,0.0038086544,0.000325826,0.030933067],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991123,0.00009017416,0.000055569784,0.00028773234,0.0001620952,0.00029207373],"domain_scores_gemma":[0.9985279,0.00039345113,0.0004941593,0.00025066477,0.00011498706,0.00021891369],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003754511,0.00089480495,0.00061111077,0.00069288036,0.00095864746,0.0022284796,0.00072690024,0.00072893035,0.013612107],"category_scores_gemma":[0.0014669097,0.00035645903,0.0006089354,0.001336651,0.0017904378,0.0017370137,0.0009792132,0.001096271,0.0033320198],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002205258,0.00027899176,0.016153375,0.0008851293,0.0002223366,0.0019565201,0.0010679167,0.026610564,0.09528334,0.62099427,0.053738788,0.18060352],"study_design_scores_gemma":[0.00017351219,0.0005443144,0.033021398,0.0002496994,0.0002495066,0.0056878626,0.0009887007,0.03933385,0.07575587,0.61260206,0.23097612,0.000417096],"about_ca_topic_score_codex":0.001435135,"about_ca_topic_score_gemma":0.0022439118,"teacher_disagreement_score":0.013612107,"about_ca_system_score_codex":0.00139652,"about_ca_system_score_gemma":0.00059996225,"threshold_uncertainty_score":0.045537055},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7463098,0.0016671394,0.22849154,0.0050099012,0.000107309024,0.00026378024,0.0024419008,0.0013921928,0.014316517],"genre_scores_gemma":[0.8670662,0.001384847,0.11898275,0.00044361927,0.00024118912,0.00026838342,0.004354038,0.0006211483,0.0066378457],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99646497,0.0010434056,0.00028255268,0.00071097305,0.000998521,0.0004994507],"domain_scores_gemma":[0.9298028,0.05787678,0.0049881744,0.0039107627,0.0016453144,0.0017762406],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002950595,0.0008030223,0.0017370459,0.0021925338,0.0024662556,0.004983369,0.0029819543,0.0027822596,0.006650484],"category_scores_gemma":[0.04045998,0.0010998029,0.0016403111,0.0032029278,0.003533535,0.009978265,0.003307604,0.003054224,0.0009117719],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013252351,0.00036280634,0.015337602,0.0009793353,0.0001563919,0.0011422192,0.0032005566,0.573222,0.0069833947,0.27499953,0.012590063,0.109700836],"study_design_scores_gemma":[0.00008857219,0.00010383253,0.0018181133,0.000065848704,0.00006847169,0.0004500397,0.00043323773,0.5846795,0.0017218295,0.40730178,0.0032199519,0.000048816488],"about_ca_topic_score_codex":0.0030876864,"about_ca_topic_score_gemma":0.0029175652,"teacher_disagreement_score":0.006650484,"about_ca_system_score_codex":0.0025863193,"about_ca_system_score_gemma":0.001152712,"threshold_uncertainty_score":0.02224809},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28050026,0.00022421333,0.71568376,0.00007669719,0.000046419173,0.000120826044,0.00015466168,0.00076602824,0.0024271223],"genre_scores_gemma":[0.6510704,0.00020812264,0.34671247,0.00003248595,0.000016683118,0.000051232302,0.00032820602,0.00011832917,0.0014620234],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995264,0.000068500885,0.000045005752,0.000079525336,0.00019492194,0.00008565061],"domain_scores_gemma":[0.99749655,0.0014742989,0.00031840653,0.0003804367,0.0001849387,0.00014532544],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041010525,0.00052602816,0.0007328996,0.0005190896,0.00042732296,0.0008016278,0.0007074265,0.0003965032,0.0021466857],"category_scores_gemma":[0.003451414,0.00041919234,0.00062062254,0.00046712943,0.00097474654,0.0014432142,0.0018426628,0.00065324723,0.00037115236],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0035457117,0.00025643504,0.017767793,0.0011027809,0.00012218929,0.002198339,0.0013421692,0.27411053,0.13569272,0.058384694,0.003275609,0.50220096],"study_design_scores_gemma":[0.00008541797,0.0005748983,0.0031082002,0.000090750924,0.000051632916,0.0009973071,0.0004884695,0.8439418,0.08186407,0.0629665,0.0057836417,0.000047163107],"about_ca_topic_score_codex":0.00060084386,"about_ca_topic_score_gemma":0.0008322785,"teacher_disagreement_score":0.0021466857,"about_ca_system_score_codex":0.00017459526,"about_ca_system_score_gemma":0.00027876542,"threshold_uncertainty_score":0.007181406},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24758974,0.0007728343,0.7319244,0.0007665415,0.0002133806,0.000089674155,0.00052503956,0.00017179329,0.017946547],"genre_scores_gemma":[0.7656232,0.0007481168,0.21400517,0.00023729741,0.00026192085,0.0002110132,0.00093675,0.0002106748,0.017765863],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99806553,0.00048067857,0.0001512117,0.00043102299,0.00072527234,0.00014624721],"domain_scores_gemma":[0.99358034,0.0035351557,0.000718603,0.00055947946,0.0009541817,0.00065220665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016074321,0.00063082995,0.0011765385,0.004025748,0.0014637518,0.00345585,0.0028241244,0.0012977534,0.003766872],"category_scores_gemma":[0.010102115,0.00081375655,0.0008479636,0.0028842129,0.003968195,0.005439172,0.004152263,0.0032061797,0.0007650112],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000066125656,0.000022758355,0.00041541728,0.00006026721,0.000012926203,0.00007279978,0.00029913566,0.006360905,0.000957361,0.98090357,0.0007203232,0.01010834],"study_design_scores_gemma":[0.000018714414,0.000035851288,0.0005017313,0.000020568841,0.000013009675,0.00014542624,0.00022948466,0.040943954,0.0010036966,0.95450217,0.0025659786,0.000019457368],"about_ca_topic_score_codex":0.0010224992,"about_ca_topic_score_gemma":0.0009786852,"teacher_disagreement_score":0.004025748,"about_ca_system_score_codex":0.0015746325,"about_ca_system_score_gemma":0.00046325295,"threshold_uncertainty_score":0.012601435},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010942543,0.00036454448,0.96975344,0.0005820723,0.00020443926,0.00017906813,0.00020639315,0.0014395592,0.016327899],"genre_scores_gemma":[0.15023997,0.00062093453,0.83150923,0.0002861572,0.00024205276,0.00041316915,0.00096707174,0.0010264022,0.014695034],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973839,0.00045637193,0.0001709809,0.0006285242,0.0010455049,0.00031481538],"domain_scores_gemma":[0.9962823,0.001991806,0.00016949818,0.0010020628,0.00043304014,0.00012140748],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002402597,0.0018401667,0.0019663405,0.0031219993,0.002177669,0.0041901255,0.004763394,0.0025058899,0.02500105],"category_scores_gemma":[0.01301606,0.0015184155,0.0023120411,0.004050779,0.001907417,0.010640372,0.0077932617,0.004485045,0.005898353],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003441833,0.0002809137,0.0006326685,0.00033812496,0.00012554564,0.000112925976,0.00024546875,0.04032287,0.0031740342,0.5407573,0.01936178,0.39430428],"study_design_scores_gemma":[0.00012429887,0.00005452181,0.00019134731,0.00003148341,0.00006736353,0.0001018752,0.00009887238,0.24573371,0.0038339198,0.7381524,0.011580152,0.000030025383],"about_ca_topic_score_codex":0.0020959936,"about_ca_topic_score_gemma":0.0027849239,"teacher_disagreement_score":0.02500105,"about_ca_system_score_codex":0.00219885,"about_ca_system_score_gemma":0.0019802481,"threshold_uncertainty_score":0.08363682},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040389437,0.0007677741,0.9514528,0.0002590844,0.000048620754,0.00007983812,0.00013045286,0.00022062163,0.0066515026],"genre_scores_gemma":[0.39776126,0.0013852154,0.5900305,0.00023088013,0.00026280453,0.00029961855,0.0010992633,0.0008005178,0.008130071],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99834776,0.00043861175,0.000104102604,0.00039219158,0.00058344804,0.00013393427],"domain_scores_gemma":[0.9925248,0.004964486,0.0005261191,0.0007615261,0.00074046245,0.00048265734],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018616485,0.0013767168,0.002990441,0.0025209659,0.0011215551,0.0031158347,0.0029557056,0.001658523,0.0033010382],"category_scores_gemma":[0.01388493,0.0014866883,0.0015126574,0.0022688154,0.004166015,0.008272361,0.0069173304,0.0034138106,0.00067639607],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033908506,0.00010774687,0.0019977023,0.0006028645,0.000069130256,0.0005850618,0.0015991398,0.110952325,0.0101498375,0.77529657,0.0061571593,0.09214342],"study_design_scores_gemma":[0.00002342434,0.00012882908,0.0007616433,0.000118470656,0.000039243463,0.0003468309,0.00033571423,0.5668543,0.0063118762,0.4178131,0.007209647,0.00005696364],"about_ca_topic_score_codex":0.0019218223,"about_ca_topic_score_gemma":0.0012484156,"teacher_disagreement_score":0.0033010382,"about_ca_system_score_codex":0.0013954233,"about_ca_system_score_gemma":0.00065889047,"threshold_uncertainty_score":0.011043012},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08121415,0.000116945695,0.9022002,0.00026936052,0.00006709007,0.00008901147,0.00036064725,0.002307459,0.013375191],"genre_scores_gemma":[0.4063249,0.00026172708,0.5805875,0.000112992144,0.000012337816,0.000097048694,0.00091491744,0.000364138,0.011324461],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997149,0.000031393283,0.00002229693,0.0000560695,0.00013261939,0.00004262131],"domain_scores_gemma":[0.9995433,0.00011499241,0.00004992978,0.00018981766,0.00007900788,0.000023005347],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018522945,0.0002608372,0.00030295434,0.0004706337,0.0004854246,0.0008391217,0.00066417194,0.00045902358,0.0072616185],"category_scores_gemma":[0.0012346462,0.00028324587,0.00034016056,0.000633269,0.0005390237,0.0015257595,0.0011914336,0.0005173021,0.0015696253],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005004362,0.00012258209,0.0034206728,0.00036775187,0.000060802213,0.00059499464,0.0006773772,0.09494915,0.15783972,0.17572129,0.011389767,0.5543555],"study_design_scores_gemma":[0.000112944916,0.0005276548,0.0021967466,0.00008563828,0.00008422958,0.001069926,0.0005386872,0.5879882,0.12654893,0.14334568,0.1374055,0.00009580227],"about_ca_topic_score_codex":0.0018242256,"about_ca_topic_score_gemma":0.0027164228,"teacher_disagreement_score":0.0072616185,"about_ca_system_score_codex":0.00039026872,"about_ca_system_score_gemma":0.0005374738,"threshold_uncertainty_score":0.024292469},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.105116256,0.00016482483,0.87940305,0.00006991394,0.000026235335,0.00007272784,0.0001708507,0.00035723174,0.014618891],"genre_scores_gemma":[0.5229553,0.00076805503,0.4594285,0.00005480795,0.00004354848,0.00012602024,0.00068711047,0.00039474337,0.015541918],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997222,0.000038846716,0.000017631035,0.00007075285,0.000108489716,0.000042120362],"domain_scores_gemma":[0.999527,0.00011531999,0.00011323757,0.00010813008,0.000091774054,0.00004463072],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023333644,0.0005610013,0.0003246639,0.0013195104,0.00072593905,0.0010098943,0.00073598267,0.00056989375,0.005926264],"category_scores_gemma":[0.0011398987,0.00044600407,0.0006092202,0.0012461061,0.0013421662,0.0019015109,0.0013362544,0.0007189939,0.0013170638],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007333309,0.000051546747,0.0011250103,0.00012960321,0.000025989777,0.0006214227,0.0004029591,0.094418205,0.022025557,0.7973378,0.0017443937,0.08204422],"study_design_scores_gemma":[0.000024121991,0.00013310616,0.0013738218,0.00006824564,0.000033571836,0.001064793,0.000406596,0.2539932,0.01739721,0.6872032,0.038261704,0.000040387105],"about_ca_topic_score_codex":0.0009477442,"about_ca_topic_score_gemma":0.0013447015,"teacher_disagreement_score":0.005926264,"about_ca_system_score_codex":0.0004109022,"about_ca_system_score_gemma":0.00024826158,"threshold_uncertainty_score":0.01982528},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004728807,0.00018600293,0.98643285,0.000115497794,0.000120535646,0.000120957,0.00018205289,0.005336817,0.0027765243],"genre_scores_gemma":[0.02398697,0.00009935327,0.9702364,0.00008545157,0.000033163662,0.00015261135,0.0008346067,0.00048932544,0.004082111],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99860805,0.00012743844,0.00011149958,0.00026999053,0.00069390575,0.00018914606],"domain_scores_gemma":[0.9987047,0.00022273156,0.000055916025,0.00053591834,0.0004276362,0.000053100313],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005575438,0.0011402419,0.0012828349,0.0016843276,0.0007118664,0.0013096937,0.002881414,0.0012829528,0.0129407635],"category_scores_gemma":[0.0030203406,0.0007301668,0.0013374736,0.002758008,0.0005866267,0.0028058765,0.00267391,0.001717101,0.006576615],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030266162,0.0001841197,0.0008176759,0.0002812681,0.00007749965,0.00019442056,0.0002254787,0.020233808,0.04519541,0.020419413,0.020555919,0.8915123],"study_design_scores_gemma":[0.00057071884,0.00045098178,0.0020517427,0.000096586766,0.00028200596,0.0017972764,0.00015548116,0.7213666,0.04978485,0.061097912,0.1621391,0.00020677499],"about_ca_topic_score_codex":0.0055112233,"about_ca_topic_score_gemma":0.008857844,"teacher_disagreement_score":0.0129407635,"about_ca_system_score_codex":0.00075639825,"about_ca_system_score_gemma":0.0016477949,"threshold_uncertainty_score":0.04329115},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005333297,0.00033787836,0.9904208,0.000090921036,0.00007304053,0.000056119574,0.000027228023,0.00049325783,0.0031673093],"genre_scores_gemma":[0.091909535,0.00077957194,0.900066,0.00014691132,0.00010853626,0.00012266943,0.00011324119,0.00032637152,0.006427158],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9994585,0.00008704578,0.000026422413,0.00007799854,0.00031229574,0.000037688686],"domain_scores_gemma":[0.9994549,0.00019472388,0.000052733852,0.00014292423,0.00013114339,0.000023452449],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049652933,0.00056535844,0.00041096666,0.0007805891,0.00044199955,0.0004717939,0.0009747359,0.0007850126,0.0042070453],"category_scores_gemma":[0.0018171852,0.00036655547,0.000504776,0.0005289773,0.0004934721,0.000883508,0.0010500712,0.00094074034,0.0015570512],"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.00016261952,0.000043721728,0.0006277495,0.0005436829,0.000061535975,0.0005673619,0.0004584093,0.035476755,0.5241347,0.04484749,0.006144441,0.38693154],"study_design_scores_gemma":[0.00009875995,0.0005776563,0.0018174802,0.00015807523,0.0001343868,0.0051247403,0.00017278497,0.48990545,0.2996608,0.019694129,0.18250506,0.00015075273],"about_ca_topic_score_codex":0.00049470813,"about_ca_topic_score_gemma":0.00060273946,"teacher_disagreement_score":0.0042070453,"about_ca_system_score_codex":0.00015953027,"about_ca_system_score_gemma":0.00033544816,"threshold_uncertainty_score":0.014073968},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.121688485,0.0015976947,0.79837304,0.00066796056,0.00037564652,0.00016982987,0.0006842199,0.0010236105,0.075419545],"genre_scores_gemma":[0.36916202,0.0017331972,0.57135904,0.00039226422,0.00018542154,0.00026538383,0.001576468,0.0014598804,0.05386636],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99950695,0.00012828498,0.000027167893,0.00009582562,0.00014928129,0.00009247461],"domain_scores_gemma":[0.99879694,0.0006005542,0.00010288169,0.00028974438,0.00012571833,0.000084115294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004603779,0.0011169481,0.0012573609,0.0012046496,0.0009783733,0.0017031003,0.0014975714,0.0010811744,0.017874377],"category_scores_gemma":[0.003130934,0.00083870953,0.00073852565,0.0020937717,0.0011806249,0.0027551346,0.00229488,0.0017312166,0.0027129916],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00084893516,0.00014310222,0.0007781071,0.00048886146,0.000039707254,0.00020000181,0.00048749847,0.15613547,0.020261526,0.5203239,0.021606253,0.27868667],"study_design_scores_gemma":[0.00010094939,0.0001823594,0.0007585657,0.00013738785,0.000032479285,0.000288908,0.00022154406,0.30114773,0.005687114,0.66712105,0.024276067,0.000045875],"about_ca_topic_score_codex":0.002160292,"about_ca_topic_score_gemma":0.0032643387,"teacher_disagreement_score":0.017874377,"about_ca_system_score_codex":0.00082874775,"about_ca_system_score_gemma":0.0005690492,"threshold_uncertainty_score":0.059795797},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051729493,0.0004355785,0.8265084,0.000498338,0.0005983108,0.00037902695,0.0010145318,0.0020209,0.11681545],"genre_scores_gemma":[0.5667262,0.0007824338,0.3342124,0.00056354253,0.0002695133,0.00042832986,0.0033490937,0.0016291387,0.09203947],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982315,0.00023268523,0.000099068304,0.0005092011,0.00070467585,0.00022279275],"domain_scores_gemma":[0.9985923,0.0002190477,0.00010837826,0.00064737845,0.00031865723,0.00011422065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000846978,0.00086367986,0.00095300714,0.0024202724,0.0012516702,0.0023663717,0.0017260597,0.0016347776,0.032562017],"category_scores_gemma":[0.005486529,0.0005638578,0.0011178108,0.00209486,0.0011157597,0.003673207,0.0040963367,0.0018652369,0.00914796],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027578507,0.00014819742,0.0007386482,0.00015925636,0.00004282241,0.00033752745,0.00022789936,0.008722265,0.016182665,0.7089222,0.016288267,0.24795434],"study_design_scores_gemma":[0.000066385495,0.00017059232,0.00065692817,0.000063360225,0.000059228674,0.00085810997,0.00027098518,0.05718276,0.025474634,0.82974684,0.08540216,0.00004798067],"about_ca_topic_score_codex":0.00046402414,"about_ca_topic_score_gemma":0.00048534473,"teacher_disagreement_score":0.032562017,"about_ca_system_score_codex":0.00061776885,"about_ca_system_score_gemma":0.00072080403,"threshold_uncertainty_score":0.108930826},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.094952844,0.002197597,0.8895789,0.0008063179,0.00008956652,0.000053681648,0.00007942786,0.00014617688,0.012095525],"genre_scores_gemma":[0.8527671,0.0018405166,0.14244944,0.0000923196,0.0001799604,0.00008638639,0.00009063003,0.000112972186,0.0023807664],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99876523,0.00042445023,0.000067184745,0.0002065146,0.00041417129,0.00012243638],"domain_scores_gemma":[0.99069136,0.005660389,0.0013169544,0.0007491113,0.0011522282,0.000430031],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021351846,0.00065102684,0.0009103262,0.0025231997,0.0008873313,0.0016621257,0.0013375545,0.0011389587,0.0018234547],"category_scores_gemma":[0.018773833,0.00035423943,0.00088856195,0.0027421857,0.0036018093,0.0030601593,0.0038000855,0.0016261054,0.00044196224],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022822549,0.00005157471,0.0071340883,0.00022992076,0.000045696754,0.00054598495,0.00092713133,0.3094353,0.012341534,0.60808307,0.0017661239,0.059211425],"study_design_scores_gemma":[0.000022018963,0.00024341377,0.003835575,0.00011864104,0.000025055911,0.0011188692,0.00050053385,0.7277019,0.006546359,0.2515992,0.008213222,0.00007516082],"about_ca_topic_score_codex":0.0020860615,"about_ca_topic_score_gemma":0.0011242968,"teacher_disagreement_score":0.0025231997,"about_ca_system_score_codex":0.0018826339,"about_ca_system_score_gemma":0.00066102017,"threshold_uncertainty_score":0.013659477},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010640868,0.0015546718,0.9821155,0.0007207171,0.00010954909,0.000019842442,0.00016433194,0.00013978189,0.004534714],"genre_scores_gemma":[0.7114853,0.006289335,0.25046858,0.0007948959,0.00097266905,0.00038199293,0.000736848,0.00022275202,0.028647566],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99761236,0.0011990359,0.000088381516,0.00029559087,0.00057849777,0.0002261667],"domain_scores_gemma":[0.9943652,0.0034803434,0.000629817,0.00072970777,0.00057317934,0.00022181982],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037129815,0.0010524277,0.0014157621,0.0016256201,0.00071852026,0.0027710197,0.0015652693,0.0016211538,0.0036725022],"category_scores_gemma":[0.010732054,0.0007050393,0.0013009872,0.0015608959,0.0022461165,0.0028631154,0.0029998159,0.0026151126,0.0009004033],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027036405,0.000018561605,0.0006023437,0.00007349608,0.000055113513,0.00006824595,0.000104683866,0.15665692,0.00035442543,0.8288754,0.0016986724,0.011465067],"study_design_scores_gemma":[0.0000075586986,0.000017008468,0.00025654666,0.000023961506,0.000016476559,0.000035704103,0.000027896107,0.5525185,0.000121180245,0.44403368,0.002926126,0.000015347096],"about_ca_topic_score_codex":0.0034882876,"about_ca_topic_score_gemma":0.0036800785,"teacher_disagreement_score":0.0037129815,"about_ca_system_score_codex":0.0012035376,"about_ca_system_score_gemma":0.0008786793,"threshold_uncertainty_score":0.019636333},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17470463,0.004262664,0.7815761,0.0006776211,0.00021404719,0.000052974425,0.00047539573,0.00048379687,0.037552785],"genre_scores_gemma":[0.83175355,0.0038473408,0.15023991,0.00028036762,0.00038446134,0.0001502037,0.00060289033,0.00044492813,0.012296446],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99918586,0.0001434108,0.000028737382,0.00020985825,0.00032491088,0.00010720075],"domain_scores_gemma":[0.9960305,0.0023255378,0.000613198,0.00054898974,0.0003053759,0.00017636338],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007598385,0.00072624144,0.0006905997,0.0013831451,0.0006076886,0.0013153151,0.00096132094,0.0008995394,0.0050200066],"category_scores_gemma":[0.0065252343,0.00053229043,0.00038516277,0.0010558778,0.0022197478,0.0028448205,0.0031609582,0.0009888216,0.0011971787],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034269798,0.000049979684,0.0066633606,0.0006354928,0.00008075028,0.0011001772,0.0008068159,0.13987091,0.056447297,0.6427779,0.009159444,0.14206526],"study_design_scores_gemma":[0.000040813757,0.0001958936,0.009133169,0.00021503629,0.00007922932,0.0037624992,0.000304599,0.43529812,0.026198693,0.4877446,0.036938794,0.000088604946],"about_ca_topic_score_codex":0.0005128921,"about_ca_topic_score_gemma":0.00039372023,"teacher_disagreement_score":0.0050200066,"about_ca_system_score_codex":0.0005503068,"about_ca_system_score_gemma":0.0002557571,"threshold_uncertainty_score":0.016793549},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2875836,0.00022346336,0.7059284,0.00010003816,0.000029424351,0.00012316222,0.0001676123,0.0011244756,0.0047198725],"genre_scores_gemma":[0.64330494,0.00018306554,0.35161325,0.00004807702,0.000022832586,0.00018053394,0.0006807167,0.00018903668,0.003777519],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99950576,0.00012740384,0.000026972795,0.00013658313,0.0001007241,0.00010261535],"domain_scores_gemma":[0.99874073,0.00033883308,0.00017343274,0.00046431378,0.0001459499,0.00013672427],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035185114,0.0005534273,0.0007004638,0.00060696626,0.0005808405,0.0007321788,0.0012067914,0.0005574732,0.0036594137],"category_scores_gemma":[0.0022872265,0.00035284573,0.00046841332,0.0009226763,0.0006599938,0.0015711818,0.0016867298,0.000679495,0.0007579896],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007396867,0.00035506045,0.0068168123,0.0005378785,0.000095918534,0.0006156586,0.00083150767,0.5287324,0.07550014,0.10016306,0.004400526,0.28121138],"study_design_scores_gemma":[0.000052802636,0.0002915456,0.0013546466,0.000041483465,0.00003170992,0.00037263302,0.00038292224,0.88177854,0.041743577,0.06863135,0.0052879113,0.00003086867],"about_ca_topic_score_codex":0.00089578377,"about_ca_topic_score_gemma":0.0014798943,"teacher_disagreement_score":0.0036594137,"about_ca_system_score_codex":0.00056393945,"about_ca_system_score_gemma":0.00041793843,"threshold_uncertainty_score":0.012242019},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2568432,0.0016531697,0.43260562,0.0008914201,0.00072852935,0.000086914966,0.00061012775,0.0007832335,0.30579782],"genre_scores_gemma":[0.8252048,0.0010092907,0.119594835,0.00014496804,0.0002583886,0.00008052989,0.00049850927,0.00038337498,0.052825276],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99970835,0.000048902595,0.000010302198,0.00007453372,0.00012496614,0.000032962158],"domain_scores_gemma":[0.99962413,0.00012517137,0.000052342366,0.00007532113,0.000053359203,0.000069669826],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017939022,0.00044207304,0.00036992136,0.00065852515,0.00059432077,0.0015692591,0.0007127655,0.0008090182,0.006920679],"category_scores_gemma":[0.0011759811,0.00045204643,0.00021415159,0.0005748089,0.0019155756,0.0016808233,0.001528663,0.0013292657,0.0014261799],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018488822,0.000026614192,0.0004674996,0.00016026276,0.000009425419,0.00046799053,0.0004557946,0.008560514,0.012484747,0.8981016,0.006181017,0.072899565],"study_design_scores_gemma":[0.00007640496,0.00017233487,0.0012522505,0.00010259971,0.000016557964,0.001607319,0.00050634984,0.05536872,0.0065011987,0.8629528,0.07140815,0.00003539194],"about_ca_topic_score_codex":0.00019860112,"about_ca_topic_score_gemma":0.00016445825,"teacher_disagreement_score":0.006920679,"about_ca_system_score_codex":0.00021800288,"about_ca_system_score_gemma":0.00020407545,"threshold_uncertainty_score":0.023151934},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8178373,0.0008171448,0.14591393,0.0008292044,0.000102379796,0.00010734591,0.00066585315,0.0012837758,0.032442972],"genre_scores_gemma":[0.9661538,0.0004285672,0.02630284,0.00020098996,0.00006217377,0.00011162308,0.00053340604,0.0003723144,0.0058342284],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99940753,0.000081456215,0.00002866246,0.00016200925,0.00015812174,0.00016220496],"domain_scores_gemma":[0.9875995,0.007450314,0.0013851847,0.001223773,0.0008174862,0.0015236654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009201768,0.0012143325,0.0011937477,0.0033952906,0.0019225074,0.0036081946,0.001996633,0.0016485952,0.009172131],"category_scores_gemma":[0.010120987,0.0013992025,0.00068585697,0.002044135,0.0023853579,0.0054952,0.0020628143,0.0025550192,0.0008059695],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000734359,0.00016900698,0.0041579027,0.00030262023,0.00007103164,0.00048593257,0.0007719774,0.033665992,0.022040384,0.9060816,0.0052281255,0.02629098],"study_design_scores_gemma":[0.000093873925,0.00007485495,0.0015913104,0.000057515525,0.00006946542,0.00058428926,0.0003011923,0.06321635,0.01008903,0.92071515,0.00316712,0.00003987964],"about_ca_topic_score_codex":0.00066813314,"about_ca_topic_score_gemma":0.0010439557,"teacher_disagreement_score":0.009172131,"about_ca_system_score_codex":0.0012532251,"about_ca_system_score_gemma":0.0005997113,"threshold_uncertainty_score":0.030683875},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.64995885,0.0006304217,0.30723765,0.0005901105,0.00009356977,0.0001654945,0.0007039727,0.00041511853,0.04020481],"genre_scores_gemma":[0.84023005,0.0005574463,0.1388101,0.00020579521,0.00005268565,0.00016197462,0.001108239,0.0002770495,0.018596712],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994993,0.00009264807,0.0000332395,0.00011834555,0.00018170397,0.00007474325],"domain_scores_gemma":[0.9988281,0.00049126166,0.00021192952,0.00016970393,0.00018350525,0.00011552909],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003178083,0.0005191034,0.00071156124,0.002081853,0.0012453758,0.0022574433,0.001299386,0.0012137041,0.007362382],"category_scores_gemma":[0.0027933088,0.0007779307,0.0005552179,0.0026736837,0.0013889762,0.0021676167,0.0018676557,0.0013844438,0.0010128336],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012285433,0.00006501965,0.0017819167,0.000197155,0.000028274173,0.00040512648,0.0008398888,0.03572613,0.006322506,0.89591444,0.0041039623,0.054492783],"study_design_scores_gemma":[0.000033421285,0.00004208484,0.0012068386,0.00007952865,0.000032755925,0.0004871465,0.0006352482,0.091165386,0.0041368613,0.892398,0.009759851,0.000022885168],"about_ca_topic_score_codex":0.001849798,"about_ca_topic_score_gemma":0.0023677803,"teacher_disagreement_score":0.007362382,"about_ca_system_score_codex":0.00082473323,"about_ca_system_score_gemma":0.0003367816,"threshold_uncertainty_score":0.024629653},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11930378,0.00033145864,0.7330511,0.0011595454,0.0006457952,0.00021376288,0.00083977927,0.0013809988,0.14307377],"genre_scores_gemma":[0.71420485,0.0006397799,0.18987279,0.00057699584,0.00040707842,0.0002937581,0.0011897942,0.0012062566,0.09160866],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985954,0.00017190877,0.00007824993,0.00038750254,0.0005793428,0.00018757564],"domain_scores_gemma":[0.99812394,0.00031960921,0.00024373649,0.000370519,0.00058263785,0.00035958798],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008610352,0.00088355923,0.00057442114,0.0019488957,0.0016458428,0.0029318235,0.0014073491,0.0012599427,0.015807616],"category_scores_gemma":[0.0046203667,0.00047257752,0.0008950292,0.0011901724,0.0029389355,0.0071219616,0.0034560093,0.0033375572,0.0035643275],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014278074,0.000010157717,0.00011830523,0.000016886806,0.000002153415,0.00005857796,0.00008484942,0.0014078327,0.0013708455,0.9887961,0.0012292692,0.00689078],"study_design_scores_gemma":[0.00000902986,0.000025897656,0.00021178264,0.000015306641,0.0000050001154,0.00030752187,0.00007152428,0.018332975,0.0022804756,0.9609218,0.017793102,0.0000256006],"about_ca_topic_score_codex":0.001209766,"about_ca_topic_score_gemma":0.0013191289,"teacher_disagreement_score":0.015807616,"about_ca_system_score_codex":0.0016831966,"about_ca_system_score_gemma":0.0009871639,"threshold_uncertainty_score":0.052881777},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4674033,0.0006583971,0.5172291,0.00046508145,0.000089338726,0.00015977846,0.001156397,0.003184107,0.009654519],"genre_scores_gemma":[0.7945795,0.00021540812,0.20214133,0.00004010188,0.000055590895,0.000115514515,0.001175932,0.00025828523,0.0014182556],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99949634,0.0000613584,0.0000288179,0.00013887975,0.00019887042,0.0000757597],"domain_scores_gemma":[0.9986821,0.0005771857,0.00020438574,0.0001849859,0.00023478887,0.000116506584],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034759525,0.00051290944,0.0010274168,0.0014750235,0.0005318038,0.0011092965,0.00083369616,0.0006179302,0.0033024475],"category_scores_gemma":[0.0038559148,0.0004143501,0.0004793991,0.0011652514,0.00071521,0.0018185662,0.0014662719,0.0005349462,0.0006120303],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019070529,0.00024153179,0.026861968,0.00055707677,0.00022066743,0.0006886995,0.00052884594,0.3165248,0.06824605,0.045679707,0.0170489,0.5214946],"study_design_scores_gemma":[0.00010958633,0.00021260283,0.0045911875,0.000026743957,0.000036977366,0.00033363746,0.00022679786,0.9343484,0.027063698,0.027903965,0.005104232,0.00004212152],"about_ca_topic_score_codex":0.0016377837,"about_ca_topic_score_gemma":0.0021266139,"teacher_disagreement_score":0.0033024475,"about_ca_system_score_codex":0.00054565776,"about_ca_system_score_gemma":0.00073925866,"threshold_uncertainty_score":0.01104784},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29636365,0.001927949,0.6912201,0.00030839874,0.00004975514,0.0001966102,0.0007095211,0.0009578996,0.008266148],"genre_scores_gemma":[0.76093733,0.001028059,0.23354271,0.00005457084,0.00005411426,0.00014201502,0.00084931805,0.0002171271,0.0031747657],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992424,0.00012132563,0.000036105663,0.00015693204,0.00024927166,0.00019396805],"domain_scores_gemma":[0.99848527,0.0007941728,0.0002815206,0.00021726337,0.00007527665,0.00014656429],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005669946,0.0010652777,0.0010149702,0.001023373,0.00072086,0.0011378863,0.0011782662,0.0009276002,0.0025812099],"category_scores_gemma":[0.0027966418,0.00078746857,0.00096756517,0.001407126,0.0011485383,0.0023035596,0.0019974208,0.00082823465,0.00042613476],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028992753,0.00008704314,0.002681651,0.0002876422,0.00007207774,0.00038261546,0.00037231424,0.8751177,0.010087399,0.030823594,0.002249188,0.077548906],"study_design_scores_gemma":[0.000031759864,0.00015159066,0.00086376857,0.000031173146,0.000029245055,0.0003036769,0.00013683223,0.95892143,0.006638726,0.027603483,0.005270143,0.000018172492],"about_ca_topic_score_codex":0.0034859674,"about_ca_topic_score_gemma":0.0032099993,"teacher_disagreement_score":0.0034859674,"about_ca_system_score_codex":0.001293033,"about_ca_system_score_gemma":0.000525978,"threshold_uncertainty_score":0.009381652},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22532429,0.00062589487,0.7682904,0.000477709,0.00002739405,0.00008410878,0.0007102153,0.0012658825,0.003194014],"genre_scores_gemma":[0.81326616,0.00038977544,0.18275163,0.000064066706,0.000060118615,0.00012257519,0.0013067184,0.00015481899,0.0018841829],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99820745,0.00031143342,0.0001254016,0.00028212456,0.0009305029,0.00014298713],"domain_scores_gemma":[0.99283385,0.0041182945,0.0010758495,0.0013288034,0.00042600368,0.00021720502],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000825004,0.00041835755,0.0008696421,0.0021560006,0.0006731639,0.0011755342,0.0010393388,0.0007155993,0.0020395245],"category_scores_gemma":[0.012278878,0.0005512252,0.0005999217,0.0036116692,0.0019875045,0.0032644675,0.0025015026,0.0009185611,0.0004413461],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009837894,0.000102973,0.015360528,0.0002649057,0.0000694247,0.00036851794,0.00064880744,0.61993665,0.021327978,0.097577415,0.0033186562,0.2400403],"study_design_scores_gemma":[0.00004871948,0.00017403113,0.0040292307,0.000024970339,0.000025997851,0.0004626757,0.00012392347,0.8477979,0.010404915,0.13364008,0.0032311247,0.00003647668],"about_ca_topic_score_codex":0.0016553719,"about_ca_topic_score_gemma":0.0018140277,"teacher_disagreement_score":0.0021560006,"about_ca_system_score_codex":0.0011705323,"about_ca_system_score_gemma":0.0007092269,"threshold_uncertainty_score":0.008492827},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24203703,0.00087519566,0.65468985,0.0009951548,0.00057046965,0.00009164068,0.0002484838,0.0005559314,0.09993622],"genre_scores_gemma":[0.83085847,0.000743691,0.09015503,0.0004678178,0.00017169105,0.00018093247,0.0003579301,0.00043587454,0.0766287],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996877,0.00007569028,0.000014947259,0.000048838057,0.000119006916,0.00005393156],"domain_scores_gemma":[0.9985274,0.000704835,0.00008415798,0.00018110295,0.00025748045,0.000245036],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008258192,0.00097241614,0.00070633256,0.0013227327,0.00091797963,0.0013197649,0.0011192817,0.00093695434,0.009851386],"category_scores_gemma":[0.0036013643,0.00047618328,0.00059721246,0.0004327303,0.0015513721,0.0024426058,0.0028208082,0.002035991,0.00085866044],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022472058,0.00004609602,0.00051593315,0.00011396868,0.00002492653,0.00013461104,0.00007899644,0.020095164,0.00531325,0.9489135,0.0021770291,0.022361869],"study_design_scores_gemma":[0.000029454575,0.00007572749,0.00032083882,0.00003665562,0.000020232328,0.00012688768,0.000049334703,0.08982085,0.003976182,0.8999453,0.005584656,0.0000138479745],"about_ca_topic_score_codex":0.00043031375,"about_ca_topic_score_gemma":0.00077205134,"teacher_disagreement_score":0.009851386,"about_ca_system_score_codex":0.0007590913,"about_ca_system_score_gemma":0.00042998084,"threshold_uncertainty_score":0.032956183},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025345428,0.00035383026,0.9725937,0.000112086906,0.000023606248,0.00002843064,0.000018013507,0.0002920769,0.0012328244],"genre_scores_gemma":[0.27455303,0.0005460283,0.72336566,0.000087180095,0.00003760918,0.000080019265,0.00009691079,0.00024628575,0.0009872653],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991423,0.00029695925,0.000048334063,0.00007540798,0.00038962366,0.00004740268],"domain_scores_gemma":[0.9972904,0.0012321909,0.0002619983,0.00048505666,0.00066875987,0.00006163341],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020488922,0.0006892919,0.0006446108,0.0008580495,0.0003310125,0.0007833817,0.0011093065,0.00084702286,0.0012053548],"category_scores_gemma":[0.007720382,0.00047854581,0.0004236725,0.0008128076,0.0008584968,0.0011376668,0.0014241339,0.0010662082,0.00042380273],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031774875,0.00017922492,0.0021767474,0.00024337725,0.000056808676,0.000072385934,0.0002540342,0.6679976,0.051249065,0.036749974,0.0019695885,0.23873344],"study_design_scores_gemma":[0.000024260717,0.000034891014,0.0001440388,0.00000961753,0.000005990146,0.000016578613,0.000012833141,0.9842315,0.0062615564,0.008490837,0.0007623591,0.0000055417763],"about_ca_topic_score_codex":0.001035254,"about_ca_topic_score_gemma":0.0014346391,"teacher_disagreement_score":0.0020488922,"about_ca_system_score_codex":0.0003838613,"about_ca_system_score_gemma":0.00056724594,"threshold_uncertainty_score":0.010835707},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33272687,0.001871796,0.5908747,0.0012068407,0.0002877023,0.00012066181,0.0021816383,0.0012210027,0.0695088],"genre_scores_gemma":[0.63489276,0.002283363,0.3126952,0.0001720089,0.00021299587,0.00024398204,0.0029760906,0.0010954128,0.04542827],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99963784,0.00007387143,0.00002017307,0.00008717614,0.00013937059,0.00004150844],"domain_scores_gemma":[0.9987563,0.000539838,0.00022620933,0.0002267664,0.00013811307,0.00011276234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022337782,0.0013309936,0.00078045524,0.0008325775,0.0005296857,0.0010907119,0.0021575564,0.0012281412,0.007935103],"category_scores_gemma":[0.002766888,0.0009469715,0.0005105155,0.0011818751,0.0007099007,0.003075238,0.0022646226,0.002232114,0.001894228],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00085092575,0.00021028853,0.00094933773,0.0012150753,0.000092646726,0.00044171023,0.00068384566,0.30052015,0.043169532,0.40790644,0.01926596,0.22469413],"study_design_scores_gemma":[0.00011068361,0.0002652927,0.0009134124,0.00014692634,0.000057186582,0.00033071986,0.00025585596,0.33405524,0.011586443,0.6351494,0.017066868,0.000061862105],"about_ca_topic_score_codex":0.00080630335,"about_ca_topic_score_gemma":0.0013497518,"teacher_disagreement_score":0.007935103,"about_ca_system_score_codex":0.0007264505,"about_ca_system_score_gemma":0.0003228893,"threshold_uncertainty_score":0.026545584},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05830489,0.002387879,0.7380784,0.0035015913,0.0017961903,0.00006185411,0.00038263857,0.00039089643,0.19509561],"genre_scores_gemma":[0.75557214,0.0047236877,0.13210939,0.0015750814,0.0031246094,0.00022020056,0.0008160244,0.00084170216,0.1010172],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99897456,0.00021052524,0.000060835428,0.00017182437,0.0004284432,0.00015382419],"domain_scores_gemma":[0.9976476,0.0011675119,0.00021340906,0.0003138966,0.00044187345,0.0002157711],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014289839,0.0008636062,0.00092460046,0.0025857931,0.0017919955,0.0035358495,0.0017117001,0.0012625415,0.012817033],"category_scores_gemma":[0.0058317804,0.000660693,0.0015327368,0.0018413565,0.003128448,0.0075020907,0.0038386781,0.005347594,0.0020363166],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007123166,0.000009398348,0.00011865764,0.000020425201,0.0000032642631,0.000021663884,0.00006074123,0.00062604534,0.0002302231,0.9939202,0.0013815376,0.0036007322],"study_design_scores_gemma":[0.000007469557,0.000009138653,0.0001575341,0.00001440347,0.00000627076,0.00007851015,0.000035845707,0.009465591,0.0003520427,0.98407346,0.005791232,0.000008586543],"about_ca_topic_score_codex":0.001599775,"about_ca_topic_score_gemma":0.0010201092,"teacher_disagreement_score":0.012817033,"about_ca_system_score_codex":0.0013190259,"about_ca_system_score_gemma":0.00072535337,"threshold_uncertainty_score":0.042877197},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11569175,0.0024671634,0.82956874,0.0022999696,0.00039009732,0.00013991076,0.0006248731,0.0005464058,0.04827117],"genre_scores_gemma":[0.6503979,0.0019395961,0.29842407,0.0006710894,0.0005143478,0.00031880348,0.0014682577,0.0007585397,0.04550736],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99910754,0.00029402698,0.000026111387,0.00014391851,0.00031727075,0.0001111727],"domain_scores_gemma":[0.99803287,0.0013464526,0.00012270357,0.00024317748,0.00012426404,0.00013061566],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076756405,0.00092900114,0.0014369902,0.0011501599,0.0012748276,0.0017458892,0.0020652628,0.001980595,0.009623294],"category_scores_gemma":[0.005239985,0.00071983406,0.00084219244,0.0015438616,0.0018372622,0.002365534,0.0030279977,0.0024326202,0.00102408],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002925574,0.000120447105,0.0007947743,0.00040835777,0.00006543551,0.00021581913,0.00028393467,0.26817772,0.003232704,0.5996701,0.024431905,0.102306135],"study_design_scores_gemma":[0.00002934452,0.00004712935,0.0003487266,0.00004262308,0.000015242404,0.00017507038,0.00009932815,0.49977165,0.0013216739,0.4893131,0.008815963,0.000020235006],"about_ca_topic_score_codex":0.0031783038,"about_ca_topic_score_gemma":0.0022052682,"teacher_disagreement_score":0.009623294,"about_ca_system_score_codex":0.0012250714,"about_ca_system_score_gemma":0.00056188536,"threshold_uncertainty_score":0.032193124},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003341208,0.00012628172,0.9943193,0.00004440827,0.000060599763,0.00003237318,0.00004358199,0.0010354266,0.0009966688],"genre_scores_gemma":[0.07161335,0.0001958913,0.9226173,0.00012855553,0.00005253756,0.00015999986,0.0002278583,0.00017028405,0.0048341937],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996513,0.000048759262,0.000027286776,0.00007530924,0.00017743904,0.000019940086],"domain_scores_gemma":[0.99932134,0.00026749648,0.000040045703,0.000068937414,0.00028384838,0.000018379125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059325504,0.0007435722,0.000731625,0.00089951284,0.0003975446,0.00051107834,0.00095899275,0.0011742667,0.003665606],"category_scores_gemma":[0.0014410877,0.00062735786,0.0005620262,0.0008037461,0.00025259846,0.00073195243,0.00059022475,0.0008248181,0.0013360885],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015007266,0.000095871525,0.00052245305,0.00016712814,0.00007626543,0.00011697773,0.000044337416,0.13395618,0.05264139,0.0023411908,0.004698781,0.8051895],"study_design_scores_gemma":[0.000008352759,0.000021574686,0.00025370513,0.000014553057,0.000017094575,0.00006838652,0.0000037333268,0.98827064,0.008997988,0.00067997916,0.0016535665,0.000010593108],"about_ca_topic_score_codex":0.002146415,"about_ca_topic_score_gemma":0.0043258606,"teacher_disagreement_score":0.003665606,"about_ca_system_score_codex":0.0002902411,"about_ca_system_score_gemma":0.0004939274,"threshold_uncertainty_score":0.012262642},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00043129653,0.00005023617,0.9984609,0.000018988309,0.000016999744,0.00001761855,0.000010196767,0.00013506325,0.0008587067],"genre_scores_gemma":[0.020528845,0.00033953157,0.97666,0.000050661874,0.00004930918,0.00012199007,0.000094597046,0.0002592793,0.0018956957],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99860233,0.0003928444,0.00007174849,0.00022790839,0.00058938435,0.00011578376],"domain_scores_gemma":[0.99879575,0.00040508586,0.00009312853,0.0003450338,0.00028520467,0.000075813754],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013492511,0.0009184285,0.0009885192,0.0020338944,0.0007628549,0.001972305,0.0025371148,0.0012578556,0.006641056],"category_scores_gemma":[0.0040077283,0.0007431577,0.0013299957,0.002877375,0.0015702113,0.0035927899,0.0027521385,0.0021664598,0.00219665],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000679871,0.00006718695,0.00038326482,0.0002553496,0.00003591326,0.000105268955,0.0003121721,0.07869601,0.008525383,0.5673757,0.0064033307,0.3377724],"study_design_scores_gemma":[0.00004845495,0.0000949818,0.0001669259,0.000071259085,0.000027425078,0.00033053255,0.000115208044,0.6291593,0.0074876207,0.2992026,0.06323178,0.000064050626],"about_ca_topic_score_codex":0.0013698523,"about_ca_topic_score_gemma":0.0016383413,"teacher_disagreement_score":0.006641056,"about_ca_system_score_codex":0.0006678852,"about_ca_system_score_gemma":0.0010196883,"threshold_uncertainty_score":0.022216558},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38298184,0.00047069706,0.57921565,0.0025292183,0.00027138164,0.00023556086,0.00056800194,0.0011070035,0.032620706],"genre_scores_gemma":[0.7697921,0.00040637646,0.22047113,0.00035321352,0.00009967597,0.0002218791,0.0012920753,0.00017049076,0.0071930736],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99881697,0.00021391304,0.00008139699,0.00026933715,0.0004333605,0.00018497807],"domain_scores_gemma":[0.9979399,0.00127161,0.00022397247,0.00027658517,0.00018149367,0.00010634933],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081518106,0.0005096649,0.00065312895,0.0005241213,0.0011172306,0.0012433502,0.0013496432,0.0018616086,0.007018837],"category_scores_gemma":[0.005243806,0.00033040997,0.0009312131,0.0008552326,0.0020078467,0.0029186043,0.0025943962,0.0016192365,0.0008377526],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00051882374,0.00028151055,0.0017525129,0.0003982971,0.00006961402,0.0026390848,0.00065850926,0.09982709,0.011988926,0.7830985,0.011898146,0.086868905],"study_design_scores_gemma":[0.0002568368,0.00026042922,0.00081587076,0.000054675835,0.00006397608,0.00305137,0.00055713404,0.37049502,0.016807633,0.5794958,0.02807852,0.000062765954],"about_ca_topic_score_codex":0.00081472367,"about_ca_topic_score_gemma":0.00071712607,"teacher_disagreement_score":0.007018837,"about_ca_system_score_codex":0.0005469898,"about_ca_system_score_gemma":0.00046850982,"threshold_uncertainty_score":0.023480356},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010236478,0.00004547485,0.98832613,0.00004186991,0.0000049532505,0.000022516406,0.00012985972,0.0002788269,0.0009138664],"genre_scores_gemma":[0.21569245,0.0002021937,0.78028804,0.00003203529,0.000018100405,0.00006812357,0.0014396503,0.00018854887,0.0020708318],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99916494,0.00014622664,0.00004061605,0.00021043926,0.00036215055,0.000075692275],"domain_scores_gemma":[0.99832875,0.0007270327,0.0002150469,0.00041051873,0.0002590687,0.00005959632],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005746812,0.00071351277,0.0008163548,0.0013953336,0.00038040784,0.0011511139,0.0008894628,0.00094797084,0.0034895544],"category_scores_gemma":[0.0039608404,0.0006119451,0.00091186014,0.0012754003,0.0008053938,0.002233798,0.0015887318,0.001291847,0.0008734238],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00056403613,0.000104154264,0.002456295,0.00036729246,0.00006733612,0.00038691505,0.00024919296,0.3895005,0.050188627,0.092943944,0.0036712878,0.4595005],"study_design_scores_gemma":[0.000028555713,0.00010435738,0.000914299,0.00003060287,0.000020993606,0.0002537054,0.00010527662,0.8916071,0.028282693,0.073506296,0.005111028,0.00003510186],"about_ca_topic_score_codex":0.0018247883,"about_ca_topic_score_gemma":0.0024514275,"teacher_disagreement_score":0.0034895544,"about_ca_system_score_codex":0.00052336324,"about_ca_system_score_gemma":0.0008457949,"threshold_uncertainty_score":0.0116737485},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006773816,0.00022924933,0.98931795,0.00010957874,0.000053508516,0.00009545877,0.00005386733,0.00032222987,0.0030442271],"genre_scores_gemma":[0.089257,0.00035319934,0.90609944,0.00011032354,0.00002963086,0.00046809722,0.0002636327,0.00014775696,0.0032708244],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996319,0.00008009043,0.000015745974,0.00008454655,0.00014274588,0.000044971413],"domain_scores_gemma":[0.9994831,0.00028836832,0.000048761754,0.000049606977,0.000098621764,0.000031528685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068135327,0.001014772,0.0010594785,0.0011967642,0.00083759107,0.00076974835,0.0014804897,0.001609178,0.0030995598],"category_scores_gemma":[0.002775263,0.00061262323,0.001095989,0.0013082251,0.0009754239,0.00083923404,0.0011625533,0.0015796338,0.0007564613],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006080056,0.0000855028,0.0006160483,0.00011878871,0.00006586521,0.00012594949,0.00015480901,0.8163257,0.005417235,0.03252399,0.004544535,0.13996075],"study_design_scores_gemma":[0.000029703719,0.00004110293,0.00011096352,0.000022898988,0.000016910857,0.000055052387,0.000024389054,0.9827085,0.0010526124,0.012376574,0.0035496831,0.0000116337405],"about_ca_topic_score_codex":0.0058267755,"about_ca_topic_score_gemma":0.004779457,"teacher_disagreement_score":0.0058267755,"about_ca_system_score_codex":0.0010649611,"about_ca_system_score_gemma":0.0015740284,"threshold_uncertainty_score":0.011585712},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34870327,0.0014165265,0.59166056,0.0008484651,0.00020743987,0.00015835949,0.00090240285,0.0008808685,0.05522224],"genre_scores_gemma":[0.7815557,0.0007470479,0.20812087,0.0001817639,0.00014705615,0.000112950875,0.0010567819,0.00024102918,0.007836925],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984219,0.00023365521,0.00012679008,0.00030746925,0.0006168601,0.00029335733],"domain_scores_gemma":[0.9965835,0.0013573187,0.0003381083,0.00084558723,0.00044441887,0.00043104266],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061000715,0.00049575634,0.0007118664,0.0011032363,0.0011490679,0.0023671496,0.0010102214,0.0005652921,0.005547312],"category_scores_gemma":[0.005252878,0.0005839078,0.001092665,0.00090682105,0.0018715105,0.0030756914,0.0025161267,0.0022243478,0.00054107915],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006969187,0.0001631844,0.0049474654,0.0005991985,0.000070628696,0.0010507855,0.001114845,0.050861247,0.022975761,0.74693966,0.0064508007,0.16412951],"study_design_scores_gemma":[0.000089599045,0.00041138515,0.0062447195,0.00015116128,0.00011451163,0.0027555686,0.0013217386,0.20135261,0.05215783,0.6626959,0.072556466,0.00014854109],"about_ca_topic_score_codex":0.00069924654,"about_ca_topic_score_gemma":0.00087607274,"teacher_disagreement_score":0.005547312,"about_ca_system_score_codex":0.00051905494,"about_ca_system_score_gemma":0.00037333337,"threshold_uncertainty_score":0.018557608},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38266027,0.0013020667,0.5607984,0.0013986571,0.00030325982,0.00014770756,0.0005430995,0.0008487541,0.051997725],"genre_scores_gemma":[0.83419514,0.00083870714,0.13168728,0.00039772704,0.00011324091,0.00019371102,0.00093769154,0.0004296271,0.031206876],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999551,0.000090840265,0.000025485104,0.00011003682,0.0001099466,0.00011257549],"domain_scores_gemma":[0.9975926,0.0011680274,0.0002321479,0.00039943444,0.00023637874,0.00037129514],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037867978,0.00043326273,0.0008897404,0.00094006566,0.0012543441,0.0014221531,0.0012352067,0.0018040995,0.009854568],"category_scores_gemma":[0.005400257,0.0005583186,0.00051270804,0.0009265473,0.00070479314,0.0023834216,0.0025278665,0.0020737585,0.0016316848],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004349608,0.00020564598,0.0013082591,0.00040930638,0.000089451256,0.00073546957,0.0006270509,0.082504064,0.021638887,0.79438984,0.013026083,0.084631026],"study_design_scores_gemma":[0.0000686058,0.00011946752,0.00083894335,0.00007058661,0.000047659323,0.000790766,0.0002870798,0.2327512,0.0043576886,0.74752825,0.013111785,0.000027855724],"about_ca_topic_score_codex":0.00048081393,"about_ca_topic_score_gemma":0.000787254,"teacher_disagreement_score":0.009854568,"about_ca_system_score_codex":0.00043755377,"about_ca_system_score_gemma":0.0004435236,"threshold_uncertainty_score":0.032966793},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21244161,0.00043387446,0.7773469,0.00034225167,0.0000482928,0.0001255901,0.00036989557,0.00026387692,0.008627653],"genre_scores_gemma":[0.7716756,0.00057405775,0.2197272,0.000040194594,0.000071068855,0.00014788633,0.0006813413,0.0001884818,0.006894148],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99939287,0.00015567751,0.000035986817,0.00016772005,0.00018637472,0.000061406136],"domain_scores_gemma":[0.9976144,0.0014981984,0.00034404153,0.00016208466,0.00022602572,0.00015525709],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010118209,0.00089263514,0.0012080278,0.0015856586,0.00078145874,0.001407941,0.0015540482,0.0017852179,0.0027492715],"category_scores_gemma":[0.008683411,0.0007710856,0.0006784768,0.0013341734,0.0015641944,0.0027596056,0.001694885,0.00096677773,0.00039982225],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031664368,0.00004226274,0.0014865488,0.0001783662,0.00003557597,0.00037032214,0.00023870199,0.8196107,0.005991003,0.1431524,0.0012178393,0.027359618],"study_design_scores_gemma":[0.000018406266,0.00006544715,0.00029637277,0.000016520275,0.0000076143397,0.00010835579,0.000045181692,0.95451194,0.0013945632,0.041692514,0.0018222292,0.00002085584],"about_ca_topic_score_codex":0.0041987835,"about_ca_topic_score_gemma":0.0021299578,"teacher_disagreement_score":0.0041987835,"about_ca_system_score_codex":0.0012803779,"about_ca_system_score_gemma":0.0008163828,"threshold_uncertainty_score":0.009289861},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015306092,0.0002713953,0.98100257,0.00012446447,0.000038051978,0.0000934126,0.00044001907,0.0016245607,0.0010993446],"genre_scores_gemma":[0.11356408,0.0005381869,0.8798726,0.00010856565,0.00006842508,0.00025517782,0.0028399855,0.00082906,0.0019239206],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9972289,0.00031215168,0.00023339206,0.0006360611,0.0012847955,0.00030467362],"domain_scores_gemma":[0.9941924,0.0014452374,0.00023736748,0.0031523027,0.00085054757,0.00012203423],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013826848,0.0014385292,0.0023472302,0.0019367482,0.0013073462,0.0025055504,0.0041777543,0.001505557,0.007720089],"category_scores_gemma":[0.010988057,0.0015967725,0.002219188,0.003987448,0.0016033525,0.004112036,0.006138057,0.0021165854,0.0044714184],"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.0010812187,0.0001308908,0.002353168,0.0010744919,0.0001486376,0.0011633296,0.0014119062,0.40335035,0.043599967,0.026388166,0.010915525,0.5083823],"study_design_scores_gemma":[0.000085645115,0.00018763322,0.0011864995,0.00014636558,0.00007581747,0.0006187449,0.00038065476,0.893725,0.02493931,0.054270197,0.024282472,0.00010181429],"about_ca_topic_score_codex":0.0064203446,"about_ca_topic_score_gemma":0.00791905,"teacher_disagreement_score":0.007720089,"about_ca_system_score_codex":0.0009826303,"about_ca_system_score_gemma":0.0015288556,"threshold_uncertainty_score":0.025826275},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.060058,0.0011785583,0.8949897,0.0021582232,0.00027070998,0.0004429677,0.0014398668,0.0049179266,0.034543954],"genre_scores_gemma":[0.4247536,0.0007216844,0.5585728,0.0012754072,0.00037790288,0.0005425323,0.0032786105,0.0012817507,0.009195687],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9913782,0.0015575383,0.0005035632,0.0031586841,0.0018893508,0.0015126682],"domain_scores_gemma":[0.98642284,0.006619507,0.0009643292,0.0047522383,0.00067438494,0.00056664535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032709267,0.002018034,0.0023338445,0.0014103793,0.0014441464,0.0049062134,0.0054110917,0.00373569,0.013142454],"category_scores_gemma":[0.019389134,0.0011527346,0.0030718616,0.003412998,0.0026430215,0.00909177,0.00540287,0.005660413,0.0029370147],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008537237,0.0006438814,0.00322262,0.0006968713,0.00029938095,0.000115248185,0.00032320767,0.4632897,0.0064733084,0.31696075,0.023501126,0.18362007],"study_design_scores_gemma":[0.0002320955,0.0001754214,0.0005363269,0.000042171538,0.00009763215,0.0001609194,0.00007201725,0.6619575,0.0040767486,0.32115495,0.011461795,0.000032408258],"about_ca_topic_score_codex":0.0017960243,"about_ca_topic_score_gemma":0.0028064344,"teacher_disagreement_score":0.013142454,"about_ca_system_score_codex":0.004904384,"about_ca_system_score_gemma":0.0036489556,"threshold_uncertainty_score":0.043965936},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4649715,0.0006730628,0.50706226,0.00033243658,0.00012713668,0.00033719995,0.00084449287,0.0015854567,0.02406643],"genre_scores_gemma":[0.69576085,0.00048038494,0.28779554,0.00014244246,0.00003666286,0.00016281113,0.001947408,0.00079300645,0.0128809465],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994543,0.000045128865,0.000035967,0.00017020867,0.0001398233,0.00015453534],"domain_scores_gemma":[0.99918216,0.00016126278,0.00008415986,0.00021188054,0.00017656946,0.00018394532],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003127273,0.000727193,0.0011325005,0.0015882137,0.0016007258,0.0015910418,0.0009881548,0.00084894744,0.009936512],"category_scores_gemma":[0.0025974938,0.0007416328,0.0007632854,0.0011390976,0.001047389,0.0028876392,0.003189756,0.0010352269,0.001439243],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006792479,0.0002780805,0.011608956,0.001090786,0.00017138351,0.0013726597,0.0015926457,0.06756977,0.09867298,0.24712731,0.012074246,0.557762],"study_design_scores_gemma":[0.00012767386,0.00085052254,0.008000629,0.00046896015,0.0002802434,0.0016831195,0.0035223134,0.29193678,0.08062371,0.5355492,0.07670558,0.0002511796],"about_ca_topic_score_codex":0.0032187062,"about_ca_topic_score_gemma":0.0043464163,"teacher_disagreement_score":0.009936512,"about_ca_system_score_codex":0.000629433,"about_ca_system_score_gemma":0.001248154,"threshold_uncertainty_score":0.033240914},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018024798,0.0006772968,0.9715835,0.001610275,0.00010865247,0.000040327483,0.00007582851,0.00011711923,0.0077622333],"genre_scores_gemma":[0.6212941,0.0017241567,0.3691458,0.0002699231,0.00057920656,0.00021807484,0.00026932784,0.00015998057,0.0063395347],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985941,0.0006380155,0.000055240336,0.00025469682,0.00032791722,0.00013002078],"domain_scores_gemma":[0.9967822,0.0023049728,0.00021338239,0.00030653106,0.0002637636,0.00012909113],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012444064,0.00086766755,0.001067166,0.0011140036,0.0011246514,0.0015979557,0.00165801,0.001501406,0.003037373],"category_scores_gemma":[0.0064476253,0.0005405729,0.0008737331,0.0015337821,0.002712634,0.0033610607,0.0035575274,0.00253905,0.00041849635],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000575513,0.00002754695,0.00040042735,0.00013239798,0.000038846167,0.00011780719,0.00013732658,0.48435736,0.0010665904,0.48560175,0.0028345243,0.025227893],"study_design_scores_gemma":[0.000016128392,0.000024898089,0.00011045579,0.000013872497,0.0000069125845,0.00005929788,0.00005389452,0.6386805,0.0008334341,0.35517374,0.0050155846,0.000011223464],"about_ca_topic_score_codex":0.0023687931,"about_ca_topic_score_gemma":0.0014630466,"teacher_disagreement_score":0.003037373,"about_ca_system_score_codex":0.0020374826,"about_ca_system_score_gemma":0.0009979659,"threshold_uncertainty_score":0.014783025},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00278419,0.00007024684,0.99285346,0.00008030279,0.000040881332,0.000044432963,0.00007166779,0.0011031262,0.0029515487],"genre_scores_gemma":[0.07303513,0.00027632157,0.9196541,0.00012416719,0.000038246606,0.00022428049,0.0005504156,0.0005946459,0.0055026263],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989938,0.00022265353,0.00006783099,0.00018067267,0.00043560323,0.00009939608],"domain_scores_gemma":[0.9982339,0.00057640125,0.00011990131,0.00049627945,0.0004619181,0.00011148194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000906517,0.0010170203,0.0011916041,0.002110248,0.00085410103,0.0021925974,0.0022774118,0.0011997792,0.015901333],"category_scores_gemma":[0.005037263,0.00075856125,0.001203623,0.0031243481,0.00087531505,0.0022866684,0.0035832808,0.0020714288,0.0036605857],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016048632,0.00015649083,0.00070304755,0.00020421077,0.00006450176,0.00006261982,0.00015375201,0.093144625,0.005009534,0.12779224,0.01316505,0.75938344],"study_design_scores_gemma":[0.000062227526,0.00004558837,0.00018047717,0.000027677755,0.000029264249,0.000097661534,0.00006404036,0.9039912,0.0056221103,0.07441945,0.015433528,0.000026890495],"about_ca_topic_score_codex":0.0026197485,"about_ca_topic_score_gemma":0.004839699,"teacher_disagreement_score":0.015901333,"about_ca_system_score_codex":0.00065100327,"about_ca_system_score_gemma":0.0011679884,"threshold_uncertainty_score":0.053195238},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43992132,0.002029286,0.5130404,0.00586944,0.00023281106,0.00038980483,0.0020398286,0.00094006193,0.035537004],"genre_scores_gemma":[0.6540948,0.0013491862,0.326753,0.0012428189,0.00048718016,0.0004950296,0.0034086073,0.00050830905,0.011661033],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99706227,0.0009386602,0.00013189603,0.00077327923,0.000472169,0.00062161643],"domain_scores_gemma":[0.9879672,0.0085972175,0.0011417706,0.001354909,0.00041834114,0.00052051706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025893766,0.0013684683,0.002818762,0.0010883646,0.0023255334,0.003726689,0.004861808,0.0032973113,0.009964477],"category_scores_gemma":[0.013462436,0.001021166,0.0015327485,0.0031288883,0.0030387496,0.01046464,0.0038343335,0.0032756918,0.0018575833],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0024720575,0.0007240423,0.004998785,0.0013145123,0.0002472839,0.00058395305,0.0009508289,0.39406082,0.0072180033,0.41146877,0.033755433,0.14220561],"study_design_scores_gemma":[0.0002489159,0.00025814676,0.0013015968,0.00009557691,0.00009567896,0.00067297474,0.0005370303,0.51568687,0.0037534065,0.46849045,0.00877478,0.000084587744],"about_ca_topic_score_codex":0.0033829985,"about_ca_topic_score_gemma":0.0020042076,"teacher_disagreement_score":0.009964477,"about_ca_system_score_codex":0.0024688859,"about_ca_system_score_gemma":0.0012862687,"threshold_uncertainty_score":0.033334434},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.175022,0.0011996044,0.7200281,0.010695517,0.0009689428,0.0003855056,0.0025022463,0.0017918504,0.08740626],"genre_scores_gemma":[0.7503501,0.0016455533,0.22247916,0.0013000363,0.00050266983,0.00027528265,0.002619547,0.0008166887,0.02001096],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980021,0.00038219467,0.00011434294,0.000645364,0.00046362894,0.000392373],"domain_scores_gemma":[0.9958247,0.0015206864,0.0004094867,0.0013212608,0.0005774748,0.0003463959],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090863905,0.0005201644,0.0008326212,0.000992398,0.0010634961,0.0031835244,0.0008687737,0.0019974282,0.012044612],"category_scores_gemma":[0.010285126,0.0005198682,0.0007700928,0.0011245077,0.0028518494,0.009986276,0.0014604415,0.0018932563,0.0030244098],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002758536,0.00016764582,0.0024456577,0.0003695519,0.000063509804,0.0004398774,0.00095302507,0.018686937,0.0041039716,0.7910032,0.024113916,0.15737687],"study_design_scores_gemma":[0.000026478392,0.00005773812,0.0006760833,0.00008688988,0.000019453797,0.00033023706,0.00082041253,0.03219436,0.0023485834,0.92203003,0.041371953,0.000037901784],"about_ca_topic_score_codex":0.0022523252,"about_ca_topic_score_gemma":0.0021866716,"teacher_disagreement_score":0.012044612,"about_ca_system_score_codex":0.0009631536,"about_ca_system_score_gemma":0.00063595024,"threshold_uncertainty_score":0.040293217},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011335206,0.000055669567,0.9846542,0.00008600328,0.00002358014,0.00010708326,0.00010680523,0.0015580826,0.002073309],"genre_scores_gemma":[0.075588666,0.000031366224,0.9215409,0.000045632234,0.000008605523,0.00010851219,0.00049673085,0.00033691138,0.0018426165],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99932814,0.00007333376,0.00003868687,0.00015357722,0.0003353408,0.00007090995],"domain_scores_gemma":[0.99938905,0.00017091766,0.000059849095,0.0001554609,0.00018151733,0.00004321446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005055491,0.00093267247,0.0009387057,0.0012214059,0.0007394739,0.0012310281,0.0019661973,0.0013264789,0.009604217],"category_scores_gemma":[0.0019350124,0.00067404984,0.0008160438,0.00090171694,0.00081961683,0.0013755615,0.0025388098,0.0009060554,0.0033820728],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025947025,0.00012028985,0.0012154402,0.00033461314,0.000042521315,0.00030063087,0.00046830022,0.12457854,0.05114142,0.032399785,0.011303867,0.7778351],"study_design_scores_gemma":[0.00010717188,0.0001490266,0.0006418446,0.000047881345,0.000020051704,0.00035260772,0.0002541249,0.9116143,0.025451528,0.044023715,0.017301846,0.000035866706],"about_ca_topic_score_codex":0.0013172891,"about_ca_topic_score_gemma":0.0023812435,"teacher_disagreement_score":0.009604217,"about_ca_system_score_codex":0.0007516372,"about_ca_system_score_gemma":0.00085805845,"threshold_uncertainty_score":0.032129288},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.089224786,0.00032105824,0.88595355,0.00026476587,0.00022525548,0.00010318476,0.00035106446,0.000482363,0.023073928],"genre_scores_gemma":[0.50182724,0.00058231706,0.46999764,0.00013984834,0.000088064,0.00016209067,0.0009312263,0.0006819211,0.025589714],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995509,0.00008010304,0.000028372719,0.00007496305,0.00020771699,0.000057955247],"domain_scores_gemma":[0.9994205,0.00019334971,0.000057199544,0.00015665182,0.00011424737,0.000058017467],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036220468,0.00087245647,0.0008123213,0.00070872286,0.000682916,0.0013914924,0.0014063529,0.0008044051,0.007092398],"category_scores_gemma":[0.0018505052,0.00067261624,0.0005365366,0.00062892423,0.0010913439,0.002076136,0.0026487994,0.0016364005,0.0013581022],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003043133,0.00013243087,0.0014421426,0.00034430507,0.000041367875,0.000928982,0.00051930785,0.2771722,0.021292793,0.44019932,0.010201572,0.24742126],"study_design_scores_gemma":[0.000035998448,0.00011081071,0.000711655,0.00007421975,0.00001938416,0.00055046956,0.00032037107,0.68977726,0.01534866,0.2724037,0.020617377,0.000030147468],"about_ca_topic_score_codex":0.0010135889,"about_ca_topic_score_gemma":0.0015151903,"teacher_disagreement_score":0.007092398,"about_ca_system_score_codex":0.00039714703,"about_ca_system_score_gemma":0.00041295655,"threshold_uncertainty_score":0.023726404},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30395377,0.0015933871,0.6059539,0.002891893,0.00031298577,0.00021841822,0.0015472812,0.0015496839,0.081978686],"genre_scores_gemma":[0.71476835,0.0013984643,0.25643143,0.0006168887,0.00028078325,0.00028091823,0.0020657657,0.0005029293,0.023654493],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99828845,0.0004326692,0.00012374598,0.00045341396,0.0003356091,0.0003660886],"domain_scores_gemma":[0.99538726,0.002193045,0.0005949992,0.0010484192,0.00028216068,0.00049412576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008412933,0.0006446845,0.00089796935,0.0010792151,0.0015594481,0.0028280641,0.0014530434,0.0010859024,0.012872081],"category_scores_gemma":[0.0048779673,0.000594733,0.0009284525,0.0020980122,0.0029176956,0.005455799,0.0021833116,0.0020761292,0.0012861865],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003187193,0.00010452373,0.0021610665,0.00023670803,0.00003110419,0.000223754,0.00035794204,0.07317972,0.0069441875,0.8438243,0.008776483,0.06384147],"study_design_scores_gemma":[0.00008564058,0.00011223946,0.0011897703,0.00005207319,0.000033439737,0.00044093942,0.00037457424,0.11030729,0.0053499597,0.8499651,0.032053344,0.000035593563],"about_ca_topic_score_codex":0.003103089,"about_ca_topic_score_gemma":0.0032469325,"teacher_disagreement_score":0.012872081,"about_ca_system_score_codex":0.0022210926,"about_ca_system_score_gemma":0.00091310946,"threshold_uncertainty_score":0.043061376},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044094082,0.0007132166,0.8583167,0.00023352698,0.00022933561,0.00013337245,0.0005774939,0.0021936418,0.09350868],"genre_scores_gemma":[0.30351287,0.0021533521,0.6306906,0.000105962084,0.000079972786,0.00019254473,0.001131564,0.0011639473,0.060969193],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99976367,0.000059041256,0.000015341331,0.00003403477,0.00009718914,0.00003076375],"domain_scores_gemma":[0.99955636,0.0001525527,0.000040057297,0.00014009078,0.00008012495,0.000030846382],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020279079,0.00076300104,0.00047119704,0.0008429066,0.00045157722,0.0012166597,0.001098976,0.0005321636,0.021098634],"category_scores_gemma":[0.0011540712,0.000606154,0.00038265562,0.0013509857,0.00064337556,0.0012263282,0.0009593597,0.0011037482,0.003867039],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001415758,0.00006914662,0.00034123735,0.00031858808,0.000016394106,0.00029706696,0.0004655063,0.09618615,0.017037058,0.60442793,0.02386523,0.25683403],"study_design_scores_gemma":[0.00009782132,0.000110781926,0.00065216207,0.0001108335,0.000027193732,0.000708787,0.0003459307,0.3348307,0.016519438,0.5043673,0.14215408,0.000074937496],"about_ca_topic_score_codex":0.001145443,"about_ca_topic_score_gemma":0.0021067637,"teacher_disagreement_score":0.021098634,"about_ca_system_score_codex":0.0003005559,"about_ca_system_score_gemma":0.00022823451,"threshold_uncertainty_score":0.07058197},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05517216,0.000061505954,0.9390229,0.00006411932,0.00003300507,0.000049966045,0.000069363974,0.0016976591,0.0038293463],"genre_scores_gemma":[0.6365059,0.00007309067,0.3609991,0.000052664967,0.000011702439,0.000059438447,0.00019822075,0.00041313778,0.0016867035],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99895704,0.00014610699,0.00004653074,0.000111207475,0.00062930427,0.00010985717],"domain_scores_gemma":[0.9982773,0.00070351193,0.00014923418,0.00052041915,0.00027999803,0.00006952309],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078358134,0.0005369057,0.00071952894,0.0005449581,0.0004229812,0.0010986751,0.0014204126,0.00073755713,0.0032076172],"category_scores_gemma":[0.0049762786,0.00035089976,0.00040302926,0.00038734742,0.0010559829,0.0010785337,0.0022785813,0.00085222395,0.0006216754],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003681811,0.00010853763,0.005236513,0.00025291,0.00004138817,0.00033836707,0.0005035079,0.69208324,0.057000786,0.083111204,0.0028321755,0.15812312],"study_design_scores_gemma":[0.00001559967,0.000046820864,0.00021333827,0.000008387053,0.000004072904,0.00007284849,0.000038713824,0.97992295,0.010763661,0.007109394,0.0017910356,0.000013281253],"about_ca_topic_score_codex":0.001352921,"about_ca_topic_score_gemma":0.0014070495,"teacher_disagreement_score":0.0032076172,"about_ca_system_score_codex":0.0005720458,"about_ca_system_score_gemma":0.00093710696,"threshold_uncertainty_score":0.010730565},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014091266,0.00013940877,0.99648654,0.00004830315,0.00002564664,0.000028068453,0.00003740032,0.00060826185,0.0012171707],"genre_scores_gemma":[0.0502493,0.0003328003,0.9456477,0.00004916521,0.00004025166,0.00013391001,0.00027292798,0.00019747179,0.0030765338],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992138,0.00013750003,0.000052328218,0.00014563423,0.00036263035,0.00008815574],"domain_scores_gemma":[0.99931085,0.00024738908,0.00003631153,0.00017157431,0.00019999454,0.000033895747],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065994915,0.0010812326,0.0008814809,0.0015064921,0.00075124943,0.001596631,0.0019037277,0.0014099913,0.006417625],"category_scores_gemma":[0.004276054,0.00045891813,0.0010557752,0.0021342216,0.00063540135,0.0022037504,0.002691343,0.0014679506,0.002283432],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015755618,0.00005790985,0.00047341626,0.00025231944,0.000045658373,0.00015474793,0.00020722291,0.27659303,0.0073668044,0.15709339,0.010219086,0.54737884],"study_design_scores_gemma":[0.000029324749,0.000043440057,0.00009848633,0.000026016785,0.000014453467,0.00020038492,0.000045872173,0.9047205,0.0034390518,0.068153866,0.023211088,0.000017592778],"about_ca_topic_score_codex":0.0028816578,"about_ca_topic_score_gemma":0.0023434344,"teacher_disagreement_score":0.006417625,"about_ca_system_score_codex":0.0008644122,"about_ca_system_score_gemma":0.0009515356,"threshold_uncertainty_score":0.021469116},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19423851,0.0034661952,0.6849896,0.008840214,0.0006569207,0.00014167806,0.0006166822,0.00050117075,0.10654899],"genre_scores_gemma":[0.7177956,0.0026037968,0.23542929,0.0014016777,0.0005584583,0.00012906684,0.0010500088,0.00036644505,0.04066575],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994742,0.0002149947,0.000017212347,0.000095130665,0.000102724705,0.00009576722],"domain_scores_gemma":[0.99886346,0.0007219209,0.00007501673,0.00010745733,0.00011008011,0.00012210803],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009262648,0.00054909464,0.00086731924,0.00062835205,0.0009480403,0.0011655283,0.0011144568,0.0013461515,0.007938178],"category_scores_gemma":[0.004230203,0.00033455182,0.00039957458,0.001012823,0.0009508849,0.0028470748,0.0018737315,0.001550263,0.0009623413],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00055468414,0.00014935614,0.00077234633,0.00035569866,0.00006704062,0.00025166804,0.00034112256,0.1603208,0.0034130581,0.6423362,0.04353296,0.14790504],"study_design_scores_gemma":[0.00007048735,0.000058322716,0.000347078,0.000047632173,0.000029512039,0.00017201001,0.00018198884,0.3585806,0.000943445,0.6291983,0.010356851,0.000013722016],"about_ca_topic_score_codex":0.0016666712,"about_ca_topic_score_gemma":0.0016796156,"teacher_disagreement_score":0.007938178,"about_ca_system_score_codex":0.00066229264,"about_ca_system_score_gemma":0.0005586447,"threshold_uncertainty_score":0.026555836},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008885384,0.00048124735,0.9814316,0.00016098138,0.000079097335,0.00007496595,0.00042767607,0.0007143004,0.0077448236],"genre_scores_gemma":[0.23013835,0.0013877314,0.7537526,0.0001375834,0.00024109222,0.0003967497,0.0024448016,0.00089608534,0.010604994],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99923575,0.00016497799,0.000054770193,0.0001460175,0.00034256457,0.000055925804],"domain_scores_gemma":[0.9988888,0.00032356457,0.00018425363,0.00024984853,0.00028967074,0.00006390363],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050532166,0.00064932526,0.00045137602,0.0024496452,0.0007833361,0.0017905972,0.0010370807,0.0009934953,0.01089934],"category_scores_gemma":[0.005098149,0.00054123695,0.0007221843,0.00187695,0.0014522485,0.0020443557,0.0018032221,0.0018895494,0.0036094256],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000064680324,0.00002415337,0.0009123838,0.00022767819,0.000020378438,0.00018266389,0.00047868644,0.045719456,0.005522078,0.7946081,0.008900503,0.1433393],"study_design_scores_gemma":[0.000040998795,0.00006054251,0.000512028,0.00010025733,0.000012178612,0.00038998493,0.00025016873,0.19792162,0.0030202495,0.7182557,0.07940812,0.000028132148],"about_ca_topic_score_codex":0.0010104659,"about_ca_topic_score_gemma":0.0014835756,"teacher_disagreement_score":0.01089934,"about_ca_system_score_codex":0.00065772666,"about_ca_system_score_gemma":0.00029703326,"threshold_uncertainty_score":0.03646189},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0070369807,0.00022557421,0.99021566,0.00039673492,0.000022379903,0.000058206322,0.00009675669,0.00054746337,0.0014002336],"genre_scores_gemma":[0.4106763,0.000627989,0.5841961,0.00024795544,0.0001317664,0.00048746346,0.00068416353,0.00030213333,0.002646137],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9831062,0.0058387145,0.001759968,0.0021023222,0.0063977973,0.000795115],"domain_scores_gemma":[0.97174895,0.013893822,0.0018348831,0.010292379,0.0017795663,0.00045038617],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01422171,0.001039012,0.0022242893,0.0027464267,0.0018107711,0.008028002,0.005024081,0.0035046758,0.0029091407],"category_scores_gemma":[0.043703396,0.0013098328,0.0025383485,0.0041513266,0.0044423165,0.012943054,0.010718863,0.0032709995,0.0007934682],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029795902,0.00009091853,0.0011365418,0.0002515064,0.00013158949,0.0004676955,0.0014275897,0.37555575,0.0036907615,0.46776763,0.001708716,0.14747342],"study_design_scores_gemma":[0.000029162256,0.00005469749,0.00016546836,0.000055015094,0.00003575015,0.0001435095,0.00015149922,0.6170926,0.005008902,0.37058246,0.0066326302,0.000048322276],"about_ca_topic_score_codex":0.002170052,"about_ca_topic_score_gemma":0.0012426262,"teacher_disagreement_score":0.01422171,"about_ca_system_score_codex":0.0024740123,"about_ca_system_score_gemma":0.002010384,"threshold_uncertainty_score":0.07521248},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28514275,0.0007128646,0.69152784,0.00057685626,0.00010797436,0.0002710843,0.0028266052,0.008261706,0.010572441],"genre_scores_gemma":[0.44961894,0.00024214938,0.5392552,0.00013413248,0.000079890786,0.0001460808,0.00646723,0.00091766217,0.0031386842],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.99866366,0.00019324788,0.00013699851,0.00036624962,0.00039113016,0.00024872724],"domain_scores_gemma":[0.997227,0.0015741177,0.00020743773,0.0005712394,0.00026173668,0.00015841633],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080414995,0.0013502918,0.0015591935,0.0015963536,0.0009885931,0.0022119756,0.0019782486,0.0016494634,0.008006228],"category_scores_gemma":[0.006333788,0.0010106156,0.0021195807,0.0019068886,0.0020312076,0.0052950666,0.0027416693,0.0016412962,0.0015785566],"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.001390157,0.00031793313,0.011404985,0.0009971915,0.00017806664,0.00085911236,0.0008271842,0.51457065,0.016234327,0.10493391,0.01401576,0.33427075],"study_design_scores_gemma":[0.00012205852,0.00020037677,0.00080281676,0.000048999467,0.000030050798,0.00018408294,0.0004190931,0.8467352,0.0067401337,0.1392852,0.0054000057,0.000031941596],"about_ca_topic_score_codex":0.003100108,"about_ca_topic_score_gemma":0.0054555372,"teacher_disagreement_score":0.008006228,"about_ca_system_score_codex":0.0009796768,"about_ca_system_score_gemma":0.0006737444,"threshold_uncertainty_score":0.026783466},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3894091,0.00043292413,0.5279174,0.0010769404,0.00035067656,0.0002353992,0.0018351845,0.0010371335,0.07770537],"genre_scores_gemma":[0.75706816,0.0004254487,0.20787871,0.0003899835,0.00011212956,0.00024576162,0.0035891675,0.0005952638,0.029695401],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994522,0.00006849619,0.000034889075,0.00015078657,0.00020414773,0.00008952581],"domain_scores_gemma":[0.99862385,0.00043816018,0.00014716115,0.00041299296,0.00024106052,0.00013684368],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002620284,0.0007537909,0.0011942015,0.0013762605,0.0018885271,0.0019501268,0.0012645351,0.0011940683,0.012331906],"category_scores_gemma":[0.0018247362,0.00078967476,0.0009438355,0.002235013,0.001533723,0.002611321,0.0024755758,0.0017252399,0.0022571834],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008515045,0.00032559753,0.011166127,0.00091087073,0.00023304339,0.0039829444,0.00085303705,0.10514549,0.042120848,0.59368944,0.02554949,0.21517158],"study_design_scores_gemma":[0.00010808399,0.00019365542,0.0050537894,0.00015328465,0.00012081075,0.0028651112,0.0017558049,0.15733625,0.030346384,0.75366914,0.04829067,0.00010699462],"about_ca_topic_score_codex":0.00059227145,"about_ca_topic_score_gemma":0.0008291352,"teacher_disagreement_score":0.012331906,"about_ca_system_score_codex":0.00044248815,"about_ca_system_score_gemma":0.00029284385,"threshold_uncertainty_score":0.04125434},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7332304,0.0002165977,0.22487879,0.00040585667,0.000098604825,0.00010136996,0.00042252027,0.00026192982,0.040383898],"genre_scores_gemma":[0.8818143,0.00028839355,0.10615853,0.00009966795,0.000043332835,0.00008384147,0.00077649654,0.00020173764,0.010533713],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992446,0.0001387672,0.000024397978,0.00015319911,0.00022767163,0.0002114176],"domain_scores_gemma":[0.9982912,0.0006745855,0.000212933,0.00035311305,0.00029824817,0.00016993296],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005214334,0.00044842798,0.00046451643,0.0010880642,0.001413373,0.0016401417,0.0012939718,0.00081518653,0.0074628685],"category_scores_gemma":[0.0031261218,0.0005191977,0.0005724383,0.0012672191,0.001785501,0.0020479087,0.001907928,0.0012509277,0.00076283346],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014873846,0.000174622,0.015801998,0.00030126818,0.00010439504,0.000987027,0.0021296851,0.12557714,0.10625392,0.64661133,0.0076188915,0.09295231],"study_design_scores_gemma":[0.00016289004,0.00038396617,0.010831855,0.00009568801,0.000077238394,0.0011398593,0.0015396556,0.3655807,0.0489927,0.544037,0.027047724,0.00011072356],"about_ca_topic_score_codex":0.006788086,"about_ca_topic_score_gemma":0.006521893,"teacher_disagreement_score":0.0074628685,"about_ca_system_score_codex":0.0013490424,"about_ca_system_score_gemma":0.00057282305,"threshold_uncertainty_score":0.024965763},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5453833,0.0010000619,0.32074788,0.0014883792,0.00019167503,0.00031732762,0.004456419,0.0019958012,0.12441918],"genre_scores_gemma":[0.9239025,0.00082853704,0.057636615,0.00027461813,0.00013642911,0.00025704663,0.0045576883,0.00038956842,0.0120169185],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989801,0.00016477607,0.000081015816,0.0002884385,0.00029603622,0.00018966601],"domain_scores_gemma":[0.99411654,0.0027386583,0.0011149847,0.0008690577,0.00064845674,0.00051225186],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004196601,0.0005161138,0.00055864605,0.0013497331,0.0016140714,0.0026761107,0.0011477339,0.0008369097,0.014659143],"category_scores_gemma":[0.005225043,0.0006083739,0.0006231857,0.0025216509,0.0015454891,0.0044316817,0.0011694217,0.0011305033,0.0018110271],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034966582,0.00024524055,0.010731438,0.0007592621,0.000092869566,0.0014232275,0.0014582351,0.025229605,0.02038414,0.79498625,0.022614462,0.12172559],"study_design_scores_gemma":[0.00010155686,0.00025674768,0.0067603486,0.00011959547,0.00013312517,0.004519844,0.0012599153,0.03743603,0.011539778,0.86519796,0.07260277,0.000072269024],"about_ca_topic_score_codex":0.0012331865,"about_ca_topic_score_gemma":0.0011465973,"teacher_disagreement_score":0.014659143,"about_ca_system_score_codex":0.00089301413,"about_ca_system_score_gemma":0.0005544461,"threshold_uncertainty_score":0.04903972},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051100463,0.0018691741,0.92948914,0.0009003273,0.00013804986,0.00023859767,0.0012681421,0.0010965434,0.013899526],"genre_scores_gemma":[0.17327559,0.0009537746,0.8128972,0.0003358129,0.000108793625,0.0003807649,0.002494982,0.0004193738,0.009133661],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997815,0.00079577055,0.00014791904,0.00045991782,0.0004910773,0.00029029968],"domain_scores_gemma":[0.9969079,0.0017957214,0.00033429425,0.0005633981,0.00023013711,0.00016849415],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016387634,0.0011254862,0.0017095325,0.0010674115,0.0011240467,0.0019626382,0.0021115728,0.0013799603,0.010844269],"category_scores_gemma":[0.006432194,0.000850652,0.001145748,0.0024700311,0.0011246015,0.0041601593,0.003674666,0.0017370088,0.0025474704],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011450405,0.00034083694,0.003878642,0.0017718142,0.00022562155,0.0008043262,0.00094537094,0.25498053,0.012419212,0.26802963,0.054452054,0.40100694],"study_design_scores_gemma":[0.00027175076,0.00021741033,0.0016053697,0.00015862587,0.00007292244,0.0011010473,0.0008102227,0.6134108,0.007158255,0.344516,0.030605225,0.00007245079],"about_ca_topic_score_codex":0.0025956293,"about_ca_topic_score_gemma":0.003579925,"teacher_disagreement_score":0.010844269,"about_ca_system_score_codex":0.00062302063,"about_ca_system_score_gemma":0.0008866789,"threshold_uncertainty_score":0.03627765},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08341926,0.0011409072,0.90818346,0.0004593423,0.000061044564,0.00023867365,0.0010927876,0.0030469836,0.0023574887],"genre_scores_gemma":[0.500203,0.0007585904,0.49102068,0.00022427397,0.00017432394,0.00027125585,0.004370825,0.00040297923,0.0025740936],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9921538,0.001673937,0.00077435834,0.0015252507,0.0031360434,0.0007365653],"domain_scores_gemma":[0.9868788,0.006663706,0.0011634567,0.0036412522,0.0013646208,0.00028816337],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035836876,0.0016437545,0.0040019597,0.0024681743,0.0013697937,0.0037965851,0.0039931694,0.0017742241,0.0021855785],"category_scores_gemma":[0.018327417,0.00088931154,0.0016276799,0.0063113044,0.0017824856,0.009553816,0.0061191376,0.0019559723,0.0010354926],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018904324,0.0005389896,0.0069942577,0.0010717759,0.00029286754,0.0009272467,0.002402832,0.37076354,0.032272797,0.09367819,0.013372248,0.47579488],"study_design_scores_gemma":[0.000094751806,0.00027114854,0.0013255761,0.00003523078,0.0000651846,0.00042837483,0.0009034705,0.89898586,0.014508721,0.078184254,0.0051457556,0.00005155272],"about_ca_topic_score_codex":0.003674715,"about_ca_topic_score_gemma":0.0033355735,"teacher_disagreement_score":0.0040019597,"about_ca_system_score_codex":0.0015707292,"about_ca_system_score_gemma":0.0017761007,"threshold_uncertainty_score":0.018952549},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9187351,0.0004640356,0.04936309,0.00027977658,0.000091510075,0.000026090045,0.00026076802,0.00048378337,0.030295782],"genre_scores_gemma":[0.99117416,0.00015802206,0.0067201117,0.000030627372,0.00003433631,0.000021589469,0.00014009702,0.00006339788,0.0016576261],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995732,0.00007330614,0.000021028834,0.00011642997,0.00013904642,0.000077016004],"domain_scores_gemma":[0.99742377,0.0013029379,0.0003700801,0.0002693393,0.0002243022,0.00040964468],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005695595,0.0002613632,0.0003764821,0.0026274358,0.0006763158,0.0015996516,0.0006147077,0.0006667446,0.004975688],"category_scores_gemma":[0.004711929,0.0002920943,0.0002858734,0.0009971894,0.0015452191,0.001936081,0.000703261,0.0007858262,0.00029332668],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026566104,0.00008013234,0.0045482726,0.00014955182,0.000024347168,0.00047234306,0.0004907255,0.048960492,0.013140413,0.90426904,0.0033057432,0.024293348],"study_design_scores_gemma":[0.000028083912,0.000077140765,0.0023926308,0.000048872313,0.00001897715,0.00047588296,0.00018667258,0.114213854,0.00537637,0.8737696,0.0033801214,0.00003175618],"about_ca_topic_score_codex":0.00046625594,"about_ca_topic_score_gemma":0.00042447817,"teacher_disagreement_score":0.004975688,"about_ca_system_score_codex":0.0009574513,"about_ca_system_score_gemma":0.00026965237,"threshold_uncertainty_score":0.016645312},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16720039,0.001042837,0.8092157,0.0005511867,0.00006022406,0.00011322637,0.0011048552,0.001508269,0.019203365],"genre_scores_gemma":[0.48375922,0.0015988164,0.5052072,0.00017625288,0.000078230245,0.00024257133,0.0020645026,0.00046162208,0.0064115524],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99880993,0.00028190474,0.00009079083,0.00020836228,0.00039988183,0.00020918576],"domain_scores_gemma":[0.99586666,0.002108008,0.0006081769,0.00080969045,0.00033612226,0.00027133134],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000572932,0.00072877057,0.0005148447,0.00085574493,0.0006034781,0.0022062631,0.0011996336,0.00075480697,0.006652819],"category_scores_gemma":[0.008705392,0.00086771103,0.00056997745,0.0016371531,0.0007401772,0.0044033537,0.0015750607,0.0012555603,0.0011572217],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00058579707,0.00013980824,0.0029987316,0.00054387597,0.00007104759,0.0006248749,0.00093500305,0.25625595,0.036869433,0.36161196,0.01490324,0.32446036],"study_design_scores_gemma":[0.000102725644,0.00020753148,0.0019430489,0.0001239551,0.00007870587,0.0011349885,0.00036183887,0.44510773,0.014728395,0.5086647,0.02749337,0.00005300475],"about_ca_topic_score_codex":0.0014362863,"about_ca_topic_score_gemma":0.0028054095,"teacher_disagreement_score":0.006652819,"about_ca_system_score_codex":0.00093711587,"about_ca_system_score_gemma":0.00046123352,"threshold_uncertainty_score":0.022255957},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5599381,0.01675416,0.19024058,0.0026946974,0.0005361824,0.000108018496,0.0009134079,0.0006200416,0.22819483],"genre_scores_gemma":[0.91304696,0.010466935,0.05057519,0.0005157256,0.0009007182,0.00013491369,0.00096095575,0.00057298224,0.022825612],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99927586,0.00021694286,0.00004035583,0.00016063047,0.00021741675,0.00008883014],"domain_scores_gemma":[0.9959031,0.0027606385,0.00046231638,0.00019638891,0.0003529254,0.00032465757],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014327604,0.0013959728,0.0012323997,0.0065877084,0.0011661318,0.0026573287,0.0019053265,0.0012373197,0.009790682],"category_scores_gemma":[0.010048004,0.0008953242,0.0007453507,0.004140296,0.002467977,0.004848257,0.0017265395,0.0022702387,0.0014509239],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012264294,0.000043791617,0.0011072911,0.00021593423,0.000033477434,0.000117274285,0.0004410548,0.010929769,0.0029839533,0.92822593,0.005559569,0.050219256],"study_design_scores_gemma":[0.000018619043,0.000046289857,0.001544729,0.00008622291,0.000044905137,0.00042444008,0.00028035723,0.033926554,0.0011786523,0.9560844,0.0063371253,0.000027757775],"about_ca_topic_score_codex":0.0014061875,"about_ca_topic_score_gemma":0.001094896,"teacher_disagreement_score":0.009790682,"about_ca_system_score_codex":0.0011723466,"about_ca_system_score_gemma":0.00025911722,"threshold_uncertainty_score":0.03275311},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.066044375,0.00049405784,0.9252598,0.00021643605,0.000055128876,0.00016311544,0.00024410285,0.0029687914,0.004554179],"genre_scores_gemma":[0.111320324,0.00022708243,0.8852081,0.000084696854,0.000025511108,0.00020152051,0.000822699,0.0003007935,0.0018093286],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99885535,0.00022723207,0.00010135984,0.00027307324,0.00031835894,0.00022456139],"domain_scores_gemma":[0.99806625,0.0009970663,0.0002499496,0.0003105501,0.00026518083,0.000110933404],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010004276,0.0010779775,0.0016622063,0.0012052653,0.000894807,0.0012273418,0.002023192,0.00088636164,0.004384174],"category_scores_gemma":[0.0044584847,0.00065162487,0.0008750695,0.0022220365,0.0009831444,0.0028399942,0.0032772073,0.00076827605,0.0016679609],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0027050423,0.00022724635,0.005566236,0.0010232506,0.0001360919,0.0009617263,0.0008981064,0.22071306,0.06336329,0.05784675,0.017850267,0.6287089],"study_design_scores_gemma":[0.00036255983,0.0004957875,0.001396429,0.00010790721,0.000076307,0.0006625214,0.0004988287,0.911469,0.031761017,0.03711155,0.0159563,0.00010184367],"about_ca_topic_score_codex":0.002537512,"about_ca_topic_score_gemma":0.0035375466,"teacher_disagreement_score":0.004384174,"about_ca_system_score_codex":0.0005232545,"about_ca_system_score_gemma":0.0012329074,"threshold_uncertainty_score":0.014666498},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044779878,0.0001670995,0.94919515,0.0000674531,0.000043775603,0.000041969506,0.00012033741,0.0002886857,0.0052957046],"genre_scores_gemma":[0.49234706,0.0005663212,0.49928778,0.00004638825,0.000036888756,0.000082038205,0.00045715625,0.0003104577,0.006865835],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99964166,0.00006867834,0.00001612495,0.000048892056,0.00019639227,0.000028270657],"domain_scores_gemma":[0.9988532,0.00058688695,0.00009718541,0.0002204953,0.00017657703,0.00006563802],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043103902,0.00053439784,0.0005475648,0.0010255822,0.00034909364,0.0012700362,0.0011682743,0.0006360272,0.0025715576],"category_scores_gemma":[0.0045204833,0.00046703345,0.00041569187,0.0009957659,0.00078247336,0.0011423271,0.0013264739,0.0013043717,0.0005626284],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002216178,0.0000769233,0.0008715143,0.00016931124,0.000025748686,0.0001401518,0.0003124671,0.6981041,0.0075038723,0.15936603,0.0020155173,0.13119274],"study_design_scores_gemma":[0.000010518601,0.000033126587,0.000098466604,0.000014661207,0.0000056954764,0.00006343202,0.00004547467,0.95979846,0.002262284,0.034140576,0.0035204806,0.0000068742174],"about_ca_topic_score_codex":0.0018371886,"about_ca_topic_score_gemma":0.002618671,"teacher_disagreement_score":0.0025715576,"about_ca_system_score_codex":0.00061241916,"about_ca_system_score_gemma":0.00046651464,"threshold_uncertainty_score":0.008602679},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0136221815,0.00010599246,0.98123646,0.00008804977,0.00005716747,0.000042494725,0.00012150126,0.0010902594,0.003635822],"genre_scores_gemma":[0.43789876,0.00028102976,0.5563587,0.00011463105,0.000030277493,0.00030542695,0.0005188004,0.00039271623,0.004099701],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997365,0.00008875944,0.000013813139,0.000022287928,0.0001233768,0.00001529579],"domain_scores_gemma":[0.99954104,0.0002472998,0.000026611611,0.000083523126,0.00008424887,0.000017290482],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004591831,0.000425362,0.00044223742,0.0006518911,0.00024304831,0.00080778066,0.0007591177,0.00087861484,0.003884259],"category_scores_gemma":[0.001247987,0.00031692206,0.0007017867,0.00048498082,0.00039186468,0.00054834125,0.0011457168,0.00054795307,0.00068776694],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000064226304,0.000026273345,0.00060679123,0.000079648096,0.000025801515,0.00016037776,0.00009291234,0.90425354,0.014260228,0.017672494,0.0018525986,0.06090519],"study_design_scores_gemma":[0.0000059042673,0.00000752315,0.00005043827,0.0000039628,0.0000018345017,0.000024723795,0.0000044893654,0.99379647,0.0017464845,0.0024488652,0.0019046336,0.000004692152],"about_ca_topic_score_codex":0.0011523596,"about_ca_topic_score_gemma":0.0010602095,"teacher_disagreement_score":0.003884259,"about_ca_system_score_codex":0.00039895705,"about_ca_system_score_gemma":0.00029691888,"threshold_uncertainty_score":0.012994111},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027092746,0.00021972977,0.96645856,0.00014258396,0.00004017173,0.00023269677,0.00015406536,0.0007910554,0.0048684394],"genre_scores_gemma":[0.0903866,0.0003313278,0.9059158,0.000043208493,0.00003718193,0.00021408724,0.0004965914,0.00020695107,0.0023682648],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99898404,0.00014353574,0.00004802369,0.00018017259,0.0005190309,0.00012525],"domain_scores_gemma":[0.99787724,0.0012407884,0.00026990694,0.00024332653,0.00028440455,0.000084343665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006413049,0.0015430864,0.001755175,0.0018781786,0.0012185182,0.001712652,0.0023105512,0.0014688825,0.0075370222],"category_scores_gemma":[0.004827064,0.00084747165,0.0010873434,0.0033056792,0.0016446711,0.0028905484,0.002930554,0.0012432708,0.0017670888],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006799155,0.00022785513,0.0025356382,0.0008735309,0.00010715449,0.00090686517,0.0006718945,0.39643836,0.024745688,0.031455085,0.007801159,0.5335568],"study_design_scores_gemma":[0.00012094534,0.00022761624,0.00089653075,0.00008095159,0.000047380086,0.0005792386,0.000367674,0.9431855,0.014326793,0.03280038,0.007308661,0.000058252004],"about_ca_topic_score_codex":0.0034141208,"about_ca_topic_score_gemma":0.0047451006,"teacher_disagreement_score":0.0075370222,"about_ca_system_score_codex":0.00077166926,"about_ca_system_score_gemma":0.0008644406,"threshold_uncertainty_score":0.025213897},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27348387,0.0005430999,0.57977307,0.00069840293,0.0010255045,0.00028137575,0.00056869333,0.0009343712,0.14269175],"genre_scores_gemma":[0.7292396,0.0006736838,0.20892695,0.00034526965,0.0002256573,0.00044707218,0.0015704092,0.0009014267,0.05766988],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986608,0.00033306185,0.000102303165,0.00021454475,0.00045255062,0.0002368558],"domain_scores_gemma":[0.9988042,0.0003489939,0.00014289153,0.0002871853,0.00024172453,0.00017508105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049331476,0.0007247125,0.0009478235,0.0018953057,0.0019132103,0.0025484154,0.0016501601,0.0010404538,0.014265],"category_scores_gemma":[0.0036726175,0.0007001991,0.00084224856,0.0017437547,0.00201238,0.0021165453,0.0034266638,0.0018523044,0.0031415364],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012299686,0.000039224717,0.00030322006,0.00004988264,0.000011904684,0.0001731511,0.00019565262,0.0056470935,0.0029786502,0.94880444,0.0037283562,0.037945267],"study_design_scores_gemma":[0.000053806412,0.00007948547,0.0004795622,0.000030887906,0.000020139285,0.0004029751,0.00032419479,0.028968085,0.0059700496,0.92546415,0.0381721,0.000034552526],"about_ca_topic_score_codex":0.0009914964,"about_ca_topic_score_gemma":0.0010952319,"teacher_disagreement_score":0.014265,"about_ca_system_score_codex":0.00077804003,"about_ca_system_score_gemma":0.00076779525,"threshold_uncertainty_score":0.047721207},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21878412,0.0047086594,0.23024684,0.0006330806,0.0018220909,0.00014150962,0.000755628,0.00083783607,0.5420702],"genre_scores_gemma":[0.8227758,0.005353643,0.07662381,0.00027330502,0.0008837,0.00015465594,0.0016703836,0.0011484163,0.091116294],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995566,0.000074351956,0.000020222647,0.00011146582,0.00017885145,0.00005844986],"domain_scores_gemma":[0.9993901,0.00019651033,0.00008853816,0.00005793377,0.00012207167,0.0001447453],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003179659,0.0008917604,0.0005578107,0.003466878,0.0008287699,0.002244088,0.00083981355,0.0006062467,0.01263083],"category_scores_gemma":[0.0017611309,0.00061801326,0.00041571425,0.0025733428,0.0012167924,0.0020241896,0.0012284354,0.0023492388,0.002324049],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051031224,0.000029729426,0.00035769356,0.00009965079,0.000009146097,0.000096043295,0.00027281113,0.0049360534,0.002879854,0.9249098,0.0063831727,0.059974983],"study_design_scores_gemma":[0.000015580474,0.000039812247,0.000676945,0.000060370643,0.0000121990615,0.00032122363,0.00023153072,0.011215739,0.0018380524,0.94533587,0.04023036,0.000022366386],"about_ca_topic_score_codex":0.0005728462,"about_ca_topic_score_gemma":0.0006310976,"teacher_disagreement_score":0.01263083,"about_ca_system_score_codex":0.0007030684,"about_ca_system_score_gemma":0.00024680354,"threshold_uncertainty_score":0.04225433},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28956258,0.007425088,0.56448114,0.0025461481,0.00096648437,0.0001458835,0.000651573,0.0005146626,0.13370645],"genre_scores_gemma":[0.72780615,0.0051478813,0.15532346,0.00083281705,0.0006523131,0.0002550152,0.0009819116,0.00085153314,0.108148955],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995726,0.000087410954,0.000025018186,0.00008933164,0.00016551449,0.000060090762],"domain_scores_gemma":[0.99829096,0.00073847244,0.0002433659,0.00017190224,0.0002464305,0.00030883707],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064562773,0.0006634984,0.0008107136,0.0034021358,0.0017588087,0.0024283067,0.0013213011,0.0018612974,0.014905677],"category_scores_gemma":[0.0043428703,0.00066557387,0.00070347247,0.0019822791,0.0021244385,0.0032770077,0.0027134058,0.002851158,0.0013363137],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013647012,0.0000075284497,0.000080541606,0.000024314279,0.0000042176157,0.000028446397,0.00007177879,0.0014885698,0.00027483783,0.9908716,0.00089351455,0.006240956],"study_design_scores_gemma":[0.0000060973102,0.000010617369,0.00009073238,0.000018519475,0.000003213222,0.00004284496,0.000046576566,0.0062483153,0.00015569468,0.9889087,0.0044639916,0.0000048015872],"about_ca_topic_score_codex":0.0011041068,"about_ca_topic_score_gemma":0.0014043173,"teacher_disagreement_score":0.014905677,"about_ca_system_score_codex":0.0009826359,"about_ca_system_score_gemma":0.0004312215,"threshold_uncertainty_score":0.04986453},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019457093,0.0112323025,0.86343265,0.014733743,0.0065450366,0.00019468665,0.0012754785,0.0009480378,0.082181044],"genre_scores_gemma":[0.33904243,0.022958579,0.5666546,0.008425834,0.018956408,0.0009714121,0.0026357602,0.0020288103,0.0383261],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9958835,0.0011271581,0.00027531435,0.0010363342,0.0012891873,0.00038843957],"domain_scores_gemma":[0.9720757,0.022381589,0.0006723232,0.002854296,0.0013220775,0.00069396483],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004413322,0.0021972468,0.0036365949,0.0036739574,0.0041924343,0.0047717225,0.006887211,0.0034618885,0.013054126],"category_scores_gemma":[0.026766513,0.0019529206,0.0037620508,0.010382125,0.004975485,0.01682337,0.007103477,0.015585367,0.0027498193],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004593009,0.00011948535,0.0006828816,0.00085372577,0.00012240403,0.00033931865,0.0005056692,0.030331856,0.0028124969,0.8273858,0.05602085,0.08036628],"study_design_scores_gemma":[0.000039305334,0.00005632029,0.0004410538,0.000102509606,0.00008228933,0.00016166893,0.00009676108,0.031627826,0.0014367632,0.9414773,0.024424471,0.000053801035],"about_ca_topic_score_codex":0.0033917024,"about_ca_topic_score_gemma":0.0038505099,"teacher_disagreement_score":0.013054126,"about_ca_system_score_codex":0.0027791536,"about_ca_system_score_gemma":0.0014616395,"threshold_uncertainty_score":0.043670416},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002459424,0.00018575296,0.9954501,0.0001313905,0.000087394736,0.000044147047,0.000054774475,0.0007238499,0.0008631739],"genre_scores_gemma":[0.057384305,0.00029049226,0.9368362,0.00012978887,0.00015447875,0.00024324951,0.00051417155,0.0004250902,0.004022192],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99654764,0.00060844305,0.0002811032,0.0007745289,0.0014135437,0.00037480675],"domain_scores_gemma":[0.9928572,0.003068266,0.0004426877,0.0018506049,0.0015325631,0.00024861546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030516784,0.0023512624,0.0029206073,0.0033017257,0.0016343155,0.003026124,0.0040148534,0.0028487812,0.009571615],"category_scores_gemma":[0.01922415,0.0015130701,0.002165011,0.0039955084,0.0020290462,0.0044510434,0.0062878546,0.0041679894,0.0040782],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00061838876,0.0002578912,0.0009837536,0.00020040256,0.00012031822,0.00012443622,0.0001746924,0.18640843,0.0059332433,0.056909993,0.014172308,0.73409617],"study_design_scores_gemma":[0.0000876064,0.000063101485,0.00025036195,0.000022505,0.000043441207,0.00012136619,0.000060861516,0.91380703,0.0043791384,0.07646231,0.0046734335,0.00002881655],"about_ca_topic_score_codex":0.0032300625,"about_ca_topic_score_gemma":0.003855424,"teacher_disagreement_score":0.009571615,"about_ca_system_score_codex":0.0013026772,"about_ca_system_score_gemma":0.0026016172,"threshold_uncertainty_score":0.03202021},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16872877,0.00097003736,0.8103549,0.00034116622,0.000097210206,0.00016860371,0.00080653216,0.0038335184,0.014699288],"genre_scores_gemma":[0.46887714,0.0009459436,0.51034147,0.00013789603,0.000071388284,0.00020689672,0.0014064985,0.0009675581,0.017045336],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994295,0.00011539356,0.000049198305,0.00014176632,0.00017563497,0.0000884349],"domain_scores_gemma":[0.998386,0.00044526134,0.0002523974,0.0005651205,0.00022220613,0.00012891002],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004332809,0.0005003046,0.00043108832,0.00072411605,0.00068861956,0.0016461256,0.0010203146,0.0004535522,0.0052834987],"category_scores_gemma":[0.002373649,0.0006550052,0.000614781,0.0012736911,0.001175532,0.0028527607,0.0011207995,0.0007207968,0.0010213587],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012479515,0.00020210048,0.004699069,0.0005028597,0.000088652705,0.00032204328,0.0016597428,0.17798106,0.056891438,0.3361533,0.013104251,0.40714753],"study_design_scores_gemma":[0.00020403796,0.0006143892,0.0057798102,0.00013300676,0.00013956481,0.00096160505,0.0008814747,0.4426692,0.04206534,0.4093064,0.09708644,0.00015871486],"about_ca_topic_score_codex":0.0037716546,"about_ca_topic_score_gemma":0.007016784,"teacher_disagreement_score":0.0052834987,"about_ca_system_score_codex":0.0010398657,"about_ca_system_score_gemma":0.0007787083,"threshold_uncertainty_score":0.017675102},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10141358,0.00029876933,0.88518304,0.00018004834,0.00012109277,0.00018704147,0.0006493635,0.00064753176,0.011319465],"genre_scores_gemma":[0.37091357,0.0003940438,0.62028563,0.00006239806,0.000032736945,0.00042716594,0.0010058793,0.00013668794,0.0067419256],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991099,0.00019951983,0.00008676128,0.00015468671,0.00032923633,0.00011989133],"domain_scores_gemma":[0.9990495,0.00036036313,0.00011470914,0.00023196891,0.0001611771,0.00008238357],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005297258,0.0008711424,0.0007916511,0.001090324,0.00064737635,0.0012218126,0.0011830386,0.0009772494,0.006294252],"category_scores_gemma":[0.0021482531,0.0005452956,0.00063284615,0.0015568081,0.00067463785,0.0012948427,0.0025859764,0.0007214995,0.001693621],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0033384927,0.00040679504,0.00901806,0.0010817598,0.00019855236,0.0017460242,0.0010958607,0.34955058,0.13121967,0.17024852,0.009570273,0.32252538],"study_design_scores_gemma":[0.00032261215,0.00063940353,0.0039419886,0.00021002324,0.00009144452,0.0016190158,0.00056762225,0.8030951,0.0705751,0.07371239,0.04513055,0.00009471032],"about_ca_topic_score_codex":0.00090480107,"about_ca_topic_score_gemma":0.0005648198,"teacher_disagreement_score":0.006294252,"about_ca_system_score_codex":0.00032763023,"about_ca_system_score_gemma":0.00043520035,"threshold_uncertainty_score":0.021056354},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15775073,0.00060603,0.82284653,0.00094524014,0.00010933156,0.00015717295,0.00039172333,0.00086494157,0.01632826],"genre_scores_gemma":[0.46544987,0.00078844314,0.51135164,0.0003671941,0.00019019662,0.00029253442,0.0015242199,0.00033409815,0.019701777],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99878854,0.00033906734,0.00005312255,0.00034461074,0.00030344233,0.00017124049],"domain_scores_gemma":[0.9983462,0.0006960887,0.00015002077,0.0005731885,0.00014171074,0.00009273078],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010258631,0.00080946274,0.0011094767,0.0007832611,0.0017433355,0.0015430871,0.002398047,0.0017795763,0.010852938],"category_scores_gemma":[0.0036464583,0.0006657496,0.0011435084,0.0018887897,0.0024008192,0.003731979,0.0025794033,0.0015759082,0.0017956218],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00063754554,0.00014631244,0.0017057057,0.00044154224,0.00008191994,0.00059416686,0.0006787178,0.23138338,0.008077221,0.49480563,0.01340824,0.24803965],"study_design_scores_gemma":[0.00013101588,0.0002126254,0.00090187753,0.00005557925,0.000049671336,0.0005459287,0.00027665898,0.3887432,0.0041953097,0.5812837,0.023556398,0.000048094647],"about_ca_topic_score_codex":0.0023114383,"about_ca_topic_score_gemma":0.0024635731,"teacher_disagreement_score":0.010852938,"about_ca_system_score_codex":0.000863092,"about_ca_system_score_gemma":0.000705086,"threshold_uncertainty_score":0.03630668},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03902961,0.00023740692,0.9532978,0.000652082,0.000086314845,0.00033828098,0.00042171756,0.0021335876,0.0038032432],"genre_scores_gemma":[0.24173608,0.0001005373,0.75440717,0.00016096226,0.00006911396,0.00041251653,0.0010147218,0.00028370737,0.0018152589],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99770373,0.00054914894,0.00011853176,0.0007938479,0.0004614023,0.00037337054],"domain_scores_gemma":[0.9951148,0.0026935146,0.00047006132,0.001144402,0.00029962408,0.00027751664],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012417862,0.00092343346,0.0015703375,0.0010235723,0.0013745321,0.0016224688,0.002921313,0.0018176594,0.005484508],"category_scores_gemma":[0.007591572,0.0009191266,0.0015125911,0.001445444,0.0017958345,0.0027962108,0.002947977,0.001718702,0.00095958466],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014493166,0.00068116776,0.0030840007,0.0008097121,0.00027332138,0.00044011677,0.0004782462,0.5326283,0.024330333,0.10549593,0.021824127,0.30850542],"study_design_scores_gemma":[0.00050312554,0.00016928528,0.0004129573,0.00003178059,0.000041939664,0.00016350257,0.00007592801,0.91835415,0.0047081127,0.071366936,0.004132743,0.00003955913],"about_ca_topic_score_codex":0.0036773994,"about_ca_topic_score_gemma":0.0046639005,"teacher_disagreement_score":0.005484508,"about_ca_system_score_codex":0.0015945944,"about_ca_system_score_gemma":0.003176967,"threshold_uncertainty_score":0.018347561},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002806034,0.00008411269,0.9954074,0.000026189207,0.00003239371,0.000048412257,0.00008914522,0.0009207948,0.0005855005],"genre_scores_gemma":[0.026515614,0.00006785875,0.971892,0.00001763759,0.000018456241,0.00007753068,0.00040306756,0.00018966358,0.0008182109],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99876356,0.00014388817,0.00009328801,0.00029182702,0.00059801486,0.00010938765],"domain_scores_gemma":[0.9988426,0.00035962783,0.000062341176,0.00028009593,0.0003871016,0.000068151385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008088605,0.0008117703,0.001784314,0.0022335185,0.00074844685,0.0015296924,0.0022708338,0.0010009262,0.006985834],"category_scores_gemma":[0.0030197562,0.0005779477,0.0012294299,0.0020247244,0.00058755395,0.0021953555,0.0020858343,0.0011870831,0.0022596247],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016952312,0.000110603636,0.0012832247,0.00042709327,0.00009687567,0.00027288336,0.0002759822,0.13956802,0.02253011,0.062268212,0.00806854,0.76492894],"study_design_scores_gemma":[0.00008772857,0.00007082768,0.0004746236,0.00002059189,0.000034538967,0.00031912132,0.00005083697,0.9299751,0.0114941215,0.034275983,0.023150187,0.000046404588],"about_ca_topic_score_codex":0.003757996,"about_ca_topic_score_gemma":0.003931163,"teacher_disagreement_score":0.006985834,"about_ca_system_score_codex":0.00095368613,"about_ca_system_score_gemma":0.0014286634,"threshold_uncertainty_score":0.023369968},"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":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012627643,0.9603621,0.0015453111,0.01955384,0.01361346,0.000006128642,0.00009097867,0.000016938853,0.0046849563],"genre_scores_gemma":[0.002471027,0.9628323,0.0011903951,0.010922243,0.016256776,0.000017151451,0.00015734037,0.00004099399,0.006111886],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99902916,0.00020690731,0.00011530214,0.00020692998,0.00038296732,0.00005867446],"domain_scores_gemma":[0.9952266,0.002394568,0.00021092304,0.00020972537,0.0016729386,0.00028519492],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028948782,0.00094429695,0.0015353382,0.0043835477,0.00086156704,0.0025096366,0.002277179,0.0026555299,0.0059721153],"category_scores_gemma":[0.007434725,0.00061898265,0.00054942706,0.0046048528,0.0036962652,0.0047952104,0.0014546487,0.006653812,0.0051989974],"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.00007102135,0.00003582506,0.00025960352,0.0046151667,0.000066446926,0.000119951386,0.00025907732,0.00075663824,0.00049573206,0.06883012,0.6814826,0.24300781],"study_design_scores_gemma":[0.0000034283478,0.00001232873,0.0001920431,0.00065802655,0.000012165182,0.00014570853,0.000035499987,0.000050687202,0.00016396001,0.005001777,0.9937115,0.000012861633],"about_ca_topic_score_codex":0.0057524852,"about_ca_topic_score_gemma":0.007868074,"teacher_disagreement_score":0.0059721153,"about_ca_system_score_codex":0.0029475456,"about_ca_system_score_gemma":0.002624979,"threshold_uncertainty_score":0.021385968},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3565937,0.0007244152,0.61244875,0.0013510098,0.00008978019,0.00016030575,0.00065039843,0.0011478415,0.026833814],"genre_scores_gemma":[0.69439447,0.00069815404,0.2904144,0.00023156834,0.0001169112,0.00029653157,0.0016549261,0.0005140207,0.0116790915],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99733377,0.0007508104,0.00018495119,0.00044525508,0.00071537954,0.0005697941],"domain_scores_gemma":[0.9914677,0.0049765953,0.0009840901,0.0016651141,0.00037824176,0.000528353],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013364422,0.00082401134,0.0012507436,0.0012805472,0.001714759,0.0040053194,0.0018009981,0.00145835,0.017083757],"category_scores_gemma":[0.009526147,0.0009182408,0.0012853801,0.0022101917,0.0023653868,0.0077624787,0.0043872558,0.0027006073,0.0027486766],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007092263,0.00020349557,0.0076251775,0.00047500018,0.00010110826,0.00055876013,0.0006844247,0.4288674,0.012914058,0.43920836,0.0117176445,0.096935324],"study_design_scores_gemma":[0.000050117877,0.00010843131,0.0013378253,0.000042004085,0.00003995666,0.00038253635,0.00026151826,0.48400158,0.0043423967,0.50284785,0.006550202,0.00003555632],"about_ca_topic_score_codex":0.0011424952,"about_ca_topic_score_gemma":0.0018548392,"teacher_disagreement_score":0.017083757,"about_ca_system_score_codex":0.001591551,"about_ca_system_score_gemma":0.0005452821,"threshold_uncertainty_score":0.0571509},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007000235,0.000057995752,0.9831028,0.00007383926,0.000053461015,0.000044534576,0.00007528858,0.0057513127,0.0038404828],"genre_scores_gemma":[0.19056094,0.00017396724,0.79658884,0.00015925067,0.000051996267,0.00023122117,0.0006952129,0.0037524696,0.0077861384],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99909174,0.00012370464,0.000083614985,0.00012323656,0.0005083924,0.0000692796],"domain_scores_gemma":[0.99921525,0.0002744216,0.0000475812,0.0002642751,0.0001613258,0.000037215184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008563685,0.0005956003,0.00061696244,0.00062679994,0.00056615565,0.0014959394,0.0015207957,0.0009155444,0.006599237],"category_scores_gemma":[0.0023460255,0.000588001,0.0010162658,0.000419919,0.0009977197,0.0017202097,0.0029280612,0.0010730783,0.002252699],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002676314,0.00010500556,0.0020293358,0.00039458132,0.000071701936,0.0005187363,0.0008615658,0.17359006,0.08642328,0.42717308,0.014816852,0.29374823],"study_design_scores_gemma":[0.00006762962,0.000087496526,0.000660392,0.000046275753,0.000028572265,0.00029465774,0.0000583234,0.7668369,0.04961178,0.07446341,0.10778885,0.000055772118],"about_ca_topic_score_codex":0.0008583066,"about_ca_topic_score_gemma":0.0012134087,"teacher_disagreement_score":0.006599237,"about_ca_system_score_codex":0.00045931863,"about_ca_system_score_gemma":0.00044333615,"threshold_uncertainty_score":0.022076666},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17273872,0.00044481494,0.76191074,0.0006173422,0.0002989019,0.000068416,0.00024134414,0.00060116145,0.06307868],"genre_scores_gemma":[0.82034326,0.0003862843,0.15567474,0.00014149542,0.000067591776,0.00006284985,0.00024107545,0.00042713856,0.022655549],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99962234,0.00008053197,0.000023026132,0.00007345868,0.00014212183,0.000058522648],"domain_scores_gemma":[0.9994134,0.00020192821,0.00008456596,0.00013677304,0.000103416525,0.000059950522],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003988713,0.0003494671,0.00042103935,0.0008252988,0.000512388,0.0013602024,0.0008370118,0.0007063025,0.005689294],"category_scores_gemma":[0.0025206483,0.00054333656,0.00035812054,0.0006283449,0.0011916704,0.0015289285,0.0020645524,0.00096492725,0.0008378964],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002503145,0.000052084317,0.002488958,0.00018032685,0.000027775388,0.0004519538,0.00034560636,0.24986036,0.01776066,0.6607545,0.004507333,0.06332012],"study_design_scores_gemma":[0.00005570207,0.00009015981,0.0015263575,0.000050167226,0.000028473365,0.0006307834,0.00027254908,0.67328405,0.008678039,0.29589653,0.019451527,0.000035637728],"about_ca_topic_score_codex":0.0008612014,"about_ca_topic_score_gemma":0.0006276563,"teacher_disagreement_score":0.005689294,"about_ca_system_score_codex":0.00043818986,"about_ca_system_score_gemma":0.0003013142,"threshold_uncertainty_score":0.019032598},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35860774,0.0023156572,0.60034096,0.0030755016,0.00026283273,0.00029076234,0.0007624439,0.0084546255,0.02588949],"genre_scores_gemma":[0.64260256,0.0006061044,0.34873322,0.0002644535,0.00010932266,0.00033132784,0.001155556,0.0012031962,0.0049942657],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99559045,0.0015831797,0.00038161362,0.0008168563,0.0010460861,0.0005818719],"domain_scores_gemma":[0.98428106,0.010716152,0.00082929316,0.002838037,0.00076034054,0.000575142],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003606614,0.0010311734,0.0012676917,0.0009339832,0.001156782,0.0020090817,0.00295754,0.0017889522,0.01213405],"category_scores_gemma":[0.018967312,0.0007877305,0.0013052305,0.0019373021,0.00168473,0.005888428,0.0030776863,0.0010336904,0.0026157459],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.007142662,0.0005781202,0.003877767,0.00087260455,0.0001624609,0.0004522801,0.0005953944,0.43384933,0.03753599,0.06523236,0.01739139,0.43230966],"study_design_scores_gemma":[0.0004515727,0.00063283404,0.0007400111,0.000059933896,0.00007185925,0.00028420857,0.00022298023,0.91693676,0.018648766,0.058864973,0.0030378497,0.000048217385],"about_ca_topic_score_codex":0.0011898568,"about_ca_topic_score_gemma":0.002946356,"teacher_disagreement_score":0.01213405,"about_ca_system_score_codex":0.0014433806,"about_ca_system_score_gemma":0.00191563,"threshold_uncertainty_score":0.040592432},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033290397,0.00009032037,0.96013695,0.00013345519,0.00008546599,0.00008139069,0.00008036492,0.001645104,0.004456547],"genre_scores_gemma":[0.3634905,0.00012648679,0.63142914,0.00008974689,0.00003683444,0.000143373,0.00041951754,0.000407106,0.0038573716],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99969316,0.00006301342,0.000011035057,0.000058458907,0.00014482564,0.000029567782],"domain_scores_gemma":[0.9996803,0.00011596381,0.000023704977,0.00010704402,0.000056720568,0.000016276585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030607436,0.0004493499,0.00056788913,0.0003096543,0.0002921506,0.0003370307,0.0011287396,0.00042173508,0.0031250059],"category_scores_gemma":[0.0006495642,0.00031442058,0.00036430673,0.00052278757,0.000390876,0.0005870073,0.00076616096,0.00052787224,0.0007151514],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030471262,0.00014283719,0.0016028688,0.00021087604,0.000050160463,0.00059275015,0.00018630511,0.6243775,0.10862886,0.024685469,0.0067464304,0.23247126],"study_design_scores_gemma":[0.000030424233,0.000037434475,0.00015720708,0.0000028469099,0.0000042939328,0.000078121324,0.00001581975,0.9796538,0.0131001035,0.0041104555,0.002803297,0.0000061120127],"about_ca_topic_score_codex":0.0013440978,"about_ca_topic_score_gemma":0.0016764539,"teacher_disagreement_score":0.0031250059,"about_ca_system_score_codex":0.0003313402,"about_ca_system_score_gemma":0.00044173314,"threshold_uncertainty_score":0.010454178},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.69619346,0.0006365158,0.22487815,0.0006878125,0.00020570656,0.00008877248,0.0006003866,0.00042671378,0.07628252],"genre_scores_gemma":[0.92472464,0.0005660309,0.05366942,0.00021685014,0.00006537584,0.00008083601,0.0010035443,0.00019371256,0.019479651],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994351,0.00007270294,0.000027330274,0.00008692073,0.00025460595,0.00012335373],"domain_scores_gemma":[0.9984908,0.0007676826,0.00025461803,0.0002240177,0.00013244982,0.00013034303],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003288663,0.00045444304,0.00067392905,0.0007064544,0.00095312024,0.0022402105,0.0005900743,0.000853854,0.006404346],"category_scores_gemma":[0.00298667,0.0006210527,0.00081107835,0.00061933405,0.0016839787,0.0020832561,0.0015457981,0.0017192569,0.0008775239],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038042624,0.00007182841,0.0023552517,0.00029661154,0.000054639168,0.00076913723,0.0005091119,0.08159347,0.01327701,0.8576592,0.0029945765,0.04003862],"study_design_scores_gemma":[0.00007287698,0.00012571209,0.0019378638,0.00007251495,0.00003388054,0.00076655846,0.00042860725,0.10325572,0.006009864,0.8680942,0.019170277,0.00003195026],"about_ca_topic_score_codex":0.0011780782,"about_ca_topic_score_gemma":0.0016714575,"teacher_disagreement_score":0.006404346,"about_ca_system_score_codex":0.00048422554,"about_ca_system_score_gemma":0.00036055467,"threshold_uncertainty_score":0.021424651},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9273204,0.00049922353,0.049785808,0.0005660583,0.00009200756,0.000033116186,0.00034886567,0.00008867745,0.02126586],"genre_scores_gemma":[0.985014,0.00038068983,0.009038009,0.00006854636,0.00010554703,0.00005205083,0.00035144834,0.000062846215,0.0049268287],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99923205,0.00018558797,0.000040190604,0.00019765366,0.00020332645,0.00014126358],"domain_scores_gemma":[0.9909587,0.005313861,0.0012591778,0.00045034397,0.00060927466,0.0014086704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001994685,0.0009367518,0.0010701857,0.005413918,0.0029215978,0.004414344,0.0019715868,0.0013033573,0.007750386],"category_scores_gemma":[0.00851846,0.0010221063,0.0010420876,0.0016306513,0.005322568,0.004001663,0.0030475599,0.0023967936,0.000376004],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003026329,0.000072850264,0.0077520986,0.00008875094,0.000063221625,0.00025379928,0.00081800227,0.015078496,0.0035892015,0.95961016,0.0014520186,0.010918718],"study_design_scores_gemma":[0.00008071106,0.00014525317,0.012261531,0.00014513866,0.00010215121,0.0009161366,0.0012762347,0.14524512,0.0029287993,0.8319605,0.0048187934,0.000119620534],"about_ca_topic_score_codex":0.0019677277,"about_ca_topic_score_gemma":0.0014426846,"teacher_disagreement_score":0.007750386,"about_ca_system_score_codex":0.0019488176,"about_ca_system_score_gemma":0.00050612236,"threshold_uncertainty_score":0.025927663},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.064572744,0.00059129746,0.9302417,0.00014572305,0.000033245105,0.00004655128,0.0004496441,0.00018905177,0.0037299853],"genre_scores_gemma":[0.6774125,0.0005623452,0.31782642,0.00006165957,0.000051713432,0.000172374,0.00094889646,0.00013855884,0.0028255344],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99735755,0.0008624641,0.00012673816,0.00037962612,0.0010578162,0.00021584067],"domain_scores_gemma":[0.99383485,0.0037845792,0.0007522738,0.0006523784,0.0006756919,0.00030023744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012131071,0.00033949513,0.0008573679,0.0012491441,0.000743112,0.0018040068,0.0015425179,0.0009565062,0.002803836],"category_scores_gemma":[0.013189975,0.00047194437,0.000521514,0.0013080698,0.0012817889,0.003331228,0.002400656,0.00092022197,0.000477298],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030677413,0.000030769676,0.003372749,0.00021259542,0.000037813432,0.00030802193,0.00040030692,0.32468057,0.0041071842,0.6198746,0.0020980795,0.044570606],"study_design_scores_gemma":[0.000058369173,0.000041461055,0.0007483976,0.00003833098,0.000013250978,0.00038190995,0.00014982262,0.60637593,0.002853305,0.37543368,0.013873563,0.000031996573],"about_ca_topic_score_codex":0.0023915898,"about_ca_topic_score_gemma":0.0020188862,"teacher_disagreement_score":0.002803836,"about_ca_system_score_codex":0.0010456014,"about_ca_system_score_gemma":0.00075946463,"threshold_uncertainty_score":0.0093797445},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08515508,0.0025296598,0.8459579,0.0005446769,0.0001934672,0.000110902496,0.0003198287,0.00041863986,0.064770006],"genre_scores_gemma":[0.46066645,0.00503128,0.47162414,0.0001924481,0.00018635695,0.00028482784,0.0007823363,0.000675578,0.06055669],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996177,0.00009428981,0.000019473155,0.000056249457,0.00017401016,0.0000383479],"domain_scores_gemma":[0.99906975,0.0005873678,0.0000667101,0.00007567467,0.00012382821,0.00007664692],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046094498,0.0006218525,0.00060875266,0.0012292151,0.00069182465,0.001195014,0.0011039107,0.00079789845,0.0070516686],"category_scores_gemma":[0.0030349179,0.00070670556,0.0005638459,0.0014764111,0.0015727452,0.002123465,0.001818433,0.0022516972,0.00084650645],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005068041,0.000020319092,0.00019497614,0.00014941215,0.0000068816357,0.00005769274,0.00018742662,0.024929244,0.0021067797,0.89727664,0.0032930258,0.07172692],"study_design_scores_gemma":[0.000018246848,0.000036510664,0.00017153504,0.000053412317,0.000008281483,0.0001416199,0.0000648236,0.09139896,0.0009600098,0.8921922,0.014943186,0.000011245525],"about_ca_topic_score_codex":0.001383381,"about_ca_topic_score_gemma":0.0015913668,"teacher_disagreement_score":0.0070516686,"about_ca_system_score_codex":0.0009137661,"about_ca_system_score_gemma":0.00044515348,"threshold_uncertainty_score":0.023590207},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016483242,0.00070855144,0.9694205,0.00031003763,0.00028513098,0.00020664543,0.0004471739,0.00324195,0.008896804],"genre_scores_gemma":[0.22855937,0.0008880427,0.7537587,0.00035038273,0.00028177304,0.0003229934,0.0022825154,0.0011591485,0.012397057],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989716,0.00008084025,0.000055462853,0.00012067156,0.0006913007,0.0000800948],"domain_scores_gemma":[0.9990206,0.00024018245,0.000058146656,0.00033378546,0.00030213958,0.00004521165],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005450025,0.0007156882,0.0007333607,0.0021950847,0.00085412874,0.0014740778,0.0015096513,0.00097044377,0.009758067],"category_scores_gemma":[0.0039051257,0.00042078376,0.00066063757,0.0021720477,0.00080075517,0.0024493493,0.0031097636,0.0014022186,0.002186317],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040572442,0.000113227004,0.00085768953,0.00029172192,0.00005357215,0.00051752484,0.00027649352,0.06243162,0.04333566,0.07708115,0.0287304,0.78590524],"study_design_scores_gemma":[0.00010106292,0.00016570327,0.00080467074,0.00008927979,0.000037728456,0.00089465006,0.00015328219,0.77837825,0.09279357,0.066388585,0.060130376,0.000062816296],"about_ca_topic_score_codex":0.0015456018,"about_ca_topic_score_gemma":0.0019116985,"teacher_disagreement_score":0.009758067,"about_ca_system_score_codex":0.00069233775,"about_ca_system_score_gemma":0.00062681874,"threshold_uncertainty_score":0.032643974},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01975313,0.0000893886,0.9725184,0.00010326834,0.00003800983,0.00005373901,0.0001875962,0.00023893382,0.0070175873],"genre_scores_gemma":[0.5180176,0.00047112958,0.4654809,0.0001519963,0.00007599477,0.0002066974,0.0012937451,0.00060977973,0.013692122],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99904794,0.0001807738,0.00005256655,0.00015364592,0.00045636584,0.000108773944],"domain_scores_gemma":[0.99850416,0.00045231095,0.00008546719,0.0004596795,0.0003814782,0.000116898584],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000570988,0.0006210243,0.0010464934,0.0010229796,0.0006721603,0.0021153823,0.002217726,0.000800413,0.007695425],"category_scores_gemma":[0.0036117516,0.00051550125,0.0009065303,0.0010036258,0.0011911149,0.001989241,0.003267328,0.0027656092,0.0016010168],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023354814,0.0001340736,0.0010912823,0.00028227115,0.000037195652,0.00013139765,0.00038226627,0.29460466,0.012612888,0.50085753,0.007951519,0.18168132],"study_design_scores_gemma":[0.000018771349,0.000052395015,0.00030603816,0.000034154356,0.000010277634,0.000099679666,0.00010253448,0.8028998,0.0044391905,0.18314481,0.00887503,0.000017243918],"about_ca_topic_score_codex":0.0019799995,"about_ca_topic_score_gemma":0.0032242844,"teacher_disagreement_score":0.007695425,"about_ca_system_score_codex":0.0007576492,"about_ca_system_score_gemma":0.00052980916,"threshold_uncertainty_score":0.025743783},"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":"empirical","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5555668,0.0005483387,0.2743194,0.0032169805,0.00091008365,0.0001792102,0.001205719,0.0006254362,0.16342796],"genre_scores_gemma":[0.8206826,0.00037176214,0.11211375,0.00050519424,0.0002625813,0.00015931601,0.0010855865,0.00042325622,0.064395905],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990902,0.00016439865,0.00004459327,0.00024801423,0.0003331167,0.00011977149],"domain_scores_gemma":[0.997517,0.00094244466,0.00032630985,0.0003562036,0.000482028,0.00037604518],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038167028,0.0006605142,0.00065153925,0.0022459966,0.0016081203,0.0027621384,0.0016540122,0.0020272774,0.020831887],"category_scores_gemma":[0.0046636723,0.0005721306,0.00047237196,0.0015805545,0.0019188895,0.0033035462,0.0025158382,0.0035192005,0.0029078603],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015543189,0.00006534501,0.00072336785,0.000081930986,0.00001815985,0.00025838782,0.0002794129,0.0030391237,0.004582535,0.959886,0.005603922,0.025306392],"study_design_scores_gemma":[0.00007302218,0.000051297768,0.0006595888,0.00005048422,0.00002175509,0.00038768238,0.00044693114,0.018554736,0.0040436015,0.953435,0.022243297,0.000032643],"about_ca_topic_score_codex":0.0004053635,"about_ca_topic_score_gemma":0.0005106834,"teacher_disagreement_score":0.020831887,"about_ca_system_score_codex":0.00084673514,"about_ca_system_score_gemma":0.00029943415,"threshold_uncertainty_score":0.06968957},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016400053,0.0003737787,0.2529199,0.0030987654,0.0021039906,0.0004319736,0.17984287,0.14507824,0.41451046],"genre_scores_gemma":[0.023368936,0.0013895446,0.16911875,0.0020465052,0.00076708966,0.0008658526,0.28400448,0.16775644,0.3506824],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99927837,0.000113757895,0.00008437459,0.000117789,0.00033396934,0.00007176721],"domain_scores_gemma":[0.997696,0.000553529,0.00009014496,0.000674779,0.00080073474,0.0001846977],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00085423654,0.0014674957,0.0009848155,0.0023228796,0.0010698533,0.0044974186,0.0028485805,0.0018319241,0.51017416],"category_scores_gemma":[0.0048798174,0.0011553201,0.0011098001,0.0036927373,0.00068382226,0.0046340222,0.0027960474,0.0023302021,0.441121],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006557321,0.000028622728,0.00014930093,0.00022673003,0.000009023683,0.00005629598,0.00008633503,0.0006158171,0.002207814,0.025379224,0.9283198,0.04285542],"study_design_scores_gemma":[0.00002797199,0.000011251547,0.0002782304,0.000057569723,0.0000052682212,0.00010216255,0.000051233757,0.00241553,0.004166936,0.013735077,0.9791205,0.000028174525],"about_ca_topic_score_codex":0.0070834644,"about_ca_topic_score_gemma":0.007876606,"teacher_disagreement_score":0.51017416,"about_ca_system_score_codex":0.0014122751,"about_ca_system_score_gemma":0.0014927399,"threshold_uncertainty_score":0.69867706},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5821401,0.00019830953,0.4073765,0.00022999283,0.000047923037,0.000059685786,0.000088641056,0.0018694925,0.007989371],"genre_scores_gemma":[0.960281,0.000039942217,0.03753343,0.000035038134,0.0000053258927,0.000044369426,0.000090935944,0.000036818892,0.0019330654],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996964,0.00005212119,0.000023462275,0.00010819874,0.000060293733,0.000059604077],"domain_scores_gemma":[0.99872655,0.0006725677,0.00017510683,0.00022006089,0.00012953699,0.000076093806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031719505,0.0002680713,0.0006566253,0.00028923724,0.0005816205,0.000678763,0.0009569101,0.0006645445,0.0029502457],"category_scores_gemma":[0.0017065111,0.0002616634,0.0004564947,0.00021455465,0.0010870456,0.0016242493,0.00093196,0.00054849545,0.0003887361],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013806481,0.00025061643,0.010347704,0.00023590658,0.000094404255,0.0010343022,0.0010081866,0.6949884,0.07494645,0.058072772,0.002378438,0.1552621],"study_design_scores_gemma":[0.000029120294,0.00014329795,0.00049565086,0.000011212354,0.000019266035,0.00009998277,0.0000825739,0.9748523,0.013689511,0.009301421,0.0012561823,0.000019442674],"about_ca_topic_score_codex":0.0019170465,"about_ca_topic_score_gemma":0.0017963065,"teacher_disagreement_score":0.0029502457,"about_ca_system_score_codex":0.00041089812,"about_ca_system_score_gemma":0.0005291359,"threshold_uncertainty_score":0.0098695755},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7296821,0.0005220957,0.25051844,0.001995711,0.00010764908,0.00026694027,0.0013983044,0.0008521052,0.01465663],"genre_scores_gemma":[0.6636463,0.0005406425,0.32551938,0.00019211149,0.00004850276,0.00023756314,0.0015510252,0.000429291,0.007835134],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990079,0.00033710353,0.00006654077,0.0002804037,0.00012958016,0.00017844055],"domain_scores_gemma":[0.9941883,0.0040100473,0.0006393381,0.00050793006,0.00023179915,0.0004224584],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094948127,0.0011377952,0.001325037,0.0006569135,0.0009250931,0.0016534729,0.0022173251,0.0019397422,0.0056756153],"category_scores_gemma":[0.008975587,0.00091986044,0.0007000717,0.0010899433,0.0012366729,0.003956781,0.001328073,0.0013327916,0.0006245884],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009904775,0.00032280936,0.004868803,0.00083149486,0.00013404514,0.0003122212,0.00036588756,0.8379162,0.02026598,0.027144263,0.007481445,0.09936634],"study_design_scores_gemma":[0.0001790829,0.0003383275,0.0019295703,0.00004258624,0.00010264279,0.000313842,0.00046622875,0.9302128,0.012225089,0.05016376,0.003990095,0.000035984718],"about_ca_topic_score_codex":0.0029727267,"about_ca_topic_score_gemma":0.004969882,"teacher_disagreement_score":0.0056756153,"about_ca_system_score_codex":0.001364627,"about_ca_system_score_gemma":0.0011817298,"threshold_uncertainty_score":0.018986821},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0613844,0.00016411924,0.93108517,0.00022554799,0.000024440813,0.00030562922,0.0006545399,0.0028659736,0.0032902653],"genre_scores_gemma":[0.09615434,0.000094480754,0.90120405,0.00003691394,0.000010852026,0.00016847963,0.0010938518,0.00031603358,0.00092099246],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985562,0.00024697863,0.00008964154,0.00042911046,0.00047601474,0.00020202149],"domain_scores_gemma":[0.99750024,0.0011516273,0.00042602172,0.00035998464,0.00041450045,0.000147592],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011941895,0.001086038,0.0013960905,0.0016252626,0.0011381416,0.001953125,0.002295284,0.0013842158,0.0060454495],"category_scores_gemma":[0.0060442206,0.00096423377,0.0010937012,0.0017118875,0.000779072,0.002059069,0.0018868381,0.001022626,0.00275539],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009938976,0.00057143543,0.010998427,0.0011088855,0.000104450366,0.00084881927,0.001813782,0.22711487,0.10883912,0.02856412,0.015519953,0.6035223],"study_design_scores_gemma":[0.00012916382,0.00030897214,0.002209075,0.0000739945,0.00003808972,0.0004525491,0.0012686123,0.9032255,0.06368373,0.017847154,0.010687419,0.000075793745],"about_ca_topic_score_codex":0.0021817954,"about_ca_topic_score_gemma":0.0037371987,"teacher_disagreement_score":0.0060454495,"about_ca_system_score_codex":0.00071156665,"about_ca_system_score_gemma":0.0016568461,"threshold_uncertainty_score":0.020224094},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032806806,0.00008259574,0.9760443,0.00027634559,0.00022772468,0.00015189017,0.00054478686,0.0064707077,0.012920912],"genre_scores_gemma":[0.037770424,0.00025821157,0.947442,0.00012744068,0.000043139175,0.00022126839,0.0012879932,0.0016931657,0.011156355],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996464,0.000076540055,0.00001786666,0.00005382796,0.00016995735,0.000035400182],"domain_scores_gemma":[0.99942505,0.00027787255,0.0000146123675,0.00009340457,0.00014271143,0.000046362296],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061759935,0.0016129783,0.0006114912,0.0011490214,0.0008704666,0.0010924434,0.0015515522,0.001424751,0.034964874],"category_scores_gemma":[0.0014849826,0.0005547511,0.0010985327,0.0009336855,0.00072583737,0.00093258405,0.0013305354,0.0012814142,0.0059672343],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048066257,0.00020146002,0.0007996639,0.0007339143,0.00010707943,0.0009939008,0.0007225439,0.29657257,0.06689917,0.11056801,0.12308697,0.39883405],"study_design_scores_gemma":[0.00013508218,0.00010639714,0.00038845226,0.00011712217,0.000041070405,0.0005440283,0.00007663338,0.7902967,0.019725949,0.03968044,0.14882085,0.00006729905],"about_ca_topic_score_codex":0.0028660165,"about_ca_topic_score_gemma":0.0034781033,"teacher_disagreement_score":0.034964874,"about_ca_system_score_codex":0.00063187425,"about_ca_system_score_gemma":0.0006300347,"threshold_uncertainty_score":0.11696923},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06547926,0.0018040043,0.92987204,0.0001680793,0.000049520146,0.0000675571,0.000037495694,0.0004723747,0.0020496598],"genre_scores_gemma":[0.42148805,0.0012706683,0.5757206,0.00006110205,0.000065480766,0.00009045338,0.00008791961,0.00014317516,0.001072511],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991824,0.00025226577,0.00006604651,0.00011756011,0.00030358107,0.00007819885],"domain_scores_gemma":[0.9972824,0.001422283,0.0004120148,0.00040765142,0.00038968283,0.00008596183],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011974067,0.00053816976,0.000566475,0.0013662083,0.00035550792,0.00072841096,0.00072447874,0.00060422375,0.001540686],"category_scores_gemma":[0.0033446564,0.0004940644,0.00043679093,0.00076305337,0.00040602192,0.0016907083,0.0012576112,0.0005050467,0.0004914138],"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.00038115532,0.00013475814,0.004310133,0.00042079066,0.000036813854,0.00020247987,0.0003391264,0.027751269,0.32944998,0.005023591,0.00095848116,0.6309914],"study_design_scores_gemma":[0.00022387302,0.002282166,0.031154104,0.00031430201,0.00025822804,0.0052747065,0.00050341466,0.35828993,0.53108734,0.011054646,0.059301205,0.00025618944],"about_ca_topic_score_codex":0.00036471555,"about_ca_topic_score_gemma":0.0005746424,"teacher_disagreement_score":0.001540686,"about_ca_system_score_codex":0.0002289245,"about_ca_system_score_gemma":0.0004294088,"threshold_uncertainty_score":0.0063325763},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06708032,0.0055523315,0.7362281,0.036609396,0.004364499,0.00032054575,0.0010501123,0.005800568,0.14299415],"genre_scores_gemma":[0.65994304,0.0048453263,0.29883763,0.0063173487,0.0012568486,0.0005135532,0.0010680518,0.002662614,0.02455553],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99432075,0.0013655327,0.00043355895,0.0012461237,0.0017628282,0.00087115495],"domain_scores_gemma":[0.97359854,0.01378267,0.00071484386,0.009346977,0.0018537573,0.0007032071],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008621362,0.0016923081,0.0021552274,0.0023051975,0.0045271167,0.0056168744,0.0041075214,0.004775635,0.013860429],"category_scores_gemma":[0.053153437,0.0020471907,0.003869382,0.0012771665,0.013941742,0.023686482,0.013556582,0.012668832,0.003682343],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000111696645,0.00004506832,0.00034895417,0.00016665559,0.000028512279,0.0002583463,0.0003745644,0.002648416,0.00067215867,0.96387035,0.010674271,0.020800974],"study_design_scores_gemma":[0.00004029492,0.000037211914,0.000078381716,0.000127631,0.000036412282,0.0002899669,0.00013304142,0.0036928987,0.0015549908,0.97599196,0.017979357,0.000037883805],"about_ca_topic_score_codex":0.0008412284,"about_ca_topic_score_gemma":0.00071097794,"teacher_disagreement_score":0.013860429,"about_ca_system_score_codex":0.0024911216,"about_ca_system_score_gemma":0.0016592464,"threshold_uncertainty_score":0.046367764},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1100194,0.006608908,0.632017,0.0045021907,0.0018935886,0.00019057612,0.0017025444,0.0039645014,0.23910137],"genre_scores_gemma":[0.5613182,0.0038789373,0.3870924,0.001480041,0.00083487097,0.0004599291,0.0023067668,0.0024212364,0.04020758],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970733,0.0006072437,0.00016611871,0.0006601441,0.0009774928,0.0005156713],"domain_scores_gemma":[0.9856614,0.0073478515,0.000895745,0.004293367,0.0010378929,0.0007638808],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015863238,0.002047101,0.0012354131,0.0017232635,0.0012447573,0.0041945586,0.0029706992,0.002337511,0.047675148],"category_scores_gemma":[0.014540744,0.0010065626,0.0013775011,0.0022483242,0.002023034,0.007978369,0.003322382,0.004642527,0.007440611],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010534326,0.00028493462,0.0026927176,0.0012284684,0.0001182259,0.0006492736,0.00046458063,0.08110344,0.029760543,0.56952,0.066551976,0.24657245],"study_design_scores_gemma":[0.00019155728,0.00041133858,0.003197265,0.00044375157,0.00023373862,0.0030225608,0.00027863393,0.2077183,0.06763316,0.5636278,0.15299526,0.00024663247],"about_ca_topic_score_codex":0.0006275277,"about_ca_topic_score_gemma":0.0008145226,"teacher_disagreement_score":0.047675148,"about_ca_system_score_codex":0.0013182856,"about_ca_system_score_gemma":0.00072573393,"threshold_uncertainty_score":0.15948933},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17448969,0.0010006386,0.80117196,0.0005075769,0.00008845341,0.00026131186,0.0007393866,0.00086164975,0.020879202],"genre_scores_gemma":[0.47113115,0.0012522076,0.5132196,0.00027742397,0.00010599234,0.00027033204,0.0022357057,0.00028864443,0.0112189995],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99955255,0.000053552,0.000031148556,0.00014323115,0.00012293848,0.00009656604],"domain_scores_gemma":[0.9991652,0.00029025562,0.00014846511,0.00024070014,0.00006312806,0.00009233718],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027294847,0.0008981554,0.0006979007,0.0005392303,0.00051100383,0.0013676697,0.00096497784,0.0005886924,0.0035517006],"category_scores_gemma":[0.001714321,0.0006161923,0.00083239947,0.0008970696,0.00075399276,0.0020342227,0.0020742964,0.0011962423,0.0009303156],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00059723883,0.00022397279,0.0034626853,0.00081553584,0.00006950741,0.0013761058,0.00065135496,0.48868454,0.1010113,0.16629082,0.011703421,0.22511359],"study_design_scores_gemma":[0.000090031004,0.00029638948,0.002293366,0.00012711491,0.000075312804,0.001653644,0.00045216756,0.7036247,0.03453035,0.20864359,0.04817586,0.000037517126],"about_ca_topic_score_codex":0.0012841081,"about_ca_topic_score_gemma":0.0017488928,"teacher_disagreement_score":0.0035517006,"about_ca_system_score_codex":0.00069654424,"about_ca_system_score_gemma":0.000508296,"threshold_uncertainty_score":0.01188159},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046337347,0.0138389,0.6774366,0.040542275,0.0025738324,0.000049411192,0.00031565837,0.00032311457,0.21858284],"genre_scores_gemma":[0.69226336,0.012846792,0.1553658,0.0067018303,0.005653705,0.00017190029,0.00055858947,0.00048194267,0.12595597],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99933356,0.00027243877,0.000025393856,0.00012599936,0.00018571962,0.000056822475],"domain_scores_gemma":[0.9990004,0.000512989,0.00009160733,0.00011333463,0.00017273064,0.000109097775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010077573,0.0005094398,0.00083137886,0.0010941885,0.0008585889,0.0022365213,0.0017247307,0.0025338274,0.012444748],"category_scores_gemma":[0.0041808086,0.00033667663,0.000578439,0.0010088149,0.0031924313,0.0057022264,0.0025441842,0.003225299,0.0014056286],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010635312,0.00000913489,0.00006493401,0.000040135525,0.000006315207,0.00004309512,0.000046662928,0.0021774971,0.00014583161,0.98502374,0.0049368837,0.0074951365],"study_design_scores_gemma":[0.000015553429,0.000009004647,0.00007101452,0.000020011814,0.0000036704391,0.00009959079,0.000076685916,0.016210482,0.00012890095,0.97035,0.01300813,0.000006926036],"about_ca_topic_score_codex":0.0009812266,"about_ca_topic_score_gemma":0.0007817523,"teacher_disagreement_score":0.012444748,"about_ca_system_score_codex":0.00072745397,"about_ca_system_score_gemma":0.0005847653,"threshold_uncertainty_score":0.04163176},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24828652,0.0034217685,0.5818844,0.005252507,0.0006700625,0.00008336712,0.0003857275,0.00042943936,0.15958616],"genre_scores_gemma":[0.8268614,0.003766907,0.14286229,0.00051379355,0.00048342423,0.00010258314,0.00040039286,0.00018222835,0.024827039],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996088,0.00010604258,0.000026432535,0.00007029416,0.00013244683,0.000056026132],"domain_scores_gemma":[0.9987413,0.00086872984,0.00009246312,0.00013717965,0.00006122072,0.00009904435],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006801384,0.00041757702,0.0004855322,0.00068183226,0.0011112763,0.0018086926,0.0010391764,0.0012989709,0.0072894674],"category_scores_gemma":[0.0037013066,0.00038144516,0.0008939518,0.0009871207,0.0024107,0.0031626248,0.002087119,0.002365334,0.00061333476],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023204233,0.0000125404595,0.00027506915,0.00006309616,0.0000062382333,0.00021706989,0.00018647393,0.016179552,0.0012741401,0.97162116,0.001383645,0.008757872],"study_design_scores_gemma":[0.00000775911,0.000025000394,0.00018248247,0.000026144602,0.0000070504007,0.00011374572,0.00013780216,0.028875088,0.0008105878,0.9618234,0.007976635,0.000014296689],"about_ca_topic_score_codex":0.0017218925,"about_ca_topic_score_gemma":0.0022699253,"teacher_disagreement_score":0.0072894674,"about_ca_system_score_codex":0.0006731681,"about_ca_system_score_gemma":0.00032428434,"threshold_uncertainty_score":0.02438569},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30245084,0.003176935,0.64673066,0.0019406433,0.00020633359,0.00035084368,0.0008441317,0.0008653675,0.043434273],"genre_scores_gemma":[0.7692604,0.005577692,0.20307079,0.00068934116,0.0007274217,0.0004627488,0.0027480216,0.00044938453,0.017014198],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99864274,0.00032951543,0.000078873556,0.0004331161,0.00031014744,0.00020562149],"domain_scores_gemma":[0.995943,0.0028105,0.00042618497,0.00038150107,0.00017300133,0.00026578488],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009194744,0.0014626579,0.001290254,0.0013641593,0.0010830732,0.0020320446,0.0016923653,0.0015634402,0.009855168],"category_scores_gemma":[0.0065260683,0.0006713802,0.0012727403,0.0023916468,0.0026513315,0.008280454,0.0037667034,0.0022589893,0.0016009894],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040375465,0.00025462385,0.0018145452,0.0008636534,0.000087651046,0.0009423123,0.0008132491,0.22664012,0.011358687,0.66578406,0.0062615667,0.08477572],"study_design_scores_gemma":[0.00004103981,0.00015125799,0.00045398023,0.000082746934,0.00002705665,0.00043993405,0.00025141155,0.14809555,0.003197001,0.8409942,0.006242613,0.000023229039],"about_ca_topic_score_codex":0.0007822672,"about_ca_topic_score_gemma":0.0007969114,"teacher_disagreement_score":0.009855168,"about_ca_system_score_codex":0.0010417983,"about_ca_system_score_gemma":0.0005176009,"threshold_uncertainty_score":0.03296888},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017265245,0.00054273434,0.96880305,0.00072184135,0.00021817282,0.00007792921,0.00016360784,0.00074821996,0.011459119],"genre_scores_gemma":[0.33692762,0.00049935357,0.6500163,0.0008193675,0.00028843922,0.00046734445,0.0004907317,0.000989841,0.009500987],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99172604,0.003094672,0.00040904732,0.0012249094,0.002875674,0.0006696816],"domain_scores_gemma":[0.97393,0.019645149,0.0011490049,0.0035607975,0.0011496911,0.0005653537],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007278307,0.002380196,0.0024685522,0.0019672606,0.001451274,0.00448824,0.0047669034,0.0025552756,0.010304735],"category_scores_gemma":[0.048084363,0.0027800566,0.002589235,0.0023373754,0.0037865709,0.009757062,0.011823562,0.008473829,0.0021648637],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048926927,0.00021045016,0.00071927387,0.0005108484,0.00014422182,0.00011977726,0.00030392458,0.26396137,0.0025748685,0.6406272,0.007489836,0.08284894],"study_design_scores_gemma":[0.00003275399,0.000050600003,0.00005996574,0.000063060106,0.00002468897,0.000038670998,0.0000293068,0.43041605,0.0013419149,0.5654716,0.002456302,0.0000150913],"about_ca_topic_score_codex":0.0008641824,"about_ca_topic_score_gemma":0.0012685976,"teacher_disagreement_score":0.010304735,"about_ca_system_score_codex":0.0017251676,"about_ca_system_score_gemma":0.0015315309,"threshold_uncertainty_score":0.038491845},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16437697,0.0015971218,0.6150063,0.0031887607,0.00048692932,0.00015613667,0.0016778,0.0008699847,0.21263997],"genre_scores_gemma":[0.78822625,0.0013815598,0.12848829,0.0012553156,0.00042059796,0.00029201954,0.0017249293,0.00045179253,0.07775928],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99905115,0.00016048671,0.000061905186,0.00023262194,0.00033720108,0.00015664051],"domain_scores_gemma":[0.99588037,0.002607543,0.00025721578,0.0005072935,0.00044594044,0.0003016918],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010721489,0.0005090359,0.00073181716,0.0018228239,0.0029194872,0.0034046345,0.0014517951,0.0012071208,0.019456219],"category_scores_gemma":[0.0062493086,0.00077389064,0.0012214925,0.0017896472,0.0031173606,0.00886408,0.005420479,0.0037186353,0.0022631472],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005416188,0.000016080381,0.00040535227,0.000062918756,0.000013690219,0.00007801988,0.0002780435,0.001123203,0.0005729794,0.9849828,0.0038024038,0.008610439],"study_design_scores_gemma":[0.000020082545,0.000022859083,0.00029712325,0.000025854833,0.000024476458,0.00019843571,0.00019682295,0.0037253352,0.0009863887,0.9824285,0.012059989,0.000014289415],"about_ca_topic_score_codex":0.0014286988,"about_ca_topic_score_gemma":0.0015110414,"teacher_disagreement_score":0.019456219,"about_ca_system_score_codex":0.0015732768,"about_ca_system_score_gemma":0.00077882624,"threshold_uncertainty_score":0.0650875},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0043628537,0.00058674754,0.9824623,0.0003921249,0.00007734833,0.00012342464,0.0009986663,0.009450639,0.0015459048],"genre_scores_gemma":[0.051171307,0.0004400236,0.93713707,0.00041533774,0.0000937136,0.0006595408,0.005708678,0.0013977481,0.0029765682],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99401844,0.0010111013,0.00094755634,0.0011248614,0.0023504305,0.0005476504],"domain_scores_gemma":[0.9895064,0.002632298,0.00083565305,0.0045984862,0.002035662,0.00039153727],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032584267,0.0017289692,0.0023669524,0.0040230667,0.0019362441,0.0046624397,0.008057919,0.0024752778,0.007909724],"category_scores_gemma":[0.015121692,0.0020301763,0.0018749473,0.007838644,0.0020664001,0.010575502,0.010263108,0.0043468704,0.0057558655],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020864594,0.0005646281,0.004167297,0.0010049116,0.00017944691,0.0003696539,0.0010624089,0.07666753,0.021475997,0.15481299,0.061936162,0.6756726],"study_design_scores_gemma":[0.00055204483,0.000449884,0.0007027129,0.00031475135,0.000106619744,0.00048163618,0.0004189908,0.7245357,0.039016273,0.1199252,0.11329537,0.00020079344],"about_ca_topic_score_codex":0.006018907,"about_ca_topic_score_gemma":0.007224028,"teacher_disagreement_score":0.008057919,"about_ca_system_score_codex":0.0026249615,"about_ca_system_score_gemma":0.0033199843,"threshold_uncertainty_score":0.026460648},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25803474,0.0010920943,0.71301645,0.0010739107,0.000114498696,0.0001765407,0.0012500772,0.00053273985,0.024708912],"genre_scores_gemma":[0.6257074,0.0009736258,0.35746273,0.00015792342,0.00012115316,0.00015666083,0.0034522968,0.00025491888,0.011713351],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991148,0.00022694778,0.00004831034,0.00020449536,0.00023199315,0.00017333165],"domain_scores_gemma":[0.99871266,0.00063043175,0.00019994804,0.00021579102,0.00010762836,0.00013356809],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064853457,0.0006254796,0.0009107626,0.00083083205,0.0008089407,0.0015109897,0.00092134316,0.0009517967,0.0048697274],"category_scores_gemma":[0.0028909498,0.0005459348,0.0010324711,0.0012347038,0.0012412168,0.003172763,0.002319998,0.0013354301,0.0008207483],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007067184,0.00027225018,0.0036341469,0.0004924988,0.00011903943,0.00057438976,0.00063047657,0.50475717,0.010786772,0.26575875,0.020920856,0.19134691],"study_design_scores_gemma":[0.0000936209,0.00016903495,0.0017166993,0.000081760074,0.000044315,0.0008035729,0.00061955815,0.70223564,0.0061375527,0.2668573,0.021201355,0.000039531194],"about_ca_topic_score_codex":0.0016242192,"about_ca_topic_score_gemma":0.0013576858,"teacher_disagreement_score":0.0048697274,"about_ca_system_score_codex":0.00061384094,"about_ca_system_score_gemma":0.00046780784,"threshold_uncertainty_score":0.016290843},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19084653,0.00066945306,0.7880248,0.00064611697,0.00010198204,0.00014702833,0.0005981889,0.0004354989,0.018530427],"genre_scores_gemma":[0.7598435,0.0013050907,0.22054987,0.00020782762,0.00015954311,0.00018740883,0.0017436825,0.00037810535,0.015624935],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990846,0.00018643081,0.00004643454,0.00012763965,0.0004380792,0.000116810144],"domain_scores_gemma":[0.99668187,0.0020819386,0.0003033095,0.00032187704,0.00038289913,0.00022797348],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066032604,0.001214502,0.0014482113,0.002934818,0.0010220016,0.001997782,0.002579752,0.002138145,0.005963615],"category_scores_gemma":[0.0073219747,0.0010862822,0.0009872608,0.0028139225,0.0018173687,0.002848678,0.004266257,0.0021250136,0.0013107868],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024247417,0.0001213887,0.0017867972,0.0003103548,0.000060666833,0.0005624973,0.0005558065,0.3294354,0.0071367957,0.58112174,0.004999283,0.07366673],"study_design_scores_gemma":[0.00002914523,0.0000421847,0.000379864,0.000049053502,0.000013374988,0.00018897324,0.00015432728,0.4695341,0.001464315,0.5251163,0.0030095247,0.000018791481],"about_ca_topic_score_codex":0.0020386328,"about_ca_topic_score_gemma":0.0018724317,"teacher_disagreement_score":0.005963615,"about_ca_system_score_codex":0.00074937294,"about_ca_system_score_gemma":0.00031792134,"threshold_uncertainty_score":0.01995033},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28620207,0.0006944153,0.7063865,0.001021972,0.00010719745,0.00013942529,0.00020009976,0.00046672238,0.0047816806],"genre_scores_gemma":[0.94999945,0.00025108134,0.047808524,0.00014011534,0.00019579726,0.00022356612,0.00024062835,0.000107974745,0.0010327784],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.990617,0.0066404515,0.00028221283,0.0009103433,0.0012220783,0.00032783626],"domain_scores_gemma":[0.71164435,0.26283222,0.011082299,0.0076189754,0.0042744935,0.0025477135],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.020057425,0.00065360963,0.0014148518,0.004540351,0.0010065895,0.0020749578,0.002524711,0.0016711815,0.0029237515],"category_scores_gemma":[0.19459344,0.000446343,0.0009867554,0.002566553,0.009868946,0.005023752,0.002752509,0.0021057262,0.000314218],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025897133,0.00006742283,0.0140683735,0.0001297833,0.00013473428,0.00054448657,0.0004543537,0.20244496,0.0011939403,0.75742674,0.0007607752,0.022515511],"study_design_scores_gemma":[0.0000566914,0.00019530862,0.0024547505,0.000036790403,0.000021444042,0.00029477646,0.00012028841,0.65695864,0.0018756139,0.33734918,0.0005753358,0.00006108466],"about_ca_topic_score_codex":0.0009762932,"about_ca_topic_score_gemma":0.00042222382,"teacher_disagreement_score":0.020057425,"about_ca_system_score_codex":0.0012364802,"about_ca_system_score_gemma":0.00070903834,"threshold_uncertainty_score":0.10607505},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06322144,0.0009847733,0.89424133,0.00043569822,0.00023807118,0.000113058195,0.0012624708,0.0016635088,0.037839632],"genre_scores_gemma":[0.4000078,0.0017629876,0.5410269,0.00021734557,0.00016291073,0.00029822526,0.0085536735,0.002839954,0.04513025],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99898595,0.0001498177,0.00009164515,0.00018604191,0.0005055897,0.000080975355],"domain_scores_gemma":[0.9983158,0.00081201893,0.0001419461,0.0002907541,0.00027685938,0.00016262999],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006331571,0.00083911006,0.0010248418,0.003381549,0.0013936808,0.0035783723,0.0015692194,0.0014189585,0.017394971],"category_scores_gemma":[0.004354269,0.0011608353,0.0011249348,0.0034732148,0.0017386755,0.0048493496,0.0049540275,0.0018754508,0.007260688],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003105537,0.000118398915,0.0010352418,0.00051247765,0.000047134075,0.00026952624,0.0009574472,0.054317266,0.007480488,0.6598245,0.011124119,0.26400283],"study_design_scores_gemma":[0.00007658101,0.00006880099,0.0007112005,0.00019868111,0.000045330577,0.00044161067,0.00041737792,0.13756444,0.009679334,0.77177614,0.07895891,0.00006152513],"about_ca_topic_score_codex":0.001835798,"about_ca_topic_score_gemma":0.0018547208,"teacher_disagreement_score":0.017394971,"about_ca_system_score_codex":0.00065219094,"about_ca_system_score_gemma":0.0006704454,"threshold_uncertainty_score":0.058191955},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033415284,0.0002819787,0.95990247,0.00013171861,0.00001834007,0.00007357924,0.0009016201,0.00051981927,0.004755173],"genre_scores_gemma":[0.47028664,0.00059859373,0.5221444,0.00003913172,0.000026833273,0.00015740574,0.002064846,0.0001542572,0.004527867],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995783,0.0000855287,0.000023655522,0.00006455226,0.00020530754,0.000042629632],"domain_scores_gemma":[0.99936384,0.00029814753,0.00008687078,0.00008846283,0.00010926087,0.00005351963],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020380088,0.00026661129,0.0005629366,0.00084019493,0.00033650288,0.0012397687,0.0008285294,0.0005162265,0.0046234513],"category_scores_gemma":[0.002403014,0.00029084162,0.0003220485,0.0012060262,0.0006482602,0.0013588986,0.0009794076,0.00067057094,0.0010595027],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022192669,0.000049785587,0.0013743717,0.0002371248,0.000018756451,0.0002785312,0.00038168838,0.41049206,0.010079931,0.4463037,0.005620047,0.12494212],"study_design_scores_gemma":[0.000074822274,0.000044432905,0.00045895067,0.00002757734,0.00000732594,0.00034194626,0.000110746376,0.7714427,0.0031919682,0.20322107,0.021052781,0.0000256301],"about_ca_topic_score_codex":0.0037108457,"about_ca_topic_score_gemma":0.004048175,"teacher_disagreement_score":0.0046234513,"about_ca_system_score_codex":0.00059031195,"about_ca_system_score_gemma":0.0005622387,"threshold_uncertainty_score":0.0154669285},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40294525,0.0004209053,0.581644,0.000168851,0.000056894984,0.00006056035,0.0004224479,0.00034577784,0.013935295],"genre_scores_gemma":[0.7974419,0.0005047811,0.18070439,0.00012838228,0.00010136831,0.00023926298,0.0015986379,0.00027579017,0.019005477],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992022,0.00013402793,0.00008813009,0.00021264552,0.00026507178,0.00009798588],"domain_scores_gemma":[0.9985719,0.0005328266,0.0002732385,0.00021453098,0.00019559084,0.00021192648],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006742763,0.00083244505,0.0006577489,0.0019667982,0.0007211473,0.0012413777,0.0010981063,0.00079952343,0.0075130477],"category_scores_gemma":[0.003843504,0.00039292662,0.00085348554,0.0016496292,0.0011597616,0.0034862857,0.0024896846,0.0011269925,0.0012032929],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013694083,0.000052477542,0.0015169993,0.00016368211,0.000050579856,0.00032980368,0.0006171695,0.052084137,0.013385852,0.88275975,0.0013475132,0.047555096],"study_design_scores_gemma":[0.000016640955,0.0001836607,0.0008752742,0.00004285842,0.000016847633,0.00040103248,0.00023959513,0.092721626,0.005647359,0.89237285,0.00745493,0.000027374563],"about_ca_topic_score_codex":0.0003594759,"about_ca_topic_score_gemma":0.0004230473,"teacher_disagreement_score":0.0075130477,"about_ca_system_score_codex":0.00056526973,"about_ca_system_score_gemma":0.00019050394,"threshold_uncertainty_score":0.02513367},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.073636815,0.0001513427,0.91111374,0.00010753996,0.0001086184,0.00017706196,0.00022706819,0.00058178755,0.013895944],"genre_scores_gemma":[0.575721,0.00024693628,0.41501445,0.0000771565,0.000031469255,0.00014815299,0.0007375499,0.00034175557,0.0076815044],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989999,0.00017589732,0.00007171903,0.00021796345,0.00042399764,0.00011060366],"domain_scores_gemma":[0.9989121,0.0002617999,0.00011673597,0.00034852553,0.00027452048,0.00008636687],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006992402,0.00047915426,0.0010764612,0.0015472134,0.0006243376,0.0016247118,0.0021491721,0.0012412322,0.00702973],"category_scores_gemma":[0.005432299,0.00052492024,0.0006128302,0.0019938604,0.00079791824,0.0017689234,0.002482776,0.001349496,0.0017600106],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008836275,0.00032548327,0.0026546775,0.00034705424,0.00007052865,0.0003811343,0.0004721157,0.12956896,0.03301217,0.28544226,0.0055608163,0.5412811],"study_design_scores_gemma":[0.000113643175,0.00025646354,0.0009950281,0.00007489375,0.000039553386,0.0003822294,0.00032980242,0.74180514,0.023378858,0.21767788,0.014901402,0.000045073575],"about_ca_topic_score_codex":0.0015557314,"about_ca_topic_score_gemma":0.0015107256,"teacher_disagreement_score":0.00702973,"about_ca_system_score_codex":0.0006915814,"about_ca_system_score_gemma":0.0005510324,"threshold_uncertainty_score":0.023516834},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49301437,0.0035174885,0.3653982,0.0035265977,0.00026828647,0.00015100616,0.0010317212,0.00057308015,0.13251929],"genre_scores_gemma":[0.9070565,0.0027608126,0.06632296,0.0005290273,0.0003318425,0.00019067162,0.0009453827,0.0003865487,0.02147628],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992518,0.00015110035,0.00005271323,0.00018104585,0.00026535356,0.00009791191],"domain_scores_gemma":[0.99313086,0.003789077,0.0010448471,0.000539677,0.0009202853,0.00057527574],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010715087,0.0007404608,0.0007838166,0.0031173325,0.0020797974,0.004007995,0.002014112,0.0014744399,0.008225775],"category_scores_gemma":[0.009079514,0.00096852944,0.0008796293,0.0029965504,0.0032803458,0.0059285876,0.00217294,0.0022479338,0.0010817224],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006845424,0.00003281596,0.0009923885,0.00011377427,0.000016901005,0.00015999988,0.00061025657,0.009592584,0.0015000247,0.96828806,0.0023197094,0.016305147],"study_design_scores_gemma":[0.000023855959,0.000038530347,0.00095207174,0.000039991734,0.00002394097,0.0004175704,0.00044320463,0.03512521,0.0013944617,0.9534517,0.008056236,0.000033259927],"about_ca_topic_score_codex":0.0032409069,"about_ca_topic_score_gemma":0.0029266665,"teacher_disagreement_score":0.008225775,"about_ca_system_score_codex":0.0015942923,"about_ca_system_score_gemma":0.00069813954,"threshold_uncertainty_score":0.027517915},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010063413,0.00054492167,0.9761044,0.00036572522,0.000102127575,0.000078346355,0.00015935594,0.0012568058,0.01132502],"genre_scores_gemma":[0.13223341,0.0006173406,0.85360914,0.00015435502,0.000102422426,0.000263477,0.00084944954,0.00048990134,0.011680505],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99911875,0.00014060327,0.00006254125,0.00017604546,0.000348698,0.00015337426],"domain_scores_gemma":[0.9989139,0.00050915283,0.000095378666,0.00022821268,0.00020201197,0.000051475356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007911259,0.00113818,0.0010231381,0.0015580753,0.0010517606,0.0016291707,0.0015996493,0.0011117662,0.013465057],"category_scores_gemma":[0.0033396801,0.00059890136,0.0008574492,0.002844719,0.0008340831,0.0027455792,0.0023588021,0.0014235631,0.0031928623],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002640624,0.00019421447,0.00080154784,0.000323019,0.000061416635,0.00011450471,0.00020665508,0.46626064,0.0032966703,0.18210322,0.018586725,0.32778728],"study_design_scores_gemma":[0.00008976613,0.00003091148,0.000090093316,0.000012374448,0.00001191003,0.000057783083,0.00004160344,0.88736844,0.0019303148,0.09905717,0.0112990765,0.000010569809],"about_ca_topic_score_codex":0.003852277,"about_ca_topic_score_gemma":0.00567617,"teacher_disagreement_score":0.013465057,"about_ca_system_score_codex":0.0011660252,"about_ca_system_score_gemma":0.0011906883,"threshold_uncertainty_score":0.045045078},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030105993,0.000096921045,0.9672633,0.00009520882,0.000023300016,0.00003105029,0.000036683137,0.00064863305,0.0016989269],"genre_scores_gemma":[0.54414225,0.00009569264,0.45357987,0.00006207522,0.000012846231,0.0000664462,0.00020557527,0.00022319987,0.0016120493],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998776,0.00039747186,0.000069886366,0.00009829781,0.00055567425,0.0001027021],"domain_scores_gemma":[0.9964818,0.0015619529,0.00027807016,0.000860308,0.00069649937,0.00012132911],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016421364,0.00035966292,0.0005558321,0.0004359903,0.0003511245,0.0007769887,0.0009395723,0.0008075409,0.002224264],"category_scores_gemma":[0.007130882,0.0003100442,0.0003970136,0.00038219133,0.00092637114,0.00075625407,0.0016518828,0.00062892336,0.0005174976],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040118923,0.00005552022,0.001892068,0.00022333185,0.000034121185,0.0004421374,0.0004371032,0.75680816,0.04675279,0.054308288,0.0042267577,0.13441846],"study_design_scores_gemma":[0.00002311639,0.000023378421,0.00013768674,0.000009346166,0.0000028600973,0.00006685264,0.000020176576,0.9818479,0.0071547315,0.008924369,0.0017813061,0.000008286872],"about_ca_topic_score_codex":0.0014572762,"about_ca_topic_score_gemma":0.0014269807,"teacher_disagreement_score":0.002224264,"about_ca_system_score_codex":0.00050578837,"about_ca_system_score_gemma":0.00048120916,"threshold_uncertainty_score":0.008684576},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08330027,0.00084056123,0.7743954,0.0026590156,0.0018928065,0.00011941589,0.0006315576,0.002293286,0.13386765],"genre_scores_gemma":[0.52019584,0.00082239526,0.36104155,0.0023123096,0.00045106062,0.0001269652,0.0011903057,0.002212284,0.11164729],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991316,0.00016400752,0.000042576743,0.00020894386,0.0003380392,0.00011489179],"domain_scores_gemma":[0.9978866,0.00045877762,0.00006560227,0.0010988067,0.00027441446,0.00021586746],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007589061,0.0008179593,0.0011270714,0.0012328217,0.00097609975,0.003426888,0.0013759434,0.0019599071,0.05335366],"category_scores_gemma":[0.0036513973,0.0007499597,0.0013321204,0.0009877293,0.0019398966,0.0051064664,0.003240499,0.0032373723,0.0061034253],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021317664,0.00013271185,0.0004240037,0.00021154633,0.000039961644,0.0002075542,0.00032293776,0.020792522,0.02219505,0.87595147,0.012998416,0.06651062],"study_design_scores_gemma":[0.000051998413,0.0000643228,0.00036197295,0.00005982926,0.000033587592,0.0003490471,0.00014724898,0.07007134,0.007858621,0.8630605,0.057891827,0.000049621256],"about_ca_topic_score_codex":0.0008071612,"about_ca_topic_score_gemma":0.0017682044,"teacher_disagreement_score":0.05335366,"about_ca_system_score_codex":0.000735759,"about_ca_system_score_gemma":0.00032123222,"threshold_uncertainty_score":0.17848581},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026230544,0.0011060802,0.955012,0.001122033,0.0009618969,0.00059799635,0.001032103,0.0043367213,0.009600553],"genre_scores_gemma":[0.29896277,0.0011506472,0.67249775,0.00066737836,0.0006720293,0.000294231,0.0033362815,0.0009890586,0.021429887],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966433,0.00064218027,0.00015819758,0.0007468425,0.0014852099,0.0003242436],"domain_scores_gemma":[0.99472225,0.0014452405,0.00014073911,0.0021518818,0.0013147342,0.00022519364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018661079,0.00095870916,0.0018400494,0.0014985244,0.0016628467,0.002027399,0.004430367,0.0013792305,0.019091094],"category_scores_gemma":[0.008576974,0.0006066814,0.00079335325,0.0041506346,0.0015367036,0.0043643126,0.004288715,0.0015263,0.0033805477],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0025302828,0.00072071457,0.0029703362,0.0006554694,0.00024879415,0.0005242905,0.0007225527,0.08321907,0.04604144,0.07888974,0.115301915,0.6681754],"study_design_scores_gemma":[0.00018536895,0.00033804507,0.0009865068,0.000033290682,0.0000834851,0.00051841856,0.0002396767,0.9069695,0.020749463,0.031211212,0.038564462,0.0001205922],"about_ca_topic_score_codex":0.014122872,"about_ca_topic_score_gemma":0.026135538,"teacher_disagreement_score":0.019091094,"about_ca_system_score_codex":0.001577736,"about_ca_system_score_gemma":0.0021650551,"threshold_uncertainty_score":0.06386608},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014450453,0.000085948566,0.9786921,0.00012170984,0.000045081026,0.000068658,0.00043593452,0.0011299142,0.0049701724],"genre_scores_gemma":[0.31992075,0.0003047182,0.6721881,0.00008621908,0.000025793795,0.00015398044,0.0025272763,0.0005067386,0.0042864676],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987772,0.00023178628,0.000066907545,0.00024320015,0.00052796106,0.00015300338],"domain_scores_gemma":[0.99864,0.00052218634,0.00012184448,0.0005281993,0.00010793032,0.00007988668],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006748497,0.00074629026,0.0007195577,0.00068061176,0.0007076042,0.0017622873,0.0022154124,0.0014951284,0.008950567],"category_scores_gemma":[0.0046176654,0.00076320174,0.001234789,0.0010325428,0.0016518311,0.0035022402,0.0033846502,0.00133231,0.002044634],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003441645,0.00006841881,0.0020484482,0.0005148479,0.000038211732,0.0010386487,0.0006433252,0.5351033,0.015368348,0.2888221,0.008272218,0.14773804],"study_design_scores_gemma":[0.000019617652,0.000059042155,0.00029643349,0.000073614516,0.000012119927,0.0005753252,0.00018510873,0.836469,0.012561394,0.13112703,0.018584572,0.000036768513],"about_ca_topic_score_codex":0.0015953181,"about_ca_topic_score_gemma":0.0021208215,"teacher_disagreement_score":0.008950567,"about_ca_system_score_codex":0.0008062599,"about_ca_system_score_gemma":0.0006408579,"threshold_uncertainty_score":0.029942632},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28444695,0.0017923192,0.67111456,0.0013452956,0.00017609082,0.000082255756,0.0008425897,0.00033946894,0.039860457],"genre_scores_gemma":[0.87972426,0.0014809174,0.10279272,0.0001401247,0.00005593157,0.00006795311,0.00075077236,0.00011507254,0.014872177],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998895,0.000030568506,0.000007887686,0.000020720805,0.00003590324,0.00001542694],"domain_scores_gemma":[0.99972254,0.000117223535,0.000046806734,0.000025049563,0.000052721574,0.000035680958],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023751093,0.0002590288,0.0006579019,0.0006550596,0.00039896125,0.0010091243,0.000807462,0.00086911605,0.0036943727],"category_scores_gemma":[0.0014476066,0.00022013632,0.00024721236,0.0008005175,0.00048188507,0.0016608024,0.0006883151,0.0007119207,0.00055481796],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002208712,0.00004408716,0.0006421344,0.0002100665,0.000030702427,0.00018192608,0.00010512238,0.35451135,0.0039292984,0.6002984,0.004700799,0.035125326],"study_design_scores_gemma":[0.000042508436,0.00003621305,0.00036503875,0.000021636588,0.000012245559,0.00017919793,0.00007262623,0.65695244,0.0006528461,0.3377703,0.0038817085,0.000013269276],"about_ca_topic_score_codex":0.0010927322,"about_ca_topic_score_gemma":0.0010482181,"teacher_disagreement_score":0.0036943727,"about_ca_system_score_codex":0.0004905,"about_ca_system_score_gemma":0.00032141848,"threshold_uncertainty_score":0.0123589635},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07444614,0.0010837612,0.7790386,0.00081309077,0.00038533416,0.00019291707,0.00031322517,0.00085598306,0.14287092],"genre_scores_gemma":[0.73413175,0.00095035456,0.23152392,0.00038437147,0.00011128124,0.00024308584,0.0005539746,0.00027138338,0.031829864],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99963665,0.00006606639,0.000020433357,0.00009407405,0.00013319546,0.000049630497],"domain_scores_gemma":[0.999297,0.00019109246,0.00016033923,0.00022073364,0.000057823832,0.00007298361],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002753405,0.00060831185,0.000287752,0.00041613512,0.00083305803,0.00087514,0.00085685134,0.00072351214,0.00894606],"category_scores_gemma":[0.0021617983,0.00041749483,0.00052723585,0.0003171627,0.0017211412,0.00132113,0.0018436699,0.001161192,0.002106086],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021099158,0.00005378164,0.0014874412,0.00022445293,0.000026770238,0.0008128499,0.000650632,0.095377214,0.02878707,0.67882204,0.0071601807,0.18638654],"study_design_scores_gemma":[0.00007799191,0.0003245963,0.0012802839,0.00012322831,0.000044186498,0.0018450036,0.00063173356,0.38878042,0.035275314,0.470629,0.10093368,0.000054601405],"about_ca_topic_score_codex":0.00061028166,"about_ca_topic_score_gemma":0.0007494054,"teacher_disagreement_score":0.00894606,"about_ca_system_score_codex":0.00047113595,"about_ca_system_score_gemma":0.00028067274,"threshold_uncertainty_score":0.029927552},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024380747,0.003054905,0.9447204,0.0026838079,0.00045714495,0.000113831615,0.00045877512,0.0006012649,0.02352912],"genre_scores_gemma":[0.29717392,0.006133353,0.66466033,0.0009876466,0.0011394575,0.0003289011,0.0016486786,0.0005637956,0.027363831],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99774617,0.0007565204,0.00010150387,0.00039344022,0.0007912464,0.00021114286],"domain_scores_gemma":[0.996903,0.001690445,0.0003704044,0.00040848655,0.00043920905,0.00018834113],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018579351,0.0010584268,0.0012566018,0.0018911868,0.0014738427,0.0024411539,0.0028745953,0.002915491,0.0136163905],"category_scores_gemma":[0.008091178,0.00073925796,0.00089262327,0.0032196043,0.002450763,0.007896413,0.004111792,0.002932787,0.0029760979],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042780154,0.00016441409,0.0032099686,0.00087145343,0.00012080606,0.0011384282,0.0005097568,0.07645641,0.0028468482,0.61289424,0.0392141,0.2621458],"study_design_scores_gemma":[0.00015406418,0.00015671243,0.00072558183,0.00018868204,0.000039739127,0.002307239,0.00072497345,0.2825947,0.0028336241,0.63034266,0.0798576,0.000074416996],"about_ca_topic_score_codex":0.0014115396,"about_ca_topic_score_gemma":0.0011145588,"teacher_disagreement_score":0.0136163905,"about_ca_system_score_codex":0.0006684382,"about_ca_system_score_gemma":0.00071304,"threshold_uncertainty_score":0.04555136},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18609545,0.001374822,0.6488112,0.0004096836,0.00030507386,0.00021256338,0.0008314395,0.0013146208,0.1606452],"genre_scores_gemma":[0.59292173,0.0029712173,0.34336817,0.0001546151,0.00014968457,0.00023227705,0.0012944284,0.0006043032,0.058303565],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998134,0.000046832065,0.0000093309645,0.000031773798,0.00007728227,0.000021520911],"domain_scores_gemma":[0.9996038,0.00014922074,0.000046295685,0.000074554206,0.00007127404,0.00005482696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001537621,0.0006927553,0.0003459019,0.00089370407,0.00037220775,0.0010260752,0.0007633225,0.0005515261,0.011805458],"category_scores_gemma":[0.0010201756,0.0005580181,0.0003352811,0.0011311533,0.00042198805,0.00097211124,0.00093720615,0.0010800281,0.001746152],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002130652,0.000087244865,0.0006072743,0.0003474595,0.000033188462,0.00037190682,0.0003795562,0.05701326,0.030864194,0.64191234,0.015087298,0.25308323],"study_design_scores_gemma":[0.000102102604,0.00013583715,0.0014594606,0.00012399389,0.000053927633,0.0009176484,0.00030527124,0.20808394,0.015308398,0.67207295,0.10139329,0.00004325742],"about_ca_topic_score_codex":0.00060144195,"about_ca_topic_score_gemma":0.00138952,"teacher_disagreement_score":0.011805458,"about_ca_system_score_codex":0.00029914937,"about_ca_system_score_gemma":0.0001812936,"threshold_uncertainty_score":0.039493144},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03523632,0.00034097422,0.9193974,0.00029133906,0.00027416056,0.000081963226,0.0003109425,0.0011255301,0.042941332],"genre_scores_gemma":[0.55838996,0.0010417933,0.36799142,0.0003061506,0.00030505564,0.00018274569,0.0007131774,0.0023158705,0.068753876],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996252,0.00003312327,0.000017399561,0.00007361121,0.00020891991,0.00004175801],"domain_scores_gemma":[0.9993262,0.0001576244,0.000063621184,0.00029108394,0.00011876416,0.000042648113],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023539894,0.0005927907,0.0007176573,0.00083869597,0.00040620877,0.0011628512,0.0010254688,0.000787824,0.007389641],"category_scores_gemma":[0.0015788076,0.0004882889,0.0005224247,0.00063573936,0.00075962243,0.0013317708,0.0014122785,0.0013971493,0.0021313021],"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.0003558993,0.00006939905,0.00033036084,0.00041118189,0.00004694736,0.00024419616,0.00022580662,0.049509857,0.1448949,0.4249901,0.010856566,0.36806485],"study_design_scores_gemma":[0.000100567064,0.00032823478,0.0011523163,0.00010782667,0.000079833415,0.0016771947,0.00016395711,0.22476506,0.12071374,0.56725603,0.083599105,0.000056154615],"about_ca_topic_score_codex":0.00029433996,"about_ca_topic_score_gemma":0.0003832021,"teacher_disagreement_score":0.007389641,"about_ca_system_score_codex":0.0003947741,"about_ca_system_score_gemma":0.00026420283,"threshold_uncertainty_score":0.024720788},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15326345,0.0016249565,0.7280759,0.00027425797,0.00025481882,0.00019281833,0.0008095566,0.00071961986,0.11478466],"genre_scores_gemma":[0.83150136,0.0011843521,0.1393391,0.00015786375,0.00011075063,0.00021966657,0.0014100521,0.00025784646,0.025819093],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99955946,0.00004834512,0.000017234694,0.00011162838,0.00016754736,0.000095772375],"domain_scores_gemma":[0.99948525,0.00012869257,0.00015962284,0.000119369026,0.00004442821,0.00006261373],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016591013,0.00071025226,0.00040246316,0.0004803114,0.00065072475,0.00133124,0.001050568,0.0008691732,0.0051865824],"category_scores_gemma":[0.00081085466,0.00047601268,0.0009098224,0.0004021349,0.0015599969,0.0018001411,0.001437127,0.00079729,0.0011988721],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002666369,0.00009627044,0.0028892816,0.00022995073,0.00004268721,0.0016801829,0.00054805225,0.170397,0.024536457,0.73879117,0.0073305783,0.053191684],"study_design_scores_gemma":[0.000080550366,0.00037443134,0.002235931,0.00011824927,0.000055360088,0.0039036816,0.0005452804,0.56776035,0.018924525,0.27528754,0.13064387,0.000070181006],"about_ca_topic_score_codex":0.0016898328,"about_ca_topic_score_gemma":0.001570111,"teacher_disagreement_score":0.0051865824,"about_ca_system_score_codex":0.0005027211,"about_ca_system_score_gemma":0.0003369144,"threshold_uncertainty_score":0.017350852},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.085901886,0.0017516017,0.8788495,0.0036173107,0.00018378806,0.0003480507,0.0016263855,0.002228855,0.025492536],"genre_scores_gemma":[0.5019375,0.001767316,0.47932437,0.0006977416,0.0004949982,0.0008814289,0.003663249,0.000723376,0.010510074],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99749124,0.00048669128,0.00013548436,0.000595105,0.00076913263,0.0005224257],"domain_scores_gemma":[0.9926893,0.0050166687,0.0004907309,0.0012443579,0.00027755025,0.00028136693],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017073002,0.0016354619,0.0019040792,0.0013301154,0.0015252199,0.0038982003,0.0041836025,0.002492302,0.01085313],"category_scores_gemma":[0.010216313,0.000991828,0.0022469705,0.003547771,0.0019454391,0.00863725,0.0036704352,0.0040334817,0.0016967205],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00086343236,0.0005511714,0.0027875926,0.0010849074,0.00019891298,0.00029836252,0.0006783224,0.5176022,0.0058446527,0.28223246,0.020017864,0.16784011],"study_design_scores_gemma":[0.00014575082,0.000119452074,0.00057470053,0.00006807135,0.000048727426,0.00027519604,0.00015408824,0.62881196,0.002321183,0.36104602,0.006402327,0.000032571777],"about_ca_topic_score_codex":0.0022359428,"about_ca_topic_score_gemma":0.002266398,"teacher_disagreement_score":0.01085313,"about_ca_system_score_codex":0.0034290042,"about_ca_system_score_gemma":0.0016985647,"threshold_uncertainty_score":0.036307395},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27337453,0.00025135867,0.69800067,0.00031433592,0.000111151625,0.00024265294,0.0012410656,0.009512459,0.016951744],"genre_scores_gemma":[0.4661857,0.00014454477,0.5189266,0.00014325806,0.000032039818,0.00016565724,0.00399103,0.0007589841,0.009652076],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99962986,0.000033532546,0.000028121034,0.00012290121,0.00009988501,0.00008566037],"domain_scores_gemma":[0.9995276,0.00022868937,0.000037912927,0.000083645784,0.00004912295,0.00007311192],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003205943,0.0010465139,0.0015083316,0.0009636585,0.00074623944,0.0010183137,0.0013848783,0.001182084,0.023028376],"category_scores_gemma":[0.001642019,0.0006002935,0.00095323427,0.0009812621,0.00064785936,0.002287171,0.0022546153,0.00055526843,0.0020291575],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013890227,0.00026585572,0.004272664,0.0007955022,0.00014371784,0.00063619117,0.00038573222,0.3190153,0.023176722,0.01798514,0.018150508,0.61378366],"study_design_scores_gemma":[0.00016206085,0.00040378838,0.0012205493,0.0000447395,0.000045151668,0.0002445121,0.00064684707,0.9383372,0.009913944,0.041668687,0.007271966,0.0000405842],"about_ca_topic_score_codex":0.0023532822,"about_ca_topic_score_gemma":0.0062491633,"teacher_disagreement_score":0.023028376,"about_ca_system_score_codex":0.0005589227,"about_ca_system_score_gemma":0.001120349,"threshold_uncertainty_score":0.07703757},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.64143294,0.0030112406,0.17932291,0.019453859,0.0010000796,0.00015954005,0.0032095339,0.001018638,0.1513913],"genre_scores_gemma":[0.9403056,0.0032444173,0.029056016,0.0020989007,0.0008447674,0.00021049101,0.0034568687,0.00026954402,0.02051351],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99818987,0.00031905322,0.00014691129,0.00042527993,0.00045981794,0.00045904113],"domain_scores_gemma":[0.9927099,0.003732959,0.00081630156,0.0015668275,0.00053474464,0.000639289],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022428841,0.0010250483,0.001663492,0.0015648811,0.0021846301,0.0030940026,0.0017100711,0.0016106449,0.012034409],"category_scores_gemma":[0.0105146,0.0007543679,0.0016120932,0.0019795322,0.0040661427,0.008265646,0.002819057,0.0031557262,0.0016650535],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00085540465,0.00017460035,0.0054767756,0.00045412852,0.00009704488,0.00056391174,0.0005297852,0.05694674,0.0034286156,0.8694438,0.02213715,0.03989205],"study_design_scores_gemma":[0.0001296255,0.000047863476,0.0012285123,0.000048849502,0.00003603905,0.00023069557,0.00031439983,0.027234448,0.0007725005,0.95188636,0.018046394,0.000024281304],"about_ca_topic_score_codex":0.0021071658,"about_ca_topic_score_gemma":0.0024402796,"teacher_disagreement_score":0.012034409,"about_ca_system_score_codex":0.0018250011,"about_ca_system_score_gemma":0.00098767,"threshold_uncertainty_score":0.040259123},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029315656,0.00015732819,0.96210986,0.00010012576,0.00013331353,0.00009814019,0.00035787368,0.0014896409,0.006237992],"genre_scores_gemma":[0.30629838,0.00030652218,0.6828487,0.00013913633,0.000048066624,0.00019880281,0.0012165328,0.0012490116,0.0076947575],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99961436,0.000056694276,0.00002818732,0.000058738566,0.00017462151,0.000067358415],"domain_scores_gemma":[0.99929416,0.00022773506,0.000053204367,0.00021992467,0.00013673352,0.00006820457],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053612026,0.00048894744,0.00064029195,0.00075921824,0.00073550764,0.0011718543,0.0013467143,0.0006375943,0.009070561],"category_scores_gemma":[0.0023529867,0.0003807093,0.0005360582,0.0007707495,0.0012779094,0.0011826786,0.0021750934,0.0019785904,0.0019354001],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006773713,0.00016004099,0.0013796929,0.00033457164,0.000021669337,0.00024490835,0.00048444315,0.069617756,0.013796748,0.55357087,0.012321216,0.3473908],"study_design_scores_gemma":[0.0001252322,0.00020317463,0.00059467537,0.00017283346,0.000027552582,0.00020235359,0.00031359732,0.51679486,0.021849817,0.4060442,0.0536306,0.000041177565],"about_ca_topic_score_codex":0.0018528628,"about_ca_topic_score_gemma":0.003151974,"teacher_disagreement_score":0.009070561,"about_ca_system_score_codex":0.00042958322,"about_ca_system_score_gemma":0.00067313924,"threshold_uncertainty_score":0.030344069},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16599675,0.00021745723,0.8039239,0.00014568873,0.00008374238,0.00012375836,0.000088517336,0.00060226355,0.02881794],"genre_scores_gemma":[0.5941867,0.00044971015,0.39200553,0.00006153941,0.000049865943,0.00012008521,0.0001843305,0.00047760629,0.0124646],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995365,0.000050241822,0.00002455536,0.00008068442,0.00022120173,0.000086861925],"domain_scores_gemma":[0.99864215,0.00045658785,0.00022032934,0.00047726172,0.000101603735,0.00010210652],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035168848,0.0007997947,0.00056929927,0.00044115935,0.0006644996,0.0012170954,0.0009461165,0.00046077542,0.0033996722],"category_scores_gemma":[0.0030044043,0.0006066172,0.0006915234,0.00043312955,0.0019389921,0.0016031013,0.0024196636,0.0014145054,0.00083337206],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044563864,0.000119155346,0.002278346,0.0003769138,0.00005926924,0.001977184,0.0013188045,0.28581896,0.1561138,0.31988096,0.0025111393,0.2290998],"study_design_scores_gemma":[0.000082165025,0.00029894136,0.0019911309,0.0000841875,0.00005504821,0.0014073345,0.00041489847,0.73002756,0.09698141,0.12957393,0.039006535,0.000076809316],"about_ca_topic_score_codex":0.00227577,"about_ca_topic_score_gemma":0.002755702,"teacher_disagreement_score":0.0033996722,"about_ca_system_score_codex":0.0004544489,"about_ca_system_score_gemma":0.00045171523,"threshold_uncertainty_score":0.011373043},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14230584,0.00017535384,0.8314971,0.0002686894,0.00012824169,0.00009742372,0.00047299234,0.0004913433,0.024563052],"genre_scores_gemma":[0.55737156,0.0005562221,0.42571992,0.00030800048,0.00010099712,0.00014260545,0.0012985372,0.00082685566,0.0136753395],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99922943,0.00014680086,0.000035014415,0.0002134421,0.000261486,0.00011384902],"domain_scores_gemma":[0.99871004,0.0003499663,0.00023591366,0.00032249663,0.0002354776,0.00014608231],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035105637,0.0005782086,0.00039932688,0.00095112226,0.0006026918,0.0019896093,0.0007212572,0.0005992451,0.0055913567],"category_scores_gemma":[0.0026540463,0.0005983978,0.00071185146,0.00078176975,0.0024962137,0.003018918,0.002111984,0.0021948342,0.001072338],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017037356,0.00006368946,0.001204036,0.00011204988,0.000012925682,0.0002957354,0.00058347994,0.037283834,0.01554886,0.8977972,0.0023730975,0.04455469],"study_design_scores_gemma":[0.000025094389,0.00007172579,0.0008017406,0.000052702904,0.0000131799625,0.00030597855,0.00055337645,0.124879405,0.007309584,0.8424031,0.023544364,0.00003977807],"about_ca_topic_score_codex":0.0024332555,"about_ca_topic_score_gemma":0.0033412026,"teacher_disagreement_score":0.0055913567,"about_ca_system_score_codex":0.00048455637,"about_ca_system_score_gemma":0.00033476015,"threshold_uncertainty_score":0.01870495},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4919333,0.0025233189,0.46159634,0.0027374334,0.00019613198,0.00014422266,0.00084438256,0.00068804785,0.03933675],"genre_scores_gemma":[0.93275976,0.0009020528,0.063157484,0.00026826366,0.00013774754,0.00015501541,0.00037667796,0.00014278988,0.002100275],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966667,0.0007940793,0.00021149371,0.0007217495,0.0010912912,0.0005146353],"domain_scores_gemma":[0.9883156,0.0076444326,0.0017800971,0.0010031475,0.00070881017,0.0005479426],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00226403,0.000640618,0.0012930551,0.0010338697,0.0011227754,0.0017379689,0.0011052133,0.0015094551,0.0048351837],"category_scores_gemma":[0.029229779,0.0006603883,0.00060534256,0.001418308,0.001553528,0.0028185651,0.0026811247,0.0009896882,0.0009866478],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019948857,0.00019628186,0.033298217,0.0011828807,0.00041267186,0.004255931,0.0016080451,0.23765476,0.06603311,0.4215195,0.0169576,0.21488611],"study_design_scores_gemma":[0.0002736811,0.0007285662,0.015446834,0.00030350903,0.00015125028,0.011952411,0.0010322742,0.49267396,0.032923557,0.4146675,0.029670348,0.00017611591],"about_ca_topic_score_codex":0.0004980139,"about_ca_topic_score_gemma":0.00031241294,"teacher_disagreement_score":0.0048351837,"about_ca_system_score_codex":0.0006145633,"about_ca_system_score_gemma":0.0004249221,"threshold_uncertainty_score":0.01617533},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16434087,0.0011003356,0.7768062,0.00069256045,0.00018035101,0.000102137565,0.0003962213,0.00042830137,0.055953003],"genre_scores_gemma":[0.5590909,0.0026001206,0.4196545,0.00028265506,0.00008566804,0.00010376574,0.00095035054,0.00019359351,0.017038433],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99974483,0.000064478096,0.000013113933,0.00006287098,0.00007831318,0.000036367095],"domain_scores_gemma":[0.99953866,0.00017009907,0.00012670971,0.0000864161,0.000055778677,0.00002244388],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021308738,0.00047241696,0.00020619942,0.00046520575,0.00048418748,0.0006179072,0.00047755448,0.00055729307,0.00485762],"category_scores_gemma":[0.001692994,0.00029930315,0.00046034058,0.0009905027,0.00045156368,0.0014346009,0.0004894725,0.0006147933,0.00061710156],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013476449,0.00007107639,0.0018393343,0.000451575,0.000070871174,0.0006544366,0.00033462123,0.13307197,0.037336115,0.5934082,0.008004008,0.22462302],"study_design_scores_gemma":[0.000107095475,0.0002528097,0.0027116353,0.00011554267,0.00018080646,0.0026985095,0.0008078222,0.24620782,0.05063587,0.5388979,0.15728135,0.000102880804],"about_ca_topic_score_codex":0.0006596297,"about_ca_topic_score_gemma":0.0013003758,"teacher_disagreement_score":0.00485762,"about_ca_system_score_codex":0.0004270414,"about_ca_system_score_gemma":0.00020197494,"threshold_uncertainty_score":0.016250372},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12103268,0.0005694291,0.85742664,0.0002969774,0.00008048694,0.00024314158,0.0012513421,0.0028601075,0.016239224],"genre_scores_gemma":[0.5206185,0.00036310032,0.4639508,0.00026542804,0.000048969552,0.00027818105,0.004527097,0.00042394813,0.009523937],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99838626,0.00024355143,0.00009029357,0.0005098289,0.00045007849,0.00031986495],"domain_scores_gemma":[0.9986785,0.00042359295,0.00013697051,0.00044753816,0.00022995869,0.000083309904],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008397431,0.0009394948,0.001846939,0.0013628775,0.000831915,0.0012717878,0.0026849883,0.0016905223,0.013055882],"category_scores_gemma":[0.0046754694,0.0007133975,0.00066185417,0.0029096026,0.0005620635,0.0027374679,0.0029106918,0.0009007749,0.0030750788],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0023802621,0.00062248076,0.0029118992,0.00088613195,0.00015028936,0.00045246287,0.00040808684,0.37090787,0.046426766,0.059008293,0.023376338,0.49246913],"study_design_scores_gemma":[0.0001165924,0.0001748109,0.0009356734,0.000051687854,0.000032463577,0.0003238388,0.00014459959,0.9217663,0.021017639,0.047942165,0.0074649523,0.000029307512],"about_ca_topic_score_codex":0.0035465895,"about_ca_topic_score_gemma":0.0038431059,"teacher_disagreement_score":0.013055882,"about_ca_system_score_codex":0.00093581993,"about_ca_system_score_gemma":0.0008667805,"threshold_uncertainty_score":0.043676317},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2784386,0.0030184388,0.34554622,0.0033853047,0.0016773415,0.00012272352,0.002580445,0.0014404664,0.36379045],"genre_scores_gemma":[0.87897724,0.0021431907,0.06780069,0.0006073531,0.0007009484,0.00014608593,0.002405685,0.0016200107,0.0455987],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991097,0.0002121373,0.000042442516,0.00025020784,0.0002410203,0.00014443045],"domain_scores_gemma":[0.9929783,0.004245884,0.0006219429,0.00060350756,0.0008624499,0.0006879887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017059223,0.00083414745,0.0007496146,0.004343314,0.0012473678,0.003465786,0.0018883033,0.0012627905,0.030764053],"category_scores_gemma":[0.013924334,0.00038877074,0.0007100723,0.0019406473,0.0024803092,0.004009265,0.0019171897,0.0031432873,0.0042427354],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023322462,0.00006158022,0.002926602,0.00019227376,0.000030607585,0.00017778735,0.00035467403,0.014541232,0.0029267713,0.9104789,0.022644116,0.045432348],"study_design_scores_gemma":[0.000027404512,0.000058772264,0.0041606743,0.00020591743,0.0000482081,0.00053855754,0.0002682081,0.09013047,0.0042554685,0.87857693,0.02166764,0.00006177552],"about_ca_topic_score_codex":0.0018779945,"about_ca_topic_score_gemma":0.002248888,"teacher_disagreement_score":0.030764053,"about_ca_system_score_codex":0.0018852556,"about_ca_system_score_gemma":0.00069705525,"threshold_uncertainty_score":0.102916},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17934392,0.002785897,0.79522616,0.0019389378,0.00021214319,0.00013357213,0.0009390762,0.0010919035,0.018328333],"genre_scores_gemma":[0.64797133,0.002047646,0.33280274,0.0004955424,0.00025212325,0.00018314685,0.0030759396,0.00033848296,0.0128329545],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998961,0.0002371169,0.00007159466,0.00025718356,0.0002877118,0.00018541451],"domain_scores_gemma":[0.996923,0.0020421678,0.0002454139,0.00036298926,0.00021101354,0.000215323],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010278147,0.000702557,0.0008174372,0.0009724536,0.0010329079,0.0015630183,0.0011436755,0.0013731165,0.0069492264],"category_scores_gemma":[0.0056690397,0.00049994444,0.0010172693,0.0015662601,0.0017143396,0.004337165,0.0023446667,0.0021273962,0.00072709046],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043982512,0.00019143679,0.0047114473,0.00070244854,0.000093655864,0.00046009436,0.0009947275,0.26722434,0.0060820705,0.499419,0.015843954,0.203837],"study_design_scores_gemma":[0.00005380744,0.00014679087,0.001149396,0.00009088595,0.000035258883,0.00042264926,0.00032546595,0.33300138,0.0027565844,0.6483037,0.013692034,0.000022078064],"about_ca_topic_score_codex":0.0017758438,"about_ca_topic_score_gemma":0.0017530458,"teacher_disagreement_score":0.0069492264,"about_ca_system_score_codex":0.001163141,"about_ca_system_score_gemma":0.0007089319,"threshold_uncertainty_score":0.02324742},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18847696,0.009064875,0.6485032,0.021159299,0.00087704306,0.0001227754,0.0010097256,0.00091209315,0.1298741],"genre_scores_gemma":[0.83557934,0.0038484856,0.14795691,0.001178046,0.0006236777,0.00022677856,0.0006425978,0.00043541213,0.00950873],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968901,0.00089896785,0.00014611846,0.0009138014,0.00073260587,0.00041825112],"domain_scores_gemma":[0.98388886,0.011304517,0.00075336895,0.0026346152,0.0006946992,0.00072400074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003545351,0.00080915197,0.0013480579,0.001803605,0.0025968072,0.0058588944,0.0021420666,0.0028581684,0.012710422],"category_scores_gemma":[0.021623991,0.0015468223,0.0019669544,0.0012260784,0.011099673,0.01552124,0.007368005,0.006512773,0.0012192259],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000077644945,0.000021017839,0.0004831775,0.00011033889,0.00002026446,0.00010509911,0.00032106208,0.008481319,0.0008230269,0.9755584,0.0019252559,0.012073414],"study_design_scores_gemma":[0.000017763952,0.000018150873,0.00018656589,0.000056591456,0.000008876434,0.00005701638,0.00017998744,0.011351402,0.0004570993,0.9792341,0.0084158825,0.000016600736],"about_ca_topic_score_codex":0.0019714555,"about_ca_topic_score_gemma":0.0016441873,"teacher_disagreement_score":0.012710422,"about_ca_system_score_codex":0.0023504067,"about_ca_system_score_gemma":0.0009468492,"threshold_uncertainty_score":0.042520583},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36052564,0.002270595,0.5786805,0.004310184,0.00045317583,0.00022252754,0.002018342,0.00071133743,0.05080765],"genre_scores_gemma":[0.89346176,0.0011617494,0.08612925,0.000340028,0.00036358048,0.0001744335,0.001406085,0.00027615542,0.01668682],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992747,0.00023411094,0.000027139313,0.00016831885,0.000170969,0.00012484798],"domain_scores_gemma":[0.9970728,0.0019781606,0.0001801238,0.00038307437,0.000120545505,0.00026531104],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008081752,0.00063146185,0.0017350428,0.00063341844,0.00088331936,0.0022454807,0.0022590861,0.002624808,0.010128275],"category_scores_gemma":[0.005956448,0.00068218843,0.00052730774,0.0014166732,0.0012720338,0.0033765016,0.002078364,0.0016898223,0.00095439336],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009889625,0.00028588888,0.0015930191,0.00082937547,0.0001259262,0.0006037447,0.00039442588,0.50917584,0.0045598694,0.33913755,0.03318288,0.109122515],"study_design_scores_gemma":[0.0001253587,0.00008567648,0.0005035366,0.000046165074,0.000030426047,0.00030637046,0.00022691477,0.76485693,0.0019463777,0.22515732,0.006694887,0.00002015332],"about_ca_topic_score_codex":0.0013458469,"about_ca_topic_score_gemma":0.0007805898,"teacher_disagreement_score":0.010128275,"about_ca_system_score_codex":0.00082822196,"about_ca_system_score_gemma":0.0005827575,"threshold_uncertainty_score":0.0338825},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005922134,0.00017445513,0.98538697,0.00015083441,0.000071311544,0.00012596235,0.00043052813,0.0034299633,0.0043078116],"genre_scores_gemma":[0.06579246,0.00013703671,0.9248798,0.000067646855,0.000028929348,0.00026333978,0.0017374734,0.00052085565,0.006572445],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994363,0.0000651238,0.00004300924,0.00012431009,0.00026028932,0.000070894566],"domain_scores_gemma":[0.9991253,0.0002277285,0.000052458083,0.00021468487,0.0003269853,0.00005295919],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006830485,0.0011708651,0.0009912263,0.0022879457,0.0009793548,0.00161668,0.0022779189,0.0013149981,0.02373072],"category_scores_gemma":[0.0028129166,0.0005408085,0.0009559773,0.001880917,0.0007347454,0.0016296997,0.0027934986,0.0013628502,0.009520921],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046647203,0.00023028169,0.0018625209,0.00043113952,0.00012234996,0.00016272657,0.0004522867,0.07887622,0.016897691,0.0689879,0.04715578,0.78435457],"study_design_scores_gemma":[0.00025530296,0.0002069193,0.00090919895,0.00006576092,0.000072714654,0.000339462,0.0003727552,0.8547854,0.020980382,0.07506324,0.046894863,0.00005407788],"about_ca_topic_score_codex":0.0055526653,"about_ca_topic_score_gemma":0.010472925,"teacher_disagreement_score":0.02373072,"about_ca_system_score_codex":0.0010084329,"about_ca_system_score_gemma":0.002430018,"threshold_uncertainty_score":0.07938719},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7185121,0.0007672721,0.233962,0.0014297421,0.0001252996,0.00014799765,0.00043417525,0.00084564695,0.043775775],"genre_scores_gemma":[0.9085587,0.00064454286,0.06281697,0.0003157107,0.000091127025,0.00009191982,0.0005837385,0.00026183572,0.026635488],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99932516,0.00013803026,0.00004600598,0.00012889109,0.00020769486,0.00015432508],"domain_scores_gemma":[0.9974252,0.0012101501,0.00046996077,0.00028237002,0.0002833768,0.00032900824],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082517765,0.00056844094,0.0008220922,0.0031832324,0.001986229,0.003591991,0.0017185754,0.0018778703,0.00874782],"category_scores_gemma":[0.0054922765,0.00081305,0.000904131,0.0019248181,0.0017786041,0.0048178416,0.001959676,0.0017852318,0.0013300907],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009617316,0.00006666811,0.0011464752,0.000092610884,0.00001550598,0.00022259438,0.0006159459,0.010919605,0.002194909,0.9671104,0.0016960901,0.01582304],"study_design_scores_gemma":[0.00002720398,0.000027640155,0.00047575796,0.000029177176,0.000019459707,0.00018364903,0.00026221047,0.045443755,0.0014870784,0.9481704,0.0038547167,0.000018925697],"about_ca_topic_score_codex":0.003335144,"about_ca_topic_score_gemma":0.0044757803,"teacher_disagreement_score":0.00874782,"about_ca_system_score_codex":0.0019475586,"about_ca_system_score_gemma":0.00065189827,"threshold_uncertainty_score":0.02926433},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08903083,0.0013068656,0.8563355,0.0004950068,0.00010806897,0.00008926772,0.00014505192,0.00054424745,0.051945113],"genre_scores_gemma":[0.71332955,0.001554231,0.26441374,0.00020411861,0.00015910665,0.000119065066,0.00037998706,0.00036314892,0.019477045],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993693,0.000118349344,0.000038356724,0.0001640608,0.00023022685,0.00007969527],"domain_scores_gemma":[0.9988753,0.0004415736,0.0000874535,0.00032056222,0.00016388105,0.00011132571],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049635593,0.00051221513,0.00057999743,0.0009373794,0.00080361863,0.0015419973,0.00094971637,0.0006683589,0.0061457967],"category_scores_gemma":[0.0029647495,0.0004121391,0.00077343575,0.0008958238,0.0027883733,0.0024011654,0.0027148938,0.0019095823,0.00095268135],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017406966,0.000017216922,0.0003277195,0.000043611875,0.000003510067,0.00007199625,0.00019291154,0.018905107,0.0018321169,0.94879043,0.0007671863,0.029030787],"study_design_scores_gemma":[0.000011425052,0.00003800496,0.00025162267,0.000035055913,0.0000067729684,0.00020209872,0.00011341025,0.08618142,0.002565499,0.8883704,0.022209086,0.000015154034],"about_ca_topic_score_codex":0.0018284094,"about_ca_topic_score_gemma":0.0018160613,"teacher_disagreement_score":0.0061457967,"about_ca_system_score_codex":0.0010534553,"about_ca_system_score_gemma":0.00036402448,"threshold_uncertainty_score":0.020559788},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03556118,0.015190549,0.79524666,0.016384048,0.004654736,0.00030144324,0.002543875,0.007835179,0.12228228],"genre_scores_gemma":[0.4496364,0.011629257,0.4496091,0.00811424,0.007265287,0.001759075,0.006540532,0.0036337848,0.06181241],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.995821,0.0008265905,0.00030725877,0.0011085905,0.0013869269,0.00054969644],"domain_scores_gemma":[0.98995066,0.005973839,0.00035432054,0.0029025534,0.00046615215,0.0003525301],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002368134,0.0025211412,0.0018303824,0.0022135568,0.0022975719,0.007822203,0.0032754194,0.0015557159,0.02042739],"category_scores_gemma":[0.01402843,0.0010340938,0.0020749292,0.0046758624,0.0057581794,0.017719477,0.005586573,0.007906824,0.0084314905],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014169319,0.0003390821,0.0016231361,0.0011020649,0.0002062197,0.00021264754,0.0006511062,0.024551006,0.0077047725,0.64516294,0.11514322,0.20188685],"study_design_scores_gemma":[0.00035895235,0.00039866345,0.0012308741,0.000247297,0.0002512115,0.00047370957,0.0003025078,0.10926943,0.009722662,0.7505898,0.12704891,0.00010612362],"about_ca_topic_score_codex":0.0039042616,"about_ca_topic_score_gemma":0.003851496,"teacher_disagreement_score":0.02042739,"about_ca_system_score_codex":0.007191551,"about_ca_system_score_gemma":0.0037510132,"threshold_uncertainty_score":0.06833637},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02756682,0.00020649085,0.9652574,0.00019232238,0.000082827966,0.000043916247,0.00011801374,0.00020330888,0.006328911],"genre_scores_gemma":[0.55326355,0.00060604635,0.42738962,0.0001747217,0.000085379754,0.00021360222,0.000630284,0.00034618363,0.017290534],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99922836,0.00012997747,0.00004092268,0.0001598566,0.000375269,0.000065663604],"domain_scores_gemma":[0.9987098,0.00045445186,0.0001024651,0.0003455254,0.00027894852,0.00010880269],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010445844,0.0006665911,0.0010750429,0.0012869653,0.00073725753,0.0016791862,0.0018495612,0.0017332218,0.0089172395],"category_scores_gemma":[0.005097603,0.00089668774,0.0005720276,0.0011649377,0.0010714628,0.0030200505,0.003170607,0.0019502058,0.001803167],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023222518,0.00012312703,0.0009981644,0.00010625273,0.00003811992,0.00018609488,0.00017879819,0.6897455,0.009476957,0.21397232,0.003010606,0.08193191],"study_design_scores_gemma":[0.00002056719,0.0000413512,0.00012531324,0.000016347505,0.000007145756,0.000088456494,0.00004951385,0.9157139,0.002504572,0.07798827,0.0034315188,0.0000130553235],"about_ca_topic_score_codex":0.00061391963,"about_ca_topic_score_gemma":0.00094268733,"teacher_disagreement_score":0.0089172395,"about_ca_system_score_codex":0.0007163757,"about_ca_system_score_gemma":0.00049961935,"threshold_uncertainty_score":0.029831171},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30919576,0.002082694,0.59980595,0.00040737406,0.00032823687,0.00010001098,0.0005285376,0.0018791184,0.08567238],"genre_scores_gemma":[0.78906214,0.0011716711,0.19034468,0.00018384948,0.00019988327,0.00011713688,0.0006866865,0.00085752434,0.017376449],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993043,0.0001828189,0.000032959055,0.00012839593,0.00025422883,0.00009731139],"domain_scores_gemma":[0.99896693,0.00052093423,0.0000731375,0.00022406467,0.00011850495,0.00009645977],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006897574,0.0008790817,0.0009549377,0.0014302384,0.00042449372,0.0012762205,0.0014865962,0.00073112466,0.011365588],"category_scores_gemma":[0.003303182,0.00032373078,0.00043633272,0.0012636954,0.0006060232,0.0020064989,0.0017994035,0.0013703868,0.0023614585],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00079232093,0.0003091937,0.0012044477,0.0006608016,0.00007677969,0.00036537976,0.0003503171,0.1271511,0.0800784,0.4015956,0.015234149,0.3721815],"study_design_scores_gemma":[0.000083324725,0.00039083077,0.0011469532,0.000085219726,0.00009185137,0.0008592523,0.0001859312,0.6045106,0.03076195,0.3456834,0.016145188,0.000055538956],"about_ca_topic_score_codex":0.00032493484,"about_ca_topic_score_gemma":0.00053878926,"teacher_disagreement_score":0.011365588,"about_ca_system_score_codex":0.0005084821,"about_ca_system_score_gemma":0.00022064739,"threshold_uncertainty_score":0.038021684},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034139257,0.0002555948,0.9188339,0.00019108744,0.0003100653,0.00026033906,0.00059658964,0.0014656347,0.043947488],"genre_scores_gemma":[0.33330214,0.00036465924,0.62780184,0.0004084426,0.00009926159,0.0002625961,0.0017403807,0.0014670311,0.03455362],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987956,0.00016588342,0.000076408716,0.0002533022,0.00054682785,0.00016190001],"domain_scores_gemma":[0.9990652,0.00013823804,0.000061067774,0.00043320536,0.00024800023,0.000054337394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061197364,0.0006869494,0.0008092441,0.0016530306,0.0008246672,0.0015856827,0.0013937165,0.0010868836,0.023901908],"category_scores_gemma":[0.0032558383,0.0005429928,0.0006834949,0.0017062293,0.00061785866,0.0018093255,0.0028667527,0.0013274022,0.0064364523],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00059527025,0.00022241322,0.00089589285,0.0003401347,0.000060424376,0.0004282015,0.00030762036,0.018188743,0.060947582,0.3158142,0.021274498,0.580925],"study_design_scores_gemma":[0.00018048687,0.0003976731,0.0014272085,0.00018316573,0.000106355634,0.0021704878,0.0005451693,0.26262555,0.10349254,0.48974082,0.13902894,0.00010155689],"about_ca_topic_score_codex":0.00073414564,"about_ca_topic_score_gemma":0.0010968257,"teacher_disagreement_score":0.023901908,"about_ca_system_score_codex":0.00034520417,"about_ca_system_score_gemma":0.0006372826,"threshold_uncertainty_score":0.07995987},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004700746,0.0004014994,0.98498803,0.00025267273,0.00017390389,0.00005703315,0.00021289317,0.00076505746,0.008448152],"genre_scores_gemma":[0.22429645,0.0015932812,0.7483475,0.0005235936,0.0004909488,0.0002051656,0.0016711764,0.0009936003,0.021878332],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99926156,0.00012653429,0.00004889328,0.00016639027,0.0003259507,0.00007071836],"domain_scores_gemma":[0.998637,0.00037672598,0.000094537856,0.00041024975,0.0004154472,0.000065981185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007251398,0.000823139,0.0009114901,0.0023669389,0.00078569626,0.0027089962,0.001322727,0.0012505292,0.021186562],"category_scores_gemma":[0.0032270579,0.0004579179,0.0010626384,0.0019381581,0.0012483882,0.002651706,0.0023657165,0.0013179973,0.0061010337],"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.00022864105,0.00007942996,0.001073647,0.0005440232,0.00008723758,0.00029312438,0.00036945465,0.10461305,0.030241363,0.27420607,0.023650708,0.5646132],"study_design_scores_gemma":[0.00002620582,0.00006964368,0.0007521962,0.00008846836,0.000028538401,0.00035667443,0.0002348499,0.6985442,0.015179975,0.23388802,0.050787505,0.00004367231],"about_ca_topic_score_codex":0.0007812376,"about_ca_topic_score_gemma":0.00078544737,"teacher_disagreement_score":0.021186562,"about_ca_system_score_codex":0.00055165513,"about_ca_system_score_gemma":0.00055555196,"threshold_uncertainty_score":0.07087612},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037244146,0.0001465705,0.99231344,0.00018652563,0.00003564881,0.000042627118,0.00020893465,0.0022582544,0.001083561],"genre_scores_gemma":[0.05619191,0.00017576177,0.9395353,0.00015491158,0.00005668389,0.00022585224,0.0010004959,0.00054025947,0.0021187405],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997678,0.0003290188,0.00018113016,0.00052640523,0.0010690324,0.0002163668],"domain_scores_gemma":[0.9969175,0.00083237945,0.00020232127,0.0013513997,0.00055335165,0.00014308836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011924147,0.00096024165,0.0015656315,0.0017771095,0.0009336687,0.0020533928,0.0046159895,0.001676643,0.0080951275],"category_scores_gemma":[0.0074541066,0.001184654,0.0014184017,0.0029289813,0.00170607,0.005004048,0.0059858686,0.002817157,0.005165273],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00078181317,0.00031517574,0.0017620195,0.00051357027,0.00010089341,0.00011302522,0.00037960225,0.20596659,0.02074101,0.1573472,0.024688927,0.5872901],"study_design_scores_gemma":[0.0001604494,0.00012495264,0.00023433447,0.000036026497,0.000025663212,0.000117998665,0.00009124432,0.87762046,0.0073997616,0.09449173,0.019650033,0.000047405327],"about_ca_topic_score_codex":0.004383745,"about_ca_topic_score_gemma":0.0053916485,"teacher_disagreement_score":0.0080951275,"about_ca_system_score_codex":0.0015365207,"about_ca_system_score_gemma":0.0022955365,"threshold_uncertainty_score":0.027080834},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016659621,0.00036593905,0.96998066,0.0004116165,0.00030178475,0.00015863992,0.0003002804,0.0054122144,0.0064093517],"genre_scores_gemma":[0.114318185,0.00030488835,0.87450767,0.0002697323,0.00017763623,0.00051287294,0.0014103543,0.0021471458,0.0063514835],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978231,0.00035797502,0.0001475331,0.00029209966,0.001080624,0.00029871849],"domain_scores_gemma":[0.99269,0.0024803143,0.00024913796,0.0030434418,0.0012229143,0.00031416712],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002075091,0.001907161,0.0025317266,0.0021576951,0.0018235573,0.0034102304,0.0043061683,0.0016317966,0.019618358],"category_scores_gemma":[0.013901196,0.0012844274,0.0021717811,0.0036585217,0.0014854607,0.0066091726,0.0058288723,0.0042460402,0.0063418807],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016018321,0.00046270568,0.0021077706,0.0007180512,0.00016507697,0.00020209803,0.000669554,0.104035184,0.014689975,0.18174264,0.051171154,0.64243394],"study_design_scores_gemma":[0.00029916354,0.00012815832,0.00040293843,0.000059396873,0.000067474626,0.00013927104,0.00016995633,0.7546143,0.015963076,0.21619055,0.011918018,0.000047754915],"about_ca_topic_score_codex":0.0028994349,"about_ca_topic_score_gemma":0.005631504,"teacher_disagreement_score":0.019618358,"about_ca_system_score_codex":0.0015240721,"about_ca_system_score_gemma":0.0024940595,"threshold_uncertainty_score":0.06562996},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16358349,0.0013214181,0.8029477,0.0005698944,0.00039649915,0.00025112016,0.00035802252,0.0012598962,0.02931205],"genre_scores_gemma":[0.44552386,0.0012911183,0.5302787,0.00021370043,0.00013300293,0.00019219186,0.0008095277,0.0008919152,0.02066612],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99947447,0.00009468122,0.000035768266,0.00010786012,0.00018117843,0.0001060076],"domain_scores_gemma":[0.9986494,0.00070326735,0.00010843729,0.00028607753,0.00014861394,0.000104180945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005536785,0.00090788695,0.0016977466,0.0009207666,0.0007820663,0.0011212517,0.0020656206,0.0010386489,0.006226035],"category_scores_gemma":[0.00396811,0.0007690657,0.00068070577,0.0016527522,0.0009864386,0.0018633434,0.0023899034,0.0013763201,0.0009995846],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00076521665,0.00026983843,0.001101236,0.00073350075,0.00005479965,0.0004960753,0.0004989796,0.23344423,0.028342886,0.16624029,0.018233567,0.5498194],"study_design_scores_gemma":[0.00017850348,0.00024117042,0.0007314777,0.00012580014,0.000074743184,0.0005822026,0.00032301003,0.724143,0.019957721,0.23194948,0.021646842,0.000046059446],"about_ca_topic_score_codex":0.0012958866,"about_ca_topic_score_gemma":0.0017671731,"teacher_disagreement_score":0.006226035,"about_ca_system_score_codex":0.0006398524,"about_ca_system_score_gemma":0.00059624726,"threshold_uncertainty_score":0.020828128},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008427152,0.000052553998,0.98608714,0.0000695236,0.000055763776,0.00002975296,0.00007697852,0.0017112065,0.0034899074],"genre_scores_gemma":[0.14886926,0.000106995816,0.83411694,0.000108994325,0.000033485816,0.000078156285,0.0005335199,0.0014219886,0.014730586],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99956626,0.000076745295,0.000023311539,0.00008790085,0.0001940857,0.00005161977],"domain_scores_gemma":[0.99895704,0.00038918084,0.000046180612,0.00032040293,0.00022929415,0.000057899055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076613325,0.00078172726,0.0007278343,0.00054934353,0.00052843854,0.001163853,0.0016306652,0.0016273445,0.016744303],"category_scores_gemma":[0.003971302,0.00053249137,0.0007896699,0.0008362688,0.0005018966,0.0014320953,0.0014479388,0.0014983774,0.008028359],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004830667,0.00020247693,0.0017417615,0.0003599736,0.00011050828,0.0002498663,0.00034836572,0.25611064,0.052789964,0.05824808,0.014815191,0.61454016],"study_design_scores_gemma":[0.000011076433,0.000023382732,0.00027935163,0.000012081491,0.0000096214635,0.00009373774,0.000041603726,0.97747576,0.009571609,0.006756392,0.0057087853,0.000016636675],"about_ca_topic_score_codex":0.003530677,"about_ca_topic_score_gemma":0.004397219,"teacher_disagreement_score":0.016744303,"about_ca_system_score_codex":0.0006878767,"about_ca_system_score_gemma":0.00092054997,"threshold_uncertainty_score":0.056015313},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5498839,0.0018414217,0.42469564,0.00044177935,0.0000668128,0.00014307149,0.0050479188,0.0034461033,0.014433326],"genre_scores_gemma":[0.7957843,0.00074382225,0.18741946,0.00012397811,0.0000751323,0.00015169532,0.01024918,0.00052654557,0.004925977],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990669,0.00008428709,0.000050168816,0.00021735676,0.00033664843,0.00024464593],"domain_scores_gemma":[0.998591,0.00070092164,0.0001434634,0.00030702964,0.0001573826,0.00010025126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031425784,0.0007510447,0.0009254435,0.0016697334,0.0008563628,0.0021213768,0.0010805031,0.000986942,0.005673928],"category_scores_gemma":[0.0034842554,0.0007299025,0.0010211141,0.0019973048,0.0008706553,0.0039109467,0.001985232,0.0007788597,0.0013161472],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014330007,0.00018349396,0.023823466,0.00076846796,0.00028433482,0.0009632311,0.0013937483,0.40397546,0.034732502,0.14112161,0.021943046,0.36937758],"study_design_scores_gemma":[0.00006236854,0.00014659061,0.006145357,0.00009328082,0.00007931467,0.00084767153,0.0005975113,0.7886154,0.02124371,0.15900631,0.023110958,0.000051468203],"about_ca_topic_score_codex":0.006567459,"about_ca_topic_score_gemma":0.008187662,"teacher_disagreement_score":0.006567459,"about_ca_system_score_codex":0.0012633313,"about_ca_system_score_gemma":0.0006504687,"threshold_uncertainty_score":0.018981159},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21614009,0.0002329323,0.75392145,0.00025462394,0.00009580267,0.00004879268,0.00021384326,0.00031076753,0.028781703],"genre_scores_gemma":[0.89227676,0.00039784334,0.09726744,0.0002480277,0.00007690848,0.00009492983,0.00054120703,0.00024284866,0.008854034],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99934787,0.00010229256,0.000042092066,0.0001186629,0.00025647864,0.00013266556],"domain_scores_gemma":[0.9986953,0.00036450673,0.00024839758,0.00029483796,0.00025672116,0.0001403334],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049437484,0.0003593358,0.0004004803,0.0006390748,0.00052291696,0.0013096805,0.00084006565,0.0006297691,0.0042886804],"category_scores_gemma":[0.0034194528,0.00036291842,0.0006201208,0.0005415425,0.0014431339,0.0019271309,0.0023708933,0.0015618555,0.0007321879],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008580892,0.00001923477,0.0011727005,0.0000883983,0.000022125705,0.0004100824,0.00029561832,0.01837303,0.010367875,0.9503058,0.0014592351,0.01740003],"study_design_scores_gemma":[0.000034832054,0.00016244024,0.0012223786,0.000056190383,0.000042171072,0.0013687146,0.00040101758,0.25152788,0.0144241685,0.7181949,0.012519491,0.0000458154],"about_ca_topic_score_codex":0.0008556308,"about_ca_topic_score_gemma":0.00050614285,"teacher_disagreement_score":0.0042886804,"about_ca_system_score_codex":0.00037966765,"about_ca_system_score_gemma":0.00028822917,"threshold_uncertainty_score":0.014347017},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04602044,0.0017237775,0.81347495,0.002648212,0.0005224056,0.00019711931,0.00094750186,0.0009458632,0.13351966],"genre_scores_gemma":[0.54589117,0.0043808524,0.382245,0.001879005,0.001450537,0.0010826217,0.002920081,0.0010867149,0.059063993],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99840385,0.00035765328,0.00009309287,0.0003315066,0.0005216368,0.00029227356],"domain_scores_gemma":[0.9946209,0.0036307229,0.00047369904,0.00042336414,0.0004271502,0.0004241091],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010936117,0.0015271425,0.0011300558,0.0020483658,0.0017234054,0.0051227156,0.002331138,0.0013242624,0.017249485],"category_scores_gemma":[0.00930919,0.000836431,0.0016509993,0.0029219908,0.002764025,0.006696212,0.004019543,0.0040955273,0.0030877215],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010681959,0.00006544264,0.000689588,0.00028576265,0.000024539468,0.00017065163,0.0002301192,0.04940468,0.0013202396,0.8963395,0.01260184,0.03876092],"study_design_scores_gemma":[0.00003505376,0.000074408934,0.00038335216,0.00009390423,0.00003508426,0.00028587558,0.00015155323,0.17052917,0.00089854555,0.80245453,0.025017384,0.00004109675],"about_ca_topic_score_codex":0.0023677025,"about_ca_topic_score_gemma":0.002321461,"teacher_disagreement_score":0.017249485,"about_ca_system_score_codex":0.0021620544,"about_ca_system_score_gemma":0.0007934202,"threshold_uncertainty_score":0.057705283},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07900807,0.00085084577,0.870676,0.00030533937,0.00017156081,0.00008810752,0.000487157,0.00027797,0.048134916],"genre_scores_gemma":[0.5505699,0.0013145106,0.43018103,0.00020209384,0.00011494585,0.00021928585,0.001299304,0.00042095094,0.015678046],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999476,0.00011269422,0.00002537876,0.00015120806,0.00018851612,0.00004622479],"domain_scores_gemma":[0.99940217,0.00020238287,0.00012147819,0.00012842541,0.00009632076,0.00004920648],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033215177,0.00037817488,0.00038650772,0.00067427376,0.0008067333,0.0007869727,0.00057004066,0.00054437696,0.0047964645],"category_scores_gemma":[0.0021624495,0.00035466516,0.00047173406,0.00074063515,0.0012577706,0.0016214293,0.001088736,0.00083999604,0.0012001222],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000086316955,0.00003154861,0.0021439628,0.00029158336,0.000036575886,0.00045792514,0.0006909958,0.02875519,0.016217286,0.8461952,0.0048756152,0.10021777],"study_design_scores_gemma":[0.000021200769,0.00013907629,0.0036594775,0.00012114635,0.00003955061,0.0016541248,0.0006942491,0.055200074,0.009252246,0.8218434,0.10731819,0.000057207864],"about_ca_topic_score_codex":0.0008892204,"about_ca_topic_score_gemma":0.00091619015,"teacher_disagreement_score":0.0047964645,"about_ca_system_score_codex":0.0003026218,"about_ca_system_score_gemma":0.00028531603,"threshold_uncertainty_score":0.016045809},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32293603,0.0010839676,0.6137972,0.0037543804,0.00017412365,0.00014432274,0.0003789203,0.00024272256,0.057488296],"genre_scores_gemma":[0.9490884,0.0006595883,0.03275834,0.00024123654,0.000096171825,0.00010922188,0.0003414924,0.00012886296,0.016576698],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988875,0.00041548882,0.000035093413,0.00021377436,0.00022480753,0.0002233075],"domain_scores_gemma":[0.99653876,0.0021268716,0.00041608815,0.00028040478,0.00017014306,0.00046770406],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011567165,0.0011097372,0.0010078346,0.0009908429,0.0015042946,0.0026876698,0.0018542839,0.0021463875,0.007939132],"category_scores_gemma":[0.0076411753,0.00074200565,0.0007767151,0.0010396354,0.0038961787,0.0047740326,0.002858061,0.0025742133,0.00039725058],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012081456,0.00005569888,0.0006077769,0.00007694051,0.000023168119,0.0001473943,0.00027746797,0.053699702,0.00077028095,0.92836934,0.0040443544,0.011807106],"study_design_scores_gemma":[0.000028037593,0.000021335572,0.00022411377,0.000017452458,0.000012485157,0.000049885268,0.00013416614,0.092286,0.00028197962,0.90472996,0.0022025586,0.000012035404],"about_ca_topic_score_codex":0.006344496,"about_ca_topic_score_gemma":0.004344411,"teacher_disagreement_score":0.007939132,"about_ca_system_score_codex":0.0015771046,"about_ca_system_score_gemma":0.0012990643,"threshold_uncertainty_score":0.026559055},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47071907,0.00045076336,0.52118886,0.00091520126,0.00006154712,0.0001044144,0.000972756,0.0007049771,0.004882325],"genre_scores_gemma":[0.93117726,0.0004501691,0.062823825,0.00011792935,0.00013273663,0.00021736704,0.0011379307,0.00025800572,0.003684832],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972811,0.0004747137,0.00017060302,0.0006207782,0.0010411396,0.00041164193],"domain_scores_gemma":[0.9664656,0.022182971,0.0032350316,0.0049576815,0.0015449428,0.0016138094],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002859824,0.00072924164,0.0015103631,0.002812078,0.0012900935,0.004359883,0.002836476,0.0015724383,0.0056750854],"category_scores_gemma":[0.033065658,0.001199785,0.0017140695,0.0018735372,0.0035855987,0.010088444,0.0045260526,0.0026025886,0.00043950407],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006027321,0.00008510028,0.010036152,0.00031533596,0.0001277872,0.00044496584,0.0011142881,0.22753248,0.011187598,0.7206874,0.0028992752,0.02496684],"study_design_scores_gemma":[0.00003301511,0.00006023475,0.0018073209,0.000035143465,0.00004232833,0.00022841686,0.00021786931,0.479209,0.0044352715,0.51259905,0.0012895219,0.000042792213],"about_ca_topic_score_codex":0.0016305519,"about_ca_topic_score_gemma":0.0011945894,"teacher_disagreement_score":0.0056750854,"about_ca_system_score_codex":0.0022457594,"about_ca_system_score_gemma":0.0010823393,"threshold_uncertainty_score":0.018985033},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.320257,0.00060498493,0.6501452,0.0012372162,0.00006286134,0.00019734366,0.0004307797,0.00081538135,0.026249241],"genre_scores_gemma":[0.8235272,0.0003982835,0.16833502,0.00033097458,0.000041471827,0.00021796099,0.0004847542,0.00012871932,0.006535587],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99895954,0.00027186688,0.00004524499,0.00021154605,0.0003036219,0.00020811881],"domain_scores_gemma":[0.99756384,0.0008566312,0.0002895979,0.0007621052,0.00030350176,0.00022442636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008083019,0.00047412748,0.0006750662,0.0004761356,0.0011520403,0.0013930585,0.0020533858,0.0010508177,0.0050812517],"category_scores_gemma":[0.0037584386,0.0003492078,0.00046101835,0.0008428138,0.0010574098,0.0027688858,0.0021128713,0.0008505665,0.0009466543],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009998786,0.00019223086,0.0016517747,0.0003340599,0.00008446906,0.00030332064,0.00042467695,0.37927327,0.043513294,0.42675713,0.010551624,0.13591431],"study_design_scores_gemma":[0.0000862112,0.00026520525,0.0005087021,0.000018428354,0.00003131031,0.0003407408,0.0001679819,0.8409865,0.013757815,0.134186,0.009614291,0.000036909456],"about_ca_topic_score_codex":0.0026481485,"about_ca_topic_score_gemma":0.0027506617,"teacher_disagreement_score":0.0050812517,"about_ca_system_score_codex":0.0014169876,"about_ca_system_score_gemma":0.0009911191,"threshold_uncertainty_score":0.01699853},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012700464,0.0013774008,0.94244325,0.0007796369,0.0013533074,0.0003707754,0.0029453384,0.003944863,0.034085024],"genre_scores_gemma":[0.14084847,0.0011890869,0.82982254,0.00028986554,0.0002275055,0.00029715878,0.0034314878,0.0019465914,0.02194733],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99945825,0.00013323978,0.000046762507,0.00009520674,0.00021683497,0.000049697886],"domain_scores_gemma":[0.99922967,0.00031230404,0.00007269791,0.00020978902,0.00012520196,0.000050391827],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005724846,0.0009774887,0.00045464994,0.0015660595,0.0006087309,0.002384076,0.0013087054,0.0015983286,0.05210303],"category_scores_gemma":[0.0047965692,0.000692373,0.000661875,0.0010572512,0.000978405,0.0016666586,0.0017255676,0.0014935255,0.014297806],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005169978,0.00009025196,0.0019349321,0.0016962452,0.00007422112,0.001329595,0.0011582102,0.040161,0.04906078,0.3415379,0.10578242,0.45665738],"study_design_scores_gemma":[0.0000905816,0.00012988003,0.0018471254,0.0003544964,0.00004544346,0.0038501916,0.0005608124,0.24917737,0.021755567,0.1439235,0.5781725,0.00009254486],"about_ca_topic_score_codex":0.0011583335,"about_ca_topic_score_gemma":0.0027322203,"teacher_disagreement_score":0.05210303,"about_ca_system_score_codex":0.0003113235,"about_ca_system_score_gemma":0.00033908788,"threshold_uncertainty_score":0.17430198},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047598343,0.0001731212,0.9347717,0.0002570856,0.00007192916,0.00018091768,0.0004484715,0.0036273003,0.012871098],"genre_scores_gemma":[0.29934567,0.0003585443,0.6851399,0.00016422456,0.00005150718,0.00011563018,0.0025559918,0.0010146507,0.011253874],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99917245,0.00009831423,0.00005211524,0.00033365,0.00021278119,0.00013070495],"domain_scores_gemma":[0.99880874,0.0003594065,0.00011378763,0.0003770251,0.00025622323,0.00008482592],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000384161,0.0012697804,0.0010294708,0.0019209115,0.00074877654,0.0026601637,0.0024619447,0.0017265485,0.009786546],"category_scores_gemma":[0.002860821,0.0009622423,0.0012858938,0.0020128894,0.0011745039,0.0033143878,0.0020334087,0.0022743575,0.002702695],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026754814,0.0001413218,0.002878115,0.0006219622,0.00007665499,0.0005532524,0.00074757595,0.17118725,0.03838839,0.14759575,0.016695146,0.620847],"study_design_scores_gemma":[0.000026272319,0.00008800524,0.0010013808,0.0000767905,0.000051341278,0.0003658741,0.00060650834,0.8154096,0.031523436,0.12806834,0.022748908,0.000033500415],"about_ca_topic_score_codex":0.00532996,"about_ca_topic_score_gemma":0.008175215,"teacher_disagreement_score":0.009786546,"about_ca_system_score_codex":0.00089858595,"about_ca_system_score_gemma":0.00062024023,"threshold_uncertainty_score":0.03273928},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010851841,0.00009814954,0.9854996,0.00009489357,0.00004062953,0.000083131374,0.0001674148,0.001798733,0.0013655842],"genre_scores_gemma":[0.083198845,0.0001308448,0.9138885,0.000047613266,0.000029064633,0.00013513221,0.00086579646,0.00026113627,0.0014431442],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993449,0.000076845754,0.00005647046,0.00019410028,0.0002279987,0.000099717225],"domain_scores_gemma":[0.9990262,0.00035270976,0.00009255371,0.00024180753,0.00022747865,0.000059274385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039909515,0.0010334728,0.00088435225,0.0017247078,0.000764205,0.0011807386,0.0020088628,0.00090860954,0.004142713],"category_scores_gemma":[0.0031960038,0.0007478794,0.0013800681,0.0017980343,0.000775042,0.003297927,0.0026895225,0.0015153872,0.0008701962],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047172306,0.0001887975,0.002485027,0.0003873915,0.00017427291,0.00031684275,0.00039114227,0.21617328,0.02404537,0.05569896,0.011474672,0.68819255],"study_design_scores_gemma":[0.00017451483,0.00015321713,0.00088600256,0.000039318915,0.00007431423,0.00029049476,0.00012801198,0.9164148,0.012425854,0.05545376,0.013894541,0.00006525554],"about_ca_topic_score_codex":0.006491593,"about_ca_topic_score_gemma":0.0099097015,"teacher_disagreement_score":0.006491593,"about_ca_system_score_codex":0.00080775673,"about_ca_system_score_gemma":0.0014345865,"threshold_uncertainty_score":0.013858736},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0049461066,0.00015626913,0.9867632,0.00019145488,0.00008433697,0.000143338,0.0001915345,0.004214089,0.003309696],"genre_scores_gemma":[0.05489603,0.00010860539,0.9394588,0.00011933407,0.000042725373,0.00028102903,0.0011103996,0.00087376515,0.0031092889],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976808,0.00021513247,0.0002090976,0.00057700503,0.00096404646,0.00035395598],"domain_scores_gemma":[0.99728775,0.0011458185,0.00009078155,0.00074850017,0.0005949,0.00013215806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094334735,0.0020812855,0.0026371994,0.0023005514,0.0021068046,0.0025107362,0.0042621633,0.0025164208,0.02654521],"category_scores_gemma":[0.0055654766,0.0013528767,0.0028481379,0.0042691627,0.0016608356,0.0046549994,0.006319183,0.0040754355,0.008212509],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00076595356,0.00036336313,0.0010517566,0.000679395,0.00016318253,0.0003677059,0.000763726,0.069276,0.018486995,0.07080611,0.027441861,0.80983394],"study_design_scores_gemma":[0.00062405475,0.00026729502,0.0006373245,0.000080964695,0.00012083232,0.0005111922,0.00038588836,0.7937176,0.025313564,0.14467472,0.033479348,0.00018724625],"about_ca_topic_score_codex":0.007462536,"about_ca_topic_score_gemma":0.00854545,"teacher_disagreement_score":0.02654521,"about_ca_system_score_codex":0.0019239802,"about_ca_system_score_gemma":0.002238754,"threshold_uncertainty_score":0.08880252},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028553344,0.000073394054,0.9689791,0.00003216452,0.000021923319,0.00001489665,0.00005037987,0.00079600484,0.0014788408],"genre_scores_gemma":[0.43524072,0.00022709821,0.5603112,0.000050559433,0.000040492978,0.000041154934,0.0002740076,0.0010192897,0.0027954823],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996301,0.0000538863,0.000012843185,0.000054834778,0.00021344706,0.000034926314],"domain_scores_gemma":[0.99928856,0.00023312808,0.00009061008,0.00026231576,0.000100990546,0.000024243369],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037294882,0.00055990595,0.00055752555,0.0006757125,0.00020200381,0.000655806,0.00064378564,0.0005253111,0.00236982],"category_scores_gemma":[0.0020938464,0.0004665791,0.00078573404,0.00048467953,0.00054264796,0.00080525223,0.0009934419,0.00070552796,0.00061144604],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001109375,0.00004823565,0.0009414726,0.00022311398,0.000053746346,0.00024506214,0.0007674903,0.43548208,0.17856461,0.030209078,0.002059207,0.351295],"study_design_scores_gemma":[0.00000563225,0.000033646927,0.00038223475,0.000009992922,0.000008606981,0.00016291575,0.000032688687,0.9503165,0.0392053,0.005047689,0.0047732005,0.000021580308],"about_ca_topic_score_codex":0.0009586384,"about_ca_topic_score_gemma":0.0014664257,"teacher_disagreement_score":0.00236982,"about_ca_system_score_codex":0.0004345605,"about_ca_system_score_gemma":0.00025947372,"threshold_uncertainty_score":0.007927835},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019862823,0.0030252852,0.6225678,0.042744096,0.010141074,0.00044272275,0.0010366974,0.008288226,0.29189125],"genre_scores_gemma":[0.16379897,0.0029133004,0.48819655,0.008866388,0.0006700102,0.0003012925,0.0010875148,0.0035260369,0.33063993],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997181,0.0000669546,0.000011745225,0.00005084426,0.00010964371,0.00004259199],"domain_scores_gemma":[0.9995277,0.00006486284,0.000015693904,0.00010446935,0.0001497892,0.00013746781],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004786548,0.00066911575,0.00040895358,0.00040883585,0.0019651235,0.002498222,0.0011118926,0.0019009499,0.06261593],"category_scores_gemma":[0.00270247,0.0003536132,0.00049017265,0.00034326973,0.0011920865,0.0037635826,0.0017404774,0.0019949204,0.028925925],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020786912,0.00013080257,0.0011479935,0.0003286266,0.000049141232,0.00043343357,0.0014164564,0.0050774957,0.005866943,0.06095115,0.5169089,0.40748116],"study_design_scores_gemma":[0.00008543899,0.00013329717,0.00061584107,0.00037316117,0.000038021186,0.0009426246,0.003285491,0.012944209,0.0032773155,0.111057274,0.8671448,0.00010250312],"about_ca_topic_score_codex":0.0023931148,"about_ca_topic_score_gemma":0.007003875,"teacher_disagreement_score":0.06261593,"about_ca_system_score_codex":0.0003204568,"about_ca_system_score_gemma":0.0007919529,"threshold_uncertainty_score":0.20947117},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.115177676,0.0012704498,0.8690884,0.0015841393,0.00016366706,0.00007588155,0.0003780083,0.0012628462,0.010998843],"genre_scores_gemma":[0.7302208,0.0008935719,0.2557303,0.00065987086,0.0002718455,0.00026360533,0.0010339367,0.00046671653,0.010459399],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99646413,0.00066287426,0.00020657395,0.0010431858,0.0011654439,0.000457726],"domain_scores_gemma":[0.98716146,0.009166335,0.0006109619,0.0018455128,0.00084472465,0.00037096458],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026794523,0.001457614,0.0016799187,0.0014487995,0.0009807238,0.0029698166,0.0027581025,0.0020844936,0.005011925],"category_scores_gemma":[0.026556255,0.0006592727,0.0018317638,0.0012834185,0.0027401848,0.0072466405,0.0031971298,0.005221624,0.0014471676],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013579793,0.0002103916,0.006439144,0.00064696005,0.00012948927,0.0002733996,0.00079092506,0.41273257,0.011330566,0.457841,0.008343277,0.099904284],"study_design_scores_gemma":[0.000028976687,0.00009586846,0.0006443002,0.000048744725,0.000023713545,0.00013876044,0.00005908854,0.81279856,0.0024580462,0.18094248,0.0027338671,0.000027572172],"about_ca_topic_score_codex":0.0040973853,"about_ca_topic_score_gemma":0.0027502875,"teacher_disagreement_score":0.005011925,"about_ca_system_score_codex":0.0036581252,"about_ca_system_score_gemma":0.0016865901,"threshold_uncertainty_score":0.02654171},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19398667,0.0002197391,0.78390324,0.00021920727,0.000082394865,0.000055271626,0.00038666322,0.00090005016,0.020246817],"genre_scores_gemma":[0.8508365,0.00041842225,0.13808094,0.000070629234,0.000051788942,0.000045185763,0.00089666166,0.0005315633,0.009068217],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99983346,0.000029465013,0.000008402639,0.000040417417,0.000054997625,0.00003337967],"domain_scores_gemma":[0.9995621,0.00012281215,0.00006610917,0.00014230546,0.00006694268,0.000039654627],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017827268,0.00036888017,0.00033994755,0.0005055946,0.0001977231,0.0011532815,0.0008326216,0.00054131926,0.0071371747],"category_scores_gemma":[0.001251576,0.00024824005,0.00033189825,0.00053607806,0.00045572122,0.0014585492,0.0010665654,0.0010102397,0.0008797299],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038888401,0.00013372753,0.000607282,0.00021200752,0.000021517648,0.00033420871,0.0006661503,0.12024127,0.035389725,0.6316132,0.006499156,0.20389284],"study_design_scores_gemma":[0.00005496582,0.00011811869,0.0005930339,0.000046961744,0.000021560529,0.0002800236,0.00029406106,0.680161,0.012157345,0.29268098,0.013564614,0.00002737943],"about_ca_topic_score_codex":0.0006497425,"about_ca_topic_score_gemma":0.000982074,"teacher_disagreement_score":0.0071371747,"about_ca_system_score_codex":0.00025793535,"about_ca_system_score_gemma":0.00019495287,"threshold_uncertainty_score":0.02387625},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015038189,0.0020104721,0.958149,0.0013527962,0.00026232595,0.000108821274,0.00048475465,0.001428294,0.0211653],"genre_scores_gemma":[0.29628325,0.0031723084,0.6639411,0.00044515735,0.0004556626,0.00038840718,0.0031892594,0.00085277035,0.03127216],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985373,0.00039513138,0.00007428357,0.00030995326,0.0005198022,0.00016346962],"domain_scores_gemma":[0.9976566,0.0011220403,0.00014706195,0.000661147,0.00030669346,0.00010641408],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012912571,0.0009821291,0.0008795602,0.0018035783,0.0007455614,0.0025930034,0.0019282885,0.0011127013,0.0108118225],"category_scores_gemma":[0.008909194,0.00050838763,0.0008476155,0.0030084017,0.0009971054,0.0046597146,0.0025160941,0.002298898,0.0029277646],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020536174,0.00014390584,0.0011602158,0.00032778614,0.000113750335,0.00006561728,0.00026011182,0.25334427,0.002147457,0.36029586,0.0396595,0.3422762],"study_design_scores_gemma":[0.000042112806,0.000038723312,0.00024716466,0.000046248162,0.000029503173,0.00010083653,0.000093467075,0.61673373,0.0012351663,0.35662928,0.024792502,0.000011271867],"about_ca_topic_score_codex":0.0033525787,"about_ca_topic_score_gemma":0.004881151,"teacher_disagreement_score":0.0108118225,"about_ca_system_score_codex":0.0021470329,"about_ca_system_score_gemma":0.0011278522,"threshold_uncertainty_score":0.03616917},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47700453,0.0010007565,0.50216603,0.00038514976,0.000092363065,0.00008765374,0.0005062399,0.00016690868,0.018590406],"genre_scores_gemma":[0.92213273,0.00075581734,0.07180811,0.00006403454,0.00010097227,0.00009413769,0.0005584886,0.000054895998,0.0044308463],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994012,0.00012405452,0.000026952643,0.00009437751,0.00027666386,0.00007673269],"domain_scores_gemma":[0.9990822,0.0003851156,0.00016225489,0.00006626871,0.00018934491,0.00011478425],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002891377,0.00016699398,0.0005082682,0.0010481767,0.0005836803,0.0015272254,0.00065548706,0.00041832286,0.0022979798],"category_scores_gemma":[0.0022193126,0.00019033236,0.0003017526,0.0007624094,0.0011133039,0.0014210071,0.000932728,0.0004770099,0.00026855938],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017494374,0.000028950535,0.002145291,0.000120173216,0.00002655969,0.00035900885,0.0003964618,0.06070404,0.012555402,0.88678503,0.0016051988,0.035098903],"study_design_scores_gemma":[0.00006661264,0.00006440183,0.0018052288,0.000030412453,0.000016974216,0.0006553843,0.00020118864,0.29865956,0.004806138,0.68067455,0.012983968,0.00003548337],"about_ca_topic_score_codex":0.002335427,"about_ca_topic_score_gemma":0.0011848351,"teacher_disagreement_score":0.002335427,"about_ca_system_score_codex":0.0007407435,"about_ca_system_score_gemma":0.00041083308,"threshold_uncertainty_score":0.0076874495},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07490221,0.00079561427,0.91204554,0.0016152012,0.00009624707,0.00019586505,0.0010050253,0.00074350537,0.008600788],"genre_scores_gemma":[0.47121742,0.000600629,0.5229633,0.0003190589,0.00007668214,0.00033652122,0.0014021894,0.00014846973,0.002935731],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991923,0.0001985515,0.000047308313,0.00023435077,0.0001873948,0.00014013448],"domain_scores_gemma":[0.997663,0.0016953136,0.00017474263,0.00023712926,0.000103601415,0.00012627718],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009862286,0.00089585077,0.0011316867,0.0005005882,0.0005597555,0.001340759,0.0015785106,0.0017332871,0.0040722084],"category_scores_gemma":[0.005178499,0.0005790642,0.0009682687,0.0010704201,0.0012941381,0.0026161578,0.0015149234,0.002173584,0.00034274752],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016811247,0.000099332705,0.0010338561,0.00022681196,0.000022892671,0.00010795695,0.00011329155,0.92954475,0.0016623782,0.030459693,0.0036830194,0.032877855],"study_design_scores_gemma":[0.000038539612,0.00003753417,0.00013771049,0.000019168094,0.000007771206,0.00005296125,0.00006128211,0.97083664,0.00061174703,0.0270525,0.0011375297,0.000006650077],"about_ca_topic_score_codex":0.005266465,"about_ca_topic_score_gemma":0.0056693465,"teacher_disagreement_score":0.005266465,"about_ca_system_score_codex":0.0014564007,"about_ca_system_score_gemma":0.0015182955,"threshold_uncertainty_score":0.01362294},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09025737,0.00026851048,0.8977026,0.00019606313,0.00018019514,0.0001164222,0.00023736902,0.00051018805,0.010531285],"genre_scores_gemma":[0.62541664,0.000384111,0.3567964,0.00019032815,0.00006440103,0.00021313423,0.0006476074,0.00070070015,0.01558675],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992592,0.00021842375,0.000046598376,0.000100798025,0.00028834384,0.00008663996],"domain_scores_gemma":[0.99775416,0.0010453665,0.00018084006,0.0004662821,0.00040663173,0.00014681047],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009564347,0.00040843658,0.00048137957,0.0013704371,0.0008726399,0.0013757134,0.0014554067,0.0015762352,0.009180933],"category_scores_gemma":[0.00734388,0.00070730253,0.0005901502,0.0009859232,0.00177274,0.0018846114,0.0029458352,0.0013321171,0.001385928],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044617138,0.00008254332,0.0014389808,0.00029586046,0.000029579569,0.00044897955,0.0005595277,0.22516988,0.0133585315,0.61472535,0.0050721243,0.1383725],"study_design_scores_gemma":[0.00004866663,0.000080202044,0.0004179968,0.000087903296,0.00001560242,0.00022378408,0.00018659775,0.5575721,0.0070781442,0.42657107,0.0076820883,0.000035811292],"about_ca_topic_score_codex":0.00097345747,"about_ca_topic_score_gemma":0.0016948937,"teacher_disagreement_score":0.009180933,"about_ca_system_score_codex":0.0006176243,"about_ca_system_score_gemma":0.0004261985,"threshold_uncertainty_score":0.03071326},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5769059,0.00094057637,0.34874484,0.0011283805,0.00017961199,0.00015799509,0.0025875163,0.0015318354,0.06782341],"genre_scores_gemma":[0.88697493,0.0006610829,0.09178465,0.0004000645,0.00009688433,0.00021100281,0.003973154,0.0004894401,0.015408894],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99978405,0.000029264675,0.000013504639,0.00006477425,0.000063439016,0.000045036846],"domain_scores_gemma":[0.9995295,0.000093182185,0.00008219167,0.00016229687,0.00007458117,0.000058255006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013455312,0.00036261947,0.00042798094,0.00071832887,0.00084202987,0.0012446927,0.0006985705,0.00084853586,0.006956107],"category_scores_gemma":[0.0012099094,0.00028054192,0.00066201505,0.0009407032,0.0008781043,0.0019896936,0.0009144594,0.0011581734,0.0010825827],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016385125,0.00008342073,0.0030368506,0.00023870067,0.000026602522,0.00077386416,0.0008188033,0.015645003,0.0154777635,0.84001297,0.0139520895,0.10977011],"study_design_scores_gemma":[0.00003219309,0.000063761894,0.002893322,0.00007824924,0.000042690623,0.0015357886,0.0006914579,0.074462585,0.006141456,0.8551218,0.058893602,0.00004315465],"about_ca_topic_score_codex":0.001365426,"about_ca_topic_score_gemma":0.0013021152,"teacher_disagreement_score":0.006956107,"about_ca_system_score_codex":0.00061226805,"about_ca_system_score_gemma":0.00029470472,"threshold_uncertainty_score":0.023270488},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03209,0.00064267905,0.900555,0.00046653676,0.00027992963,0.00015840298,0.0007333664,0.004850458,0.060223706],"genre_scores_gemma":[0.21730117,0.0015720507,0.7355,0.0002622802,0.00015045433,0.0001910979,0.0020635137,0.0025382538,0.040421203],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99967635,0.00003844272,0.000013985549,0.00007068844,0.00016337304,0.000037201087],"domain_scores_gemma":[0.9996475,0.00013070228,0.000023164966,0.000101213715,0.00006432786,0.000033167285],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018795757,0.0012754787,0.0008240034,0.0010203895,0.00045870233,0.0012502654,0.0017779592,0.0007952053,0.026351793],"category_scores_gemma":[0.0011710598,0.0010623377,0.00082353404,0.0012644755,0.00066345476,0.0016412227,0.0019230419,0.0021303631,0.004771664],"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.00023461005,0.00011625076,0.000316535,0.0007991151,0.00010350814,0.00032796524,0.0004545424,0.1324418,0.042241957,0.21459699,0.048118412,0.5602484],"study_design_scores_gemma":[0.00015242609,0.00016326208,0.00058246794,0.00017246479,0.00011209468,0.0006431703,0.00031581253,0.42577448,0.029518602,0.41764727,0.124839954,0.000078007775],"about_ca_topic_score_codex":0.001520751,"about_ca_topic_score_gemma":0.0032794445,"teacher_disagreement_score":0.026351793,"about_ca_system_score_codex":0.000550662,"about_ca_system_score_gemma":0.000320968,"threshold_uncertainty_score":0.08815551},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17833814,0.00067887007,0.77853745,0.001200541,0.00014422789,0.00046000574,0.0039876737,0.009357906,0.02729521],"genre_scores_gemma":[0.48277277,0.00047440102,0.49652675,0.00031297645,0.00003703375,0.00025317798,0.006372793,0.0014222994,0.011827837],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99935955,0.000090860376,0.000044923374,0.00012475897,0.00023865851,0.0001413433],"domain_scores_gemma":[0.99808145,0.0008739637,0.00017057572,0.0005845637,0.00020265198,0.00008683248],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003962319,0.0008845192,0.00067693705,0.0010758743,0.0007286873,0.0015562774,0.002186035,0.0009815772,0.011669041],"category_scores_gemma":[0.00350358,0.0006154094,0.0008711959,0.0021444326,0.0007499913,0.00401529,0.002722259,0.0013748661,0.002157227],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013321056,0.00062389474,0.003851882,0.0014176418,0.00009920628,0.0005624893,0.00089380174,0.26403007,0.037364237,0.09657432,0.04603074,0.54721963],"study_design_scores_gemma":[0.0002296549,0.00020694059,0.0007787142,0.00010865845,0.00007974459,0.00024365266,0.0005056719,0.7901077,0.027801726,0.16838117,0.01151548,0.000040855673],"about_ca_topic_score_codex":0.0037048196,"about_ca_topic_score_gemma":0.010007498,"teacher_disagreement_score":0.011669041,"about_ca_system_score_codex":0.00089920516,"about_ca_system_score_gemma":0.0014113864,"threshold_uncertainty_score":0.03903681},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014657244,0.00026422055,0.9796163,0.0001809387,0.000059488328,0.00007823867,0.00013202455,0.00071417424,0.004297267],"genre_scores_gemma":[0.21643545,0.00026011223,0.7771612,0.00013600478,0.00004755622,0.00027696646,0.00040741204,0.00042269088,0.00485256],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990932,0.00014475334,0.0000662338,0.00020498823,0.00032401466,0.000166928],"domain_scores_gemma":[0.99686325,0.0020847565,0.00020531498,0.00039594222,0.00031915135,0.00013158568],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011039474,0.0011141686,0.0014531445,0.0012048371,0.0010700226,0.0016762767,0.0024371997,0.0020064902,0.011936733],"category_scores_gemma":[0.005793489,0.001489782,0.001672681,0.0013307198,0.0012528754,0.001965795,0.0032102924,0.0018113685,0.0011971353],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002682707,0.00008804201,0.00071431545,0.00021820782,0.000040196017,0.000034149754,0.00012808437,0.78812885,0.002560653,0.051429853,0.0042151893,0.15217407],"study_design_scores_gemma":[0.000030117522,0.000024917399,0.0001177023,0.000011847322,0.000008290364,0.000012637149,0.000021063812,0.98015517,0.00055306475,0.018152546,0.0009043261,0.000008367459],"about_ca_topic_score_codex":0.009643093,"about_ca_topic_score_gemma":0.019963454,"teacher_disagreement_score":0.011936733,"about_ca_system_score_codex":0.002536333,"about_ca_system_score_gemma":0.002682673,"threshold_uncertainty_score":0.03993231},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.274419,0.010222809,0.37676007,0.014258109,0.0012736003,0.00018169628,0.0022198209,0.0011030925,0.31956184],"genre_scores_gemma":[0.8929979,0.0066751335,0.051272444,0.0012482512,0.0018479351,0.0003124252,0.0021828117,0.00070316956,0.04275991],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984463,0.0003004019,0.00007825451,0.00035776605,0.0006164682,0.00020099866],"domain_scores_gemma":[0.98904115,0.0088170385,0.0003824692,0.0010390372,0.00040467616,0.00031566503],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011070874,0.0011869005,0.0019908035,0.0017177884,0.0016565188,0.0039216815,0.002956435,0.00259721,0.017852709],"category_scores_gemma":[0.010999531,0.0010931169,0.0016439509,0.002517363,0.0055346447,0.013011706,0.005161168,0.008900184,0.002283419],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026583372,0.00008655085,0.0007038054,0.00054270227,0.00005058384,0.00023831408,0.00053828687,0.018685622,0.0022365472,0.9282843,0.011244967,0.037122436],"study_design_scores_gemma":[0.000032075568,0.00002462328,0.000301785,0.00003512008,0.000014189511,0.00011579092,0.00008120474,0.011292136,0.00052169117,0.984185,0.0033820597,0.000014339503],"about_ca_topic_score_codex":0.0010119235,"about_ca_topic_score_gemma":0.0006362609,"teacher_disagreement_score":0.017852709,"about_ca_system_score_codex":0.0013529848,"about_ca_system_score_gemma":0.00045648534,"threshold_uncertainty_score":0.0597232},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034275462,0.00015737733,0.9791662,0.0001270586,0.00016538774,0.00011351215,0.00024825486,0.009192276,0.0074023847],"genre_scores_gemma":[0.03425157,0.00018885842,0.9501419,0.00018605356,0.000058638056,0.00014969283,0.0012846317,0.0015972321,0.012141389],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979134,0.00027748267,0.00020922495,0.00036740262,0.0009913469,0.00024117476],"domain_scores_gemma":[0.9978357,0.00036100388,0.00005589764,0.00080967287,0.00087536953,0.00006235975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009914307,0.00085451006,0.0010754792,0.001077822,0.00065815746,0.0021950838,0.0036978615,0.0011391779,0.030845115],"category_scores_gemma":[0.0040349686,0.0007855716,0.0010331253,0.001629616,0.00057356193,0.0024522496,0.0015985462,0.0020774077,0.015677733],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004959575,0.00024293821,0.00067383674,0.00024069712,0.00005272459,0.00021376464,0.00017360224,0.037549403,0.02481226,0.041238505,0.029788146,0.86451805],"study_design_scores_gemma":[0.00037621873,0.0002860567,0.00077133515,0.00009555646,0.000074204996,0.00073254056,0.00009514617,0.68087465,0.04915537,0.026304526,0.24109036,0.00014407847],"about_ca_topic_score_codex":0.003914645,"about_ca_topic_score_gemma":0.004164407,"teacher_disagreement_score":0.030845115,"about_ca_system_score_codex":0.00092193676,"about_ca_system_score_gemma":0.0017894309,"threshold_uncertainty_score":0.103187144},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021270508,0.0014640507,0.9686402,0.0008603509,0.00007391703,0.0001238503,0.0011118234,0.00071892625,0.0057363566],"genre_scores_gemma":[0.32780477,0.0046405722,0.65487516,0.00042081496,0.0003733729,0.0005951768,0.0047677127,0.00070457684,0.005817812],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99581194,0.0010511596,0.00028870025,0.0007925536,0.0017288069,0.00032684777],"domain_scores_gemma":[0.97647244,0.015013782,0.0019124591,0.0048646745,0.0012407622,0.00049597677],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031869248,0.0014291172,0.001658365,0.0037146416,0.0016220054,0.004387822,0.0033243042,0.0023179485,0.006651086],"category_scores_gemma":[0.033955242,0.0013750775,0.0012086746,0.007147531,0.0040512914,0.019765535,0.0066836164,0.0037117715,0.0019165182],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032130015,0.00009443879,0.0018369583,0.00044933218,0.000047202804,0.0001859572,0.0006014874,0.22038588,0.003908053,0.66360253,0.006281319,0.10228555],"study_design_scores_gemma":[0.000037784313,0.00010990112,0.0006058014,0.00015082465,0.00003337887,0.00035455744,0.00016931105,0.3063371,0.005027328,0.6702469,0.016863989,0.0000630677],"about_ca_topic_score_codex":0.0022776525,"about_ca_topic_score_gemma":0.003025983,"teacher_disagreement_score":0.006651086,"about_ca_system_score_codex":0.002986372,"about_ca_system_score_gemma":0.0017432185,"threshold_uncertainty_score":0.022250056},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08491599,0.00031028097,0.8979311,0.00036030347,0.00025321037,0.0005841235,0.00028461093,0.0024665317,0.012893861],"genre_scores_gemma":[0.17408818,0.0001627147,0.82049,0.0000944034,0.000025801957,0.00029493103,0.00032746713,0.00027428727,0.0042422605],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99922216,0.00010453057,0.000054972905,0.000167164,0.0003467893,0.00010440962],"domain_scores_gemma":[0.9990324,0.00034296844,0.000119301854,0.00012733633,0.00029904142,0.000078902754],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000605683,0.0018503828,0.001745649,0.0007995867,0.00072466896,0.0011220628,0.0020151495,0.0010388651,0.013122876],"category_scores_gemma":[0.0037727007,0.0009214784,0.00052645826,0.0013665812,0.0007145634,0.0014133346,0.0026352596,0.00093294354,0.0035440607],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002543804,0.0004948396,0.004996114,0.0013882039,0.0001359198,0.0011263964,0.00048778264,0.26543096,0.12908612,0.03620179,0.021038106,0.5370699],"study_design_scores_gemma":[0.00028496995,0.00065644085,0.0012337171,0.00007144082,0.00005634826,0.0007248399,0.00034075018,0.8714882,0.08942868,0.018988453,0.016613178,0.00011306182],"about_ca_topic_score_codex":0.0017302624,"about_ca_topic_score_gemma":0.0028802222,"teacher_disagreement_score":0.013122876,"about_ca_system_score_codex":0.0005775732,"about_ca_system_score_gemma":0.002002645,"threshold_uncertainty_score":0.04390043},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.082443014,0.00042565478,0.878177,0.0002604755,0.00009747042,0.000069258414,0.00018666436,0.00068114535,0.037659444],"genre_scores_gemma":[0.51139885,0.00047419657,0.47538137,0.000108722095,0.000025131427,0.0001295777,0.0002939221,0.00027115396,0.011917035],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99965394,0.00009695678,0.000017343815,0.00008633751,0.00009853003,0.000046824553],"domain_scores_gemma":[0.99919575,0.00038274124,0.000078373174,0.00018623777,0.00011077895,0.000046078836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000357437,0.000514829,0.00047493936,0.0005860212,0.0005841041,0.0013167653,0.0008469716,0.00074484124,0.00946611],"category_scores_gemma":[0.0024926104,0.000506862,0.0006291575,0.0005101152,0.0012093097,0.0015732455,0.0017823245,0.0008398904,0.001521476],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025692122,0.000062454965,0.0015296566,0.0003871914,0.000033586894,0.00034421525,0.00059873395,0.3023324,0.015125047,0.5515371,0.00542694,0.12236582],"study_design_scores_gemma":[0.00007619903,0.0001974964,0.0004815803,0.00012980968,0.00002699825,0.0004954998,0.00035936615,0.6128222,0.008124662,0.34319046,0.034053124,0.00004263858],"about_ca_topic_score_codex":0.00054791727,"about_ca_topic_score_gemma":0.00094594836,"teacher_disagreement_score":0.00946611,"about_ca_system_score_codex":0.00041113378,"about_ca_system_score_gemma":0.00030463305,"threshold_uncertainty_score":0.031667292},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21647216,0.00063631893,0.7688744,0.0006844893,0.000107856875,0.00009936317,0.0006638273,0.00031554778,0.012145987],"genre_scores_gemma":[0.78854233,0.00083317753,0.18719806,0.00016319554,0.00013833091,0.00020200775,0.0011045064,0.00062629144,0.021192048],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992901,0.00017862464,0.000040246792,0.00017163425,0.00024416394,0.00007512031],"domain_scores_gemma":[0.99713767,0.0015483926,0.00045121124,0.00018502456,0.00035787327,0.00031980814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006234822,0.0010660788,0.00091037474,0.0032744003,0.0011748687,0.003106225,0.0016609163,0.0018051114,0.006861776],"category_scores_gemma":[0.006697884,0.0010120368,0.0008069232,0.0017471986,0.002160523,0.0035837523,0.003139903,0.0021049788,0.00092164124],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000108509244,0.000051564133,0.0011721725,0.00018435859,0.000024604598,0.00023039243,0.0006514455,0.09903225,0.0034061633,0.8626644,0.0035909517,0.02888325],"study_design_scores_gemma":[0.000015608855,0.000024311275,0.00052008516,0.0000314813,0.000007331648,0.00013439535,0.00018732101,0.27555817,0.0011246026,0.7181541,0.0042208172,0.000021846321],"about_ca_topic_score_codex":0.0023001924,"about_ca_topic_score_gemma":0.002091826,"teacher_disagreement_score":0.006861776,"about_ca_system_score_codex":0.0015140019,"about_ca_system_score_gemma":0.00049884367,"threshold_uncertainty_score":0.02295494},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5353046,0.0021082256,0.44366047,0.0006553701,0.00008670763,0.00025826,0.0032764412,0.0045811567,0.010068807],"genre_scores_gemma":[0.78749377,0.0010452219,0.20182261,0.00009762913,0.00008928749,0.00022836572,0.0045995554,0.0003940513,0.004229511],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.998939,0.00013224779,0.00011557652,0.00020257324,0.00043118262,0.00017937634],"domain_scores_gemma":[0.997945,0.0012212874,0.00021919252,0.0004123328,0.00010193369,0.00010015926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066196744,0.0005677092,0.001372889,0.0013413873,0.000665395,0.0021731788,0.0012656461,0.0009417874,0.004711173],"category_scores_gemma":[0.005289745,0.00057110714,0.0007057381,0.0031182913,0.0006645157,0.005267692,0.0046608555,0.00071175786,0.00062946754],"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.0035788945,0.00025083753,0.0123927435,0.0009920656,0.00019985909,0.0033768273,0.0037558572,0.15637483,0.08030754,0.15999761,0.025973178,0.55279976],"study_design_scores_gemma":[0.00037895472,0.0003115661,0.0034048143,0.00012044246,0.00007137852,0.0013067817,0.0019242365,0.78399736,0.036195934,0.140105,0.032107096,0.00007648571],"about_ca_topic_score_codex":0.0021431993,"about_ca_topic_score_gemma":0.002655545,"teacher_disagreement_score":0.004711173,"about_ca_system_score_codex":0.0006745321,"about_ca_system_score_gemma":0.00026934815,"threshold_uncertainty_score":0.015760481},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87555075,0.0011166454,0.10450481,0.0007981724,0.000054024815,0.000054298627,0.0005944685,0.00022549123,0.017101308],"genre_scores_gemma":[0.9705245,0.00029884448,0.024629796,0.00010389868,0.000031519667,0.00005245121,0.0005698368,0.00006310265,0.0037261166],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985966,0.00026314027,0.00009518265,0.0002502585,0.00036675314,0.00042796368],"domain_scores_gemma":[0.9973103,0.001083747,0.0004756521,0.00047416473,0.00033084612,0.00032529992],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016117156,0.00063409406,0.0013087502,0.0017570835,0.0010772183,0.002541435,0.0010375442,0.0014917623,0.005868542],"category_scores_gemma":[0.00794163,0.00076516025,0.000700135,0.0019036097,0.00205597,0.003327559,0.00479615,0.0012721634,0.0007804757],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018044797,0.000184787,0.038449228,0.00072271447,0.00013242301,0.0026894212,0.0016531651,0.14974551,0.033965904,0.63179564,0.006655153,0.13220157],"study_design_scores_gemma":[0.00026906576,0.00041377498,0.017610153,0.0003503026,0.00010780304,0.0028667902,0.0021957962,0.22090878,0.016058238,0.7176344,0.021429144,0.00015574782],"about_ca_topic_score_codex":0.0009595504,"about_ca_topic_score_gemma":0.00090569584,"teacher_disagreement_score":0.005868542,"about_ca_system_score_codex":0.0009368218,"about_ca_system_score_gemma":0.00043524618,"threshold_uncertainty_score":0.01963228},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02322947,0.0001628791,0.9722331,0.0003225311,0.000050709932,0.000072203926,0.0000444214,0.00022982167,0.0036548954],"genre_scores_gemma":[0.45262384,0.0005821395,0.5405622,0.000094633135,0.00007024494,0.00030294387,0.00014979714,0.0001341063,0.005480013],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994809,0.00017567028,0.000024440595,0.00010448807,0.00016628308,0.00004818464],"domain_scores_gemma":[0.9992649,0.0004095227,0.00006301033,0.0001131169,0.000083681254,0.000065778695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009386064,0.00065105816,0.0008820368,0.00054245244,0.0010502067,0.001398591,0.002200801,0.0015142736,0.0019092672],"category_scores_gemma":[0.0018020296,0.000409852,0.00096035656,0.00072045624,0.0013009246,0.0017285197,0.0024104489,0.0011258702,0.0002869687],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004040328,0.000029889577,0.00048222017,0.000032945645,0.000017101871,0.000076440665,0.00011776951,0.96216816,0.0015674192,0.020556398,0.00048975775,0.014421485],"study_design_scores_gemma":[0.0000146911425,0.000015514572,0.000045392597,0.00000437872,0.0000040846826,0.000021344462,0.000022688691,0.9928329,0.00036704345,0.0052035823,0.0014641875,0.000004286659],"about_ca_topic_score_codex":0.0061314604,"about_ca_topic_score_gemma":0.0056475587,"teacher_disagreement_score":0.0061314604,"about_ca_system_score_codex":0.0009932384,"about_ca_system_score_gemma":0.0013458803,"threshold_uncertainty_score":0.012191534},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036892366,0.00073553424,0.8811925,0.00057285785,0.0004534759,0.000096821954,0.00054689904,0.0013916119,0.07811789],"genre_scores_gemma":[0.34469253,0.0015305185,0.57444394,0.00044466986,0.00052877946,0.0002855556,0.0010872425,0.0016786564,0.075308144],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992962,0.00013405396,0.000027533972,0.00011288163,0.0003319013,0.00009743373],"domain_scores_gemma":[0.9988306,0.00051080843,0.000091856826,0.00032785637,0.00015484859,0.00008414365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003858112,0.00093019864,0.0009808247,0.0007529025,0.0004961991,0.0015719899,0.0014882364,0.00094518624,0.025008308],"category_scores_gemma":[0.003463468,0.00068725063,0.00051595666,0.0012647164,0.0007559385,0.0023466349,0.0024091217,0.0017066639,0.004478146],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000258726,0.00015914919,0.0002922652,0.0003637708,0.000028775337,0.00011920814,0.00009438031,0.10131927,0.013673321,0.53032565,0.037015665,0.31634983],"study_design_scores_gemma":[0.000092893104,0.00012382436,0.000317938,0.000044487413,0.000025793765,0.00034074328,0.000058314316,0.32633737,0.006093007,0.64120686,0.025326332,0.00003233116],"about_ca_topic_score_codex":0.000692545,"about_ca_topic_score_gemma":0.0013172012,"teacher_disagreement_score":0.025008308,"about_ca_system_score_codex":0.0005898327,"about_ca_system_score_gemma":0.00065147155,"threshold_uncertainty_score":0.08366114},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06913286,0.00015965628,0.92535675,0.00032682405,0.00005810787,0.000064488086,0.0001877719,0.00040302117,0.0043105944],"genre_scores_gemma":[0.60390216,0.00036904545,0.38692904,0.000057767356,0.000040661045,0.00008939234,0.00037183228,0.00017101021,0.008069058],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99976724,0.000055219432,0.000013131987,0.000054118096,0.000068699024,0.000041687697],"domain_scores_gemma":[0.9996296,0.00016735216,0.000056007,0.00006608137,0.00004485053,0.000036121164],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032526837,0.00032386693,0.00054957054,0.0006658943,0.0007062646,0.0010148609,0.0009391838,0.00073927775,0.0023293986],"category_scores_gemma":[0.0016769423,0.00038239287,0.0004720242,0.00093247206,0.0006107436,0.0009741121,0.0012403451,0.0005534946,0.0003361763],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000249768,0.000054669214,0.0013168014,0.000086662876,0.000033669003,0.00025809964,0.00019972905,0.87253183,0.0057678274,0.052924704,0.0027403345,0.063836046],"study_design_scores_gemma":[0.00002271202,0.00003188946,0.00015027192,0.000006624979,0.00000872488,0.000042371266,0.000052737825,0.9799499,0.000999095,0.017149797,0.0015786526,0.0000072942917],"about_ca_topic_score_codex":0.0049460214,"about_ca_topic_score_gemma":0.006232895,"teacher_disagreement_score":0.0049460214,"about_ca_system_score_codex":0.00056617137,"about_ca_system_score_gemma":0.0006391801,"threshold_uncertainty_score":0.009834468},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023514288,0.00012816362,0.95100456,0.00010525816,0.00014972246,0.000116197465,0.00042324883,0.00082545186,0.023733117],"genre_scores_gemma":[0.31272963,0.00037613523,0.6647704,0.00013308707,0.000063379186,0.00018804369,0.0015667072,0.0006118643,0.019560631],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995977,0.00004414414,0.000020194262,0.000064865526,0.00021550183,0.000057691825],"domain_scores_gemma":[0.99960047,0.000092742055,0.000024890562,0.00012992154,0.00010705251,0.00004492328],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031093613,0.0006226087,0.00075144705,0.00066315994,0.0006647991,0.001182344,0.0013151692,0.00067688647,0.012809173],"category_scores_gemma":[0.0015398265,0.00036939414,0.0005717144,0.00062788604,0.0007779755,0.0009035889,0.001896643,0.0017754523,0.003057516],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029978596,0.00012481348,0.0010151886,0.0002716274,0.000026195907,0.00028717026,0.00018942115,0.15800716,0.019688247,0.4093123,0.01389115,0.39688697],"study_design_scores_gemma":[0.00006607288,0.00015101649,0.00044804488,0.00009077235,0.00002326534,0.0004132289,0.00014363157,0.66925865,0.02250564,0.24693468,0.05993485,0.000030103307],"about_ca_topic_score_codex":0.0012437435,"about_ca_topic_score_gemma":0.0014911757,"teacher_disagreement_score":0.012809173,"about_ca_system_score_codex":0.00032320037,"about_ca_system_score_gemma":0.00074855814,"threshold_uncertainty_score":0.04285097},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020913143,0.0008174566,0.9723165,0.0004345576,0.00006699382,0.000081156664,0.00019013188,0.0007332992,0.004446836],"genre_scores_gemma":[0.2511549,0.0010765645,0.74035716,0.00017030249,0.00015107892,0.00030087927,0.0014083387,0.0003542885,0.005026473],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99877554,0.00023561141,0.00008739041,0.00026152108,0.00040312458,0.00023673601],"domain_scores_gemma":[0.9974832,0.001602836,0.00020005491,0.00032379778,0.00025456102,0.00013562028],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012898768,0.001439631,0.0018526883,0.0012897581,0.0008271825,0.0018024619,0.0030768525,0.002130338,0.005944083],"category_scores_gemma":[0.0083288085,0.00079132937,0.0012940611,0.0028346505,0.0009305062,0.0033961136,0.0023900717,0.0021864832,0.0012087391],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045873667,0.0001859203,0.0014518654,0.00034242088,0.00009839889,0.00015535956,0.00038473686,0.73237824,0.002314,0.05742597,0.011885727,0.1929186],"study_design_scores_gemma":[0.000045236644,0.000024212553,0.00009625547,0.000014713918,0.0000119556025,0.00004721102,0.00003434629,0.9761496,0.00035378494,0.021647722,0.0015693124,0.0000056052945],"about_ca_topic_score_codex":0.0060635684,"about_ca_topic_score_gemma":0.00537371,"teacher_disagreement_score":0.0060635684,"about_ca_system_score_codex":0.0015728222,"about_ca_system_score_gemma":0.00096638495,"threshold_uncertainty_score":0.019884884},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32880205,0.003755467,0.5951257,0.0076302104,0.00036827172,0.0007319224,0.008907907,0.022669682,0.032008708],"genre_scores_gemma":[0.58324564,0.00084272417,0.39727464,0.0004442884,0.00025579776,0.00034615144,0.0078806365,0.00084924954,0.008860852],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979873,0.0002069872,0.00018391537,0.0005711237,0.0007335926,0.00031707497],"domain_scores_gemma":[0.9912259,0.0038797061,0.00083993125,0.0030627367,0.0006071058,0.00038457458],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083626603,0.0012979117,0.0018259196,0.0017009897,0.0013923025,0.00345133,0.0038661538,0.0019587863,0.013469835],"category_scores_gemma":[0.008688425,0.0007681092,0.0014245762,0.004585313,0.0012920506,0.00831189,0.0034672685,0.0014741613,0.0051535885],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00670724,0.0012230983,0.015953273,0.0023530684,0.00035153996,0.00073353486,0.0010212723,0.13282365,0.08989025,0.03153685,0.07827648,0.6391298],"study_design_scores_gemma":[0.002631838,0.0010404224,0.008371202,0.00022572969,0.00040341783,0.0015624264,0.0014135857,0.7402392,0.0848251,0.128422,0.030674685,0.00019044492],"about_ca_topic_score_codex":0.0056439503,"about_ca_topic_score_gemma":0.010533374,"teacher_disagreement_score":0.013469835,"about_ca_system_score_codex":0.0021220804,"about_ca_system_score_gemma":0.0038092483,"threshold_uncertainty_score":0.04506111},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033777773,0.0003211203,0.9606655,0.00020382214,0.0000368877,0.0000926949,0.0003298307,0.00052788673,0.004044444],"genre_scores_gemma":[0.27294782,0.00070363877,0.7114088,0.00009378494,0.00006590551,0.00034898508,0.0016895463,0.00041909536,0.012322515],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99860114,0.00033550008,0.00009609223,0.00041986813,0.0003370428,0.00021036707],"domain_scores_gemma":[0.99846715,0.0006969918,0.00029545027,0.00023332376,0.0002010577,0.00010601101],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072544423,0.0009826898,0.0012679314,0.0010049643,0.0009576169,0.0014785265,0.0020415792,0.0015802092,0.009123257],"category_scores_gemma":[0.0042400425,0.00091976573,0.0009938973,0.0022063944,0.0009037606,0.005528641,0.0022918754,0.0014116847,0.0020967268],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00071145804,0.00017724917,0.0016422928,0.0006855252,0.00010547012,0.0010243335,0.0006050558,0.6401384,0.017713292,0.17184022,0.008081216,0.15727548],"study_design_scores_gemma":[0.00010652621,0.00033991158,0.0006315747,0.000076986915,0.000051826744,0.00082291407,0.00043021646,0.8073718,0.011605659,0.15074037,0.02775885,0.000063440624],"about_ca_topic_score_codex":0.0024341086,"about_ca_topic_score_gemma":0.0017907755,"teacher_disagreement_score":0.009123257,"about_ca_system_score_codex":0.00082984456,"about_ca_system_score_gemma":0.0006094054,"threshold_uncertainty_score":0.03052038},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2826852,0.021390535,0.32286066,0.010768429,0.0017519506,0.00013249986,0.0016467811,0.000693915,0.35807005],"genre_scores_gemma":[0.86225605,0.013092659,0.054800082,0.0014123259,0.004472382,0.00031042023,0.0022611904,0.00076922716,0.060625598],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975374,0.00045687766,0.000120864875,0.00058424735,0.00088126597,0.00041935686],"domain_scores_gemma":[0.9876794,0.0068540713,0.0015472771,0.001189463,0.0010921103,0.0016376524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021167314,0.002012448,0.0019832219,0.0070431866,0.0029540383,0.006315337,0.0021944249,0.0018769698,0.024155121],"category_scores_gemma":[0.015797872,0.0012364191,0.0017030808,0.005314834,0.0059531797,0.023503795,0.0078102374,0.008989302,0.0028371923],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000703231,0.00005504909,0.0014817788,0.00011287533,0.000022170307,0.000094835515,0.0002628841,0.0033166697,0.00055706996,0.97061163,0.0059669237,0.017447712],"study_design_scores_gemma":[0.000010412681,0.000028258048,0.0007798856,0.00004971977,0.000024133766,0.00016296284,0.00011824994,0.011801595,0.00024481124,0.97769094,0.0090676015,0.000021528385],"about_ca_topic_score_codex":0.0013988448,"about_ca_topic_score_gemma":0.0014355376,"teacher_disagreement_score":0.024155121,"about_ca_system_score_codex":0.0026949674,"about_ca_system_score_gemma":0.00064628856,"threshold_uncertainty_score":0.08080691},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27473864,0.0005557368,0.6745172,0.0009705124,0.00015478904,0.00013877265,0.0007652093,0.00045314507,0.04770597],"genre_scores_gemma":[0.83282316,0.000553224,0.15052311,0.00022038138,0.00010154752,0.00015523151,0.0010947549,0.00013077003,0.014397847],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99877995,0.00021150359,0.00006293785,0.0004139452,0.0003495082,0.00018221138],"domain_scores_gemma":[0.99757856,0.00071869564,0.00044137397,0.0006182706,0.00040235397,0.00024072164],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005423902,0.0007772963,0.00045514383,0.0008383244,0.0006609761,0.0016226263,0.001206195,0.0012113773,0.007927794],"category_scores_gemma":[0.0035518222,0.0007159519,0.00077614764,0.0010038523,0.0020048965,0.004951664,0.0031832354,0.0019696006,0.0009250278],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022888843,0.000088766064,0.0016720319,0.0002957873,0.000045371915,0.0007151915,0.0005399249,0.038798835,0.019538935,0.87895733,0.0031332027,0.055985685],"study_design_scores_gemma":[0.000074687,0.0003630557,0.0035387676,0.000085733336,0.00008927253,0.002522412,0.0012766063,0.1568373,0.014514576,0.7765977,0.04401856,0.000081348844],"about_ca_topic_score_codex":0.0005953024,"about_ca_topic_score_gemma":0.00088144076,"teacher_disagreement_score":0.007927794,"about_ca_system_score_codex":0.00060972903,"about_ca_system_score_gemma":0.00043737676,"threshold_uncertainty_score":0.026521146},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051244076,0.00056937285,0.94087046,0.00041639907,0.000041314343,0.00006333401,0.0005097621,0.00020483538,0.0060804943],"genre_scores_gemma":[0.542295,0.0007838417,0.45161247,0.00007840963,0.000085674845,0.00018452,0.0014306662,0.00018051566,0.003348912],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9956151,0.0010369876,0.0002712936,0.0008354064,0.0019376649,0.00030343886],"domain_scores_gemma":[0.99544334,0.0026180218,0.00044547278,0.00084169774,0.00044226245,0.00020917135],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002546436,0.0010394095,0.0016229955,0.0021030027,0.0018719613,0.0050937417,0.0027048977,0.0018377029,0.0050052805],"category_scores_gemma":[0.014421687,0.0016686615,0.0023616585,0.0021796362,0.0037467375,0.008442233,0.0049054637,0.0025495794,0.00074648304],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00061975635,0.000073282754,0.004023694,0.0005142304,0.00016886108,0.0019808197,0.0014310759,0.69464296,0.004129633,0.20373744,0.0030377652,0.08564046],"study_design_scores_gemma":[0.000044034554,0.00011298094,0.0011738808,0.00024290227,0.000071585986,0.0006988586,0.0008949103,0.6836819,0.004553028,0.29906815,0.009371373,0.000086370266],"about_ca_topic_score_codex":0.0022803305,"about_ca_topic_score_gemma":0.0021826667,"teacher_disagreement_score":0.0050937417,"about_ca_system_score_codex":0.0009837272,"about_ca_system_score_gemma":0.00075979327,"threshold_uncertainty_score":0.016744316},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49063927,0.0009638778,0.49201813,0.00019282362,0.00008842939,0.00008648099,0.00028067824,0.0007263478,0.015003935],"genre_scores_gemma":[0.8773105,0.00046075784,0.119658105,0.00003786729,0.00002433653,0.000043767715,0.00027924878,0.0001076759,0.0020776403],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99967206,0.00006660724,0.0000211584,0.000063479165,0.00009689595,0.00007973835],"domain_scores_gemma":[0.9992913,0.00032071196,0.00009703703,0.00015291813,0.00005694522,0.00008098265],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020570397,0.00041689767,0.0006627938,0.0006193273,0.00033620003,0.0010508747,0.0005797059,0.0005048323,0.00185515],"category_scores_gemma":[0.001907416,0.0003376501,0.00040295956,0.0007429566,0.00046737544,0.00086622697,0.0010380909,0.00031218576,0.00035729987],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003941181,0.00010037228,0.0026509606,0.00019591235,0.000035848243,0.0004698263,0.00029380785,0.7886754,0.028261939,0.0451566,0.0035993184,0.13016592],"study_design_scores_gemma":[0.000020337702,0.00009597368,0.00037557914,0.0000130605695,0.000008798657,0.00020520519,0.00011544565,0.9780252,0.005216228,0.013186998,0.002728825,0.000008427819],"about_ca_topic_score_codex":0.0017146824,"about_ca_topic_score_gemma":0.0012396264,"teacher_disagreement_score":0.00185515,"about_ca_system_score_codex":0.0005266505,"about_ca_system_score_gemma":0.0003068109,"threshold_uncertainty_score":0.006206155},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15319254,0.0005467481,0.8248302,0.00044885813,0.00008951883,0.00008697554,0.0013524063,0.0029725244,0.016480284],"genre_scores_gemma":[0.49154344,0.000602394,0.5007973,0.0001049144,0.000031922715,0.00015719175,0.001969884,0.0003597774,0.0044332603],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992976,0.00014389936,0.000040956482,0.00014292286,0.00029260106,0.00008203441],"domain_scores_gemma":[0.9986382,0.000561313,0.00017547765,0.00038436742,0.00015055577,0.000089982095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030598216,0.0008022774,0.00076954777,0.0009571858,0.00046075234,0.0012721913,0.0012534377,0.0008203467,0.006119062],"category_scores_gemma":[0.0024810445,0.0005678594,0.0007019041,0.0017999876,0.0007272564,0.0017570868,0.0021909664,0.0014138563,0.0017111828],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00059290923,0.0001612081,0.0028149774,0.0004883298,0.000109485256,0.00062342413,0.0006323871,0.46823573,0.038508657,0.24475001,0.013734808,0.22934815],"study_design_scores_gemma":[0.000078124394,0.000112982845,0.0013386073,0.000049478967,0.00002936098,0.0004903382,0.00017132275,0.7535985,0.013707651,0.21250196,0.017864805,0.00005683107],"about_ca_topic_score_codex":0.001722673,"about_ca_topic_score_gemma":0.0022049819,"teacher_disagreement_score":0.006119062,"about_ca_system_score_codex":0.000723538,"about_ca_system_score_gemma":0.00027352863,"threshold_uncertainty_score":0.020470321},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00094608596,0.000014977536,0.9985688,0.000011422727,0.000012463331,0.00000894515,0.000005909587,0.00016096472,0.0002704231],"genre_scores_gemma":[0.047661092,0.00006731254,0.95022744,0.000050424238,0.000024769466,0.000073965806,0.00005262859,0.00030331392,0.0015389719],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993331,0.0001241932,0.0000339871,0.0001301736,0.00034694493,0.00003161629],"domain_scores_gemma":[0.9989624,0.00042912186,0.00008298464,0.0002598376,0.00022788884,0.000037691287],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072791445,0.0008159069,0.00083130755,0.00090657646,0.00049723126,0.0010011699,0.0017740965,0.0015332315,0.003300621],"category_scores_gemma":[0.0029421356,0.00084847125,0.0007902398,0.00060109154,0.00096295954,0.0012780702,0.0020955598,0.0017353211,0.0011544274],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026033187,0.00019017771,0.0007848977,0.00037418547,0.000092248934,0.00016755186,0.00044094955,0.30656913,0.1782649,0.053772114,0.0037019309,0.4553816],"study_design_scores_gemma":[0.000009157685,0.000043418844,0.00013005962,0.000012880974,0.00001053185,0.00009451756,0.000017708147,0.9762621,0.012464011,0.006480313,0.0044540493,0.000021271067],"about_ca_topic_score_codex":0.00088240585,"about_ca_topic_score_gemma":0.0013218787,"teacher_disagreement_score":0.003300621,"about_ca_system_score_codex":0.00027712007,"about_ca_system_score_gemma":0.000533418,"threshold_uncertainty_score":0.011041641},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21972953,0.001027958,0.74895924,0.002551999,0.0001871067,0.00029025317,0.0011355747,0.00034561634,0.025772667],"genre_scores_gemma":[0.73251647,0.0010591398,0.24888864,0.00042479357,0.0004000622,0.0005308902,0.0025139772,0.0002542594,0.013411837],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971475,0.0010568292,0.00016006378,0.0006392563,0.00058917905,0.00040708855],"domain_scores_gemma":[0.99405956,0.004071795,0.00049314625,0.0004898749,0.0002800427,0.00060561555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002312239,0.0012235326,0.0021828546,0.001484733,0.0013826882,0.0044819694,0.0022753293,0.0029982536,0.0077336095],"category_scores_gemma":[0.010894124,0.00084359996,0.0018697886,0.0023863453,0.0029706613,0.007500365,0.004399294,0.0045986585,0.00054219476],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003352507,0.00033752006,0.0022616782,0.00043174432,0.000099886565,0.00030723595,0.00048949546,0.2657324,0.0023767508,0.688071,0.0050803046,0.034476772],"study_design_scores_gemma":[0.00007340177,0.00012700976,0.00048743104,0.00006359855,0.000029041079,0.00025822897,0.00026529375,0.4137297,0.0012217433,0.5785791,0.0051354114,0.000030008441],"about_ca_topic_score_codex":0.0014147735,"about_ca_topic_score_gemma":0.0011588499,"teacher_disagreement_score":0.0077336095,"about_ca_system_score_codex":0.0029122767,"about_ca_system_score_gemma":0.0011527631,"threshold_uncertainty_score":0.025871515},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010930501,0.00025174074,0.9832181,0.00023878447,0.00005425466,0.000093123475,0.00022695409,0.0009539272,0.0040327236],"genre_scores_gemma":[0.114983834,0.0002716216,0.8798372,0.00015070372,0.00003602252,0.00028739372,0.00082594104,0.00037375925,0.003233486],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99788886,0.00034489034,0.00020404314,0.00052194105,0.00066455937,0.00037566587],"domain_scores_gemma":[0.9952583,0.0024005675,0.00036926134,0.0013274917,0.000457727,0.00018674371],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013995497,0.0012828697,0.0015526814,0.0012045004,0.0012977374,0.0022109845,0.0030529785,0.0018272846,0.010444268],"category_scores_gemma":[0.007954277,0.0011745829,0.0021980372,0.0020175637,0.0014552008,0.0034942182,0.0042824396,0.0022681302,0.0023097345],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046369512,0.00021884887,0.0014760124,0.0005223179,0.000074426425,0.000091353846,0.00022912755,0.4397383,0.006674679,0.16532022,0.012511944,0.3726791],"study_design_scores_gemma":[0.00010915396,0.000091588285,0.00030124612,0.00004127613,0.000036319565,0.000095440235,0.000071930095,0.8265741,0.0036697856,0.16218598,0.0067891036,0.000034092533],"about_ca_topic_score_codex":0.0035845304,"about_ca_topic_score_gemma":0.006978776,"teacher_disagreement_score":0.010444268,"about_ca_system_score_codex":0.0023903183,"about_ca_system_score_gemma":0.0024961282,"threshold_uncertainty_score":0.034939528},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.75316167,0.0005816926,0.22337456,0.00061230024,0.00010146134,0.000044671542,0.0004621065,0.00041581073,0.021245725],"genre_scores_gemma":[0.96578383,0.00046934825,0.026262013,0.00009800163,0.00010615772,0.000046430374,0.00038712518,0.00044766755,0.006399395],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99917823,0.00020375806,0.000037765032,0.00019125296,0.00023533784,0.00015362771],"domain_scores_gemma":[0.9871156,0.0068994425,0.0019826847,0.0014630466,0.0010787285,0.0014605089],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011707447,0.0008773191,0.0006562724,0.0025751805,0.00093421363,0.0031810377,0.0019011861,0.00096997654,0.007028801],"category_scores_gemma":[0.013661249,0.0012068317,0.0006910356,0.0013237365,0.0033189608,0.0053744516,0.00251812,0.00199495,0.00058556977],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00086415553,0.00017958778,0.01638056,0.00037045314,0.00008764395,0.00056342175,0.0016963371,0.121031426,0.03336151,0.7533194,0.0035649887,0.06858052],"study_design_scores_gemma":[0.000061533916,0.00011469111,0.008613236,0.00009144339,0.00008486152,0.0006731559,0.00062733836,0.21102446,0.015571483,0.75911254,0.0039559114,0.000069342714],"about_ca_topic_score_codex":0.0018639696,"about_ca_topic_score_gemma":0.00164246,"teacher_disagreement_score":0.007028801,"about_ca_system_score_codex":0.0010499371,"about_ca_system_score_gemma":0.000492222,"threshold_uncertainty_score":0.023513615},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0042729457,0.0002369793,0.9925949,0.00016045652,0.000037898935,0.000039819308,0.000033724988,0.00011686525,0.0025063741],"genre_scores_gemma":[0.29442066,0.00037001923,0.69916457,0.00018350499,0.00007275709,0.0006822795,0.00020697252,0.0003239627,0.004575289],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999537,0.00024467584,0.000018924033,0.000048544814,0.00010435988,0.00004649714],"domain_scores_gemma":[0.9977749,0.001727686,0.00010991496,0.00008603423,0.00019865349,0.00010278838],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017894862,0.0010373105,0.0020063566,0.00075857097,0.00062753184,0.0012381526,0.0011969592,0.0022076503,0.005075058],"category_scores_gemma":[0.0060074017,0.0011102294,0.0009698988,0.000761705,0.0011072783,0.0015234106,0.0018980091,0.0021422624,0.0006686542],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008505994,0.000037332706,0.00016634182,0.0000870452,0.000029042709,0.00002935693,0.00004451349,0.9584841,0.00060525007,0.01692103,0.000881716,0.02262915],"study_design_scores_gemma":[0.000007764449,0.000007018477,0.000012888376,0.000006577705,0.0000018375997,0.0000024243182,0.000003850946,0.996358,0.000070758484,0.0033280363,0.00019820874,0.000002627738],"about_ca_topic_score_codex":0.0064639826,"about_ca_topic_score_gemma":0.004773577,"teacher_disagreement_score":0.0064639826,"about_ca_system_score_codex":0.000754005,"about_ca_system_score_gemma":0.0016183973,"threshold_uncertainty_score":0.016977787},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.67962945,0.0027841227,0.28410512,0.0010630268,0.0007571115,0.000076616656,0.00033971987,0.0011451215,0.030099664],"genre_scores_gemma":[0.97846174,0.00034083286,0.019369226,0.00008124335,0.000038881,0.00001270415,0.00013205093,0.00018669448,0.0013765562],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99914646,0.00029674332,0.00003796663,0.000072275034,0.00036385158,0.00008266271],"domain_scores_gemma":[0.9936113,0.004371741,0.00021974454,0.00047304085,0.0012008086,0.00012337584],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011290669,0.00036453322,0.00044462402,0.00045333107,0.00043895535,0.0006370349,0.00046533122,0.000986628,0.002309216],"category_scores_gemma":[0.011816021,0.00014095551,0.00030961327,0.000448172,0.00041581134,0.0007670822,0.0006788808,0.0005551933,0.00043253892],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017896399,0.000241521,0.008063832,0.0004111189,0.000061458326,0.00052165275,0.00022660989,0.781059,0.06595529,0.0068303095,0.0025881897,0.13225141],"study_design_scores_gemma":[0.00002379441,0.00016748285,0.0018518985,0.00003683207,0.000028150695,0.000103137645,0.00006824345,0.98051906,0.015566727,0.0008221117,0.0007979313,0.0000145520835],"about_ca_topic_score_codex":0.0019195535,"about_ca_topic_score_gemma":0.001743607,"teacher_disagreement_score":0.002309216,"about_ca_system_score_codex":0.00023911691,"about_ca_system_score_gemma":0.00046760944,"threshold_uncertainty_score":0.00772506},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023689521,0.00060066,0.99128824,0.00013190597,0.00010233998,0.000021645537,0.00002421895,0.00032693343,0.0051350696],"genre_scores_gemma":[0.13835444,0.0037782325,0.8371029,0.00015093679,0.00015888509,0.000115388044,0.00019276942,0.0002711442,0.019875288],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99971825,0.00003224273,0.000017124245,0.000030035304,0.00018539162,0.000016893782],"domain_scores_gemma":[0.9996873,0.00009553519,0.00002209238,0.000044204928,0.00013772782,0.00001314186],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030527936,0.0006067308,0.0004864879,0.0007055854,0.00040607515,0.0008026746,0.0011382055,0.0011420453,0.003629482],"category_scores_gemma":[0.0009583223,0.0003440444,0.00084017817,0.000851394,0.00038144225,0.0012136346,0.0007914708,0.0015392906,0.0015976226],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012551664,0.000105320505,0.00077236764,0.000537413,0.000067826186,0.00052320206,0.0005840722,0.1604345,0.071788795,0.18453947,0.008575655,0.5719459],"study_design_scores_gemma":[0.000024419134,0.00004077519,0.0002086761,0.00004514448,0.0000236906,0.0004733626,0.000040794635,0.92719656,0.017165191,0.021597056,0.033148408,0.00003585484],"about_ca_topic_score_codex":0.0015031607,"about_ca_topic_score_gemma":0.0010707118,"teacher_disagreement_score":0.003629482,"about_ca_system_score_codex":0.00043010587,"about_ca_system_score_gemma":0.0005465338,"threshold_uncertainty_score":0.012141824},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04994265,0.0005125762,0.9469523,0.00014437782,0.00009791681,0.000054361564,0.00016436841,0.00027158525,0.0018598996],"genre_scores_gemma":[0.39507318,0.0003855605,0.6007016,0.000042332398,0.00005956381,0.00015159321,0.0005789133,0.00017759234,0.0028296679],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986883,0.00032692333,0.00008418366,0.00026349214,0.0005566464,0.00008040273],"domain_scores_gemma":[0.9969613,0.0017792629,0.0002249847,0.00034870746,0.0005856025,0.0001001606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015438676,0.00081615226,0.0013099487,0.0021272313,0.0006389353,0.0014111021,0.0025738643,0.0018461006,0.002157918],"category_scores_gemma":[0.014906091,0.0007911669,0.00079310196,0.0022652647,0.00084524706,0.0022033302,0.0018683858,0.001525002,0.00085328793],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032571726,0.00009873162,0.0020805676,0.00016880111,0.00004640769,0.000108368266,0.00016153572,0.8381531,0.0026512744,0.026049444,0.0025397786,0.12761621],"study_design_scores_gemma":[0.000008029876,0.000021645154,0.00015246685,0.00000866493,0.000004802107,0.000032564603,0.00002786198,0.9912952,0.0010156308,0.006856031,0.0005687065,0.000008325466],"about_ca_topic_score_codex":0.004933035,"about_ca_topic_score_gemma":0.0052191573,"teacher_disagreement_score":0.004933035,"about_ca_system_score_codex":0.0010744664,"about_ca_system_score_gemma":0.00091079733,"threshold_uncertainty_score":0.00980866},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019230332,0.00095202087,0.9738816,0.00041367763,0.00011162326,0.00006367992,0.00016857455,0.0005956565,0.0045828014],"genre_scores_gemma":[0.2730391,0.0010792573,0.7169905,0.00023633653,0.00020395294,0.00029357002,0.0010563578,0.000621123,0.006479834],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991523,0.00021973623,0.00004923994,0.00012300802,0.00032614078,0.0001296518],"domain_scores_gemma":[0.9966107,0.0023329176,0.00018605113,0.00037436924,0.0003109379,0.00018499063],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011977172,0.0011883389,0.001835923,0.0016712156,0.0008219449,0.0021142764,0.0030191937,0.002297374,0.006599981],"category_scores_gemma":[0.008220984,0.00082024705,0.0012073445,0.0026366438,0.0009888413,0.0034280138,0.0031239353,0.002355102,0.0012726106],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033405196,0.0001880116,0.0011664397,0.0003067812,0.00007339379,0.00009830284,0.00027080398,0.73458517,0.0014660041,0.07509034,0.012092587,0.1743281],"study_design_scores_gemma":[0.000015702082,0.00001116677,0.00005646319,0.000009223949,0.0000053597096,0.000021379057,0.000028323217,0.9795243,0.00019983243,0.019236865,0.00088761625,0.0000039039487],"about_ca_topic_score_codex":0.007162412,"about_ca_topic_score_gemma":0.008259832,"teacher_disagreement_score":0.007162412,"about_ca_system_score_codex":0.0016807297,"about_ca_system_score_gemma":0.0012033535,"threshold_uncertainty_score":0.02207917},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2446762,0.0005773568,0.7402787,0.00067844155,0.00010916564,0.000220251,0.0011696109,0.0018963416,0.010393855],"genre_scores_gemma":[0.5008798,0.00058742095,0.49023944,0.00024829668,0.000064376814,0.00017253928,0.0025175489,0.0006753466,0.004615203],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992663,0.00014308095,0.0000524775,0.00020776124,0.0001474596,0.00018282696],"domain_scores_gemma":[0.9979103,0.0011332962,0.00024393546,0.000467024,0.000101373706,0.0001440157],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077156705,0.00074861024,0.0010636881,0.00056406175,0.00066084,0.001049826,0.0011562901,0.00080586434,0.005288797],"category_scores_gemma":[0.0044576046,0.0005507872,0.0011930885,0.000983827,0.0015961538,0.0027365023,0.0026922352,0.0012499255,0.00094868947],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010363046,0.00029715698,0.0065663713,0.0009790178,0.00010236508,0.0012351337,0.0009172924,0.5724452,0.024617724,0.14693089,0.013270299,0.23160228],"study_design_scores_gemma":[0.000117903415,0.00020103135,0.00107648,0.0001240102,0.00004542466,0.0005975194,0.00042739595,0.7560911,0.0140660945,0.21689326,0.010314216,0.000045639863],"about_ca_topic_score_codex":0.002127545,"about_ca_topic_score_gemma":0.0023011675,"teacher_disagreement_score":0.005288797,"about_ca_system_score_codex":0.0005337745,"about_ca_system_score_gemma":0.00062772265,"threshold_uncertainty_score":0.017692804},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1700513,0.0019493776,0.76156694,0.00065091974,0.0003402897,0.00014325029,0.00015195129,0.0005216683,0.064624354],"genre_scores_gemma":[0.60642594,0.00230098,0.36040407,0.00017533629,0.0002161942,0.0001045871,0.00037357552,0.00045574072,0.029543644],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995828,0.00008225119,0.000027914188,0.00009938271,0.0001601743,0.000047555965],"domain_scores_gemma":[0.9991906,0.00032637545,0.00007265799,0.00016973427,0.00014669691,0.00009390697],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004062635,0.00071525323,0.0006136313,0.0021038735,0.00087735336,0.001952008,0.0013391504,0.0010366593,0.009849164],"category_scores_gemma":[0.002633632,0.0006112497,0.00072944805,0.002245686,0.0015093919,0.0020596578,0.0024360511,0.0020234452,0.0012412232],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008920481,0.000098196535,0.0008538516,0.00018148405,0.000019268138,0.00014252306,0.00039248174,0.033507507,0.00983607,0.77248734,0.0030249332,0.17936705],"study_design_scores_gemma":[0.000028486993,0.0001841281,0.00066489074,0.000105273146,0.000032268974,0.00051161775,0.0004349294,0.20068336,0.00841254,0.749411,0.03949522,0.000036361136],"about_ca_topic_score_codex":0.00039675916,"about_ca_topic_score_gemma":0.0005492226,"teacher_disagreement_score":0.009849164,"about_ca_system_score_codex":0.00060057844,"about_ca_system_score_gemma":0.0003205607,"threshold_uncertainty_score":0.032948732},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7315653,0.0030034315,0.18389043,0.00984253,0.00052325655,0.00012374377,0.00090307597,0.00059813756,0.06955006],"genre_scores_gemma":[0.96377856,0.001714411,0.023612415,0.0009993964,0.00082402024,0.00016930571,0.00096036843,0.00017958779,0.007762007],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99495465,0.0011077381,0.0002703133,0.0013866337,0.0012086686,0.0010720297],"domain_scores_gemma":[0.9596404,0.02662116,0.0038445618,0.006043645,0.0018350222,0.0020151576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005893594,0.0010989294,0.002462242,0.0031861193,0.0039945543,0.0044591054,0.002777901,0.0031260015,0.010567223],"category_scores_gemma":[0.035857536,0.0012031301,0.0024838203,0.0031238536,0.008459939,0.01428182,0.0062656077,0.0050732596,0.0013256245],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007420262,0.00013632295,0.007885363,0.00029393262,0.00009943323,0.00060685794,0.0010033383,0.046163004,0.0025024,0.9071633,0.009262723,0.02414113],"study_design_scores_gemma":[0.000084181105,0.00009614866,0.001482885,0.000078685196,0.00004305101,0.00045916965,0.00035756332,0.061501827,0.0014643627,0.92982227,0.004557285,0.000052523174],"about_ca_topic_score_codex":0.0018225835,"about_ca_topic_score_gemma":0.0011747003,"teacher_disagreement_score":0.010567223,"about_ca_system_score_codex":0.0022619232,"about_ca_system_score_gemma":0.0010757647,"threshold_uncertainty_score":0.03535086},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014606628,0.000052713473,0.9965146,0.000025015826,0.000027131051,0.000040873434,0.0000363401,0.0011567615,0.000685898],"genre_scores_gemma":[0.02461963,0.00012323039,0.97318596,0.000027332155,0.000036926976,0.000109983994,0.00022060191,0.00028419928,0.0013920236],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907696,0.00012651886,0.000058524587,0.00017202283,0.0004914112,0.00007457862],"domain_scores_gemma":[0.99921465,0.00028053852,0.00005277606,0.00015817687,0.0002463692,0.000047528203],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084408524,0.0011094935,0.0011208166,0.0019671575,0.0008644658,0.0012397252,0.0016892778,0.0008172017,0.006601025],"category_scores_gemma":[0.0029771663,0.0005269927,0.00090671517,0.0022764835,0.0007556745,0.0026429924,0.0017780259,0.0015486106,0.002066178],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015590359,0.00006136057,0.001018661,0.00029790655,0.000059009042,0.00033470473,0.0003251579,0.12255694,0.020363573,0.04688944,0.013889097,0.7940483],"study_design_scores_gemma":[0.000047791047,0.000105023406,0.00041165997,0.000025376308,0.000027816146,0.0003471712,0.000084918676,0.91168433,0.02298506,0.02353527,0.040697444,0.000048053695],"about_ca_topic_score_codex":0.0029462103,"about_ca_topic_score_gemma":0.0019755918,"teacher_disagreement_score":0.006601025,"about_ca_system_score_codex":0.0007350164,"about_ca_system_score_gemma":0.0008222676,"threshold_uncertainty_score":0.022082686},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7294265,0.0006783157,0.24046092,0.0006621458,0.000082204235,0.000110924244,0.0004169933,0.0002266176,0.027935391],"genre_scores_gemma":[0.928091,0.00054030796,0.061068606,0.00008042657,0.000043593005,0.000051907686,0.00036092498,0.00008310304,0.009680063],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998042,0.00003797891,0.000012468924,0.00004301018,0.00006740971,0.00003488589],"domain_scores_gemma":[0.9995683,0.00015189254,0.00012213676,0.00004608169,0.00004177694,0.00006980826],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002177644,0.00028550514,0.0005270595,0.0010915555,0.0009990081,0.0013332729,0.000760692,0.0010637069,0.0030986376],"category_scores_gemma":[0.0021412922,0.00046533262,0.00037652263,0.0014928003,0.0011676652,0.0018301088,0.0012945178,0.0008337025,0.00035208953],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016647471,0.000060380265,0.0013287776,0.00011385354,0.00002546293,0.00048796064,0.00046750274,0.08208791,0.0036886898,0.8740035,0.0024478019,0.03512166],"study_design_scores_gemma":[0.000037197944,0.000042900076,0.0005715588,0.000020412204,0.000017025654,0.0002397667,0.00022415355,0.1344451,0.0010397703,0.8585489,0.0047991406,0.000014026922],"about_ca_topic_score_codex":0.0018614924,"about_ca_topic_score_gemma":0.0017443707,"teacher_disagreement_score":0.0030986376,"about_ca_system_score_codex":0.000560285,"about_ca_system_score_gemma":0.00033366057,"threshold_uncertainty_score":0.010365963},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009690318,0.00012519679,0.98131096,0.00028613236,0.00008855771,0.00016553613,0.00021535999,0.0013590197,0.006758848],"genre_scores_gemma":[0.061032,0.0001465996,0.93049943,0.00013668808,0.000067574634,0.00035031277,0.00096236897,0.00050511234,0.006299887],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992304,0.0001652065,0.00004155872,0.00016247004,0.0002701642,0.00013024242],"domain_scores_gemma":[0.99834895,0.0007939039,0.00009665767,0.00034407902,0.00029573464,0.00012067861],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096725824,0.0015922262,0.0016515771,0.0020634886,0.0012865767,0.0018853802,0.0036727688,0.0017788411,0.013510448],"category_scores_gemma":[0.0043439823,0.0009447982,0.0016310929,0.0028947748,0.00085877744,0.0031600762,0.0047013164,0.0025774206,0.003521574],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047854354,0.00042645406,0.00090511236,0.00047884916,0.000118505166,0.0001958454,0.00029683294,0.26257834,0.0074208947,0.0928735,0.02248214,0.61174506],"study_design_scores_gemma":[0.00016248779,0.000092241775,0.00025101524,0.00004309043,0.0000412528,0.00008739557,0.000073067924,0.8742419,0.002966073,0.11484532,0.0071745063,0.00002168999],"about_ca_topic_score_codex":0.0026877285,"about_ca_topic_score_gemma":0.004715045,"teacher_disagreement_score":0.013510448,"about_ca_system_score_codex":0.0011890002,"about_ca_system_score_gemma":0.0017673182,"threshold_uncertainty_score":0.04519689},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7497344,0.0010141113,0.039525717,0.0018371802,0.00077857834,0.00005665517,0.0012253615,0.00052596803,0.20530203],"genre_scores_gemma":[0.95916,0.00037497835,0.011094804,0.00024004931,0.00007866895,0.00004163697,0.0005937069,0.00017857911,0.02823763],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99961275,0.00006424733,0.000019021874,0.000089506466,0.00010450893,0.00010996756],"domain_scores_gemma":[0.9991252,0.00031455493,0.00017433692,0.00010689891,0.00010037483,0.0001785393],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005003497,0.00039581262,0.0003260846,0.001762462,0.0014354672,0.0021075346,0.00069911993,0.0008158649,0.016622288],"category_scores_gemma":[0.002931995,0.00022480036,0.0002749342,0.00091329485,0.00136469,0.0017800065,0.0011464434,0.0010362797,0.002041284],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005625505,0.00010029077,0.0050196014,0.00021475271,0.00004572864,0.000649967,0.0006059719,0.010637416,0.012915841,0.87935215,0.031710714,0.058185127],"study_design_scores_gemma":[0.000053705357,0.00009761784,0.007758178,0.0001410546,0.000052888718,0.0013974613,0.00074434903,0.040565573,0.012224438,0.88725317,0.049634065,0.000077567565],"about_ca_topic_score_codex":0.0010472394,"about_ca_topic_score_gemma":0.0017899086,"teacher_disagreement_score":0.016622288,"about_ca_system_score_codex":0.0009401812,"about_ca_system_score_gemma":0.00051313534,"threshold_uncertainty_score":0.05560702},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007732466,0.00021112718,0.9865144,0.0000946482,0.000055597895,0.00009995994,0.0002076578,0.0017146571,0.0033694955],"genre_scores_gemma":[0.08173862,0.00012403891,0.9123268,0.000056900226,0.000023434015,0.00025514682,0.00068755227,0.00026614068,0.004521281],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99951434,0.00006619957,0.00003085647,0.00007736238,0.00024873693,0.00006239869],"domain_scores_gemma":[0.9993718,0.0002111888,0.000031634314,0.000103094564,0.00024119669,0.000040997467],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005821907,0.0010208188,0.00096766656,0.0016656535,0.0007749951,0.0011364125,0.0019137694,0.0011521977,0.014119459],"category_scores_gemma":[0.0027343011,0.0004623353,0.00071498466,0.001653347,0.00064717274,0.0012535003,0.002893919,0.0012859005,0.005165817],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006083195,0.00025526065,0.0021956298,0.00038907502,0.00014311017,0.00029712566,0.0005365621,0.1268684,0.021251641,0.06662557,0.029921683,0.7509076],"study_design_scores_gemma":[0.00023363935,0.00017336577,0.0008513147,0.000043317516,0.000041926916,0.00029293456,0.000249325,0.91899836,0.0116217695,0.046782654,0.02066672,0.0000446661],"about_ca_topic_score_codex":0.0051932293,"about_ca_topic_score_gemma":0.010529131,"teacher_disagreement_score":0.014119459,"about_ca_system_score_codex":0.00064566464,"about_ca_system_score_gemma":0.0016890495,"threshold_uncertainty_score":0.047234237},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17220233,0.00022683904,0.81451833,0.0005838876,0.00004244243,0.000100836194,0.00021491932,0.0004973988,0.0116129955],"genre_scores_gemma":[0.7865712,0.0002756047,0.20981476,0.00017079138,0.000041749383,0.00016919678,0.00045531342,0.00008810152,0.0024132682],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986313,0.0006539522,0.00008572608,0.00019976766,0.0002879083,0.00014138695],"domain_scores_gemma":[0.99333113,0.003846238,0.0006649428,0.00140097,0.0004480918,0.00030863847],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008584396,0.0005518587,0.00063219503,0.0005516612,0.00051868154,0.00104231,0.0011511928,0.0008516204,0.0027913887],"category_scores_gemma":[0.0083558895,0.00044870592,0.00047094963,0.0005842182,0.00087036693,0.0018898902,0.003388268,0.0010041513,0.0009105318],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010640916,0.00029732325,0.0054718093,0.00051511487,0.00009249022,0.00085652777,0.0007759684,0.44591627,0.09145653,0.28104603,0.009197523,0.16331047],"study_design_scores_gemma":[0.00013323834,0.00044940528,0.0013946524,0.00006259429,0.000032403143,0.0005756067,0.00030262678,0.8104903,0.033393893,0.144488,0.008635567,0.000041630236],"about_ca_topic_score_codex":0.00026453403,"about_ca_topic_score_gemma":0.00040213147,"teacher_disagreement_score":0.0027913887,"about_ca_system_score_codex":0.00044673355,"about_ca_system_score_gemma":0.0003895415,"threshold_uncertainty_score":0.009338081},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22987622,0.0043533086,0.43057072,0.0029943273,0.0005578163,0.00010549237,0.0012693377,0.00079323613,0.3294796],"genre_scores_gemma":[0.9094233,0.0019617134,0.03971785,0.0004582451,0.0002455707,0.00008681509,0.0012081593,0.00025381093,0.0466446],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996642,0.000045649038,0.000017797829,0.000058613183,0.0001434581,0.00007035534],"domain_scores_gemma":[0.9985537,0.00083032966,0.00012436458,0.00017899997,0.00018386959,0.00012869849],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003870763,0.00057283125,0.0005600965,0.001532577,0.0011984434,0.0025840914,0.0010997007,0.0008733589,0.011016365],"category_scores_gemma":[0.0037719877,0.0004426725,0.0007668176,0.0017329331,0.001634577,0.0045743985,0.002310183,0.002749363,0.0014030461],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000072994706,0.000039550516,0.0005797745,0.0001297529,0.000020323827,0.00013737679,0.00027902055,0.0032845757,0.0015345986,0.970843,0.005956257,0.01712268],"study_design_scores_gemma":[0.000021281801,0.000028917564,0.0006743242,0.000032602842,0.000025132018,0.00023341067,0.00021540973,0.011060067,0.0021285,0.97391415,0.011651445,0.000014825728],"about_ca_topic_score_codex":0.0017124783,"about_ca_topic_score_gemma":0.0021279268,"teacher_disagreement_score":0.011016365,"about_ca_system_score_codex":0.0009997898,"about_ca_system_score_gemma":0.0004986307,"threshold_uncertainty_score":0.036853433},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3860909,0.0064491234,0.50879633,0.0020698,0.00020499462,0.00024331483,0.0022052624,0.0015818755,0.092358425],"genre_scores_gemma":[0.8387597,0.0034239148,0.14776734,0.0005651181,0.00019895182,0.00031478915,0.0022481065,0.00068222743,0.0060398234],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973041,0.0007062552,0.000121376666,0.0005195579,0.000787862,0.00056082377],"domain_scores_gemma":[0.98673904,0.009331549,0.0011728322,0.00144305,0.0007007133,0.00061279314],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020540515,0.00189409,0.0012253154,0.0027146318,0.0013539135,0.0020648804,0.0026379544,0.0012640156,0.0112235965],"category_scores_gemma":[0.020181792,0.000812607,0.00095296005,0.002770975,0.0017097637,0.0072871833,0.003210036,0.0019812228,0.0017871497],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012644386,0.0003633301,0.008576538,0.0010994216,0.00030727967,0.0006934488,0.0006572718,0.30720472,0.037204042,0.44868368,0.019053811,0.17489187],"study_design_scores_gemma":[0.00010766191,0.00048962515,0.0052451114,0.00028408924,0.00028214,0.0023591705,0.0004517709,0.49797162,0.025843369,0.44167924,0.025167946,0.00011822882],"about_ca_topic_score_codex":0.0012125878,"about_ca_topic_score_gemma":0.0015315638,"teacher_disagreement_score":0.0112235965,"about_ca_system_score_codex":0.0012843839,"about_ca_system_score_gemma":0.0005983385,"threshold_uncertainty_score":0.037546635},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8395932,0.0037033984,0.022375368,0.0014294487,0.00013779852,0.00016099344,0.056243062,0.0011775449,0.07517922],"genre_scores_gemma":[0.9347653,0.001801867,0.012151381,0.00022091216,0.00006190446,0.00014617913,0.03977539,0.00029757727,0.0107794115],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99932647,0.00008598225,0.000032366854,0.00018979801,0.00019637079,0.0001689901],"domain_scores_gemma":[0.99772197,0.0008444716,0.00026172053,0.00031468342,0.0004747977,0.0003823721],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034141514,0.00031037309,0.0004516672,0.0024203944,0.0009567586,0.0014493936,0.0007552703,0.000619036,0.017085157],"category_scores_gemma":[0.003144589,0.00030137278,0.00044143596,0.00331111,0.0005682979,0.001425034,0.0008955623,0.0006856632,0.0029369143],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020807143,0.0004090388,0.07361237,0.001605406,0.00027144983,0.00299573,0.002874709,0.028599642,0.044113275,0.28022668,0.2050458,0.3581652],"study_design_scores_gemma":[0.00029041633,0.000583961,0.162974,0.00032121886,0.00024846784,0.015773693,0.0051053255,0.06515743,0.018493801,0.18111515,0.5497898,0.00014679399],"about_ca_topic_score_codex":0.004789875,"about_ca_topic_score_gemma":0.0061292606,"teacher_disagreement_score":0.017085157,"about_ca_system_score_codex":0.00058194716,"about_ca_system_score_gemma":0.00089108344,"threshold_uncertainty_score":0.05715555},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0041312836,0.00030602713,0.9840151,0.00025654063,0.00008616519,0.0001542105,0.00040838827,0.002374805,0.008267537],"genre_scores_gemma":[0.11548023,0.0005377442,0.8656196,0.00037466062,0.00016165053,0.0005678214,0.0016110273,0.0015986098,0.014048581],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99814,0.00031545633,0.0001547222,0.0003684541,0.0007033913,0.00031810426],"domain_scores_gemma":[0.99562955,0.0014253533,0.00027988834,0.001366393,0.0010772751,0.00022151782],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020410274,0.0013037856,0.0012042434,0.002853781,0.00162089,0.0026956173,0.0023012978,0.0013454965,0.026035948],"category_scores_gemma":[0.012525843,0.0009443447,0.00197387,0.0025841848,0.0013022504,0.0071698586,0.008463183,0.002393928,0.011383835],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003690762,0.000113580034,0.0017472168,0.00042026283,0.000081925275,0.0001186651,0.0004262976,0.025390586,0.0058553377,0.32158393,0.032512505,0.61138064],"study_design_scores_gemma":[0.00014347017,0.00009985618,0.0007259951,0.00011306267,0.0000735191,0.0004245744,0.00029232365,0.2034289,0.009641209,0.73593473,0.049043726,0.00007864359],"about_ca_topic_score_codex":0.001872733,"about_ca_topic_score_gemma":0.003232334,"teacher_disagreement_score":0.026035948,"about_ca_system_score_codex":0.0013272839,"about_ca_system_score_gemma":0.0017501893,"threshold_uncertainty_score":0.0870989},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09077637,0.0014870414,0.8427204,0.0005283946,0.00034108546,0.00028405862,0.0008711044,0.0008546162,0.062136937],"genre_scores_gemma":[0.56960076,0.001187499,0.41918212,0.0002401736,0.00023519041,0.0002091731,0.0010836695,0.0002145417,0.008046877],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99917704,0.00015115348,0.000054274693,0.00021083695,0.0002773245,0.0001292841],"domain_scores_gemma":[0.9987255,0.0004069655,0.00027773713,0.00032026696,0.00018730992,0.00008229216],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047480495,0.0005947588,0.0005519791,0.00077013724,0.0007213723,0.0011397891,0.00093563984,0.00040901478,0.004633446],"category_scores_gemma":[0.0030494565,0.0004865083,0.00070863846,0.00071244565,0.0013933417,0.002336316,0.001546058,0.0010048159,0.0009598246],"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.00040456335,0.0001004933,0.004272265,0.000536438,0.000049734175,0.0010581336,0.00055940705,0.056454863,0.03934257,0.617832,0.012732677,0.26665694],"study_design_scores_gemma":[0.00009717083,0.0006145147,0.0043897475,0.00018251626,0.00009720847,0.00830875,0.00057216606,0.33189425,0.033988804,0.43464208,0.18509966,0.00011314749],"about_ca_topic_score_codex":0.0009107231,"about_ca_topic_score_gemma":0.001002352,"teacher_disagreement_score":0.004633446,"about_ca_system_score_codex":0.00041497682,"about_ca_system_score_gemma":0.00042662493,"threshold_uncertainty_score":0.015500426},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12948155,0.0008697196,0.72269857,0.00059285486,0.00024655755,0.0001833866,0.0014317901,0.001140677,0.14335497],"genre_scores_gemma":[0.54462826,0.0007674612,0.39079913,0.0002588811,0.0000869172,0.0001992661,0.0044160555,0.0005894077,0.058254562],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993105,0.0001859888,0.000049357197,0.00009969239,0.00027292475,0.00008156366],"domain_scores_gemma":[0.99901617,0.00035932194,0.000074554664,0.0002518126,0.00021939745,0.00007877629],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033804402,0.00036337247,0.00056603615,0.0012848795,0.0009693963,0.0014625626,0.0011212571,0.0006269478,0.016704869],"category_scores_gemma":[0.003393408,0.00032026714,0.00051117677,0.0013770944,0.0006937707,0.0019326222,0.0027353626,0.0008784102,0.003633129],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018231527,0.00007999035,0.0014648404,0.00043243484,0.000029290508,0.00024216877,0.00039642397,0.019407496,0.0065605748,0.7133758,0.018632146,0.23919643],"study_design_scores_gemma":[0.0000328461,0.0000758434,0.0008749948,0.00015877452,0.000030272406,0.000846223,0.00053638377,0.12376835,0.007067243,0.798412,0.06816585,0.00003112583],"about_ca_topic_score_codex":0.00069451425,"about_ca_topic_score_gemma":0.0019346008,"teacher_disagreement_score":0.016704869,"about_ca_system_score_codex":0.00052283966,"about_ca_system_score_gemma":0.00037944497,"threshold_uncertainty_score":0.05588329},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7052078,0.00075999537,0.22930868,0.0009955884,0.0001266775,0.0001021605,0.0007029629,0.00059975934,0.0621963],"genre_scores_gemma":[0.9709892,0.0003180667,0.01961639,0.00011474221,0.000054676035,0.000053338,0.00063613977,0.00016113857,0.008056387],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996511,0.00008373858,0.00001827649,0.00007604667,0.000091910704,0.00007901723],"domain_scores_gemma":[0.99659497,0.0021980344,0.00034399427,0.00050090626,0.00013056574,0.00023153938],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036418208,0.00023867161,0.0003586243,0.00051908044,0.00054345594,0.0012275449,0.0009298367,0.00070851925,0.010802611],"category_scores_gemma":[0.004256054,0.00036343047,0.00036450024,0.00075085723,0.0010304742,0.0016476765,0.0013559568,0.0008361162,0.000878604],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000766268,0.00014589124,0.0055371323,0.0004332115,0.00005409979,0.0010361545,0.0005636629,0.07773516,0.024835035,0.7674129,0.016081301,0.10539916],"study_design_scores_gemma":[0.00017337337,0.00014084579,0.0037812667,0.000062571926,0.000057042515,0.0010182724,0.0004836955,0.22174232,0.017722834,0.7434188,0.011354061,0.00004490746],"about_ca_topic_score_codex":0.000756316,"about_ca_topic_score_gemma":0.0010238703,"teacher_disagreement_score":0.010802611,"about_ca_system_score_codex":0.00050208205,"about_ca_system_score_gemma":0.0003682841,"threshold_uncertainty_score":0.036138296},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005185972,0.0007532837,0.98131645,0.000386326,0.00011204654,0.00008888413,0.000160733,0.00062897324,0.011367353],"genre_scores_gemma":[0.096286744,0.001276708,0.8754146,0.00028641333,0.00033853485,0.0004818546,0.0014709078,0.0011743058,0.023269853],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99897647,0.0002457996,0.00005773322,0.00020981849,0.00040989477,0.00010026977],"domain_scores_gemma":[0.9968924,0.0021088205,0.00013967587,0.00041649016,0.00032337772,0.00011936974],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013929901,0.0018642843,0.0015693024,0.002058533,0.0012639066,0.0023559772,0.0037811764,0.0024497886,0.02355319],"category_scores_gemma":[0.009690472,0.0011774236,0.0015729594,0.0032960298,0.0017882371,0.005761801,0.004911244,0.0038905258,0.004026867],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031668044,0.00016900538,0.00073278503,0.00078102,0.000088799214,0.00008970614,0.00039325166,0.21102811,0.0031487716,0.38117117,0.027362144,0.37471852],"study_design_scores_gemma":[0.000045989327,0.00004368082,0.00018696989,0.000079332945,0.000025207042,0.00009315269,0.00008055384,0.6399459,0.0015958783,0.34291846,0.014970194,0.0000145765625],"about_ca_topic_score_codex":0.002002221,"about_ca_topic_score_gemma":0.002362101,"teacher_disagreement_score":0.02355319,"about_ca_system_score_codex":0.0016925049,"about_ca_system_score_gemma":0.0010054375,"threshold_uncertainty_score":0.07879329},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5915175,0.0005567908,0.10064489,0.0007622405,0.00027336075,0.00008738909,0.0012433715,0.000631372,0.30428302],"genre_scores_gemma":[0.9423328,0.00015696508,0.011373891,0.00012436298,0.000076393975,0.000050639934,0.00086374354,0.00022696932,0.044794213],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997358,0.00004556062,0.00000905615,0.0000623623,0.00006488203,0.00008245715],"domain_scores_gemma":[0.9996847,0.00009130834,0.000049681137,0.000050943174,0.000037038488,0.00008634774],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017012707,0.0004270259,0.00043031253,0.0011863258,0.0015754385,0.0017581567,0.00086788967,0.0006092611,0.016344246],"category_scores_gemma":[0.00061211747,0.00035395013,0.00044729176,0.00048786617,0.0014534703,0.0011809783,0.0015532951,0.0010606535,0.002465561],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007098686,0.000019772497,0.00039402203,0.00003134683,0.000008362937,0.00023063047,0.00020034828,0.0014880317,0.0036925115,0.983469,0.0028049746,0.0075899092],"study_design_scores_gemma":[0.000039207578,0.000050996743,0.0022750502,0.000035385914,0.000023446235,0.00044393467,0.00046079655,0.009593453,0.008259698,0.94905037,0.029727997,0.00003964327],"about_ca_topic_score_codex":0.0018113427,"about_ca_topic_score_gemma":0.0026950368,"teacher_disagreement_score":0.016344246,"about_ca_system_score_codex":0.0008753155,"about_ca_system_score_gemma":0.00033596053,"threshold_uncertainty_score":0.05467695},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4187962,0.00048686133,0.5679399,0.0008618593,0.00010472942,0.0001665574,0.0004454158,0.00095418136,0.010244191],"genre_scores_gemma":[0.7787726,0.00043098678,0.20915388,0.00013184422,0.00011239473,0.00014327138,0.001170317,0.0003446407,0.009740125],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986382,0.00018262267,0.00006879857,0.0005653592,0.0003675969,0.00017736455],"domain_scores_gemma":[0.9976648,0.001095398,0.00028962194,0.00037313421,0.00029330235,0.0002837521],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008928925,0.0007212483,0.0013671656,0.0012960358,0.0015311867,0.001814291,0.0015665562,0.0025438839,0.006543932],"category_scores_gemma":[0.009769445,0.0007197284,0.001099498,0.0012635371,0.0015952832,0.005011378,0.0030724253,0.0012956916,0.0015485922],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014229874,0.00028180672,0.011491704,0.00062636734,0.00019522369,0.0018321879,0.0019447252,0.5105882,0.055682708,0.1541691,0.007981525,0.2537835],"study_design_scores_gemma":[0.00008069318,0.00045375378,0.0025549305,0.0000837376,0.000067156005,0.000845719,0.0007230673,0.8531065,0.01719129,0.1101759,0.014632461,0.000084731866],"about_ca_topic_score_codex":0.0032387187,"about_ca_topic_score_gemma":0.0014961732,"teacher_disagreement_score":0.006543932,"about_ca_system_score_codex":0.0010067808,"about_ca_system_score_gemma":0.0006177035,"threshold_uncertainty_score":0.021891654},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04931944,0.00024479482,0.9281376,0.00012577858,0.000068426634,0.000104166764,0.0004968087,0.0009340124,0.020569088],"genre_scores_gemma":[0.435819,0.00023194058,0.55441433,0.00008024264,0.000056739507,0.00015600293,0.0013959901,0.00026260188,0.0075831427],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99921644,0.00011726155,0.000053691627,0.00017130078,0.00037304935,0.00006821345],"domain_scores_gemma":[0.9990614,0.00030216345,0.00013330825,0.0003150374,0.0001140274,0.00007414133],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041434655,0.00043986284,0.00046764957,0.0006060592,0.00035638918,0.00082074077,0.0011877685,0.0006906089,0.007028798],"category_scores_gemma":[0.004363484,0.00033742937,0.00049421587,0.00077220885,0.0006664809,0.001652874,0.0020194952,0.00088908157,0.0018436157],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010037617,0.00014849518,0.0046303603,0.0005503224,0.000101499776,0.0005461976,0.00074201723,0.23541209,0.061122775,0.22990696,0.015900904,0.44993463],"study_design_scores_gemma":[0.00011445439,0.00029232807,0.0021825472,0.00006166566,0.000032332242,0.0008501198,0.00018201054,0.8423073,0.033099305,0.08162007,0.039215066,0.000042810432],"about_ca_topic_score_codex":0.00095662556,"about_ca_topic_score_gemma":0.0014215931,"teacher_disagreement_score":0.007028798,"about_ca_system_score_codex":0.00037013864,"about_ca_system_score_gemma":0.00030244037,"threshold_uncertainty_score":0.023513615},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039668817,0.007178372,0.8526001,0.007033581,0.0016436559,0.000105959225,0.0007703895,0.000862435,0.09013671],"genre_scores_gemma":[0.66139305,0.008153225,0.28891405,0.0031891288,0.004047153,0.0005278075,0.0007775671,0.0010600457,0.03193796],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963569,0.001280369,0.00021312485,0.00074898486,0.0011520815,0.00024849258],"domain_scores_gemma":[0.96078444,0.029250154,0.0011846198,0.005538766,0.0017924496,0.0014495052],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042056097,0.0008513275,0.002077816,0.0044080475,0.0028678228,0.0043784147,0.0038306324,0.0026111521,0.01472182],"category_scores_gemma":[0.05368225,0.0014332946,0.0016143895,0.004441861,0.009321459,0.011730192,0.008641257,0.006889501,0.0018876233],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037706417,0.000013636668,0.0007276976,0.000079611535,0.000011345601,0.0000953699,0.00016097132,0.0027373803,0.00036502717,0.979989,0.004505453,0.011276725],"study_design_scores_gemma":[0.0000113434235,0.00003600782,0.0007036384,0.00007246445,0.000020562591,0.00041392748,0.00009365584,0.029994184,0.000750679,0.95594364,0.011923545,0.00003639796],"about_ca_topic_score_codex":0.0031734926,"about_ca_topic_score_gemma":0.002837365,"teacher_disagreement_score":0.01472182,"about_ca_system_score_codex":0.0023269895,"about_ca_system_score_gemma":0.0009446083,"threshold_uncertainty_score":0.04924935},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0073034675,0.00027929433,0.97027045,0.0003013192,0.00037568327,0.00010439922,0.00012198931,0.00082941726,0.020413993],"genre_scores_gemma":[0.47149822,0.00082605577,0.45799336,0.00046367213,0.0002825225,0.00057602196,0.0009611331,0.0009818177,0.06641721],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99908876,0.00018712343,0.00005160643,0.00023211789,0.00035689585,0.000083515515],"domain_scores_gemma":[0.9982394,0.00049573864,0.000086997505,0.00059778796,0.00047768475,0.00010246227],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010191216,0.0007984347,0.0013849337,0.0011955291,0.0012224265,0.0012404077,0.0018425076,0.0019631549,0.017296335],"category_scores_gemma":[0.0044727284,0.0005779234,0.00094745564,0.0009505606,0.0009815146,0.0016123042,0.002546775,0.0017101804,0.0036263668],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035786256,0.000085097105,0.00047164335,0.0002810778,0.000109472116,0.0002298814,0.00021359793,0.40949723,0.013769639,0.26619205,0.022312736,0.28647965],"study_design_scores_gemma":[0.00005024847,0.00004957963,0.00011498841,0.000026145199,0.000019096666,0.00008215689,0.000040751096,0.9007403,0.0048510586,0.08246959,0.011533009,0.000023133493],"about_ca_topic_score_codex":0.001653658,"about_ca_topic_score_gemma":0.0016267861,"teacher_disagreement_score":0.017296335,"about_ca_system_score_codex":0.0007842888,"about_ca_system_score_gemma":0.0011142069,"threshold_uncertainty_score":0.057862043},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1589621,0.0004479261,0.8278606,0.0003153415,0.00006050855,0.00016533516,0.0002566766,0.0072406563,0.0046908823],"genre_scores_gemma":[0.67396796,0.00020981014,0.32230142,0.00008385298,0.000022916127,0.00012572826,0.000683152,0.00053231517,0.0020727494],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997189,0.00065954204,0.0001939207,0.00040030474,0.0012162876,0.00034099576],"domain_scores_gemma":[0.9918303,0.0049374197,0.00043018223,0.001780495,0.0006464116,0.0003753056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001579579,0.0011308915,0.0012598387,0.0006255693,0.0007244018,0.0016479172,0.0028363143,0.0019383186,0.0034510694],"category_scores_gemma":[0.0109786345,0.00048847345,0.000780073,0.0014334257,0.0016781641,0.005076941,0.0032374046,0.0011938564,0.0009831121],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0036215738,0.0004914441,0.006510216,0.0006136332,0.00023116493,0.00078540214,0.0011348054,0.63005686,0.06894685,0.055146486,0.0075894766,0.2248721],"study_design_scores_gemma":[0.00006553928,0.00011157488,0.00020656714,0.0000076658225,0.000015480397,0.0000618743,0.0000825953,0.9758251,0.009135896,0.013522687,0.00094645564,0.000018592567],"about_ca_topic_score_codex":0.0053731366,"about_ca_topic_score_gemma":0.0063867564,"teacher_disagreement_score":0.0053731366,"about_ca_system_score_codex":0.00092690624,"about_ca_system_score_gemma":0.00090630364,"threshold_uncertainty_score":0.011545002},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82758707,0.00086628157,0.07860488,0.0007983265,0.00037224437,0.00004008144,0.00066519505,0.00034934023,0.09071657],"genre_scores_gemma":[0.96551615,0.00041080613,0.024104407,0.00010731859,0.00009427693,0.000038465096,0.0005006068,0.00015328205,0.009074579],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996158,0.00009755139,0.00002315701,0.0000874229,0.00009836826,0.000077818666],"domain_scores_gemma":[0.99797493,0.001003193,0.00035540288,0.00017556056,0.00018086401,0.00031014346],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067675975,0.0003827344,0.00034306917,0.0020186738,0.000803317,0.0014476349,0.0006705907,0.00061201246,0.008877441],"category_scores_gemma":[0.0036924265,0.00024921258,0.0002998984,0.0010208631,0.0012957026,0.0019242998,0.000952288,0.0009536334,0.0009959713],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047512408,0.00009373181,0.006226373,0.0001937242,0.000037348243,0.0004372451,0.0007267662,0.024488568,0.0080774445,0.8901398,0.013502769,0.05560102],"study_design_scores_gemma":[0.00004946754,0.00019440957,0.007825503,0.00013457115,0.000056706816,0.0010065451,0.0006241361,0.10428923,0.008236665,0.8572549,0.020263143,0.00006481892],"about_ca_topic_score_codex":0.0010631229,"about_ca_topic_score_gemma":0.0015268001,"teacher_disagreement_score":0.008877441,"about_ca_system_score_codex":0.00066433905,"about_ca_system_score_gemma":0.00036270448,"threshold_uncertainty_score":0.029697955},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018871475,0.00059088576,0.976181,0.00006770117,0.000032206135,0.00006337136,0.000098357246,0.00037476083,0.0037203915],"genre_scores_gemma":[0.40393707,0.0009316807,0.5901391,0.00010430971,0.000093861956,0.00023219662,0.00048826847,0.0003015407,0.0037719146],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995629,0.00010676435,0.00001585558,0.000094299845,0.00017142507,0.000048636528],"domain_scores_gemma":[0.99858814,0.0009458391,0.000105109815,0.00013942235,0.0001659898,0.000055504253],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008386081,0.0006575258,0.00075697654,0.0015017027,0.00047650773,0.0009778612,0.0011383102,0.0005768962,0.0031192685],"category_scores_gemma":[0.0057431194,0.0004005299,0.00084540615,0.0010628985,0.0015527621,0.0020024688,0.0021263508,0.0012670296,0.0010631912],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00051273155,0.00006708349,0.002999021,0.00032928473,0.000052941996,0.0004366332,0.0005778652,0.57982564,0.013428872,0.24241123,0.005112845,0.15424584],"study_design_scores_gemma":[0.000037991784,0.00012747671,0.000740271,0.00006122317,0.000022458376,0.000306289,0.00006652509,0.9060227,0.0054961196,0.07491429,0.012173126,0.000031596028],"about_ca_topic_score_codex":0.002916876,"about_ca_topic_score_gemma":0.0017601531,"teacher_disagreement_score":0.0031192685,"about_ca_system_score_codex":0.00057601766,"about_ca_system_score_gemma":0.00049720635,"threshold_uncertainty_score":0.010434985},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5611389,0.0012274238,0.39587128,0.002720839,0.00014891369,0.00066032517,0.008442414,0.0015933859,0.028196486],"genre_scores_gemma":[0.83467025,0.00049892074,0.1455357,0.0005209174,0.0001159719,0.0003155803,0.010474676,0.00022562628,0.0076422864],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990319,0.00015612968,0.000041040235,0.00033467697,0.0003088088,0.00012741292],"domain_scores_gemma":[0.9967018,0.001722132,0.00047537754,0.0006490385,0.00021105283,0.00024058667],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037254376,0.0006277933,0.0009943041,0.0008247104,0.0011778146,0.0015863503,0.0016353435,0.0019251554,0.007750353],"category_scores_gemma":[0.0050814836,0.00048028852,0.0007680148,0.001611355,0.0014316187,0.0042989184,0.001581058,0.0011204729,0.00063588633],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0021740405,0.000565558,0.015207411,0.0017923678,0.00023681083,0.00268452,0.0021049029,0.39861807,0.02427448,0.27476636,0.052979626,0.22459581],"study_design_scores_gemma":[0.00020542354,0.00029206544,0.0070008826,0.00013771035,0.000096011965,0.0020967054,0.00096210506,0.6122107,0.012668224,0.32428908,0.03998558,0.000055570537],"about_ca_topic_score_codex":0.0033953616,"about_ca_topic_score_gemma":0.0026914289,"teacher_disagreement_score":0.007750353,"about_ca_system_score_codex":0.0012449078,"about_ca_system_score_gemma":0.00073487015,"threshold_uncertainty_score":0.025927544},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038135834,0.0005976857,0.9461706,0.00052845624,0.00026613913,0.00005611935,0.00038563387,0.0004156077,0.013443966],"genre_scores_gemma":[0.40446708,0.0007806943,0.54445726,0.00027655778,0.00020582194,0.0003174122,0.0012545398,0.00073058787,0.047510017],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993104,0.00017324096,0.00003753708,0.00013753258,0.00025149505,0.000089797744],"domain_scores_gemma":[0.9989826,0.0003360603,0.000068832596,0.00018610129,0.00032364193,0.000102635706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009254638,0.0009962787,0.0014912331,0.0019724595,0.0009413365,0.0014454459,0.0017301341,0.0019095987,0.012167511],"category_scores_gemma":[0.004294017,0.00041573762,0.000757799,0.0011080359,0.000659526,0.0023919141,0.0022877608,0.0015870399,0.0021427975],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008012926,0.00021793898,0.0009548598,0.0005808113,0.000120939774,0.00016532667,0.00014184456,0.12296931,0.019341342,0.4639765,0.017564727,0.37316513],"study_design_scores_gemma":[0.000060763166,0.0002804753,0.00075246725,0.0001037086,0.00006195251,0.00044094337,0.00007746421,0.45159817,0.010977883,0.51505834,0.0205426,0.000045152035],"about_ca_topic_score_codex":0.0009201492,"about_ca_topic_score_gemma":0.0011049943,"teacher_disagreement_score":0.012167511,"about_ca_system_score_codex":0.0008433412,"about_ca_system_score_gemma":0.0009806182,"threshold_uncertainty_score":0.04070437},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.096186645,0.0012879919,0.7432456,0.0013233763,0.0006588675,0.00013316567,0.0012644508,0.0013013803,0.15459853],"genre_scores_gemma":[0.63108134,0.0020091375,0.25814047,0.0007864422,0.00042947417,0.00018086756,0.0028003019,0.0010991121,0.103472844],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996667,0.00008603991,0.000014578716,0.0000720291,0.00011383065,0.000046898353],"domain_scores_gemma":[0.9994198,0.00019498909,0.0000896173,0.00011018807,0.00011974544,0.00006568872],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024000269,0.00043467607,0.00034532315,0.0018663388,0.00087083987,0.0016432812,0.0007483032,0.00065222074,0.018547308],"category_scores_gemma":[0.0015712461,0.00029657144,0.0004804417,0.0012383414,0.0010984876,0.0021654365,0.0015199207,0.0010299506,0.0043626763],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053152777,0.000030736104,0.00061231415,0.00008772902,0.00001639068,0.00015079074,0.00015108858,0.0075223576,0.0026502209,0.9037637,0.017001385,0.06796009],"study_design_scores_gemma":[0.000024657285,0.000028524497,0.00055986084,0.00005703445,0.000016757946,0.00032158106,0.00022576781,0.038248956,0.0027113385,0.9016287,0.05615862,0.00001833276],"about_ca_topic_score_codex":0.0011305683,"about_ca_topic_score_gemma":0.0020533653,"teacher_disagreement_score":0.018547308,"about_ca_system_score_codex":0.0005622124,"about_ca_system_score_gemma":0.0002785701,"threshold_uncertainty_score":0.062046885},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.099297054,0.00035997786,0.8915187,0.00015269732,0.000030584346,0.00017942415,0.000746281,0.00046983425,0.0072454684],"genre_scores_gemma":[0.5418321,0.00033443485,0.4493126,0.0001404186,0.000022385811,0.0002934501,0.0021228748,0.00025226802,0.0056893923],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991291,0.0002135139,0.000049601233,0.00025764742,0.00023041574,0.00011966689],"domain_scores_gemma":[0.998251,0.0006431214,0.00035252617,0.00039813333,0.00021646176,0.00013873358],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046902188,0.00078742806,0.0006084205,0.0007721448,0.0006356161,0.0007478469,0.0018351951,0.000898672,0.004538391],"category_scores_gemma":[0.003892354,0.00056027295,0.0004790063,0.0010834803,0.0009794902,0.001806577,0.0023047961,0.0005748267,0.00059810106],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044286242,0.00006048171,0.0034846351,0.0005413602,0.000089273206,0.0008746085,0.00046558675,0.69016063,0.0204833,0.15231182,0.006422693,0.124662735],"study_design_scores_gemma":[0.000040628736,0.00012488362,0.0016908303,0.00007902351,0.000035948957,0.0008845109,0.0003338555,0.878533,0.012126279,0.08851796,0.017579796,0.000053381384],"about_ca_topic_score_codex":0.003579804,"about_ca_topic_score_gemma":0.0057595447,"teacher_disagreement_score":0.004538391,"about_ca_system_score_codex":0.0005960458,"about_ca_system_score_gemma":0.00051695923,"threshold_uncertainty_score":0.0151824355},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008076159,0.023833493,0.17827235,0.052456092,0.020233262,0.00072105235,0.032939274,0.008075943,0.6753923],"genre_scores_gemma":[0.12550162,0.032664943,0.15825768,0.021230549,0.018442914,0.0031114167,0.15279077,0.012298271,0.4757019],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9936964,0.0010722359,0.00031196003,0.0010268936,0.0032092007,0.00068325415],"domain_scores_gemma":[0.99497545,0.0019980303,0.00019552848,0.0009771009,0.0011905076,0.00066345447],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003737538,0.002131078,0.00256358,0.0029198313,0.0036774345,0.0073968004,0.0031927882,0.0038036448,0.15511069],"category_scores_gemma":[0.01313621,0.0010390423,0.0021674526,0.005676135,0.0019061937,0.006659083,0.0068768337,0.007964172,0.052011818],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013279334,0.000102044345,0.0003614651,0.00060688,0.000049127917,0.000114893366,0.00015954103,0.0036933455,0.0003178858,0.18640941,0.71631664,0.09173599],"study_design_scores_gemma":[0.00006618729,0.000034578887,0.00048667783,0.00033683216,0.00001902598,0.00017785202,0.0001300991,0.0046565426,0.00039451572,0.24820273,0.7454524,0.000042546184],"about_ca_topic_score_codex":0.009704736,"about_ca_topic_score_gemma":0.008718375,"teacher_disagreement_score":0.15511069,"about_ca_system_score_codex":0.006836266,"about_ca_system_score_gemma":0.0054280865,"threshold_uncertainty_score":0.51889694},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43315795,0.00068050576,0.32866344,0.0011112416,0.00031625928,0.00016795442,0.0022504663,0.0011011738,0.23255095],"genre_scores_gemma":[0.90605074,0.00024917995,0.05267808,0.00019777473,0.000055905126,0.00009187788,0.0016287577,0.00034164358,0.038706068],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996711,0.00006602879,0.000019823907,0.00006776114,0.0001149023,0.000060417573],"domain_scores_gemma":[0.9991536,0.00034585662,0.00011663387,0.00015143605,0.00011814136,0.00011432562],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024314821,0.00043734757,0.00034252083,0.0011733801,0.0010085857,0.0015114645,0.0008622138,0.00076739077,0.013475583],"category_scores_gemma":[0.0017354204,0.00032376195,0.0005454245,0.000700027,0.0011068438,0.0017282664,0.0014625221,0.0009593793,0.0018378105],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006831137,0.000021885367,0.00051499926,0.00007514818,0.000012955923,0.00035133233,0.00025235076,0.0041773207,0.00440398,0.97004175,0.0044272756,0.015652714],"study_design_scores_gemma":[0.000022707536,0.000026188058,0.0007057925,0.000043819702,0.000013717225,0.0004645071,0.00024688308,0.017845582,0.004269943,0.9562201,0.020120548,0.000020221514],"about_ca_topic_score_codex":0.0010848633,"about_ca_topic_score_gemma":0.0018949232,"teacher_disagreement_score":0.013475583,"about_ca_system_score_codex":0.00070894475,"about_ca_system_score_gemma":0.00036078726,"threshold_uncertainty_score":0.045080364},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10523923,0.00060524023,0.8478253,0.00020888832,0.00012754848,0.000093394985,0.00031978922,0.00034395175,0.0452367],"genre_scores_gemma":[0.6340277,0.0013541267,0.3277554,0.00016507349,0.00010704835,0.00013249881,0.0010201287,0.0003780441,0.03506004],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99969494,0.000039151822,0.000017481812,0.00009192456,0.00012396963,0.000032582735],"domain_scores_gemma":[0.99956447,0.00008547655,0.000116254865,0.00009103688,0.000094229326,0.0000484688],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024389074,0.00051365263,0.0002764635,0.0014695157,0.000717084,0.0010968236,0.0006865518,0.00074039237,0.0072978884],"category_scores_gemma":[0.0012362548,0.0003910927,0.0005313886,0.0009999598,0.0015380117,0.0023035137,0.0015960459,0.0008787141,0.0018234894],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052557836,0.000019835448,0.0009933282,0.00011353294,0.000020480988,0.00037593732,0.00027788326,0.017484903,0.010348389,0.9034845,0.0020983994,0.06473034],"study_design_scores_gemma":[0.000022220953,0.00015184093,0.0019559439,0.000110627494,0.00004036089,0.002139504,0.0005479781,0.096685275,0.010634424,0.8020349,0.08563449,0.000042488635],"about_ca_topic_score_codex":0.00066963665,"about_ca_topic_score_gemma":0.0011794026,"teacher_disagreement_score":0.0072978884,"about_ca_system_score_codex":0.0003606547,"about_ca_system_score_gemma":0.00023455679,"threshold_uncertainty_score":0.024413943},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.538669,0.0012715078,0.42964017,0.005770796,0.0002561276,0.00057939155,0.0047501833,0.0022866195,0.016776046],"genre_scores_gemma":[0.68040925,0.00059634267,0.30598924,0.00044378403,0.00013601157,0.00033653845,0.0057478,0.0004189783,0.0059219836],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983004,0.00034728437,0.00015828948,0.00055942795,0.0003839506,0.00025072336],"domain_scores_gemma":[0.9891299,0.008260852,0.00084819965,0.0008906838,0.00041929143,0.00045105428],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001004469,0.0008130663,0.0017185705,0.0005909261,0.0016305906,0.0020764037,0.0026827585,0.0024799104,0.007542878],"category_scores_gemma":[0.009795866,0.0008762714,0.0016824412,0.001437639,0.0022754106,0.0058675795,0.0025132692,0.0027858072,0.0009314451],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020772978,0.0008506664,0.01054355,0.002418597,0.00045083818,0.0011264146,0.0011029884,0.5522082,0.020716086,0.07249856,0.02788765,0.30811924],"study_design_scores_gemma":[0.00038164653,0.00045936403,0.0035174391,0.00015497196,0.00015662564,0.001179199,0.0013604244,0.6995334,0.014705709,0.26619548,0.012277056,0.000078714496],"about_ca_topic_score_codex":0.0026754236,"about_ca_topic_score_gemma":0.0040227077,"teacher_disagreement_score":0.007542878,"about_ca_system_score_codex":0.0014116976,"about_ca_system_score_gemma":0.0011831755,"threshold_uncertainty_score":0.025233448},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12996054,0.0015586929,0.46389046,0.0018601194,0.0029169803,0.0005231327,0.005842513,0.004016498,0.38943118],"genre_scores_gemma":[0.5912285,0.001014894,0.13201776,0.0004762241,0.00052530656,0.0002485758,0.005534833,0.0020820738,0.26687187],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99926466,0.00008178868,0.000058870588,0.00016109011,0.00023641819,0.00019713564],"domain_scores_gemma":[0.99892104,0.0002346758,0.00011458124,0.00020489059,0.00034443365,0.00018043118],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042195787,0.0006822411,0.00091097003,0.001588585,0.0017957302,0.002654737,0.0011407785,0.0007553297,0.07029347],"category_scores_gemma":[0.002018038,0.00048037185,0.0009010079,0.0013069061,0.001521247,0.0024097129,0.0020713175,0.0014068157,0.01700399],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00052545266,0.00010178945,0.0012626013,0.00034014246,0.000038731127,0.00089442113,0.0004961846,0.0032514168,0.014515742,0.84872544,0.046907242,0.08294091],"study_design_scores_gemma":[0.00008586125,0.00012034997,0.0010843001,0.00012460077,0.000042038508,0.00069189747,0.0005728177,0.008133154,0.016111841,0.5942447,0.37873888,0.000049504895],"about_ca_topic_score_codex":0.0013772197,"about_ca_topic_score_gemma":0.001915209,"teacher_disagreement_score":0.07029347,"about_ca_system_score_codex":0.00084203994,"about_ca_system_score_gemma":0.0005764315,"threshold_uncertainty_score":0.2351551},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.066678904,0.0021862658,0.90472543,0.0015065034,0.00042630054,0.00048775136,0.0008698256,0.0071648364,0.015954144],"genre_scores_gemma":[0.14960733,0.00054247666,0.8400101,0.0004753732,0.00018295173,0.00054350606,0.002549712,0.0005663045,0.0055222856],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99847275,0.00022840555,0.00010441593,0.00037596512,0.00048072755,0.0003377359],"domain_scores_gemma":[0.9982273,0.00078502565,0.00015174359,0.00047637965,0.0002255933,0.00013391364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010365556,0.0021420575,0.0023635174,0.0017682962,0.0011760993,0.0023967242,0.0034588792,0.0027310278,0.015537431],"category_scores_gemma":[0.004598196,0.00077636953,0.0017752816,0.0035497537,0.0007013692,0.004861485,0.002734842,0.0024939885,0.004199613],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001687987,0.00080854446,0.001929464,0.00062114303,0.00022266677,0.00035319387,0.00045734507,0.27411607,0.01622828,0.03357184,0.042911895,0.6270916],"study_design_scores_gemma":[0.0005065445,0.00019978595,0.00056326727,0.000043497344,0.000059747053,0.0003458213,0.00014290087,0.9379404,0.004239595,0.041819446,0.014093955,0.00004504202],"about_ca_topic_score_codex":0.0060312147,"about_ca_topic_score_gemma":0.0068429806,"teacher_disagreement_score":0.015537431,"about_ca_system_score_codex":0.002330148,"about_ca_system_score_gemma":0.0025172841,"threshold_uncertainty_score":0.051977932},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2899553,0.0018937894,0.6595845,0.0031616527,0.00016477433,0.0008121,0.013209184,0.013550286,0.017668447],"genre_scores_gemma":[0.5033297,0.00080142333,0.47336832,0.00035617544,0.000072791736,0.00034202493,0.013430453,0.00058100943,0.0077182096],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99871767,0.00021099702,0.00010112478,0.00039459905,0.00027561514,0.00030002283],"domain_scores_gemma":[0.9970094,0.001992203,0.00028379515,0.00042519526,0.00016925363,0.00012007271],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069257733,0.0007254895,0.00111918,0.00068035105,0.0010421169,0.001247536,0.001321386,0.0016984167,0.010294018],"category_scores_gemma":[0.0044899574,0.0007118816,0.00084091263,0.0017839695,0.0007418642,0.0058570527,0.0026515976,0.0009432624,0.0019853702],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.006370632,0.0012419637,0.015675884,0.0026786535,0.00022047655,0.0032978526,0.002031877,0.16701955,0.11085604,0.12286417,0.08692378,0.4808192],"study_design_scores_gemma":[0.0010067067,0.0017042463,0.0057975,0.00018924371,0.00016376429,0.002958252,0.0030253076,0.66413325,0.07707133,0.17357478,0.07019096,0.00018466536],"about_ca_topic_score_codex":0.0027851611,"about_ca_topic_score_gemma":0.0055472176,"teacher_disagreement_score":0.010294018,"about_ca_system_score_codex":0.00052446907,"about_ca_system_score_gemma":0.0010622542,"threshold_uncertainty_score":0.03443694},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2245617,0.0010457444,0.7370328,0.00038658304,0.0001475288,0.0005250193,0.0047461,0.0024302278,0.029124254],"genre_scores_gemma":[0.42373803,0.0006715215,0.55546874,0.00007699432,0.000024502804,0.0003141527,0.006504627,0.00030734573,0.012894032],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99979323,0.000019504585,0.00001446602,0.00005753321,0.00006754352,0.000047761067],"domain_scores_gemma":[0.9995617,0.00015077506,0.000060553895,0.00009351922,0.00009153153,0.000041908672],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016646157,0.00043499132,0.00029553924,0.0006370249,0.0006255142,0.0005685152,0.0006513365,0.00045894395,0.007996568],"category_scores_gemma":[0.002561452,0.00029935452,0.00033093392,0.00071868976,0.00034398324,0.001007081,0.00096053956,0.000549771,0.0012167351],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00070886663,0.00017773948,0.0071846065,0.0010728416,0.00008118074,0.0007308121,0.0011562465,0.15422608,0.050019696,0.2013633,0.031935375,0.5513433],"study_design_scores_gemma":[0.00016600746,0.0004672392,0.005392456,0.00035036964,0.000072313334,0.0015375402,0.0012240746,0.49780312,0.05307069,0.29194537,0.14789318,0.00007759805],"about_ca_topic_score_codex":0.0019781187,"about_ca_topic_score_gemma":0.004259976,"teacher_disagreement_score":0.007996568,"about_ca_system_score_codex":0.00045427695,"about_ca_system_score_gemma":0.00051608775,"threshold_uncertainty_score":0.02675116},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.73857903,0.00043670702,0.11744913,0.0008262999,0.00019069074,0.000121322024,0.0015094082,0.00059881486,0.14028862],"genre_scores_gemma":[0.97370005,0.00017241204,0.012663153,0.000115925075,0.000026827918,0.000049106413,0.00091759267,0.000110238936,0.012244625],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997342,0.00004797453,0.000015242371,0.000058526683,0.00006247238,0.00008158945],"domain_scores_gemma":[0.99908614,0.00041931716,0.00014585216,0.00016000253,0.00006872946,0.00011992588],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002443164,0.0002876483,0.00037521368,0.00042900152,0.0007719701,0.001460808,0.0007366788,0.0006637312,0.014281947],"category_scores_gemma":[0.0016223043,0.00028349037,0.00041230593,0.000616767,0.0008933546,0.0013814515,0.00096254214,0.0008616889,0.0010275802],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047175048,0.00007306263,0.0021587622,0.0002761344,0.00003278472,0.0006551509,0.0006242227,0.022536768,0.014155896,0.8915799,0.012344796,0.05509081],"study_design_scores_gemma":[0.000094391384,0.00007436167,0.0022785976,0.0000467032,0.000037798145,0.000685127,0.00048409638,0.053364307,0.009276996,0.9206161,0.013003057,0.000038359598],"about_ca_topic_score_codex":0.0020338122,"about_ca_topic_score_gemma":0.002364732,"teacher_disagreement_score":0.014281947,"about_ca_system_score_codex":0.0006301909,"about_ca_system_score_gemma":0.0003665981,"threshold_uncertainty_score":0.04777789},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70608324,0.00061555597,0.13300356,0.0015114945,0.00044377087,0.00012271621,0.0017195694,0.0009781976,0.15552193],"genre_scores_gemma":[0.9065963,0.00031913535,0.046848122,0.00025654095,0.00007089997,0.00007348031,0.0018262076,0.0003000847,0.043709144],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99980956,0.000030407957,0.0000083699515,0.0000513801,0.000040995954,0.00005931566],"domain_scores_gemma":[0.99919444,0.00028113383,0.00007704624,0.00010377489,0.000122022866,0.00022155918],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019409745,0.00036240535,0.00041629997,0.00097059173,0.0019033181,0.0013669039,0.001034176,0.0009981304,0.01872128],"category_scores_gemma":[0.0011795919,0.00025838945,0.00048529828,0.0006500141,0.0009458966,0.0012771842,0.00079002255,0.0010811718,0.0022279052],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045905035,0.00018170032,0.0031163117,0.0003186967,0.00003308144,0.00070574915,0.00056744355,0.013385494,0.021014506,0.8731541,0.030210186,0.056853637],"study_design_scores_gemma":[0.000108341475,0.00017830067,0.006198662,0.00012333825,0.00009725421,0.001265577,0.00087009295,0.09444985,0.017725749,0.80967015,0.06922205,0.00009068176],"about_ca_topic_score_codex":0.0039596683,"about_ca_topic_score_gemma":0.0053689512,"teacher_disagreement_score":0.01872128,"about_ca_system_score_codex":0.0009881919,"about_ca_system_score_gemma":0.0006235838,"threshold_uncertainty_score":0.062628925},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055171784,0.00029638797,0.8989874,0.0004619765,0.00016745122,0.00023737483,0.0012011568,0.0023995019,0.0410769],"genre_scores_gemma":[0.43023846,0.000296705,0.54647017,0.00014033288,0.000043978747,0.00033005176,0.0030601353,0.00048561845,0.018934539],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990771,0.00021480251,0.00005954381,0.00022278,0.0002553547,0.00017046179],"domain_scores_gemma":[0.99871945,0.00044460158,0.000096904754,0.000547828,0.00011233304,0.000078846824],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057272014,0.00063003926,0.00057275675,0.00066743215,0.0011349607,0.0016282069,0.0014290131,0.0012331788,0.019047197],"category_scores_gemma":[0.0030966438,0.0005279445,0.0010053704,0.0010476874,0.0012353108,0.0028218238,0.0022811668,0.0013405349,0.004588544],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00055644265,0.00011091144,0.0017961948,0.00031085536,0.000043343545,0.00032832247,0.000515365,0.046186026,0.014218612,0.7142955,0.015569443,0.2060689],"study_design_scores_gemma":[0.00014220786,0.00014387033,0.00034831,0.00006446102,0.000040505438,0.00040335042,0.0004245073,0.1652677,0.020004503,0.7530209,0.06007968,0.000060002163],"about_ca_topic_score_codex":0.0017660159,"about_ca_topic_score_gemma":0.0042233476,"teacher_disagreement_score":0.019047197,"about_ca_system_score_codex":0.00081173715,"about_ca_system_score_gemma":0.0011038512,"threshold_uncertainty_score":0.06371921},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14628437,0.00035125358,0.8350663,0.0001485253,0.000070447284,0.00019028968,0.0011741853,0.0011468366,0.01556768],"genre_scores_gemma":[0.5777809,0.00035818954,0.41388482,0.000061462284,0.000020729076,0.00012204341,0.0022560924,0.00014297458,0.005372879],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997063,0.000045752688,0.00001770165,0.000060728933,0.00008167134,0.0000877993],"domain_scores_gemma":[0.9995633,0.0001691048,0.00007083408,0.00010278688,0.000044065517,0.000049900405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019608502,0.00042646023,0.0004844324,0.00047213043,0.0005373181,0.0005549957,0.00071758655,0.00037237475,0.004206045],"category_scores_gemma":[0.0013075181,0.00026714487,0.00045262728,0.00062117813,0.0005127444,0.0011709895,0.0019740167,0.0005468834,0.000514163],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006625464,0.00019765159,0.005939152,0.000583898,0.000060017297,0.000695326,0.0005885654,0.39590633,0.034485955,0.15227394,0.01356575,0.39504093],"study_design_scores_gemma":[0.000078478195,0.00019850941,0.0014282861,0.00005039493,0.000025909343,0.000504549,0.0003838346,0.82279766,0.0110865,0.12951718,0.033900358,0.000028339042],"about_ca_topic_score_codex":0.003394584,"about_ca_topic_score_gemma":0.0055180723,"teacher_disagreement_score":0.004206045,"about_ca_system_score_codex":0.0003159859,"about_ca_system_score_gemma":0.0004820279,"threshold_uncertainty_score":0.0140705705},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25147444,0.0008285371,0.6699606,0.00059316587,0.00021353381,0.00015495201,0.0009753052,0.00047171133,0.07532764],"genre_scores_gemma":[0.90216404,0.0010144254,0.07481768,0.00014145182,0.00020996633,0.00011384414,0.002212318,0.0001482972,0.019178078],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99927586,0.00008069292,0.000051008035,0.00016423893,0.00032208968,0.0001061821],"domain_scores_gemma":[0.9989888,0.0002879817,0.00018059509,0.00012044197,0.00023397325,0.00018825053],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044051997,0.0006654261,0.0005752712,0.0010505249,0.00064469373,0.0013404934,0.0006701347,0.000671719,0.0058605415],"category_scores_gemma":[0.0018242811,0.000298169,0.0004994084,0.0010278235,0.002489442,0.002839867,0.0024131485,0.0014782773,0.0018847819],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026983258,0.00006551569,0.003119535,0.0003142208,0.000060999526,0.0016587109,0.0009720942,0.022397894,0.02073181,0.8673463,0.005869332,0.077193834],"study_design_scores_gemma":[0.000024159091,0.00047243905,0.0070788055,0.000076025215,0.000035360234,0.0037054664,0.0011371815,0.11753372,0.021088744,0.80542845,0.043350812,0.00006881649],"about_ca_topic_score_codex":0.00093778543,"about_ca_topic_score_gemma":0.00075202587,"teacher_disagreement_score":0.0058605415,"about_ca_system_score_codex":0.0003181827,"about_ca_system_score_gemma":0.00022198056,"threshold_uncertainty_score":0.019605458},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02079854,0.0006282579,0.95962733,0.00019517636,0.0002968224,0.000109712906,0.001109249,0.004179357,0.013055478],"genre_scores_gemma":[0.28916073,0.0007366413,0.68892395,0.00022073669,0.000105512605,0.00022597086,0.0031596685,0.0019850857,0.015481784],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996045,0.000059367212,0.000034733435,0.000053543194,0.00017803228,0.00006991166],"domain_scores_gemma":[0.9992545,0.00025777682,0.000047466136,0.0002277549,0.00015251913,0.000060051134],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048172203,0.0005114636,0.0006546938,0.00070909545,0.0006825455,0.0011562598,0.0013240712,0.00065631873,0.014487517],"category_scores_gemma":[0.0025791312,0.00041858334,0.00062382844,0.0007723067,0.0010191746,0.0015783552,0.0025521175,0.0016665523,0.004316235],"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.00073521025,0.00013949018,0.0013650381,0.0004936724,0.000027557899,0.00026659656,0.00048981607,0.0463826,0.010502358,0.4631235,0.037504755,0.43896925],"study_design_scores_gemma":[0.00015231437,0.00021608264,0.0007697173,0.00031310247,0.000037570164,0.00043482083,0.00044553366,0.31064698,0.019702584,0.51485276,0.15237443,0.000054039676],"about_ca_topic_score_codex":0.0021552683,"about_ca_topic_score_gemma":0.00429889,"teacher_disagreement_score":0.014487517,"about_ca_system_score_codex":0.00034248814,"about_ca_system_score_gemma":0.00068873505,"threshold_uncertainty_score":0.04846555},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00915919,0.020049786,0.90104383,0.004065007,0.0020167357,0.00014084032,0.00079318194,0.0013022526,0.061429225],"genre_scores_gemma":[0.1511633,0.014233455,0.7854655,0.0022838472,0.0010861933,0.00038165846,0.0016216703,0.0008028829,0.04296154],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99871075,0.0002596047,0.000078964054,0.00033470595,0.0004832432,0.00013279065],"domain_scores_gemma":[0.99920326,0.0003974254,0.00006452152,0.00020861597,0.00008137824,0.000044748063],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009079882,0.0010841747,0.000868876,0.0012397517,0.0014279928,0.0033132634,0.0014822086,0.0019013145,0.014801782],"category_scores_gemma":[0.0034361815,0.0011121957,0.0014575322,0.0027549812,0.0023979978,0.0044604666,0.00281969,0.0039098584,0.004884207],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009588657,0.000030634357,0.00041991155,0.00046726593,0.000025439489,0.00014284236,0.00031171564,0.024931332,0.0023802544,0.75969017,0.028786112,0.18271853],"study_design_scores_gemma":[0.000045063098,0.000065580425,0.00048038893,0.00020403098,0.000022547252,0.00079232996,0.00018352257,0.05824029,0.0032443376,0.6805488,0.2561171,0.000056170145],"about_ca_topic_score_codex":0.003339339,"about_ca_topic_score_gemma":0.0056576035,"teacher_disagreement_score":0.014801782,"about_ca_system_score_codex":0.0021295222,"about_ca_system_score_gemma":0.0011286271,"threshold_uncertainty_score":0.049516857},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3741399,0.0003509057,0.6191534,0.00021453605,0.000032600336,0.0000935153,0.00020931526,0.0010167684,0.0047891065],"genre_scores_gemma":[0.70754206,0.0004514558,0.28809953,0.00006248628,0.000014941731,0.000069989794,0.00050967897,0.0003714837,0.0028784631],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99960905,0.000046592828,0.000024441677,0.000075732125,0.00013626443,0.00010784616],"domain_scores_gemma":[0.9989513,0.00034940618,0.00018883268,0.00033837263,0.00009505261,0.000076971985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003571015,0.0005924739,0.0005724508,0.00055242836,0.0005147468,0.0006403597,0.00089949486,0.00065766904,0.001666127],"category_scores_gemma":[0.0021813242,0.00041811317,0.0007561881,0.0006634782,0.00081054756,0.0012439165,0.001708274,0.0007924768,0.0003747172],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005056381,0.00016964202,0.0056389207,0.00030563443,0.000080297075,0.0005960237,0.0005422064,0.59610873,0.14165194,0.023607973,0.002475874,0.22831711],"study_design_scores_gemma":[0.000038115777,0.0003031445,0.0012402938,0.000039488354,0.00003641302,0.00044098322,0.00038326829,0.8916595,0.075864896,0.019806935,0.010146475,0.00004041624],"about_ca_topic_score_codex":0.0017323665,"about_ca_topic_score_gemma":0.0016264825,"teacher_disagreement_score":0.0017323665,"about_ca_system_score_codex":0.0002937521,"about_ca_system_score_gemma":0.0004079601,"threshold_uncertainty_score":0.0055737495},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44538188,0.0013474753,0.413094,0.0013690239,0.0011737756,0.00013555434,0.00061598705,0.0010496861,0.13583265],"genre_scores_gemma":[0.87367165,0.0006415426,0.08075742,0.00039457672,0.00026450842,0.00009044306,0.0005233834,0.000616056,0.043040443],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993542,0.00016626975,0.00004543408,0.000118308955,0.00016243315,0.00015349658],"domain_scores_gemma":[0.9987859,0.00036159702,0.00020038323,0.000188105,0.00021468442,0.00024929896],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007954555,0.0006269263,0.0004602377,0.0018543899,0.0017128541,0.0023724402,0.00094554876,0.0009948588,0.009774585],"category_scores_gemma":[0.0022585758,0.00047028187,0.00085208705,0.0008105997,0.0022023062,0.0042078765,0.0023059885,0.001595009,0.0017661991],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003092703,0.000017966182,0.0002096664,0.000029741701,0.0000048835864,0.00008470796,0.00016389509,0.0008332107,0.001147852,0.98951334,0.0015770878,0.006386797],"study_design_scores_gemma":[0.000007168752,0.000013350399,0.00015387517,0.00002075784,0.000006446572,0.0001281821,0.00011266124,0.0043753954,0.001132398,0.98888946,0.005147556,0.000012813059],"about_ca_topic_score_codex":0.0012579934,"about_ca_topic_score_gemma":0.0020583968,"teacher_disagreement_score":0.009774585,"about_ca_system_score_codex":0.0010025454,"about_ca_system_score_gemma":0.00064760004,"threshold_uncertainty_score":0.032699287},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015080671,0.0027189723,0.51168025,0.0058016554,0.0069592246,0.00017466288,0.0019671812,0.0025397225,0.45307773],"genre_scores_gemma":[0.3649639,0.0028040637,0.3465194,0.0050370824,0.0022379656,0.000481332,0.0032806315,0.0027669522,0.27190864],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985594,0.00025025994,0.00010712547,0.00033561455,0.0005928569,0.00015474072],"domain_scores_gemma":[0.99878556,0.00039439206,0.00007039795,0.00033661415,0.00031647147,0.000096658],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001060751,0.00086190406,0.0009480023,0.0013883804,0.0020203365,0.0037550551,0.0017559838,0.0013879403,0.0527914],"category_scores_gemma":[0.0053693256,0.0005164184,0.00091995596,0.0017378035,0.0027637267,0.0068393946,0.0032923252,0.0038622275,0.019911379],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006706829,0.000021955339,0.0001133555,0.000090843234,0.000006924853,0.00007374621,0.00010285497,0.0004332076,0.0009367119,0.9306186,0.033699255,0.033835415],"study_design_scores_gemma":[0.000025456855,0.00004023097,0.00014971444,0.000087258646,0.000018415656,0.0003067362,0.000099540695,0.004136807,0.0020244892,0.7971358,0.19594842,0.000027178236],"about_ca_topic_score_codex":0.0011979379,"about_ca_topic_score_gemma":0.0019089199,"teacher_disagreement_score":0.0527914,"about_ca_system_score_codex":0.0015207545,"about_ca_system_score_gemma":0.0008513843,"threshold_uncertainty_score":0.1766048},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19662164,0.0005244813,0.66891944,0.0008687792,0.00018523536,0.00017724943,0.0019913302,0.0012434389,0.12946847],"genre_scores_gemma":[0.7234976,0.00042216916,0.20822394,0.00045505757,0.00008211038,0.00017379405,0.0026907085,0.00033078025,0.064123794],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997099,0.00007523598,0.000017825992,0.00007701046,0.00007775188,0.000042236978],"domain_scores_gemma":[0.99899083,0.00038876425,0.0001151071,0.00017804415,0.00017599924,0.00015112905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002525828,0.0003703822,0.00028836276,0.0013342942,0.00082869484,0.0014717347,0.0010259452,0.00061602966,0.020814886],"category_scores_gemma":[0.0017480503,0.0003519566,0.00042942027,0.0011008993,0.0006455536,0.0023180456,0.0012192009,0.0009638476,0.0024811516],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008668038,0.000049200524,0.00081685005,0.00012701459,0.000023605791,0.0002557137,0.00016037203,0.00606738,0.0038752267,0.937979,0.008098342,0.042460546],"study_design_scores_gemma":[0.00004133692,0.000043692024,0.00067867455,0.000065297034,0.000035333716,0.00050822913,0.0002452758,0.06770029,0.004989486,0.88304615,0.042626016,0.000020250236],"about_ca_topic_score_codex":0.0007406556,"about_ca_topic_score_gemma":0.002128266,"teacher_disagreement_score":0.020814886,"about_ca_system_score_codex":0.00066744105,"about_ca_system_score_gemma":0.00032083402,"threshold_uncertainty_score":0.06963277},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031853855,0.0005386164,0.9207672,0.00043259957,0.0002874573,0.00013692761,0.00037761166,0.002942513,0.042663317],"genre_scores_gemma":[0.22749992,0.001308782,0.7372007,0.00021101991,0.00013576479,0.0001820039,0.0011556208,0.0016792701,0.030626964],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995295,0.000066953784,0.000023034007,0.0001467349,0.00018399012,0.00004983176],"domain_scores_gemma":[0.99946684,0.00022077201,0.000038283026,0.00012975979,0.00008901893,0.00005535573],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029468842,0.002046277,0.0010286699,0.0010314909,0.0008284248,0.0014874168,0.0020998348,0.0011879875,0.02118931],"category_scores_gemma":[0.0016900791,0.0013327644,0.0008629456,0.0016032883,0.000916308,0.0023770018,0.0031631796,0.002399786,0.004340733],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003109141,0.000119158896,0.00062698656,0.00085981895,0.0001558829,0.0006547286,0.0005585299,0.16030405,0.040947605,0.19895451,0.034569945,0.5619379],"study_design_scores_gemma":[0.00012655425,0.00022648582,0.0005711345,0.00020523532,0.000120224824,0.00088449137,0.00040672306,0.47476235,0.031165803,0.39123005,0.10020379,0.00009722537],"about_ca_topic_score_codex":0.0012305066,"about_ca_topic_score_gemma":0.0023028564,"teacher_disagreement_score":0.02118931,"about_ca_system_score_codex":0.0005863402,"about_ca_system_score_gemma":0.00034847183,"threshold_uncertainty_score":0.0708853},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10068502,0.00048368413,0.6290718,0.0008211815,0.00056011253,0.00020345973,0.000829934,0.0015638297,0.265781],"genre_scores_gemma":[0.6757811,0.0011401868,0.16859668,0.0005411916,0.00020129466,0.00017332307,0.0013919849,0.00084475643,0.15132953],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997713,0.000029947343,0.000010819194,0.0000541131,0.00008560797,0.000048178925],"domain_scores_gemma":[0.99969923,0.000049280476,0.000032054115,0.00009593184,0.00007397579,0.00004954347],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020142568,0.0005016472,0.00035934642,0.001129323,0.00063268596,0.0012519485,0.00071007566,0.00052236125,0.019965144],"category_scores_gemma":[0.00075995986,0.0002641172,0.00036311775,0.0007048714,0.00053267286,0.0011567407,0.0015748132,0.00096665206,0.0031069044],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012357521,0.0000851824,0.00041000984,0.00010737362,0.00002110404,0.0002297071,0.00016394365,0.026880031,0.011899366,0.8073575,0.016391778,0.13633053],"study_design_scores_gemma":[0.000042960182,0.0000748901,0.00078890886,0.000047011225,0.000034332534,0.0004469223,0.00020242458,0.13374123,0.009001544,0.804366,0.0512256,0.000028203063],"about_ca_topic_score_codex":0.0010338342,"about_ca_topic_score_gemma":0.0016649036,"teacher_disagreement_score":0.019965144,"about_ca_system_score_codex":0.00062022667,"about_ca_system_score_gemma":0.00050668616,"threshold_uncertainty_score":0.066790044},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.078109354,0.00024215282,0.9130961,0.00030410851,0.000023977382,0.00018140629,0.0012067093,0.00034874878,0.006487518],"genre_scores_gemma":[0.48589796,0.00047835425,0.5068497,0.000118546726,0.00004027607,0.00037826414,0.0022746262,0.00020237251,0.0037600098],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998467,0.00031972307,0.000100647645,0.00040762432,0.00057740195,0.00012746203],"domain_scores_gemma":[0.9972096,0.0013228358,0.00043976333,0.0004096485,0.00039748178,0.00022070024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056937226,0.000738055,0.0008644283,0.0013504995,0.0009076976,0.0012956318,0.0018700814,0.0012291863,0.0053367796],"category_scores_gemma":[0.008761507,0.00082018255,0.0006562036,0.0018426944,0.0011038922,0.0032722515,0.00290516,0.0012564624,0.0005874951],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00049751805,0.0001838042,0.0056462707,0.0009540516,0.00011643529,0.0011719099,0.0008827171,0.4259057,0.017587626,0.32358032,0.00925349,0.21422009],"study_design_scores_gemma":[0.000070536444,0.00013703089,0.0018949049,0.000100851255,0.00005502434,0.000917344,0.0004187201,0.70198107,0.012648346,0.2651993,0.016530657,0.000046178753],"about_ca_topic_score_codex":0.0029850944,"about_ca_topic_score_gemma":0.003966944,"teacher_disagreement_score":0.0053367796,"about_ca_system_score_codex":0.00065333536,"about_ca_system_score_gemma":0.0008594569,"threshold_uncertainty_score":0.01785332},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.089219,0.0007990273,0.8204137,0.000352929,0.00022460183,0.00019255877,0.0020459099,0.0010065002,0.08574577],"genre_scores_gemma":[0.28682822,0.0015497636,0.663159,0.00012649014,0.000096050746,0.00032040558,0.0044364817,0.0017637288,0.041719876],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99961424,0.00005789119,0.000029190138,0.00009438512,0.00015265876,0.00005164943],"domain_scores_gemma":[0.9993849,0.0002749329,0.00008628621,0.000110863024,0.00010298231,0.0000401386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026432757,0.00095399655,0.00092378503,0.0009620439,0.00043088762,0.0015325221,0.0011808472,0.0007968689,0.013711965],"category_scores_gemma":[0.0027395724,0.000761832,0.0006704454,0.0012909262,0.0006100612,0.0021707965,0.001108074,0.001877386,0.002719953],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034850335,0.00010078996,0.0005935766,0.00090401276,0.000027129525,0.00022379811,0.00041599816,0.0972413,0.015939686,0.5596683,0.018943567,0.3055934],"study_design_scores_gemma":[0.00009046297,0.0001841835,0.0009834212,0.00024087804,0.000031966665,0.0007757484,0.00033811023,0.24328849,0.01537254,0.67311585,0.065526575,0.00005172971],"about_ca_topic_score_codex":0.00080726197,"about_ca_topic_score_gemma":0.0012480257,"teacher_disagreement_score":0.013711965,"about_ca_system_score_codex":0.00057224,"about_ca_system_score_gemma":0.0003887702,"threshold_uncertainty_score":0.04587108},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18018055,0.00232944,0.7569029,0.004295673,0.0005111133,0.00024485253,0.0020285528,0.0006617294,0.052845217],"genre_scores_gemma":[0.704725,0.0018482697,0.23179163,0.00060530804,0.00040197157,0.00043175192,0.002244206,0.0008263845,0.05712539],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99953043,0.00016231296,0.000020021322,0.0001381574,0.000080987586,0.00006801528],"domain_scores_gemma":[0.9979085,0.0014764946,0.00021958578,0.00019063031,0.00006779155,0.00013696829],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056813576,0.0010041298,0.0015228977,0.0007596619,0.0008089434,0.0016667625,0.0022742709,0.0029965022,0.016310953],"category_scores_gemma":[0.0051926905,0.0009253544,0.00072752085,0.0011458058,0.0014821804,0.004673018,0.0033775433,0.0030675263,0.0009851017],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003269172,0.00011021576,0.0004255115,0.00037258994,0.000050436014,0.00048974855,0.00015973551,0.42192706,0.0013149056,0.5428072,0.0116263935,0.020389214],"study_design_scores_gemma":[0.000102544545,0.000057149693,0.00022004684,0.000030932082,0.000015000318,0.00016582561,0.000091149006,0.58766335,0.00047254667,0.40770778,0.003448836,0.000024759423],"about_ca_topic_score_codex":0.0026080208,"about_ca_topic_score_gemma":0.0021881016,"teacher_disagreement_score":0.016310953,"about_ca_system_score_codex":0.00068274717,"about_ca_system_score_gemma":0.00079020584,"threshold_uncertainty_score":0.05456561},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024714524,0.0061452347,0.9489269,0.0018092156,0.00032521528,0.00009406365,0.00028206277,0.00017127856,0.0175315],"genre_scores_gemma":[0.39922065,0.013857197,0.5545292,0.00097387604,0.002748049,0.00049068365,0.0020341685,0.0003858519,0.025760323],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99476904,0.0022836847,0.0003009387,0.00096253457,0.0014043435,0.0002794345],"domain_scores_gemma":[0.9846481,0.01234805,0.00073983584,0.00084539625,0.0010197784,0.00039877673],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003216041,0.001932431,0.0018275072,0.002907126,0.0015184626,0.0033887508,0.0020000737,0.0023834114,0.0070301094],"category_scores_gemma":[0.021160176,0.00075744814,0.0014237907,0.0043293573,0.003598523,0.009153485,0.0061500883,0.005542842,0.0014079021],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000126135,0.00011212796,0.00090175704,0.0007162374,0.00008463984,0.00029775896,0.0004829096,0.07709842,0.0012302522,0.83873767,0.0071102907,0.07310192],"study_design_scores_gemma":[0.000022927072,0.00008992899,0.00035855663,0.00007935033,0.00001952934,0.00022658633,0.00013665002,0.12515496,0.0005595762,0.8635046,0.009823413,0.000023908025],"about_ca_topic_score_codex":0.0013139484,"about_ca_topic_score_gemma":0.000822053,"teacher_disagreement_score":0.0070301094,"about_ca_system_score_codex":0.0016028387,"about_ca_system_score_gemma":0.00059534155,"threshold_uncertainty_score":0.023518026},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13891475,0.0011384061,0.8166431,0.00063097547,0.00021142428,0.00017162056,0.0004904362,0.000526293,0.041272987],"genre_scores_gemma":[0.5361087,0.0012170884,0.41414526,0.00034447652,0.00014294087,0.00050406443,0.0011152548,0.00087409554,0.04554811],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994711,0.00013093343,0.000030101797,0.00012902354,0.00016508547,0.000073648305],"domain_scores_gemma":[0.9978388,0.0010733614,0.00027028885,0.00023663083,0.00035410677,0.00022689128],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005325051,0.0007764672,0.00056718534,0.0021054638,0.00095943414,0.0013738575,0.001295277,0.0013672241,0.012681214],"category_scores_gemma":[0.0070104613,0.00069662486,0.00063324673,0.0016224207,0.001233319,0.0025387844,0.0019047646,0.0018612549,0.0011877408],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016121357,0.0000529319,0.0006710544,0.00018097022,0.000023644181,0.00011784517,0.00026140953,0.035603285,0.0038431368,0.8785233,0.004825787,0.075735524],"study_design_scores_gemma":[0.000026098654,0.0000657426,0.0002656663,0.00005630802,0.000016851971,0.00015072747,0.00009312913,0.087637834,0.0018408083,0.8956288,0.014199969,0.00001806436],"about_ca_topic_score_codex":0.00122532,"about_ca_topic_score_gemma":0.0019080071,"teacher_disagreement_score":0.012681214,"about_ca_system_score_codex":0.0007519044,"about_ca_system_score_gemma":0.00066190434,"threshold_uncertainty_score":0.04242289},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04915382,0.00085962634,0.9357433,0.00052828254,0.00013829439,0.00025503366,0.0006576292,0.0057607614,0.006903262],"genre_scores_gemma":[0.1073076,0.0002758354,0.88782704,0.00007616884,0.000047576,0.00022937974,0.0010778917,0.0005442918,0.0026142919],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99907446,0.00017884329,0.000062540625,0.00026662796,0.0002551836,0.00016234959],"domain_scores_gemma":[0.99761754,0.0013186111,0.0002142342,0.0005488505,0.0001992203,0.00010154384],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008235188,0.0016564053,0.0013810687,0.0014101369,0.0008837622,0.0012405921,0.0022237625,0.001728579,0.010013272],"category_scores_gemma":[0.006018291,0.0009340967,0.001149869,0.0022791473,0.00094214274,0.0040059686,0.0030951193,0.0016075668,0.002523279],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00078865833,0.00024165923,0.001672921,0.0006521133,0.0000751496,0.00024724333,0.00042440052,0.34559023,0.013220623,0.06084193,0.02188822,0.5543569],"study_design_scores_gemma":[0.00016839926,0.0002071603,0.00037904756,0.000053849206,0.00004059997,0.00020657653,0.00017014559,0.80228895,0.0075276974,0.17724773,0.011677208,0.000032621996],"about_ca_topic_score_codex":0.0019985416,"about_ca_topic_score_gemma":0.0037247685,"teacher_disagreement_score":0.010013272,"about_ca_system_score_codex":0.0011014984,"about_ca_system_score_gemma":0.0012427209,"threshold_uncertainty_score":0.03349775},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034512747,0.038336657,0.8460461,0.0020339815,0.0035543055,0.00012438181,0.0012498008,0.00086983095,0.10433366],"genre_scores_gemma":[0.11641898,0.044950966,0.7233439,0.0014842256,0.0025774282,0.00044869297,0.004636191,0.0008434169,0.10529616],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99750745,0.00049534964,0.00018457494,0.00055133493,0.0011628851,0.00009842006],"domain_scores_gemma":[0.99855775,0.0005380019,0.000082258885,0.00038245236,0.00038156818,0.00005799365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014935632,0.0009669956,0.0015941223,0.0029844418,0.0010288723,0.003836232,0.002418889,0.0020165357,0.013292424],"category_scores_gemma":[0.007400947,0.0005213047,0.0009344504,0.0052543757,0.0018776255,0.0049060783,0.0026084264,0.0027054918,0.0115707675],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000478627,0.00003548076,0.0003945748,0.00041515267,0.00005362613,0.000075088625,0.00017404609,0.011383067,0.0012772215,0.46133068,0.04979627,0.47501698],"study_design_scores_gemma":[0.000015432894,0.00006386163,0.0006025601,0.00029007412,0.0000420616,0.0007698568,0.00018336362,0.046994533,0.0021453402,0.50122714,0.44759324,0.00007246892],"about_ca_topic_score_codex":0.0022409428,"about_ca_topic_score_gemma":0.0020584231,"teacher_disagreement_score":0.013292424,"about_ca_system_score_codex":0.0011243675,"about_ca_system_score_gemma":0.0012906042,"threshold_uncertainty_score":0.044467628},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5122213,0.0004304742,0.47368148,0.0007622374,0.0001506171,0.00014204586,0.0014737049,0.0009575417,0.010180584],"genre_scores_gemma":[0.76057,0.0002473693,0.23330833,0.00012448465,0.000057515328,0.00005511749,0.0024986798,0.00030704783,0.0028314234],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989561,0.00016841192,0.0000694176,0.00039254982,0.0002829251,0.00013051587],"domain_scores_gemma":[0.9958741,0.0014948775,0.00081535545,0.0011263167,0.0004044431,0.0002849334],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005664474,0.00047639397,0.0011907915,0.0012648097,0.0006463517,0.0019085595,0.0014449146,0.0015348705,0.0035458887],"category_scores_gemma":[0.008427497,0.0008296963,0.0010943996,0.0011283138,0.00205048,0.0029590942,0.001995158,0.0018984817,0.0007057253],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017385903,0.00033480595,0.020687073,0.0010597042,0.00016016827,0.003294308,0.0017074712,0.3854948,0.06159658,0.2849333,0.009919419,0.22907384],"study_design_scores_gemma":[0.000056412246,0.00010665136,0.0024194026,0.00012266963,0.000034134373,0.0011085266,0.00087162934,0.6941864,0.017950417,0.275663,0.0074280435,0.00005277193],"about_ca_topic_score_codex":0.0015231756,"about_ca_topic_score_gemma":0.0019031271,"teacher_disagreement_score":0.0035458887,"about_ca_system_score_codex":0.00066739495,"about_ca_system_score_gemma":0.0004213457,"threshold_uncertainty_score":0.011862159},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26536947,0.00084840856,0.72478855,0.0005046762,0.0000478638,0.00019198399,0.00060488266,0.0014473433,0.006196739],"genre_scores_gemma":[0.5644304,0.0004178968,0.43057492,0.00007468578,0.000054079683,0.00017100979,0.0013863008,0.00034882102,0.0025418387],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992137,0.00018098787,0.00004140347,0.00023909521,0.00021980194,0.000104964834],"domain_scores_gemma":[0.9978278,0.0012864053,0.00024537253,0.00025545215,0.00024640904,0.00013846769],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007293521,0.0008632158,0.0011386051,0.0019227891,0.0010029682,0.0014514724,0.0016709189,0.0010656528,0.0035184447],"category_scores_gemma":[0.0067945323,0.0004876565,0.00070694165,0.0019327125,0.0017248391,0.0030284266,0.0022212458,0.0011503164,0.00077351317],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007737678,0.00016631206,0.0048982934,0.0004922748,0.00009515814,0.0004357511,0.0009333573,0.54670745,0.012922536,0.21908416,0.0063838805,0.20710702],"study_design_scores_gemma":[0.00008376247,0.000096513766,0.0006806363,0.000037107737,0.00002143269,0.00015540737,0.0002992202,0.81216043,0.008943724,0.17183849,0.0056505627,0.000032719305],"about_ca_topic_score_codex":0.0028006874,"about_ca_topic_score_gemma":0.0019804856,"teacher_disagreement_score":0.0035184447,"about_ca_system_score_codex":0.0010268253,"about_ca_system_score_gemma":0.0006500017,"threshold_uncertainty_score":0.011770308},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21198162,0.003247975,0.49245948,0.001316258,0.00060476543,0.00014228736,0.0013058423,0.0010537312,0.28788802],"genre_scores_gemma":[0.8358681,0.0011816222,0.1033114,0.00025226347,0.00015554254,0.00007943464,0.0011719046,0.0003949289,0.057584703],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997243,0.000065934335,0.000013582749,0.00005267794,0.000091264956,0.000052144922],"domain_scores_gemma":[0.99973077,0.00010020099,0.000033947297,0.000039027815,0.000050541257,0.000045460914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031107696,0.00044421433,0.0003340957,0.0015079115,0.0008879107,0.0013939005,0.00048684623,0.00045431958,0.012550616],"category_scores_gemma":[0.0014159987,0.00031763746,0.00033085915,0.000831829,0.001156116,0.001817849,0.0015024351,0.00091220473,0.0018486407],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004135735,0.00001167635,0.0005279802,0.00005952392,0.000008857386,0.00012437858,0.00016797156,0.0042746463,0.0015324771,0.9464465,0.008283987,0.038520783],"study_design_scores_gemma":[0.000030965057,0.00003327875,0.00078288873,0.00006621446,0.0000134492675,0.0005379761,0.00029214047,0.031960413,0.0023305765,0.9091874,0.054746807,0.000017910814],"about_ca_topic_score_codex":0.0012060393,"about_ca_topic_score_gemma":0.0022729286,"teacher_disagreement_score":0.012550616,"about_ca_system_score_codex":0.00060117466,"about_ca_system_score_gemma":0.00021384045,"threshold_uncertainty_score":0.04198599},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0045563714,0.00043502773,0.991155,0.00049659814,0.000097303775,0.00015547825,0.0003880254,0.001417933,0.0012982191],"genre_scores_gemma":[0.044854954,0.00041945194,0.95098096,0.00020012392,0.00012709835,0.00029966107,0.0009531999,0.00021031391,0.0019542014],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99548197,0.0005436569,0.00044732066,0.0015822366,0.0015094122,0.0004355253],"domain_scores_gemma":[0.9932439,0.0020596893,0.0007720134,0.0027905784,0.0008085683,0.00032527788],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002272017,0.0016356871,0.001822292,0.004012585,0.0009409259,0.004497344,0.006184262,0.0026229734,0.0068925293],"category_scores_gemma":[0.011049956,0.0017128991,0.0027709077,0.0053994586,0.0023545597,0.015574907,0.005316132,0.0053052707,0.0018921961],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008279373,0.00051005546,0.0018305244,0.0006479611,0.00013308715,0.00021915864,0.0006575559,0.07286245,0.018683936,0.3162776,0.01287306,0.5744767],"study_design_scores_gemma":[0.0002669443,0.0006380874,0.0009800381,0.00015679726,0.00012219095,0.00066604343,0.00031504672,0.5969783,0.04586259,0.3022828,0.051528066,0.0002031339],"about_ca_topic_score_codex":0.0023235704,"about_ca_topic_score_gemma":0.0031977284,"teacher_disagreement_score":0.0068925293,"about_ca_system_score_codex":0.0022063933,"about_ca_system_score_gemma":0.0026109682,"threshold_uncertainty_score":0.023057818},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6712751,0.0005139106,0.29195774,0.00060916,0.00011358374,0.00019399583,0.0006760813,0.00052762614,0.03413284],"genre_scores_gemma":[0.9466729,0.00035977128,0.043865632,0.00025743272,0.0000998085,0.00010012311,0.0010802844,0.00025374413,0.007310337],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.999423,0.0001088236,0.000029343464,0.00016930018,0.0001601681,0.00010940739],"domain_scores_gemma":[0.99543977,0.0021165744,0.00079653354,0.00035322172,0.0006290778,0.0006648411],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008223354,0.0010183835,0.00065092545,0.004125261,0.001219137,0.0024226913,0.0013921686,0.0015547371,0.007329395],"category_scores_gemma":[0.008009713,0.0007403741,0.0005342102,0.0016318479,0.0015515753,0.003065698,0.0017852095,0.0013723412,0.00061369326],"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.00025329727,0.00018116778,0.008227104,0.00033536536,0.00005886763,0.0009136995,0.0009968753,0.0544959,0.015225414,0.87639457,0.0072880182,0.03562966],"study_design_scores_gemma":[0.00003125401,0.000065694,0.0022169338,0.00006840026,0.00003090324,0.00056841364,0.00045433053,0.123557076,0.004557322,0.86310834,0.0053140335,0.00002732085],"about_ca_topic_score_codex":0.0009974112,"about_ca_topic_score_gemma":0.0011729571,"teacher_disagreement_score":0.007329395,"about_ca_system_score_codex":0.0011946919,"about_ca_system_score_gemma":0.0005395655,"threshold_uncertainty_score":0.024519324},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0330805,0.0010006594,0.95819616,0.0008257311,0.0001847186,0.000054250435,0.0007453224,0.0006304355,0.0052822297],"genre_scores_gemma":[0.4967828,0.0016466323,0.4859884,0.00041628044,0.00050174614,0.00049108046,0.0031640765,0.0007736419,0.010235362],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99762326,0.0004950124,0.00032768125,0.0006011077,0.00077394163,0.0001790166],"domain_scores_gemma":[0.9934104,0.002743719,0.00052534434,0.0020908357,0.00097163365,0.0002579882],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024938781,0.00075266825,0.001671506,0.0035104575,0.0014770215,0.0054154433,0.0029507563,0.001622601,0.007600354],"category_scores_gemma":[0.017152648,0.0007337365,0.001283935,0.004316182,0.002919222,0.015075694,0.005120932,0.0036185756,0.0020509602],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059722413,0.000022050666,0.000320094,0.00007340646,0.000011392963,0.00003624255,0.00024671108,0.01157555,0.00042061004,0.9570741,0.0019590503,0.028201042],"study_design_scores_gemma":[0.000010459643,0.000035458324,0.0001253807,0.00004206919,0.000011038633,0.00007182623,0.000107493746,0.08616935,0.0007935455,0.9059327,0.0066777277,0.000022918717],"about_ca_topic_score_codex":0.0016657716,"about_ca_topic_score_gemma":0.0014252478,"teacher_disagreement_score":0.007600354,"about_ca_system_score_codex":0.0020991396,"about_ca_system_score_gemma":0.0009813191,"threshold_uncertainty_score":0.025425732},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41768396,0.00047503397,0.57023335,0.00061885396,0.000039342696,0.0001801689,0.0006381603,0.00038720964,0.009743895],"genre_scores_gemma":[0.7506882,0.000557551,0.24255751,0.00020521897,0.000058065907,0.00028090397,0.0011745726,0.00013555662,0.004342481],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985247,0.00036282217,0.00008711005,0.0003480108,0.000510183,0.00016715762],"domain_scores_gemma":[0.99074334,0.0049736784,0.0017848444,0.0009572096,0.00092374324,0.0006172747],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071215647,0.00059819454,0.0007945051,0.0027584303,0.00088615983,0.0016907878,0.0012391508,0.0007956226,0.0036204585],"category_scores_gemma":[0.0066975667,0.0011295585,0.0008583324,0.0020491234,0.0018275314,0.0024967063,0.0024882902,0.001323311,0.0004914784],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00058843754,0.00011299568,0.005160141,0.0003382133,0.00012707754,0.00053497555,0.0013832517,0.44827747,0.02549145,0.4642777,0.0034249688,0.050283205],"study_design_scores_gemma":[0.00013967481,0.00013783602,0.0048334934,0.0000802052,0.00005116023,0.0004978252,0.00058712804,0.6275916,0.013870019,0.3394012,0.012746207,0.00006365688],"about_ca_topic_score_codex":0.0048354506,"about_ca_topic_score_gemma":0.0032457334,"teacher_disagreement_score":0.0048354506,"about_ca_system_score_codex":0.0013297145,"about_ca_system_score_gemma":0.0005179916,"threshold_uncertainty_score":0.012111604},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014777111,0.0004832622,0.972377,0.0003441958,0.00011137282,0.00007137479,0.00031774066,0.001418798,0.010099121],"genre_scores_gemma":[0.16444561,0.00068804837,0.8195642,0.00021544585,0.0001299438,0.00014105589,0.00086404115,0.0010433549,0.0129081765],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99926144,0.00011564173,0.00004595319,0.00016039654,0.00029616026,0.000120444514],"domain_scores_gemma":[0.998216,0.0008643803,0.00009993893,0.00040161418,0.00026868904,0.00014932183],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00109586,0.0012695151,0.0016728083,0.0020840366,0.0011257789,0.003918695,0.0029238625,0.0018188988,0.015436447],"category_scores_gemma":[0.0056801573,0.0010643192,0.0018900901,0.0020889363,0.0017868283,0.0060016382,0.005838967,0.0040541934,0.0032255673],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023996446,0.0000948369,0.00067642017,0.00039916518,0.00006521601,0.000052717773,0.00048804167,0.083744295,0.004443291,0.6375763,0.013196338,0.2590235],"study_design_scores_gemma":[0.000044242744,0.000030195915,0.00012660494,0.000054258962,0.000020512505,0.000050009778,0.00012316462,0.25255814,0.0021864632,0.73663175,0.008148319,0.000026231488],"about_ca_topic_score_codex":0.0028074954,"about_ca_topic_score_gemma":0.005346945,"teacher_disagreement_score":0.015436447,"about_ca_system_score_codex":0.001982235,"about_ca_system_score_gemma":0.001040773,"threshold_uncertainty_score":0.051640034},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07574915,0.00012704633,0.9189592,0.000088004184,0.000040349852,0.00008660445,0.00015247872,0.00081875315,0.0039783586],"genre_scores_gemma":[0.51959616,0.00021724252,0.4731765,0.00004258238,0.00003077037,0.0001566126,0.0005817172,0.0004989366,0.005699478],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.999607,0.00006747977,0.00002186529,0.00008843349,0.00018107689,0.000034159144],"domain_scores_gemma":[0.99939895,0.0002248613,0.00005917121,0.00019611328,0.00008773205,0.00003322821],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044517918,0.00059191964,0.001197335,0.0011023638,0.0006611692,0.0012228923,0.0015454884,0.00091947656,0.0037163233],"category_scores_gemma":[0.0019355871,0.0007041969,0.0009841509,0.0015168396,0.00070987636,0.0013509857,0.0019099932,0.0009902079,0.0005491478],"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.00027473603,0.0001088058,0.0013077563,0.0002414662,0.0001062992,0.00041177936,0.00050519616,0.75642943,0.02967448,0.052768316,0.0033306705,0.15484114],"study_design_scores_gemma":[0.000016776312,0.000022884187,0.00017129554,0.000009122898,0.0000133908525,0.0000739474,0.00004788219,0.97162837,0.004394433,0.021675166,0.0019391715,0.0000075048206],"about_ca_topic_score_codex":0.0018727962,"about_ca_topic_score_gemma":0.0036263068,"teacher_disagreement_score":0.0037163233,"about_ca_system_score_codex":0.0005266615,"about_ca_system_score_gemma":0.000451036,"threshold_uncertainty_score":0.012432337},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25516996,0.0010917229,0.5381208,0.0012790249,0.00082983106,0.00013294363,0.0011675517,0.0020283563,0.2001797],"genre_scores_gemma":[0.7687227,0.0021293974,0.13191622,0.0005657304,0.00048354105,0.00015944777,0.0019128514,0.0016246464,0.09248543],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99968517,0.00005923621,0.000018919582,0.000051960204,0.00012495014,0.00005977002],"domain_scores_gemma":[0.99955803,0.0001295304,0.000057084464,0.00013571756,0.000072036106,0.00004759217],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026199967,0.00060796237,0.0004870324,0.0014187781,0.00063452235,0.0021275177,0.0010664733,0.0011905301,0.014835343],"category_scores_gemma":[0.0013384834,0.0003932671,0.00058764603,0.0013333173,0.00097035454,0.002869997,0.0016117924,0.0023249604,0.0031282564],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045843568,0.00003131589,0.00006211519,0.00006432476,0.000004444512,0.000070928916,0.00020861388,0.005494761,0.0034446104,0.94391835,0.0038631463,0.042791657],"study_design_scores_gemma":[0.000013700951,0.00002780621,0.000082252365,0.000027049426,0.00000656113,0.00012443852,0.00009451375,0.015493285,0.0017531138,0.9711693,0.011193609,0.000014346687],"about_ca_topic_score_codex":0.0004225798,"about_ca_topic_score_gemma":0.00058447465,"teacher_disagreement_score":0.014835343,"about_ca_system_score_codex":0.000549586,"about_ca_system_score_gemma":0.00028964842,"threshold_uncertainty_score":0.049629092},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.095813915,0.0001454763,0.8901801,0.00018883555,0.000251216,0.00013690158,0.00037552963,0.0009856226,0.011922408],"genre_scores_gemma":[0.45000347,0.00025013974,0.53563094,0.00020261097,0.00005737105,0.00025651648,0.0008978884,0.0007882827,0.011912839],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989611,0.00019993598,0.00006470341,0.00015426682,0.0004670527,0.00015297583],"domain_scores_gemma":[0.9979309,0.00055753073,0.00016777987,0.0008275105,0.00039138438,0.00012498698],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006587809,0.0005589619,0.00044188494,0.00076085585,0.0008537316,0.0009872561,0.0014498457,0.0010101392,0.01183297],"category_scores_gemma":[0.0047020284,0.0005420377,0.0008990077,0.00067003217,0.001643012,0.001938812,0.0032873815,0.0016524916,0.0028989343],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011514494,0.00021276201,0.0031898802,0.00047610575,0.000079135716,0.0012108216,0.0010109955,0.23974225,0.08438536,0.35580462,0.011589984,0.3011467],"study_design_scores_gemma":[0.00018571304,0.00042745215,0.0015476606,0.0001770718,0.00006667914,0.000989285,0.0007111261,0.50637794,0.07815496,0.36669677,0.04452472,0.00014060391],"about_ca_topic_score_codex":0.0008324947,"about_ca_topic_score_gemma":0.001373802,"teacher_disagreement_score":0.01183297,"about_ca_system_score_codex":0.00045520935,"about_ca_system_score_gemma":0.0003989394,"threshold_uncertainty_score":0.039585292},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17247961,0.004034857,0.7287822,0.0026332436,0.0010580689,0.00042944725,0.0037293786,0.00646401,0.08038914],"genre_scores_gemma":[0.41893625,0.0021977152,0.5395141,0.000905449,0.0006676881,0.0005028037,0.0049836235,0.0021212043,0.030171014],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985435,0.0002320452,0.0000607781,0.00029115123,0.0005754692,0.00029712621],"domain_scores_gemma":[0.99672997,0.0017533479,0.00020497823,0.00064886373,0.00032580187,0.00033707827],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011012041,0.0024372125,0.0020590757,0.002379475,0.0009124107,0.0041030166,0.0042919638,0.0019496183,0.022883395],"category_scores_gemma":[0.008655585,0.0011534892,0.0017279644,0.0034208049,0.0014113804,0.0048534013,0.0045257416,0.004773602,0.005151841],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002096954,0.00075831864,0.0031787518,0.0012056336,0.00019257024,0.00036447175,0.0010258798,0.18622413,0.023552746,0.2047301,0.07340062,0.5032698],"study_design_scores_gemma":[0.0002980622,0.00038326692,0.0017028734,0.0002163423,0.00015652509,0.00046129787,0.0003515013,0.67192715,0.0077062207,0.29013363,0.026582042,0.00008118866],"about_ca_topic_score_codex":0.0034104753,"about_ca_topic_score_gemma":0.005764169,"teacher_disagreement_score":0.022883395,"about_ca_system_score_codex":0.0028528965,"about_ca_system_score_gemma":0.0015368338,"threshold_uncertainty_score":0.07655257},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14578904,0.0228262,0.6629191,0.00829191,0.0022980613,0.00022052141,0.0037992017,0.0024569759,0.15139903],"genre_scores_gemma":[0.71507853,0.011639407,0.23567548,0.0015180843,0.0029831426,0.0007824717,0.0034775804,0.002358851,0.026486453],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99558014,0.0011546897,0.00020444697,0.00086964434,0.0014307662,0.0007602714],"domain_scores_gemma":[0.9620164,0.028682495,0.00106816,0.0032078754,0.002072801,0.0029523517],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043203905,0.0035286292,0.0034524882,0.0059687253,0.0022231457,0.006681518,0.006485024,0.00288975,0.015569405],"category_scores_gemma":[0.02916221,0.0018016848,0.0025126536,0.0037179235,0.004695481,0.009616248,0.010672283,0.010556922,0.0038416605],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017472872,0.00039250913,0.0053361105,0.0017146309,0.00028039006,0.0005581085,0.00091351575,0.18495157,0.01587114,0.67889494,0.031436786,0.07790302],"study_design_scores_gemma":[0.00014705402,0.00028727937,0.0026157435,0.00035408462,0.00018907138,0.00052208063,0.00035117165,0.45986632,0.0071730423,0.5065735,0.02178218,0.00013856497],"about_ca_topic_score_codex":0.0018544083,"about_ca_topic_score_gemma":0.002715586,"teacher_disagreement_score":0.015569405,"about_ca_system_score_codex":0.0040766876,"about_ca_system_score_gemma":0.0013681548,"threshold_uncertainty_score":0.052084923},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020415228,0.006253375,0.93287504,0.00182548,0.0003602995,0.00012668237,0.000629021,0.00055533415,0.036959574],"genre_scores_gemma":[0.68393457,0.011741439,0.2624662,0.0024456128,0.0025645378,0.0008676675,0.0018374417,0.0007754233,0.033367082],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99550265,0.0016165444,0.00018942877,0.0006759356,0.0015099627,0.000505432],"domain_scores_gemma":[0.97532517,0.015657399,0.0024110132,0.0029777237,0.002709695,0.0009189497],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046763993,0.0030028522,0.0017549845,0.0022144385,0.0010652879,0.0033409025,0.0016319512,0.0017200682,0.018662995],"category_scores_gemma":[0.02872506,0.001089581,0.0013827624,0.0021614733,0.0036242655,0.005826552,0.003095677,0.0049844733,0.0038455985],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019320757,0.00011730272,0.00081607146,0.0005440321,0.00008372134,0.00020013076,0.0001831522,0.06985297,0.004888243,0.8674069,0.01330743,0.04240698],"study_design_scores_gemma":[0.000034951714,0.00022816696,0.0005570754,0.00013802397,0.000048499143,0.00028738257,0.00008027238,0.17910896,0.002085593,0.8043087,0.013063736,0.00005852044],"about_ca_topic_score_codex":0.00092262664,"about_ca_topic_score_gemma":0.0012510618,"teacher_disagreement_score":0.018662995,"about_ca_system_score_codex":0.0020515,"about_ca_system_score_gemma":0.0013134567,"threshold_uncertainty_score":0.0624339},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09040988,0.002290382,0.8798357,0.0002874741,0.00018253579,0.000057413945,0.00027884956,0.0009196964,0.025737992],"genre_scores_gemma":[0.92182434,0.0012656089,0.06773256,0.000067601664,0.000042460382,0.00004495398,0.0002851532,0.0002092943,0.008528014],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998683,0.000023128468,0.0000026938749,0.000022954173,0.00004646968,0.000036403162],"domain_scores_gemma":[0.9998903,0.00004790576,0.0000074833156,0.000016372804,0.000025711992,0.000012131523],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012324723,0.00077373354,0.0006293056,0.00036986332,0.00038682765,0.0006364183,0.00073572464,0.00037728026,0.0064233504],"category_scores_gemma":[0.00046594866,0.00027839435,0.00030386553,0.0008285437,0.0002414461,0.00066201977,0.00074594363,0.00046824192,0.0007542249],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036999225,0.00018502056,0.0011841266,0.00033277288,0.000050420324,0.00014172807,0.00010103871,0.5560335,0.04193346,0.02075505,0.010582354,0.36833048],"study_design_scores_gemma":[0.00002128096,0.00010573171,0.0012121606,0.00003842801,0.0000379049,0.000083926796,0.00014524268,0.96306574,0.011342568,0.015620429,0.0083074905,0.000019090014],"about_ca_topic_score_codex":0.0024059606,"about_ca_topic_score_gemma":0.005374569,"teacher_disagreement_score":0.0064233504,"about_ca_system_score_codex":0.0003397985,"about_ca_system_score_gemma":0.00029369915,"threshold_uncertainty_score":0.02148825},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22748676,0.0007252786,0.71915394,0.0004896254,0.000105231695,0.00009628114,0.00021908022,0.00044845467,0.05127538],"genre_scores_gemma":[0.8248349,0.0013881532,0.14102395,0.0004797411,0.00019016364,0.00024873196,0.00051748514,0.0003209093,0.030995945],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995345,0.000102369035,0.000022348017,0.00012965972,0.0001242955,0.00008683392],"domain_scores_gemma":[0.9981351,0.00093624427,0.0002712886,0.00022326362,0.0001830606,0.00025109574],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006832409,0.0011756832,0.0009406225,0.001087084,0.0012107262,0.0016582406,0.0013712817,0.0012700394,0.0063936864],"category_scores_gemma":[0.0035537381,0.0005667002,0.00073991733,0.0012723518,0.0015868149,0.0027253053,0.0026467724,0.001863959,0.0010185814],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006573917,0.00005586575,0.00040944546,0.00006703404,0.000021117812,0.00012524133,0.00015758869,0.030787535,0.0032401343,0.9428287,0.002115353,0.0201263],"study_design_scores_gemma":[0.000023929435,0.00010764986,0.00026275718,0.000033127624,0.000017767097,0.00024054969,0.00009990491,0.11432658,0.0011737602,0.8797245,0.00397195,0.000017498036],"about_ca_topic_score_codex":0.0004139326,"about_ca_topic_score_gemma":0.0005719136,"teacher_disagreement_score":0.0063936864,"about_ca_system_score_codex":0.00056036294,"about_ca_system_score_gemma":0.000487255,"threshold_uncertainty_score":0.021389067},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11336874,0.0004567517,0.87883633,0.00027066443,0.00016103403,0.00008660085,0.00018475077,0.0005304672,0.006104694],"genre_scores_gemma":[0.3494814,0.00041690347,0.6411833,0.00010043934,0.00010611262,0.00018443663,0.00030872642,0.0006971673,0.007521498],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99956554,0.00008321311,0.00002454446,0.00010954829,0.00014193119,0.000075165386],"domain_scores_gemma":[0.9985066,0.0008100032,0.00012430715,0.00020745864,0.00014808227,0.00020357333],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008013551,0.0010202883,0.001377139,0.0007436526,0.0005340353,0.0010427817,0.001678356,0.0017172913,0.005309694],"category_scores_gemma":[0.0045091636,0.0006776006,0.00065804773,0.00066228455,0.00068814494,0.0020971608,0.0019173175,0.0015516314,0.0008094284],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007985879,0.00029216887,0.0018919663,0.0007391245,0.000097811404,0.0005206926,0.0003587698,0.6067368,0.061873004,0.07172878,0.011220017,0.24374235],"study_design_scores_gemma":[0.000039236456,0.00037709103,0.0005001513,0.00006612151,0.00004590353,0.00035604305,0.00012424533,0.9395667,0.006308264,0.046611793,0.0059855054,0.000018958643],"about_ca_topic_score_codex":0.0006638599,"about_ca_topic_score_gemma":0.0012593187,"teacher_disagreement_score":0.005309694,"about_ca_system_score_codex":0.000512326,"about_ca_system_score_gemma":0.0005459426,"threshold_uncertainty_score":0.01776272},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055593356,0.00018471717,0.91511005,0.0004737999,0.00013252089,0.00009202708,0.00096445065,0.001685555,0.025763486],"genre_scores_gemma":[0.561402,0.00053697213,0.4172447,0.00043126006,0.000116323405,0.0003278289,0.0033279192,0.00068923284,0.015923686],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994702,0.00009796843,0.000032092772,0.0001180452,0.00018566991,0.00009609141],"domain_scores_gemma":[0.9994143,0.00014696168,0.000080435944,0.00017605523,0.0001421027,0.000040107065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031954705,0.0005557315,0.00044879576,0.00094249967,0.0005047606,0.0016558187,0.00095155323,0.0009886764,0.010962808],"category_scores_gemma":[0.0019665062,0.0003080404,0.0005300791,0.0013900448,0.00086246023,0.0026071784,0.0016596611,0.0016029151,0.0031406689],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022248074,0.00008003496,0.0006108849,0.00023052542,0.00001923022,0.00040397898,0.0003843098,0.032088492,0.01341771,0.80669624,0.012196457,0.13364972],"study_design_scores_gemma":[0.00004371224,0.00011021614,0.0004243503,0.00006517635,0.000027263583,0.00047769945,0.00025008773,0.14236654,0.008113807,0.8108444,0.037241895,0.000034822664],"about_ca_topic_score_codex":0.0007526277,"about_ca_topic_score_gemma":0.00051749416,"teacher_disagreement_score":0.010962808,"about_ca_system_score_codex":0.0004720501,"about_ca_system_score_gemma":0.00034418888,"threshold_uncertainty_score":0.03667426},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06752964,0.00047373548,0.9219762,0.0002502985,0.000114050315,0.00010976096,0.0003071882,0.0011644087,0.008074639],"genre_scores_gemma":[0.4633123,0.0004962659,0.5245091,0.00010264726,0.000099139455,0.00025005164,0.0013570032,0.00071959704,0.0091539305],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987815,0.00026011208,0.000049081278,0.00025480826,0.0004936665,0.00016089033],"domain_scores_gemma":[0.9953956,0.0029643863,0.0002601558,0.0005019517,0.00066208234,0.00021584526],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014442537,0.0016972512,0.0019280014,0.0030768143,0.00077701674,0.0019098396,0.003098623,0.0019950592,0.009173319],"category_scores_gemma":[0.013049421,0.0013127557,0.0009010539,0.0025756778,0.0011152442,0.0028548639,0.0031870098,0.0018933456,0.0013482133],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00050834153,0.00015896244,0.0011211375,0.00024048943,0.00005638339,0.00013125593,0.00014947573,0.82068044,0.0030561113,0.061626825,0.006807463,0.10546307],"study_design_scores_gemma":[0.000014794054,0.000025078036,0.000066925044,0.000007806623,0.0000067557285,0.000024239544,0.000022939714,0.9786582,0.0006742489,0.019559689,0.0009356784,0.0000035981448],"about_ca_topic_score_codex":0.0044372054,"about_ca_topic_score_gemma":0.0059635187,"teacher_disagreement_score":0.009173319,"about_ca_system_score_codex":0.0019184904,"about_ca_system_score_gemma":0.0014091268,"threshold_uncertainty_score":0.03068775},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10784612,0.0003716693,0.6850074,0.0012358131,0.00045987172,0.0003458196,0.0017736012,0.0026569266,0.20030273],"genre_scores_gemma":[0.51252353,0.0007051743,0.40155333,0.00092860585,0.00019113795,0.000344164,0.0054578236,0.0032197998,0.07507642],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995555,0.00008148172,0.000017808596,0.0001542203,0.00010949068,0.000081550286],"domain_scores_gemma":[0.9990766,0.00025242197,0.00006241195,0.00030202803,0.00020343543,0.00010311582],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003656212,0.00072023727,0.000546435,0.0011737966,0.0012714706,0.0017592267,0.0014680444,0.0009929821,0.021304626],"category_scores_gemma":[0.0017795415,0.00050452707,0.0008204342,0.0018509219,0.0010791549,0.0034041393,0.0016839884,0.0023477762,0.0047581545],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019002796,0.0001542914,0.00069645164,0.00031425024,0.00003713323,0.00042453996,0.00056191155,0.012094058,0.017307715,0.7932848,0.021552501,0.15338236],"study_design_scores_gemma":[0.00002429514,0.00004575401,0.000685321,0.000104582665,0.000042525102,0.00031738594,0.00030428558,0.029187094,0.009632466,0.89309573,0.06653849,0.000022073833],"about_ca_topic_score_codex":0.0018416914,"about_ca_topic_score_gemma":0.0020120016,"teacher_disagreement_score":0.021304626,"about_ca_system_score_codex":0.00087051955,"about_ca_system_score_gemma":0.00053573994,"threshold_uncertainty_score":0.07127112},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2076944,0.0011805745,0.65869343,0.0078408,0.0011028444,0.00016762434,0.0009413784,0.00056083465,0.1218181],"genre_scores_gemma":[0.8249079,0.0009231127,0.12590903,0.0011221638,0.00047173616,0.0002731741,0.0013859465,0.0006893003,0.044317678],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977436,0.0007443548,0.00010689218,0.0003416134,0.000828538,0.00023501024],"domain_scores_gemma":[0.99273735,0.0043047033,0.0008213877,0.0009025335,0.0006729837,0.0005609181],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018996061,0.00089592417,0.0010342199,0.0012673144,0.001846604,0.002517459,0.002115323,0.003189148,0.016628057],"category_scores_gemma":[0.024522515,0.0007172005,0.0010280841,0.0019931023,0.002427877,0.005339709,0.0048915804,0.007490731,0.0013386677],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009146491,0.00005366669,0.00058283756,0.00011371601,0.000022997448,0.00018233861,0.000113060385,0.020926049,0.00047974702,0.9479165,0.0074653486,0.022052193],"study_design_scores_gemma":[0.000022303058,0.00003079675,0.0001625611,0.000021212874,0.000008268415,0.0001524924,0.00006355441,0.05594154,0.00025723243,0.93879527,0.004535277,0.000009505803],"about_ca_topic_score_codex":0.0011110372,"about_ca_topic_score_gemma":0.000964323,"teacher_disagreement_score":0.016628057,"about_ca_system_score_codex":0.0009917865,"about_ca_system_score_gemma":0.0013706426,"threshold_uncertainty_score":0.055626392},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1193598,0.0007505252,0.8263723,0.0006881344,0.00016739855,0.00022638873,0.00085000804,0.0007888017,0.05079662],"genre_scores_gemma":[0.49886045,0.002620773,0.45740038,0.00039215063,0.00015784848,0.00028955855,0.003093456,0.0006903072,0.03649516],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993674,0.00018812928,0.000027081664,0.00009384158,0.00023410053,0.00008952309],"domain_scores_gemma":[0.99860317,0.00068524835,0.00020593635,0.00016892079,0.00021766526,0.00011907002],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044102795,0.0013000272,0.00079709676,0.0017665345,0.0008103919,0.0019821245,0.0015216077,0.0013243733,0.013963489],"category_scores_gemma":[0.0043985653,0.00096205215,0.0008246723,0.002514101,0.001136354,0.0018909635,0.002339351,0.0015938288,0.002326176],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001825152,0.00007968101,0.0010032131,0.00031782108,0.000045963916,0.00040466193,0.00046338447,0.1903913,0.0080134105,0.66119033,0.015991045,0.121916726],"study_design_scores_gemma":[0.00007170249,0.000079537676,0.00065840804,0.00010242648,0.000041267576,0.00030670225,0.00031514544,0.3450598,0.0028921026,0.6306337,0.019800775,0.00003838558],"about_ca_topic_score_codex":0.0027051857,"about_ca_topic_score_gemma":0.0048058513,"teacher_disagreement_score":0.013963489,"about_ca_system_score_codex":0.0009793148,"about_ca_system_score_gemma":0.00056666933,"threshold_uncertainty_score":0.046712518},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20546019,0.0033981304,0.31093574,0.0040144604,0.0026007947,0.00021406931,0.0019211086,0.0018062572,0.4696492],"genre_scores_gemma":[0.8034885,0.0012801383,0.05978546,0.0010148204,0.00025853325,0.00020147863,0.0019550647,0.0009132513,0.13110273],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987754,0.0001390989,0.000099740646,0.0003597968,0.00027625606,0.00034970097],"domain_scores_gemma":[0.99757236,0.00059762417,0.00022763315,0.00067860074,0.0005844807,0.00033928757],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006444633,0.0015669103,0.0014229314,0.0023702765,0.002426337,0.0047309506,0.0019089888,0.0027596438,0.041725732],"category_scores_gemma":[0.0044078045,0.0008503704,0.0010088235,0.0017671662,0.0024680605,0.0064179446,0.0059511904,0.003925871,0.020714507],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003863659,0.00010639146,0.00086898886,0.00021273534,0.000024864938,0.00023547049,0.00029133182,0.00095301,0.0038907274,0.94203174,0.0074579697,0.043540463],"study_design_scores_gemma":[0.000050888873,0.000045735458,0.00042968438,0.000064751934,0.000020927559,0.00061240036,0.0004032479,0.0040138536,0.004697049,0.9521287,0.037506156,0.000026644988],"about_ca_topic_score_codex":0.0002935449,"about_ca_topic_score_gemma":0.00042880667,"teacher_disagreement_score":0.041725732,"about_ca_system_score_codex":0.0009092124,"about_ca_system_score_gemma":0.0005522049,"threshold_uncertainty_score":0.13958645},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28710824,0.0025028815,0.6634292,0.0013079277,0.00016210381,0.00013850012,0.00085248187,0.00064811826,0.04385057],"genre_scores_gemma":[0.8535768,0.0016978222,0.13607787,0.000223489,0.00030793194,0.00032591287,0.0010746968,0.00029003105,0.006425444],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967237,0.00054109405,0.00019095698,0.00093622034,0.0010019791,0.00060604396],"domain_scores_gemma":[0.9848305,0.007980219,0.0020017873,0.0026475086,0.0014066359,0.0011333252],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016293778,0.0017174467,0.0014273777,0.0040694186,0.0016450415,0.00260112,0.0036678903,0.0014984893,0.0057580457],"category_scores_gemma":[0.016286122,0.000990438,0.0018831214,0.0033512532,0.002492373,0.007322671,0.0042078267,0.0041489103,0.0011545016],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00082458556,0.00023084207,0.015087811,0.0008652199,0.00031127664,0.00083891663,0.0011301407,0.19585805,0.04469528,0.6146014,0.007098671,0.11845786],"study_design_scores_gemma":[0.000044946977,0.00026116672,0.005858006,0.00017963555,0.0001865091,0.0012808569,0.00031991873,0.49931216,0.026737208,0.44843298,0.01725446,0.00013220382],"about_ca_topic_score_codex":0.000741266,"about_ca_topic_score_gemma":0.00092220254,"teacher_disagreement_score":0.0057580457,"about_ca_system_score_codex":0.0025691641,"about_ca_system_score_gemma":0.0006037177,"threshold_uncertainty_score":0.019262612},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2691235,0.0012330601,0.6551467,0.0014206945,0.00011773917,0.000072928415,0.00042137428,0.00021351612,0.07225044],"genre_scores_gemma":[0.93408364,0.00083226286,0.052646995,0.00025954112,0.00018018087,0.000117072974,0.00029960592,0.00014327673,0.011437489],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989943,0.00020929762,0.00005668424,0.00020192191,0.00039845982,0.00013928938],"domain_scores_gemma":[0.9972089,0.0009669146,0.0004657993,0.00047977734,0.00039317415,0.00048555573],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010923237,0.00048588496,0.0004538863,0.0019298309,0.0014953008,0.002637252,0.00057808595,0.0008826282,0.0039102444],"category_scores_gemma":[0.005498732,0.0003469313,0.0006304471,0.0015304798,0.003806848,0.006660736,0.003946162,0.001716096,0.0005321524],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010248266,0.000005949035,0.0005871165,0.000018499908,0.000005316877,0.00008594928,0.0002338814,0.0027182112,0.000902627,0.98757744,0.00040916103,0.007445651],"study_design_scores_gemma":[0.0000049476603,0.000036683014,0.00096905616,0.00003322832,0.0000075295184,0.0003755853,0.00028378583,0.016413491,0.0009989024,0.97130877,0.009545943,0.000022031763],"about_ca_topic_score_codex":0.0005367389,"about_ca_topic_score_gemma":0.00046944257,"teacher_disagreement_score":0.0039102444,"about_ca_system_score_codex":0.0008717763,"about_ca_system_score_gemma":0.0003349699,"threshold_uncertainty_score":0.013081074},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09902538,0.0016443374,0.8807581,0.0010252993,0.00015722004,0.000138107,0.00056664436,0.00094477163,0.015740143],"genre_scores_gemma":[0.34322006,0.0018836663,0.6366518,0.00017350324,0.00011415804,0.0002129948,0.0012434344,0.0004141717,0.016086098],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994985,0.00015259712,0.00003004119,0.000116665455,0.000121187295,0.000081063044],"domain_scores_gemma":[0.9992945,0.00039887158,0.000085022475,0.00009424207,0.00008138249,0.00004597023],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048299704,0.0006135564,0.0007925229,0.0006242864,0.00065962755,0.0012858607,0.0013734357,0.00095078425,0.004903793],"category_scores_gemma":[0.0035309652,0.00050973316,0.00082868896,0.0013604084,0.0005006228,0.0034382362,0.00091042253,0.0011169193,0.0010515978],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002892534,0.00013819493,0.0011298482,0.00025436608,0.000047647423,0.0002143007,0.00026575627,0.66570115,0.002790479,0.1689396,0.016001618,0.14422779],"study_design_scores_gemma":[0.00002491369,0.000057173125,0.00022305,0.000022166641,0.000013778592,0.000097471675,0.000098733755,0.9332641,0.0010185469,0.05543554,0.009733648,0.000010860501],"about_ca_topic_score_codex":0.0134473145,"about_ca_topic_score_gemma":0.01084004,"teacher_disagreement_score":0.0134473145,"about_ca_system_score_codex":0.0013737457,"about_ca_system_score_gemma":0.00091681414,"threshold_uncertainty_score":0.026738107},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07696765,0.00021297118,0.91306305,0.000651725,0.00006728979,0.00020325922,0.00087444094,0.001735176,0.0062244786],"genre_scores_gemma":[0.38646996,0.00025824495,0.6028828,0.00025893262,0.00006712551,0.0004044827,0.0024321754,0.0006495857,0.006576714],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99721694,0.000798254,0.00015961699,0.00083596405,0.0005423306,0.0004468135],"domain_scores_gemma":[0.99415755,0.0024909389,0.0006314625,0.0017231322,0.0006582096,0.00033866832],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015835922,0.0012748478,0.0015970719,0.000850907,0.001489777,0.0022976354,0.0025038633,0.0017189174,0.00783741],"category_scores_gemma":[0.010875176,0.00088659226,0.0012283571,0.0024507816,0.0014961539,0.004900567,0.0027246885,0.0017393123,0.001690899],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011438963,0.0003359119,0.0035032046,0.00065339776,0.00010498804,0.00047204286,0.0011000916,0.47064388,0.02097104,0.20831989,0.019835996,0.2729156],"study_design_scores_gemma":[0.00012206735,0.0002393916,0.0006280988,0.0000453487,0.00006231137,0.00025687355,0.0005168504,0.7561496,0.013660111,0.21373343,0.014537702,0.000048101014],"about_ca_topic_score_codex":0.0023416067,"about_ca_topic_score_gemma":0.0025807605,"teacher_disagreement_score":0.00783741,"about_ca_system_score_codex":0.0014650848,"about_ca_system_score_gemma":0.001657422,"threshold_uncertainty_score":0.026218772},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5493749,0.000874096,0.31757775,0.00094619585,0.0004982594,0.00016428289,0.00041706293,0.0004373801,0.12971005],"genre_scores_gemma":[0.93861216,0.00038499644,0.04149639,0.00011444011,0.000086560896,0.00009672382,0.0004506934,0.00020593936,0.018552065],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991141,0.00020686115,0.000038855313,0.00015083594,0.00031614295,0.00017327881],"domain_scores_gemma":[0.99768734,0.00087913516,0.0003946456,0.00018968305,0.0005731959,0.000276053],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006924975,0.0007346845,0.0007948293,0.0026417058,0.0024896716,0.0028614237,0.0015858723,0.0018403656,0.012103829],"category_scores_gemma":[0.0051581357,0.0006876912,0.00072983257,0.001867174,0.0022364107,0.0020925654,0.0026657027,0.0019170346,0.0016416641],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023685094,0.000037919286,0.0012011353,0.00010593356,0.000024250736,0.0008115833,0.0010739599,0.016234484,0.0019839231,0.95438164,0.0032941236,0.020614335],"study_design_scores_gemma":[0.000049303395,0.00012621608,0.001174758,0.00012774846,0.000031159616,0.00086963107,0.0020079156,0.11379933,0.003945022,0.85854,0.019269139,0.000059776023],"about_ca_topic_score_codex":0.0019198917,"about_ca_topic_score_gemma":0.0011924527,"teacher_disagreement_score":0.012103829,"about_ca_system_score_codex":0.0012627635,"about_ca_system_score_gemma":0.00049754675,"threshold_uncertainty_score":0.040491343},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055415124,0.0005536354,0.93271446,0.00050440815,0.00013012491,0.00024947186,0.0017992578,0.0048177326,0.003815864],"genre_scores_gemma":[0.43869683,0.000729595,0.5483346,0.0005247403,0.00022684156,0.0006610765,0.0055834,0.00066741946,0.00457545],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99636406,0.0005171886,0.00067202083,0.0004382726,0.0016522437,0.00035615888],"domain_scores_gemma":[0.98375016,0.0039979033,0.0017803177,0.007740561,0.0024091583,0.00032189267],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019281501,0.0009996992,0.0019836673,0.0019218551,0.0009931594,0.0033155303,0.0030595688,0.0012095465,0.005534516],"category_scores_gemma":[0.017543895,0.0009024187,0.00068672164,0.0040653814,0.0014719254,0.011089173,0.0047433423,0.0015542116,0.0029557971],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0028479,0.00056997995,0.008760642,0.0010567623,0.00012136905,0.00038800223,0.0011359467,0.12206819,0.0706425,0.20198657,0.022635274,0.5677869],"study_design_scores_gemma":[0.00056599977,0.0013253139,0.0018122506,0.00024133793,0.00015518053,0.0008289301,0.00066604756,0.59311044,0.1474271,0.18690833,0.066691376,0.00026768335],"about_ca_topic_score_codex":0.0010071401,"about_ca_topic_score_gemma":0.0013079086,"teacher_disagreement_score":0.005534516,"about_ca_system_score_codex":0.001093605,"about_ca_system_score_gemma":0.0019029025,"threshold_uncertainty_score":0.018514872},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06645317,0.0003328308,0.88955766,0.0006148096,0.000127961,0.00044611454,0.0010746748,0.0017326047,0.03966017],"genre_scores_gemma":[0.5317249,0.0009984793,0.44286978,0.0007329685,0.00012575672,0.00047253582,0.00378952,0.000581694,0.01870444],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983163,0.00034786548,0.00014095333,0.00043750444,0.00051577424,0.00024167927],"domain_scores_gemma":[0.9962824,0.0013687552,0.00031896358,0.00096795283,0.00074485596,0.00031699278],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010287082,0.0008808304,0.00066654506,0.00094948756,0.0012480316,0.0020759148,0.0016872438,0.0011088395,0.008715173],"category_scores_gemma":[0.0073345136,0.0005497115,0.0007400633,0.0016900315,0.0021416356,0.003848844,0.0030184113,0.0017136274,0.0018441771],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003775736,0.0001649547,0.0037615465,0.00070275605,0.000079036006,0.0015069607,0.0018330556,0.05254388,0.036392428,0.6685744,0.019389257,0.21467419],"study_design_scores_gemma":[0.000088388835,0.00028205852,0.0013579684,0.000117718046,0.00014170706,0.0013290917,0.0011387758,0.16557305,0.030791514,0.66547257,0.13362306,0.0000840616],"about_ca_topic_score_codex":0.0027694546,"about_ca_topic_score_gemma":0.003208889,"teacher_disagreement_score":0.008715173,"about_ca_system_score_codex":0.00074569526,"about_ca_system_score_gemma":0.00097411853,"threshold_uncertainty_score":0.029155195},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.297799,0.0041783266,0.4999199,0.0031074476,0.0012155637,0.00017326919,0.0011468127,0.0019156091,0.1905441],"genre_scores_gemma":[0.8565213,0.0024881752,0.11045794,0.0006835124,0.0006334142,0.00030288566,0.0011551683,0.00096505776,0.026792383],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977392,0.00043916304,0.000127035,0.00044963966,0.00073724263,0.00050778163],"domain_scores_gemma":[0.9878594,0.0076750764,0.0006455383,0.0019293419,0.0006758487,0.0012147198],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026139775,0.0016227182,0.0017461153,0.0039458415,0.0022339073,0.0056739366,0.0037997228,0.0022464863,0.021286258],"category_scores_gemma":[0.01487866,0.0009850534,0.0014647007,0.0028688782,0.0038123475,0.008504811,0.0058706123,0.0047701714,0.002646708],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027165175,0.00009179248,0.001773383,0.00034371405,0.000057450867,0.00029030358,0.00031724313,0.026586456,0.01045371,0.91873425,0.007347168,0.033732794],"study_design_scores_gemma":[0.000030751984,0.000093440125,0.0009839316,0.00015245806,0.00009064312,0.0006049659,0.00014569558,0.12605424,0.00970423,0.8483839,0.013686737,0.00006895193],"about_ca_topic_score_codex":0.0005570623,"about_ca_topic_score_gemma":0.00083142635,"teacher_disagreement_score":0.021286258,"about_ca_system_score_codex":0.0020037175,"about_ca_system_score_gemma":0.0007515065,"threshold_uncertainty_score":0.07120961},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22064145,0.002456769,0.74122703,0.002983963,0.00026194454,0.0003457615,0.0016161277,0.004899655,0.025567256],"genre_scores_gemma":[0.41439933,0.0010476548,0.5645488,0.0005767369,0.0002704327,0.0003330256,0.002984996,0.0015275951,0.014311425],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9969399,0.00086260913,0.00015930533,0.0008968847,0.0006691168,0.00047228488],"domain_scores_gemma":[0.9941076,0.0039606323,0.00043523518,0.0009120011,0.0003181447,0.00026628975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015791699,0.0016851071,0.0019361784,0.0012084582,0.0015729623,0.0036020093,0.0033194388,0.0015749909,0.011375241],"category_scores_gemma":[0.01020994,0.0008668152,0.0012632868,0.0033532223,0.001655858,0.010433392,0.0031221122,0.0024218191,0.0031642565],"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.0026889888,0.0005301082,0.0029290114,0.0018953322,0.00024062517,0.0005001934,0.0012361323,0.47684637,0.016073091,0.16713195,0.038042583,0.29188567],"study_design_scores_gemma":[0.0003420758,0.0001766682,0.0007096305,0.000049949645,0.00009037521,0.00031192193,0.00030778028,0.69843626,0.004680454,0.28461486,0.010244102,0.00003588705],"about_ca_topic_score_codex":0.0048900396,"about_ca_topic_score_gemma":0.008210505,"teacher_disagreement_score":0.011375241,"about_ca_system_score_codex":0.0027553772,"about_ca_system_score_gemma":0.002021172,"threshold_uncertainty_score":0.03805399},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.058167305,0.00065724575,0.841255,0.0006767642,0.00022759373,0.00009158283,0.0011860252,0.0010690909,0.096669376],"genre_scores_gemma":[0.72108984,0.001344027,0.21816511,0.0006327168,0.00026500743,0.00019657277,0.0030835934,0.0010925205,0.05413071],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992835,0.00009684702,0.000048274276,0.00016171964,0.00032407825,0.00008563184],"domain_scores_gemma":[0.99730957,0.0009727473,0.00030308717,0.0008516738,0.00040380593,0.00015913023],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005503217,0.00031817515,0.00045935472,0.0011949132,0.00078656035,0.0020399506,0.0010351528,0.00064991746,0.015032529],"category_scores_gemma":[0.0049997647,0.0003545129,0.0005384912,0.0014519984,0.0014285349,0.002873278,0.002483192,0.0015070969,0.003147626],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049941456,0.000021174514,0.00087879534,0.00014194769,0.00001407573,0.00018373497,0.0002090633,0.0052898107,0.003109223,0.9157233,0.0076380954,0.06674085],"study_design_scores_gemma":[0.000027733675,0.000053754724,0.0010405317,0.000076536286,0.000031446398,0.00089910044,0.00031181364,0.03230131,0.0064191255,0.90713584,0.051681846,0.000021031128],"about_ca_topic_score_codex":0.0011019764,"about_ca_topic_score_gemma":0.0018306499,"teacher_disagreement_score":0.015032529,"about_ca_system_score_codex":0.00065095176,"about_ca_system_score_gemma":0.00041950372,"threshold_uncertainty_score":0.050288796},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0051719905,0.06931443,0.42689064,0.0067502838,0.010455125,0.000109293345,0.0007478024,0.00093067467,0.47962967],"genre_scores_gemma":[0.1258449,0.087815486,0.18720162,0.002171238,0.012729078,0.00060967496,0.0017476304,0.0016837664,0.5801966],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993249,0.000120996505,0.000036649853,0.00011596726,0.00035709326,0.00004430165],"domain_scores_gemma":[0.9994394,0.00022835976,0.000031199852,0.00013520195,0.00011984558,0.00004596497],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000585852,0.001643616,0.0022591732,0.0022276645,0.0009097098,0.003941717,0.0012117797,0.0010333754,0.028048402],"category_scores_gemma":[0.0019073143,0.0005470351,0.0008778843,0.004032928,0.0022383407,0.0031086109,0.0019897523,0.00463174,0.014668471],"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.000017904085,0.000032203545,0.00011957698,0.0004199958,0.000030279532,0.0000319797,0.000114616036,0.0030185184,0.0008192203,0.71401197,0.068569005,0.21281475],"study_design_scores_gemma":[0.0000151354325,0.000020998183,0.00029569812,0.00014237862,0.000016703892,0.00016057139,0.000049318,0.010015275,0.00041536358,0.76047605,0.22838007,0.000012503541],"about_ca_topic_score_codex":0.0006642795,"about_ca_topic_score_gemma":0.0008103931,"teacher_disagreement_score":0.028048402,"about_ca_system_score_codex":0.0015993516,"about_ca_system_score_gemma":0.0010990875,"threshold_uncertainty_score":0.09383124},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026866747,0.0011835787,0.9498455,0.0011606896,0.00019423374,0.00030943562,0.00861269,0.006812351,0.005014815],"genre_scores_gemma":[0.3265729,0.0012280307,0.6377649,0.0004127851,0.00025374882,0.0009043608,0.02530423,0.0018339533,0.0057251444],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965064,0.00038158623,0.0005424867,0.00064858893,0.001626606,0.00029422765],"domain_scores_gemma":[0.98661405,0.005005841,0.00085690874,0.005342274,0.0017573129,0.00042366344],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018165808,0.0010077218,0.002711882,0.0034044904,0.0017561903,0.007361556,0.004398275,0.0021661527,0.011795673],"category_scores_gemma":[0.023789367,0.0011071238,0.0015671074,0.007953875,0.001409916,0.014093219,0.006407615,0.0030427896,0.0037129002],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013276351,0.00047447105,0.0048602005,0.0012603449,0.00015192581,0.00028454064,0.0014367958,0.069173925,0.008429994,0.3741561,0.05330155,0.48514256],"study_design_scores_gemma":[0.00025805752,0.00016518965,0.00084012485,0.00017948533,0.00008903668,0.00047817905,0.0007016373,0.3469484,0.013307379,0.58553857,0.051398043,0.00009593214],"about_ca_topic_score_codex":0.0025101951,"about_ca_topic_score_gemma":0.0045663,"teacher_disagreement_score":0.011795673,"about_ca_system_score_codex":0.0020039883,"about_ca_system_score_gemma":0.0023312755,"threshold_uncertainty_score":0.03946042},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0999496,0.0021451605,0.82628465,0.0021205347,0.00041652354,0.000061815655,0.00015773052,0.0002044087,0.06865959],"genre_scores_gemma":[0.7644221,0.003120701,0.20156242,0.0008645121,0.00049778406,0.000109218054,0.00057838066,0.0003730656,0.028471746],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998689,0.00038789268,0.000080101316,0.00024121515,0.00045813242,0.00014371055],"domain_scores_gemma":[0.9896255,0.007119142,0.000378416,0.0008625292,0.001525599,0.0004887192],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022030952,0.0006131968,0.00085902546,0.002139003,0.0011283751,0.0018975178,0.0015143667,0.0015076968,0.0062228846],"category_scores_gemma":[0.017609,0.0008074055,0.0008609573,0.001151987,0.00509955,0.006442722,0.0064677317,0.0035141474,0.00071793434],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000749631,0.000012904591,0.0004636067,0.00007955261,0.000007845631,0.00009299151,0.0003610435,0.005211352,0.0011714225,0.9757547,0.0013324778,0.015437155],"study_design_scores_gemma":[0.000011808401,0.000028838454,0.00022385092,0.000046070094,0.000011080098,0.00014615002,0.00016009259,0.039858155,0.00070332707,0.954016,0.0047833105,0.000011338421],"about_ca_topic_score_codex":0.0009126276,"about_ca_topic_score_gemma":0.0008496447,"teacher_disagreement_score":0.0062228846,"about_ca_system_score_codex":0.00053587503,"about_ca_system_score_gemma":0.00040182297,"threshold_uncertainty_score":0.020817578},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020530688,0.00024701864,0.9689012,0.00038550037,0.00011590787,0.00026413472,0.00029114622,0.002392404,0.006872012],"genre_scores_gemma":[0.08721767,0.00017537012,0.90721434,0.0001543634,0.000048646256,0.00023608579,0.0008392284,0.00053082133,0.0035835041],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99875295,0.00021708611,0.00008134048,0.00039914539,0.00033981126,0.00020963694],"domain_scores_gemma":[0.9979664,0.0009820572,0.00014022535,0.00048138088,0.0002808791,0.00014906086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009973799,0.001546647,0.002008273,0.0022482674,0.0014927761,0.002697818,0.0035264986,0.002676788,0.016370982],"category_scores_gemma":[0.005723513,0.0013018226,0.0018964767,0.0032228965,0.0012101008,0.004361063,0.0043991692,0.0025182096,0.0034569667],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00058187364,0.00050963124,0.0009926817,0.0005453596,0.00012505765,0.00012246048,0.00035739766,0.22164868,0.011609256,0.072343595,0.021998001,0.66916597],"study_design_scores_gemma":[0.00017895222,0.00012357722,0.0003195483,0.00004452027,0.000060038004,0.00010610166,0.00016743151,0.8972783,0.0038858238,0.09101308,0.006791354,0.000031302003],"about_ca_topic_score_codex":0.0048696026,"about_ca_topic_score_gemma":0.006141089,"teacher_disagreement_score":0.016370982,"about_ca_system_score_codex":0.0021806757,"about_ca_system_score_gemma":0.0023860375,"threshold_uncertainty_score":0.054766417},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042916294,0.008789851,0.8716743,0.0062958873,0.0011726946,0.00053324323,0.002596197,0.0037023174,0.06231913],"genre_scores_gemma":[0.5458148,0.0094535835,0.39636436,0.0021283315,0.0026999372,0.0014498831,0.0046312623,0.0041916408,0.03326622],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9846644,0.0031756444,0.0008322795,0.0023666401,0.005725596,0.0032354214],"domain_scores_gemma":[0.88625103,0.08550882,0.004504246,0.01396492,0.0058276607,0.0039433236],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0105389925,0.0055107297,0.00600505,0.0059018238,0.0038341968,0.012889774,0.0138696935,0.00563223,0.03339813],"category_scores_gemma":[0.07424908,0.0031478952,0.0038657277,0.0076011624,0.005680273,0.0260702,0.015948432,0.011852283,0.006389698],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016992948,0.00082809903,0.002265265,0.001825102,0.00024311997,0.00027736666,0.00088233233,0.543972,0.0067135543,0.2616578,0.03469778,0.14493826],"study_design_scores_gemma":[0.00008624223,0.0002067753,0.0004787091,0.00023915771,0.00015824345,0.00020320914,0.00025243813,0.80093,0.0028169847,0.18860905,0.0059487764,0.00007039611],"about_ca_topic_score_codex":0.0037345137,"about_ca_topic_score_gemma":0.0063731773,"teacher_disagreement_score":0.03339813,"about_ca_system_score_codex":0.006926754,"about_ca_system_score_gemma":0.004310646,"threshold_uncertainty_score":0.111727834},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13156432,0.003894216,0.5204462,0.0048593516,0.0014806206,0.00014675705,0.00057405245,0.0009432581,0.33609128],"genre_scores_gemma":[0.80805373,0.0018632705,0.09053922,0.0012284908,0.0004912822,0.00020168241,0.00078261265,0.0013388623,0.09550086],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978264,0.0005736778,0.00010469242,0.00041794463,0.00063585734,0.00044137475],"domain_scores_gemma":[0.98800045,0.007955236,0.0005833954,0.0014134424,0.0010889183,0.0009586265],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024630763,0.0013702849,0.0014732883,0.0027460833,0.0025490155,0.004263102,0.0028743765,0.002595386,0.03450904],"category_scores_gemma":[0.031850297,0.0011406721,0.0011658114,0.0016817766,0.00485123,0.008811288,0.0066517573,0.0074040308,0.0044500586],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021177036,0.000036767087,0.00035530975,0.00007656652,0.0000141542,0.0000789866,0.00030553647,0.017638966,0.00069318525,0.9463365,0.008027903,0.026224328],"study_design_scores_gemma":[0.000026847814,0.00006819196,0.00031502306,0.00010569012,0.00002072795,0.00011409792,0.0002224876,0.090451874,0.0010429778,0.8899408,0.017648134,0.00004312975],"about_ca_topic_score_codex":0.004073835,"about_ca_topic_score_gemma":0.0034290175,"teacher_disagreement_score":0.03450904,"about_ca_system_score_codex":0.001612585,"about_ca_system_score_gemma":0.0009769906,"threshold_uncertainty_score":0.11544424},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.083830796,0.0011207795,0.83618176,0.0003093204,0.00016641927,0.000109209555,0.00049324625,0.00091295125,0.0768755],"genre_scores_gemma":[0.61328244,0.002470848,0.33820346,0.00013018088,0.00017020908,0.00033290568,0.0018954886,0.00082915596,0.04268534],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99973553,0.000039525123,0.000011761682,0.00007113104,0.000103167986,0.00003873595],"domain_scores_gemma":[0.99947685,0.000214507,0.00006335284,0.000104181876,0.00009296834,0.0000481443],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002326824,0.00042154035,0.00045406283,0.0010875164,0.00075230683,0.0010606924,0.0010885986,0.0005404014,0.012235914],"category_scores_gemma":[0.0015606559,0.0005352867,0.00038653237,0.0013709924,0.0006829681,0.0018179752,0.0013939907,0.0009328395,0.0012337234],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022518549,0.000066715256,0.0007204853,0.00028338874,0.000018339804,0.00035966918,0.00039846756,0.09557496,0.016349813,0.6723327,0.013867406,0.19980282],"study_design_scores_gemma":[0.00007770848,0.00011042475,0.0009008439,0.00010403325,0.000029616776,0.0009935432,0.00032430235,0.4035539,0.008086441,0.52441835,0.0613593,0.00004147394],"about_ca_topic_score_codex":0.0013266891,"about_ca_topic_score_gemma":0.0013704306,"teacher_disagreement_score":0.012235914,"about_ca_system_score_codex":0.00045597696,"about_ca_system_score_gemma":0.00021595086,"threshold_uncertainty_score":0.04093319},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48989064,0.0017590731,0.36415988,0.0014199137,0.00057549874,0.00010865691,0.0010945572,0.0005987757,0.14039305],"genre_scores_gemma":[0.9154615,0.00092700706,0.06691193,0.00020409226,0.0002306233,0.00011963322,0.0007012398,0.00033167718,0.01511236],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992675,0.00022129432,0.000040507723,0.0001592381,0.0001854339,0.00012596267],"domain_scores_gemma":[0.9933437,0.0044112746,0.00076852844,0.0004970143,0.0004288376,0.00055072637],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012442298,0.00060353044,0.00054932415,0.003635097,0.0010530384,0.002396766,0.0011887046,0.0011028223,0.013148059],"category_scores_gemma":[0.012828433,0.00045065163,0.0004877569,0.0016693202,0.002126281,0.0046527595,0.0016340005,0.00197313,0.0013060246],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015312582,0.000048202848,0.0021207698,0.000105291525,0.000020239835,0.00013170694,0.00027455846,0.015959144,0.0022258959,0.9394307,0.005582895,0.033947513],"study_design_scores_gemma":[0.000019888088,0.000040045594,0.0015273746,0.00006541633,0.000024649387,0.00024732144,0.0002220354,0.054021865,0.0018537977,0.93569386,0.006260262,0.000023522023],"about_ca_topic_score_codex":0.0007950368,"about_ca_topic_score_gemma":0.0012420346,"teacher_disagreement_score":0.013148059,"about_ca_system_score_codex":0.0009035927,"about_ca_system_score_gemma":0.00041541716,"threshold_uncertainty_score":0.04398465},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04390492,0.00030375714,0.93287826,0.0005044705,0.00021071508,0.0000924274,0.0003025412,0.0011142979,0.020688625],"genre_scores_gemma":[0.40401116,0.0004711472,0.572358,0.00030836315,0.0002139499,0.00023732898,0.00058836647,0.00094966276,0.020862088],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99921954,0.00020443997,0.00003066171,0.00011457766,0.0003178015,0.00011299694],"domain_scores_gemma":[0.9979838,0.0010299984,0.00013215185,0.00046960195,0.00026170735,0.00012261275],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005734294,0.00083222456,0.0010685577,0.00084834103,0.0005524413,0.0013778395,0.0013319656,0.0011388584,0.015147997],"category_scores_gemma":[0.005966083,0.00074731227,0.00050224934,0.001113708,0.0007223757,0.0022062485,0.0022732087,0.0013168148,0.002271948],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046841506,0.00031411884,0.000905982,0.0003128186,0.000039756487,0.00016596795,0.00012404527,0.3643779,0.0140919415,0.25535992,0.02914845,0.33469072],"study_design_scores_gemma":[0.00008591549,0.00012030696,0.00026414162,0.000019876097,0.00001876949,0.0001753455,0.00004666941,0.8190863,0.0039207493,0.17042446,0.005818911,0.000018536351],"about_ca_topic_score_codex":0.0010670592,"about_ca_topic_score_gemma":0.0021821961,"teacher_disagreement_score":0.015147997,"about_ca_system_score_codex":0.00058382965,"about_ca_system_score_gemma":0.00094941654,"threshold_uncertainty_score":0.050675035},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0047484697,0.00018069307,0.9920419,0.00013125344,0.00010420251,0.000032202144,0.000041628904,0.00029063778,0.0024289405],"genre_scores_gemma":[0.3508461,0.0005356637,0.638788,0.00022106689,0.0001767304,0.00033565026,0.0003070208,0.0006110859,0.008178602],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99947995,0.00016558266,0.000026564496,0.000052836207,0.00023659207,0.00003845676],"domain_scores_gemma":[0.99875844,0.0005905444,0.000091377864,0.00019394512,0.00029669006,0.00006904802],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093340274,0.00046246292,0.00084427826,0.00058822293,0.00071074185,0.0008166187,0.0013334119,0.0009049191,0.0042390344],"category_scores_gemma":[0.003461548,0.00051956304,0.0007343863,0.0008721835,0.00077993964,0.00067341316,0.0014510591,0.0013862151,0.00068747794],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008352002,0.000059385973,0.0004870005,0.000093788716,0.000048630503,0.00006655552,0.000046135832,0.85250777,0.0035888555,0.09148318,0.0029983895,0.048536856],"study_design_scores_gemma":[0.000008983325,0.0000045125566,0.00002968145,0.0000023449447,0.0000021964315,0.000007014653,0.0000017465414,0.989431,0.00026627464,0.009570104,0.00067357277,0.0000025998982],"about_ca_topic_score_codex":0.0035028046,"about_ca_topic_score_gemma":0.00484139,"teacher_disagreement_score":0.0042390344,"about_ca_system_score_codex":0.0008375683,"about_ca_system_score_gemma":0.0010832244,"threshold_uncertainty_score":0.014180958},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.105486944,0.00082561455,0.8737689,0.0012775086,0.00013331212,0.0001849255,0.0008094932,0.003978976,0.013534357],"genre_scores_gemma":[0.53831303,0.00036181297,0.45086044,0.0004936703,0.00013259905,0.0003896842,0.001353163,0.00046216932,0.0076333727],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99579537,0.0011754485,0.00025430316,0.0011623137,0.0010688656,0.0005437319],"domain_scores_gemma":[0.985233,0.0068570855,0.0013746755,0.0052637635,0.00084659003,0.00042491104],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019539467,0.00097348663,0.0012466605,0.0008222688,0.0010031951,0.0021653478,0.0031670597,0.0011063216,0.008133159],"category_scores_gemma":[0.013090472,0.00061212765,0.0008412107,0.0018296273,0.0013617948,0.0057054446,0.0036603734,0.0020020904,0.0021099218],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020807828,0.0004960037,0.0053818035,0.00062805536,0.00015476675,0.000775445,0.0010682675,0.32675642,0.043189324,0.19171053,0.025807507,0.40195107],"study_design_scores_gemma":[0.00015731096,0.00041437888,0.001046616,0.000073380186,0.000053490512,0.00051947555,0.00024225454,0.8343226,0.02382208,0.12590566,0.013368212,0.0000745391],"about_ca_topic_score_codex":0.0015842174,"about_ca_topic_score_gemma":0.0016972682,"teacher_disagreement_score":0.008133159,"about_ca_system_score_codex":0.0012289633,"about_ca_system_score_gemma":0.0010932075,"threshold_uncertainty_score":0.02720815},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8103685,0.00043698397,0.18153638,0.00056656706,0.00005549464,0.000120922334,0.0011880223,0.00049026404,0.0052369237],"genre_scores_gemma":[0.9763165,0.00026456724,0.019236736,0.00010668879,0.000037518854,0.00020931127,0.0014542694,0.00012946578,0.0022449342],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980427,0.0005610917,0.000093428236,0.0005030167,0.0005503843,0.00024933068],"domain_scores_gemma":[0.9813198,0.010600066,0.0028758745,0.0023961554,0.0020427709,0.00076535164],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023410744,0.0004517501,0.00076685817,0.0024419508,0.0006942443,0.0016439361,0.0016999987,0.0012392777,0.0028053923],"category_scores_gemma":[0.0221773,0.0006479967,0.0006413788,0.0019656145,0.0026738148,0.0023681081,0.0015259709,0.0012959371,0.00051488786],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013518922,0.00014645925,0.09515974,0.00032055101,0.00022044634,0.00077380217,0.0008804946,0.53477204,0.032521892,0.27150154,0.0066634803,0.055687636],"study_design_scores_gemma":[0.00011463069,0.00019353167,0.027322777,0.00008608456,0.00007338366,0.0011897266,0.0004910427,0.85162437,0.010485082,0.105199024,0.003068199,0.00015221204],"about_ca_topic_score_codex":0.001812218,"about_ca_topic_score_gemma":0.001915518,"teacher_disagreement_score":0.0028053923,"about_ca_system_score_codex":0.0014197553,"about_ca_system_score_gemma":0.0004972713,"threshold_uncertainty_score":0.012380958},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050863937,0.0009345208,0.9165161,0.0020043182,0.00023047272,0.00037127145,0.0011275435,0.0042990134,0.023652822],"genre_scores_gemma":[0.40497315,0.00062810734,0.5809316,0.0011880151,0.00037285656,0.00050757016,0.002557785,0.0011350329,0.0077059376],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9906651,0.0017307987,0.00055013795,0.003464986,0.0020509646,0.0015380586],"domain_scores_gemma":[0.9827297,0.008788132,0.0012356709,0.005729986,0.00083698507,0.0006795179],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036358656,0.001992124,0.0025429912,0.0014599201,0.0014577286,0.0050802035,0.0059209513,0.004080112,0.011226307],"category_scores_gemma":[0.022987908,0.0012256929,0.0030588736,0.0032188792,0.003013962,0.009832761,0.0057157627,0.0057859737,0.0028327466],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00087430346,0.00061118405,0.0034798372,0.0006933348,0.0002843555,0.0001239046,0.00034998392,0.49732608,0.006554353,0.3021393,0.020899722,0.16666365],"study_design_scores_gemma":[0.00020673365,0.00017282207,0.0004572048,0.00004173397,0.00008517068,0.00015334874,0.00006465616,0.6930882,0.003788431,0.29326367,0.00864506,0.000033033026],"about_ca_topic_score_codex":0.0016074292,"about_ca_topic_score_gemma":0.0022763796,"teacher_disagreement_score":0.011226307,"about_ca_system_score_codex":0.0046336753,"about_ca_system_score_gemma":0.0037605888,"threshold_uncertainty_score":0.037555695},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006140824,0.00057914254,0.962784,0.00015200053,0.00017374424,0.00014250696,0.0006535641,0.001623938,0.027750317],"genre_scores_gemma":[0.16850498,0.0008221098,0.8065715,0.00016014601,0.000103441525,0.00026417794,0.0021639455,0.0014029656,0.020006679],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988281,0.00030757615,0.000059337563,0.00021730855,0.00048125832,0.00010637346],"domain_scores_gemma":[0.99837166,0.0005825771,0.000106426596,0.00051443756,0.0003343974,0.00009049],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007478224,0.00080890756,0.0009856222,0.0012255791,0.00068796583,0.0013380903,0.0018872495,0.0011504638,0.018884413],"category_scores_gemma":[0.0069117313,0.00075081934,0.001051671,0.0012887261,0.0008839479,0.0013344105,0.003184914,0.0014038875,0.0073952223],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00055552914,0.0000909987,0.0018259161,0.00077322265,0.00015703279,0.00050328136,0.0006979801,0.15217893,0.01554028,0.29422024,0.057706863,0.4757497],"study_design_scores_gemma":[0.00012087816,0.00010791024,0.0007132285,0.00023186827,0.00006025006,0.00076891383,0.0002527778,0.71941334,0.013103395,0.13015904,0.1350047,0.0000635519],"about_ca_topic_score_codex":0.0034534186,"about_ca_topic_score_gemma":0.008198926,"teacher_disagreement_score":0.018884413,"about_ca_system_score_codex":0.00050972274,"about_ca_system_score_gemma":0.0009231494,"threshold_uncertainty_score":0.063174665},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046174873,0.008543061,0.50666535,0.0017774255,0.001637331,0.00032962923,0.0017272037,0.0017982443,0.43134692],"genre_scores_gemma":[0.4000157,0.017235858,0.32203087,0.000916564,0.0009811858,0.00042454,0.0041168653,0.0020157024,0.2522627],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99977666,0.00004036489,0.000010917178,0.000047941216,0.000098494114,0.000025604979],"domain_scores_gemma":[0.99980086,0.0000537747,0.000019255926,0.000046031615,0.00005833376,0.000021742777],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015532767,0.0008560699,0.00043755144,0.0017308136,0.0005740011,0.0023338287,0.0011185784,0.0006721766,0.014523897],"category_scores_gemma":[0.00083043746,0.00056862115,0.0005500962,0.0030059717,0.0010544951,0.0028329229,0.0012558061,0.0019904834,0.004600648],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010257725,0.00000963444,0.000048245805,0.00013923582,0.0000058704,0.00005927989,0.00013668818,0.0036849624,0.0013420543,0.9165634,0.011959346,0.066040985],"study_design_scores_gemma":[0.0000059531067,0.000009149951,0.00009264269,0.000052292875,0.000009440348,0.00025694698,0.000083530394,0.0050844243,0.0008822316,0.8952485,0.09826581,0.000008959277],"about_ca_topic_score_codex":0.0006750839,"about_ca_topic_score_gemma":0.0009238101,"teacher_disagreement_score":0.014523897,"about_ca_system_score_codex":0.00079854537,"about_ca_system_score_gemma":0.0002751739,"threshold_uncertainty_score":0.048587263},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010987153,0.0004763884,0.971422,0.00013602282,0.000116891904,0.0000439892,0.00023883452,0.000891809,0.015687024],"genre_scores_gemma":[0.38194987,0.0007957126,0.6007589,0.00009673464,0.000044201846,0.000086903856,0.0010390902,0.0004715812,0.014757058],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994703,0.00010168256,0.000024638506,0.00008201604,0.0002699908,0.00005141564],"domain_scores_gemma":[0.99947506,0.00025336212,0.000024023155,0.00010340259,0.000103911596,0.000040267067],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037988383,0.00045978013,0.0006719835,0.000962025,0.0005683115,0.0017499528,0.0009551124,0.000844778,0.008818491],"category_scores_gemma":[0.003490574,0.0004069845,0.000646576,0.00080188335,0.0006038875,0.0021367061,0.0026029563,0.0007749072,0.0026684527],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018793189,0.000039226707,0.0007810865,0.00035760476,0.00004886141,0.00025530014,0.0006181886,0.119439326,0.01089152,0.5171708,0.016584199,0.33362594],"study_design_scores_gemma":[0.00005693226,0.000049625767,0.00021913316,0.00009342818,0.000023068882,0.00039730594,0.00023350664,0.46133396,0.009565943,0.44843608,0.07956215,0.000028948603],"about_ca_topic_score_codex":0.0023940417,"about_ca_topic_score_gemma":0.0047040866,"teacher_disagreement_score":0.008818491,"about_ca_system_score_codex":0.0005872625,"about_ca_system_score_gemma":0.0005904132,"threshold_uncertainty_score":0.029500723},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3571832,0.006980934,0.49114862,0.0014494101,0.0008610904,0.00014753151,0.0016022917,0.00091977394,0.13970716],"genre_scores_gemma":[0.86222017,0.0020187374,0.10388479,0.00018694134,0.00028826256,0.00011669008,0.0015851244,0.00037578278,0.029323447],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994252,0.00010049512,0.000030256604,0.00010373493,0.00024348259,0.000096794356],"domain_scores_gemma":[0.998884,0.00056839397,0.00009195569,0.00020643715,0.00013264825,0.000116526586],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025769003,0.00046066608,0.00095331325,0.0015114135,0.0011064537,0.0018843963,0.0009910228,0.0008794256,0.010142573],"category_scores_gemma":[0.0039478475,0.0005516147,0.00058738707,0.001176854,0.0011957558,0.0020308527,0.0033923986,0.0014756185,0.0018065795],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003794414,0.00006286549,0.002123828,0.0003661087,0.00006058696,0.0007080952,0.0005903749,0.05111966,0.0066367607,0.7793043,0.027309738,0.13133815],"study_design_scores_gemma":[0.00005317874,0.00012099599,0.0028492517,0.000125291,0.00004382506,0.0018787753,0.0006452978,0.19605985,0.00648057,0.7471864,0.044511113,0.000045492343],"about_ca_topic_score_codex":0.0018755721,"about_ca_topic_score_gemma":0.0016288272,"teacher_disagreement_score":0.010142573,"about_ca_system_score_codex":0.00061733037,"about_ca_system_score_gemma":0.00035465084,"threshold_uncertainty_score":0.033930242},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5592534,0.004925425,0.14798719,0.0027094139,0.0013368413,0.00009672545,0.0016180022,0.0008382977,0.28123474],"genre_scores_gemma":[0.96159947,0.0014289627,0.024641927,0.00027628386,0.00024158011,0.000061887775,0.0005344224,0.00021599248,0.010999638],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99935156,0.0001535429,0.00003884024,0.00015623133,0.00014999522,0.00014987998],"domain_scores_gemma":[0.9963085,0.0020333617,0.00046422624,0.00030403616,0.0004090524,0.00048073378],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009773974,0.00054805307,0.0005310124,0.002769834,0.0011308872,0.0017332416,0.000908443,0.00071786967,0.012426938],"category_scores_gemma":[0.00967155,0.00029634364,0.000256193,0.0014671903,0.001590274,0.0025986603,0.0014216128,0.0013754594,0.0022121063],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00085675035,0.0001467155,0.00757819,0.00035125925,0.00005188691,0.00045257265,0.00053065707,0.048562467,0.0067077214,0.7486753,0.04232779,0.14375858],"study_design_scores_gemma":[0.00004974284,0.00012738733,0.0055972687,0.00021588871,0.00004060361,0.00095750846,0.00054338534,0.1395175,0.0054397047,0.8246172,0.022812873,0.00008101271],"about_ca_topic_score_codex":0.0014117998,"about_ca_topic_score_gemma":0.0016568138,"teacher_disagreement_score":0.012426938,"about_ca_system_score_codex":0.0008149143,"about_ca_system_score_gemma":0.0004382154,"threshold_uncertainty_score":0.041572273},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0160338,0.0005655387,0.96929884,0.0005342151,0.00015993077,0.0003630458,0.00031270427,0.0043981806,0.008333753],"genre_scores_gemma":[0.054017622,0.00017558399,0.9404755,0.00011513695,0.000050270646,0.00028864437,0.0011948926,0.0004226333,0.0032597242],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991105,0.0001660646,0.000059594888,0.00022354745,0.00030183035,0.00013853214],"domain_scores_gemma":[0.99836737,0.0006887015,0.00013891154,0.00039305264,0.0003062503,0.00010580397],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009199173,0.0013851093,0.0013892105,0.0012518156,0.0012083678,0.0012975582,0.0024245428,0.0021095192,0.0134418495],"category_scores_gemma":[0.004888251,0.00078723516,0.001328631,0.0022808893,0.0005984249,0.0034480828,0.0027071252,0.0014460882,0.004523364],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046310248,0.00033879187,0.0015391965,0.0005432948,0.00012063037,0.000394445,0.00050115597,0.17095545,0.014103141,0.037159763,0.05480012,0.7190809],"study_design_scores_gemma":[0.00032566508,0.00016618978,0.0006282156,0.000054923657,0.000050234845,0.00045711003,0.00031517708,0.90299076,0.005490619,0.059807237,0.02967003,0.000043759483],"about_ca_topic_score_codex":0.00508624,"about_ca_topic_score_gemma":0.006414947,"teacher_disagreement_score":0.0134418495,"about_ca_system_score_codex":0.0008972625,"about_ca_system_score_gemma":0.0016997196,"threshold_uncertainty_score":0.044967532},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050670087,0.00015049714,0.9394702,0.00007861628,0.00014104178,0.0001302366,0.00021875268,0.0011980161,0.007942646],"genre_scores_gemma":[0.47102898,0.00020345834,0.51399744,0.000088672234,0.00004981857,0.00011344586,0.0007004644,0.00053173816,0.013286051],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990138,0.00010200229,0.000046814785,0.00033135185,0.00035311095,0.0001528847],"domain_scores_gemma":[0.99922717,0.00018201051,0.0000579504,0.0003211125,0.000117768024,0.00009405579],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006528072,0.0012133394,0.0013898298,0.00098619,0.0006917346,0.0014608629,0.001631622,0.001428973,0.007890312],"category_scores_gemma":[0.0022036121,0.0010720857,0.0015110817,0.00069305766,0.0012340348,0.0016869074,0.0052483175,0.001892369,0.0016554625],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009850168,0.00022996402,0.0025674838,0.00030250318,0.00015328158,0.00057035364,0.0007092908,0.38341317,0.047272872,0.03833263,0.010172751,0.5152906],"study_design_scores_gemma":[0.000027622877,0.0001570594,0.0006341403,0.00004021992,0.00002215931,0.00019218947,0.00024079352,0.96833706,0.00962889,0.015525353,0.005166311,0.000028270384],"about_ca_topic_score_codex":0.003854177,"about_ca_topic_score_gemma":0.006241356,"teacher_disagreement_score":0.007890312,"about_ca_system_score_codex":0.00036024197,"about_ca_system_score_gemma":0.0007688976,"threshold_uncertainty_score":0.026395738},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6848865,0.013250948,0.18813325,0.019339709,0.00080994825,0.00015964624,0.004742321,0.00058505475,0.08809266],"genre_scores_gemma":[0.94347775,0.0060940715,0.027015334,0.0013386451,0.0013492195,0.0003838669,0.0028326162,0.0003755644,0.017132852],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9953441,0.0013270796,0.00021651175,0.0014659275,0.0009626503,0.0006836434],"domain_scores_gemma":[0.9631855,0.02451807,0.003730085,0.0028138172,0.0017659265,0.0039865375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038134812,0.0015390972,0.004041713,0.0047759814,0.0047009704,0.009288132,0.0068611656,0.0045189452,0.01778877],"category_scores_gemma":[0.03999044,0.0020800103,0.0023056671,0.0041450015,0.009045612,0.022250867,0.006714534,0.005924093,0.0020606734],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008257826,0.00012905222,0.013387531,0.00049268507,0.00022451497,0.0003193056,0.00094320736,0.029256165,0.0017329074,0.9164083,0.014371782,0.021908762],"study_design_scores_gemma":[0.00015166776,0.000094556206,0.0059038405,0.0001889135,0.0001457586,0.0007287078,0.00064827426,0.06837969,0.00083775277,0.91424435,0.008572307,0.00010416698],"about_ca_topic_score_codex":0.0038720127,"about_ca_topic_score_gemma":0.0023209983,"teacher_disagreement_score":0.01778877,"about_ca_system_score_codex":0.0033885206,"about_ca_system_score_gemma":0.00096166576,"threshold_uncertainty_score":0.059509337},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41516387,0.001923318,0.3899107,0.002270102,0.001107968,0.0003372867,0.008127196,0.0017657869,0.17939377],"genre_scores_gemma":[0.8169239,0.000741399,0.12683435,0.00026549128,0.0002041625,0.00021313666,0.0031301035,0.0006176172,0.051069815],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998882,0.00019882194,0.000079728525,0.00022649796,0.00038553408,0.00022736103],"domain_scores_gemma":[0.995956,0.0017540068,0.0003161946,0.00075248093,0.00074503175,0.00047633128],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008506504,0.00038532325,0.0007160686,0.0013044128,0.001163562,0.0024254138,0.0015429512,0.0010847072,0.025260177],"category_scores_gemma":[0.0077488758,0.0002867682,0.00045185903,0.0007345001,0.0015732895,0.0025340915,0.0021961941,0.0012624195,0.004831835],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014833182,0.00023540069,0.016558748,0.0007885559,0.0001274283,0.00068906805,0.0008219821,0.020088334,0.03952996,0.55281097,0.037550364,0.32931587],"study_design_scores_gemma":[0.00016801848,0.00029592426,0.014413941,0.00033899196,0.00013822115,0.0026775454,0.0014454066,0.09891265,0.06385946,0.7172934,0.100353085,0.00010339509],"about_ca_topic_score_codex":0.0006658991,"about_ca_topic_score_gemma":0.00101285,"teacher_disagreement_score":0.025260177,"about_ca_system_score_codex":0.0004759582,"about_ca_system_score_gemma":0.0004703227,"threshold_uncertainty_score":0.08450371},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06926495,0.0016406943,0.44994986,0.003853531,0.0015308412,0.00016068727,0.0010922097,0.0010334741,0.4714737],"genre_scores_gemma":[0.74658865,0.003392812,0.14386016,0.005639089,0.0017567216,0.0004816264,0.0023407068,0.0015415155,0.09439866],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979272,0.0006459285,0.000078418474,0.00049679383,0.0005251086,0.00032663584],"domain_scores_gemma":[0.99313605,0.0038116402,0.00038567928,0.0012295021,0.00093959906,0.0004975971],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002077757,0.0008468893,0.0013433857,0.002131943,0.0027949214,0.0032918996,0.0028729704,0.001894027,0.02625343],"category_scores_gemma":[0.009039424,0.0009020563,0.001974976,0.0029117023,0.003710112,0.007530965,0.006070668,0.006278319,0.004664578],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000062794454,0.000026368118,0.00011080905,0.00010357834,0.00001426718,0.00010926093,0.000115509014,0.0010130216,0.0014433871,0.98124033,0.007366966,0.008393721],"study_design_scores_gemma":[0.00002957138,0.000021800577,0.00019353449,0.000047894377,0.000034631285,0.00020741332,0.000058701175,0.006500687,0.0010319098,0.9786401,0.013216132,0.000017650165],"about_ca_topic_score_codex":0.0017548633,"about_ca_topic_score_gemma":0.0011889118,"teacher_disagreement_score":0.02625343,"about_ca_system_score_codex":0.0013484212,"about_ca_system_score_gemma":0.0009721567,"threshold_uncertainty_score":0.08782649},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08844643,0.0003853476,0.8996431,0.00021317863,0.00014777103,0.00026270954,0.00041548756,0.0031398183,0.0073462436],"genre_scores_gemma":[0.52947867,0.0002223396,0.4595768,0.00014248012,0.00006872681,0.00020872605,0.0010934768,0.0006279947,0.008580818],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99899465,0.00016086591,0.00006650868,0.00027606174,0.00030331165,0.0001986122],"domain_scores_gemma":[0.9978435,0.0011911801,0.00013277623,0.00047515723,0.00016319081,0.00019423092],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095898873,0.0015048146,0.0025334612,0.0009729994,0.0007296264,0.0014744771,0.002379948,0.001921624,0.012954853],"category_scores_gemma":[0.00509878,0.0010919856,0.0016652825,0.00070863875,0.0013119633,0.0029315618,0.006191986,0.0018116832,0.0014104021],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012735706,0.0002618516,0.0016226996,0.00038700688,0.00013142305,0.0003001093,0.00032957518,0.59101766,0.011580225,0.030366918,0.009204593,0.3535244],"study_design_scores_gemma":[0.000041723564,0.00009971577,0.00015730204,0.000017953093,0.000011223107,0.000046606678,0.000066902154,0.9791711,0.0014671857,0.018011877,0.00089799205,0.000010414928],"about_ca_topic_score_codex":0.0046355054,"about_ca_topic_score_gemma":0.0057462924,"teacher_disagreement_score":0.012954853,"about_ca_system_score_codex":0.0006414311,"about_ca_system_score_gemma":0.0008446822,"threshold_uncertainty_score":0.0433383},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42372906,0.0008322502,0.5467234,0.00031306894,0.00012668288,0.0003302167,0.0009560287,0.0014965491,0.025492767],"genre_scores_gemma":[0.6666577,0.0005800645,0.31625515,0.00013406535,0.000038717608,0.00016150408,0.0020756777,0.00078763976,0.013309481],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994474,0.00004352521,0.00003543373,0.00018277291,0.00014071137,0.0001501735],"domain_scores_gemma":[0.9992111,0.00016769482,0.000091020236,0.00020939695,0.00015785519,0.00016294481],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028406718,0.0007409917,0.001142202,0.0016531921,0.0015401534,0.0016288125,0.0009541688,0.00093500846,0.010689416],"category_scores_gemma":[0.0027820372,0.00079778134,0.0007650225,0.0012433769,0.0010923571,0.0030747368,0.0033786222,0.0010926723,0.0015382678],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006732464,0.00024215762,0.010984782,0.0011434087,0.00016378032,0.0011989108,0.0014867716,0.07663288,0.083852775,0.25033122,0.012155561,0.5611345],"study_design_scores_gemma":[0.00012939131,0.0007178024,0.007571847,0.00051889964,0.00025932948,0.0016494567,0.002915871,0.28707594,0.07140005,0.5517449,0.07578036,0.00023622758],"about_ca_topic_score_codex":0.0031153446,"about_ca_topic_score_gemma":0.0039556795,"teacher_disagreement_score":0.010689416,"about_ca_system_score_codex":0.00064504833,"about_ca_system_score_gemma":0.001125831,"threshold_uncertainty_score":0.035759628},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036656118,0.000036157573,0.98648226,0.000052970536,0.00007939247,0.00008161744,0.00036944248,0.005498795,0.0037337537],"genre_scores_gemma":[0.080273904,0.00009505607,0.90499073,0.00016509899,0.000030332183,0.00039171372,0.0016224188,0.0036709472,0.008759828],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9997656,0.000030791576,0.000015267813,0.000020607453,0.00014934796,0.000018470304],"domain_scores_gemma":[0.9995647,0.00013533421,0.000022911954,0.00008842106,0.00015383965,0.000034789733],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053893303,0.0006179467,0.00056720566,0.0005271213,0.000388634,0.0007220313,0.0025784122,0.001094667,0.01765239],"category_scores_gemma":[0.0014699202,0.00067306607,0.0006823452,0.0004110497,0.00023785177,0.0007074239,0.0015030575,0.0011697765,0.0057069412],"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.00048079388,0.00024973985,0.0019174798,0.00055563153,0.00013138271,0.000639072,0.0004542728,0.38591322,0.08516726,0.058542624,0.044613604,0.42133486],"study_design_scores_gemma":[0.00005042934,0.000030001855,0.000100851896,0.000016167201,0.0000078851135,0.00008900522,0.000015397718,0.9678811,0.011595298,0.003668886,0.01652756,0.000017422693],"about_ca_topic_score_codex":0.0007292208,"about_ca_topic_score_gemma":0.001422147,"teacher_disagreement_score":0.01765239,"about_ca_system_score_codex":0.0003116912,"about_ca_system_score_gemma":0.0006115638,"threshold_uncertainty_score":0.059053123},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49608108,0.0031491476,0.46685174,0.0018516325,0.0014041614,0.00010110327,0.0004749544,0.0018718411,0.02821431],"genre_scores_gemma":[0.96078414,0.00037168327,0.03585688,0.00012533399,0.00006781707,0.000022521606,0.00016693016,0.00047104148,0.0021336903],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99853754,0.00048614194,0.000068549125,0.0001417671,0.00064876035,0.000117279254],"domain_scores_gemma":[0.9846506,0.011085794,0.00037609722,0.0010970556,0.0026263692,0.00016407623],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001698019,0.0005129608,0.00053961744,0.0006448403,0.0004890877,0.00089402683,0.0006208,0.0011927406,0.002732057],"category_scores_gemma":[0.023356806,0.00020196628,0.0003516613,0.0006199323,0.00057099585,0.0011804102,0.0009127451,0.00080774137,0.0004753973],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017628967,0.00026302852,0.0063935844,0.00044517507,0.00007072342,0.00042489983,0.000263027,0.77771014,0.028940598,0.011052155,0.003903399,0.1687704],"study_design_scores_gemma":[0.00002783186,0.000124704,0.001272738,0.000037489488,0.000024231387,0.00008609998,0.000061464205,0.98041725,0.015420008,0.001557168,0.0009561247,0.000014879246],"about_ca_topic_score_codex":0.0029437784,"about_ca_topic_score_gemma":0.002174513,"teacher_disagreement_score":0.0029437784,"about_ca_system_score_codex":0.00035461684,"about_ca_system_score_gemma":0.00063265284,"threshold_uncertainty_score":0.009139657},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015184702,0.07814286,0.4603102,0.012809326,0.10599678,0.00036258472,0.003079301,0.0058955695,0.3182187],"genre_scores_gemma":[0.07252284,0.070517436,0.18135072,0.0017371789,0.01455122,0.00032227152,0.00905283,0.0034753815,0.64647],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990884,0.00016762163,0.00006260965,0.00015197216,0.00044307177,0.00008629945],"domain_scores_gemma":[0.99736387,0.0004579436,0.00007370978,0.00063420576,0.001057003,0.00041327908],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017250126,0.0012870922,0.0026785478,0.0013793284,0.000792904,0.004293295,0.0013226564,0.0011495441,0.055701822],"category_scores_gemma":[0.0030310666,0.000596154,0.0011718248,0.001335811,0.0009710218,0.0018331881,0.0020168868,0.0032899822,0.030972417],"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.0005244768,0.0002126477,0.0013374437,0.0003802538,0.00018206981,0.00013302053,0.00015059019,0.0040084627,0.0045733075,0.043787498,0.6329353,0.31177485],"study_design_scores_gemma":[0.0000654661,0.00009791468,0.0014800611,0.0001938964,0.00008706046,0.00028103168,0.0000755739,0.017935986,0.0023425876,0.023176748,0.95423293,0.000030852505],"about_ca_topic_score_codex":0.0033295788,"about_ca_topic_score_gemma":0.005795533,"teacher_disagreement_score":0.055701822,"about_ca_system_score_codex":0.0007528361,"about_ca_system_score_gemma":0.0017815543,"threshold_uncertainty_score":0.18634117},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48425665,0.00013732452,0.5081033,0.00010602493,0.000048052414,0.00015257661,0.00035003127,0.0007460276,0.0061001354],"genre_scores_gemma":[0.669475,0.00008365603,0.32651666,0.00004877492,0.0000152954,0.00014485212,0.00093831285,0.00036917673,0.0024081855],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994785,0.00012688505,0.000030777923,0.000101321944,0.00017654066,0.00008594999],"domain_scores_gemma":[0.998106,0.0011891136,0.00014761207,0.00023269927,0.00018506829,0.00013951288],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005125507,0.0008764659,0.0012432898,0.0011680262,0.0006304588,0.0013216233,0.0011328252,0.0011751922,0.0044545797],"category_scores_gemma":[0.0046697413,0.0008743131,0.00074408815,0.0010705333,0.00084252626,0.0013016684,0.0019731468,0.0010585831,0.00051496347],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001242027,0.00026038996,0.0041721435,0.00032765412,0.00008928125,0.00030573714,0.0006676598,0.75632405,0.022627484,0.03697011,0.0031359326,0.1738776],"study_design_scores_gemma":[0.00004660579,0.00012140114,0.00038269375,0.000017243206,0.000012074846,0.000041957195,0.0001603284,0.97761106,0.0030600466,0.017845578,0.0006917595,0.000009189862],"about_ca_topic_score_codex":0.0023861136,"about_ca_topic_score_gemma":0.0045809406,"teacher_disagreement_score":0.0044545797,"about_ca_system_score_codex":0.00049011025,"about_ca_system_score_gemma":0.0006679453,"threshold_uncertainty_score":0.014902055},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08853167,0.0002828506,0.88955396,0.00056241284,0.0002403452,0.00074959715,0.00071588135,0.002167706,0.017195545],"genre_scores_gemma":[0.23709989,0.0002252316,0.7513398,0.0001293004,0.00006365369,0.00072516437,0.0012232796,0.0006455046,0.008548118],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963483,0.0010027525,0.00024136945,0.00089501915,0.0011681936,0.0003444389],"domain_scores_gemma":[0.98998463,0.0033739367,0.0014568942,0.0019909302,0.0023189466,0.0008746248],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015537995,0.002113519,0.0020476708,0.0047089914,0.002854108,0.0032612279,0.004337161,0.0048324843,0.014988916],"category_scores_gemma":[0.022848187,0.0014203537,0.0014922183,0.0036315052,0.0016773095,0.003308631,0.0057854224,0.0017620719,0.0064004757],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002900043,0.0006984199,0.0065358276,0.0019182835,0.00041113477,0.0019738625,0.0023309526,0.2840731,0.05247993,0.20082612,0.025596073,0.4202563],"study_design_scores_gemma":[0.00047361496,0.0011463936,0.0018276653,0.0004632072,0.00022604171,0.002071725,0.0013631553,0.676959,0.08898517,0.1629898,0.06324039,0.0002539161],"about_ca_topic_score_codex":0.0012446388,"about_ca_topic_score_gemma":0.0012314891,"teacher_disagreement_score":0.014988916,"about_ca_system_score_codex":0.0010374661,"about_ca_system_score_gemma":0.0015273177,"threshold_uncertainty_score":0.050142944},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21481228,0.000529325,0.7704831,0.00059783965,0.000053910546,0.00013013293,0.0004803854,0.00092541793,0.011987769],"genre_scores_gemma":[0.55207074,0.00089985726,0.4400503,0.00021841773,0.00006093104,0.00017875168,0.0013737802,0.0003979179,0.0047493232],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99914134,0.00024301217,0.000039577804,0.00019115856,0.00016794559,0.0002169631],"domain_scores_gemma":[0.9969067,0.0018892152,0.00036170683,0.00058365916,0.00010681882,0.00015182463],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007544075,0.0008592563,0.00085430365,0.00063809525,0.00078448164,0.0015140106,0.0014275577,0.00086444843,0.004421862],"category_scores_gemma":[0.004465636,0.0005876099,0.0011031837,0.0013536279,0.0016016603,0.0046884087,0.0021883463,0.0015224614,0.00064853823],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044884553,0.00019531249,0.0029978063,0.0003580451,0.00004543443,0.00038759582,0.000526027,0.57491726,0.009560562,0.32030073,0.0052097193,0.08505263],"study_design_scores_gemma":[0.00006025124,0.0001016651,0.0003240572,0.000044565877,0.00002380365,0.00021372818,0.00023991833,0.69032764,0.004137867,0.29858476,0.0059219864,0.000019793197],"about_ca_topic_score_codex":0.0021507987,"about_ca_topic_score_gemma":0.0030577874,"teacher_disagreement_score":0.004421862,"about_ca_system_score_codex":0.00079254963,"about_ca_system_score_gemma":0.00060437754,"threshold_uncertainty_score":0.014792621},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018981751,0.00007549228,0.97464716,0.00009199689,0.00006261629,0.00007613039,0.00013435447,0.0012703722,0.004660046],"genre_scores_gemma":[0.15473539,0.00021400263,0.8375064,0.00009056431,0.000031405914,0.000114065966,0.00060511817,0.00066428556,0.0060387],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99947304,0.00005653299,0.000032621574,0.00012357518,0.00025208323,0.00006212772],"domain_scores_gemma":[0.99937135,0.00014840174,0.00006784744,0.00024281905,0.00013062966,0.00003898533],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035104365,0.0006230504,0.00054030196,0.0010978036,0.00050193607,0.00083612057,0.0008701215,0.0005934106,0.0067739813],"category_scores_gemma":[0.0023061924,0.000564481,0.00081897987,0.00084003486,0.00088490144,0.0014675221,0.0024100877,0.0012999325,0.0012036981],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019918496,0.000081141465,0.0012565955,0.000260164,0.000047667043,0.0003144471,0.0003881763,0.10476485,0.050730176,0.16924454,0.010250998,0.66246206],"study_design_scores_gemma":[0.00007907671,0.00021625453,0.0009921548,0.000066074965,0.00007124234,0.0010028358,0.00032089843,0.6218297,0.05572915,0.22754999,0.09205962,0.00008302467],"about_ca_topic_score_codex":0.0010218468,"about_ca_topic_score_gemma":0.0014551952,"teacher_disagreement_score":0.0067739813,"about_ca_system_score_codex":0.00040233604,"about_ca_system_score_gemma":0.00036659164,"threshold_uncertainty_score":0.02266121},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013604485,0.0004472016,0.97505504,0.0008574957,0.00016516252,0.00023024355,0.0017201077,0.005632168,0.002288193],"genre_scores_gemma":[0.1924306,0.00039002008,0.79447913,0.0005208132,0.00023442028,0.0011377776,0.005799183,0.0007907459,0.004217348],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965867,0.00042377732,0.00039960805,0.0006989636,0.0015586194,0.0003323311],"domain_scores_gemma":[0.99256355,0.0016732025,0.00064357097,0.003894929,0.00083315966,0.00039162263],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015681402,0.0009614959,0.0023709103,0.0019835653,0.0020677722,0.002752073,0.005893496,0.0019611462,0.007327477],"category_scores_gemma":[0.010949663,0.0012498731,0.0015969047,0.0047608563,0.0018606491,0.008079945,0.007836561,0.0028948258,0.003411871],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017987951,0.0008508137,0.003989939,0.0006661648,0.00017586423,0.00043604552,0.0006519273,0.19544786,0.028264185,0.20501238,0.06251624,0.50018984],"study_design_scores_gemma":[0.0003827981,0.0004453953,0.0005447753,0.000063739324,0.000060890186,0.00042957134,0.00015772808,0.8269182,0.014544475,0.11908743,0.037227243,0.00013771186],"about_ca_topic_score_codex":0.0029811547,"about_ca_topic_score_gemma":0.0038850745,"teacher_disagreement_score":0.007327477,"about_ca_system_score_codex":0.0019547634,"about_ca_system_score_gemma":0.0025789924,"threshold_uncertainty_score":0.024512827},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3217207,0.001711199,0.5047518,0.0016367367,0.0003119176,0.00029102282,0.0017903699,0.0013043224,0.16648196],"genre_scores_gemma":[0.69237435,0.003335756,0.2239421,0.00055592647,0.00026603273,0.00024505187,0.004240532,0.00091485353,0.074125424],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991586,0.00025838657,0.000034864628,0.0001416937,0.00025907226,0.00014728532],"domain_scores_gemma":[0.99801135,0.00091327453,0.0003319478,0.00028261114,0.0002903338,0.00017045203],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047988608,0.0010722373,0.0006852343,0.0020204536,0.0011505673,0.002369925,0.0014028884,0.0013253897,0.01980955],"category_scores_gemma":[0.0039646267,0.00089992466,0.0006637612,0.0026990834,0.0010038065,0.003056699,0.0017793357,0.0019900734,0.0028879645],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014826792,0.00007114978,0.0009702366,0.00024263158,0.000023139297,0.00031661938,0.00056323514,0.04311243,0.0044287764,0.8600787,0.016244112,0.073800735],"study_design_scores_gemma":[0.0000649479,0.00007810385,0.0011940256,0.00013496369,0.000044926866,0.0004907038,0.00045782814,0.12148717,0.0029552714,0.82879883,0.044255365,0.000037728267],"about_ca_topic_score_codex":0.0027018662,"about_ca_topic_score_gemma":0.0050498806,"teacher_disagreement_score":0.01980955,"about_ca_system_score_codex":0.0011467978,"about_ca_system_score_gemma":0.0004262562,"threshold_uncertainty_score":0.06626952},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012163906,0.00037815367,0.9806387,0.0005664618,0.000037836773,0.00012464204,0.00014877762,0.0013661034,0.004575365],"genre_scores_gemma":[0.12224796,0.00037323052,0.8711092,0.00022489272,0.00007340693,0.00031322875,0.0007715725,0.00041297096,0.0044735624],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989367,0.0003617472,0.00006311929,0.0002386606,0.00022313118,0.00017655759],"domain_scores_gemma":[0.99581784,0.0030750784,0.00029704598,0.00045273156,0.0002521403,0.00010521783],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015546564,0.0012951783,0.001243345,0.0015938112,0.0010550186,0.0018769322,0.002855551,0.0018257891,0.0105047375],"category_scores_gemma":[0.0072907545,0.0007601033,0.0013501201,0.002243517,0.0017219294,0.0035986567,0.0030384199,0.002284686,0.002124477],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025400548,0.00034526532,0.0011280167,0.0005678268,0.0000674456,0.0001531584,0.00045941063,0.33445403,0.0031317389,0.20870131,0.01610717,0.4346306],"study_design_scores_gemma":[0.00015360904,0.00007124115,0.00017420732,0.000044813507,0.00002307457,0.000119936885,0.00013215585,0.7481284,0.002044361,0.24346067,0.0056258338,0.000021589985],"about_ca_topic_score_codex":0.002365011,"about_ca_topic_score_gemma":0.0038403485,"teacher_disagreement_score":0.0105047375,"about_ca_system_score_codex":0.0014983233,"about_ca_system_score_gemma":0.001072245,"threshold_uncertainty_score":0.035141885},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38860258,0.0033340869,0.5245411,0.0044309846,0.0005896574,0.0001265301,0.00062493235,0.0014988917,0.07625126],"genre_scores_gemma":[0.8302906,0.0011691371,0.15371697,0.0009677685,0.00014592508,0.00019723845,0.0004668674,0.00073718757,0.012308392],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981325,0.0004951304,0.000097398275,0.00026200732,0.0006632045,0.00034964888],"domain_scores_gemma":[0.99089515,0.005975172,0.0006566624,0.0015311589,0.00050482294,0.00043703243],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018317238,0.0010259047,0.0012393355,0.0011572548,0.001441636,0.002491316,0.0024311661,0.0018134975,0.01300851],"category_scores_gemma":[0.013302917,0.00070966943,0.0012473114,0.001129082,0.003047241,0.005127651,0.0053425236,0.0048877937,0.0026959276],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007367209,0.00016202174,0.0022197096,0.0007263696,0.00009790119,0.00044725504,0.00074042095,0.097524315,0.014320613,0.80038947,0.016014345,0.06662084],"study_design_scores_gemma":[0.00012590674,0.00018300062,0.0010190905,0.00016589537,0.000049947488,0.00041201807,0.00026374526,0.31706798,0.012171055,0.6448135,0.023660025,0.00006785464],"about_ca_topic_score_codex":0.0017374529,"about_ca_topic_score_gemma":0.0014734862,"teacher_disagreement_score":0.01300851,"about_ca_system_score_codex":0.001376146,"about_ca_system_score_gemma":0.0006968985,"threshold_uncertainty_score":0.04351777},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0044813203,0.00047860842,0.97613925,0.0002700594,0.00007413352,0.0001832643,0.0022987516,0.013366916,0.0027076448],"genre_scores_gemma":[0.10210991,0.00052255817,0.8752448,0.00033179426,0.00010772841,0.0013650198,0.012829096,0.002317956,0.005171109],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99774545,0.0002827081,0.0003612367,0.00042756175,0.0009399405,0.00024306201],"domain_scores_gemma":[0.9951794,0.001265068,0.00039891707,0.002027161,0.0009174777,0.00021185447],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014330749,0.0011716484,0.0016517878,0.0030072238,0.0015017184,0.0029677956,0.0045117196,0.0014026681,0.015701417],"category_scores_gemma":[0.008138639,0.0012586297,0.0011794728,0.005676783,0.0011412014,0.0053732535,0.006025232,0.0022323732,0.008142778],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013037507,0.00034608063,0.0029455412,0.000814071,0.00010530611,0.00034436828,0.0006052187,0.04296111,0.024568874,0.09058597,0.076061696,0.75935805],"study_design_scores_gemma":[0.00066485576,0.0007102702,0.0015387201,0.0003013932,0.0001197338,0.0011004731,0.0005392167,0.5767998,0.05688352,0.12129051,0.23974079,0.0003107359],"about_ca_topic_score_codex":0.0034536088,"about_ca_topic_score_gemma":0.0039128214,"teacher_disagreement_score":0.015701417,"about_ca_system_score_codex":0.0014539466,"about_ca_system_score_gemma":0.0021242797,"threshold_uncertainty_score":0.052526474},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2928818,0.0012716133,0.6772076,0.00055887847,0.00005748426,0.000070658585,0.0002144944,0.00028432225,0.02745308],"genre_scores_gemma":[0.8443422,0.00068702316,0.15258801,0.000043049902,0.00006500546,0.000084988074,0.00011786222,0.00017136753,0.0019005642],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99888605,0.000454622,0.000060057395,0.0001769741,0.00029133528,0.0001310075],"domain_scores_gemma":[0.9973775,0.0016665575,0.00035409702,0.00022083933,0.00017998289,0.0002009745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012359198,0.0005677241,0.0006312937,0.0007065601,0.00033065327,0.0017180911,0.00085911015,0.0005975247,0.0011263593],"category_scores_gemma":[0.0077826935,0.0005118413,0.0003018323,0.000686969,0.0012915186,0.0018846195,0.0015695475,0.00049829,0.00026155714],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00049589487,0.000077892284,0.004686065,0.00041404515,0.000052158834,0.00035986764,0.00037195915,0.56431913,0.04616328,0.22359772,0.0032968717,0.15616506],"study_design_scores_gemma":[0.00005888901,0.00015095613,0.0019765252,0.000059874706,0.000025164032,0.0005937798,0.00025615154,0.7705624,0.026615018,0.19359538,0.0060688513,0.00003704744],"about_ca_topic_score_codex":0.00028145817,"about_ca_topic_score_gemma":0.00029879538,"teacher_disagreement_score":0.0017180911,"about_ca_system_score_codex":0.00060573674,"about_ca_system_score_gemma":0.00032525408,"threshold_uncertainty_score":0.0065362453},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0649896,0.0022931513,0.8721142,0.0070748236,0.0004643277,0.0004300969,0.00470865,0.0061544497,0.04177071],"genre_scores_gemma":[0.5830588,0.0012375818,0.36543214,0.0014964043,0.00051708013,0.0006840223,0.006846212,0.0018604546,0.03886729],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998264,0.0003407217,0.00009081844,0.00062102237,0.00036535872,0.00031811828],"domain_scores_gemma":[0.9926681,0.005506857,0.00030195437,0.00087406405,0.00041852865,0.00023050325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013817358,0.0017153143,0.003620089,0.0013000334,0.0014366151,0.004283784,0.003723643,0.005212893,0.025493547],"category_scores_gemma":[0.0110015115,0.001492511,0.0017898345,0.0022316393,0.0017793144,0.005977482,0.0041527916,0.0034059177,0.0041027046],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007532916,0.0004075945,0.0014471745,0.0013357896,0.00017479937,0.0003805301,0.00033481317,0.57383895,0.004476095,0.060823873,0.11380215,0.2422249],"study_design_scores_gemma":[0.0001336595,0.000057024732,0.00036246396,0.00006442857,0.000043378608,0.00022957135,0.00017751406,0.8410239,0.0018935339,0.15017809,0.0058131088,0.000023301282],"about_ca_topic_score_codex":0.0047693793,"about_ca_topic_score_gemma":0.0058457577,"teacher_disagreement_score":0.025493547,"about_ca_system_score_codex":0.0020995762,"about_ca_system_score_gemma":0.0019981766,"threshold_uncertainty_score":0.08528435},"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":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18839155,0.000934742,0.18976916,0.001891831,0.0016252431,0.00018861312,0.0017834089,0.0009652014,0.6144502],"genre_scores_gemma":[0.67542666,0.0016066082,0.083147116,0.001172047,0.00039085152,0.00018524352,0.0030300887,0.0008712518,0.23417026],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997813,0.000026923091,0.000009557183,0.00007232441,0.0000571542,0.000052710795],"domain_scores_gemma":[0.9997416,0.000050388324,0.000035474935,0.000039927785,0.00006280906,0.000069783215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014816545,0.0008529299,0.00052143395,0.0012042865,0.0013758118,0.0013216309,0.00073501613,0.00088205317,0.026302436],"category_scores_gemma":[0.00040725293,0.00049104926,0.0006247245,0.0009619138,0.0011076371,0.0017269055,0.0010788012,0.0019004398,0.006506374],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009506545,0.000058386984,0.00037547192,0.00013555987,0.000030784096,0.00044350073,0.00022142832,0.0018579765,0.0080584,0.9311637,0.013505651,0.044054095],"study_design_scores_gemma":[0.000025419728,0.000078482924,0.0010495773,0.00006327389,0.00003392762,0.0007943051,0.0004815086,0.0030564037,0.0045551443,0.89572567,0.09410966,0.000026558471],"about_ca_topic_score_codex":0.0007578463,"about_ca_topic_score_gemma":0.0010783575,"teacher_disagreement_score":0.026302436,"about_ca_system_score_codex":0.00039821383,"about_ca_system_score_gemma":0.00033176347,"threshold_uncertainty_score":0.0879904},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03439356,0.0014130042,0.83045894,0.000702912,0.0005071526,0.00007982834,0.00064033223,0.0006764508,0.13112773],"genre_scores_gemma":[0.53443635,0.003193306,0.3772042,0.0010454104,0.00070785935,0.00033578248,0.0027007307,0.0010658279,0.079310544],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99961877,0.00004770703,0.00002168364,0.0000743049,0.00017581771,0.000061680876],"domain_scores_gemma":[0.99928504,0.0002941036,0.000058030633,0.00012827241,0.00014618468,0.00008843823],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044699083,0.0005721901,0.00040890797,0.001520761,0.0008434324,0.0022376592,0.00068468176,0.0006260504,0.011667579],"category_scores_gemma":[0.0023147739,0.00042746394,0.0008021478,0.0010684925,0.0011727365,0.0027411154,0.002588936,0.002115806,0.0030323565],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029151599,0.000023151997,0.00022723703,0.00008159722,0.000010745424,0.00008711405,0.00013906255,0.0018983405,0.002205571,0.93524575,0.0121252,0.047927074],"study_design_scores_gemma":[0.000024834359,0.00002788668,0.00036054006,0.00007154843,0.0000252322,0.00053806807,0.00014713373,0.024236927,0.0027885006,0.9247082,0.047055915,0.000015126196],"about_ca_topic_score_codex":0.0008867896,"about_ca_topic_score_gemma":0.0011167837,"teacher_disagreement_score":0.011667579,"about_ca_system_score_codex":0.00058923825,"about_ca_system_score_gemma":0.00036377608,"threshold_uncertainty_score":0.039031923},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10096352,0.005027699,0.86030537,0.0055632237,0.00049409043,0.0001609079,0.0012704772,0.0021670552,0.024047678],"genre_scores_gemma":[0.5509722,0.0025751167,0.43529782,0.0016576601,0.0004647837,0.00023055477,0.0013960255,0.00043941423,0.0069663785],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978933,0.0004899255,0.00013071315,0.00047835073,0.00069119723,0.00031660547],"domain_scores_gemma":[0.9951748,0.0021937492,0.00026398528,0.0016119415,0.0005166674,0.00023890215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013706126,0.0007264193,0.001727032,0.0011684657,0.0014677437,0.0034287355,0.0026264188,0.002017171,0.0057693175],"category_scores_gemma":[0.010552227,0.0006700219,0.0012990568,0.003681035,0.0020769916,0.0126283495,0.004001804,0.0041948375,0.0022823568],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00090398657,0.00041690038,0.0040399223,0.0006416277,0.00010288507,0.00049039855,0.0008484579,0.1062477,0.009588521,0.5125658,0.04133203,0.32282177],"study_design_scores_gemma":[0.00013067856,0.00019214072,0.0009528093,0.00010852194,0.000041117477,0.00067926577,0.00048020663,0.45169336,0.0054440387,0.51165926,0.028535157,0.00008336909],"about_ca_topic_score_codex":0.0035445844,"about_ca_topic_score_gemma":0.0034075335,"teacher_disagreement_score":0.0057693175,"about_ca_system_score_codex":0.0013955575,"about_ca_system_score_gemma":0.0012360599,"threshold_uncertainty_score":0.019300282},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25982252,0.0013029448,0.7203312,0.0005988181,0.00011177387,0.00004413558,0.00014935901,0.00017966189,0.017459685],"genre_scores_gemma":[0.7503406,0.0005452846,0.24444851,0.000091625276,0.000057939746,0.00012450179,0.00013741458,0.00013371048,0.0041203625],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996644,0.00009048792,0.000024050563,0.00007756682,0.00009693791,0.00004655006],"domain_scores_gemma":[0.99741626,0.0017440584,0.0002511055,0.00024748067,0.00018149205,0.00015961539],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015390202,0.00033675964,0.0006023119,0.0012706339,0.00045773305,0.0011311166,0.0013348236,0.0010767038,0.0025583815],"category_scores_gemma":[0.007475276,0.00039786682,0.00057287025,0.000480411,0.0015774146,0.00289669,0.001206226,0.0012704761,0.00016963882],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001344517,0.00004000326,0.0020281735,0.0003276348,0.000032037082,0.00016084427,0.00023576042,0.19970022,0.006528662,0.7555664,0.0012827006,0.033963144],"study_design_scores_gemma":[0.000018141953,0.000049488975,0.0011296369,0.00009468094,0.000015889169,0.00018457223,0.00010108487,0.54771584,0.004459413,0.44322166,0.0029829952,0.000026492622],"about_ca_topic_score_codex":0.0004353304,"about_ca_topic_score_gemma":0.00068380724,"teacher_disagreement_score":0.0025583815,"about_ca_system_score_codex":0.00095473306,"about_ca_system_score_gemma":0.00045227536,"threshold_uncertainty_score":0.008558631},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029693697,0.004904925,0.93849605,0.0023305134,0.00034124617,0.000098660246,0.00026366342,0.00020444379,0.023666777],"genre_scores_gemma":[0.77799267,0.00861413,0.18591893,0.0013484961,0.0017622517,0.0005898811,0.0009028688,0.00039725454,0.022473488],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970393,0.0012348413,0.000111232206,0.00045105058,0.00070054893,0.00046305094],"domain_scores_gemma":[0.98405576,0.013200106,0.0009781829,0.00055673823,0.00075401535,0.0004550943],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031072677,0.0014162664,0.0019673551,0.0021262434,0.0020405068,0.0020178286,0.0032774208,0.0026686494,0.00433538],"category_scores_gemma":[0.016997384,0.0007747687,0.0011022068,0.0038543618,0.0030867131,0.0033692264,0.004027647,0.0023938299,0.0008287868],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028094347,0.00011207423,0.0017415795,0.00043885323,0.000124809,0.00064808584,0.00037221253,0.6068464,0.0015796878,0.33671772,0.010312112,0.04082541],"study_design_scores_gemma":[0.000055777742,0.00005835615,0.0005580581,0.000049716127,0.000035828514,0.0002956346,0.00014050164,0.64062434,0.00070793205,0.3509322,0.0065139774,0.000027647238],"about_ca_topic_score_codex":0.0038749382,"about_ca_topic_score_gemma":0.0018179294,"teacher_disagreement_score":0.00433538,"about_ca_system_score_codex":0.0023445738,"about_ca_system_score_gemma":0.0008920876,"threshold_uncertainty_score":0.017011166},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012914751,0.00010534206,0.9960024,0.00006493521,0.000045876935,0.000034669647,0.000041324718,0.00029893077,0.0021150003],"genre_scores_gemma":[0.036517132,0.00035706826,0.9529276,0.00009844582,0.00014557454,0.00021713517,0.00028812521,0.0004000329,0.009048948],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981026,0.0005073193,0.00009462984,0.00030772816,0.0008519009,0.00013582363],"domain_scores_gemma":[0.99741423,0.0013282541,0.00012898464,0.0005115014,0.0004793837,0.00013761097],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001237539,0.0017237155,0.0016780739,0.0012600134,0.0008184856,0.0019177446,0.0036235133,0.0015950963,0.015718708],"category_scores_gemma":[0.0063588684,0.0010074116,0.0014443885,0.001994801,0.001395408,0.0026316592,0.0042419014,0.0048207915,0.0061305338],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023360754,0.00028699794,0.0003049549,0.00035536918,0.00006576001,0.00009890443,0.00032086304,0.27526623,0.009002518,0.23431514,0.02170364,0.45804602],"study_design_scores_gemma":[0.000029462215,0.00009771458,0.0000895261,0.00002942243,0.000011877004,0.00008974228,0.000055800745,0.8717463,0.002670711,0.1157535,0.0093979,0.000028045986],"about_ca_topic_score_codex":0.0032877377,"about_ca_topic_score_gemma":0.003974472,"teacher_disagreement_score":0.015718708,"about_ca_system_score_codex":0.0010748197,"about_ca_system_score_gemma":0.0013304986,"threshold_uncertainty_score":0.05258429},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.107248366,0.0055419705,0.80232495,0.0020950362,0.00030111565,0.00010629077,0.00046321878,0.0002083789,0.081710674],"genre_scores_gemma":[0.7774121,0.004393341,0.19756722,0.00029134427,0.0006653264,0.00023783157,0.0008878142,0.00030594904,0.018239105],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99905354,0.00035125046,0.00004128451,0.00016581142,0.0002660608,0.00012197773],"domain_scores_gemma":[0.998811,0.00071954547,0.00016487813,0.00008599799,0.00011836854,0.00010015865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001120126,0.000979283,0.0011036557,0.0018566613,0.00093202223,0.002221193,0.001096459,0.0014365572,0.0047307326],"category_scores_gemma":[0.005756965,0.000636566,0.0009252103,0.0010973163,0.0021250066,0.0028378414,0.0023136628,0.0020460384,0.0005474433],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056036108,0.000024159119,0.00053050707,0.00016932562,0.000036710775,0.00016258685,0.00014515185,0.053771816,0.0011017456,0.91183496,0.0043651103,0.027801821],"study_design_scores_gemma":[0.000017050957,0.00003293294,0.00036826433,0.000060651848,0.000015721162,0.0002495559,0.00014566685,0.13842058,0.00093563064,0.85137403,0.008362935,0.000016950276],"about_ca_topic_score_codex":0.00045274486,"about_ca_topic_score_gemma":0.00047722997,"teacher_disagreement_score":0.0047307326,"about_ca_system_score_codex":0.0010075609,"about_ca_system_score_gemma":0.00027376474,"threshold_uncertainty_score":0.015825868},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30090758,0.0038951826,0.6213542,0.0019964627,0.00055005396,0.00009174886,0.00044150595,0.0005935936,0.07016959],"genre_scores_gemma":[0.8513742,0.0012048129,0.13313814,0.00045741146,0.00015831366,0.00012765497,0.0002831458,0.0003187528,0.01293759],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99932516,0.00011810329,0.000042694257,0.00016269539,0.00024052916,0.000110955916],"domain_scores_gemma":[0.9983103,0.0007443016,0.00022096746,0.00033809326,0.00021262436,0.00017357635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037601744,0.00035217512,0.00069412315,0.00065558235,0.00089877174,0.0018122499,0.000765036,0.00058897695,0.0047760247],"category_scores_gemma":[0.0054049282,0.00056029006,0.00048759187,0.00046453686,0.0020021296,0.0019793485,0.00180448,0.0021030148,0.0010311519],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040679856,0.00004907613,0.0015159064,0.00025369893,0.000018865361,0.00016261385,0.0002881895,0.016151333,0.010948652,0.8809804,0.0051222355,0.08410227],"study_design_scores_gemma":[0.00007800597,0.00012947277,0.0009980308,0.00013302636,0.00002742595,0.0004743986,0.00036589388,0.05805772,0.013826277,0.88209796,0.043762356,0.00004948224],"about_ca_topic_score_codex":0.00046723848,"about_ca_topic_score_gemma":0.0005025254,"teacher_disagreement_score":0.0047760247,"about_ca_system_score_codex":0.00032858487,"about_ca_system_score_gemma":0.00043691922,"threshold_uncertainty_score":0.015977442},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21203282,0.0003236855,0.66884226,0.0012302054,0.00031676033,0.00023207224,0.0016156255,0.0011090491,0.1142976],"genre_scores_gemma":[0.68237305,0.0006030227,0.26981372,0.00030935623,0.000091479196,0.00022820964,0.0027201977,0.001007595,0.042853326],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994388,0.00004994151,0.000024944562,0.00012810498,0.0002649129,0.000093315124],"domain_scores_gemma":[0.99915516,0.0002610846,0.00010055692,0.00017506875,0.00020089425,0.00010722271],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015485621,0.00061727915,0.0006102305,0.0007077631,0.000576197,0.0020930984,0.0011947094,0.0009659735,0.021403616],"category_scores_gemma":[0.002014485,0.000634056,0.00041452132,0.00089389813,0.0007526618,0.0024500801,0.0012016802,0.0022431177,0.0037726755],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00092193513,0.00042458222,0.002867549,0.0007966488,0.000090224756,0.0010619194,0.0007602039,0.087054804,0.09652234,0.39026254,0.027137643,0.39209968],"study_design_scores_gemma":[0.00019206866,0.00044804817,0.0056236545,0.000225423,0.000067897156,0.002159967,0.0013932117,0.37634474,0.05183045,0.4690146,0.09258885,0.00011111673],"about_ca_topic_score_codex":0.0011771029,"about_ca_topic_score_gemma":0.0018702425,"teacher_disagreement_score":0.021403616,"about_ca_system_score_codex":0.00058320205,"about_ca_system_score_gemma":0.0003482397,"threshold_uncertainty_score":0.071602225},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.67776096,0.0009946149,0.10839969,0.00035913364,0.00026734616,0.00010016741,0.0007746228,0.00038083855,0.21096265],"genre_scores_gemma":[0.8743384,0.0012516669,0.028280372,0.0001814761,0.00023674454,0.00012632723,0.0013041692,0.0003001509,0.0939807],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99976104,0.000037631235,0.000013228414,0.000058471513,0.00008447091,0.000045082477],"domain_scores_gemma":[0.9996119,0.0001320856,0.000060625985,0.00006181177,0.00005088038,0.00008272495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016176591,0.0005543433,0.00063617574,0.0010934393,0.0009437065,0.001368905,0.0007375108,0.00061845843,0.0111212535],"category_scores_gemma":[0.00074288045,0.0005637218,0.0005117184,0.0013313461,0.0008668817,0.0018751812,0.0013371457,0.001062979,0.0016682628],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000112071335,0.000049431055,0.00055732264,0.0002049679,0.00003346571,0.00034609422,0.0008496348,0.016367046,0.008948789,0.93161696,0.005712107,0.035202213],"study_design_scores_gemma":[0.000014917788,0.00005439741,0.00079287373,0.00002925927,0.00001597077,0.00030877333,0.00024699367,0.013858051,0.0018977483,0.9716329,0.011135151,0.0000129420005],"about_ca_topic_score_codex":0.00036198532,"about_ca_topic_score_gemma":0.00078936445,"teacher_disagreement_score":0.0111212535,"about_ca_system_score_codex":0.00026579658,"about_ca_system_score_gemma":0.00017371633,"threshold_uncertainty_score":0.037204266},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019254202,0.00011774163,0.96582586,0.00012912003,0.00011518571,0.000049083603,0.0002462881,0.0010557029,0.013206851],"genre_scores_gemma":[0.5296247,0.00034847215,0.44849268,0.0001580377,0.00006851303,0.00018525671,0.0010479514,0.0012110408,0.018863387],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997696,0.00004401295,0.0000141400305,0.00004061289,0.00009476412,0.000036798196],"domain_scores_gemma":[0.9995402,0.000095410345,0.00003971939,0.00018427325,0.000083511026,0.00005696804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026028394,0.0005352385,0.0007883133,0.00095561356,0.00055514864,0.0015582496,0.0016509915,0.0011727073,0.01205688],"category_scores_gemma":[0.001948647,0.00041282095,0.00064123154,0.001027063,0.0007885198,0.0016494651,0.0030413768,0.0017523309,0.0028560099],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021394066,0.00013567398,0.00060102885,0.00015557726,0.000025596726,0.00017626138,0.00021031332,0.34005627,0.0043226355,0.50835174,0.009879363,0.13587162],"study_design_scores_gemma":[0.000018201152,0.000028994767,0.0000630951,0.000020418021,0.000007054301,0.000046663783,0.00003917324,0.85856915,0.0010399917,0.13149385,0.008662003,0.000011298077],"about_ca_topic_score_codex":0.002008448,"about_ca_topic_score_gemma":0.0027678972,"teacher_disagreement_score":0.01205688,"about_ca_system_score_codex":0.00035100835,"about_ca_system_score_gemma":0.0005271967,"threshold_uncertainty_score":0.040334284},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14488924,0.0016122692,0.59899163,0.001220761,0.0004614273,0.00020294507,0.00059045036,0.0018150108,0.25021625],"genre_scores_gemma":[0.5617087,0.0022475244,0.30311403,0.00042561637,0.00022770805,0.0002042448,0.0012589705,0.0011305051,0.12968275],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99987376,0.00001828138,0.000004799896,0.000043283813,0.00004041014,0.000019454343],"domain_scores_gemma":[0.9998221,0.000046292687,0.000015026583,0.00004805637,0.000030420057,0.000038223694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015006617,0.0005320688,0.00044038982,0.00092435646,0.00096908695,0.0016489736,0.0007143013,0.0006641077,0.013658139],"category_scores_gemma":[0.0008651526,0.00052356307,0.00039501258,0.000724899,0.00072712376,0.0016634864,0.0010308214,0.0013689682,0.0019637248],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000088402514,0.000030503868,0.00033029684,0.00014939086,0.000014975141,0.00013068858,0.00043230492,0.009821139,0.008407791,0.8199745,0.014980863,0.14563909],"study_design_scores_gemma":[0.00003163194,0.000041244657,0.00045523394,0.000068820234,0.00002013521,0.000313118,0.00029258864,0.051356334,0.0044302624,0.84603703,0.096929945,0.000023590246],"about_ca_topic_score_codex":0.0016954584,"about_ca_topic_score_gemma":0.0032227046,"teacher_disagreement_score":0.013658139,"about_ca_system_score_codex":0.00066444796,"about_ca_system_score_gemma":0.00033734573,"threshold_uncertainty_score":0.045691013},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014305412,0.0018251631,0.9500133,0.0007585409,0.0004425106,0.000119522534,0.00029847128,0.00018806117,0.03204904],"genre_scores_gemma":[0.26395798,0.003310427,0.6814181,0.00084231724,0.0009964352,0.00043892558,0.0011456612,0.0007367133,0.047153383],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99902153,0.00034487524,0.000044623637,0.00024633823,0.0002800243,0.000062634725],"domain_scores_gemma":[0.9987143,0.000717708,0.00009732428,0.00018156593,0.00019613019,0.00009303998],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010965243,0.0012489995,0.0013555973,0.0012759629,0.0007670091,0.0013608147,0.0026577206,0.0021557421,0.012104336],"category_scores_gemma":[0.00490152,0.00052109186,0.0013622345,0.0024044137,0.0010258905,0.0026340755,0.0020696819,0.0025292833,0.0012584782],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023277047,0.00015042772,0.0005514089,0.00058151095,0.00008765514,0.00025275876,0.00022491401,0.23866938,0.0052519934,0.56404865,0.02550174,0.16444674],"study_design_scores_gemma":[0.000037427406,0.00010961956,0.0003806718,0.000047658566,0.00003498016,0.00021927166,0.000043070755,0.7604403,0.0017451633,0.20554318,0.03135573,0.0000428666],"about_ca_topic_score_codex":0.0021188557,"about_ca_topic_score_gemma":0.0018422508,"teacher_disagreement_score":0.012104336,"about_ca_system_score_codex":0.00081571063,"about_ca_system_score_gemma":0.0005512686,"threshold_uncertainty_score":0.04049301},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18448184,0.00069147506,0.7945373,0.0010244265,0.00016224361,0.00013857066,0.00056882657,0.00031991003,0.018075401],"genre_scores_gemma":[0.72541374,0.00058043853,0.2590516,0.00017032571,0.000080694146,0.00020122474,0.0009317182,0.00033211618,0.013238214],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99917465,0.000284,0.000040656905,0.00011828319,0.00024991977,0.00013257869],"domain_scores_gemma":[0.9962991,0.0025270362,0.0004063878,0.00026455056,0.00031239528,0.00019054678],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008739367,0.0006550964,0.0008780901,0.0008530307,0.0009531421,0.0014860259,0.0014588353,0.0016105988,0.004481323],"category_scores_gemma":[0.011195775,0.0006477149,0.0006605016,0.0014327528,0.0008715936,0.001883478,0.002496572,0.0019793448,0.00046863756],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036212231,0.00009743379,0.0017805428,0.0002353873,0.00007720956,0.0005076352,0.00023740987,0.6743915,0.0018032657,0.26045573,0.0071259825,0.052925743],"study_design_scores_gemma":[0.000050442926,0.00004533086,0.0003417934,0.000030410141,0.000017343975,0.00015121835,0.000103247716,0.731882,0.0007822908,0.26353517,0.0030477836,0.000012926467],"about_ca_topic_score_codex":0.0032043532,"about_ca_topic_score_gemma":0.0031142014,"teacher_disagreement_score":0.004481323,"about_ca_system_score_codex":0.0006777062,"about_ca_system_score_gemma":0.0010959556,"threshold_uncertainty_score":0.014991522},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15035245,0.00045629014,0.812034,0.0009485452,0.00011401277,0.0000917828,0.00040776623,0.0004121033,0.035183016],"genre_scores_gemma":[0.79035604,0.0010017201,0.18686019,0.00048930116,0.00020278215,0.00014177931,0.0008843592,0.0004423258,0.019621557],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99937576,0.00009702292,0.00002789957,0.000136933,0.00028117382,0.00008133099],"domain_scores_gemma":[0.99367344,0.0033313213,0.0007107249,0.00085753377,0.00096856925,0.00045843187],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006033013,0.00045336652,0.0006338179,0.00171673,0.0011510475,0.0024464908,0.0017830728,0.0012368296,0.010160393],"category_scores_gemma":[0.008183369,0.0005180207,0.00064499764,0.001670588,0.001661962,0.003569147,0.0016164513,0.0019574603,0.0010992708],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059884518,0.000070116876,0.0011672361,0.000108107364,0.000012989676,0.000118518336,0.00039810952,0.039133254,0.0022061402,0.9246536,0.0033651204,0.02870693],"study_design_scores_gemma":[0.00001388188,0.00003190858,0.00051499164,0.00002071278,0.000011989912,0.00026085993,0.0001998822,0.17458686,0.0015134506,0.81716293,0.005665603,0.000016827058],"about_ca_topic_score_codex":0.0022772017,"about_ca_topic_score_gemma":0.0035229714,"teacher_disagreement_score":0.010160393,"about_ca_system_score_codex":0.0012457555,"about_ca_system_score_gemma":0.0005622161,"threshold_uncertainty_score":0.033989906},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0061417203,0.0004442287,0.9755053,0.00018871168,0.00032268744,0.00008824341,0.00013747922,0.0005079755,0.016663654],"genre_scores_gemma":[0.19680308,0.00088959123,0.78256726,0.000572252,0.00033978434,0.00025685216,0.00034629504,0.0010523354,0.017172446],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99905795,0.00007355765,0.00006455349,0.00013630778,0.0005981164,0.00006949648],"domain_scores_gemma":[0.99863786,0.00039668055,0.00010593473,0.00022337055,0.0005540312,0.00008202826],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010328789,0.00093661743,0.0006612461,0.0025317566,0.0008023504,0.0015097039,0.0020372497,0.00096668705,0.011066226],"category_scores_gemma":[0.005477456,0.0003508991,0.00056203536,0.001016812,0.001422819,0.0033510334,0.0023637402,0.0015278806,0.0038483618],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000759677,0.000059341815,0.0013290226,0.000282949,0.000017583126,0.00056890154,0.00021393686,0.014993141,0.018144011,0.7662438,0.011890659,0.18618064],"study_design_scores_gemma":[0.000031879128,0.00012774121,0.0009140539,0.00015600113,0.00003756172,0.0021990591,0.00011593018,0.307222,0.01578714,0.61656445,0.056773227,0.00007093933],"about_ca_topic_score_codex":0.0004800901,"about_ca_topic_score_gemma":0.0007651989,"teacher_disagreement_score":0.011066226,"about_ca_system_score_codex":0.00081226905,"about_ca_system_score_gemma":0.00051436917,"threshold_uncertainty_score":0.037020206},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23808536,0.00072454015,0.6216379,0.0012335203,0.00039845475,0.00027391323,0.0013800497,0.0018793535,0.13438688],"genre_scores_gemma":[0.74900293,0.00090733595,0.19665977,0.0004784175,0.00012977276,0.00017331647,0.0029306628,0.0009335044,0.048784338],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99922943,0.00011653598,0.00003491498,0.0001927193,0.0002940404,0.00013244708],"domain_scores_gemma":[0.99791056,0.00081427343,0.000275585,0.00042960522,0.00032396743,0.00024601055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003955056,0.00090856885,0.00074253225,0.0014223543,0.0012076268,0.0027470512,0.0011041305,0.0014611927,0.014857598],"category_scores_gemma":[0.0037508744,0.0010084963,0.00069408317,0.0020865619,0.0009961032,0.0037755049,0.0017725849,0.0026013153,0.0024003033],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015659489,0.00010486017,0.001106298,0.0001927824,0.00002833476,0.00076404586,0.00050800265,0.018175602,0.008544215,0.9015184,0.012104524,0.056796305],"study_design_scores_gemma":[0.00005352943,0.00004826333,0.0008444003,0.000077068114,0.000043189713,0.0010019349,0.00040351838,0.04485242,0.006273244,0.9129594,0.033410266,0.000032745356],"about_ca_topic_score_codex":0.00075536675,"about_ca_topic_score_gemma":0.001286863,"teacher_disagreement_score":0.014857598,"about_ca_system_score_codex":0.0006243509,"about_ca_system_score_gemma":0.00033531847,"threshold_uncertainty_score":0.049703598},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8758067,0.0023030394,0.04927775,0.006231076,0.0002865039,0.000056659133,0.00049221877,0.00018895982,0.06535705],"genre_scores_gemma":[0.9887102,0.0006266579,0.0049965857,0.00026589094,0.00014860877,0.000025200769,0.00023414295,0.00003860385,0.0049540326],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99919885,0.00013430834,0.000035376845,0.0002667385,0.00014333759,0.00022144483],"domain_scores_gemma":[0.9963934,0.0021901426,0.00044625445,0.0002474715,0.000397794,0.0003249082],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010692807,0.00055721024,0.0007501803,0.0019507052,0.0015490118,0.002127797,0.0007555334,0.0011474901,0.0058673685],"category_scores_gemma":[0.007697726,0.00039173747,0.0006325012,0.001531291,0.004047672,0.004883503,0.0018821707,0.0020949785,0.00052895513],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006576884,0.00004007562,0.0052713463,0.00020101604,0.000029138984,0.0006249458,0.0011215742,0.0069256816,0.0084121,0.95332456,0.004099896,0.019291982],"study_design_scores_gemma":[0.00011523492,0.00014491074,0.0045898925,0.0001056156,0.000048953312,0.0006637361,0.0010469699,0.015576423,0.006456162,0.948197,0.02296849,0.00008660313],"about_ca_topic_score_codex":0.003295088,"about_ca_topic_score_gemma":0.0010561992,"teacher_disagreement_score":0.0058673685,"about_ca_system_score_codex":0.0015794247,"about_ca_system_score_gemma":0.0003729981,"threshold_uncertainty_score":0.019628286},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2454323,0.00042686024,0.7220297,0.00093179196,0.000053428786,0.00017215061,0.0017161878,0.0017328172,0.027504832],"genre_scores_gemma":[0.7545698,0.0005862961,0.22900902,0.00029265543,0.00006412499,0.0002511493,0.004116879,0.0004180885,0.010691996],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990552,0.0001289037,0.00004572219,0.00028736927,0.00025746206,0.00022531406],"domain_scores_gemma":[0.9975739,0.0006976994,0.00034362162,0.0008776904,0.00032570818,0.000181328],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032345284,0.0011124404,0.0006184605,0.0006359336,0.0008029386,0.0013129408,0.0014184336,0.0007475477,0.008565103],"category_scores_gemma":[0.0025107278,0.0007852157,0.0009049687,0.0013769305,0.0016572697,0.0046244278,0.003231569,0.001752773,0.0012714415],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00059376063,0.00025303118,0.0037628277,0.0007003866,0.00012413277,0.00080409925,0.001074733,0.26707077,0.07011119,0.4835453,0.013556728,0.15840304],"study_design_scores_gemma":[0.00010416881,0.00060414383,0.0035443886,0.00009650408,0.0001320449,0.0018675727,0.0012203512,0.40066293,0.062239274,0.46920252,0.060193725,0.00013245858],"about_ca_topic_score_codex":0.0017997468,"about_ca_topic_score_gemma":0.002607407,"teacher_disagreement_score":0.008565103,"about_ca_system_score_codex":0.0008679359,"about_ca_system_score_gemma":0.0005992174,"threshold_uncertainty_score":0.028653085},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054486137,0.00020391829,0.94026744,0.00015725504,0.00010013236,0.00008064752,0.00013350797,0.00048489776,0.0040861215],"genre_scores_gemma":[0.24454238,0.00024892783,0.74875826,0.000075186785,0.00007073701,0.0001577743,0.0003098917,0.0006864209,0.0051504425],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99948055,0.00009105094,0.000028659822,0.000114888724,0.0002144182,0.000070419665],"domain_scores_gemma":[0.99868065,0.00067081396,0.000108922846,0.00023868706,0.0001624282,0.00013854717],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080153346,0.00095364306,0.0012526995,0.00082371966,0.00047486578,0.0010237074,0.0017623856,0.0015709761,0.005308951],"category_scores_gemma":[0.004434944,0.00069830456,0.00070478034,0.00074400095,0.00075900956,0.0019463245,0.0021416824,0.0016224078,0.0008520823],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005485484,0.0002382673,0.0013965297,0.0005825547,0.00007097992,0.0003910066,0.00033494903,0.5783321,0.061462402,0.08716233,0.010753457,0.2587268],"study_design_scores_gemma":[0.00002998885,0.0002319197,0.00027201028,0.000042480267,0.000025235688,0.0002283888,0.000077025776,0.94146186,0.0077416725,0.04423075,0.0056445994,0.000014102053],"about_ca_topic_score_codex":0.00064859324,"about_ca_topic_score_gemma":0.0012778991,"teacher_disagreement_score":0.005308951,"about_ca_system_score_codex":0.000515485,"about_ca_system_score_gemma":0.00055693305,"threshold_uncertainty_score":0.017760217},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020348454,0.00075637375,0.967172,0.0003538196,0.00016374602,0.00010530638,0.00021669376,0.002030519,0.0088531235],"genre_scores_gemma":[0.18197408,0.0006865258,0.8074015,0.00019463169,0.0001323313,0.00023316499,0.00063668913,0.00050034106,0.0082407845],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99833703,0.00033605684,0.00009039095,0.00039713614,0.0006660268,0.00017334608],"domain_scores_gemma":[0.9982761,0.00047296885,0.00012856204,0.0005994639,0.0004495094,0.00007349567],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008771201,0.0009457862,0.0015936298,0.0016912668,0.0009282274,0.0011632135,0.0020514014,0.0010798846,0.007103],"category_scores_gemma":[0.004470837,0.00071166735,0.0009757785,0.0016377659,0.00090129004,0.002574905,0.0038281893,0.0017829395,0.002134371],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033004145,0.00007630852,0.0009842943,0.00032790587,0.00008307174,0.00022027601,0.00030821242,0.5620155,0.014506253,0.069987886,0.01337758,0.33778265],"study_design_scores_gemma":[0.000057009685,0.00010598094,0.00028091326,0.000046753375,0.00003273853,0.00014215804,0.00008004195,0.94253325,0.0046265526,0.035967987,0.016090062,0.0000364847],"about_ca_topic_score_codex":0.005817745,"about_ca_topic_score_gemma":0.0061686323,"teacher_disagreement_score":0.007103,"about_ca_system_score_codex":0.0011812651,"about_ca_system_score_gemma":0.0010335457,"threshold_uncertainty_score":0.023761868},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28646907,0.0012253553,0.674451,0.0066348687,0.0001909149,0.00042358055,0.00455624,0.007339579,0.018709376],"genre_scores_gemma":[0.5160179,0.0006175612,0.4610818,0.00094297103,0.00015261715,0.00043101728,0.010146193,0.0010928229,0.009517007],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987263,0.00028330437,0.0001153281,0.00038765423,0.00028777428,0.00019960536],"domain_scores_gemma":[0.9936603,0.0042988425,0.00058970775,0.00092240225,0.00033758997,0.0001913037],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000688383,0.0010480194,0.0011788398,0.000570902,0.0009530331,0.0029773263,0.001560112,0.0016304882,0.006328166],"category_scores_gemma":[0.004993456,0.0007279071,0.001605115,0.001450097,0.0013060769,0.006754926,0.0027447322,0.0019274811,0.0015961599],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018374381,0.00081445364,0.007964037,0.0028487963,0.0002582508,0.0014260516,0.0015745605,0.17034519,0.04328958,0.10400314,0.07499931,0.5906392],"study_design_scores_gemma":[0.00025846798,0.0005516137,0.003431727,0.00017015968,0.00017922738,0.0020279859,0.0012990924,0.48323357,0.03470635,0.42865932,0.045338046,0.00014440948],"about_ca_topic_score_codex":0.0014539189,"about_ca_topic_score_gemma":0.002524675,"teacher_disagreement_score":0.006328166,"about_ca_system_score_codex":0.0009889218,"about_ca_system_score_gemma":0.0011711451,"threshold_uncertainty_score":0.021169841},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03657845,0.00017080209,0.9476591,0.00012314435,0.0001704802,0.00008803851,0.00016102842,0.0010637266,0.013985297],"genre_scores_gemma":[0.47183493,0.00015699385,0.5189551,0.00005564156,0.000037500933,0.00013372638,0.00031847227,0.0003723869,0.008135225],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997904,0.000034645265,0.00001238266,0.00002475695,0.00010941932,0.000028417408],"domain_scores_gemma":[0.99966717,0.00007902528,0.000029923815,0.000059970265,0.0001363459,0.000027547925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030927075,0.00049671374,0.0006220304,0.00044622135,0.00043880666,0.000805654,0.0013334398,0.001060988,0.007821215],"category_scores_gemma":[0.00086973776,0.0002736267,0.00047461104,0.0005298945,0.0003597166,0.0005032713,0.00078107906,0.0007204682,0.0011362311],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024056138,0.00020205531,0.003623938,0.00034380602,0.00007805394,0.00045117474,0.00034646736,0.7065286,0.031531148,0.054452363,0.0055010878,0.19670075],"study_design_scores_gemma":[0.000014297335,0.000026976486,0.00018592113,0.0000061692604,0.000004058951,0.000046084588,0.000025045649,0.9936982,0.0022205634,0.0011903726,0.0025735574,0.000008781434],"about_ca_topic_score_codex":0.0045619523,"about_ca_topic_score_gemma":0.004432614,"teacher_disagreement_score":0.007821215,"about_ca_system_score_codex":0.00039693675,"about_ca_system_score_gemma":0.0008755736,"threshold_uncertainty_score":0.026164532},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.066762395,0.0006030611,0.8968622,0.0005880764,0.00021256488,0.00010233406,0.00044282386,0.002420889,0.032005712],"genre_scores_gemma":[0.3925736,0.0016159124,0.5871161,0.0002348754,0.00024139536,0.00016706504,0.0019046856,0.0010569585,0.015089406],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994025,0.00009516649,0.000041539013,0.00016231835,0.00019231622,0.00010608108],"domain_scores_gemma":[0.9990409,0.00026258937,0.00009949247,0.00025822088,0.0002019317,0.00013686466],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003419482,0.0006666817,0.0005122913,0.0012317231,0.0010642856,0.0023869413,0.00091791456,0.0005474109,0.006861838],"category_scores_gemma":[0.002326539,0.00042376353,0.0009705501,0.0025132238,0.0011865862,0.0025377076,0.0013359918,0.0016560922,0.0018991767],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011070705,0.00007252671,0.0010270096,0.00018112693,0.000015628546,0.00026325567,0.00056645344,0.060052432,0.007783619,0.7613983,0.009655563,0.15887333],"study_design_scores_gemma":[0.000053334326,0.00012356261,0.0008730253,0.00004955779,0.00003704274,0.0003655872,0.00037191,0.2610933,0.008721989,0.67905134,0.049194325,0.00006513137],"about_ca_topic_score_codex":0.0074793454,"about_ca_topic_score_gemma":0.011428694,"teacher_disagreement_score":0.0074793454,"about_ca_system_score_codex":0.0016541233,"about_ca_system_score_gemma":0.0010870224,"threshold_uncertainty_score":0.02295512},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12826507,0.0006366466,0.78840655,0.00035327554,0.00024555167,0.000190491,0.0008466622,0.0011762899,0.07987952],"genre_scores_gemma":[0.47800928,0.0014563242,0.42922193,0.00013452768,0.00006399771,0.00020561006,0.0018765959,0.0013804581,0.08765125],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99987364,0.000023514107,0.000005157321,0.000025790934,0.00004722424,0.00002473527],"domain_scores_gemma":[0.9998035,0.00007886934,0.000017024076,0.00003411783,0.00003409896,0.000032461616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001234865,0.00045462785,0.000546565,0.000451853,0.00053566694,0.00096571684,0.00086406176,0.0004841999,0.0090423515],"category_scores_gemma":[0.0009004561,0.0004424156,0.000471811,0.0006141894,0.0007212806,0.0008041783,0.0015667725,0.0010991001,0.0015326899],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002245545,0.00006250848,0.0007500928,0.0005333126,0.000034969307,0.00061186234,0.00077404646,0.4887765,0.012328352,0.3238417,0.022835389,0.14922677],"study_design_scores_gemma":[0.000028277625,0.000063883665,0.00031803775,0.00010047646,0.000010422328,0.0002802772,0.0003637039,0.81167763,0.004275017,0.13652223,0.046334725,0.000025349591],"about_ca_topic_score_codex":0.002793274,"about_ca_topic_score_gemma":0.004055576,"teacher_disagreement_score":0.0090423515,"about_ca_system_score_codex":0.00051293534,"about_ca_system_score_gemma":0.0003653719,"threshold_uncertainty_score":0.030249655},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11603807,0.001228007,0.864337,0.00043683714,0.00016420997,0.00024728986,0.0010718206,0.0012640109,0.015212758],"genre_scores_gemma":[0.6199139,0.0008013551,0.36666733,0.0001408725,0.00014866448,0.00035931286,0.0022065942,0.00043722472,0.009324798],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969181,0.0005019384,0.00013199788,0.00050079654,0.0014926519,0.00045445192],"domain_scores_gemma":[0.99176943,0.0038072264,0.0008924272,0.0019437677,0.0011460817,0.00044103438],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011538002,0.0006600325,0.0011607729,0.0015277396,0.0010200192,0.0025567026,0.0035691268,0.0010708327,0.006181892],"category_scores_gemma":[0.01458876,0.0005827014,0.00091951434,0.0025754734,0.0013575081,0.0057066404,0.0029264244,0.0017764092,0.0011399628],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045735046,0.00015350172,0.0047281906,0.00030145262,0.00008766393,0.00026719933,0.00044643847,0.34952095,0.010284978,0.44912973,0.0088908,0.17573178],"study_design_scores_gemma":[0.00007187728,0.00016155648,0.0009825054,0.000025933283,0.000044787117,0.0004358565,0.00012008147,0.7558221,0.007326614,0.21125127,0.023719026,0.000038433973],"about_ca_topic_score_codex":0.0027316785,"about_ca_topic_score_gemma":0.0031167027,"teacher_disagreement_score":0.006181892,"about_ca_system_score_codex":0.0017980703,"about_ca_system_score_gemma":0.0011480259,"threshold_uncertainty_score":0.020680487},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045297217,0.00022666158,0.91023713,0.0007804354,0.0006353991,0.00013970556,0.0041591935,0.0181092,0.020415202],"genre_scores_gemma":[0.426474,0.00025017792,0.5138638,0.00041948934,0.00011457831,0.00027102706,0.011737671,0.007850565,0.039018665],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99935836,0.00007003215,0.000035998208,0.00015519468,0.00027605507,0.00010445255],"domain_scores_gemma":[0.9982772,0.0006229178,0.0000786516,0.00028263708,0.00066279154,0.000075849355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010423259,0.0011961175,0.00070059655,0.0011271633,0.0006936107,0.0016089771,0.0017533922,0.0022655483,0.051330496],"category_scores_gemma":[0.0071741575,0.00052611186,0.0010339525,0.0011766539,0.0004453033,0.0012549171,0.0010896081,0.0019346642,0.01076405],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007216877,0.00046245335,0.006287404,0.00080217695,0.00014591016,0.00044742838,0.0006016078,0.5444207,0.030988775,0.024106288,0.10883243,0.28218305],"study_design_scores_gemma":[0.000016961243,0.000041001786,0.00084157445,0.000030349815,0.0000082160595,0.00007595182,0.000100954894,0.97604305,0.010096886,0.0023291893,0.010388332,0.000027615382],"about_ca_topic_score_codex":0.015270863,"about_ca_topic_score_gemma":0.019317776,"teacher_disagreement_score":0.051330496,"about_ca_system_score_codex":0.0011505203,"about_ca_system_score_gemma":0.002331503,"threshold_uncertainty_score":0.17171758},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02790173,0.00048404362,0.9631396,0.00084258086,0.00006458804,0.000087250875,0.0004254911,0.0021266118,0.0049281046],"genre_scores_gemma":[0.2119935,0.0006970393,0.77977544,0.00022211802,0.00010192529,0.0004982066,0.001501544,0.0007417164,0.0044684983],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981273,0.0003632825,0.00019329831,0.00024378822,0.00085854053,0.00021376715],"domain_scores_gemma":[0.991355,0.0035702866,0.00076781097,0.0032630533,0.0008832285,0.00016056602],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012554515,0.0008776928,0.0009970218,0.0012558606,0.0009985551,0.00285043,0.0025210956,0.0018820005,0.0074818237],"category_scores_gemma":[0.015260419,0.00071871886,0.00093799137,0.0035460924,0.0014822036,0.007323246,0.0039127306,0.0021705083,0.0027622012],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006845148,0.00020972115,0.0016380078,0.000941753,0.000052144962,0.00021775566,0.0009871495,0.20459259,0.02034439,0.3444336,0.017261878,0.4086365],"study_design_scores_gemma":[0.00018511555,0.00025889,0.00025556888,0.00015419515,0.00004199503,0.0003350527,0.00058423885,0.6347905,0.025273712,0.3151156,0.022948097,0.000056996632],"about_ca_topic_score_codex":0.0011482434,"about_ca_topic_score_gemma":0.0017429796,"teacher_disagreement_score":0.0074818237,"about_ca_system_score_codex":0.0012800669,"about_ca_system_score_gemma":0.0014098785,"threshold_uncertainty_score":0.025029182},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011226317,0.0002055705,0.9820629,0.00016533057,0.000040995892,0.000085822205,0.00022584177,0.0029298388,0.0030574917],"genre_scores_gemma":[0.15477233,0.0002836886,0.8366748,0.00016533393,0.000057034707,0.0003451326,0.0013300623,0.0010988001,0.0052728974],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99881124,0.00012585675,0.000080866586,0.00034016278,0.00046746834,0.00017448637],"domain_scores_gemma":[0.9979346,0.0005015425,0.00018269947,0.00097238226,0.00030113145,0.00010770812],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007607003,0.0009816721,0.0008692316,0.0011468852,0.00081134547,0.0014136833,0.0031895298,0.00096086855,0.007484586],"category_scores_gemma":[0.0041876687,0.00088567706,0.0009068858,0.0015624127,0.0011047586,0.0040158546,0.0051265834,0.0016577874,0.0022070159],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047390079,0.00021165736,0.0010950395,0.00028032422,0.00008694448,0.00010182022,0.0002872604,0.11972621,0.034116976,0.0534879,0.0146530345,0.77547896],"study_design_scores_gemma":[0.0003006938,0.00027381393,0.00069314474,0.00006616049,0.00009782923,0.00045079965,0.00015779964,0.80289555,0.032220338,0.13329513,0.029450417,0.0000982421],"about_ca_topic_score_codex":0.0023254117,"about_ca_topic_score_gemma":0.0031298806,"teacher_disagreement_score":0.007484586,"about_ca_system_score_codex":0.0006315341,"about_ca_system_score_gemma":0.0011631165,"threshold_uncertainty_score":0.025038421},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052117385,0.0011271002,0.9175522,0.00075113325,0.00016486052,0.00012003217,0.0007327693,0.00058729626,0.026847264],"genre_scores_gemma":[0.53619003,0.0007977494,0.43881586,0.00013755383,0.00015135108,0.00024672193,0.0017174587,0.00046760714,0.021475725],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994543,0.00016063999,0.000029483264,0.000121648,0.00016919023,0.000064737025],"domain_scores_gemma":[0.9986443,0.0009125939,0.000081675964,0.00014227271,0.00012126816,0.00009784771],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005292088,0.0007806434,0.0016003135,0.0006341258,0.0005349959,0.0010659315,0.0017687272,0.0018536435,0.009511625],"category_scores_gemma":[0.0046986863,0.0005062693,0.0005225841,0.0006604745,0.0006472258,0.0018446188,0.0022790702,0.0014717382,0.0017436036],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009084704,0.00028975256,0.0011502705,0.0010136281,0.00009311848,0.0009059605,0.000515544,0.50298184,0.011675226,0.19923384,0.039309103,0.24192329],"study_design_scores_gemma":[0.00009162442,0.0001378053,0.00039163927,0.000057465244,0.000028537735,0.00034485463,0.00011303838,0.8884501,0.004385606,0.08965585,0.016321916,0.000021563344],"about_ca_topic_score_codex":0.001416618,"about_ca_topic_score_gemma":0.001273907,"teacher_disagreement_score":0.009511625,"about_ca_system_score_codex":0.00030290612,"about_ca_system_score_gemma":0.0005095646,"threshold_uncertainty_score":0.031819522},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04091479,0.016285451,0.87446356,0.0037354692,0.001057435,0.00010114595,0.0011319474,0.0005933206,0.061716914],"genre_scores_gemma":[0.75910133,0.012788113,0.19369628,0.0011227046,0.0021122382,0.00014040963,0.001231616,0.0011585453,0.028648784],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984125,0.0004944925,0.00007944701,0.00032484648,0.0004918305,0.00019681675],"domain_scores_gemma":[0.990489,0.0052263234,0.0009172645,0.00083484995,0.0018255643,0.00070705713],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021661052,0.0015287618,0.0011425784,0.0030547816,0.0009461625,0.0028723641,0.0023514882,0.0016814837,0.009996147],"category_scores_gemma":[0.029615603,0.0011887262,0.0010172413,0.0019713081,0.003810872,0.008188413,0.0059087826,0.0047946414,0.0021068368],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003447798,0.000046781843,0.0033523883,0.0002951354,0.00006256778,0.0001167366,0.0003264369,0.043319076,0.0022103272,0.7992696,0.01714908,0.13350715],"study_design_scores_gemma":[0.000044498298,0.000091992246,0.003531802,0.00021525449,0.00006456188,0.00042021074,0.00037587227,0.24458088,0.0024833633,0.71973324,0.028351808,0.00010648313],"about_ca_topic_score_codex":0.00720961,"about_ca_topic_score_gemma":0.0056872093,"teacher_disagreement_score":0.009996147,"about_ca_system_score_codex":0.001460502,"about_ca_system_score_gemma":0.0010648698,"threshold_uncertainty_score":0.03344041},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09235077,0.00062769745,0.89628565,0.000733796,0.00007300779,0.00010201763,0.0004612422,0.00079635443,0.008569422],"genre_scores_gemma":[0.72822964,0.00095931644,0.26297927,0.00018619274,0.000099629004,0.0001701631,0.0012589297,0.00032596017,0.005790908],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990941,0.00020756922,0.000040934203,0.00029651506,0.00016039706,0.00020037532],"domain_scores_gemma":[0.9982168,0.0009129169,0.00022706254,0.00043875983,0.00011459059,0.00008985668],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005040769,0.00065677206,0.0009048652,0.000575473,0.0008957812,0.0016321609,0.0012766466,0.0008905097,0.003353286],"category_scores_gemma":[0.0041984245,0.00047831915,0.0006971386,0.0010201752,0.0009843882,0.0033474187,0.0020285107,0.0011072541,0.0004707037],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003788674,0.00007698418,0.0014331597,0.00035196228,0.000094413066,0.00032851248,0.00036804494,0.6569765,0.013859511,0.18568039,0.0075878915,0.13286377],"study_design_scores_gemma":[0.00004944816,0.00011889688,0.0005555242,0.000028919318,0.00004216654,0.00021309995,0.00015437683,0.7754328,0.0054984367,0.20749381,0.010388392,0.000024138304],"about_ca_topic_score_codex":0.003587725,"about_ca_topic_score_gemma":0.0035772265,"teacher_disagreement_score":0.003587725,"about_ca_system_score_codex":0.0010523871,"about_ca_system_score_gemma":0.0009262375,"threshold_uncertainty_score":0.011217892},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3912882,0.00025677553,0.5844516,0.00023702758,0.000107620894,0.0001327194,0.0003438506,0.0006366186,0.022545688],"genre_scores_gemma":[0.677891,0.00039700477,0.3011047,0.00016242507,0.000057305482,0.00016640933,0.0008980583,0.00047772581,0.018845327],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99960417,0.00007777829,0.000021363792,0.000077159995,0.00014710291,0.00007248752],"domain_scores_gemma":[0.9991437,0.0003553198,0.00010617626,0.00018731011,0.000098401724,0.00010912685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035777228,0.00075440673,0.0008484405,0.0011524996,0.00048880413,0.0010466699,0.0009885827,0.000914087,0.0070741735],"category_scores_gemma":[0.002430937,0.00063004467,0.0005524476,0.0009747443,0.00083597365,0.0016229346,0.003100615,0.0015168996,0.0015241904],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00058201735,0.00035700607,0.0036525934,0.00038694756,0.000113708134,0.00059958216,0.00076298614,0.14840414,0.053800408,0.55888975,0.010197291,0.22225358],"study_design_scores_gemma":[0.00011692331,0.00035847246,0.0010540966,0.000080820195,0.000057808746,0.00039117053,0.00045168618,0.35154969,0.028464705,0.6018904,0.015545935,0.00003834976],"about_ca_topic_score_codex":0.00041154787,"about_ca_topic_score_gemma":0.00087703444,"teacher_disagreement_score":0.0070741735,"about_ca_system_score_codex":0.00032512884,"about_ca_system_score_gemma":0.00025560329,"threshold_uncertainty_score":0.023665488},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06937518,0.0003839933,0.9159344,0.00029652563,0.00006500424,0.00007663507,0.0007944724,0.0012017548,0.0118720755],"genre_scores_gemma":[0.28177223,0.0003782445,0.70858836,0.000119835066,0.000042219992,0.00014998652,0.002309866,0.00051051204,0.0061287247],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993304,0.00011986828,0.00005010496,0.00017067892,0.00021783188,0.00011103811],"domain_scores_gemma":[0.99875665,0.00052409887,0.00016030372,0.00026532708,0.0002244878,0.00006929151],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000653015,0.00086693995,0.00107717,0.0013075342,0.0008266797,0.0012513328,0.0012845001,0.0011695096,0.008166149],"category_scores_gemma":[0.0037907967,0.0008176164,0.0011102516,0.001471973,0.00091564556,0.003139545,0.002105038,0.0014837232,0.00206386],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004686871,0.000116079136,0.0055259536,0.0007322133,0.00012728316,0.0003292028,0.0006965705,0.3558238,0.029326035,0.17644602,0.016042802,0.41436535],"study_design_scores_gemma":[0.00007239231,0.0001672191,0.0013622078,0.00009387148,0.000030640436,0.00021356993,0.0005418346,0.6835168,0.017496808,0.2735905,0.022867301,0.000046858433],"about_ca_topic_score_codex":0.0013118908,"about_ca_topic_score_gemma":0.0036034728,"teacher_disagreement_score":0.008166149,"about_ca_system_score_codex":0.0009545607,"about_ca_system_score_gemma":0.00072370697,"threshold_uncertainty_score":0.027318537},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.67216414,0.0008380543,0.24611162,0.0017227504,0.00021388991,0.000099890785,0.0009485493,0.0006456742,0.07725546],"genre_scores_gemma":[0.9221982,0.00082191394,0.046681102,0.0003066129,0.0001773905,0.00009492909,0.0011317161,0.0007976009,0.027790485],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996625,0.00006596139,0.000015606509,0.00008056494,0.00010989775,0.00006548222],"domain_scores_gemma":[0.99815506,0.00083236035,0.00025795086,0.00023309006,0.00022900937,0.00029248898],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035357778,0.00067536574,0.0005593051,0.0018519873,0.0009367642,0.0020761853,0.0011924516,0.0007701144,0.008515368],"category_scores_gemma":[0.0040128976,0.0007310675,0.00072588515,0.000886488,0.002052621,0.0021378838,0.0021752673,0.0021996275,0.0006935202],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010891228,0.0000401166,0.0014995298,0.00012057583,0.000016637632,0.00022743603,0.00044028595,0.01689933,0.005453587,0.9423975,0.005321276,0.027474942],"study_design_scores_gemma":[0.000024237732,0.00003955903,0.001986499,0.000031490938,0.000025692745,0.0003697553,0.00029758253,0.05926586,0.0025385222,0.9272632,0.008137076,0.000020498563],"about_ca_topic_score_codex":0.0015844784,"about_ca_topic_score_gemma":0.0020521288,"teacher_disagreement_score":0.008515368,"about_ca_system_score_codex":0.0009846836,"about_ca_system_score_gemma":0.0004029413,"threshold_uncertainty_score":0.028486729},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.57357496,0.00062419544,0.39031717,0.006390198,0.0001124396,0.00022714204,0.0024913684,0.0016474276,0.024615262],"genre_scores_gemma":[0.8651272,0.00060795643,0.12583667,0.0004322767,0.00006921524,0.00019262722,0.0020749469,0.00038834472,0.0052708383],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977609,0.0005260816,0.00015403872,0.00079367956,0.00045142265,0.00031395737],"domain_scores_gemma":[0.9916796,0.0060666413,0.0006187041,0.0010735468,0.00027070017,0.00029077256],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000987022,0.000756709,0.0010524231,0.0004942152,0.0011651997,0.0035761287,0.0027060811,0.0015614012,0.009003323],"category_scores_gemma":[0.009660025,0.0007041828,0.0016664411,0.0017394645,0.0019596051,0.009556555,0.0028918202,0.0026041018,0.00072586816],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012176142,0.00025293152,0.005895502,0.0014357213,0.00021278068,0.0006719679,0.0018712393,0.53548014,0.014750992,0.29470327,0.01292599,0.13058193],"study_design_scores_gemma":[0.00015538215,0.00012831914,0.0013895729,0.00007635471,0.00016937157,0.0004883114,0.0005566598,0.53591824,0.008350002,0.4436476,0.009062415,0.000057794023],"about_ca_topic_score_codex":0.0033057607,"about_ca_topic_score_gemma":0.0030662855,"teacher_disagreement_score":0.009003323,"about_ca_system_score_codex":0.0020527286,"about_ca_system_score_gemma":0.0010520307,"threshold_uncertainty_score":0.030119061},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007124652,0.0011309496,0.9780291,0.0008150482,0.00026563075,0.00027949165,0.00034473516,0.0034419445,0.008568445],"genre_scores_gemma":[0.05674362,0.00053035346,0.93410003,0.0005794001,0.0002871909,0.00078438444,0.0013633842,0.0010321323,0.004579476],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99605715,0.0008489357,0.00025478928,0.0012371104,0.0009921732,0.0006097906],"domain_scores_gemma":[0.99294394,0.004117893,0.00046298603,0.0012892104,0.0009951625,0.00019091838],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030220698,0.0044847257,0.0028574008,0.0024231097,0.0015719801,0.0029394273,0.0044309855,0.002962064,0.027716069],"category_scores_gemma":[0.01189776,0.0015494765,0.0037797021,0.0041517112,0.0013461385,0.007470639,0.004090338,0.0063712425,0.0081346715],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00079137005,0.00087232003,0.001930448,0.0016766825,0.0003964584,0.00036625937,0.00055976654,0.33223,0.006492047,0.114206985,0.049541533,0.49093613],"study_design_scores_gemma":[0.00040446737,0.00013664158,0.0004695718,0.000096846554,0.00008322882,0.00021407478,0.00014332634,0.8236116,0.0021037823,0.15597732,0.016710417,0.000048698526],"about_ca_topic_score_codex":0.004992135,"about_ca_topic_score_gemma":0.0077504492,"teacher_disagreement_score":0.027716069,"about_ca_system_score_codex":0.0025434096,"about_ca_system_score_gemma":0.0027290261,"threshold_uncertainty_score":0.092719495},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06703552,0.00023251605,0.91424763,0.00022490024,0.00046598853,0.00017251498,0.000176362,0.008708969,0.008735658],"genre_scores_gemma":[0.35635483,0.000104882376,0.6331371,0.000180929,0.00009053695,0.00017641313,0.0005917706,0.0017936435,0.0075698174],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993549,0.00008910324,0.000039494855,0.00012757524,0.00027385465,0.00011504214],"domain_scores_gemma":[0.9984547,0.0003055116,0.00008035288,0.0006647891,0.00039253914,0.00010210857],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007843665,0.0009314252,0.0013150558,0.00093056605,0.0008603586,0.00092598464,0.0024110808,0.0008313274,0.012489294],"category_scores_gemma":[0.0030790942,0.00052187126,0.0010000422,0.0012004355,0.0006342285,0.0012250306,0.00220067,0.0013575067,0.001935041],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015251667,0.0008211356,0.003931986,0.00044220503,0.00021092388,0.00027270886,0.0004487483,0.20118459,0.07280394,0.027551373,0.022338929,0.6684683],"study_design_scores_gemma":[0.00019876169,0.00016907405,0.00052037166,0.000011738805,0.000057140936,0.000120412806,0.000069573645,0.95638156,0.022947002,0.013403581,0.006100953,0.00001980645],"about_ca_topic_score_codex":0.0026684096,"about_ca_topic_score_gemma":0.0059477785,"teacher_disagreement_score":0.012489294,"about_ca_system_score_codex":0.00053715246,"about_ca_system_score_gemma":0.0013309029,"threshold_uncertainty_score":0.04178083},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004524946,0.0007559244,0.928141,0.00065775856,0.00027940716,0.00025561766,0.0019937188,0.004266946,0.059124786],"genre_scores_gemma":[0.110142395,0.0026504437,0.8398417,0.0007296722,0.0001806634,0.00043220515,0.008543005,0.0016384278,0.035841495],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989188,0.00020862141,0.0000601816,0.00027274105,0.0004126318,0.00012709621],"domain_scores_gemma":[0.99837863,0.00052396744,0.00012549502,0.00055525295,0.00029361664,0.00012305305],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005308834,0.0014071327,0.00079846435,0.0017603063,0.0010514411,0.002868375,0.0024639936,0.0016724534,0.045757793],"category_scores_gemma":[0.004356769,0.00097217056,0.0017893022,0.002387273,0.0009830071,0.004245893,0.0027095515,0.0022716194,0.012601218],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011869556,0.00010681302,0.0008055196,0.0007325014,0.00009686578,0.00062423,0.00039798283,0.055579368,0.010214466,0.4988317,0.100049876,0.33244196],"study_design_scores_gemma":[0.000055794764,0.00007062617,0.00046095593,0.00022222643,0.0000825687,0.0011290826,0.00021466505,0.17800085,0.008560156,0.42936742,0.38176736,0.00006827622],"about_ca_topic_score_codex":0.0021727425,"about_ca_topic_score_gemma":0.0044744504,"teacher_disagreement_score":0.045757793,"about_ca_system_score_codex":0.0012468077,"about_ca_system_score_gemma":0.0010238478,"threshold_uncertainty_score":0.1530751},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023494413,0.0002993617,0.9645281,0.000083670595,0.0000805277,0.00015621516,0.00046738546,0.0018264664,0.009063797],"genre_scores_gemma":[0.19306372,0.0009322403,0.7840768,0.00019940425,0.00006644245,0.0002561598,0.0027954022,0.0013140447,0.017295828],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996202,0.000052556145,0.000020514382,0.00009671146,0.00013015662,0.00007992652],"domain_scores_gemma":[0.99947673,0.000153072,0.00002709354,0.00014944084,0.00015068965,0.00004302969],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032978467,0.00043583056,0.00073472026,0.0008966753,0.00031389136,0.0010027727,0.0008248668,0.0003380318,0.017051341],"category_scores_gemma":[0.0012640619,0.00049772416,0.00043243458,0.0015766277,0.00044133788,0.0012669088,0.0016744178,0.00069026876,0.003776188],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048395095,0.00016280563,0.0015146881,0.00033523422,0.00004817912,0.000102031285,0.00021182667,0.04192605,0.044650193,0.05833237,0.019840281,0.83239245],"study_design_scores_gemma":[0.00019097119,0.00034914273,0.0034674832,0.00015976888,0.00009638573,0.00060730294,0.0008065193,0.65581787,0.07694518,0.15441912,0.107050635,0.00008963615],"about_ca_topic_score_codex":0.0021111327,"about_ca_topic_score_gemma":0.002694688,"teacher_disagreement_score":0.017051341,"about_ca_system_score_codex":0.0003382107,"about_ca_system_score_gemma":0.0006054542,"threshold_uncertainty_score":0.05704242},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.087417595,0.00070942857,0.8974089,0.0011195642,0.00019962338,0.00025978283,0.00074858096,0.003015471,0.009121079],"genre_scores_gemma":[0.38714722,0.000448879,0.6013782,0.00025860767,0.00011867733,0.00031122562,0.0017314372,0.0009522668,0.0076534925],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992372,0.00016307499,0.00003835985,0.00020895756,0.00020581021,0.00014666024],"domain_scores_gemma":[0.9961941,0.002040543,0.00027174092,0.0007193798,0.00045899954,0.0003152794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013018883,0.0017812736,0.0015834671,0.0019727845,0.0015580471,0.0025831515,0.0046217395,0.0020428852,0.010685266],"category_scores_gemma":[0.008580446,0.000917873,0.0013310785,0.0022960727,0.001477834,0.004169191,0.0045079775,0.0027145413,0.0026097526],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011529252,0.00041889475,0.004034312,0.0008229175,0.00014743308,0.0002537525,0.00057582295,0.5099508,0.005340564,0.18217438,0.036638398,0.25848976],"study_design_scores_gemma":[0.00008746391,0.00003578837,0.00018003015,0.000027731354,0.000025560334,0.00006334949,0.00014370991,0.8703889,0.001961313,0.1250819,0.0019930361,0.000011205527],"about_ca_topic_score_codex":0.0060366257,"about_ca_topic_score_gemma":0.010990135,"teacher_disagreement_score":0.010685266,"about_ca_system_score_codex":0.0026178306,"about_ca_system_score_gemma":0.0019818395,"threshold_uncertainty_score":0.0357458},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.380538,0.0015738744,0.5197671,0.0017326525,0.0004651352,0.00006283732,0.00033791127,0.0005066419,0.095015846],"genre_scores_gemma":[0.9186968,0.0009081775,0.054973193,0.0003143943,0.0003684837,0.00007458011,0.00028512802,0.00030640836,0.02407271],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988018,0.00034448487,0.00006214774,0.0003024395,0.0003484847,0.00014057019],"domain_scores_gemma":[0.99578047,0.002036729,0.0006613931,0.00047691178,0.00044565552,0.0005988532],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014835006,0.00081703655,0.00073573797,0.0032360982,0.0014100329,0.004446963,0.001457426,0.0012131163,0.009849832],"category_scores_gemma":[0.006257825,0.0008174867,0.00089612824,0.0019996292,0.004282627,0.0071119606,0.0032503973,0.0024697692,0.00091684336],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017449991,0.0000087261815,0.00024745177,0.000024953208,0.0000049597434,0.00003632721,0.00009245195,0.0012396653,0.0004808325,0.99256504,0.0006812274,0.0046009393],"study_design_scores_gemma":[0.0000061490286,0.000015920417,0.00020892029,0.000013640149,0.000008049537,0.00013398775,0.00005927203,0.0072614206,0.00063011947,0.98895943,0.0026921425,0.000010900979],"about_ca_topic_score_codex":0.0004717946,"about_ca_topic_score_gemma":0.0005599177,"teacher_disagreement_score":0.009849832,"about_ca_system_score_codex":0.000991531,"about_ca_system_score_gemma":0.00047598223,"threshold_uncertainty_score":0.032950997},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15313739,0.0005706693,0.81852305,0.00042256116,0.00029654393,0.000112864516,0.00029844366,0.0021683509,0.024470123],"genre_scores_gemma":[0.72724134,0.00044951795,0.2580888,0.000105667554,0.00007888393,0.000065108085,0.0003684012,0.0015304211,0.012071844],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996718,0.0000542748,0.00001898762,0.000039612332,0.00017893211,0.000036508292],"domain_scores_gemma":[0.99893147,0.00050955627,0.00006496501,0.00029490428,0.0001297592,0.000069223715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004890903,0.0007420736,0.0007303175,0.0008574018,0.00061806804,0.0020796866,0.0011783324,0.00082830683,0.007867151],"category_scores_gemma":[0.0030171962,0.00060054753,0.00074868795,0.00061416137,0.0009697455,0.0011782477,0.002600694,0.0014917878,0.00071490224],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010386364,0.00018703133,0.004352399,0.0008349595,0.00020586264,0.0018827645,0.0021414915,0.40565345,0.16661853,0.1237677,0.013832202,0.2794851],"study_design_scores_gemma":[0.00006860093,0.00007308271,0.0006734593,0.000052906144,0.000042251395,0.0005287923,0.0003003793,0.9365484,0.02669004,0.021520797,0.013463614,0.00003772704],"about_ca_topic_score_codex":0.0011401528,"about_ca_topic_score_gemma":0.002456552,"teacher_disagreement_score":0.007867151,"about_ca_system_score_codex":0.00033343036,"about_ca_system_score_gemma":0.00035539255,"threshold_uncertainty_score":0.026318252},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42437702,0.00086206925,0.3587541,0.0009542792,0.00048667102,0.0002107024,0.0015110256,0.0009283643,0.21191569],"genre_scores_gemma":[0.8904752,0.00036407216,0.05657534,0.0002845007,0.00010872727,0.00011352978,0.0016696192,0.00023244931,0.050176628],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99963224,0.00008043806,0.000026032136,0.00008260593,0.0001173907,0.00006133375],"domain_scores_gemma":[0.9991974,0.00025352204,0.00013670113,0.0001629704,0.000116829804,0.00013252712],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023976387,0.0004953959,0.00036730475,0.0011359352,0.0008482893,0.0015340494,0.0010303908,0.0006729894,0.012732798],"category_scores_gemma":[0.0015487847,0.00030519816,0.00049749936,0.00064984127,0.00096287695,0.0017669466,0.0013448059,0.0008915773,0.0019053983],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004259157,0.000024640804,0.000425213,0.00005041972,0.000010100373,0.00014550815,0.0001897138,0.003712801,0.002592252,0.9740528,0.0035377422,0.015216156],"study_design_scores_gemma":[0.000022570008,0.000026994867,0.00038718714,0.00002584022,0.000010359006,0.00021185918,0.00018862149,0.016545834,0.0027528934,0.96277463,0.017037885,0.000015401409],"about_ca_topic_score_codex":0.0010974858,"about_ca_topic_score_gemma":0.0022386166,"teacher_disagreement_score":0.012732798,"about_ca_system_score_codex":0.00068287406,"about_ca_system_score_gemma":0.00036218952,"threshold_uncertainty_score":0.042595446},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5347243,0.00029712863,0.44630358,0.00036986405,0.00004716832,0.00014521109,0.00057908276,0.0007042012,0.01682949],"genre_scores_gemma":[0.8403393,0.00022987457,0.15343378,0.000102429876,0.000017200095,0.0001260849,0.0014024792,0.00024347576,0.0041053016],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997547,0.000040383835,0.000010237182,0.00007313063,0.00007730699,0.000044117864],"domain_scores_gemma":[0.9987218,0.00046982509,0.00019979851,0.00029577655,0.00020253267,0.00011030408],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026096156,0.00032714297,0.0002471445,0.0007828656,0.0005756875,0.00066862046,0.00076294545,0.00048038058,0.0030294561],"category_scores_gemma":[0.0024912828,0.0003276624,0.00040004763,0.0007049788,0.0007606728,0.00095637684,0.00078838796,0.0007560458,0.00039827687],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030077426,0.00020304743,0.009178864,0.00041674668,0.00006966702,0.0009179333,0.0010070839,0.25583348,0.10748902,0.4792206,0.009468037,0.13589473],"study_design_scores_gemma":[0.00007944686,0.0002018264,0.0031888688,0.00007494339,0.000053077078,0.0009621458,0.0004619553,0.5144599,0.07718784,0.37882152,0.024468707,0.000039761617],"about_ca_topic_score_codex":0.00097100553,"about_ca_topic_score_gemma":0.0010263763,"teacher_disagreement_score":0.0030294561,"about_ca_system_score_codex":0.00069468573,"about_ca_system_score_gemma":0.00044338917,"threshold_uncertainty_score":0.010134578},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2723093,0.0012000263,0.7111302,0.0008388655,0.00016772076,0.00029648934,0.0005033834,0.0016269038,0.011927044],"genre_scores_gemma":[0.5452566,0.00073389674,0.44641787,0.0001703453,0.000070275346,0.00023771757,0.0009686772,0.00029917725,0.005845432],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99937063,0.00013216093,0.000044951943,0.00017927936,0.00012671608,0.00014630235],"domain_scores_gemma":[0.9983442,0.0008516553,0.0002611353,0.00033739096,0.00010899981,0.00009667749],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005004062,0.00061257416,0.0011633798,0.0006886074,0.0009055807,0.0008650512,0.0014297945,0.00087273924,0.0033093668],"category_scores_gemma":[0.0041840393,0.0004973054,0.00047093077,0.0013184771,0.00078912725,0.0017565466,0.001699884,0.0006270022,0.00072271],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012383636,0.00018689354,0.0026360173,0.00054224295,0.00006326873,0.00077102234,0.0004193847,0.5925596,0.029154008,0.052323382,0.009653647,0.3104522],"study_design_scores_gemma":[0.00022515454,0.00031802215,0.00075081654,0.000053413292,0.00004488316,0.00053897634,0.00024590272,0.90406865,0.01935318,0.056075677,0.018292684,0.000032580934],"about_ca_topic_score_codex":0.0017691803,"about_ca_topic_score_gemma":0.0020658644,"teacher_disagreement_score":0.0033093668,"about_ca_system_score_codex":0.0007596966,"about_ca_system_score_gemma":0.00072425435,"threshold_uncertainty_score":0.011070967},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24011055,0.0013722989,0.56700516,0.0023051505,0.0005951574,0.00014135835,0.0016511225,0.0011774927,0.18564165],"genre_scores_gemma":[0.7070479,0.0016120902,0.11197051,0.0005079173,0.00038495063,0.00017229082,0.0031288043,0.0011055416,0.17407005],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994117,0.0001272197,0.00003741579,0.00018594539,0.0001563986,0.00008127049],"domain_scores_gemma":[0.9978415,0.0008354791,0.00023605177,0.0005457745,0.00029984227,0.00024135684],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042679821,0.0006984437,0.0006401345,0.0016178718,0.0011335799,0.0021183498,0.0009942936,0.0009667709,0.028453901],"category_scores_gemma":[0.0050661936,0.0005901316,0.0005389631,0.0015250804,0.0014161249,0.0056228456,0.0038394912,0.0020007493,0.004504694],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000087342596,0.000035152287,0.00032952442,0.0000801821,0.00000977928,0.00008462394,0.0003062549,0.0047080494,0.0012271419,0.9504108,0.007642396,0.035078764],"study_design_scores_gemma":[0.000018341407,0.000027815635,0.0002111676,0.000033964432,0.000012814505,0.00009839039,0.00024147281,0.020167137,0.0007089889,0.957469,0.020999566,0.000011327985],"about_ca_topic_score_codex":0.0008531461,"about_ca_topic_score_gemma":0.0009947153,"teacher_disagreement_score":0.028453901,"about_ca_system_score_codex":0.00057992863,"about_ca_system_score_gemma":0.00027221092,"threshold_uncertainty_score":0.09518784},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3789588,0.0016590629,0.52924186,0.002452812,0.00018600975,0.00015047706,0.00065153965,0.000364572,0.08633486],"genre_scores_gemma":[0.8952252,0.0009604591,0.08841645,0.00025544452,0.00022342443,0.00013002226,0.0007275099,0.00018782295,0.01387358],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99893695,0.00031411558,0.000036997797,0.00027796792,0.0002776762,0.00015620598],"domain_scores_gemma":[0.99573106,0.0026084257,0.00046382888,0.0004682489,0.00028209054,0.0004462956],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009675191,0.00051807356,0.0009846541,0.0017959046,0.0019327225,0.0037529331,0.0018567647,0.0012823762,0.0064668804],"category_scores_gemma":[0.0063445857,0.00100674,0.00090163614,0.0021831868,0.003929813,0.0047321115,0.0027443902,0.0029712599,0.0004857794],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006992656,0.00003688886,0.00083701307,0.00007632368,0.000014654775,0.00016136967,0.0005895217,0.00998543,0.000799788,0.969245,0.0021734345,0.01601065],"study_design_scores_gemma":[0.000019293411,0.000015170458,0.0005923548,0.000031563537,0.000022144995,0.00014406334,0.0003505124,0.0427049,0.0007549877,0.94918793,0.0061637256,0.0000134362945],"about_ca_topic_score_codex":0.0017807828,"about_ca_topic_score_gemma":0.0021180573,"teacher_disagreement_score":0.0064668804,"about_ca_system_score_codex":0.00088548847,"about_ca_system_score_gemma":0.0006408946,"threshold_uncertainty_score":0.021633923},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23016736,0.00031867353,0.74959534,0.0005657569,0.00007257334,0.0014334101,0.00015291668,0.00071292673,0.016981045],"genre_scores_gemma":[0.8445503,0.0002474962,0.15276179,0.000040918174,0.000014268933,0.00030034993,0.000098071236,0.000034128574,0.0019526975],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988513,0.0004911634,0.000057137917,0.00017020806,0.00020611209,0.00022406373],"domain_scores_gemma":[0.99854773,0.0005940002,0.00035344975,0.000084527695,0.00029276707,0.00012753895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019279722,0.00060697953,0.00052265957,0.0010575267,0.0007069248,0.0011172019,0.0011305667,0.0007210294,0.0030489608],"category_scores_gemma":[0.0044659707,0.0003568917,0.00041080997,0.0007147803,0.0005023298,0.0007933143,0.001035439,0.0006646997,0.00028124705],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001666762,0.0003440731,0.006238115,0.00018187524,0.000026270343,0.00014225795,0.00045561226,0.863599,0.0040728333,0.017669393,0.0014554092,0.105648465],"study_design_scores_gemma":[0.00004665697,0.00028409113,0.0026784362,0.000029355435,0.000025777632,0.000029724333,0.0006059437,0.9895894,0.0017052947,0.0027867309,0.0021987935,0.000019695171],"about_ca_topic_score_codex":0.016041486,"about_ca_topic_score_gemma":0.015012498,"teacher_disagreement_score":0.016041486,"about_ca_system_score_codex":0.0020105813,"about_ca_system_score_gemma":0.003096981,"threshold_uncertainty_score":0.031896234},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13240954,0.0005303798,0.8385325,0.00031896666,0.00010341653,0.000111778565,0.00035897834,0.0011414653,0.02649295],"genre_scores_gemma":[0.50448346,0.0011820623,0.48223934,0.00017400619,0.00012539471,0.00016821998,0.001087759,0.00043909997,0.010100636],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993026,0.00018964187,0.00005075261,0.00019778397,0.00017978663,0.000079480924],"domain_scores_gemma":[0.9986505,0.00038502962,0.00021769178,0.00043088547,0.0002190007,0.00009688467],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030029783,0.000616229,0.00030408174,0.0011154759,0.0005532246,0.0014862962,0.0006997952,0.0006197084,0.0041685672],"category_scores_gemma":[0.0027176389,0.00055395084,0.0006332902,0.0017105166,0.0010733185,0.0026721545,0.0014389347,0.0012149024,0.0009433787],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010337941,0.00006414874,0.0017280077,0.00018778958,0.000016005251,0.00069456943,0.0008605283,0.052452706,0.01316047,0.77207446,0.006630646,0.15202723],"study_design_scores_gemma":[0.000032687585,0.000104249826,0.0010869828,0.00008001363,0.00002586351,0.001027834,0.00035626418,0.14447261,0.010146491,0.7594246,0.0831923,0.000050043374],"about_ca_topic_score_codex":0.0009029631,"about_ca_topic_score_gemma":0.0011769976,"teacher_disagreement_score":0.0041685672,"about_ca_system_score_codex":0.00058672315,"about_ca_system_score_gemma":0.00026881148,"threshold_uncertainty_score":0.0139452815},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09848199,0.0018543665,0.8861956,0.0010187895,0.000118720825,0.00015701666,0.0015751175,0.004218126,0.0063802605],"genre_scores_gemma":[0.4929958,0.0009274324,0.49547198,0.0002890609,0.00016163496,0.00025966714,0.0036732384,0.00055354804,0.0056677074],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974068,0.0005760009,0.00019848968,0.0007243383,0.0008230143,0.0002714],"domain_scores_gemma":[0.99505264,0.0022461084,0.00054071506,0.0015779507,0.0003622405,0.00022043951],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010128138,0.0014851565,0.0017697504,0.0014768174,0.0007239373,0.0023162796,0.0042976732,0.0017298803,0.0062966654],"category_scores_gemma":[0.01156676,0.00069862005,0.00091609673,0.0035768661,0.0010219943,0.009055033,0.0035233013,0.0021584507,0.0020344083],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002612932,0.0004334786,0.004025789,0.0012932062,0.00019989147,0.00034616067,0.000594379,0.39255655,0.018751033,0.15003897,0.020670092,0.40847746],"study_design_scores_gemma":[0.00013553648,0.00019340822,0.00077986566,0.000038390943,0.00004438435,0.00035051175,0.00016844222,0.8146656,0.008130988,0.16868377,0.006768909,0.00004008652],"about_ca_topic_score_codex":0.003047047,"about_ca_topic_score_gemma":0.0036215943,"teacher_disagreement_score":0.0062966654,"about_ca_system_score_codex":0.0017055643,"about_ca_system_score_gemma":0.00089871476,"threshold_uncertainty_score":0.02106446},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8818331,0.00036138255,0.092248045,0.0042906133,0.00008649854,0.00012383233,0.0011099818,0.00093744346,0.019009179],"genre_scores_gemma":[0.98387766,0.0001666716,0.011930844,0.00026277595,0.00008190187,0.000094406394,0.0011082373,0.000108854845,0.0023686371],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971219,0.0005444559,0.00020227535,0.00070367043,0.0008207099,0.0006069884],"domain_scores_gemma":[0.9749713,0.019059105,0.0018614642,0.0017897243,0.0008552187,0.0014632469],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001308969,0.00078960444,0.0013507406,0.0011272781,0.0022540123,0.0032086235,0.0024925012,0.002389577,0.0067575085],"category_scores_gemma":[0.014191613,0.0011755157,0.002149832,0.00094516505,0.004905962,0.006260898,0.004867295,0.004006623,0.0004342561],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018700863,0.0008889185,0.01994791,0.0013513048,0.00025587156,0.0024375306,0.0032163667,0.107461594,0.023984268,0.78050655,0.012736145,0.045343447],"study_design_scores_gemma":[0.00018869738,0.00016905642,0.003560879,0.000065915665,0.00008414886,0.0009130437,0.0006339103,0.07745346,0.007153325,0.90506583,0.0046233903,0.00008824513],"about_ca_topic_score_codex":0.0019223528,"about_ca_topic_score_gemma":0.0014144395,"teacher_disagreement_score":0.0067575085,"about_ca_system_score_codex":0.0020072334,"about_ca_system_score_gemma":0.0010519685,"threshold_uncertainty_score":0.022606075},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06407038,0.0007556387,0.9289115,0.00013387784,0.00006565619,0.00015012978,0.0000799961,0.0006975136,0.0051352982],"genre_scores_gemma":[0.21716072,0.00031429098,0.78083783,0.000030944033,0.000019647703,0.00018874722,0.0001269699,0.00021904189,0.00110178],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99692106,0.0011181528,0.00013642859,0.00012622563,0.0016081289,0.00008997913],"domain_scores_gemma":[0.9945509,0.0030020876,0.00019547525,0.0004893086,0.0016856671,0.000076531105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028364528,0.000904205,0.000870978,0.0011949167,0.00039369887,0.00075182994,0.000977838,0.0010308302,0.0022486718],"category_scores_gemma":[0.009781659,0.00056740653,0.00058707024,0.0009199437,0.00050176267,0.0010405341,0.0012562949,0.0005313164,0.000434593],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004154879,0.00019058578,0.0039381096,0.00059511524,0.00021141097,0.00018044848,0.0004217601,0.6418756,0.05368321,0.012355851,0.0014832442,0.28464922],"study_design_scores_gemma":[0.000016974274,0.00012273045,0.00045035276,0.000021926075,0.000024081497,0.00009798343,0.000038818685,0.9863448,0.010132169,0.0008046603,0.0019260164,0.000019513063],"about_ca_topic_score_codex":0.0016874102,"about_ca_topic_score_gemma":0.0035109678,"teacher_disagreement_score":0.0028364528,"about_ca_system_score_codex":0.00048925984,"about_ca_system_score_gemma":0.0007324789,"threshold_uncertainty_score":0.015000761},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009404642,0.0003739251,0.9853895,0.00017969924,0.000056155106,0.00003440749,0.000121105346,0.00022376241,0.004216725],"genre_scores_gemma":[0.43764746,0.0015791107,0.54930943,0.0002583707,0.00019893507,0.00009925595,0.0009474118,0.0002893681,0.009670717],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990109,0.00020261102,0.000041039882,0.00026921634,0.0003575107,0.00011857257],"domain_scores_gemma":[0.9986504,0.0006011456,0.00014342541,0.00037624055,0.00014729523,0.00008150722],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004815983,0.0009572789,0.0014565096,0.0013148823,0.00047943543,0.0021141525,0.001358564,0.0017486938,0.0043318477],"category_scores_gemma":[0.0053154007,0.00078348804,0.0012441268,0.0015722698,0.0012407949,0.002869559,0.0036565063,0.0019175219,0.001092535],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006020291,0.000103578255,0.0018844844,0.00061679556,0.00016657238,0.00048959325,0.000531972,0.3590464,0.026852382,0.18568139,0.011408165,0.4126166],"study_design_scores_gemma":[0.00002709424,0.0000962487,0.00042703445,0.000055781937,0.0000315676,0.00058029895,0.000112294045,0.906372,0.0069744946,0.077929184,0.007353563,0.000040333704],"about_ca_topic_score_codex":0.0021042258,"about_ca_topic_score_gemma":0.0015431724,"teacher_disagreement_score":0.0043318477,"about_ca_system_score_codex":0.000570388,"about_ca_system_score_gemma":0.00076435023,"threshold_uncertainty_score":0.0144914985},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10559607,0.0019224613,0.85876685,0.0019386291,0.00033676243,0.00026911127,0.0032278222,0.010079373,0.017862907],"genre_scores_gemma":[0.4107703,0.001015547,0.5650789,0.0010163205,0.0003059131,0.0005591006,0.006160426,0.0014170783,0.0136763295],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9948237,0.0006817986,0.0005383892,0.0012736049,0.0017618187,0.0009206586],"domain_scores_gemma":[0.9927287,0.0023315942,0.0006201637,0.003375478,0.00065413135,0.00029002747],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015835788,0.0016151476,0.0025789803,0.0015880716,0.0022424008,0.004609124,0.004775544,0.0027918865,0.015286817],"category_scores_gemma":[0.009832321,0.0010440587,0.002081339,0.0074256943,0.0026359693,0.016771976,0.008674092,0.0031451255,0.0063524847],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0029948135,0.0006648518,0.0062687085,0.0011951559,0.00018061948,0.0005403016,0.0016501897,0.1657731,0.03398629,0.36082637,0.05492721,0.37099245],"study_design_scores_gemma":[0.0003103914,0.0005503365,0.0013486055,0.000113995884,0.00011095373,0.0007251834,0.0009573183,0.6072046,0.034675617,0.30952534,0.044292923,0.00018463399],"about_ca_topic_score_codex":0.0072355545,"about_ca_topic_score_gemma":0.008044671,"teacher_disagreement_score":0.015286817,"about_ca_system_score_codex":0.002738481,"about_ca_system_score_gemma":0.0025581585,"threshold_uncertainty_score":0.051139474},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55013055,0.00046639258,0.40176818,0.0014369527,0.0001282902,0.00015059196,0.0002666415,0.0004300317,0.045222364],"genre_scores_gemma":[0.91486174,0.0004579434,0.066307254,0.00022231105,0.00008192902,0.00010286967,0.0004415697,0.00015270401,0.01737167],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991001,0.0001296741,0.00005272725,0.0002553781,0.00028738385,0.00017472418],"domain_scores_gemma":[0.9974492,0.0013641653,0.00027089645,0.0005334066,0.00016970513,0.00021265887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010419332,0.0005163525,0.00054787885,0.0006901858,0.001376522,0.0018807781,0.0015332256,0.0016223622,0.008122016],"category_scores_gemma":[0.0066808034,0.0004434372,0.0008100303,0.0009892334,0.003705297,0.006770498,0.0037644356,0.0025637103,0.0008161021],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018731173,0.000058253918,0.0013485056,0.00010561204,0.000012387406,0.0003489771,0.0007357172,0.02028882,0.004274038,0.936939,0.0020116027,0.033689775],"study_design_scores_gemma":[0.00007622409,0.00012435249,0.000561314,0.0000402352,0.000015730284,0.00039502716,0.00068762247,0.057146594,0.0103928605,0.9161646,0.014365432,0.000029982933],"about_ca_topic_score_codex":0.001006262,"about_ca_topic_score_gemma":0.0006774689,"teacher_disagreement_score":0.008122016,"about_ca_system_score_codex":0.0011372268,"about_ca_system_score_gemma":0.0005329316,"threshold_uncertainty_score":0.027170897},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22638308,0.001568299,0.752061,0.0020746805,0.00013276239,0.00020408361,0.0044107926,0.0052091647,0.007956022],"genre_scores_gemma":[0.7047396,0.0007423693,0.27848044,0.00040411716,0.0002276027,0.0003739912,0.009085347,0.00046705137,0.0054795784],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962296,0.000653379,0.0005241068,0.00084574823,0.0013364559,0.0004108132],"domain_scores_gemma":[0.98934877,0.004843266,0.0010427051,0.0035646094,0.00074185437,0.00045878324],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020024127,0.00076103746,0.0017847015,0.0013858369,0.0007137423,0.0026482707,0.0024022919,0.0017770395,0.006580429],"category_scores_gemma":[0.019212017,0.0005200583,0.00081626466,0.0031512429,0.0013250817,0.012123859,0.0040895957,0.0019257518,0.0017934631],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00233217,0.00043754576,0.008333919,0.0009497892,0.00013126824,0.0003313609,0.0011248067,0.29026654,0.017203266,0.2940165,0.017766094,0.36710668],"study_design_scores_gemma":[0.00015006818,0.00034456828,0.0011040753,0.00007197233,0.00004629897,0.00047451668,0.0004467916,0.5637098,0.012226285,0.41012186,0.011247631,0.000056140165],"about_ca_topic_score_codex":0.0011587511,"about_ca_topic_score_gemma":0.0013478326,"teacher_disagreement_score":0.006580429,"about_ca_system_score_codex":0.0014605687,"about_ca_system_score_gemma":0.0011293541,"threshold_uncertainty_score":0.022013783},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82079357,0.0009938844,0.15068746,0.00047792838,0.00016240291,0.000044670385,0.00033627532,0.0002251065,0.026278773],"genre_scores_gemma":[0.97057706,0.00046336453,0.025191396,0.00008211452,0.00010706853,0.000071207476,0.00035206936,0.00017414708,0.0029816688],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984281,0.00027095136,0.00009555401,0.0003278365,0.0005982438,0.00027939532],"domain_scores_gemma":[0.9944629,0.0029686226,0.00086979254,0.00050699967,0.00041217566,0.0007794748],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009767504,0.0008379395,0.0010191998,0.0020764759,0.0012562195,0.0032138743,0.0015684682,0.0008586956,0.006143007],"category_scores_gemma":[0.0070238314,0.0007431559,0.0007842496,0.0015569207,0.002521152,0.0048429687,0.0028037853,0.0014006722,0.00048751754],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00059454236,0.00015604853,0.008689957,0.0004344755,0.000108128246,0.0011019555,0.00072798773,0.09776824,0.034124266,0.8141559,0.0036145968,0.038523905],"study_design_scores_gemma":[0.000047947422,0.00018166994,0.010355142,0.00010851836,0.000100910715,0.0021695232,0.0009730056,0.2750809,0.020454051,0.6805261,0.009913576,0.000088733956],"about_ca_topic_score_codex":0.00055604783,"about_ca_topic_score_gemma":0.00048591648,"teacher_disagreement_score":0.006143007,"about_ca_system_score_codex":0.0010174694,"about_ca_system_score_gemma":0.00030574188,"threshold_uncertainty_score":0.02055037},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2598274,0.00080825074,0.630244,0.00021527418,0.00041679447,0.000091449125,0.00032529156,0.00044115612,0.10763044],"genre_scores_gemma":[0.67697144,0.001328451,0.17527065,0.00019851235,0.00034756574,0.00023891966,0.0008133877,0.0005845508,0.1442466],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994374,0.00007115888,0.00004386309,0.000117858544,0.00026924547,0.00006049211],"domain_scores_gemma":[0.999335,0.00019978358,0.000091002184,0.00011492163,0.00014517248,0.000114052316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038435165,0.00074311986,0.0008155867,0.0022048675,0.000729723,0.0016981475,0.001131087,0.0005531837,0.009315155],"category_scores_gemma":[0.0013376967,0.0006198416,0.00065986457,0.0016408266,0.0011142609,0.0025709597,0.002826579,0.0017381766,0.0014258506],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044045835,0.00002549024,0.0002271173,0.0000695923,0.000020407171,0.000121517995,0.00021738875,0.004767187,0.0055170143,0.9504461,0.0012558594,0.037288174],"study_design_scores_gemma":[0.000008486078,0.000058656606,0.00037441848,0.00003190893,0.000021729371,0.00035619215,0.00012503019,0.01933467,0.0036292118,0.96408767,0.011957136,0.000014912347],"about_ca_topic_score_codex":0.00022851952,"about_ca_topic_score_gemma":0.00044955875,"teacher_disagreement_score":0.009315155,"about_ca_system_score_codex":0.0003256978,"about_ca_system_score_gemma":0.00018679787,"threshold_uncertainty_score":0.031162322},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07054632,0.00008800836,0.9231471,0.00018798013,0.000054066142,0.00008101882,0.0000950556,0.00065857125,0.005141827],"genre_scores_gemma":[0.49640724,0.00010181453,0.49651924,0.00015378887,0.000024073976,0.0000988626,0.0003483762,0.00046341863,0.00588319],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991153,0.00020912544,0.00005035647,0.00015672873,0.00039940447,0.00006913972],"domain_scores_gemma":[0.9975376,0.0011153419,0.00020939682,0.0006617755,0.00035432412,0.000121521276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011033057,0.0006693549,0.00071976066,0.0011069013,0.0004893111,0.0016295392,0.0013354422,0.0012334877,0.005827695],"category_scores_gemma":[0.0041203666,0.00047459133,0.0009299257,0.0008159668,0.0017797353,0.0015178097,0.0027008527,0.0016456392,0.0011558419],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008323073,0.000060017264,0.0012397747,0.000098780234,0.00002684179,0.00021258902,0.00031633905,0.8882659,0.01543403,0.046679143,0.001225127,0.04635825],"study_design_scores_gemma":[0.000007068806,0.00002007386,0.00015740437,0.000007609477,0.0000020712605,0.000041879633,0.000038279333,0.9815196,0.00311053,0.013510019,0.0015795792,0.0000058207943],"about_ca_topic_score_codex":0.0018327204,"about_ca_topic_score_gemma":0.0014774611,"teacher_disagreement_score":0.005827695,"about_ca_system_score_codex":0.0007729193,"about_ca_system_score_gemma":0.00085665745,"threshold_uncertainty_score":0.019495606},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021974712,0.00004391159,0.99552274,0.00006806559,0.000045047167,0.000017156746,0.00004048768,0.0005058092,0.0015594051],"genre_scores_gemma":[0.13750312,0.00027845413,0.8558792,0.00016993385,0.000057182424,0.00018950913,0.00036392084,0.0010258694,0.0045328364],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990128,0.0001565237,0.000066664325,0.00016548461,0.0005184846,0.000079949896],"domain_scores_gemma":[0.99888986,0.00029903272,0.000057084344,0.0005098004,0.0002040934,0.0000402263],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009847423,0.00056516443,0.0009535426,0.00084849866,0.00062521704,0.0016176808,0.002356309,0.0013545435,0.005594072],"category_scores_gemma":[0.0031248142,0.00068007654,0.0013461392,0.00075026,0.0018624993,0.0023279884,0.0025864055,0.0022404748,0.0020215088],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011824439,0.000041577572,0.00069178623,0.00023419068,0.000073404844,0.00026202874,0.0004932698,0.47670296,0.042186137,0.30364317,0.008364665,0.16718851],"study_design_scores_gemma":[0.000015912217,0.000029158593,0.00009619708,0.000037242444,0.000012977654,0.00012329117,0.00006617918,0.8774613,0.009806723,0.08647998,0.025845127,0.000025884574],"about_ca_topic_score_codex":0.0010862724,"about_ca_topic_score_gemma":0.0010291345,"teacher_disagreement_score":0.005594072,"about_ca_system_score_codex":0.0004914164,"about_ca_system_score_gemma":0.0006713879,"threshold_uncertainty_score":0.01871407},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007951485,0.00067152677,0.9488729,0.0001448968,0.00017470858,0.00022294099,0.0013671947,0.018200506,0.022393804],"genre_scores_gemma":[0.06386459,0.00041572424,0.9112859,0.00018907848,0.000041063897,0.00031581256,0.003828909,0.0033241764,0.016734827],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990157,0.00007431001,0.000069221554,0.00030333103,0.00042506392,0.00011239884],"domain_scores_gemma":[0.99893063,0.0003372966,0.000084842584,0.0003405391,0.00024053098,0.000066206485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005925761,0.0017358185,0.00123946,0.001367264,0.0009419691,0.0021297168,0.0019325127,0.0011995725,0.052744508],"category_scores_gemma":[0.0023587,0.00092098815,0.0013817672,0.0014437442,0.00075896975,0.0020126346,0.0024342106,0.0017795482,0.013894818],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00051352865,0.00014303105,0.0020758172,0.0007007737,0.000085973494,0.0004320247,0.00032287464,0.07380236,0.046286102,0.053016722,0.0726085,0.75001234],"study_design_scores_gemma":[0.00013905311,0.00031361304,0.0014771969,0.00016805653,0.00007035647,0.0011668585,0.00022327641,0.58056426,0.07820295,0.05436213,0.28315285,0.00015944295],"about_ca_topic_score_codex":0.0020706868,"about_ca_topic_score_gemma":0.0037197128,"teacher_disagreement_score":0.052744508,"about_ca_system_score_codex":0.00087507244,"about_ca_system_score_gemma":0.0011108483,"threshold_uncertainty_score":0},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017195709,0.0009147368,0.95554376,0.0008895254,0.00022142977,0.00011216486,0.0003237977,0.00040682917,0.024391888],"genre_scores_gemma":[0.42353046,0.0028261219,0.5343698,0.00097367296,0.00023053917,0.0007610314,0.0009431255,0.0010781791,0.035287127],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996512,0.000102368984,0.000012650488,0.000055889224,0.0001434286,0.000034442735],"domain_scores_gemma":[0.9996008,0.00015620905,0.00003228386,0.00011271388,0.00006112452,0.000036849888],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005766126,0.000609829,0.0018145604,0.0008480852,0.0007961873,0.0012622259,0.0042530843,0.002406186,0.0076285666],"category_scores_gemma":[0.001651842,0.0008701742,0.0013285069,0.001074517,0.0011324132,0.002318243,0.0013745525,0.0021741819,0.0023720213],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000120739445,0.000080106234,0.00026935965,0.00030579188,0.00006898724,0.000236007,0.0001377157,0.5281452,0.004343728,0.42190996,0.0048858975,0.039496552],"study_design_scores_gemma":[0.000021427559,0.000035745255,0.00006259731,0.000018232064,0.000011676434,0.000052668194,0.000020175647,0.92905754,0.00053011294,0.06483094,0.0053434023,0.000015540949],"about_ca_topic_score_codex":0.0022487426,"about_ca_topic_score_gemma":0.0016947268,"teacher_disagreement_score":0.0076285666,"about_ca_system_score_codex":0.00051956257,"about_ca_system_score_gemma":0.0011847093,"threshold_uncertainty_score":0.025520086},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028174395,0.008927304,0.89237815,0.008196758,0.0033206954,0.000115780465,0.0007960549,0.006129061,0.051961906],"genre_scores_gemma":[0.22472271,0.007315013,0.72876245,0.0014895432,0.0011127669,0.00016243456,0.0015948683,0.001706652,0.033133533],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99837923,0.00029676358,0.000087157765,0.00038765464,0.00067301985,0.0001762189],"domain_scores_gemma":[0.9917436,0.003927398,0.00029243797,0.002473969,0.0013786581,0.00018391805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021478485,0.0008438323,0.0014781125,0.0009874349,0.0011605026,0.0027342662,0.002371938,0.0022854165,0.017089633],"category_scores_gemma":[0.030874526,0.0009037714,0.00064438995,0.0021188608,0.0012701821,0.015180862,0.0023116253,0.0016063924,0.014064189],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007263766,0.00009892104,0.0013723705,0.00062705664,0.000082304185,0.0001532512,0.00020232052,0.011875666,0.0057841614,0.103266805,0.07733141,0.7984793],"study_design_scores_gemma":[0.00015538714,0.00015603533,0.0015328717,0.0003218106,0.00011767779,0.0012632506,0.0006270809,0.12593473,0.012133661,0.7502418,0.10738718,0.00012847007],"about_ca_topic_score_codex":0.0027838808,"about_ca_topic_score_gemma":0.0031931722,"teacher_disagreement_score":0.017089633,"about_ca_system_score_codex":0.00050933147,"about_ca_system_score_gemma":0.00081139995,"threshold_uncertainty_score":0.05717051},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011972162,0.00009017815,0.9864948,0.00005213201,0.000048029877,0.00003319225,0.000019079147,0.00017122063,0.0011192828],"genre_scores_gemma":[0.27964568,0.00017600582,0.71607685,0.00009295336,0.000064044696,0.0001552014,0.00014467354,0.00023756332,0.0034069952],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995902,0.00011046508,0.000028841227,0.00009423023,0.00013327264,0.000043058262],"domain_scores_gemma":[0.99885595,0.00052318134,0.000084279585,0.00019525096,0.00028055548,0.00006080443],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013917144,0.0004909603,0.0010240332,0.0015845583,0.00065498933,0.0012094007,0.0014697375,0.0011606202,0.0022175931],"category_scores_gemma":[0.0034169203,0.00040711393,0.0011091824,0.0011188836,0.0008097722,0.00088919717,0.0013609054,0.0010521344,0.00041734002],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014543219,0.00011124247,0.0025218385,0.00014195924,0.00012335162,0.00015246091,0.00023981201,0.6586137,0.011347072,0.07868388,0.0030134295,0.24490587],"study_design_scores_gemma":[0.0000059314502,0.000017921475,0.00012818331,0.0000037544464,0.00000778949,0.000018678942,0.000007236588,0.9937562,0.0006293796,0.00465459,0.0007649756,0.0000053700574],"about_ca_topic_score_codex":0.0035635433,"about_ca_topic_score_gemma":0.0034698842,"teacher_disagreement_score":0.0035635433,"about_ca_system_score_codex":0.00062935654,"about_ca_system_score_gemma":0.00076137047,"threshold_uncertainty_score":0.007418573},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24478057,0.0003580581,0.7307337,0.0002484282,0.000046389152,0.00006637092,0.00019816906,0.00076405035,0.022804288],"genre_scores_gemma":[0.7314567,0.00063962804,0.26044065,0.00010844829,0.000042444302,0.000110509965,0.0003755071,0.00024171387,0.006584349],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995968,0.00008692243,0.000021793576,0.000115159884,0.00011404184,0.00006536805],"domain_scores_gemma":[0.9989899,0.00043287454,0.00018520144,0.00022947889,0.000087170665,0.000075443444],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024460405,0.0005625391,0.00040709862,0.0004948961,0.0004373509,0.0006685682,0.00071111036,0.00060811883,0.0037318922],"category_scores_gemma":[0.0024921454,0.00043999054,0.0004579546,0.0008103475,0.00076089136,0.0016316655,0.001039115,0.0007531095,0.00058153627],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020042568,0.00011658756,0.0024974085,0.00034590316,0.000061531435,0.0006411081,0.0006055943,0.34687293,0.0429917,0.38207313,0.0039294064,0.21966434],"study_design_scores_gemma":[0.0000774438,0.00020482314,0.0018698814,0.00007637057,0.000048541402,0.00087876304,0.00045963933,0.5320692,0.02982965,0.40606266,0.028371533,0.000051489063],"about_ca_topic_score_codex":0.0012671998,"about_ca_topic_score_gemma":0.0017712379,"teacher_disagreement_score":0.0037318922,"about_ca_system_score_codex":0.00054688967,"about_ca_system_score_gemma":0.0002090678,"threshold_uncertainty_score":0.012484491},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026950143,0.0006758976,0.95150965,0.00030774946,0.00024190595,0.00006976212,0.00017635441,0.0011409323,0.01892747],"genre_scores_gemma":[0.27060616,0.0009304275,0.70783985,0.0001458261,0.00015273612,0.00012937549,0.00036151553,0.00047610092,0.019358054],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99934417,0.00016286116,0.00003317446,0.00011609984,0.00028702372,0.000056692355],"domain_scores_gemma":[0.9993668,0.00020521908,0.000037037342,0.00017643192,0.00018930386,0.000025213545],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039662907,0.00049535104,0.00097211596,0.0009478231,0.00055111095,0.00084525306,0.0010924351,0.0005899101,0.008077228],"category_scores_gemma":[0.0020779811,0.00040237012,0.000486879,0.0009219702,0.000584862,0.0012834838,0.0017129439,0.000882955,0.00170963],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002607863,0.000055989025,0.0006690795,0.0002536441,0.000054129498,0.00017234546,0.00021492032,0.4180703,0.014362459,0.15951532,0.012058584,0.3943125],"study_design_scores_gemma":[0.000036098463,0.00008549017,0.0002573291,0.00002919272,0.00002395221,0.000132277,0.000047133963,0.9338911,0.0039504077,0.042837366,0.018682754,0.000026837639],"about_ca_topic_score_codex":0.0046805115,"about_ca_topic_score_gemma":0.0061275503,"teacher_disagreement_score":0.008077228,"about_ca_system_score_codex":0.00066670007,"about_ca_system_score_gemma":0.00068528106,"threshold_uncertainty_score":0.02702105},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00479618,0.00003410901,0.9930565,0.000032292864,0.000025687159,0.000030146457,0.000096598094,0.00054492964,0.0013835449],"genre_scores_gemma":[0.101417385,0.0001086747,0.8937984,0.00005474288,0.000038063776,0.000212195,0.00047850262,0.0007295515,0.0031624879],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997037,0.000043304688,0.000014987496,0.000030721214,0.00017803398,0.00002922969],"domain_scores_gemma":[0.99953413,0.00014759424,0.000038675298,0.00006628263,0.0001890831,0.000024170782],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002972786,0.00055102824,0.00041617497,0.0006328826,0.00039950205,0.0006771894,0.0011413019,0.0006066438,0.003440392],"category_scores_gemma":[0.0014122085,0.00045582053,0.00061149034,0.000563947,0.00028204106,0.0008083828,0.00069191336,0.0007605039,0.0010218073],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008432116,0.00006928685,0.0013709269,0.00013520423,0.000057533358,0.0001129512,0.00012015524,0.82578117,0.016399078,0.02330768,0.005584536,0.12697712],"study_design_scores_gemma":[0.000007717257,0.000013310364,0.000121184334,0.000004794222,0.0000039522342,0.000023147368,0.000011623442,0.9918881,0.0019024897,0.0029123651,0.003103812,0.000007488773],"about_ca_topic_score_codex":0.005076683,"about_ca_topic_score_gemma":0.008775549,"teacher_disagreement_score":0.005076683,"about_ca_system_score_codex":0.000536743,"about_ca_system_score_gemma":0.001233819,"threshold_uncertainty_score":0.01150924},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.100160204,0.0013300116,0.80934495,0.0008832433,0.000160083,0.00010963788,0.00063135405,0.0012228057,0.0861577],"genre_scores_gemma":[0.573079,0.0019117546,0.3815256,0.00042173715,0.00012419358,0.00018307139,0.0014155285,0.0005245381,0.04081465],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99949527,0.00009365411,0.000020337602,0.00012821109,0.00018256216,0.00007996426],"domain_scores_gemma":[0.99932194,0.00019819697,0.00011409783,0.00015661171,0.00013958378,0.00006954397],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022883786,0.00055310724,0.00031299875,0.0008551592,0.0005504049,0.001633221,0.0006688661,0.0010633675,0.011125276],"category_scores_gemma":[0.0026082748,0.0004953145,0.00048166967,0.0012820527,0.0011745996,0.001691337,0.0011836721,0.0014006317,0.0017143193],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000117908115,0.000029975938,0.0010131174,0.00015838907,0.000019155641,0.00037441295,0.00035649881,0.047613073,0.008036223,0.8180276,0.010541909,0.113711834],"study_design_scores_gemma":[0.00004275177,0.00007751592,0.0018521275,0.00009014096,0.000033283843,0.0010079133,0.00031322177,0.16944358,0.008207092,0.69845396,0.12041244,0.00006597344],"about_ca_topic_score_codex":0.001684124,"about_ca_topic_score_gemma":0.0024108032,"teacher_disagreement_score":0.011125276,"about_ca_system_score_codex":0.0005894933,"about_ca_system_score_gemma":0.00031871523,"threshold_uncertainty_score":0.037217736},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06677341,0.025732525,0.6885223,0.012916017,0.0024508492,0.0003782169,0.0049679205,0.003526582,0.19473214],"genre_scores_gemma":[0.473791,0.023991369,0.40876073,0.005452388,0.006537713,0.0018119331,0.011268116,0.0040396564,0.06434707],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99058795,0.0015677373,0.00052430655,0.002646604,0.0030959086,0.0015774858],"domain_scores_gemma":[0.9513668,0.0308543,0.0032168867,0.007793509,0.004076948,0.0026916007],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045724683,0.004119046,0.0036473244,0.0073002516,0.0041846638,0.008438654,0.0095224045,0.005000692,0.0355801],"category_scores_gemma":[0.050460376,0.002828278,0.0036433772,0.008697818,0.006251995,0.036771186,0.008963541,0.017270643,0.012297288],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011551364,0.0006613161,0.011023287,0.0022750562,0.00031616646,0.00056871085,0.0008572701,0.07933732,0.0146171795,0.61525404,0.08999324,0.18394117],"study_design_scores_gemma":[0.00012981503,0.00029419153,0.004073555,0.0005159194,0.0002683097,0.0014630755,0.00031999202,0.20924434,0.009256508,0.6841941,0.089933306,0.0003068812],"about_ca_topic_score_codex":0.0026676445,"about_ca_topic_score_gemma":0.0034201662,"teacher_disagreement_score":0.0355801,"about_ca_system_score_codex":0.005379082,"about_ca_system_score_gemma":0.002188568,"threshold_uncertainty_score":0.11902732},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25682223,0.00046376986,0.7292741,0.0007359747,0.0000454924,0.00030100014,0.0017013655,0.0018554757,0.008800596],"genre_scores_gemma":[0.5326482,0.00062240666,0.45604903,0.00015541093,0.000039575123,0.00021588085,0.0054160864,0.000251294,0.0046021696],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989434,0.00019599024,0.000079356185,0.00036639656,0.00026392893,0.00015105717],"domain_scores_gemma":[0.99717903,0.0014000486,0.00044052533,0.0005942338,0.00022803065,0.00015818799],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005735513,0.0010857803,0.0007060324,0.000638344,0.0005329857,0.0016532958,0.0014291042,0.0012995914,0.0041771075],"category_scores_gemma":[0.0050225984,0.000830956,0.0008047148,0.0012382405,0.0009097253,0.0039490024,0.0019565057,0.0012357221,0.0008825315],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010697264,0.0003250345,0.005771476,0.00085909944,0.00010696637,0.00077242526,0.000802096,0.38841012,0.035071593,0.13753764,0.0111828195,0.418091],"study_design_scores_gemma":[0.00017865228,0.00040571764,0.0015606235,0.00013578968,0.00007114162,0.0007230091,0.00063833763,0.707453,0.020861022,0.25406802,0.013818976,0.00008568805],"about_ca_topic_score_codex":0.0017216466,"about_ca_topic_score_gemma":0.002402412,"teacher_disagreement_score":0.0041771075,"about_ca_system_score_codex":0.000550524,"about_ca_system_score_gemma":0.00062188075,"threshold_uncertainty_score":0.0139737725},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012898117,0.00010907,0.9959364,0.000066772736,0.0000476662,0.000034390025,0.00004181617,0.0003031358,0.0021709818],"genre_scores_gemma":[0.037216593,0.00036954833,0.9517082,0.00010214641,0.00015341789,0.00022405905,0.0002965527,0.000409837,0.00951965],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981158,0.0005044664,0.00009300418,0.00030760898,0.000845147,0.00013401813],"domain_scores_gemma":[0.99746394,0.0012916013,0.0001256768,0.0005101015,0.00047182926,0.00013688862],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012128575,0.0017216301,0.0016487091,0.0012589385,0.0008054686,0.0018936647,0.0035841048,0.0015734229,0.015944617],"category_scores_gemma":[0.006258424,0.001012739,0.0014108092,0.0019764465,0.0013835542,0.002626395,0.0041850153,0.0048212283,0.00616474],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023755788,0.00028669738,0.0002968876,0.00035651153,0.00006511687,0.00009735577,0.00031553887,0.27022177,0.008940612,0.23987918,0.022292065,0.45701075],"study_design_scores_gemma":[0.000030505706,0.00009926424,0.00009049988,0.000029704928,0.000012105263,0.00008956563,0.00005479435,0.8665648,0.0026952843,0.12032694,0.009978018,0.00002854157],"about_ca_topic_score_codex":0.0031574683,"about_ca_topic_score_gemma":0.0038206216,"teacher_disagreement_score":0.015944617,"about_ca_system_score_codex":0.0010752579,"about_ca_system_score_gemma":0.0013104136,"threshold_uncertainty_score":0.053340077},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10399904,0.0023670143,0.86110944,0.0023897141,0.000399284,0.00061137544,0.0049387915,0.0074919215,0.016693331],"genre_scores_gemma":[0.46471822,0.00089789106,0.5145494,0.0006266073,0.00019661491,0.00036159102,0.009334218,0.0014156504,0.007899818],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99475443,0.001205601,0.0005643336,0.0010677689,0.0017746803,0.00063311314],"domain_scores_gemma":[0.9924935,0.004283987,0.00032607655,0.0021036637,0.0005074217,0.00028528238],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002821114,0.0010413418,0.0027830957,0.0022122988,0.0017424711,0.003680376,0.0030446737,0.0030919856,0.012383237],"category_scores_gemma":[0.018035665,0.0010428464,0.0016085437,0.004858625,0.0014004955,0.010353758,0.008157876,0.0021428913,0.0030491524],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0037231843,0.0007167272,0.0048458907,0.001451089,0.00030853465,0.0015713575,0.0016170038,0.24098912,0.014928676,0.26781446,0.07583465,0.38619933],"study_design_scores_gemma":[0.00036938465,0.0001874304,0.0005172558,0.00011581617,0.00007249167,0.0007284438,0.0008880035,0.65303797,0.011132931,0.3126356,0.020265121,0.000049564744],"about_ca_topic_score_codex":0.0030160474,"about_ca_topic_score_gemma":0.0030690941,"teacher_disagreement_score":0.012383237,"about_ca_system_score_codex":0.00127334,"about_ca_system_score_gemma":0.0011011275,"threshold_uncertainty_score":0.041426003},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28468576,0.0011105671,0.68356603,0.0012370634,0.00015601637,0.00042353058,0.0032872378,0.0060023093,0.019531567],"genre_scores_gemma":[0.71019894,0.00056270335,0.27832934,0.00014889082,0.000063386644,0.0001527718,0.004462826,0.00050021533,0.005580832],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989654,0.00015374373,0.00008554892,0.00023748024,0.00042758146,0.00013019846],"domain_scores_gemma":[0.9980375,0.0012469146,0.00014439467,0.0003210019,0.0001541186,0.00009604844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051863777,0.00043407548,0.0009487741,0.00071743573,0.0009341915,0.0014801408,0.0011211578,0.0010758358,0.004141405],"category_scores_gemma":[0.0049276236,0.00054897065,0.00070399325,0.0013717663,0.0008269921,0.0027579397,0.002108017,0.0008041097,0.00095190876],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0034335777,0.00047646667,0.007076222,0.001433086,0.00017331801,0.0031798284,0.002080948,0.36250693,0.06687104,0.14378296,0.036839258,0.3721463],"study_design_scores_gemma":[0.00022244679,0.00028108837,0.0013859689,0.000104917606,0.000059927643,0.0007142029,0.0007851453,0.8116334,0.026870452,0.13059509,0.02729002,0.000057208603],"about_ca_topic_score_codex":0.0025708312,"about_ca_topic_score_gemma":0.0023963796,"teacher_disagreement_score":0.004141405,"about_ca_system_score_codex":0.00050856813,"about_ca_system_score_gemma":0.0005178709,"threshold_uncertainty_score":0.013854444},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42778328,0.000297179,0.5271037,0.00035804507,0.00017781266,0.00011792118,0.0004351833,0.00068841944,0.04303841],"genre_scores_gemma":[0.86392695,0.00018148836,0.12643725,0.00012489819,0.000037441383,0.00008319403,0.00055417325,0.0002796841,0.008374855],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99950516,0.000059678558,0.000034830882,0.0001507697,0.00016202833,0.00008751924],"domain_scores_gemma":[0.99876106,0.00029790887,0.00021974133,0.00043932322,0.00016881284,0.00011311983],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028462836,0.00033440196,0.00037013617,0.00042683768,0.0005654002,0.0010915046,0.00086666405,0.00056954083,0.0043375874],"category_scores_gemma":[0.0024152857,0.00033244956,0.00054837967,0.0003362925,0.0016221745,0.0019202058,0.00181352,0.0012717176,0.0005601851],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00052066235,0.00010330436,0.0044199526,0.00039250508,0.000042532825,0.0017145519,0.0012322672,0.052583683,0.13474467,0.6687558,0.0045627058,0.13092728],"study_design_scores_gemma":[0.00013008248,0.00051314215,0.0051154094,0.00018530796,0.000054357963,0.0033039902,0.0010728143,0.31588385,0.1415722,0.44591817,0.08611801,0.00013266774],"about_ca_topic_score_codex":0.0005853826,"about_ca_topic_score_gemma":0.00063341664,"teacher_disagreement_score":0.0043375874,"about_ca_system_score_codex":0.00031493476,"about_ca_system_score_gemma":0.00032989317,"threshold_uncertainty_score":0.014510632},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10345694,0.0013971323,0.8495727,0.0051372047,0.00032416056,0.00016852045,0.00085885037,0.0002754222,0.038809076],"genre_scores_gemma":[0.5670102,0.0021263994,0.40110692,0.0010910109,0.0008180335,0.0005428266,0.0031100437,0.0006109925,0.023583604],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99867743,0.00061501464,0.000057998997,0.00020845728,0.00033152502,0.00010952603],"domain_scores_gemma":[0.99447954,0.0042864126,0.00019917973,0.000507703,0.00034203735,0.00018511828],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018278038,0.00059245015,0.0015493644,0.000993767,0.00094175996,0.0018075575,0.0016680364,0.001475518,0.010514238],"category_scores_gemma":[0.010389359,0.0006055915,0.0009345819,0.0014148592,0.001278428,0.003679063,0.0025687108,0.0028774654,0.0007519686],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040188426,0.00014635501,0.0008693214,0.00032570452,0.00007889028,0.00017146407,0.00023452056,0.054102115,0.0028307699,0.83711857,0.01979319,0.08392711],"study_design_scores_gemma":[0.00006385476,0.000049925395,0.00023906528,0.000041456806,0.000021837763,0.000105812076,0.000087093526,0.10923006,0.0008033603,0.88404346,0.005304548,0.000009563141],"about_ca_topic_score_codex":0.0005602292,"about_ca_topic_score_gemma":0.000639465,"teacher_disagreement_score":0.010514238,"about_ca_system_score_codex":0.00066922547,"about_ca_system_score_gemma":0.00082658365,"threshold_uncertainty_score":0.035173595},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2938069,0.001217905,0.5083203,0.0016692015,0.0008010414,0.000105352,0.00053198065,0.0004016556,0.19314568],"genre_scores_gemma":[0.8732251,0.000638123,0.08669614,0.00036899972,0.00033874757,0.00014397841,0.000641015,0.00040028765,0.037547626],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991703,0.00019382943,0.000035601304,0.00020253706,0.0002762836,0.00012136005],"domain_scores_gemma":[0.9986934,0.0005667503,0.0001952767,0.00016782276,0.00019414921,0.00018262892],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005445425,0.0007291367,0.00078398024,0.0025181356,0.0015128591,0.0030829622,0.0012500165,0.0011115205,0.011149763],"category_scores_gemma":[0.0047957883,0.0007217794,0.0007999616,0.0013333008,0.0026871574,0.0024565065,0.0041504693,0.00272604,0.0011323004],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005067377,0.000013922018,0.00023687944,0.000028165765,0.0000057217308,0.00007576893,0.000100411125,0.0028802147,0.0006513136,0.9871895,0.0013027221,0.0074646696],"study_design_scores_gemma":[0.00002067257,0.000026985732,0.00035083276,0.00002996086,0.000011100065,0.00023124037,0.00017879832,0.022668902,0.0013007742,0.9636869,0.01147724,0.000016593509],"about_ca_topic_score_codex":0.0010665319,"about_ca_topic_score_gemma":0.00059299986,"teacher_disagreement_score":0.011149763,"about_ca_system_score_codex":0.0010417496,"about_ca_system_score_gemma":0.0003864165,"threshold_uncertainty_score":0.037299693},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0040344615,0.000054904805,0.9939798,0.000049556682,0.000018530947,0.00002412005,0.000024049903,0.00021559109,0.0015989118],"genre_scores_gemma":[0.14707363,0.00009973867,0.8493856,0.0000744658,0.00003078483,0.00014072195,0.00014161643,0.00035127084,0.0027021037],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978097,0.0006157415,0.00009288721,0.00027974654,0.0010676085,0.00013433078],"domain_scores_gemma":[0.9955171,0.002582343,0.0002430466,0.0007978628,0.0007179242,0.00014176648],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022750932,0.0009022519,0.0020249141,0.0020983366,0.00083933835,0.002501348,0.003257824,0.002313807,0.0062680575],"category_scores_gemma":[0.010771115,0.0011878263,0.0016934832,0.0020332944,0.0016748051,0.0029648014,0.005675567,0.0032460068,0.0014729614],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026768728,0.00016937082,0.0012490391,0.00035680318,0.00014416888,0.00018041763,0.00038652154,0.61196625,0.006709049,0.17412014,0.0039805565,0.20047008],"study_design_scores_gemma":[0.000008857396,0.000015761294,0.000044254175,0.000011234918,0.000007126184,0.000036465102,0.000020182124,0.97837013,0.0013568607,0.018902596,0.0012195279,0.0000069523153],"about_ca_topic_score_codex":0.0025987544,"about_ca_topic_score_gemma":0.0035775327,"teacher_disagreement_score":0.0062680575,"about_ca_system_score_codex":0.0011428011,"about_ca_system_score_gemma":0.0012571561,"threshold_uncertainty_score":0.020968735},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49699473,0.001949972,0.27868047,0.012682189,0.00042454718,0.00055072707,0.0032822725,0.0028702435,0.20256488],"genre_scores_gemma":[0.9078868,0.00028268062,0.052392583,0.0007823121,0.00014319476,0.00012103037,0.0028698982,0.00028581693,0.035235707],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99768925,0.00044413575,0.00011579147,0.0007926397,0.0004943827,0.0004637002],"domain_scores_gemma":[0.9964085,0.0015960074,0.00032922064,0.00088515755,0.00036034163,0.0004206357],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010071233,0.00087071036,0.0016107644,0.0010023467,0.0023262457,0.004885823,0.0024102125,0.0048029283,0.022277985],"category_scores_gemma":[0.008743652,0.00070959434,0.0016708061,0.00081588275,0.002927887,0.0058817905,0.004287058,0.002686655,0.0027230617],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014869953,0.00043351742,0.0047612307,0.0006823345,0.000272825,0.0013155622,0.001629955,0.14381947,0.00880007,0.61215407,0.101109505,0.12353448],"study_design_scores_gemma":[0.00016529651,0.00012509286,0.0022514234,0.00009029214,0.00006146916,0.0007480475,0.0007084844,0.4163275,0.0050239214,0.55118847,0.023216994,0.00009297229],"about_ca_topic_score_codex":0.010975715,"about_ca_topic_score_gemma":0.0058721015,"teacher_disagreement_score":0.022277985,"about_ca_system_score_codex":0.002372913,"about_ca_system_score_gemma":0.00095005,"threshold_uncertainty_score":0.07452726},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1443488,0.00062943675,0.84784275,0.00021899318,0.00004480737,0.00016538546,0.0004451599,0.00072121684,0.005583421],"genre_scores_gemma":[0.30515328,0.0004888707,0.6904517,0.00006288456,0.000027822689,0.00015630716,0.0013859919,0.00022612493,0.002047009],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994666,0.00011651051,0.000043828117,0.00011248839,0.00017899298,0.00008164434],"domain_scores_gemma":[0.9991049,0.00035160003,0.00012143696,0.00015673472,0.00017921581,0.00008596491],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065365015,0.00057983055,0.0011362468,0.0011772885,0.000623574,0.0009957872,0.00097323576,0.0008750165,0.0024155981],"category_scores_gemma":[0.0032849342,0.0005494878,0.00068202236,0.0016671123,0.00040578438,0.0016583399,0.0013354676,0.0008306571,0.0007097458],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042436615,0.00021001899,0.0019255369,0.00055085326,0.00009850135,0.00033791116,0.0006256253,0.5080135,0.026079224,0.08288089,0.011776907,0.36707672],"study_design_scores_gemma":[0.000050358558,0.00008585597,0.00056331133,0.00003759981,0.00001762345,0.00019502554,0.00013972916,0.9341452,0.0033343786,0.057854403,0.0035627862,0.000013726898],"about_ca_topic_score_codex":0.0017623856,"about_ca_topic_score_gemma":0.0032287333,"teacher_disagreement_score":0.0024155981,"about_ca_system_score_codex":0.0007091667,"about_ca_system_score_gemma":0.0005260672,"threshold_uncertainty_score":0.008080959},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49304885,0.0008833872,0.4776918,0.0009162908,0.000114837945,0.00018665993,0.0010718758,0.0005734526,0.025512762],"genre_scores_gemma":[0.77500767,0.0012060149,0.2009074,0.0002898637,0.00008667017,0.0001999704,0.0016253704,0.00029277027,0.020384217],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99967074,0.00007032555,0.000024250145,0.00006499932,0.00010553904,0.000064218475],"domain_scores_gemma":[0.99809235,0.0010027853,0.00034409773,0.00013426265,0.00022332369,0.00020315769],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030963836,0.0004422809,0.000601694,0.0015800566,0.0009113581,0.0014432954,0.0012713609,0.0013027143,0.0057542855],"category_scores_gemma":[0.0036693176,0.00084743125,0.00041765484,0.0015604657,0.00085539476,0.0018245018,0.0013264088,0.0012819275,0.0009429056],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005231118,0.00015900253,0.0028700745,0.00060493,0.00007917332,0.0013940451,0.0010403827,0.21747316,0.017619954,0.63962734,0.012405169,0.10620373],"study_design_scores_gemma":[0.00006125108,0.00006332233,0.0015436902,0.000107851614,0.000047384186,0.0005389414,0.00048457496,0.40031713,0.004819807,0.5839316,0.008056226,0.000028210112],"about_ca_topic_score_codex":0.0018584118,"about_ca_topic_score_gemma":0.0028960481,"teacher_disagreement_score":0.0057542855,"about_ca_system_score_codex":0.00066997885,"about_ca_system_score_gemma":0.00037374825,"threshold_uncertainty_score":0.019250035},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0044311984,0.00011762717,0.9917425,0.00018099429,0.000033761648,0.000038660768,0.00021263039,0.0019328339,0.0013097017],"genre_scores_gemma":[0.06491042,0.00015181299,0.9304887,0.00014490324,0.00005518422,0.00021600923,0.0009780304,0.0005694896,0.0024854615],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983279,0.00021536257,0.00011107344,0.0003657119,0.000828105,0.00015193628],"domain_scores_gemma":[0.9979742,0.0005307717,0.00013838673,0.0008694997,0.00037884567,0.00010832782],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088911917,0.00090123934,0.0013812121,0.0015503014,0.00081746373,0.0017876975,0.004032367,0.0015026153,0.007887103],"category_scores_gemma":[0.005760623,0.0010259725,0.0011753337,0.0023380937,0.0015572306,0.004100597,0.0058092894,0.0028363087,0.0047110766],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000617408,0.0002845035,0.0017100581,0.00044800914,0.0000912301,0.00010195581,0.00037167678,0.2280152,0.020036137,0.17822993,0.022991113,0.5471028],"study_design_scores_gemma":[0.00011592151,0.00007937819,0.00018957075,0.000026545544,0.00001736227,0.00007852212,0.00007212497,0.89607894,0.0050873575,0.08413285,0.014088521,0.000032840322],"about_ca_topic_score_codex":0.0042336537,"about_ca_topic_score_gemma":0.005605157,"teacher_disagreement_score":0.007887103,"about_ca_system_score_codex":0.0013056601,"about_ca_system_score_gemma":0.0019717324,"threshold_uncertainty_score":0.02638495},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22023669,0.00030236313,0.7458197,0.00036540316,0.00030483227,0.0002673686,0.00025140715,0.0011149179,0.03133725],"genre_scores_gemma":[0.58485943,0.00022507,0.38913563,0.00012759976,0.000034596458,0.00017126824,0.0004275359,0.00046619936,0.02455274],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99936074,0.00010479813,0.00004039996,0.00012371919,0.00026200843,0.000108387416],"domain_scores_gemma":[0.9987896,0.00041929088,0.000111409405,0.00029394013,0.00022427073,0.00016145683],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055981387,0.00077448087,0.0011519289,0.0012100788,0.0011885188,0.001444916,0.0022319772,0.0018476519,0.018614318],"category_scores_gemma":[0.0029277578,0.00079984573,0.0006891027,0.0013773357,0.0013654206,0.0013962501,0.0044172667,0.0017012568,0.004243682],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017802782,0.00039471383,0.00291917,0.0006207932,0.00013944907,0.0015175119,0.002018757,0.42634508,0.06962261,0.2061776,0.01100775,0.2774563],"study_design_scores_gemma":[0.00016520929,0.00048895285,0.00044819503,0.00013029891,0.000037458904,0.00042243072,0.0006876323,0.8643955,0.022967445,0.08919072,0.021001847,0.000064398584],"about_ca_topic_score_codex":0.0017690059,"about_ca_topic_score_gemma":0.0019054798,"teacher_disagreement_score":0.018614318,"about_ca_system_score_codex":0.00067548326,"about_ca_system_score_gemma":0.0006097299,"threshold_uncertainty_score":0.06227112},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08485471,0.003764078,0.8047413,0.0035868713,0.001132435,0.00045906566,0.0024666728,0.0046975696,0.09429725],"genre_scores_gemma":[0.48648682,0.0043826546,0.46097302,0.0020300935,0.0012014876,0.00081864005,0.005363801,0.0042540617,0.034489438],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99357456,0.0012591145,0.00029696105,0.0010763442,0.002181353,0.0016116564],"domain_scores_gemma":[0.9656348,0.023245122,0.0013680516,0.0061861295,0.002078645,0.0014873466],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0052874577,0.0049186274,0.0035475704,0.00506778,0.0023550808,0.007366938,0.009376995,0.0032087609,0.03213329],"category_scores_gemma":[0.030895181,0.0020403524,0.0038646797,0.006396837,0.005043806,0.018752387,0.010888689,0.009902083,0.0064725233],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018215565,0.00069828355,0.0026284123,0.0014658332,0.00026564955,0.00042998817,0.00091198937,0.29091656,0.011401976,0.4899454,0.04585589,0.15365852],"study_design_scores_gemma":[0.00012553409,0.00017872867,0.00065620523,0.00027562812,0.00023685087,0.00017398142,0.00021163614,0.42200673,0.006946003,0.5570346,0.012076354,0.00007766371],"about_ca_topic_score_codex":0.006128041,"about_ca_topic_score_gemma":0.009129989,"teacher_disagreement_score":0.03213329,"about_ca_system_score_codex":0.005106074,"about_ca_system_score_gemma":0.0029996336,"threshold_uncertainty_score":0.10749656},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13508072,0.0014202747,0.8512212,0.0014177684,0.00009129569,0.00015599001,0.0006494262,0.00047467087,0.009488616],"genre_scores_gemma":[0.8385041,0.0011654599,0.14785965,0.00023389136,0.00028418968,0.00024106585,0.0011634721,0.00022960803,0.0103185605],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99783903,0.0003951342,0.00008999742,0.00072468014,0.0005865195,0.0003645415],"domain_scores_gemma":[0.99596465,0.0016878523,0.00056075066,0.0009846292,0.0003356841,0.00046650742],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013152568,0.0010035459,0.0018943399,0.0011773446,0.0013875273,0.002614338,0.0036195903,0.0023907379,0.004626689],"category_scores_gemma":[0.0075209276,0.00084413873,0.0012776806,0.0026478148,0.0026666895,0.009385472,0.0033209773,0.0025417905,0.000642907],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005694048,0.00019463438,0.003371618,0.0003309193,0.00009694477,0.00074583176,0.0006384653,0.57953066,0.005384884,0.3604289,0.0067207683,0.04198698],"study_design_scores_gemma":[0.000029970886,0.00009425484,0.0005192502,0.000021490143,0.00001975768,0.00033260582,0.00019444308,0.8889699,0.0012766016,0.105256006,0.0032606595,0.000024992725],"about_ca_topic_score_codex":0.005908315,"about_ca_topic_score_gemma":0.0035833966,"teacher_disagreement_score":0.005908315,"about_ca_system_score_codex":0.0022043858,"about_ca_system_score_gemma":0.00085865473,"threshold_uncertainty_score":0.015994012},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10611393,0.0012335714,0.6979341,0.004033235,0.00092371815,0.00014976798,0.0016512685,0.0016103862,0.18635012],"genre_scores_gemma":[0.62122095,0.0020164943,0.20254692,0.0016344987,0.0007038122,0.000525811,0.0026200432,0.0023985351,0.1663329],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99878126,0.00021834554,0.000051656516,0.00037166593,0.00039683667,0.00018025424],"domain_scores_gemma":[0.99737096,0.0016354664,0.00014233991,0.00022883077,0.00035715997,0.00026522693],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083948753,0.0017842063,0.00087187893,0.0013289042,0.0010068667,0.003000987,0.0016741435,0.0013593277,0.03770639],"category_scores_gemma":[0.0047227535,0.0007652653,0.0011025828,0.0010899123,0.0014435587,0.0064602876,0.0049916706,0.0044950456,0.003960479],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013108918,0.000057375935,0.0001381801,0.00017855265,0.00001777237,0.000074042786,0.00015518117,0.0037921353,0.0025493717,0.9546261,0.009322991,0.028957179],"study_design_scores_gemma":[0.000056025034,0.00005414123,0.00020682179,0.000047769445,0.000021977832,0.00013906507,0.00009634603,0.023135595,0.002409324,0.947454,0.026359068,0.000019861414],"about_ca_topic_score_codex":0.0011344878,"about_ca_topic_score_gemma":0.0017059743,"teacher_disagreement_score":0.03770639,"about_ca_system_score_codex":0.0015329593,"about_ca_system_score_gemma":0.0006961988,"threshold_uncertainty_score":0.12614048},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06242288,0.0007480189,0.69913733,0.0009376887,0.00093551097,0.00022530233,0.0010563898,0.002354096,0.23218282],"genre_scores_gemma":[0.6754331,0.0010867439,0.21592085,0.0007259878,0.00042719915,0.0001622192,0.002645765,0.0017367129,0.101861514],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990926,0.000081614184,0.000049520724,0.00030213944,0.0002649156,0.00020919288],"domain_scores_gemma":[0.99837804,0.00028768656,0.00014558432,0.00054090074,0.00042251672,0.00022525973],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043371192,0.0007572915,0.00074005517,0.0011153155,0.0011436745,0.0027457753,0.00090530893,0.000872804,0.021861646],"category_scores_gemma":[0.0032056358,0.00048580833,0.00080614624,0.0007770519,0.0013990165,0.0033953101,0.003588063,0.002444633,0.0048573622],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035448547,0.000100184305,0.0016713191,0.00025806983,0.000045564193,0.0003472621,0.00041042457,0.0042356555,0.017654222,0.7740804,0.01904681,0.1817956],"study_design_scores_gemma":[0.00005653351,0.00012660617,0.0013718804,0.0000964018,0.000054987482,0.0009841596,0.0004110199,0.027045647,0.024881247,0.8241047,0.12082895,0.000037915008],"about_ca_topic_score_codex":0.0011725231,"about_ca_topic_score_gemma":0.0010178753,"teacher_disagreement_score":0.021861646,"about_ca_system_score_codex":0.00053202285,"about_ca_system_score_gemma":0.0008515656,"threshold_uncertainty_score":0.07313448},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00816184,0.11003804,0.12785302,0.031600602,0.14066093,0.00042543668,0.006811328,0.002555248,0.5718935],"genre_scores_gemma":[0.0788442,0.10379758,0.1394543,0.0049785385,0.04319081,0.00065936695,0.017325645,0.0029035746,0.60884595],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99722064,0.0008385062,0.00022769596,0.00042311818,0.0011313742,0.00015878648],"domain_scores_gemma":[0.9965377,0.0009585788,0.000123285,0.0006429165,0.0011855417,0.00055194076],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024468875,0.0011400062,0.0016658218,0.0020432188,0.0010569793,0.005186115,0.0015085578,0.0011033708,0.12012228],"category_scores_gemma":[0.0066044033,0.00039909,0.0013513145,0.0016849234,0.0016782241,0.0025419646,0.0029031413,0.0029932472,0.043781854],"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.000107744025,0.000044122018,0.00062965415,0.0006345145,0.00012331044,0.00011000875,0.0001927963,0.0015470388,0.0011694233,0.06122337,0.7972373,0.1369807],"study_design_scores_gemma":[0.000013047489,0.000037303034,0.00095111167,0.00025064417,0.000022968936,0.00022519403,0.00013759798,0.0012108143,0.00028584557,0.026580863,0.9702636,0.000020970774],"about_ca_topic_score_codex":0.0014687896,"about_ca_topic_score_gemma":0.0025875424,"teacher_disagreement_score":0.12012228,"about_ca_system_score_codex":0.002113365,"about_ca_system_score_gemma":0.0026127347,"threshold_uncertainty_score":0.4018491},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2602092,0.00069937203,0.597404,0.0007892059,0.00022565588,0.00014476497,0.0009846482,0.0009317551,0.13861133],"genre_scores_gemma":[0.7689601,0.0007073295,0.15861584,0.000308138,0.00019694086,0.00019573857,0.0015869129,0.0008143118,0.06861481],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990521,0.000119372155,0.000051515435,0.000261726,0.00043089435,0.00008435178],"domain_scores_gemma":[0.99740714,0.00095571566,0.0003228983,0.00071383436,0.00031937056,0.00028102144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043471772,0.00060483796,0.00068991655,0.0019661298,0.0010727369,0.002143287,0.0013255652,0.0011636767,0.014824857],"category_scores_gemma":[0.0044576093,0.0006718254,0.0005381249,0.0012221867,0.0014896074,0.003492263,0.0034993887,0.0027019393,0.0026661085],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010568228,0.00007511799,0.0012897811,0.0001320424,0.000023544906,0.00028194147,0.0003560629,0.011559484,0.009648814,0.8979702,0.004121918,0.0744353],"study_design_scores_gemma":[0.000037597827,0.00013649437,0.0026369803,0.00010146903,0.000038953087,0.0012819415,0.00041542272,0.07095849,0.018354872,0.8517491,0.054250274,0.000038449227],"about_ca_topic_score_codex":0.00031339077,"about_ca_topic_score_gemma":0.000463022,"teacher_disagreement_score":0.014824857,"about_ca_system_score_codex":0.00042221116,"about_ca_system_score_gemma":0.00021914537,"threshold_uncertainty_score":0.049594104},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.64757884,0.0006555919,0.33018672,0.00024058677,0.00011215234,0.000111217705,0.0007006006,0.0005683136,0.019845968],"genre_scores_gemma":[0.868611,0.00045986683,0.12235632,0.00005989943,0.000035510227,0.000087754815,0.0011259398,0.00010870544,0.0071549197],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99870634,0.00028332492,0.000078386125,0.00020818059,0.0004700379,0.00025379527],"domain_scores_gemma":[0.9979487,0.00089271273,0.00032378273,0.000477394,0.00018769389,0.00016962955],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047199967,0.00043127715,0.0006086276,0.00088540494,0.00089253817,0.0013400454,0.00085049967,0.00056817936,0.0062891687],"category_scores_gemma":[0.0024751767,0.00047668646,0.0005100896,0.0016006412,0.001438082,0.0016846491,0.002999706,0.00093367853,0.0010655584],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015932266,0.00020100053,0.016117025,0.00061222207,0.000119138786,0.0016966879,0.0015946197,0.19804701,0.034823418,0.4855452,0.009050456,0.2506],"study_design_scores_gemma":[0.00007966143,0.0002268843,0.006325793,0.00014372038,0.000041638516,0.0018256145,0.0016138802,0.39081663,0.028756278,0.5390019,0.031106586,0.00006148054],"about_ca_topic_score_codex":0.00071364123,"about_ca_topic_score_gemma":0.00085405103,"teacher_disagreement_score":0.0062891687,"about_ca_system_score_codex":0.00036948238,"about_ca_system_score_gemma":0.00024494686,"threshold_uncertainty_score":0.021039307},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17183442,0.00073042506,0.8070853,0.00076631375,0.00009049404,0.00007330185,0.00022105456,0.00030984532,0.018888785],"genre_scores_gemma":[0.8432108,0.00040553702,0.14956081,0.00012272575,0.000047347396,0.0001324554,0.00023250085,0.00015284162,0.006134848],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99948066,0.00018606609,0.000016864014,0.00011118261,0.00009710994,0.0001080964],"domain_scores_gemma":[0.99888223,0.0006917833,0.00013664406,0.0001485209,0.000070257076,0.000070490496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006132062,0.0007282111,0.00085256185,0.0005394596,0.00056064717,0.0008966903,0.0008379235,0.0010957484,0.0034075303],"category_scores_gemma":[0.0032663113,0.00056571414,0.00074259104,0.000725278,0.0014818558,0.0011499817,0.001680413,0.0007494679,0.00037923412],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007285874,0.00001570463,0.00034102483,0.00007061039,0.000017754961,0.00006534841,0.000055434513,0.95131737,0.0013371522,0.03459322,0.0010388363,0.011074713],"study_design_scores_gemma":[0.000016127267,0.000047352416,0.00011705303,0.000010472378,0.0000082564275,0.000037484933,0.00003295338,0.9653485,0.00076622784,0.03235492,0.0012521585,0.00000853258],"about_ca_topic_score_codex":0.002016504,"about_ca_topic_score_gemma":0.0016727574,"teacher_disagreement_score":0.0034075303,"about_ca_system_score_codex":0.0009272223,"about_ca_system_score_gemma":0.00041671254,"threshold_uncertainty_score":0.011399329},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11944813,0.00055392506,0.39373693,0.00041857062,0.001126298,0.0003981198,0.0020112256,0.0023578394,0.47994906],"genre_scores_gemma":[0.6895078,0.0007667603,0.11488973,0.00035943926,0.00012311489,0.00029871488,0.003949693,0.0014532602,0.18865153],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997304,0.000017969136,0.000010832999,0.00006594247,0.00010243794,0.00007229886],"domain_scores_gemma":[0.99976784,0.000029343568,0.000019842357,0.00008977137,0.000059694696,0.0000335015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012464909,0.00064337923,0.00048464254,0.00088005303,0.0009205991,0.0012260515,0.0006924008,0.00052154926,0.052609615],"category_scores_gemma":[0.0008592514,0.0003226425,0.00051053014,0.0006048613,0.0007682355,0.0011586926,0.0019482883,0.0011959614,0.008580929],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044469116,0.00011307309,0.0014574982,0.000251802,0.000020842088,0.0013984045,0.00038081352,0.014508247,0.029589504,0.4265651,0.033293895,0.4919761],"study_design_scores_gemma":[0.00009712877,0.00031216233,0.0019713694,0.00015882024,0.000050736206,0.0027983426,0.00085646467,0.055858742,0.06809918,0.33489496,0.53484124,0.000060877697],"about_ca_topic_score_codex":0.000570188,"about_ca_topic_score_gemma":0.00073386723,"teacher_disagreement_score":0.052609615,"about_ca_system_score_codex":0.0002893001,"about_ca_system_score_gemma":0.0003161619,"threshold_uncertainty_score":0.17599672},"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":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027697928,0.002305482,0.19752409,0.0011182647,0.0015247858,0.00009510545,0.0007571358,0.00096434605,0.7680128],"genre_scores_gemma":[0.5005474,0.0046736877,0.07869927,0.00096155226,0.0008789442,0.00012334695,0.0021036651,0.0014963027,0.41051584],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996117,0.000029224799,0.000018413348,0.00012967738,0.00012770772,0.00008319045],"domain_scores_gemma":[0.9995964,0.000081638835,0.00003956446,0.00010303437,0.000113874,0.000065429325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002039008,0.00065272383,0.0005244861,0.00090523047,0.00088239997,0.0019846861,0.0006385977,0.000561737,0.025154022],"category_scores_gemma":[0.0011985187,0.00040029862,0.00059587567,0.00073427433,0.0013955953,0.002789511,0.0019803594,0.002619316,0.0068991096],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055449316,0.000020056039,0.00020118884,0.00013159805,0.000010998652,0.00010792756,0.00021912192,0.00061616406,0.003938868,0.8873412,0.019910092,0.08744731],"study_design_scores_gemma":[0.000013583736,0.0000352686,0.00040580457,0.00006041943,0.000019138044,0.0005429778,0.0001472433,0.0020969647,0.005007201,0.81059986,0.18105417,0.000017335962],"about_ca_topic_score_codex":0.00093126454,"about_ca_topic_score_gemma":0.0008002219,"teacher_disagreement_score":0.025154022,"about_ca_system_score_codex":0.0005672343,"about_ca_system_score_gemma":0.0004980426,"threshold_uncertainty_score":0.084148586},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02657094,0.0034220181,0.17789347,0.0135252215,0.009678668,0.00020270795,0.000693268,0.001703811,0.7663098],"genre_scores_gemma":[0.29979894,0.0023726057,0.047964275,0.0031353598,0.001699768,0.0002817434,0.0009130824,0.0013394193,0.6424948],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99817085,0.0003974796,0.000067964174,0.00051432237,0.0005442792,0.00030510628],"domain_scores_gemma":[0.9975314,0.00054659497,0.00012153501,0.00077632564,0.0006520413,0.0003721336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001243741,0.00085405784,0.0010000445,0.0026803175,0.004681005,0.005433023,0.001641715,0.003199956,0.13076887],"category_scores_gemma":[0.010354124,0.00053698174,0.00092679623,0.002148937,0.004128079,0.008173394,0.0058229454,0.0028576346,0.03342302],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014699939,0.000020313415,0.0004035929,0.00009555358,0.000019427778,0.000262111,0.00065508316,0.0015581803,0.0011769156,0.8718735,0.044885244,0.078903034],"study_design_scores_gemma":[0.00002985701,0.00006393431,0.00043776986,0.00019628175,0.000034691002,0.00041513218,0.000977049,0.006344373,0.0016477542,0.4477267,0.542076,0.0000504433],"about_ca_topic_score_codex":0.0023556566,"about_ca_topic_score_gemma":0.0019605714,"teacher_disagreement_score":0.13076887,"about_ca_system_score_codex":0.0013817318,"about_ca_system_score_gemma":0.0012578233,"threshold_uncertainty_score":0.43746543},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43446478,0.0005133339,0.5181452,0.00020707076,0.00019442072,0.00016078725,0.00038799635,0.00042770788,0.045498572],"genre_scores_gemma":[0.8104162,0.0004137361,0.17102112,0.0001120691,0.00003369218,0.00026631757,0.00071294885,0.00026663626,0.016757224],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99975115,0.000043409706,0.00001055224,0.000056204302,0.0000959716,0.00004267276],"domain_scores_gemma":[0.999796,0.000075978525,0.00003561728,0.000040477153,0.000027481172,0.00002442313],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018829857,0.0003612219,0.00028945986,0.00042977117,0.00046264127,0.00094065437,0.00040349519,0.00057438173,0.005167689],"category_scores_gemma":[0.00047854419,0.0002564887,0.00074524205,0.00029367677,0.00088076567,0.00049991254,0.0006008879,0.0005181523,0.0006167241],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022280696,0.00013226482,0.0016707975,0.00032093446,0.00006779965,0.0008528103,0.000441295,0.49178806,0.048016675,0.40308973,0.0027669277,0.050629873],"study_design_scores_gemma":[0.0001474069,0.00035781655,0.0022414501,0.00006220506,0.000044665627,0.000832535,0.0006057462,0.82892287,0.022886684,0.11375267,0.030061636,0.00008429597],"about_ca_topic_score_codex":0.0006914074,"about_ca_topic_score_gemma":0.0006500983,"teacher_disagreement_score":0.005167689,"about_ca_system_score_codex":0.0003441989,"about_ca_system_score_gemma":0.0002689022,"threshold_uncertainty_score":0.017287672},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17082562,0.0010441485,0.78884757,0.00088422705,0.0004179423,0.00028016535,0.00083299464,0.0017472778,0.03512013],"genre_scores_gemma":[0.47671458,0.0011755093,0.4856338,0.0005779541,0.00034168042,0.00028200386,0.0022068373,0.0022562742,0.030811286],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99920267,0.00019193535,0.000051875824,0.00022352864,0.00025024184,0.000079652884],"domain_scores_gemma":[0.9970722,0.0009783107,0.00025015234,0.0011710789,0.000269277,0.00025894234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008205922,0.001086126,0.0014911459,0.0012487313,0.0008394808,0.0025992498,0.0021530513,0.0014649405,0.01779742],"category_scores_gemma":[0.005363973,0.00054952345,0.000862093,0.0015927469,0.0013500891,0.0053570066,0.0026266836,0.002554116,0.0029574148],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006035625,0.0006932373,0.001796464,0.00078545423,0.00010308411,0.00030455104,0.0007062255,0.20997846,0.012199353,0.48190498,0.024971945,0.26595262],"study_design_scores_gemma":[0.00011744012,0.00016679849,0.00047616355,0.000093322094,0.00006118427,0.00021841934,0.00030715234,0.3392701,0.0056989286,0.63838863,0.015160107,0.000041749674],"about_ca_topic_score_codex":0.0010626601,"about_ca_topic_score_gemma":0.0022665414,"teacher_disagreement_score":0.01779742,"about_ca_system_score_codex":0.00064034236,"about_ca_system_score_gemma":0.0005962708,"threshold_uncertainty_score":0.059538245},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9292394,0.0006609328,0.05605115,0.00011265444,0.000048426384,0.000019022405,0.0002098511,0.00017223008,0.013486444],"genre_scores_gemma":[0.9659216,0.0004773668,0.031571046,0.000028329709,0.000022268328,0.000019842899,0.00035801332,0.00008215591,0.0015193163],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99960786,0.00009992159,0.00002545687,0.00011454472,0.00009456156,0.00005758138],"domain_scores_gemma":[0.9958793,0.0025112368,0.00067265093,0.0003197337,0.00033274607,0.00028432632],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00097433716,0.00045315374,0.00035542337,0.002491975,0.0008440816,0.0011766747,0.00050990906,0.00037873408,0.003704304],"category_scores_gemma":[0.0052965465,0.00030961976,0.0005055645,0.0015269207,0.0017605318,0.0022156758,0.000763281,0.0007525499,0.0003530042],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00075846195,0.00014453939,0.028867994,0.00043893082,0.000101528996,0.00072712346,0.0018563836,0.12435727,0.02292642,0.73174584,0.004865375,0.083210066],"study_design_scores_gemma":[0.000043622567,0.00040666424,0.02008885,0.00016279085,0.00010329327,0.0020130975,0.0009521046,0.20264916,0.018448332,0.7419254,0.013086392,0.00012032258],"about_ca_topic_score_codex":0.0007663344,"about_ca_topic_score_gemma":0.0009899989,"teacher_disagreement_score":0.003704304,"about_ca_system_score_codex":0.0006356815,"about_ca_system_score_gemma":0.0003180038,"threshold_uncertainty_score":0.012392163},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034634564,0.0011354627,0.95849466,0.00022626382,0.000054908116,0.00014537144,0.00047093426,0.0010281777,0.0038096237],"genre_scores_gemma":[0.3933256,0.0011078826,0.5954718,0.00025415173,0.00016974188,0.00035425555,0.002380319,0.00051151495,0.006424765],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99573046,0.0008858012,0.0004103298,0.0011750851,0.0014227415,0.00037561057],"domain_scores_gemma":[0.99203277,0.004509633,0.00073606346,0.0017275232,0.00072432513,0.00026972516],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016883615,0.0011333493,0.003450184,0.0017930013,0.0010457569,0.0029471533,0.0031210808,0.0019487814,0.00581868],"category_scores_gemma":[0.011567861,0.0007477767,0.001492261,0.003480547,0.0015039673,0.007670577,0.004349156,0.0013728341,0.0011187345],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009593884,0.00030202055,0.0085807685,0.0013971791,0.00028256016,0.0009845968,0.0012113518,0.29869184,0.019751467,0.091805436,0.013352253,0.5626811],"study_design_scores_gemma":[0.00007906919,0.00044604848,0.0019670874,0.00014447403,0.00009612561,0.0017464262,0.00048380953,0.8751045,0.013789478,0.08649605,0.01954128,0.00010572759],"about_ca_topic_score_codex":0.0014191659,"about_ca_topic_score_gemma":0.0009941122,"teacher_disagreement_score":0.00581868,"about_ca_system_score_codex":0.0005033821,"about_ca_system_score_gemma":0.0007394566,"threshold_uncertainty_score":0.019465446},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5458966,0.0010019715,0.3072282,0.00073311717,0.0005358602,0.00010063465,0.00086562254,0.0007851903,0.14285283],"genre_scores_gemma":[0.90077543,0.00049820903,0.07205628,0.00013587842,0.00013680251,0.00009638835,0.0006353271,0.00037591896,0.02528975],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993216,0.0001538455,0.000047299145,0.0001666361,0.00019605136,0.00011456729],"domain_scores_gemma":[0.9974305,0.0011280323,0.0004385286,0.00031016677,0.00035727973,0.00033552377],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007960439,0.00047756356,0.000363688,0.0027476156,0.0011327534,0.0026063195,0.0008329465,0.0007796428,0.013599238],"category_scores_gemma":[0.005331482,0.00039904437,0.0004809127,0.0017469415,0.0017519639,0.0032839254,0.0014862254,0.0013812509,0.0016348127],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007322516,0.000024932191,0.001123437,0.000058957707,0.0000121611465,0.00016272164,0.00034306475,0.0025859757,0.0020404707,0.971183,0.003620434,0.018771522],"study_design_scores_gemma":[0.000017300967,0.00006606874,0.0017589859,0.00006458912,0.000034228553,0.00081414846,0.00037507105,0.017746726,0.005503233,0.94969946,0.023886748,0.000033410528],"about_ca_topic_score_codex":0.0006588051,"about_ca_topic_score_gemma":0.0008414761,"teacher_disagreement_score":0.013599238,"about_ca_system_score_codex":0.00074781134,"about_ca_system_score_gemma":0.00039411828,"threshold_uncertainty_score":0.04549402},"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":"editorial","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00033691907,0.010544101,0.0042444207,0.06343377,0.87227803,0.00009934109,0.0020093026,0.0007896895,0.04626452],"genre_scores_gemma":[0.015465426,0.025399543,0.009113001,0.060381282,0.22100829,0.0004041961,0.005420905,0.002340554,0.66046673],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.995135,0.0009312491,0.0005232904,0.0008440225,0.0021677832,0.00039863895],"domain_scores_gemma":[0.98772544,0.002668399,0.0004150602,0.0010194412,0.0076585575,0.00051306986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026896503,0.0027519725,0.0035847572,0.0067584394,0.004153973,0.0040818583,0.005341647,0.0047776927,0.114670105],"category_scores_gemma":[0.022459498,0.0012903179,0.0028276986,0.0051568043,0.002970246,0.0054026656,0.0027424595,0.006257552,0.05799192],"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.000032600467,0.000010851831,0.000039474562,0.00018618094,0.000015894062,0.000062832565,0.000019262121,0.000105064515,0.00005910843,0.0042034844,0.98862725,0.0066379965],"study_design_scores_gemma":[0.00003911053,0.00003962858,0.0011615534,0.00027571822,0.000055720015,0.00026178,0.00006520185,0.00084671885,0.0005393829,0.01976826,0.976872,0.00007485367],"about_ca_topic_score_codex":0.032745693,"about_ca_topic_score_gemma":0.03720676,"teacher_disagreement_score":0.114670105,"about_ca_system_score_codex":0.008026682,"about_ca_system_score_gemma":0.0031303999,"threshold_uncertainty_score":0.3836097},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47166106,0.00040978205,0.4532545,0.0009787858,0.00025276633,0.0001682156,0.00073219714,0.0006199982,0.071922764],"genre_scores_gemma":[0.89609003,0.00027030372,0.08215757,0.00018926708,0.00004133104,0.00012957878,0.0007207584,0.00020922442,0.020191843],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99979573,0.000028960889,0.000008691822,0.00004546729,0.00006868781,0.000052477666],"domain_scores_gemma":[0.9995351,0.00012360571,0.00005389392,0.0000807254,0.000122799,0.00008387976],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002705359,0.0004449874,0.0004909945,0.0011127176,0.0008701821,0.000789134,0.0005891729,0.0007203927,0.011908456],"category_scores_gemma":[0.0026150045,0.00021289059,0.00033536053,0.0006696529,0.0007970664,0.00090244145,0.0015317352,0.0013721948,0.0012799694],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015165294,0.0002941055,0.0049965354,0.0002833486,0.000069905065,0.00079695304,0.0005225713,0.15572509,0.04375528,0.56058675,0.0123283025,0.21912464],"study_design_scores_gemma":[0.0001346974,0.0005008237,0.0027585225,0.00008158302,0.000054149266,0.00076780515,0.0006592649,0.3738786,0.034467526,0.559068,0.027570529,0.000058473484],"about_ca_topic_score_codex":0.0010011967,"about_ca_topic_score_gemma":0.00095346494,"teacher_disagreement_score":0.011908456,"about_ca_system_score_codex":0.0005861385,"about_ca_system_score_gemma":0.0003840839,"threshold_uncertainty_score":0.039837718},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13766961,0.0018008952,0.8155966,0.005432308,0.00026709802,0.00019975836,0.0015843132,0.0021059185,0.03534354],"genre_scores_gemma":[0.686157,0.0021942775,0.2879673,0.00067890034,0.00046591388,0.00043024,0.0037131498,0.0016563614,0.016736833],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99591064,0.0014683909,0.0002423565,0.0006630709,0.001281324,0.00043420788],"domain_scores_gemma":[0.9593671,0.031442583,0.0016800242,0.0052221618,0.0013300666,0.00095808454],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030297716,0.0013628535,0.0022432168,0.0020130696,0.001865592,0.006866141,0.0050547533,0.0026580342,0.0220753],"category_scores_gemma":[0.039063558,0.0014773605,0.0022480558,0.0044782246,0.003400094,0.018750355,0.0060310317,0.005773583,0.0021013923],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00056752044,0.00022852639,0.003959327,0.0005154978,0.00013814836,0.00021630543,0.00066439906,0.27367836,0.0033507636,0.6001336,0.016794527,0.09975305],"study_design_scores_gemma":[0.000055767796,0.000030254914,0.00046997954,0.000029879458,0.000042488784,0.00007868406,0.00009336249,0.45493075,0.00082381937,0.5404222,0.003001549,0.000021244927],"about_ca_topic_score_codex":0.0057644974,"about_ca_topic_score_gemma":0.00685404,"teacher_disagreement_score":0.0220753,"about_ca_system_score_codex":0.0043086144,"about_ca_system_score_gemma":0.0024283933,"threshold_uncertainty_score":0.0738492},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13618746,0.0007988576,0.8531655,0.00032846298,0.00004378324,0.00008478098,0.00036520377,0.00035147072,0.008674375],"genre_scores_gemma":[0.5023146,0.0011103047,0.4883242,0.0001823495,0.00007856221,0.00029577335,0.0019698725,0.0003305303,0.0053938017],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990128,0.00023623648,0.000100792204,0.00019474693,0.00035809298,0.000097296375],"domain_scores_gemma":[0.9950772,0.0025853284,0.0007136227,0.00039636562,0.00077110995,0.00045636503],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011271874,0.0005665621,0.0006677954,0.0019205111,0.00095570093,0.0013855255,0.0014713171,0.00079319224,0.00419579],"category_scores_gemma":[0.0110705625,0.0006441999,0.0006148337,0.0012958995,0.0010834349,0.003116562,0.0026058087,0.0014552099,0.0010454645],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039998943,0.00013559926,0.0061407,0.0007589539,0.000073743584,0.0008192657,0.00199628,0.2747719,0.027106134,0.51058686,0.005267805,0.17194274],"study_design_scores_gemma":[0.00004131469,0.00020046871,0.0015164425,0.00018686507,0.000023527225,0.0008976446,0.0005825572,0.6599999,0.008908005,0.3150962,0.012500393,0.000046615503],"about_ca_topic_score_codex":0.00089860824,"about_ca_topic_score_gemma":0.0010805714,"teacher_disagreement_score":0.00419579,"about_ca_system_score_codex":0.0009437716,"about_ca_system_score_gemma":0.00043745304,"threshold_uncertainty_score":0.014036298},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08050033,0.0007162687,0.89968425,0.0007366908,0.00012847302,0.00011977834,0.0013568904,0.007257002,0.009500261],"genre_scores_gemma":[0.6240528,0.000609919,0.35935542,0.0004157767,0.00012539628,0.00049870944,0.0044782283,0.00089356775,0.009570132],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99841785,0.00021478241,0.00011774898,0.00041157618,0.000561847,0.00027619433],"domain_scores_gemma":[0.99705505,0.00057622045,0.00020355791,0.0017739963,0.00026870437,0.00012242366],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007075112,0.00076278695,0.0012555084,0.0008050642,0.0009362686,0.0023240768,0.0055365744,0.0014158012,0.009225329],"category_scores_gemma":[0.004324776,0.0006409361,0.0008055814,0.0026646978,0.0013136951,0.008777648,0.007411817,0.0017397394,0.002786144],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0022066948,0.0003302385,0.0048831436,0.0006744868,0.00014769785,0.0005449757,0.0005832678,0.35555804,0.030803695,0.17880227,0.035734687,0.38973093],"study_design_scores_gemma":[0.00024100005,0.00031453653,0.0006652283,0.00006846716,0.000061614184,0.0004593778,0.0002759311,0.7884561,0.025315737,0.15144329,0.032629993,0.0000687979],"about_ca_topic_score_codex":0.0020902706,"about_ca_topic_score_gemma":0.002244387,"teacher_disagreement_score":0.009225329,"about_ca_system_score_codex":0.0010239937,"about_ca_system_score_gemma":0.0010301459,"threshold_uncertainty_score":0.030861855},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28050873,0.005082573,0.54320186,0.0018170773,0.00094753195,0.00010984347,0.0018575888,0.0016290832,0.16484573],"genre_scores_gemma":[0.81167763,0.0025867322,0.15120852,0.0010879353,0.00042396056,0.00017586205,0.0018923765,0.0007394144,0.030207405],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99873644,0.00021494339,0.0000953519,0.00039491875,0.0003303985,0.00022792834],"domain_scores_gemma":[0.99869066,0.00045536523,0.00014224283,0.00035285723,0.00018754006,0.00017134882],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006555286,0.0008025174,0.00074187276,0.00075525226,0.0007969961,0.0017037424,0.0009508845,0.0012204058,0.011993058],"category_scores_gemma":[0.005399725,0.0003925472,0.00059146393,0.0008445213,0.0015578356,0.0044277282,0.0029105588,0.0017010585,0.0036959946],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019765283,0.00005216587,0.00077018526,0.00031629266,0.000032374744,0.00012275143,0.00020992453,0.028660482,0.01087394,0.8789818,0.009483863,0.07029851],"study_design_scores_gemma":[0.000025591447,0.00013083311,0.00044169,0.00007398905,0.000018726425,0.00020028568,0.00014023298,0.03914063,0.005369598,0.93429136,0.020133259,0.00003381565],"about_ca_topic_score_codex":0.00035100768,"about_ca_topic_score_gemma":0.00074523315,"teacher_disagreement_score":0.011993058,"about_ca_system_score_codex":0.0007361788,"about_ca_system_score_gemma":0.00049425825,"threshold_uncertainty_score":0.04012078},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35765356,0.00066068134,0.6264122,0.00035832895,0.00008136728,0.000097188495,0.000683043,0.0006534408,0.013400167],"genre_scores_gemma":[0.7385189,0.00033960846,0.25147638,0.00007063082,0.000050455576,0.00012834983,0.0010097657,0.00039094134,0.008014994],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99927694,0.00021651546,0.000044554585,0.000116048206,0.00023723012,0.00010880127],"domain_scores_gemma":[0.9981267,0.0009488632,0.00014950609,0.0004357879,0.00018812505,0.00015101906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004839741,0.00080402876,0.0014792341,0.0011204915,0.0007719951,0.0014076768,0.0012976725,0.0011720189,0.0051811505],"category_scores_gemma":[0.006123016,0.00071593584,0.00066899334,0.0010910201,0.00086524733,0.0017669483,0.0028781963,0.00101714,0.00073937385],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015401979,0.00018657645,0.0057325037,0.00072373124,0.00011719392,0.0004936404,0.00077223656,0.5177103,0.030889431,0.17604347,0.012476049,0.25331458],"study_design_scores_gemma":[0.00006950438,0.0002299202,0.0016944623,0.000046746463,0.000026227266,0.0003925393,0.00020059085,0.8354889,0.010680746,0.14408194,0.0070667625,0.000021590733],"about_ca_topic_score_codex":0.0013099088,"about_ca_topic_score_gemma":0.0010250391,"teacher_disagreement_score":0.0051811505,"about_ca_system_score_codex":0.0005582918,"about_ca_system_score_gemma":0.0003676318,"threshold_uncertainty_score":0.017332733},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014232269,0.0005790573,0.98017037,0.00032512203,0.0000790195,0.00012789975,0.00033914068,0.000441736,0.0037054315],"genre_scores_gemma":[0.1765177,0.0005081672,0.81084913,0.0002024776,0.00007125481,0.00037476904,0.0014412418,0.0004596864,0.009575568],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988232,0.00026094762,0.00008485733,0.00032873306,0.00033742667,0.00016473432],"domain_scores_gemma":[0.9986866,0.00064074085,0.00016500452,0.00018107102,0.00021680769,0.000109791516],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016725168,0.0019035728,0.0020586015,0.0018760605,0.0011682269,0.0016398912,0.0022288626,0.0024810408,0.008219051],"category_scores_gemma":[0.0048969034,0.0008320589,0.0014826363,0.0018613385,0.0013017853,0.004291027,0.0024842352,0.0019131327,0.001621976],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004391976,0.00024852192,0.0017314841,0.0007458211,0.00014489108,0.0002896179,0.00026413501,0.5476945,0.009450535,0.14150983,0.013833484,0.283648],"study_design_scores_gemma":[0.000057236808,0.00023217304,0.0004894517,0.000081674225,0.000041319807,0.00038809908,0.00010890514,0.8344922,0.004301104,0.14594692,0.013813115,0.000047732563],"about_ca_topic_score_codex":0.0033910463,"about_ca_topic_score_gemma":0.0037435598,"teacher_disagreement_score":0.008219051,"about_ca_system_score_codex":0.0019782062,"about_ca_system_score_gemma":0.001960436,"threshold_uncertainty_score":0.027495503},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44430384,0.0024840676,0.50910693,0.0029818565,0.0001752545,0.00014807146,0.00092197367,0.0004782411,0.039399855],"genre_scores_gemma":[0.9247966,0.0019950406,0.056707703,0.00037303256,0.00024182587,0.000272,0.0010176362,0.00019924005,0.014396802],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987645,0.00033353668,0.00005619137,0.00020707848,0.00045198793,0.0001867105],"domain_scores_gemma":[0.98793274,0.009300286,0.00083638023,0.0006609848,0.00058933586,0.0006802447],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095047,0.00080859585,0.0015949013,0.0026508172,0.0021331485,0.004129577,0.0030719973,0.0018583321,0.0055442434],"category_scores_gemma":[0.010944908,0.0015700317,0.0010276464,0.0034654501,0.0031109685,0.0053474237,0.0030987714,0.003511423,0.00061593927],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009697223,0.00005910943,0.0006234733,0.00013723734,0.000028380005,0.00009687656,0.00038620038,0.03828539,0.0010475453,0.9440096,0.002729021,0.012500215],"study_design_scores_gemma":[0.000023354547,0.000009974599,0.0002858973,0.000020065292,0.000016995347,0.000059811708,0.00009774787,0.050736554,0.00048673386,0.9468314,0.0014210448,0.000010407622],"about_ca_topic_score_codex":0.0020920676,"about_ca_topic_score_gemma":0.002867449,"teacher_disagreement_score":0.0055442434,"about_ca_system_score_codex":0.0019268427,"about_ca_system_score_gemma":0.00088858476,"threshold_uncertainty_score":0.018547356},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04037754,0.0003869912,0.94929224,0.00024523772,0.00013131763,0.00007553785,0.0000941469,0.000976787,0.008420177],"genre_scores_gemma":[0.43686393,0.0002348672,0.5583903,0.00008028819,0.000051832318,0.00016372293,0.000306358,0.0003380551,0.0035706328],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99946564,0.00018870267,0.000024209865,0.000045997313,0.00023842335,0.000037118552],"domain_scores_gemma":[0.99902046,0.00044173482,0.00006407335,0.0001972584,0.00022828186,0.000048206097],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085862406,0.00039693527,0.00056402094,0.00050280377,0.0004938332,0.00044669845,0.00067480345,0.00042206526,0.002461852],"category_scores_gemma":[0.0026432064,0.00016524403,0.0004999928,0.00065641163,0.0006880672,0.00048607282,0.0014281947,0.0008989122,0.0006234097],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026357488,0.00009238787,0.0017530475,0.00020828907,0.000040562703,0.00011710954,0.00014125029,0.70597786,0.013337148,0.11581806,0.003958226,0.15829255],"study_design_scores_gemma":[0.000014445232,0.0000150397,0.000108576314,0.0000046282107,0.0000019145884,0.000014267956,0.000007154639,0.985797,0.0017148046,0.01004984,0.0022675477,0.0000047259523],"about_ca_topic_score_codex":0.0022283716,"about_ca_topic_score_gemma":0.001922943,"teacher_disagreement_score":0.002461852,"about_ca_system_score_codex":0.00058847835,"about_ca_system_score_gemma":0.0008107052,"threshold_uncertainty_score":0.008235693},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033120085,0.00021988025,0.9534369,0.00016115559,0.000083033665,0.00009027629,0.00011012402,0.00057707576,0.012201418],"genre_scores_gemma":[0.42551887,0.00041480546,0.5595519,0.00011433257,0.000072640316,0.000111556634,0.00043034868,0.0012538729,0.012531653],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99941087,0.00009583469,0.000024749654,0.00011477636,0.00027305319,0.00008065197],"domain_scores_gemma":[0.999355,0.00026488464,0.00006085813,0.00017714789,0.00010018196,0.000041881507],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041426756,0.0010013107,0.0013915143,0.001188194,0.0005005605,0.0014412187,0.001376134,0.001076353,0.0068081026],"category_scores_gemma":[0.002455975,0.00083706644,0.0009921602,0.0010028124,0.0009519106,0.0011454277,0.0017936741,0.0016282169,0.0015965117],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037241649,0.00014585932,0.0012308015,0.0004166025,0.000115335155,0.00036146,0.000351753,0.539374,0.046814103,0.06786236,0.011643037,0.33131233],"study_design_scores_gemma":[0.000030164463,0.000078899146,0.00024605423,0.000028548793,0.000029988407,0.00016953253,0.000065005974,0.9553084,0.014237038,0.024428396,0.0053619067,0.000016057702],"about_ca_topic_score_codex":0.0015736686,"about_ca_topic_score_gemma":0.002570186,"teacher_disagreement_score":0.0068081026,"about_ca_system_score_codex":0.00058332516,"about_ca_system_score_gemma":0.0005446429,"threshold_uncertainty_score":0.022775352},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043044403,0.0017507086,0.9405819,0.00053311425,0.00009239158,0.00018559105,0.0018307208,0.0011857456,0.010795389],"genre_scores_gemma":[0.37494174,0.0017304387,0.610276,0.00044846768,0.0003263649,0.0007415471,0.0031826198,0.0010267354,0.0073261885],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9957182,0.0007437341,0.0003337129,0.001154839,0.00152908,0.000520547],"domain_scores_gemma":[0.98590785,0.008213669,0.0016031403,0.0022893143,0.0012646907,0.0007213457],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027571046,0.0017312373,0.0013995523,0.0055930056,0.0012874134,0.0058741225,0.0027100502,0.0019127332,0.008337174],"category_scores_gemma":[0.028042214,0.0011352391,0.0017078463,0.006050532,0.003993357,0.017403089,0.0059622894,0.003894177,0.0018910986],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044862356,0.00013751132,0.007810189,0.0005349939,0.00010265771,0.00012286437,0.0008232609,0.09507371,0.0073574395,0.71840113,0.008319153,0.16086839],"study_design_scores_gemma":[0.000054703884,0.00015318047,0.0026031418,0.00015120454,0.000060305134,0.00051996025,0.0003648442,0.24586782,0.0065204846,0.72387165,0.01974229,0.00009049577],"about_ca_topic_score_codex":0.002130705,"about_ca_topic_score_gemma":0.0027761261,"teacher_disagreement_score":0.008337174,"about_ca_system_score_codex":0.003928652,"about_ca_system_score_gemma":0.0012412604,"threshold_uncertainty_score":0.028504431},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29029852,0.02036712,0.5931749,0.018098963,0.0011103348,0.0003043333,0.0014840701,0.0006982814,0.07446344],"genre_scores_gemma":[0.8089636,0.015031201,0.14623918,0.0020904113,0.002993302,0.0004338938,0.0028911266,0.00065460365,0.020702654],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99605525,0.0016792135,0.00015140735,0.0010480237,0.0006059258,0.0004601427],"domain_scores_gemma":[0.95986867,0.03414223,0.0016849084,0.0019076162,0.0010912637,0.0013053123],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0052429335,0.0011901158,0.0021267282,0.004081864,0.004494909,0.0036182303,0.002647316,0.004213675,0.013085021],"category_scores_gemma":[0.039408345,0.0010775472,0.0017163418,0.0056003327,0.005087642,0.011087903,0.004286447,0.0049671163,0.0011763497],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038529094,0.0001913755,0.004206603,0.00068991043,0.00015073972,0.0005007556,0.0011446493,0.105163366,0.0011544111,0.78234833,0.024087066,0.079977565],"study_design_scores_gemma":[0.000045636076,0.000045616012,0.0009467063,0.00010657639,0.00003664235,0.00043336386,0.00043680632,0.053611875,0.00047032232,0.9322501,0.011591808,0.000024574387],"about_ca_topic_score_codex":0.0024681813,"about_ca_topic_score_gemma":0.0011184141,"teacher_disagreement_score":0.013085021,"about_ca_system_score_codex":0.0031248487,"about_ca_system_score_gemma":0.00082900404,"threshold_uncertainty_score":0.04377371},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7731884,0.00036982435,0.19265246,0.00067160424,0.000038371567,0.00009171931,0.0004956164,0.00073518127,0.031756885],"genre_scores_gemma":[0.9226381,0.00029690668,0.06456945,0.00014483178,0.000030946263,0.00009411602,0.0014745877,0.0002948142,0.0104563385],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99930143,0.000113534,0.000026897982,0.00021528968,0.00018604194,0.00015675763],"domain_scores_gemma":[0.99744654,0.0011445604,0.00044450013,0.00044058528,0.00026911564,0.0002548388],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044422873,0.00051548897,0.0005894618,0.0012415373,0.0015269635,0.0015963976,0.0009948375,0.0008414881,0.0064168656],"category_scores_gemma":[0.00450411,0.00058159535,0.0007357867,0.0013149142,0.0016389061,0.0039709928,0.001705729,0.0014759072,0.00081321975],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008584734,0.00019132637,0.016483106,0.00023365999,0.00008946675,0.0014699401,0.0023952671,0.09135992,0.014429656,0.7752907,0.0077059725,0.08949242],"study_design_scores_gemma":[0.00006937459,0.00024630473,0.0070148027,0.00013480472,0.00009247285,0.0012464909,0.0023071787,0.23384298,0.016704965,0.69952464,0.03874244,0.00007343829],"about_ca_topic_score_codex":0.0035787327,"about_ca_topic_score_gemma":0.002982398,"teacher_disagreement_score":0.0064168656,"about_ca_system_score_codex":0.0011159951,"about_ca_system_score_gemma":0.0004902133,"threshold_uncertainty_score":0.021466553},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.659645,0.00025180852,0.3253677,0.0002659685,0.00003562935,0.00012963035,0.0009210053,0.00057031,0.012812929],"genre_scores_gemma":[0.8663525,0.000292145,0.11993723,0.00008404049,0.000047991944,0.00015609371,0.0031165122,0.0001762385,0.009837301],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996644,0.00005206483,0.000016630907,0.00010655446,0.00008770265,0.0000725639],"domain_scores_gemma":[0.99922574,0.00022551484,0.0001527504,0.00022866938,0.0000684167,0.00009903854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022633336,0.00059732114,0.00057172397,0.0006970456,0.0005847603,0.0007127482,0.0010067016,0.0006682612,0.0052674543],"category_scores_gemma":[0.0016373518,0.00044515473,0.00058296195,0.0011067764,0.00064663275,0.0019734118,0.0013913898,0.00060046196,0.0010646132],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00067288196,0.00023900541,0.0076936428,0.00060628576,0.00015970311,0.0007984334,0.0010653497,0.60290164,0.033470053,0.14067116,0.011355827,0.20036599],"study_design_scores_gemma":[0.000067088484,0.00027948924,0.0040247967,0.000050487026,0.00005187208,0.0006272145,0.00060078915,0.7264422,0.019711908,0.2352615,0.012850566,0.000032039763],"about_ca_topic_score_codex":0.00084435433,"about_ca_topic_score_gemma":0.0015028163,"teacher_disagreement_score":0.0052674543,"about_ca_system_score_codex":0.00032129622,"about_ca_system_score_gemma":0.00021397995,"threshold_uncertainty_score":0.017621338},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5533393,0.0032428252,0.4088416,0.008419298,0.00028856893,0.00015923096,0.0034393151,0.0008928773,0.021377046],"genre_scores_gemma":[0.7569037,0.002004633,0.22817583,0.00069531635,0.0006388418,0.0003414042,0.0041195443,0.00045380273,0.006666923],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969855,0.0006825202,0.0002554091,0.0009745145,0.0006811527,0.00042089733],"domain_scores_gemma":[0.9753043,0.018289676,0.002092435,0.0018081015,0.001244314,0.0012612102],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028767884,0.0011038493,0.0019872587,0.002805703,0.0024963266,0.006908525,0.004085485,0.002369209,0.0067666415],"category_scores_gemma":[0.025661305,0.0014374952,0.0015987394,0.0034878766,0.004526687,0.012679816,0.0029417244,0.002776207,0.0007421831],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015934879,0.0003530074,0.017593488,0.0010953731,0.00019275515,0.00031168928,0.0011853972,0.25540853,0.0075921835,0.5454219,0.019549156,0.14970312],"study_design_scores_gemma":[0.00021091943,0.00015915875,0.0032814427,0.00011779,0.000090271045,0.0006211378,0.00049081014,0.44532454,0.0044619576,0.53714985,0.007985671,0.00010637138],"about_ca_topic_score_codex":0.003045309,"about_ca_topic_score_gemma":0.0027745941,"teacher_disagreement_score":0.006908525,"about_ca_system_score_codex":0.0030664722,"about_ca_system_score_gemma":0.0012798053,"threshold_uncertainty_score":0.022636712},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8994661,0.00025001017,0.079361245,0.00025859164,0.000057446643,0.00001594583,0.00006976207,0.0002356222,0.020285247],"genre_scores_gemma":[0.9920912,0.00007269556,0.0059558307,0.000043799726,0.000021904072,0.000013984221,0.000035776535,0.000035944176,0.0017288898],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998318,0.000034822067,0.000005875669,0.000046741236,0.00004356496,0.000037202546],"domain_scores_gemma":[0.99949455,0.00021374298,0.00007939164,0.00007950931,0.00004106731,0.0000916794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018125435,0.00022812028,0.0001838212,0.00076944544,0.0005165083,0.0007956003,0.0003657021,0.00041004486,0.0019544184],"category_scores_gemma":[0.0012044746,0.0001648223,0.00020659556,0.00020560241,0.0012701524,0.00094912306,0.0006522158,0.00042380558,0.000201307],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009617443,0.000053445783,0.0027533437,0.00005968896,0.00001443034,0.00023086519,0.0004605136,0.006357727,0.048140816,0.92398554,0.0012962109,0.016551238],"study_design_scores_gemma":[0.000029798883,0.00014531662,0.008588424,0.000047265396,0.0000184468,0.0009690912,0.0004900373,0.21028791,0.032934405,0.7419175,0.0045161946,0.000055616023],"about_ca_topic_score_codex":0.0004153231,"about_ca_topic_score_gemma":0.0002920885,"teacher_disagreement_score":0.0019544184,"about_ca_system_score_codex":0.0003326683,"about_ca_system_score_gemma":0.00014229937,"threshold_uncertainty_score":0.0065381527},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017601598,0.019978235,0.41690442,0.061474375,0.008338892,0.00030021043,0.007547639,0.0027806729,0.46507397],"genre_scores_gemma":[0.37137124,0.02649953,0.27796152,0.025263213,0.007571844,0.0018474844,0.011502818,0.0041677165,0.27381462],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973212,0.00048993796,0.00012261678,0.0009024212,0.0008309614,0.0003329975],"domain_scores_gemma":[0.99588937,0.0019573832,0.00019827278,0.0010313381,0.00070828915,0.00021542801],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002356828,0.0026918945,0.0019175713,0.0023500044,0.0021622665,0.0036848388,0.002386226,0.0014768983,0.039797284],"category_scores_gemma":[0.009573061,0.0009578787,0.002685637,0.0029202297,0.004304952,0.009380561,0.008578812,0.013176389,0.020304667],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018900441,0.00014082002,0.001175586,0.00056941085,0.00009166183,0.00023379407,0.0002596061,0.0041281315,0.0017701413,0.81260735,0.11514384,0.06369072],"study_design_scores_gemma":[0.000059672166,0.000032925578,0.0008042118,0.0001366324,0.000058975897,0.00022777595,0.00006908217,0.009689306,0.0016695246,0.8671279,0.12007732,0.00004660815],"about_ca_topic_score_codex":0.0057766605,"about_ca_topic_score_gemma":0.0055614086,"teacher_disagreement_score":0.039797284,"about_ca_system_score_codex":0.0033481617,"about_ca_system_score_gemma":0.0024962458,"threshold_uncertainty_score":0.13313514},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6311643,0.00047163875,0.33910057,0.0007967835,0.00008064202,0.00011323044,0.000334418,0.0002866352,0.027651662],"genre_scores_gemma":[0.95296305,0.00027352036,0.040588308,0.00016147061,0.00010589612,0.0001257556,0.0004315007,0.00009014103,0.005260345],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987991,0.00019629243,0.00008167149,0.00031026462,0.00040040238,0.00021221096],"domain_scores_gemma":[0.995977,0.0015812325,0.0010691454,0.00038598737,0.00045470102,0.000531931],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00148965,0.00040735907,0.00077123113,0.002250911,0.0012006109,0.0019060975,0.0016822675,0.0012403346,0.0062355716],"category_scores_gemma":[0.011571897,0.00064424134,0.0007663669,0.0017025069,0.001809248,0.002438502,0.0024058244,0.0011499034,0.0006294096],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019187554,0.00008580959,0.0067744977,0.00009795008,0.00004569185,0.00033727093,0.00049933005,0.04077971,0.011492299,0.91481686,0.0013659787,0.023512738],"study_design_scores_gemma":[0.00008686938,0.00017607657,0.004515199,0.000039582657,0.000044316355,0.0009234979,0.0004643249,0.2663006,0.007423115,0.7132623,0.0067104767,0.000053732343],"about_ca_topic_score_codex":0.0007994579,"about_ca_topic_score_gemma":0.00037553237,"teacher_disagreement_score":0.0062355716,"about_ca_system_score_codex":0.00123281,"about_ca_system_score_gemma":0.0004405464,"threshold_uncertainty_score":0.020860076},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2769411,0.001049185,0.68450284,0.0022263224,0.00016047532,0.00011057627,0.000502467,0.00024522594,0.034261853],"genre_scores_gemma":[0.88606596,0.00085113477,0.10178694,0.00019135098,0.00027128067,0.00021593017,0.00059861597,0.0001817678,0.009836935],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984592,0.00029895597,0.00009011435,0.00027861507,0.0007165797,0.0001565413],"domain_scores_gemma":[0.99367154,0.003890115,0.0006388769,0.00057641754,0.0006960632,0.00052704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019079997,0.0006196015,0.0009888714,0.0018611061,0.0011737132,0.002674588,0.0013216774,0.0013222805,0.0043507605],"category_scores_gemma":[0.012155583,0.0003476781,0.0011066445,0.0012309062,0.003980205,0.005855132,0.0026404446,0.0025152937,0.00032981078],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043358523,0.000009198036,0.0004806139,0.00005181942,0.000009045646,0.00004512027,0.00011823828,0.018162325,0.0007703526,0.97371453,0.00073010195,0.005865309],"study_design_scores_gemma":[0.00001610464,0.00004285987,0.00046328208,0.000013713018,0.000006815383,0.000057312704,0.00003757799,0.10986534,0.0007112925,0.8864281,0.0023386283,0.00001896476],"about_ca_topic_score_codex":0.0023764274,"about_ca_topic_score_gemma":0.0011791015,"teacher_disagreement_score":0.0043507605,"about_ca_system_score_codex":0.0024339675,"about_ca_system_score_gemma":0.0010536817,"threshold_uncertainty_score":0.017659783},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07739981,0.00014239734,0.9136963,0.00010352072,0.00005518578,0.000056097077,0.00019110358,0.00047293355,0.007882573],"genre_scores_gemma":[0.4572869,0.00028890395,0.5374987,0.000079910365,0.000023208715,0.00009723,0.0006753526,0.00025141676,0.0037983875],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994837,0.00010366445,0.00003747091,0.000061181505,0.0002558858,0.000058078378],"domain_scores_gemma":[0.9994093,0.0001418925,0.00006601698,0.00018803618,0.00014436194,0.00005041699],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038439358,0.000402411,0.00053709664,0.00073942606,0.00044018184,0.0010829706,0.00063793774,0.00076682714,0.0023316727],"category_scores_gemma":[0.0015767344,0.0005430621,0.0006930174,0.0007122006,0.0010659691,0.0009973504,0.0016371656,0.0007167793,0.0009260199],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013490788,0.00004376765,0.0020994372,0.00022349405,0.000042504565,0.0007173508,0.0006924715,0.4786042,0.058493804,0.36314055,0.0047237095,0.09108377],"study_design_scores_gemma":[0.00003462711,0.0000614249,0.0005496882,0.00005361382,0.000011340758,0.000425227,0.0002054746,0.8301245,0.014207789,0.13984421,0.014444554,0.000037595837],"about_ca_topic_score_codex":0.0010222138,"about_ca_topic_score_gemma":0.0015331651,"teacher_disagreement_score":0.0023316727,"about_ca_system_score_codex":0.00043858855,"about_ca_system_score_gemma":0.000549058,"threshold_uncertainty_score":0.0078002214},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.668217,0.002572923,0.28286397,0.0038215797,0.0001356075,0.00019601363,0.0011324289,0.0008897544,0.040170744],"genre_scores_gemma":[0.97110534,0.0006725292,0.023302602,0.0003423102,0.00012024552,0.00018453664,0.0006029134,0.000178695,0.0034907782],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980811,0.00047175307,0.00008733539,0.00049130095,0.0005366718,0.00033177066],"domain_scores_gemma":[0.9775344,0.014629129,0.0033178683,0.0016518513,0.0012477565,0.0016190528],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017222374,0.00061501504,0.0010307173,0.003096585,0.00093293464,0.0027075114,0.0018585684,0.001547164,0.005385],"category_scores_gemma":[0.02426153,0.0005933588,0.0007984271,0.0016995448,0.0028301023,0.0042503085,0.002590113,0.0022062873,0.00062741584],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00053685927,0.000138864,0.004195656,0.00024264432,0.000066516055,0.00026808324,0.00039870493,0.10891938,0.0077513447,0.85221684,0.0053193267,0.019945791],"study_design_scores_gemma":[0.00008764568,0.00014470176,0.0031831125,0.000060796723,0.00005358629,0.0004882346,0.00019922161,0.32734638,0.0052751144,0.6591259,0.0039713145,0.00006387382],"about_ca_topic_score_codex":0.0010839404,"about_ca_topic_score_gemma":0.0006184157,"teacher_disagreement_score":0.005385,"about_ca_system_score_codex":0.0023636646,"about_ca_system_score_gemma":0.00056058785,"threshold_uncertainty_score":0.01801467},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16623268,0.09647356,0.5497776,0.06261052,0.0050859787,0.00024677673,0.0050047436,0.012120353,0.102447756],"genre_scores_gemma":[0.7745512,0.029323608,0.15289564,0.008570728,0.0029393318,0.0004682925,0.002739552,0.007034225,0.021477358],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9932029,0.0012063404,0.00032681724,0.002144018,0.0019409474,0.0011789936],"domain_scores_gemma":[0.9735294,0.014637308,0.0013205393,0.006797201,0.0022821608,0.0014333425],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046187467,0.0029952487,0.0025728042,0.0022417093,0.0029044142,0.0071413456,0.0046861484,0.00548585,0.014358137],"category_scores_gemma":[0.04234493,0.0015007228,0.001552858,0.0040392666,0.004128883,0.033564888,0.004225181,0.006407524,0.008527603],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00324994,0.00056848885,0.012792802,0.0022660992,0.0004470609,0.0005122891,0.00089396536,0.11828486,0.028091205,0.19869718,0.08347127,0.5507249],"study_design_scores_gemma":[0.0002092942,0.001114021,0.005933082,0.0010209581,0.0004010514,0.0019568754,0.0009632069,0.2871178,0.024782693,0.57101315,0.10517858,0.00030932724],"about_ca_topic_score_codex":0.0057589062,"about_ca_topic_score_gemma":0.004075896,"teacher_disagreement_score":0.014358137,"about_ca_system_score_codex":0.0041653975,"about_ca_system_score_gemma":0.0026084734,"threshold_uncertainty_score":0.04803276},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42400447,0.0008418346,0.51153266,0.0010373265,0.00014186652,0.00012019108,0.00046456791,0.000520409,0.061336674],"genre_scores_gemma":[0.9010451,0.0012629238,0.0740225,0.00052553427,0.00018442524,0.00023811929,0.0007578075,0.00021484279,0.021748805],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994122,0.00011242833,0.000020314628,0.00019296275,0.00014620717,0.00011589601],"domain_scores_gemma":[0.99839824,0.00062856165,0.00030894572,0.00020728225,0.0001929406,0.00026399104],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062314625,0.0009017753,0.0006468944,0.0012039033,0.0012693089,0.0015821091,0.0010516614,0.0013520205,0.0060597816],"category_scores_gemma":[0.0031838391,0.00046427833,0.00067281246,0.0011010099,0.0016392056,0.0026337663,0.0019990506,0.0012399944,0.0010239191],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005030904,0.000034707893,0.0009184554,0.00006116864,0.000019966468,0.0002418058,0.00016281563,0.025285302,0.0042597777,0.95484006,0.0021769104,0.011948784],"study_design_scores_gemma":[0.000030182333,0.00010506867,0.00086802023,0.00005049145,0.000022401302,0.00063597836,0.00022217364,0.10058797,0.0021925012,0.88548034,0.009775994,0.000028893606],"about_ca_topic_score_codex":0.00040200437,"about_ca_topic_score_gemma":0.0005550938,"teacher_disagreement_score":0.0060597816,"about_ca_system_score_codex":0.0007205558,"about_ca_system_score_gemma":0.0004148643,"threshold_uncertainty_score":0.020272017},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013161217,0.00041339657,0.9816363,0.00032334006,0.000052670526,0.00007969419,0.00013489815,0.0004602462,0.003738285],"genre_scores_gemma":[0.22386903,0.0006754272,0.7703187,0.00017890417,0.00012924765,0.00033305082,0.00070866436,0.00025512645,0.0035318073],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981846,0.0005357361,0.00009996057,0.00032194605,0.00060726196,0.0002505136],"domain_scores_gemma":[0.9958364,0.0023202947,0.0003692289,0.0009248923,0.00037522797,0.00017401612],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018524377,0.0014789468,0.0015005977,0.0017315957,0.0008884896,0.0024380635,0.0036209663,0.0016299085,0.0051035746],"category_scores_gemma":[0.010864691,0.0006918658,0.0014980828,0.003477092,0.0011209553,0.0039971713,0.0030472032,0.0030011453,0.0014280955],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040400182,0.00027188432,0.0009728216,0.00037808935,0.00009997487,0.0001164741,0.00029411836,0.5940712,0.003922936,0.19367942,0.009758626,0.1960305],"study_design_scores_gemma":[0.0000529053,0.00004642494,0.00011860282,0.000025899244,0.00001814334,0.00007520148,0.000043662465,0.8770641,0.001862978,0.118005544,0.0026719354,0.000014550832],"about_ca_topic_score_codex":0.0011893758,"about_ca_topic_score_gemma":0.0015855725,"teacher_disagreement_score":0.0051035746,"about_ca_system_score_codex":0.002025583,"about_ca_system_score_gemma":0.0010872512,"threshold_uncertainty_score":0.017073214},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4507158,0.00073670084,0.5253701,0.00034807678,0.000100867335,0.00020588713,0.00052807224,0.00052399427,0.021470511],"genre_scores_gemma":[0.84640497,0.0004505989,0.14658013,0.0000738925,0.000037474867,0.00013658918,0.00051603856,0.00012964038,0.005670648],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99903834,0.00019211088,0.000058464753,0.00014142325,0.00034025768,0.00022943092],"domain_scores_gemma":[0.99764985,0.0008297315,0.00047187493,0.0005145557,0.00036893843,0.00016503551],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059278455,0.0004629075,0.00055385585,0.0012601502,0.0012794817,0.00095093163,0.0007595866,0.00091055,0.009950915],"category_scores_gemma":[0.0040293843,0.00059315754,0.0008223448,0.0014305101,0.0014157372,0.002133778,0.0025635774,0.001005686,0.0010419819],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014347119,0.00019197102,0.008390157,0.0005160598,0.00015355946,0.0018930974,0.0014324056,0.3089246,0.06987001,0.32944217,0.007393166,0.27035812],"study_design_scores_gemma":[0.00018529664,0.00038298158,0.0033398515,0.0001623925,0.000098664306,0.0014300363,0.0016373743,0.54403347,0.041369803,0.38082623,0.026447602,0.00008628598],"about_ca_topic_score_codex":0.0025837892,"about_ca_topic_score_gemma":0.002716746,"teacher_disagreement_score":0.009950915,"about_ca_system_score_codex":0.00064504315,"about_ca_system_score_gemma":0.0004193166,"threshold_uncertainty_score":0.033289075},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53755325,0.00044797378,0.4072525,0.00049900817,0.00016712656,0.000075782424,0.0006189002,0.000742431,0.052643027],"genre_scores_gemma":[0.91727054,0.00051179045,0.061010122,0.00017137323,0.00009534683,0.00005686072,0.0010230339,0.00035282856,0.01950803],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996879,0.000055651875,0.00001844217,0.00006611617,0.00010431693,0.00006757366],"domain_scores_gemma":[0.9995017,0.000115883624,0.000099655284,0.00014159968,0.000079523605,0.00006173473],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022130008,0.0003923549,0.000352572,0.0009382475,0.000529347,0.0015053607,0.0006334136,0.00070571486,0.0058906386],"category_scores_gemma":[0.0014557082,0.00024199736,0.0005054638,0.00082442875,0.00089182926,0.0025321108,0.0013552249,0.0011685215,0.0008571277],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007005378,0.00003419652,0.00044523436,0.00007267544,0.000007134705,0.00016818062,0.00033883596,0.022803728,0.0076255295,0.92774075,0.0018392148,0.038854443],"study_design_scores_gemma":[0.000015851465,0.00005704435,0.00040863553,0.000031825326,0.0000102949125,0.00024250521,0.0002444172,0.064822964,0.0050247577,0.9172066,0.011912285,0.000022778137],"about_ca_topic_score_codex":0.0004811491,"about_ca_topic_score_gemma":0.00057314034,"teacher_disagreement_score":0.0058906386,"about_ca_system_score_codex":0.00050705846,"about_ca_system_score_gemma":0.00023214857,"threshold_uncertainty_score":0.01970613},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048437234,0.00036384194,0.94233906,0.00037458225,0.00004411732,0.00012164686,0.000777691,0.0023234587,0.005218381],"genre_scores_gemma":[0.23484696,0.00026341263,0.7589665,0.0001208479,0.000045662597,0.00016802008,0.0016758313,0.00059645285,0.0033162746],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990582,0.00011920269,0.00006969642,0.00025787493,0.0003030961,0.00019196598],"domain_scores_gemma":[0.99802196,0.00087023736,0.00018529534,0.000512976,0.00026376898,0.00014581441],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009170592,0.0008572956,0.001434652,0.0017558561,0.0009378578,0.0027764419,0.0018274619,0.0013554578,0.00982042],"category_scores_gemma":[0.0053835358,0.0006668497,0.0016604948,0.001908939,0.001173564,0.004634843,0.004408347,0.0016137249,0.0015485774],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006267132,0.00017403877,0.004054915,0.0006604069,0.00013362315,0.0001726755,0.0010271956,0.24228564,0.014110255,0.26935127,0.013893139,0.45351014],"study_design_scores_gemma":[0.00011633863,0.00006490199,0.000658226,0.00006261746,0.000033010456,0.00014439992,0.0003133107,0.5411906,0.008961482,0.4390744,0.009333027,0.000047683887],"about_ca_topic_score_codex":0.00291798,"about_ca_topic_score_gemma":0.0057739797,"teacher_disagreement_score":0.00982042,"about_ca_system_score_codex":0.0016477313,"about_ca_system_score_gemma":0.0010967886,"threshold_uncertainty_score":0.03285259},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10517846,0.00096756883,0.8872538,0.00080366805,0.00008773267,0.000100916914,0.0011424462,0.0012637957,0.003201632],"genre_scores_gemma":[0.651146,0.00054850575,0.34176728,0.00035252262,0.00016755366,0.00022319418,0.0024978379,0.00041778406,0.0028792743],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99710554,0.0006244527,0.00016219274,0.00080271944,0.0009437618,0.00036125886],"domain_scores_gemma":[0.98947173,0.0064101038,0.0009790857,0.0019053012,0.000830326,0.0004033982],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028492375,0.0010601529,0.002146271,0.0023569828,0.0010850504,0.0019335614,0.0035620825,0.0023634206,0.0039195027],"category_scores_gemma":[0.024956364,0.00080780947,0.0013815738,0.0023617854,0.0016879187,0.006472428,0.0046672816,0.0023132851,0.0011014962],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011103532,0.0001595619,0.013911406,0.00039802256,0.00014005764,0.00029877457,0.0005498867,0.7222992,0.0067323307,0.10346603,0.007619623,0.1433148],"study_design_scores_gemma":[0.000048569167,0.00010039915,0.00075974164,0.0000308877,0.000016797354,0.00016897057,0.00009366909,0.90118766,0.0026313951,0.09259718,0.0023427606,0.000022007704],"about_ca_topic_score_codex":0.004031689,"about_ca_topic_score_gemma":0.003319868,"teacher_disagreement_score":0.004031689,"about_ca_system_score_codex":0.002072608,"about_ca_system_score_gemma":0.0010265998,"threshold_uncertainty_score":0.015068352},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3500295,0.0037442928,0.611335,0.0018906979,0.0002957999,0.00021343972,0.0006156199,0.0023213085,0.029554456],"genre_scores_gemma":[0.78360206,0.00069526146,0.209869,0.00015519638,0.0001222925,0.00011955101,0.00041281086,0.0004899764,0.0045339726],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998447,0.00034841624,0.0001154031,0.0003121231,0.00048368028,0.00029329644],"domain_scores_gemma":[0.99119663,0.0071470356,0.0003181981,0.00048030834,0.0004465468,0.00041126736],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021214888,0.0010902876,0.0011225048,0.001213796,0.0008051869,0.002013286,0.0023657333,0.0021486375,0.009561196],"category_scores_gemma":[0.016577281,0.00045945216,0.0007303815,0.0015166735,0.0012351319,0.0038365545,0.0028023592,0.0010116826,0.0012025045],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0037159042,0.0003680061,0.0052442416,0.0008676521,0.00017153227,0.00029857658,0.00066647306,0.6199858,0.031584673,0.024860138,0.0062124017,0.30602458],"study_design_scores_gemma":[0.0000807548,0.00028585564,0.0008309538,0.000040916075,0.000069019574,0.00019781674,0.00018039663,0.9818366,0.0048448313,0.010820125,0.0007933971,0.000019376179],"about_ca_topic_score_codex":0.0045253136,"about_ca_topic_score_gemma":0.0071291877,"teacher_disagreement_score":0.009561196,"about_ca_system_score_codex":0.0013118353,"about_ca_system_score_gemma":0.0015421221,"threshold_uncertainty_score":0.03198546},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21054776,0.00036627095,0.76061904,0.00095907133,0.000082284634,0.00028042583,0.0021504941,0.0016250549,0.023369549],"genre_scores_gemma":[0.3907257,0.00019624578,0.5979135,0.0001314457,0.0000409424,0.0001632829,0.0032430561,0.00041026322,0.0071756453],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994362,0.00008859884,0.00004369916,0.00015268645,0.00018800574,0.00009079718],"domain_scores_gemma":[0.99876606,0.0005492511,0.00015220648,0.00028197892,0.00017226263,0.00007823771],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034266678,0.0005574381,0.0010591415,0.0006777556,0.0005305548,0.00081361656,0.0011950897,0.0010084247,0.008919397],"category_scores_gemma":[0.004113753,0.0004333402,0.00071077264,0.001304498,0.0005633251,0.0016005025,0.001632653,0.00096948224,0.0020031284],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014069163,0.00027816524,0.008865696,0.0010950493,0.00012746816,0.0007048338,0.0011911002,0.29876247,0.04713645,0.09874864,0.0320466,0.5096367],"study_design_scores_gemma":[0.00026136442,0.0002488338,0.0017572647,0.000113750604,0.000051479692,0.0005767523,0.0006448508,0.8285895,0.020847477,0.1256736,0.021200083,0.00003498751],"about_ca_topic_score_codex":0.0016225775,"about_ca_topic_score_gemma":0.0023713808,"teacher_disagreement_score":0.008919397,"about_ca_system_score_codex":0.00040591226,"about_ca_system_score_gemma":0.00046309247,"threshold_uncertainty_score":0.029838324},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5300742,0.00049762265,0.36946285,0.0010258526,0.0002521283,0.00010279714,0.00040819024,0.00046690067,0.097709484],"genre_scores_gemma":[0.9652326,0.0004582218,0.023007475,0.00017686994,0.00017241295,0.000076968834,0.00039037355,0.00012388949,0.010361256],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99882966,0.000117766765,0.00006372373,0.00021265444,0.0005650805,0.00021116604],"domain_scores_gemma":[0.9970193,0.0013331433,0.0003806436,0.0003849831,0.0005574365,0.0003245234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013599298,0.0006226544,0.00060119096,0.0034099468,0.0018958191,0.0032328747,0.001104646,0.0010026051,0.007795917],"category_scores_gemma":[0.005456213,0.0005139359,0.001295907,0.0012125792,0.003437519,0.0048052333,0.0035923684,0.0030774975,0.0008134429],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022166423,0.000015622076,0.0010762679,0.000028053764,0.000006525094,0.000111328525,0.00020078292,0.001936067,0.0010521953,0.9894441,0.000672782,0.0054341285],"study_design_scores_gemma":[0.000022507287,0.00005062102,0.0012283992,0.000031615953,0.000019333043,0.00052019843,0.00025720225,0.02359234,0.0050496003,0.9630969,0.006102667,0.00002853617],"about_ca_topic_score_codex":0.00090315635,"about_ca_topic_score_gemma":0.00061507046,"teacher_disagreement_score":0.007795917,"about_ca_system_score_codex":0.0018539538,"about_ca_system_score_gemma":0.00045418146,"threshold_uncertainty_score":0.026080012},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7976464,0.0007615074,0.17044891,0.0009896464,0.000047739184,0.00006647027,0.0016659639,0.0002813605,0.028092049],"genre_scores_gemma":[0.9055475,0.00074224395,0.079769164,0.00030219535,0.000041865474,0.00008457131,0.0021630959,0.00011266538,0.011236719],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996358,0.000057685276,0.000014922528,0.0000940389,0.000101767895,0.00009574407],"domain_scores_gemma":[0.99883455,0.00045023588,0.00021526933,0.00018872961,0.00015806696,0.00015303348],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021462952,0.00030295868,0.00054151716,0.00063659454,0.0006968935,0.0010617328,0.000756257,0.00068172475,0.004365813],"category_scores_gemma":[0.0019424214,0.0005147961,0.0002994513,0.0010853129,0.00065854646,0.0011605788,0.0011383877,0.0010318869,0.0009651833],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00066354935,0.00014641767,0.0063828835,0.000499839,0.00008752859,0.0011008688,0.0013276081,0.08284227,0.05814018,0.751251,0.015977064,0.08158086],"study_design_scores_gemma":[0.00021841514,0.00012069659,0.009067491,0.00012123683,0.00009045984,0.001700517,0.0009481678,0.22172898,0.019327462,0.7053545,0.041267924,0.00005413377],"about_ca_topic_score_codex":0.0017046486,"about_ca_topic_score_gemma":0.003009353,"teacher_disagreement_score":0.004365813,"about_ca_system_score_codex":0.0006251021,"about_ca_system_score_gemma":0.00026207586,"threshold_uncertainty_score":0.014605045},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07929656,0.0018515148,0.8586978,0.0039601834,0.00035288988,0.0006106038,0.003600321,0.0058201216,0.045810096],"genre_scores_gemma":[0.45784658,0.0009304734,0.51552296,0.0019052669,0.0004451251,0.0007250744,0.0060225767,0.0014953448,0.015106524],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99269605,0.001390344,0.00045830576,0.0028713378,0.0013898787,0.0011941099],"domain_scores_gemma":[0.9863149,0.007907965,0.00096399285,0.0037079582,0.00058697804,0.0005182894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027616601,0.0023164405,0.0026148974,0.0012747372,0.0014592641,0.0052993405,0.0050179823,0.004045008,0.016646717],"category_scores_gemma":[0.017576586,0.0011758534,0.0030559811,0.0032058565,0.0024142505,0.010699878,0.005114263,0.0052584596,0.0033713772],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013330216,0.0008263846,0.0038252983,0.001261734,0.0004154665,0.00017301127,0.00045571793,0.44834372,0.0061228033,0.32915518,0.037894525,0.17019314],"study_design_scores_gemma":[0.00031717055,0.00018888505,0.00055748894,0.000066812114,0.00011883047,0.00019601568,0.000096891,0.63137484,0.0037646117,0.348978,0.014301267,0.00003921069],"about_ca_topic_score_codex":0.0020854136,"about_ca_topic_score_gemma":0.003439351,"teacher_disagreement_score":0.016646717,"about_ca_system_score_codex":0.004869226,"about_ca_system_score_gemma":0.0036908253,"threshold_uncertainty_score":0.0556888},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.083397955,0.0009359791,0.9012894,0.0018798843,0.00010699665,0.00019983984,0.0012091256,0.0008362527,0.010144593],"genre_scores_gemma":[0.47097158,0.0006343324,0.5225055,0.0003466908,0.00008134979,0.00032209174,0.0016445951,0.0001720929,0.0033217536],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99927,0.00017991196,0.00004066284,0.00022089278,0.0001668638,0.00012167278],"domain_scores_gemma":[0.9979576,0.0014577226,0.00015387629,0.00022875692,0.00008981295,0.00011229906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000878846,0.00088314683,0.001063292,0.0004947011,0.0005486387,0.0013323659,0.0015107357,0.0016932067,0.0043660495],"category_scores_gemma":[0.004736218,0.00056868076,0.00094658945,0.0010857489,0.0012604941,0.0024606157,0.0014621906,0.0021887377,0.00036689165],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016197628,0.00009905756,0.0011321412,0.00024006717,0.000023143566,0.00010782139,0.00011949352,0.91997993,0.0016980062,0.036485605,0.0045670476,0.035385743],"study_design_scores_gemma":[0.000039448547,0.000034462675,0.00015153443,0.000021298338,0.000007780269,0.000053029176,0.0000635635,0.96453077,0.00065257464,0.033036962,0.0014019397,0.000006597463],"about_ca_topic_score_codex":0.004888272,"about_ca_topic_score_gemma":0.0055257156,"teacher_disagreement_score":0.004888272,"about_ca_system_score_codex":0.0014400299,"about_ca_system_score_gemma":0.0013543254,"threshold_uncertainty_score":0.01460588},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04032786,0.00007750934,0.9487973,0.00008949579,0.00003646601,0.000040302613,0.00022255063,0.0008415859,0.00956687],"genre_scores_gemma":[0.6207096,0.0002906808,0.36920816,0.00009015238,0.000044261982,0.000101997844,0.00076299836,0.00083714223,0.007954961],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99977535,0.000037682268,0.000011229604,0.000044039996,0.00008593724,0.000045853518],"domain_scores_gemma":[0.99931824,0.00023217141,0.000076468095,0.00017820513,0.0001319086,0.000063053616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021211761,0.00061161246,0.0005660006,0.0011153718,0.00036945843,0.0018827826,0.001065465,0.0010148131,0.008900702],"category_scores_gemma":[0.0017174475,0.00044655794,0.00082296407,0.0009277973,0.00059013587,0.0019276977,0.0016937638,0.0013646361,0.0014716674],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039514987,0.000121721736,0.0010161832,0.00028197243,0.000050513278,0.00049916806,0.0008474696,0.22745566,0.033644903,0.48617736,0.00690547,0.24260445],"study_design_scores_gemma":[0.00002972899,0.000042063963,0.00019272222,0.00004378209,0.000015239819,0.00013790467,0.00018648754,0.8310633,0.0070820707,0.15383965,0.007342718,0.000024329855],"about_ca_topic_score_codex":0.0017379574,"about_ca_topic_score_gemma":0.002840464,"teacher_disagreement_score":0.008900702,"about_ca_system_score_codex":0.0004504974,"about_ca_system_score_gemma":0.00040362542,"threshold_uncertainty_score":0.029775798},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18812563,0.0015942234,0.7377917,0.0012084264,0.0001511761,0.00017368446,0.0011139534,0.0010808639,0.06876023],"genre_scores_gemma":[0.7448871,0.0032367078,0.22514051,0.00055511756,0.00026264167,0.00034881715,0.003205776,0.00047458455,0.021888634],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992132,0.00022177772,0.000034241588,0.0001693759,0.0002436235,0.000117798285],"domain_scores_gemma":[0.9984016,0.0007192282,0.0003603888,0.0002481129,0.00015284699,0.00011792709],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037411755,0.0011006492,0.00054612575,0.0014826257,0.00090687635,0.0020197856,0.0012341711,0.0012443732,0.008113826],"category_scores_gemma":[0.0045152246,0.00076533784,0.0007263273,0.002514453,0.0021344968,0.0025568728,0.0022830996,0.001592716,0.0016815556],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000077821496,0.000025281715,0.0008080491,0.00012038822,0.000020507798,0.00027159235,0.00030052155,0.06097957,0.0027978267,0.88706785,0.006437665,0.041092973],"study_design_scores_gemma":[0.000035650588,0.00004289771,0.0005544546,0.000054863973,0.000020807578,0.00033449437,0.0001681204,0.1049684,0.0017309432,0.8712762,0.020783573,0.000029724326],"about_ca_topic_score_codex":0.002060646,"about_ca_topic_score_gemma":0.0020722472,"teacher_disagreement_score":0.008113826,"about_ca_system_score_codex":0.001186327,"about_ca_system_score_gemma":0.00033246004,"threshold_uncertainty_score":0.027143478},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030012926,0.00038460802,0.9563314,0.00018052725,0.000076163255,0.000042445397,0.00028941425,0.00064631604,0.012036144],"genre_scores_gemma":[0.42725196,0.0013810273,0.5532319,0.00017272845,0.00009344984,0.00015085601,0.0013565663,0.0006269639,0.01573449],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996499,0.00010370918,0.00002411721,0.00008400764,0.00009582177,0.000042495038],"domain_scores_gemma":[0.9993519,0.00023192984,0.00009079922,0.00015690435,0.000112705704,0.00005573636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004267144,0.00046817405,0.0003180414,0.0013206695,0.0005219354,0.0014773154,0.00073948596,0.0007608975,0.0053546163],"category_scores_gemma":[0.002609872,0.0003634757,0.00051285373,0.0011925987,0.0011100745,0.0023473294,0.001631945,0.00091224245,0.0014156733],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000064013715,0.000026793772,0.0006773423,0.00012245782,0.000015119381,0.00021510347,0.00055410084,0.06341078,0.0057929996,0.8579874,0.0040007317,0.067133114],"study_design_scores_gemma":[0.000019278783,0.000027938358,0.00018672713,0.000053849362,0.0000150133,0.00017868045,0.00018921273,0.17881876,0.0025497272,0.7817781,0.036164727,0.000018023451],"about_ca_topic_score_codex":0.0009705662,"about_ca_topic_score_gemma":0.0018750767,"teacher_disagreement_score":0.0053546163,"about_ca_system_score_codex":0.0005096678,"about_ca_system_score_gemma":0.00033856882,"threshold_uncertainty_score":0.017912984},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3143654,0.00046257974,0.6511882,0.0012191201,0.00007304264,0.00013361983,0.00045685883,0.00024887832,0.03185233],"genre_scores_gemma":[0.83899385,0.0006663049,0.1500788,0.00027392546,0.00007815218,0.00010132392,0.00062302087,0.00013018267,0.009054446],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99938154,0.00011507362,0.000036857196,0.00016941784,0.00018702674,0.00011006528],"domain_scores_gemma":[0.9950864,0.0024239796,0.0008053832,0.00070904655,0.00056566764,0.00040951825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006455345,0.00042277825,0.00046469914,0.0008703616,0.0009959528,0.0017598197,0.0015214614,0.0010616123,0.005548133],"category_scores_gemma":[0.0055328007,0.00042246038,0.00069937087,0.0013287764,0.0015989906,0.003518378,0.0015142102,0.0013846726,0.00045972114],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000103199854,0.0000794732,0.002575112,0.00017407545,0.000021467904,0.00033569895,0.00043103113,0.12616038,0.0039746924,0.83646524,0.002431904,0.027247675],"study_design_scores_gemma":[0.000025297277,0.000063099185,0.0009081804,0.000033412794,0.000021638818,0.00049522746,0.00030586586,0.37026933,0.002963608,0.6167102,0.008180794,0.000023416338],"about_ca_topic_score_codex":0.004353372,"about_ca_topic_score_gemma":0.0055993106,"teacher_disagreement_score":0.005548133,"about_ca_system_score_codex":0.0015099727,"about_ca_system_score_gemma":0.0005578293,"threshold_uncertainty_score":0.01856029},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90917295,0.0020475273,0.05893536,0.0013397236,0.00025928268,0.00003022184,0.0005314673,0.001156416,0.026526976],"genre_scores_gemma":[0.9841897,0.00036599278,0.013441158,0.000108268694,0.000056930647,0.00002534869,0.00027128408,0.00015613963,0.0013852486],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99924856,0.00015433534,0.0000314677,0.00027347635,0.00018545055,0.00010666158],"domain_scores_gemma":[0.99451196,0.0027781813,0.00061045977,0.0010122315,0.00051768945,0.00056943024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008021329,0.0003592318,0.00048540032,0.0022788947,0.0009788115,0.001508639,0.0008676184,0.001256615,0.003456372],"category_scores_gemma":[0.010383237,0.0005406492,0.00034449747,0.0011341063,0.0014947697,0.0020057869,0.0008903777,0.0015518743,0.000485559],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005098908,0.0001667918,0.028187606,0.0005283012,0.00011294926,0.0011628559,0.0013984486,0.06156793,0.07976008,0.7237521,0.015052571,0.08780051],"study_design_scores_gemma":[0.00008151137,0.0001746371,0.020764917,0.00013205514,0.00007558322,0.0036579056,0.00081325904,0.18552415,0.034473963,0.7297942,0.024372723,0.00013508777],"about_ca_topic_score_codex":0.00056584063,"about_ca_topic_score_gemma":0.00081992976,"teacher_disagreement_score":0.003456372,"about_ca_system_score_codex":0.000983358,"about_ca_system_score_gemma":0.0002894902,"threshold_uncertainty_score":0.011562765},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38247007,0.0005871536,0.56950307,0.0005603957,0.00009545159,0.00018411432,0.00032321067,0.0009862889,0.04529009],"genre_scores_gemma":[0.73145133,0.00050900184,0.24564941,0.00019550395,0.000045405144,0.00017267714,0.0006346204,0.0003984106,0.020943623],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99967873,0.000047859092,0.000015038894,0.000106645035,0.00010063878,0.000051176605],"domain_scores_gemma":[0.9993505,0.00017136248,0.00010953714,0.00023200006,0.00005787139,0.00007878326],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022041229,0.00039704936,0.0003638895,0.0005663489,0.00087099255,0.0012447236,0.000649858,0.00077589246,0.00547011],"category_scores_gemma":[0.002210241,0.0004368811,0.0004055724,0.0006905622,0.00091458275,0.0018554298,0.000843291,0.0008254876,0.00064611615],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000140898,0.00006809796,0.0027352644,0.00021337162,0.000025131498,0.00078523665,0.000949996,0.044952206,0.018948745,0.7813535,0.006467431,0.1433602],"study_design_scores_gemma":[0.00007619517,0.00014271832,0.002611437,0.000100695754,0.00003738457,0.0022540279,0.0009252986,0.19091067,0.016958876,0.6803561,0.105572775,0.000053787844],"about_ca_topic_score_codex":0.0017221557,"about_ca_topic_score_gemma":0.002615088,"teacher_disagreement_score":0.00547011,"about_ca_system_score_codex":0.0007025995,"about_ca_system_score_gemma":0.00034820056,"threshold_uncertainty_score":0.018299282},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15319861,0.0063892156,0.6824458,0.030584963,0.0020938078,0.000589934,0.008076668,0.009153691,0.10746729],"genre_scores_gemma":[0.5199435,0.0027284177,0.4097211,0.0046380716,0.0024152764,0.0011283667,0.011467997,0.0027734886,0.04518385],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99365765,0.0013256754,0.0004749022,0.0014647618,0.0019386628,0.0011384563],"domain_scores_gemma":[0.9724036,0.020105192,0.0011125394,0.004390781,0.0011331615,0.0008547563],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041056806,0.0030312208,0.0026146502,0.0019720392,0.0024975853,0.0074745156,0.005690168,0.0031900334,0.030529166],"category_scores_gemma":[0.025579264,0.001192581,0.0031349103,0.0035694966,0.0029769866,0.022878416,0.00662161,0.007522701,0.008456979],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0053544263,0.0015444495,0.010006486,0.0032346447,0.00070650154,0.000590695,0.0010599889,0.11059253,0.022809206,0.33937088,0.15488796,0.34984228],"study_design_scores_gemma":[0.00045170225,0.00033150922,0.0018297614,0.00017695123,0.00032844808,0.00065812544,0.00030815933,0.36549032,0.0085433405,0.5989225,0.022850605,0.000108528635],"about_ca_topic_score_codex":0.0034603393,"about_ca_topic_score_gemma":0.010006912,"teacher_disagreement_score":0.030529166,"about_ca_system_score_codex":0.004432391,"about_ca_system_score_gemma":0.0049393703,"threshold_uncertainty_score":0.102130234},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40467092,0.0005251477,0.58018106,0.00033737038,0.00006444786,0.000056896573,0.00033560066,0.0005823287,0.013246252],"genre_scores_gemma":[0.90690625,0.0002998903,0.08728076,0.00007239925,0.000046643116,0.00006425201,0.0006669563,0.00022401467,0.0044388995],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99926823,0.00021118182,0.000037675654,0.00013423355,0.00024272362,0.00010595248],"domain_scores_gemma":[0.9954608,0.0032592618,0.0002620137,0.00046484577,0.0003319522,0.00022114723],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008388894,0.00066504884,0.00075390434,0.001171659,0.0004098866,0.0017305771,0.0011825135,0.0009873215,0.00569877],"category_scores_gemma":[0.008327316,0.0004166712,0.0007112859,0.0009214784,0.0010977283,0.0015870814,0.0019792947,0.001370343,0.0004920212],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009758089,0.00017814239,0.006749475,0.00048759885,0.00010859421,0.0003483959,0.00085426675,0.51868784,0.018453984,0.34406212,0.0045309938,0.1045628],"study_design_scores_gemma":[0.000022983699,0.00006772261,0.00047399607,0.000030726093,0.000021029788,0.00012992299,0.0000863435,0.8944701,0.0036206192,0.09900691,0.0020609188,0.000008688052],"about_ca_topic_score_codex":0.0018883231,"about_ca_topic_score_gemma":0.00095316616,"teacher_disagreement_score":0.00569877,"about_ca_system_score_codex":0.0010098991,"about_ca_system_score_gemma":0.00031794983,"threshold_uncertainty_score":0.019064307},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15649351,0.0020916732,0.8229643,0.001042608,0.00010170841,0.00027283214,0.001346991,0.0009834832,0.014702872],"genre_scores_gemma":[0.52697456,0.0019895092,0.45913,0.000381725,0.00011309179,0.0003871996,0.0031076719,0.00029613893,0.007620123],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989183,0.00035249547,0.00006706956,0.00023088882,0.00027778756,0.00015348013],"domain_scores_gemma":[0.99831235,0.0007583196,0.00028235905,0.00030571868,0.00021348243,0.00012772187],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000580654,0.0006031035,0.0007067483,0.0015017571,0.0012141503,0.001706391,0.0011259934,0.001094031,0.0042280527],"category_scores_gemma":[0.004141934,0.00083505205,0.0006902819,0.0030233616,0.0009968613,0.002784829,0.0018568796,0.0010902871,0.00095064886],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018483323,0.000113242706,0.0017854281,0.00071643776,0.000099228724,0.0005069309,0.00090622815,0.3240127,0.010505668,0.50160664,0.015298227,0.14426443],"study_design_scores_gemma":[0.0000421441,0.00004950308,0.0010908963,0.000061757935,0.00003684318,0.000541342,0.00029180187,0.37102517,0.0023722183,0.6065442,0.017919004,0.000025114587],"about_ca_topic_score_codex":0.0019065449,"about_ca_topic_score_gemma":0.0022117104,"teacher_disagreement_score":0.0042280527,"about_ca_system_score_codex":0.0010704946,"about_ca_system_score_gemma":0.00050347234,"threshold_uncertainty_score":0.014144242},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13657239,0.0027358758,0.835488,0.0023840328,0.0002555983,0.0005198005,0.0072427057,0.0055508134,0.0092508],"genre_scores_gemma":[0.39877278,0.0010895752,0.5811359,0.0005975579,0.00020259786,0.0005466951,0.01120611,0.0008228036,0.005625905],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9946681,0.001130546,0.0005559361,0.0016374165,0.0015033877,0.00050460873],"domain_scores_gemma":[0.992601,0.0037368787,0.0005907322,0.002384506,0.00043547977,0.00025142694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022286177,0.0010851807,0.0025387397,0.0019171834,0.0015067353,0.0027993785,0.003252646,0.002856621,0.011008124],"category_scores_gemma":[0.016884113,0.0010713327,0.0016950956,0.0056040413,0.0014689176,0.01243555,0.006996404,0.0019899653,0.0032449872],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00427108,0.00077892817,0.0076806517,0.002389851,0.00045381367,0.0016596093,0.002729064,0.22054967,0.037990622,0.2443005,0.07697257,0.40022367],"study_design_scores_gemma":[0.00056451926,0.0005047353,0.0015184117,0.00018520669,0.000100081656,0.0016309347,0.001785648,0.580905,0.026251998,0.3495052,0.0369296,0.00011866099],"about_ca_topic_score_codex":0.001902792,"about_ca_topic_score_gemma":0.0015802273,"teacher_disagreement_score":0.011008124,"about_ca_system_score_codex":0.0009690657,"about_ca_system_score_gemma":0.00076206005,"threshold_uncertainty_score":0.036825836},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8053082,0.0032352356,0.16370276,0.0011037551,0.00008595774,0.000031251,0.00045753716,0.0006757536,0.02539963],"genre_scores_gemma":[0.9701581,0.0016614707,0.025378028,0.00010141796,0.00009438022,0.000034790482,0.00032852805,0.00022158353,0.0020217542],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993734,0.00008074183,0.000026058424,0.0002066143,0.00017135579,0.00014191458],"domain_scores_gemma":[0.9945011,0.0031564177,0.0010418996,0.000661261,0.0002114778,0.0004278766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006048976,0.00090991386,0.0005441583,0.0018004716,0.0007299247,0.0019209546,0.0012869916,0.00083088904,0.0033726962],"category_scores_gemma":[0.007960545,0.00051479,0.00065879285,0.0018410261,0.0019033127,0.0057807565,0.001981683,0.0016400878,0.00044933902],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005769377,0.00021036257,0.040225323,0.00073228445,0.00023845753,0.0012264557,0.0013285717,0.29530194,0.07515762,0.45285553,0.0061595854,0.12598687],"study_design_scores_gemma":[0.000031668864,0.000264881,0.021799965,0.0001731478,0.00025726136,0.0022278237,0.00071229914,0.40487325,0.031799268,0.5274349,0.010313472,0.00011201503],"about_ca_topic_score_codex":0.0009896071,"about_ca_topic_score_gemma":0.0014464774,"teacher_disagreement_score":0.0033726962,"about_ca_system_score_codex":0.0010264511,"about_ca_system_score_gemma":0.0003154877,"threshold_uncertainty_score":0.011282802},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51438564,0.00040668223,0.4404887,0.00028947697,0.00017091917,0.00013124538,0.0004068568,0.0004955502,0.043224968],"genre_scores_gemma":[0.8355811,0.0005885307,0.13039297,0.000077344004,0.000048725386,0.0000983972,0.00066775974,0.000353991,0.032191176],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99976975,0.000047027297,0.000010313831,0.000043316308,0.00009652082,0.000032986827],"domain_scores_gemma":[0.99949443,0.00022365042,0.00007605216,0.000049768365,0.0000802643,0.00007579165],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022451032,0.00039840615,0.00030255486,0.0012443418,0.0007541979,0.001351043,0.0006462427,0.0007109518,0.005458156],"category_scores_gemma":[0.002472289,0.00042151904,0.00040111414,0.00080799154,0.0009225673,0.0012756147,0.0013960247,0.00091758976,0.00068365195],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016683439,0.000088365094,0.0018790488,0.00017129838,0.000020446387,0.00047165118,0.00060936826,0.13668442,0.005331921,0.8055777,0.0027882704,0.046210766],"study_design_scores_gemma":[0.00003327505,0.000077452445,0.0006470894,0.000050630693,0.000012441118,0.00031663294,0.00032331556,0.3662847,0.0030469396,0.6161013,0.013087052,0.00001910683],"about_ca_topic_score_codex":0.001335855,"about_ca_topic_score_gemma":0.0012379109,"teacher_disagreement_score":0.005458156,"about_ca_system_score_codex":0.0005367678,"about_ca_system_score_gemma":0.00038573085,"threshold_uncertainty_score":0.018259346},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028754892,0.0008052205,0.9644341,0.00046352574,0.000066237495,0.000101857426,0.00045506025,0.0009490435,0.003970092],"genre_scores_gemma":[0.3306008,0.0009466554,0.6614702,0.00018048308,0.000085531385,0.00033409824,0.001907197,0.00028680632,0.0041882712],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991818,0.00016051,0.00005902766,0.00018663592,0.0002418482,0.00017020204],"domain_scores_gemma":[0.9977223,0.0015040893,0.00016077155,0.000323538,0.00017870618,0.000110473164],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011625594,0.0012581564,0.0012187951,0.0012235822,0.00072093355,0.0016449005,0.0021024423,0.0015834703,0.0051626787],"category_scores_gemma":[0.0075635416,0.0006380238,0.0011624492,0.0022887853,0.0009786218,0.0027986756,0.002020224,0.0024718612,0.0006937443],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022191943,0.000107885695,0.0014556128,0.00024132215,0.00005990856,0.00009243402,0.0002447223,0.79252356,0.0015237957,0.08411171,0.0072675566,0.11214957],"study_design_scores_gemma":[0.00004942399,0.000032420958,0.00014201344,0.000023459776,0.000014266821,0.000052948908,0.00006111487,0.91878104,0.0005261776,0.07789305,0.00241601,0.000007985608],"about_ca_topic_score_codex":0.005043942,"about_ca_topic_score_gemma":0.005150042,"teacher_disagreement_score":0.0051626787,"about_ca_system_score_codex":0.0017439565,"about_ca_system_score_gemma":0.0010860494,"threshold_uncertainty_score":0.017270923},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29153275,0.00088098465,0.6822193,0.00038772254,0.00006165506,0.000066425004,0.0006285224,0.0004888304,0.023733782],"genre_scores_gemma":[0.8095085,0.00059871154,0.18040551,0.000070995964,0.000049271355,0.000095001655,0.00077942776,0.000121023244,0.0083715115],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99930966,0.00011653111,0.000052286043,0.00015569603,0.0002593396,0.00010644322],"domain_scores_gemma":[0.9990011,0.00034365145,0.00019106483,0.00021212395,0.00013971391,0.00011245766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041852792,0.00042850306,0.00046198268,0.00096168375,0.0010510784,0.0017198053,0.00064544496,0.0004848708,0.0030371074],"category_scores_gemma":[0.0018907008,0.00053320825,0.000403066,0.0007693017,0.002206384,0.0019313471,0.0020593384,0.00073085603,0.0005123978],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000063779604,0.000019950105,0.0021252723,0.00022655909,0.00001853874,0.00024457756,0.0003659142,0.12779354,0.005066318,0.81573194,0.0029626745,0.04538096],"study_design_scores_gemma":[0.00002227395,0.000072696035,0.0016453397,0.000059776747,0.000012616207,0.0005419409,0.0004405112,0.30047488,0.0056018233,0.6729072,0.018175201,0.000045817345],"about_ca_topic_score_codex":0.0021226348,"about_ca_topic_score_gemma":0.001635251,"teacher_disagreement_score":0.0030371074,"about_ca_system_score_codex":0.000794649,"about_ca_system_score_gemma":0.00043177741,"threshold_uncertainty_score":0.010160089},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3091219,0.0014523033,0.6416951,0.0005395732,0.00022400664,0.000108066124,0.00047932728,0.0013177264,0.04506194],"genre_scores_gemma":[0.76773113,0.00078747864,0.2176006,0.00020290483,0.00015906617,0.0001297978,0.0006813753,0.000728091,0.011979614],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99899775,0.00029302196,0.000046078934,0.00017383939,0.0003421604,0.0001471834],"domain_scores_gemma":[0.9976272,0.0013281185,0.00016194381,0.00046882613,0.00022261118,0.00019126043],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00114582,0.0008710236,0.0010531618,0.001643789,0.0005141532,0.0015246645,0.0017014336,0.0009540701,0.010283112],"category_scores_gemma":[0.0067270026,0.0003681977,0.0005528745,0.0013306217,0.00077933446,0.0026613418,0.0022031593,0.0016229941,0.0018759086],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00093883974,0.00043579505,0.0027846447,0.0006707864,0.00011610324,0.00038948655,0.00043124257,0.22404376,0.045319736,0.39047813,0.015194417,0.31919712],"study_design_scores_gemma":[0.000069807866,0.000284776,0.0011120897,0.000055085125,0.0000783131,0.00046815074,0.00013969983,0.7035237,0.015175111,0.27110288,0.007956635,0.000033715147],"about_ca_topic_score_codex":0.00046374532,"about_ca_topic_score_gemma":0.00082843355,"teacher_disagreement_score":0.010283112,"about_ca_system_score_codex":0.0005933122,"about_ca_system_score_gemma":0.00034801618,"threshold_uncertainty_score":0.034400463},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28393868,0.001720458,0.6679949,0.003305017,0.00029191145,0.00033298062,0.0010926181,0.01224847,0.029074978],"genre_scores_gemma":[0.5850153,0.00040401594,0.40558535,0.00030972337,0.00009743528,0.00033479728,0.001427402,0.001459868,0.0053661284],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99616635,0.0012886124,0.00032621503,0.0007581646,0.00096718455,0.0004934466],"domain_scores_gemma":[0.986482,0.008506833,0.000720023,0.003101419,0.0006786249,0.00051100337],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029744823,0.0009826861,0.0011164444,0.0009290166,0.0011096399,0.0017390612,0.003068941,0.0015915843,0.01343891],"category_scores_gemma":[0.01659766,0.00079910905,0.0014189421,0.0019659614,0.0014756514,0.0050933287,0.0031875006,0.0010207823,0.002808382],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.005180214,0.00047284807,0.0041999524,0.000798592,0.00016236678,0.0003977503,0.00050603616,0.4139121,0.02785223,0.05060256,0.024374707,0.4715407],"study_design_scores_gemma":[0.00034365806,0.00038323025,0.0007062591,0.000050382998,0.000057011923,0.00020967027,0.0001862777,0.93809986,0.013867606,0.042747095,0.0033143887,0.000034522705],"about_ca_topic_score_codex":0.0020297416,"about_ca_topic_score_gemma":0.0052160765,"teacher_disagreement_score":0.01343891,"about_ca_system_score_codex":0.0015050741,"about_ca_system_score_gemma":0.002043351,"threshold_uncertainty_score":0.044957638},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.60416484,0.00445032,0.21228383,0.002040343,0.0004265475,0.0000672585,0.0003722238,0.0003485286,0.17584606],"genre_scores_gemma":[0.9580501,0.0009597687,0.021690577,0.00022383762,0.00019843361,0.00005851138,0.0004214362,0.00005372,0.018343685],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99925524,0.00015571812,0.000035638506,0.00016336405,0.00025918134,0.00013082054],"domain_scores_gemma":[0.9988159,0.00048170701,0.00012167317,0.0001944354,0.00019249205,0.00019376347],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006846612,0.00043156647,0.00046900442,0.0012609151,0.0015795849,0.00238811,0.0004793786,0.00065254973,0.003726443],"category_scores_gemma":[0.0027763797,0.00028515476,0.00047920816,0.0007894055,0.0024919854,0.0031760642,0.0029187724,0.0014152762,0.00046424777],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021461561,0.000009163178,0.00042893845,0.000028291895,0.0000063530106,0.000057532357,0.00024907876,0.001250821,0.0013327413,0.9908332,0.0006676362,0.0051148017],"study_design_scores_gemma":[0.0000101872265,0.000061677885,0.0015097435,0.00003752122,0.000012038165,0.00033522717,0.00040638246,0.01432243,0.0021563668,0.96384037,0.017292581,0.000015535563],"about_ca_topic_score_codex":0.0011157931,"about_ca_topic_score_gemma":0.00080185814,"teacher_disagreement_score":0.003726443,"about_ca_system_score_codex":0.001494113,"about_ca_system_score_gemma":0.00035893673,"threshold_uncertainty_score":0.012466252},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0615918,0.02376007,0.24079438,0.059308246,0.007867265,0.00013604389,0.002167868,0.00200175,0.6023726],"genre_scores_gemma":[0.69986737,0.019362828,0.09714239,0.015772482,0.006659164,0.00035480587,0.0019824589,0.002870478,0.15598805],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963397,0.0007583016,0.00013930954,0.0008489408,0.0012619144,0.0006518311],"domain_scores_gemma":[0.98453194,0.006612494,0.0008725917,0.005193167,0.0017311275,0.0010585884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025307827,0.0013249265,0.0014295882,0.0014140718,0.0037051716,0.007834507,0.0020844918,0.0026319267,0.043380674],"category_scores_gemma":[0.018334616,0.0008761971,0.0014014302,0.0026803596,0.0066514886,0.02411102,0.0047349734,0.008256087,0.00884417],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009619347,0.000027412052,0.00048578854,0.00012174661,0.000024025238,0.00008186451,0.00022466105,0.0029128736,0.0004903584,0.9391769,0.029115615,0.027242605],"study_design_scores_gemma":[0.00002872774,0.000041935287,0.00026692872,0.00008041173,0.00002037844,0.00019949488,0.00018385517,0.005428708,0.000645305,0.8522659,0.14081007,0.00002816178],"about_ca_topic_score_codex":0.00484073,"about_ca_topic_score_gemma":0.0062828665,"teacher_disagreement_score":0.043380674,"about_ca_system_score_codex":0.004893257,"about_ca_system_score_gemma":0.0022687423,"threshold_uncertainty_score":0.14512283},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42022225,0.0007807717,0.53624344,0.0014898597,0.00018533366,0.00009173013,0.00047073315,0.00059046707,0.03992546],"genre_scores_gemma":[0.9283499,0.00034735628,0.054517206,0.00026109364,0.00007374422,0.00013601591,0.00041318045,0.00021395083,0.01568764],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99919075,0.00020464903,0.000034426736,0.00013552274,0.00019815846,0.00023641628],"domain_scores_gemma":[0.9963437,0.0020853765,0.00030751035,0.00041860944,0.00041733234,0.00042746626],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010703126,0.0005348575,0.0009122603,0.0013139672,0.0008485686,0.0016354611,0.001484622,0.0012657437,0.007915402],"category_scores_gemma":[0.01028703,0.00064792845,0.0005967771,0.00063612236,0.0016186291,0.0022219021,0.005127608,0.0015263567,0.0009123555],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007279449,0.00011879136,0.0033176623,0.00034886433,0.000078609126,0.00086308114,0.0005701515,0.15781064,0.01834614,0.7791213,0.0071037277,0.031592987],"study_design_scores_gemma":[0.00009158153,0.0001640928,0.00096512237,0.00010270652,0.00005156175,0.000503179,0.00035073346,0.65273607,0.0059442315,0.33097455,0.00808476,0.000031434833],"about_ca_topic_score_codex":0.0012663708,"about_ca_topic_score_gemma":0.00059668894,"teacher_disagreement_score":0.007915402,"about_ca_system_score_codex":0.00053318235,"about_ca_system_score_gemma":0.00052820845,"threshold_uncertainty_score":0.026479661},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32192686,0.000278493,0.6741127,0.00013572782,0.00003931456,0.00007686546,0.00030475974,0.0006113009,0.0025140822],"genre_scores_gemma":[0.64210415,0.0002935154,0.3508563,0.00008427364,0.0000647865,0.00014413116,0.0013639538,0.00021661486,0.004872299],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990339,0.00012637668,0.00007598552,0.00031750317,0.00031550557,0.00013073209],"domain_scores_gemma":[0.9981141,0.00072354934,0.00039215124,0.0003777239,0.0002444007,0.00014805625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005154624,0.00093752675,0.0010550799,0.0020132554,0.0005731226,0.0013201344,0.0017582136,0.0008908372,0.00289758],"category_scores_gemma":[0.0044545075,0.0006726906,0.00093941024,0.0018020939,0.0009979878,0.0048835888,0.0027111226,0.001039767,0.00076337415],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042138266,0.0001929431,0.0070666745,0.0004548774,0.00020517541,0.0005497601,0.0007308618,0.55877167,0.02266257,0.20498088,0.002080281,0.20188288],"study_design_scores_gemma":[0.000026094493,0.0002104728,0.0010380168,0.00004422217,0.000060417115,0.00039959466,0.0002600068,0.7205925,0.013458838,0.25977814,0.0041006873,0.000031080435],"about_ca_topic_score_codex":0.0014086055,"about_ca_topic_score_gemma":0.0017808642,"teacher_disagreement_score":0.00289758,"about_ca_system_score_codex":0.00056264905,"about_ca_system_score_gemma":0.00030026806,"threshold_uncertainty_score":0.009693384},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34285516,0.00034573543,0.6124896,0.0005187194,0.00010907971,0.00026924722,0.0013035159,0.0010985129,0.041010473],"genre_scores_gemma":[0.67251325,0.00039748492,0.31405708,0.00016366142,0.000046144603,0.0003054456,0.0022950692,0.0004033859,0.009818469],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99949074,0.000076162636,0.00003028772,0.00009421016,0.00020062296,0.00010794421],"domain_scores_gemma":[0.99936515,0.00018298162,0.00009663848,0.00019470435,0.00009949411,0.00006114142],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020183093,0.00055400684,0.00073155883,0.00067615794,0.0008035314,0.00075714284,0.0010726736,0.0006479146,0.009531336],"category_scores_gemma":[0.0014138387,0.0005400718,0.0007452733,0.0013595828,0.00093448657,0.0015448873,0.001914293,0.0014737675,0.0012427133],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005087799,0.0002602872,0.0021168233,0.00044513904,0.00010462014,0.0005733701,0.000758869,0.33769947,0.03378883,0.41469038,0.018194115,0.19085932],"study_design_scores_gemma":[0.00015016447,0.0002544128,0.0009236876,0.00006450233,0.000038710536,0.000321446,0.00058553513,0.55627835,0.0118191065,0.41065022,0.018868545,0.000045283705],"about_ca_topic_score_codex":0.0012687915,"about_ca_topic_score_gemma":0.0025076785,"teacher_disagreement_score":0.009531336,"about_ca_system_score_codex":0.00075639534,"about_ca_system_score_gemma":0.0004347509,"threshold_uncertainty_score":0.031885564},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2835375,0.0004527356,0.7095749,0.0005316048,0.000049702106,0.00011658524,0.0002758006,0.0010070025,0.004454128],"genre_scores_gemma":[0.6910419,0.00040231628,0.30348486,0.00008238788,0.00006691881,0.00009714166,0.0012384865,0.00039720087,0.0031888057],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99834466,0.00031402693,0.000099514866,0.0004620597,0.0006350458,0.00014468588],"domain_scores_gemma":[0.99195963,0.0049162796,0.0009274414,0.0010575897,0.00067718147,0.00046177363],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015921429,0.00068241835,0.0016082481,0.001967579,0.0007618186,0.0025238132,0.0018311989,0.0016878969,0.0025664798],"category_scores_gemma":[0.015030369,0.00059778016,0.0010799798,0.0019633875,0.0016657804,0.0036135523,0.0030131668,0.0017554732,0.0007401822],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005556055,0.00012420642,0.0075571565,0.0003764003,0.00007921747,0.0004883089,0.00065737223,0.74246883,0.014712866,0.043311846,0.00286129,0.18680689],"study_design_scores_gemma":[0.000010171329,0.000055062723,0.00089061534,0.00001808307,0.000008187848,0.00014285944,0.000120763856,0.9631204,0.0030361929,0.031191701,0.0013913509,0.0000146917055],"about_ca_topic_score_codex":0.0028335871,"about_ca_topic_score_gemma":0.0021698177,"teacher_disagreement_score":0.0028335871,"about_ca_system_score_codex":0.0013510829,"about_ca_system_score_gemma":0.0007388474,"threshold_uncertainty_score":0.009802878},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48182517,0.0026902368,0.46842808,0.0009871528,0.00017703231,0.00011925899,0.00059361407,0.0006119313,0.044567585],"genre_scores_gemma":[0.9157809,0.0019790628,0.068021424,0.00018314416,0.0002105678,0.00010780001,0.000622236,0.00040534238,0.0126895],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99937314,0.000085822,0.000027169282,0.00016266722,0.00023746437,0.00011375013],"domain_scores_gemma":[0.99751174,0.0011214463,0.00047088586,0.00028849504,0.00025699812,0.00035042522],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007681868,0.00081924605,0.00082904665,0.001964036,0.0009118849,0.0018028754,0.0009431105,0.0008379335,0.009446721],"category_scores_gemma":[0.008195743,0.00051054475,0.0005367374,0.0013982913,0.002045756,0.0035626546,0.0021429902,0.0013302737,0.0010634597],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039406048,0.000061916864,0.003021381,0.00020041101,0.000035403194,0.0003485211,0.00069914473,0.12074942,0.008307748,0.77759284,0.0043052537,0.08428384],"study_design_scores_gemma":[0.00005293258,0.00012530437,0.0016847306,0.000091045586,0.000028024482,0.00040411658,0.00036966556,0.2839987,0.0035203078,0.6954024,0.014287536,0.00003521278],"about_ca_topic_score_codex":0.0028234115,"about_ca_topic_score_gemma":0.0016946363,"teacher_disagreement_score":0.009446721,"about_ca_system_score_codex":0.0013299772,"about_ca_system_score_gemma":0.00034464532,"threshold_uncertainty_score":0.031602383},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022674745,0.0052016866,0.7391601,0.0051210327,0.0030485291,0.00018139246,0.0023020275,0.0036158361,0.2186946],"genre_scores_gemma":[0.28658226,0.008060472,0.50873435,0.0024780584,0.0013134662,0.0003212008,0.005090694,0.0036133712,0.18380615],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991161,0.00020237472,0.000041449086,0.00022029123,0.00031920036,0.00010052806],"domain_scores_gemma":[0.99842286,0.00048471196,0.000093015486,0.000550258,0.0003227697,0.00012635553],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005373309,0.000999394,0.0005095685,0.0011297943,0.0009920001,0.0024472217,0.0011226626,0.0013928867,0.042708997],"category_scores_gemma":[0.005017204,0.00093485793,0.0007328154,0.0016222015,0.0011671754,0.0047223745,0.0021535563,0.0025352307,0.013079418],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000077213655,0.00002334553,0.0002508809,0.00026139783,0.000022454067,0.00013751676,0.00029136016,0.004851691,0.003814317,0.7772159,0.06810705,0.14494695],"study_design_scores_gemma":[0.000025501236,0.000034142493,0.00019075761,0.000092130846,0.000020321142,0.00037903516,0.00013968335,0.007903396,0.0030928473,0.7120164,0.27608082,0.000024910501],"about_ca_topic_score_codex":0.0005817727,"about_ca_topic_score_gemma":0.001030753,"teacher_disagreement_score":0.042708997,"about_ca_system_score_codex":0.0007066564,"about_ca_system_score_gemma":0.0003799369,"threshold_uncertainty_score":0.14287579},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16046824,0.0005769875,0.8002415,0.00033401392,0.00015435473,0.00015892494,0.00051553594,0.00055198855,0.03699852],"genre_scores_gemma":[0.7081151,0.00087099004,0.2542778,0.00026994947,0.00009588691,0.00020867528,0.0008347462,0.00048920774,0.034837585],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99963975,0.000054602413,0.0000166245,0.00011525175,0.0001354787,0.00003821009],"domain_scores_gemma":[0.9994722,0.00013450829,0.00011815717,0.000098449855,0.000108940796,0.000067711684],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018010594,0.0006695265,0.00054828345,0.0011764505,0.00056195044,0.001356013,0.0009789505,0.00085509976,0.009845913],"category_scores_gemma":[0.0011954267,0.0005052225,0.00043052426,0.0013430562,0.0009488988,0.0018335982,0.0019739799,0.0011296953,0.0014752812],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010253902,0.000055226414,0.0010644352,0.00022226656,0.000039472718,0.0004915362,0.00036754427,0.09208482,0.015227105,0.76317346,0.0051152715,0.12205636],"study_design_scores_gemma":[0.000023662407,0.00008333824,0.0010998147,0.00008192868,0.000028654846,0.00066813105,0.00046879082,0.20875639,0.009290104,0.7399912,0.0394673,0.000040754683],"about_ca_topic_score_codex":0.0009014738,"about_ca_topic_score_gemma":0.0015716277,"teacher_disagreement_score":0.009845913,"about_ca_system_score_codex":0.0004071219,"about_ca_system_score_gemma":0.00031793345,"threshold_uncertainty_score":0.032937884},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27641457,0.002258588,0.67599463,0.0014406584,0.00014690468,0.0001380592,0.00090972113,0.0007272111,0.041969694],"genre_scores_gemma":[0.85253805,0.0015443446,0.13764003,0.0002393123,0.00027823847,0.00030541068,0.0011370766,0.000340097,0.0059774416],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99644166,0.0005800627,0.00020669776,0.0010342102,0.0011120896,0.00062533445],"domain_scores_gemma":[0.98274773,0.009334623,0.0022857268,0.0028691867,0.0014791656,0.0012835603],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016206863,0.0017751415,0.0014946958,0.003946914,0.0017241965,0.0025499966,0.0038457594,0.0015035135,0.006189094],"category_scores_gemma":[0.016939431,0.0009890095,0.0019926017,0.0032678747,0.002388511,0.008010873,0.0040976987,0.0039251233,0.0011553526],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00081430894,0.00025012586,0.0156101035,0.00089283846,0.00034961337,0.0010035528,0.0011597036,0.22691382,0.04060773,0.588812,0.007502481,0.11608376],"study_design_scores_gemma":[0.000045498044,0.00023390912,0.005501291,0.00016223702,0.00017673032,0.0013053018,0.0003081746,0.5105429,0.021617416,0.44506449,0.01492254,0.00011957692],"about_ca_topic_score_codex":0.0008193767,"about_ca_topic_score_gemma":0.0010571142,"teacher_disagreement_score":0.006189094,"about_ca_system_score_codex":0.00258793,"about_ca_system_score_gemma":0.0006078146,"threshold_uncertainty_score":0.020704627},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018635655,0.00021953059,0.9742727,0.000051153565,0.000032230353,0.0001032436,0.00014439737,0.0002151646,0.006325976],"genre_scores_gemma":[0.251494,0.00066696986,0.73806995,0.0000767008,0.000052155123,0.0002993699,0.0009724824,0.0005973738,0.0077710203],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992067,0.00018373453,0.000051691924,0.00019922733,0.00029537347,0.00006325834],"domain_scores_gemma":[0.99837995,0.00071749097,0.00021820536,0.0003258927,0.00022296768,0.00013563107],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006406527,0.00055072625,0.00069309206,0.0015418307,0.00060415344,0.0017857365,0.0013145067,0.00063909125,0.0044842125],"category_scores_gemma":[0.0046590045,0.00076614495,0.0005816812,0.0015585093,0.0017410632,0.0015574049,0.0025111183,0.0019272766,0.0010115992],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000196409,0.00008492357,0.0014813809,0.000256008,0.000021510861,0.00043301957,0.0009669458,0.13827138,0.018145986,0.6393994,0.0045802025,0.19616292],"study_design_scores_gemma":[0.000040922667,0.00010473405,0.00076995837,0.00015003105,0.00003318332,0.0006317494,0.0005996236,0.6171454,0.014986835,0.31931382,0.04618441,0.000039381976],"about_ca_topic_score_codex":0.0012313542,"about_ca_topic_score_gemma":0.0017975662,"teacher_disagreement_score":0.0044842125,"about_ca_system_score_codex":0.00048529828,"about_ca_system_score_gemma":0.00041914833,"threshold_uncertainty_score":0.015001178},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.454968,0.0072628898,0.42646107,0.00398628,0.00029433783,0.0001854427,0.003995338,0.0018492049,0.100997455],"genre_scores_gemma":[0.910112,0.002955673,0.06638208,0.00075177377,0.00037390387,0.00042823626,0.0026288312,0.0005991314,0.015768379],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974269,0.00038538888,0.00014921831,0.0007372724,0.0007678386,0.00053329556],"domain_scores_gemma":[0.9845333,0.011118649,0.00080171967,0.0014246976,0.0008473445,0.0012741693],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019425747,0.0016971462,0.0013776047,0.0023100346,0.0010556465,0.0043205977,0.0027338124,0.0014187801,0.010388961],"category_scores_gemma":[0.013226108,0.0008988176,0.0018072313,0.0012606814,0.0028500399,0.009904748,0.0049204114,0.00395208,0.0013389278],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006437687,0.00015398464,0.0065082177,0.0007060888,0.00010649404,0.00032024886,0.0004225358,0.045038626,0.015024084,0.89465994,0.0050696856,0.03134634],"study_design_scores_gemma":[0.00006619106,0.00020464411,0.0029517564,0.00018872954,0.000097312935,0.0005572329,0.00012730184,0.12813513,0.012155983,0.84473133,0.01070911,0.0000752456],"about_ca_topic_score_codex":0.00082118553,"about_ca_topic_score_gemma":0.0008993093,"teacher_disagreement_score":0.010388961,"about_ca_system_score_codex":0.0022185228,"about_ca_system_score_gemma":0.0008035822,"threshold_uncertainty_score":0.034754574},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43922868,0.00078422186,0.44970864,0.0009965623,0.00021411675,0.00012699483,0.00068712194,0.00056488323,0.10768866],"genre_scores_gemma":[0.89100516,0.00053351966,0.074257046,0.00021652444,0.00015932959,0.00015013164,0.001375863,0.00044351892,0.031858835],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99920017,0.00013264608,0.00004556132,0.0002244999,0.00027183874,0.00012531593],"domain_scores_gemma":[0.9971512,0.0014151122,0.00041459754,0.00047155362,0.00026414075,0.00028340163],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005568601,0.00053119514,0.0008185749,0.0016325348,0.0014543356,0.0033407265,0.0011915484,0.0011613856,0.01310598],"category_scores_gemma":[0.0053181797,0.0008342742,0.0009321256,0.0014671128,0.0024898176,0.0030153894,0.0030249374,0.0025141381,0.0012823701],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029265642,0.00005455731,0.0013272127,0.00016771612,0.000019815036,0.0002277064,0.0005631895,0.018284185,0.0038946243,0.94037366,0.00442695,0.030367805],"study_design_scores_gemma":[0.000073612,0.00006354193,0.0009293416,0.00006593052,0.00003037955,0.00035162992,0.00035719216,0.09914183,0.0059733856,0.8739126,0.019077096,0.00002347695],"about_ca_topic_score_codex":0.0011081584,"about_ca_topic_score_gemma":0.0008061577,"teacher_disagreement_score":0.01310598,"about_ca_system_score_codex":0.0009772084,"about_ca_system_score_gemma":0.00052122376,"threshold_uncertainty_score":0.043843925},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34799862,0.0012885679,0.53613824,0.0010952201,0.00029436432,0.00016973044,0.0005440187,0.0005816853,0.11188955],"genre_scores_gemma":[0.7397911,0.0009183293,0.23927952,0.00027353154,0.00007065708,0.0001626315,0.0009889193,0.00032741996,0.018187921],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986981,0.00027495262,0.00009509632,0.0003808247,0.0003031843,0.0002477777],"domain_scores_gemma":[0.99543947,0.0023362462,0.0005453925,0.00087009266,0.0003623665,0.00044640535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008205172,0.00050794636,0.0007825702,0.0007927317,0.0013569238,0.0020982597,0.00112042,0.0012187115,0.014964043],"category_scores_gemma":[0.008235183,0.00059411203,0.0008692452,0.00061739655,0.0016823241,0.0050379676,0.0019492806,0.0013874269,0.0027417697],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046398462,0.000088806984,0.0072361566,0.00055471034,0.00006336757,0.0007891854,0.0008737002,0.02449947,0.015579916,0.82591605,0.0062937858,0.11764087],"study_design_scores_gemma":[0.00006390932,0.00012983527,0.0025929043,0.00026187155,0.0000520724,0.0016063408,0.000938368,0.055756766,0.023510316,0.8282827,0.08671314,0.000091651564],"about_ca_topic_score_codex":0.0010497705,"about_ca_topic_score_gemma":0.002284172,"teacher_disagreement_score":0.014964043,"about_ca_system_score_codex":0.0006058458,"about_ca_system_score_gemma":0.00044963465,"threshold_uncertainty_score":0.050059736},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1408437,0.00016724158,0.85204524,0.00036363787,0.000059990547,0.00013937024,0.0002636603,0.0006006981,0.0055164155],"genre_scores_gemma":[0.6710809,0.00033003255,0.32156393,0.00011904536,0.000043030017,0.00029748274,0.00060982356,0.00022627194,0.005729484],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983669,0.0003850965,0.00010026221,0.00047459512,0.00040991156,0.0002632898],"domain_scores_gemma":[0.99555063,0.0016610026,0.00064386806,0.0017381536,0.00024271382,0.00016366302],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00108657,0.0014976085,0.0010346752,0.0005976073,0.0008143228,0.0010544237,0.0021061331,0.0016662364,0.00520331],"category_scores_gemma":[0.009452291,0.0009177134,0.0012022589,0.0012855075,0.0014737949,0.0043337443,0.003125679,0.0020713895,0.0011401888],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00086841604,0.00025660355,0.003911336,0.00028153427,0.000116720534,0.0006033532,0.00041263824,0.69756615,0.03516496,0.11354596,0.002764657,0.14450766],"study_design_scores_gemma":[0.00010528163,0.0005439506,0.0012875181,0.0000587841,0.00007120363,0.00058182114,0.0003522967,0.8243367,0.043576434,0.118871965,0.010145417,0.00006856989],"about_ca_topic_score_codex":0.001014495,"about_ca_topic_score_gemma":0.0015606991,"teacher_disagreement_score":0.00520331,"about_ca_system_score_codex":0.00090736384,"about_ca_system_score_gemma":0.0005228342,"threshold_uncertainty_score":0.017406821},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36578047,0.0012589425,0.61654586,0.0009981594,0.00005358788,0.00019125988,0.0017274616,0.0009651299,0.012479147],"genre_scores_gemma":[0.8560918,0.00074871257,0.13707797,0.00008406277,0.00005970387,0.0001887423,0.001389458,0.00014223422,0.004217399],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991074,0.00025702655,0.000041371633,0.00020417348,0.00020315495,0.00018689292],"domain_scores_gemma":[0.9981173,0.001183634,0.0002141276,0.00022028117,0.00011254929,0.00015199264],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040434868,0.0010912832,0.0014154162,0.0007905452,0.00062695885,0.0014046932,0.0020708563,0.0012551425,0.0034770307],"category_scores_gemma":[0.003958397,0.000628849,0.00093339564,0.0019198239,0.00076954777,0.0021468247,0.0013670173,0.0009148098,0.00057954603],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002846688,0.000076309916,0.00079728075,0.00015489591,0.000043803422,0.0002165109,0.00014495598,0.96352893,0.0027270927,0.012976298,0.002252095,0.016797127],"study_design_scores_gemma":[0.000036630834,0.000058532954,0.00028560287,0.000010980368,0.000011427841,0.00011832984,0.00006545802,0.9826613,0.001274305,0.014123963,0.0013457432,0.000007764387],"about_ca_topic_score_codex":0.005128082,"about_ca_topic_score_gemma":0.002921513,"teacher_disagreement_score":0.005128082,"about_ca_system_score_codex":0.0014105977,"about_ca_system_score_gemma":0.0005797012,"threshold_uncertainty_score":0.011631846},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30922374,0.00030711025,0.67331105,0.0008080571,0.00005694242,0.00033822976,0.0006334452,0.00094295165,0.014378498],"genre_scores_gemma":[0.6548871,0.000303319,0.33859447,0.00015251066,0.000065560496,0.0003360326,0.0017888705,0.00019738753,0.0036746727],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986528,0.00044785836,0.00007719786,0.00037208854,0.00032044743,0.00012958203],"domain_scores_gemma":[0.99566674,0.0025038633,0.00051739963,0.0008273253,0.0002323629,0.00025227736],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093696325,0.0010526432,0.00080180087,0.0008056989,0.0007327914,0.0012567372,0.0016857625,0.0012634661,0.0042122663],"category_scores_gemma":[0.0063980045,0.00073351274,0.0010631654,0.0013154743,0.001562391,0.003911686,0.002556912,0.0012916236,0.0005462213],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00076674344,0.00037174937,0.00574421,0.0007843945,0.00009707531,0.001474913,0.0008793888,0.4696867,0.032603692,0.3296473,0.0061477977,0.15179598],"study_design_scores_gemma":[0.00009947747,0.00024108875,0.0013207593,0.00008342004,0.000050645576,0.00097973,0.00036034026,0.66948897,0.019584764,0.2965035,0.011238258,0.000049055925],"about_ca_topic_score_codex":0.0006915695,"about_ca_topic_score_gemma":0.0007874059,"teacher_disagreement_score":0.0042122663,"about_ca_system_score_codex":0.00064009184,"about_ca_system_score_gemma":0.00047573136,"threshold_uncertainty_score":0.014091432},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024739448,0.0009076478,0.9251249,0.00031350454,0.0002712196,0.00007332094,0.00043656706,0.0005687271,0.04756456],"genre_scores_gemma":[0.39714822,0.0027581805,0.51022536,0.00019512301,0.00020432146,0.00026660922,0.0016126398,0.0013906631,0.08619897],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99957675,0.00006432785,0.000023325705,0.00007424348,0.00023148874,0.000029832325],"domain_scores_gemma":[0.9998074,0.00004714169,0.000021632577,0.000052940137,0.000045777477,0.000025097052],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025529834,0.0009795009,0.0010851874,0.0008197044,0.000761122,0.0015925377,0.001414341,0.0009590993,0.008373225],"category_scores_gemma":[0.00084811635,0.000630069,0.0005670135,0.0013385925,0.0020400875,0.0015509836,0.0025706934,0.0021477146,0.003323772],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004693038,0.000018298715,0.00012578149,0.00019332374,0.0000126934265,0.00008307506,0.000277732,0.08396375,0.0041526183,0.8210824,0.006986314,0.08305708],"study_design_scores_gemma":[0.000021079111,0.00007141787,0.0002333204,0.000081739454,0.000009717855,0.0002681578,0.0002153484,0.17634316,0.0022553334,0.7662517,0.05421892,0.000030080246],"about_ca_topic_score_codex":0.0018771993,"about_ca_topic_score_gemma":0.0019344883,"teacher_disagreement_score":0.008373225,"about_ca_system_score_codex":0.0006190806,"about_ca_system_score_gemma":0.00045974637,"threshold_uncertainty_score":0.028011262},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13452114,0.014138243,0.6940176,0.010205367,0.0010393442,0.00027641264,0.0028871694,0.0049830466,0.13793167],"genre_scores_gemma":[0.63208497,0.01145703,0.31683403,0.005837228,0.00203223,0.0008851824,0.0052442546,0.002902692,0.022722345],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9911951,0.0019005558,0.0003286877,0.001916797,0.002531485,0.0021273333],"domain_scores_gemma":[0.9752922,0.014962038,0.0014276896,0.0047828592,0.0020521462,0.0014830539],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00607076,0.0042590415,0.002610638,0.0055555073,0.002365226,0.0063508656,0.0062881312,0.002866113,0.019774098],"category_scores_gemma":[0.03700491,0.0023263928,0.0030796886,0.006190088,0.003812246,0.020755136,0.0074715517,0.011069686,0.007363762],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012260702,0.00056265615,0.0044956165,0.0011564977,0.0002611145,0.0003624383,0.00081729935,0.12970537,0.016344687,0.6542691,0.045399938,0.14539924],"study_design_scores_gemma":[0.00012663165,0.00023318439,0.0019074082,0.0003420222,0.00018151657,0.0004496018,0.00037890786,0.23063004,0.006882158,0.7176085,0.041175652,0.00008435743],"about_ca_topic_score_codex":0.0040571885,"about_ca_topic_score_gemma":0.004474168,"teacher_disagreement_score":0.019774098,"about_ca_system_score_codex":0.0055698217,"about_ca_system_score_gemma":0.0019472851,"threshold_uncertainty_score":0.06615096},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06958475,0.003002205,0.8622837,0.00214576,0.0003206419,0.00026159774,0.0015830664,0.0054032984,0.055415034],"genre_scores_gemma":[0.25382552,0.0021646698,0.72152126,0.0006778765,0.0002521175,0.0006000658,0.0029763386,0.0022774388,0.015704693],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996433,0.00073430984,0.00022218234,0.0006042475,0.001337654,0.0006686796],"domain_scores_gemma":[0.9831972,0.009585825,0.0010776626,0.004194548,0.0012333764,0.00071134954],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020895298,0.0021516862,0.0016685742,0.0019574696,0.001372366,0.00427119,0.004345042,0.001793781,0.024245],"category_scores_gemma":[0.018655756,0.0015583371,0.0023826407,0.003300914,0.0018587381,0.011214425,0.005006898,0.0043963483,0.0068630464],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011925213,0.00045598645,0.0040278276,0.001576005,0.00022671281,0.00047878936,0.0010716484,0.29848945,0.028203748,0.28119254,0.043987587,0.33909723],"study_design_scores_gemma":[0.00018101431,0.00032558598,0.0013997176,0.0002708129,0.00019064426,0.00041379346,0.00028091515,0.67048043,0.015939519,0.276457,0.03395641,0.00010416561],"about_ca_topic_score_codex":0.0040536043,"about_ca_topic_score_gemma":0.009195019,"teacher_disagreement_score":0.024245,"about_ca_system_score_codex":0.0031772964,"about_ca_system_score_gemma":0.0012985824,"threshold_uncertainty_score":0.08110756},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.58696765,0.0052232817,0.34105974,0.0016537181,0.00015878228,0.0001236284,0.0019265666,0.0009923297,0.06189439],"genre_scores_gemma":[0.943302,0.0014801781,0.05049189,0.00035256732,0.0001029032,0.000116478666,0.0011202259,0.00027313907,0.0027606704],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986325,0.00033341945,0.000057893052,0.00029974844,0.000398791,0.00027760214],"domain_scores_gemma":[0.9923483,0.005049359,0.00078102556,0.00072412106,0.000559821,0.0005374312],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017321339,0.0014560352,0.0008973928,0.0023845218,0.001046654,0.0015381435,0.0017185573,0.0008641952,0.008387978],"category_scores_gemma":[0.013770813,0.000690843,0.00069012144,0.0025365222,0.0012299041,0.0033232174,0.0020078209,0.0017941889,0.00091997435],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011039422,0.00025054842,0.010574831,0.0009165488,0.00027490905,0.0007508095,0.0005188132,0.30656028,0.044197123,0.51670593,0.015743377,0.102402896],"study_design_scores_gemma":[0.000072129376,0.0002445483,0.008010971,0.00019289553,0.00010426446,0.0017452606,0.0003775145,0.5188368,0.016019315,0.44391903,0.010384631,0.00009261833],"about_ca_topic_score_codex":0.0007567548,"about_ca_topic_score_gemma":0.0008334964,"teacher_disagreement_score":0.008387978,"about_ca_system_score_codex":0.0009667345,"about_ca_system_score_gemma":0.0003446509,"threshold_uncertainty_score":0.028060615},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11432308,0.00035178216,0.85280174,0.00031614793,0.00012560717,0.00021579472,0.0022792388,0.0007755481,0.02881112],"genre_scores_gemma":[0.3582523,0.00058980996,0.61908877,0.0001060252,0.000052224048,0.00030306893,0.0045222775,0.0012615353,0.015823973],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99942505,0.00011344532,0.00004341268,0.00013909703,0.00019594081,0.000083051025],"domain_scores_gemma":[0.99866474,0.0006506942,0.00019231836,0.00020959323,0.00020846614,0.000074308286],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045727188,0.00094920665,0.00102527,0.001328104,0.0005328252,0.0017076731,0.0011629803,0.0009729262,0.011144802],"category_scores_gemma":[0.005378228,0.0007711484,0.0007388784,0.0014502358,0.00066371914,0.0022951958,0.0012154347,0.0014653514,0.0017119552],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007788041,0.00022516768,0.0023681112,0.00090909534,0.00004635837,0.00040751218,0.00054755993,0.33583942,0.018982753,0.37381893,0.015887748,0.25018853],"study_design_scores_gemma":[0.000101124206,0.0001693058,0.0012180838,0.00015147337,0.00003061059,0.00048552768,0.00036249647,0.5758457,0.017306507,0.3834349,0.020852659,0.000041708805],"about_ca_topic_score_codex":0.0011472404,"about_ca_topic_score_gemma":0.0016930262,"teacher_disagreement_score":0.011144802,"about_ca_system_score_codex":0.00063948723,"about_ca_system_score_gemma":0.0005270625,"threshold_uncertainty_score":0.037283003},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1292861,0.001400251,0.8476644,0.0011462199,0.0001588831,0.00014895952,0.0005970909,0.0029386804,0.016659427],"genre_scores_gemma":[0.43627575,0.0008580506,0.5531817,0.000385555,0.00014219519,0.00017735641,0.001186724,0.00073386414,0.0070587816],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99900776,0.00021726433,0.000042397936,0.00024136924,0.00029621075,0.00019508779],"domain_scores_gemma":[0.9969944,0.0016582977,0.00027527736,0.00067965983,0.00019745022,0.00019498318],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093056745,0.0011975762,0.000926038,0.0010170484,0.00066194753,0.0021081564,0.0018968496,0.0014327515,0.008596984],"category_scores_gemma":[0.007314991,0.0006469252,0.00090987526,0.0014972193,0.0008477051,0.003683416,0.0023113834,0.0022939555,0.0022186073],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012574148,0.0003619147,0.0059969807,0.0007205534,0.0001430327,0.00042553904,0.00091701397,0.3201917,0.041864995,0.21711093,0.02660828,0.38440168],"study_design_scores_gemma":[0.00014684518,0.0002298225,0.0010559567,0.00007754516,0.00006212778,0.00043276677,0.0002013009,0.77660114,0.013617793,0.19133835,0.016194807,0.00004152186],"about_ca_topic_score_codex":0.0010414629,"about_ca_topic_score_gemma":0.0017731239,"teacher_disagreement_score":0.008596984,"about_ca_system_score_codex":0.0013510179,"about_ca_system_score_gemma":0.0008069701,"threshold_uncertainty_score":0.028759778},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009129491,0.03580878,0.48286122,0.009752339,0.0119736735,0.00027972055,0.0028333392,0.0018879519,0.44547355],"genre_scores_gemma":[0.19836694,0.03920787,0.43611887,0.009089119,0.009928522,0.0009035725,0.0045752353,0.0026107912,0.29919913],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99909985,0.00009244197,0.000050555962,0.00016885962,0.0005126576,0.00007574655],"domain_scores_gemma":[0.9986052,0.00070943875,0.000068087706,0.00014282232,0.00034537519,0.00012910184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007394954,0.0016405768,0.0006884329,0.0021803332,0.0017475687,0.0023230475,0.0012753255,0.001093093,0.042691223],"category_scores_gemma":[0.0040200376,0.0010374982,0.0011106969,0.0021392147,0.0025887266,0.0039894143,0.0040768986,0.0050470014,0.013712915],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005889657,0.000048739224,0.00028706866,0.0009839835,0.000035172536,0.00056019414,0.0003907303,0.0057719937,0.0070806528,0.7580421,0.10084994,0.12589057],"study_design_scores_gemma":[0.000014800611,0.0000487706,0.0005311458,0.00031646914,0.000021728223,0.00057909644,0.0001117869,0.0034863632,0.0021894204,0.5670183,0.42563757,0.000044525972],"about_ca_topic_score_codex":0.0016754374,"about_ca_topic_score_gemma":0.0020815292,"teacher_disagreement_score":0.042691223,"about_ca_system_score_codex":0.001854614,"about_ca_system_score_gemma":0.00064452784,"threshold_uncertainty_score":0.14281642},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013527746,0.00019800922,0.97389936,0.00013825222,0.00017641562,0.000058802878,0.00017680705,0.0005200902,0.011304504],"genre_scores_gemma":[0.31842637,0.00056645216,0.6590828,0.00033691147,0.0001843083,0.00025682442,0.00081586296,0.00084328785,0.019487204],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996742,0.00005851234,0.000014773399,0.000087139415,0.00012517335,0.000040221083],"domain_scores_gemma":[0.99966383,0.00006629875,0.00004250949,0.0001015654,0.00009426719,0.000031521093],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006348003,0.0007541875,0.00057600695,0.000809199,0.0005778816,0.0015106156,0.0011527187,0.0009784409,0.011513341],"category_scores_gemma":[0.0015562782,0.00038565954,0.0005709986,0.0006384532,0.00084944104,0.0013403383,0.0013187156,0.0011435285,0.0025258823],"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.00016109782,0.000056420773,0.0006233176,0.00012054869,0.000024605713,0.00017503722,0.00025530893,0.13953453,0.024698237,0.6882468,0.008282919,0.13782121],"study_design_scores_gemma":[0.00005441167,0.00018483627,0.0005067304,0.00004748564,0.000018946756,0.00024003889,0.00015063009,0.7803715,0.01618122,0.14608961,0.056104746,0.00004987184],"about_ca_topic_score_codex":0.001350088,"about_ca_topic_score_gemma":0.0012625091,"teacher_disagreement_score":0.011513341,"about_ca_system_score_codex":0.000606332,"about_ca_system_score_gemma":0.00047959475,"threshold_uncertainty_score":0.038515985},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.106801696,0.0008082006,0.85727483,0.0007088232,0.00009318701,0.00022281139,0.0013978025,0.000800119,0.03189253],"genre_scores_gemma":[0.3736022,0.00077564846,0.60494304,0.00015419043,0.00009079312,0.0002862953,0.002961306,0.0002905219,0.0168961],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99926823,0.00016333406,0.000051343024,0.0001985751,0.00022441417,0.00009410003],"domain_scores_gemma":[0.9990227,0.000441834,0.00010655858,0.0002428221,0.00012205333,0.00006396757],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000576673,0.0009080064,0.00086364115,0.000982138,0.00051999686,0.0012699595,0.0010975108,0.00056708266,0.0072549433],"category_scores_gemma":[0.0033805235,0.0005935732,0.00085509976,0.0014061399,0.0006676475,0.0023288082,0.0017019947,0.0010793298,0.001103325],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005566749,0.000122836,0.0026323926,0.0005381521,0.000085351276,0.00035977605,0.00048097558,0.3701314,0.013584062,0.2829782,0.016302103,0.31222814],"study_design_scores_gemma":[0.00008866197,0.000111688496,0.00119849,0.00008388888,0.00002679522,0.00029591133,0.00020920354,0.7603098,0.0087223565,0.20013168,0.028796094,0.000025360592],"about_ca_topic_score_codex":0.001345474,"about_ca_topic_score_gemma":0.0019341093,"teacher_disagreement_score":0.0072549433,"about_ca_system_score_codex":0.000633305,"about_ca_system_score_gemma":0.00046149455,"threshold_uncertainty_score":0.024270177},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33871838,0.0008505282,0.649857,0.0006188639,0.00005014598,0.0001500603,0.0012894745,0.0014104532,0.0070551154],"genre_scores_gemma":[0.736358,0.0003775567,0.25935704,0.00008122996,0.00003865603,0.00010726754,0.0014648981,0.00028581635,0.0019295182],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988335,0.00017983647,0.000059728613,0.00020284877,0.0003903857,0.0003336612],"domain_scores_gemma":[0.9955388,0.0030095207,0.0004262042,0.00048184942,0.0003097034,0.0002338705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009728799,0.00072106544,0.0011573425,0.0013448738,0.00091501814,0.0019589262,0.0012429298,0.0012532085,0.0033565115],"category_scores_gemma":[0.00833622,0.0006898919,0.0010827642,0.0015568939,0.0011671537,0.0029342375,0.0024804461,0.0010243098,0.0004970889],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012410633,0.00019356325,0.0124596115,0.0005351866,0.00013578866,0.00079334894,0.00060939713,0.7623276,0.025686434,0.03679287,0.0059219874,0.15330304],"study_design_scores_gemma":[0.000045340803,0.0001134981,0.002322026,0.00004263422,0.000043746735,0.00027224416,0.00022567206,0.9433773,0.008786742,0.042103056,0.002641108,0.000026615568],"about_ca_topic_score_codex":0.0056912745,"about_ca_topic_score_gemma":0.0069805738,"teacher_disagreement_score":0.0056912745,"about_ca_system_score_codex":0.00069491117,"about_ca_system_score_gemma":0.0009862083,"threshold_uncertainty_score":0.01131624},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3509757,0.0017766225,0.52282375,0.0013765986,0.00046657838,0.00013073228,0.0007069524,0.0008522279,0.12089083],"genre_scores_gemma":[0.84306866,0.0009882292,0.13769731,0.00037297385,0.00018174523,0.00023929702,0.00097127183,0.000277721,0.016202858],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99883705,0.00015883379,0.000047598496,0.00035697457,0.00038572896,0.00021390447],"domain_scores_gemma":[0.9973031,0.0009478277,0.00067721464,0.00044145726,0.00032866347,0.00030181525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036436215,0.00082446245,0.0005891173,0.0014773401,0.0014359457,0.0020814321,0.0015173524,0.0010486277,0.010619083],"category_scores_gemma":[0.0051544956,0.00077618205,0.0008568966,0.0015204853,0.0024482135,0.0025080922,0.0046832156,0.0024647731,0.0017491298],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002876628,0.00008268271,0.0045684646,0.00028139708,0.00005253478,0.00085821794,0.0007448843,0.02362357,0.011749953,0.88214463,0.006419525,0.06918654],"study_design_scores_gemma":[0.00014470227,0.00037143996,0.0038194042,0.00023621896,0.00012773986,0.002837677,0.0012143153,0.15995726,0.028144795,0.7031388,0.09986299,0.00014469786],"about_ca_topic_score_codex":0.0018467737,"about_ca_topic_score_gemma":0.0014168223,"teacher_disagreement_score":0.010619083,"about_ca_system_score_codex":0.0011052254,"about_ca_system_score_gemma":0.000498367,"threshold_uncertainty_score":0.03552437},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22540951,0.0009753841,0.7502987,0.001028187,0.00009715336,0.00030116676,0.00071190554,0.0020377673,0.019140251],"genre_scores_gemma":[0.60022247,0.0010446537,0.38133925,0.00045020581,0.000106240725,0.00042435137,0.0020778908,0.00060881075,0.013726125],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99903655,0.00016429891,0.000046651705,0.00016234358,0.00027246852,0.0003176927],"domain_scores_gemma":[0.998021,0.00079020037,0.00020056998,0.00066888676,0.00015310847,0.00016620908],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006211876,0.0011518784,0.0013779721,0.00075677526,0.0005557545,0.0019630222,0.0016709738,0.0009014764,0.010006506],"category_scores_gemma":[0.0031601065,0.000683433,0.001466365,0.00163431,0.00082099304,0.003983562,0.0022846253,0.0023852002,0.0023422153],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007829706,0.00040644006,0.0034453073,0.00038514604,0.00009795111,0.00043596956,0.00035041265,0.6569659,0.035007,0.07899655,0.014819051,0.20830728],"study_design_scores_gemma":[0.000045425517,0.00016598037,0.0006176029,0.00003186157,0.000031844287,0.0001783789,0.000104627004,0.93646747,0.0067084236,0.049774513,0.0058543305,0.00001943688],"about_ca_topic_score_codex":0.0034173555,"about_ca_topic_score_gemma":0.0040198616,"teacher_disagreement_score":0.010006506,"about_ca_system_score_codex":0.0012645682,"about_ca_system_score_gemma":0.0010398191,"threshold_uncertainty_score":0.03347516},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39548653,0.0009984733,0.5733354,0.00061953167,0.00011555467,0.00021838682,0.001102572,0.00045696087,0.02766652],"genre_scores_gemma":[0.914036,0.0006857178,0.069455154,0.00016917873,0.00009838077,0.00041319244,0.0024114465,0.00024567684,0.0124852],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99494535,0.0006641453,0.0005083044,0.00089906045,0.0019894312,0.000993765],"domain_scores_gemma":[0.98743165,0.005813078,0.002606225,0.0014075439,0.001588283,0.0011532123],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002420437,0.0011508781,0.0018513605,0.004061742,0.0033869848,0.0045184046,0.0030984285,0.0015868404,0.009737184],"category_scores_gemma":[0.015672423,0.0014335962,0.00182996,0.0038313405,0.0039510494,0.0069227237,0.009163403,0.0029468352,0.0017225993],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003692709,0.000066072964,0.004531047,0.00021765301,0.00008148976,0.0007233583,0.001183495,0.056089465,0.0024188387,0.91627014,0.0019388029,0.016110497],"study_design_scores_gemma":[0.00007173837,0.00010010098,0.0007937795,0.00009836267,0.00003191347,0.0005729313,0.00060696626,0.14363848,0.0023325013,0.8437931,0.00791042,0.000049615097],"about_ca_topic_score_codex":0.0024777115,"about_ca_topic_score_gemma":0.0015141814,"teacher_disagreement_score":0.009737184,"about_ca_system_score_codex":0.0020936423,"about_ca_system_score_gemma":0.00086543534,"threshold_uncertainty_score":0.032574177},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008463375,0.000046121593,0.99010044,0.000054104057,0.000024695493,0.000021753765,0.00001882775,0.00009366208,0.0011769645],"genre_scores_gemma":[0.36188197,0.00012558466,0.63469934,0.00010313874,0.000031933432,0.00022280261,0.00018749162,0.00013233656,0.0026153843],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996476,0.00012624706,0.000013697814,0.00003181501,0.00015835215,0.000022256849],"domain_scores_gemma":[0.99931264,0.0003238529,0.000058065838,0.00008475072,0.00017736132,0.00004340043],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088065956,0.0003279921,0.00037747558,0.0003872922,0.00023614705,0.00040671226,0.0005647646,0.00058538397,0.001538676],"category_scores_gemma":[0.0017125135,0.00026475912,0.000486515,0.00031825734,0.00052433315,0.00031211672,0.0008296291,0.00069341215,0.0003261191],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007747825,0.000037275793,0.00054263824,0.00006582233,0.000021862503,0.000057337278,0.000059595983,0.8920451,0.014060885,0.06295278,0.0011844523,0.028894864],"study_design_scores_gemma":[0.0000032006778,0.0000044078456,0.000018354922,0.0000014801202,5.774666e-7,0.000004265688,0.0000011568101,0.9975762,0.00039770658,0.001708103,0.00028332675,0.0000012269737],"about_ca_topic_score_codex":0.0009331151,"about_ca_topic_score_gemma":0.00082336174,"teacher_disagreement_score":0.001538676,"about_ca_system_score_codex":0.0005398083,"about_ca_system_score_gemma":0.00055469054,"threshold_uncertainty_score":0.005147338},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01879259,0.001306044,0.9693002,0.0005532222,0.00013608902,0.00015312621,0.00028480263,0.0005760633,0.008897856],"genre_scores_gemma":[0.4196739,0.0026857438,0.56484944,0.00053268566,0.00038640443,0.0004657246,0.0013435881,0.0003593499,0.0097032115],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99838245,0.00040001154,0.000092851835,0.00031470982,0.0005738673,0.0002360694],"domain_scores_gemma":[0.99494815,0.002418382,0.0003549625,0.001697506,0.0003283211,0.000252698],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023165506,0.0012407529,0.0012648985,0.0013848876,0.0010229109,0.002199595,0.003970414,0.001918726,0.0062901643],"category_scores_gemma":[0.011164484,0.00059289753,0.0017225337,0.0026938412,0.0014473984,0.007281021,0.0037161172,0.0030287348,0.0016534029],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000358402,0.00026385795,0.0014356151,0.00044210188,0.000085731896,0.00015958658,0.000426542,0.20626988,0.0052516223,0.57486695,0.016393926,0.1940457],"study_design_scores_gemma":[0.0000351694,0.00008936275,0.00023051673,0.00004496369,0.000031572345,0.00026486325,0.000095696305,0.7038025,0.0019617695,0.28455493,0.008869127,0.000019551231],"about_ca_topic_score_codex":0.0021183467,"about_ca_topic_score_gemma":0.0024655636,"teacher_disagreement_score":0.0062901643,"about_ca_system_score_codex":0.00267914,"about_ca_system_score_gemma":0.0013348827,"threshold_uncertainty_score":0.021042705},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1993704,0.0036487072,0.69032747,0.006594592,0.0005247501,0.00023141569,0.0011309469,0.0007455769,0.09742613],"genre_scores_gemma":[0.79892284,0.0021627354,0.16780742,0.0024754829,0.0010958093,0.00046912365,0.0017829409,0.00050634856,0.02477738],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974342,0.00095723034,0.000108676366,0.0005868745,0.0005738632,0.00033915875],"domain_scores_gemma":[0.98313373,0.012090028,0.0014967619,0.0017324137,0.0007797386,0.0007673761],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048102317,0.0011087086,0.0015418137,0.0023157848,0.0021489186,0.004106644,0.0028717292,0.0024947133,0.019451907],"category_scores_gemma":[0.020817414,0.00078596995,0.0024463092,0.0024459881,0.003726827,0.011798595,0.0031499611,0.004108216,0.0011585106],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008285449,0.00007834747,0.0014445262,0.0002358824,0.00004124053,0.000095841395,0.00031764156,0.027035128,0.00096439285,0.9505314,0.006839682,0.012333033],"study_design_scores_gemma":[0.00004683044,0.000108496984,0.0011007211,0.00009249852,0.000042762706,0.00028551964,0.00029890498,0.115237296,0.0014889917,0.871709,0.009534633,0.00005441889],"about_ca_topic_score_codex":0.001322351,"about_ca_topic_score_gemma":0.0014377164,"teacher_disagreement_score":0.019451907,"about_ca_system_score_codex":0.002423641,"about_ca_system_score_gemma":0.0006358866,"threshold_uncertainty_score":0.06507313},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019405944,0.0006219991,0.96247494,0.0009513565,0.00017497229,0.00016587021,0.004392867,0.0030512349,0.008760772],"genre_scores_gemma":[0.28522334,0.0010418874,0.68581796,0.0004889316,0.00015033994,0.000710979,0.010271004,0.0010977632,0.015197776],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981432,0.0003421453,0.00022641441,0.00044676193,0.00070242834,0.0001390716],"domain_scores_gemma":[0.9945208,0.0014068519,0.0005605899,0.002438361,0.0008883407,0.00018508095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016307739,0.000705798,0.0010857462,0.0019967451,0.0015152703,0.002736782,0.0031565034,0.0011902449,0.010644704],"category_scores_gemma":[0.01243794,0.0006375481,0.0010961937,0.0033795037,0.0013650573,0.008928945,0.003269764,0.0021149798,0.004082897],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030414513,0.000111965266,0.0013098277,0.00035093696,0.00005126994,0.00008656941,0.0002762757,0.049134485,0.0032773046,0.7744493,0.023922537,0.1467253],"study_design_scores_gemma":[0.00006011987,0.00012483279,0.00043613033,0.00007618499,0.000037979666,0.0002902596,0.00014636217,0.22309458,0.006744311,0.71342266,0.055500094,0.00006646057],"about_ca_topic_score_codex":0.0043510287,"about_ca_topic_score_gemma":0.006203244,"teacher_disagreement_score":0.010644704,"about_ca_system_score_codex":0.0019063414,"about_ca_system_score_gemma":0.0019373953,"threshold_uncertainty_score":0.03561008},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6862424,0.0028882858,0.17468041,0.004779225,0.0005316288,0.00015340438,0.0005547833,0.00029380433,0.129876],"genre_scores_gemma":[0.9511781,0.00088374584,0.032843385,0.00025906245,0.00037799808,0.00008549436,0.00034210185,0.00017943395,0.013850609],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991842,0.0002911897,0.000035596266,0.00011841468,0.00020585956,0.00016479038],"domain_scores_gemma":[0.99588734,0.0030080632,0.00036114507,0.00021359848,0.0001883636,0.00034149445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010737736,0.0007625522,0.0013413911,0.0021248336,0.0018234105,0.0031022409,0.0022707798,0.002727407,0.010647281],"category_scores_gemma":[0.008784123,0.0007038527,0.00072996755,0.0016059957,0.002774507,0.0033561222,0.0027906706,0.0024772685,0.00038225183],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015848775,0.00005220488,0.00046902825,0.0001233399,0.000017118322,0.00017987896,0.00020318366,0.029277332,0.0006919087,0.95248634,0.003549082,0.01279213],"study_design_scores_gemma":[0.00004876858,0.000028320615,0.0004969757,0.000038174338,0.000014125987,0.00022708724,0.00025736698,0.11492798,0.0005910136,0.88119465,0.0021548292,0.000020639813],"about_ca_topic_score_codex":0.0012621742,"about_ca_topic_score_gemma":0.0012672052,"teacher_disagreement_score":0.010647281,"about_ca_system_score_codex":0.0011182693,"about_ca_system_score_gemma":0.00039502143,"threshold_uncertainty_score":0.035618663},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3178406,0.004344799,0.5992654,0.012836865,0.00059081655,0.0006686285,0.011177572,0.0065342328,0.04674117],"genre_scores_gemma":[0.7515506,0.0018288908,0.22282821,0.0012445218,0.00056519534,0.0006351651,0.006587128,0.0010509461,0.01370922],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967379,0.00045670354,0.00021808407,0.0010129323,0.00065440417,0.00091993867],"domain_scores_gemma":[0.9877221,0.008412977,0.0009964685,0.001730083,0.0004826298,0.00065570424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014596629,0.0022341786,0.003283147,0.0011750868,0.0023625798,0.0048127915,0.006257208,0.003024621,0.012154346],"category_scores_gemma":[0.012475,0.0015209262,0.0030271397,0.003151625,0.0025254572,0.011101259,0.004756094,0.00432187,0.002225006],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00342583,0.0009821703,0.00789295,0.002782451,0.0005176511,0.0012628931,0.0015109548,0.6414948,0.012142525,0.11311229,0.07614089,0.13873456],"study_design_scores_gemma":[0.00038342352,0.00020121795,0.0011272363,0.00011407576,0.00015973901,0.0008033833,0.0004995642,0.74728656,0.0036709679,0.23759241,0.008090588,0.0000707962],"about_ca_topic_score_codex":0.0050561037,"about_ca_topic_score_gemma":0.005280362,"teacher_disagreement_score":0.012154346,"about_ca_system_score_codex":0.002913573,"about_ca_system_score_gemma":0.002684752,"threshold_uncertainty_score":0.04066032},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8879861,0.00029754743,0.068012394,0.00078148616,0.00018940863,0.00006181212,0.00028064524,0.0004779722,0.041912578],"genre_scores_gemma":[0.988509,0.00011698064,0.006368385,0.00007199274,0.00006918458,0.00004590049,0.0002784201,0.00011368425,0.0044263736],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99925214,0.0001330786,0.000038148097,0.000094995856,0.0002027009,0.00027890338],"domain_scores_gemma":[0.9982393,0.00069155195,0.0002178594,0.00020145185,0.00014878457,0.00050113327],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041514673,0.0005350268,0.0007445102,0.0016064766,0.0017843473,0.0019481973,0.00066516455,0.0011694434,0.0058796415],"category_scores_gemma":[0.0023448798,0.0003988261,0.0011037093,0.0005525008,0.0028518075,0.0025081676,0.0034287842,0.0021261221,0.00043533125],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016618239,0.000068855756,0.0014428239,0.00010150169,0.0000172949,0.0007814105,0.0006762892,0.006212635,0.0067124073,0.97533494,0.00281856,0.005667149],"study_design_scores_gemma":[0.000037689693,0.00010689929,0.0018142229,0.000030034002,0.00001864082,0.0005605333,0.00053529686,0.0149089955,0.0028672288,0.97227263,0.006802178,0.000045692555],"about_ca_topic_score_codex":0.0006750868,"about_ca_topic_score_gemma":0.0005961521,"teacher_disagreement_score":0.0058796415,"about_ca_system_score_codex":0.0006937922,"about_ca_system_score_gemma":0.0003038716,"threshold_uncertainty_score":0.019669354},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041886732,0.00070931274,0.919911,0.0007602014,0.00014780372,0.00023079164,0.0010056751,0.0032177642,0.032130614],"genre_scores_gemma":[0.17381883,0.00042003483,0.812748,0.00027343424,0.000059709488,0.00027522212,0.002498636,0.000843691,0.009062466],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99858826,0.00041265582,0.00008561895,0.00042336728,0.00031009503,0.00018001776],"domain_scores_gemma":[0.99766016,0.0012150932,0.00021818117,0.00050015707,0.00024593662,0.0001604096],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008617956,0.00086812204,0.0009503188,0.000957491,0.0013163796,0.0021981157,0.0015471582,0.0014431573,0.021223191],"category_scores_gemma":[0.0058430927,0.0006509536,0.0012494446,0.0014362534,0.001158558,0.0050967685,0.0031380637,0.0018934078,0.0053961664],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035269445,0.00014965853,0.0014546192,0.000889123,0.00003148816,0.00039287453,0.0011814275,0.07297687,0.015168521,0.5093469,0.032684486,0.36537132],"study_design_scores_gemma":[0.00010113201,0.00012384904,0.0003852186,0.00020584234,0.00003518056,0.00048537485,0.00054506835,0.24807186,0.009642739,0.65819544,0.08216036,0.000047934845],"about_ca_topic_score_codex":0.0016927795,"about_ca_topic_score_gemma":0.0028191966,"teacher_disagreement_score":0.021223191,"about_ca_system_score_codex":0.0012958668,"about_ca_system_score_gemma":0.0009729874,"threshold_uncertainty_score":0.07099861},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.58522195,0.0008359624,0.33075437,0.00093665766,0.00016332834,0.00019947025,0.0034508554,0.0018669777,0.07657049],"genre_scores_gemma":[0.8878634,0.0006706249,0.08981724,0.0003777107,0.000082193445,0.000255814,0.0050810687,0.00048371896,0.015368152],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99978346,0.000028070825,0.000014159834,0.000059401453,0.00006591736,0.00004901179],"domain_scores_gemma":[0.9995609,0.00008266584,0.000077242636,0.00013711427,0.00008089488,0.00006123452],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013026736,0.00036830967,0.0004230397,0.00082535035,0.00080590387,0.0011831624,0.0006317364,0.00082834077,0.006545835],"category_scores_gemma":[0.0010507391,0.00026966754,0.00061402295,0.0011353024,0.00078958116,0.0019638753,0.00080707314,0.0011503311,0.0011460121],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022581436,0.00009604068,0.00276556,0.00026444116,0.00002935132,0.0010904096,0.00085196696,0.015804665,0.019508593,0.8123537,0.014781359,0.13222808],"study_design_scores_gemma":[0.000038108737,0.000085742286,0.0035904485,0.00009472739,0.000051505092,0.0019213313,0.0007577237,0.08442729,0.008043432,0.82863945,0.07229218,0.000058028916],"about_ca_topic_score_codex":0.001840865,"about_ca_topic_score_gemma":0.0013526935,"teacher_disagreement_score":0.006545835,"about_ca_system_score_codex":0.0005730871,"about_ca_system_score_gemma":0.00032545073,"threshold_uncertainty_score":0.021898031},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1000102,0.0019699468,0.8653846,0.0018994651,0.0003470158,0.00029524523,0.0028565258,0.010501379,0.016735667],"genre_scores_gemma":[0.38191423,0.00092818,0.593847,0.0010374073,0.0003169377,0.0005454811,0.0057363627,0.0014303671,0.01424411],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9945898,0.00069959735,0.0006141187,0.0013168,0.0017668589,0.0010128379],"domain_scores_gemma":[0.9922854,0.0024100195,0.0006280042,0.0036387176,0.00074113504,0.00029675965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015226621,0.0016038105,0.0026637134,0.0016778207,0.0022806365,0.004213249,0.0049984646,0.0031129923,0.014292363],"category_scores_gemma":[0.008834611,0.0010851765,0.0020654995,0.0075780125,0.0025330936,0.015064646,0.008696923,0.0029606211,0.0061225607],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0027931652,0.0006431795,0.005619751,0.0012700836,0.00018053422,0.00058548286,0.0016206675,0.16392638,0.036347248,0.29321304,0.061544463,0.43225598],"study_design_scores_gemma":[0.00034435574,0.0005671311,0.0013173505,0.00012410682,0.00010720657,0.000787063,0.0010461917,0.6450471,0.035904534,0.2657385,0.04881742,0.00019897136],"about_ca_topic_score_codex":0.007410379,"about_ca_topic_score_gemma":0.008150823,"teacher_disagreement_score":0.014292363,"about_ca_system_score_codex":0.0027679303,"about_ca_system_score_gemma":0.0023933027,"threshold_uncertainty_score":0.0478127},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28234226,0.00037917445,0.7005233,0.0003289672,0.000079861005,0.000059502036,0.00023063326,0.00022074886,0.015835484],"genre_scores_gemma":[0.76272124,0.00052028365,0.23082599,0.00010676011,0.00005395535,0.00007951856,0.00038402516,0.00021297204,0.0050953217],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994407,0.00012769892,0.0000247733,0.00012330973,0.00019044493,0.000093078794],"domain_scores_gemma":[0.9981589,0.0007815835,0.0003011578,0.0003195817,0.00028828054,0.00015053287],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058904797,0.00035240033,0.00033820167,0.00068147434,0.0006975626,0.00086624094,0.0007146414,0.0005854663,0.0034688027],"category_scores_gemma":[0.00529833,0.0005125209,0.0004216595,0.000605194,0.0014869686,0.0024903207,0.002121517,0.0016294925,0.0006287172],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015067247,0.0000304786,0.002347124,0.00017473046,0.000020585343,0.0005474115,0.00090094714,0.063759536,0.015035317,0.86760914,0.0016713174,0.04775264],"study_design_scores_gemma":[0.000036128287,0.0001004639,0.0015334409,0.00008820536,0.000018827704,0.0006584422,0.00054086256,0.16597861,0.00823277,0.8082563,0.014531181,0.000024670151],"about_ca_topic_score_codex":0.0006158125,"about_ca_topic_score_gemma":0.00087887736,"teacher_disagreement_score":0.0034688027,"about_ca_system_score_codex":0.0003561219,"about_ca_system_score_gemma":0.00026213133,"threshold_uncertainty_score":0.011604309},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5053328,0.00090219383,0.47247836,0.0014500058,0.00010580866,0.00041618032,0.002072041,0.000658481,0.016584162],"genre_scores_gemma":[0.6439795,0.000512233,0.34511322,0.000276898,0.00013354358,0.00043716657,0.0024275233,0.00033061558,0.006789322],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969055,0.0007556888,0.0002792,0.00088624115,0.00073397806,0.0004394427],"domain_scores_gemma":[0.9922627,0.0050130044,0.00093523733,0.00088205526,0.00039195875,0.0005149408],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024260667,0.0012573472,0.0023624764,0.002450848,0.0016581749,0.0032932237,0.0031537574,0.0025083725,0.008622825],"category_scores_gemma":[0.013630257,0.0014221903,0.002412975,0.0024948022,0.002807542,0.00820974,0.00514073,0.0020070912,0.0007825807],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010844701,0.000263142,0.0137275895,0.0007867413,0.0002544339,0.00088096986,0.0014210399,0.17656398,0.008370567,0.70869565,0.008441968,0.07950943],"study_design_scores_gemma":[0.00014947669,0.00022347854,0.0024364647,0.00014288789,0.00008804217,0.00077680976,0.00083321176,0.33221966,0.007596756,0.6447186,0.01073783,0.000076756165],"about_ca_topic_score_codex":0.0017088416,"about_ca_topic_score_gemma":0.0015417815,"teacher_disagreement_score":0.008622825,"about_ca_system_score_codex":0.0012818591,"about_ca_system_score_gemma":0.0007024683,"threshold_uncertainty_score":0.028846204},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34330896,0.0009857517,0.5998617,0.00087758934,0.00019521652,0.00010455836,0.0011174409,0.0010139563,0.052534785],"genre_scores_gemma":[0.8548332,0.0009504624,0.12711169,0.00026695005,0.00013773018,0.000156313,0.0016232273,0.00038283822,0.014537636],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986761,0.0001419031,0.00007410327,0.0005043046,0.00038029495,0.00022332522],"domain_scores_gemma":[0.99741226,0.0011466537,0.00040915422,0.00049566437,0.00030602067,0.0002301991],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043970294,0.0009608232,0.0008344476,0.001686469,0.0017290374,0.0022141584,0.0016217914,0.0008758261,0.009605356],"category_scores_gemma":[0.0024855305,0.0009880988,0.0010926485,0.0024009335,0.0029055385,0.003621491,0.0033097789,0.0018763685,0.0011545599],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014773497,0.0000589325,0.0013063137,0.0003351271,0.000080221056,0.0007243265,0.0009816586,0.018647466,0.011506139,0.9024231,0.0042552077,0.059533797],"study_design_scores_gemma":[0.000048355392,0.00012499302,0.0011215138,0.00006980729,0.00010903666,0.0011874842,0.00040176953,0.02608632,0.013982126,0.90854895,0.048246775,0.00007291189],"about_ca_topic_score_codex":0.001425704,"about_ca_topic_score_gemma":0.0013830371,"teacher_disagreement_score":0.009605356,"about_ca_system_score_codex":0.00060591084,"about_ca_system_score_gemma":0.00041054963,"threshold_uncertainty_score":0.032133102},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036325518,0.0006391361,0.9519402,0.00042628217,0.00010992944,0.00017452841,0.00036674508,0.0028212974,0.0071963593],"genre_scores_gemma":[0.119580686,0.00029198165,0.8742652,0.00013063085,0.00005851563,0.00019463216,0.001652263,0.0005868975,0.003239064],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990515,0.00015219077,0.00008598179,0.00025416815,0.0002590136,0.00019709754],"domain_scores_gemma":[0.9973775,0.0015076273,0.00022797906,0.000499475,0.00025462094,0.00013275802],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007987063,0.0016017288,0.0015014503,0.0011941667,0.000993956,0.0017528756,0.0023245688,0.0015207763,0.0082268175],"category_scores_gemma":[0.004352239,0.001082823,0.0016889604,0.0015181719,0.0011570867,0.0027612376,0.0022085893,0.0022354512,0.002336535],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007789093,0.00040475736,0.0018241678,0.0007293105,0.00009471499,0.00014431076,0.00030124284,0.41323885,0.013134744,0.040080976,0.021948852,0.5073192],"study_design_scores_gemma":[0.0001546695,0.00010599899,0.00037127372,0.000041645886,0.000028063749,0.00007794675,0.00011417118,0.9243917,0.0046712807,0.06518833,0.004832475,0.000022401488],"about_ca_topic_score_codex":0.004286555,"about_ca_topic_score_gemma":0.008583055,"teacher_disagreement_score":0.0082268175,"about_ca_system_score_codex":0.0013911016,"about_ca_system_score_gemma":0.0016495875,"threshold_uncertainty_score":0.027521431},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06458521,0.00031041424,0.92074394,0.00096111983,0.00009791466,0.000065622975,0.00030673872,0.0024188163,0.010510176],"genre_scores_gemma":[0.40991765,0.00034553904,0.5789321,0.000273802,0.00008223262,0.00024124846,0.0008669888,0.00068242906,0.008658073],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99901175,0.00021205866,0.00004772938,0.00026339106,0.00032892436,0.0001360873],"domain_scores_gemma":[0.99798834,0.0012643661,0.00014532224,0.00034898912,0.0001753516,0.000077570854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064497546,0.0007426091,0.00086466054,0.0006049451,0.000606981,0.0015566872,0.0012526851,0.00074903195,0.0064947824],"category_scores_gemma":[0.005282702,0.0003713557,0.000903687,0.0011416461,0.0010473591,0.0037976294,0.0021139826,0.001803314,0.001177312],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009093066,0.0001949311,0.0018525935,0.0005500144,0.00009651032,0.00027679626,0.0004708784,0.49944624,0.016240105,0.19698459,0.01737732,0.2656008],"study_design_scores_gemma":[0.000055729302,0.00006008158,0.00017438251,0.000011970222,0.0000135671435,0.000050795315,0.000055795885,0.9093714,0.0044117705,0.08188692,0.0038981847,0.000009379062],"about_ca_topic_score_codex":0.00330192,"about_ca_topic_score_gemma":0.004380537,"teacher_disagreement_score":0.0064947824,"about_ca_system_score_codex":0.0012590584,"about_ca_system_score_gemma":0.0012428133,"threshold_uncertainty_score":0.021727264},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03970107,0.0004205342,0.93432677,0.0003865606,0.00013778276,0.00009285367,0.00046521306,0.004249078,0.020220095],"genre_scores_gemma":[0.3514305,0.00058219826,0.6211217,0.0002621068,0.00008222123,0.00020551946,0.0011624941,0.0011295887,0.024023691],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987715,0.00021721501,0.000093834286,0.00029734484,0.00041696712,0.00020310795],"domain_scores_gemma":[0.99649674,0.0008646581,0.0005968622,0.0013593248,0.000428587,0.000253914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000626275,0.00083667174,0.0006699855,0.0012931641,0.001292477,0.0025457914,0.0014833447,0.0010847589,0.017936738],"category_scores_gemma":[0.0048507494,0.0012050007,0.0008635033,0.0019436948,0.001636455,0.0049732337,0.0049222885,0.0017790884,0.0040782057],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006420399,0.000139054,0.0016336112,0.0004774118,0.00007421689,0.0004345991,0.0008445613,0.1625916,0.029775746,0.5682127,0.01645657,0.21871792],"study_design_scores_gemma":[0.00020434006,0.00031379896,0.00082628004,0.00017222797,0.00007809343,0.0006045598,0.00029650037,0.4004714,0.036489468,0.45955023,0.10087195,0.000121138735],"about_ca_topic_score_codex":0.0021986281,"about_ca_topic_score_gemma":0.004059434,"teacher_disagreement_score":0.017936738,"about_ca_system_score_codex":0.0016697239,"about_ca_system_score_gemma":0.0011025108,"threshold_uncertainty_score":0.060004354},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.60855967,0.000684576,0.35662553,0.0004288721,0.00009782741,0.00013518851,0.00030736986,0.00071382703,0.032447163],"genre_scores_gemma":[0.9067899,0.0005013699,0.08624889,0.00008590144,0.000069500325,0.00011428556,0.00037791967,0.00019908579,0.005613045],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99876934,0.00025746255,0.000060936494,0.00022671769,0.00047004735,0.00021543333],"domain_scores_gemma":[0.99669856,0.0016291211,0.0005173262,0.00057128386,0.0002684928,0.00031515912],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053878024,0.0006491981,0.0007764798,0.00096585345,0.0010192032,0.0015409706,0.0010687511,0.0008116249,0.005161038],"category_scores_gemma":[0.0063689817,0.00095948216,0.0010327037,0.0010152516,0.0018216557,0.0023263367,0.0034036783,0.0018884562,0.00096471625],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016901211,0.00023897608,0.007397396,0.0007815014,0.00009724501,0.0017270277,0.002235394,0.19863807,0.064252935,0.5930098,0.004345873,0.12558565],"study_design_scores_gemma":[0.00028359305,0.0005713618,0.0017632615,0.00011739061,0.000074561816,0.0014288637,0.0008005104,0.38870165,0.03649467,0.55035263,0.019347355,0.00006415199],"about_ca_topic_score_codex":0.0007277858,"about_ca_topic_score_gemma":0.0006488242,"teacher_disagreement_score":0.005161038,"about_ca_system_score_codex":0.00061665266,"about_ca_system_score_gemma":0.00035966633,"threshold_uncertainty_score":0.017265439},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015600761,0.000046253936,0.9813742,0.000052782256,0.000028667946,0.000044198063,0.000088023,0.0008601335,0.0019049821],"genre_scores_gemma":[0.15415326,0.00008733769,0.8394845,0.00004748649,0.000012722795,0.00010966873,0.0007413395,0.00048610187,0.004877483],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99977094,0.000025726877,0.000019495967,0.00004711795,0.00009731497,0.00003935309],"domain_scores_gemma":[0.9996767,0.00008683451,0.000016757076,0.00008938697,0.000101516256,0.000028718916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034983773,0.00043517942,0.00056978076,0.0008044354,0.0003225278,0.0010136965,0.0013427646,0.0005618433,0.0063303313],"category_scores_gemma":[0.0015272108,0.00035880486,0.00057610933,0.0007213847,0.00045409403,0.0011276095,0.0017981105,0.0012110809,0.0022687064],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002577243,0.00010034116,0.0019533986,0.00021179233,0.000050393144,0.0003315608,0.0005736505,0.112407476,0.04455973,0.14507759,0.010490217,0.6839862],"study_design_scores_gemma":[0.000073428724,0.00010202468,0.00053886214,0.000024923042,0.000017896285,0.00020575478,0.00018850695,0.8911984,0.020940794,0.06362153,0.02305478,0.000033107655],"about_ca_topic_score_codex":0.001995682,"about_ca_topic_score_gemma":0.0033512819,"teacher_disagreement_score":0.0063303313,"about_ca_system_score_codex":0.0004772732,"about_ca_system_score_gemma":0.0005753072,"threshold_uncertainty_score":0.021177113},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.60842144,0.0035348102,0.2102827,0.021315306,0.0010760907,0.00015669478,0.003187123,0.0010486409,0.15097716],"genre_scores_gemma":[0.935675,0.0037583173,0.032928564,0.0022128825,0.00097203674,0.00023146227,0.0034677535,0.00028193643,0.020472053],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982607,0.00032901263,0.00013867485,0.00040527334,0.00044906905,0.00041723982],"domain_scores_gemma":[0.9930948,0.0036681346,0.0007483346,0.0014311041,0.0004860953,0.00057156954],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022275364,0.0010126927,0.0016462088,0.001542844,0.0020928055,0.003258239,0.0016231817,0.0015888452,0.011064863],"category_scores_gemma":[0.010437066,0.0007225792,0.0015820512,0.0020649433,0.0040201806,0.007704056,0.0027090516,0.0032456364,0.0014824527],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006154494,0.00013417078,0.004401146,0.00039807477,0.000081860824,0.00043449493,0.00045891196,0.051142413,0.0025635741,0.8806281,0.021287858,0.03785389],"study_design_scores_gemma":[0.00009836477,0.000035433775,0.0009529972,0.000041228508,0.000027896072,0.00017245256,0.00022916867,0.025687438,0.00060313276,0.95722884,0.014903653,0.000019396899],"about_ca_topic_score_codex":0.0018887985,"about_ca_topic_score_gemma":0.0021601242,"teacher_disagreement_score":0.011064863,"about_ca_system_score_codex":0.0018051655,"about_ca_system_score_gemma":0.00095633767,"threshold_uncertainty_score":0.037015617},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07979106,0.00016779278,0.885737,0.000524844,0.00012682792,0.00013351021,0.0010582311,0.0018574129,0.030603332],"genre_scores_gemma":[0.5124783,0.00043729425,0.4706565,0.00031543223,0.0000750819,0.0003502191,0.002964625,0.00050463283,0.012217885],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999595,0.00007568247,0.000023920093,0.000091959206,0.0001360602,0.00007731301],"domain_scores_gemma":[0.99950683,0.00012344038,0.00006269516,0.00016515894,0.000110561676,0.000031282754],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022778993,0.0005369326,0.00046335382,0.0006994032,0.000534857,0.0015058181,0.00090924173,0.0008736411,0.011283222],"category_scores_gemma":[0.0018051827,0.00031753816,0.00053449697,0.0010710291,0.0007520581,0.0023624112,0.0014403139,0.001251954,0.0025219193],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027526074,0.000109162735,0.0009865563,0.0002856788,0.00002692976,0.0005609244,0.0004970638,0.07611959,0.020658795,0.68798596,0.015387191,0.19710694],"study_design_scores_gemma":[0.00005904234,0.00013105063,0.0005621108,0.000085758096,0.000037086065,0.000671313,0.00035953702,0.28029168,0.013457674,0.6492058,0.055095207,0.000043769804],"about_ca_topic_score_codex":0.0008991623,"about_ca_topic_score_gemma":0.0007895266,"teacher_disagreement_score":0.011283222,"about_ca_system_score_codex":0.00046751692,"about_ca_system_score_gemma":0.00039428665,"threshold_uncertainty_score":0.03774613},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09735038,0.0006884197,0.8944386,0.00062778743,0.000050938106,0.00005332874,0.0001298804,0.00017108118,0.0064895283],"genre_scores_gemma":[0.58088684,0.0009141054,0.40509903,0.00018797716,0.00017092728,0.00027095622,0.00078256393,0.00031766752,0.011369944],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993005,0.00023067251,0.00003437166,0.000147236,0.0002274207,0.000059734088],"domain_scores_gemma":[0.9978224,0.0016038313,0.00018461526,0.0001720183,0.00012338474,0.00009377678],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014415735,0.0010506295,0.0009135202,0.0012395834,0.0005550018,0.0011312175,0.0018449655,0.0016011022,0.0024718165],"category_scores_gemma":[0.007472708,0.0005792108,0.0009341697,0.00097378634,0.0012971256,0.002650037,0.002493935,0.0016622941,0.00030881906],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012533023,0.00007896673,0.0015686157,0.00032346052,0.00005807934,0.00013175332,0.0002316079,0.6839062,0.0031654844,0.2602078,0.0021299212,0.048072748],"study_design_scores_gemma":[0.000007892174,0.00003110717,0.0001638099,0.000020029747,0.000006730504,0.00004137322,0.000029750972,0.90584445,0.00071722484,0.09207957,0.0010519654,0.000006035291],"about_ca_topic_score_codex":0.0009873309,"about_ca_topic_score_gemma":0.0011533024,"teacher_disagreement_score":0.0024718165,"about_ca_system_score_codex":0.0014444772,"about_ca_system_score_gemma":0.00043597334,"threshold_uncertainty_score":0.0104804635},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3393907,0.0009932768,0.61959743,0.00072786974,0.00022821085,0.00026225034,0.00046958824,0.0021071895,0.036223445],"genre_scores_gemma":[0.61695814,0.0008436963,0.3569898,0.00044224632,0.00013986882,0.00024760183,0.0018823157,0.0009271061,0.021569133],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99889225,0.00014466036,0.00007576853,0.0003466163,0.00035510896,0.0001856321],"domain_scores_gemma":[0.9981614,0.000323374,0.0001882908,0.00091419305,0.00017912204,0.00023374913],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051299843,0.0009911116,0.0009846039,0.00069041515,0.0006500822,0.0016392564,0.0013575708,0.0010804964,0.011470933],"category_scores_gemma":[0.0026030787,0.00053629326,0.0010381276,0.0010249682,0.0012330408,0.005407849,0.003517477,0.002131517,0.0027556182],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009385064,0.0006307573,0.0054491092,0.001202916,0.00015792441,0.0009922828,0.001523605,0.15263024,0.122163944,0.32900143,0.009580761,0.37572855],"study_design_scores_gemma":[0.0003804503,0.0023966983,0.0045922915,0.0004170805,0.00022438265,0.0023767466,0.0015504003,0.35841164,0.10926115,0.39568937,0.12445281,0.00024700694],"about_ca_topic_score_codex":0.0008619645,"about_ca_topic_score_gemma":0.0018821259,"teacher_disagreement_score":0.011470933,"about_ca_system_score_codex":0.0006661917,"about_ca_system_score_gemma":0.00050095696,"threshold_uncertainty_score":0.038374126},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7296382,0.0005479717,0.24159016,0.00043897604,0.00009895887,0.00008447403,0.00043393482,0.0004139747,0.026753297],"genre_scores_gemma":[0.9579012,0.00027194922,0.028825942,0.000090206086,0.000050018665,0.00008582868,0.00068386615,0.00013241278,0.011958459],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99903643,0.00013857512,0.000072382405,0.00021684394,0.00031296987,0.00022283678],"domain_scores_gemma":[0.9977481,0.0005564165,0.0006261209,0.00034682572,0.00043904717,0.00028352317],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045124267,0.0003165863,0.00054346886,0.0014224985,0.0010036324,0.0015877456,0.0011457672,0.0009681322,0.005979174],"category_scores_gemma":[0.0049022133,0.00046264194,0.0006716957,0.0009734988,0.001505403,0.0016692502,0.0029247596,0.0011495666,0.0012859483],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003517884,0.000048017257,0.006366227,0.00017566596,0.000061991326,0.0022642564,0.00157976,0.05639605,0.028832922,0.8661253,0.0028946917,0.034903347],"study_design_scores_gemma":[0.00008190785,0.00029282927,0.0034284992,0.00010755438,0.00007376738,0.0024452154,0.0012339731,0.24802987,0.023692692,0.70360553,0.016897118,0.00011102473],"about_ca_topic_score_codex":0.00103818,"about_ca_topic_score_gemma":0.0011275648,"teacher_disagreement_score":0.005979174,"about_ca_system_score_codex":0.00080529205,"about_ca_system_score_gemma":0.00026269676,"threshold_uncertainty_score":0.020002365},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16469315,0.0006902347,0.8249366,0.0008692947,0.00006315158,0.00015636803,0.0007693005,0.0012540922,0.006567756],"genre_scores_gemma":[0.6894175,0.0011162726,0.30064416,0.0002649057,0.00016381603,0.00027202754,0.0034182381,0.00044032396,0.004262832],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974497,0.0007913969,0.00018975437,0.0006242903,0.0005912244,0.00035363057],"domain_scores_gemma":[0.99020445,0.006196363,0.0013082052,0.0016171271,0.0004377085,0.00023612287],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013097329,0.0011082725,0.00089203747,0.0012065892,0.00066808186,0.0026190148,0.0019483652,0.001320347,0.005358356],"category_scores_gemma":[0.0110415695,0.0006949585,0.0011617319,0.0024612632,0.0020414053,0.006857023,0.0026896219,0.0025207095,0.000846291],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007375189,0.00030539572,0.002420039,0.0005486049,0.000071476716,0.0006588648,0.0012214163,0.31954777,0.021086056,0.4963643,0.0055344077,0.15150423],"study_design_scores_gemma":[0.000103034545,0.00020021445,0.0007141628,0.00010827512,0.00003842457,0.0003873194,0.00031278768,0.433873,0.0077093323,0.5511704,0.0053346185,0.000048383747],"about_ca_topic_score_codex":0.0012652158,"about_ca_topic_score_gemma":0.0013103443,"teacher_disagreement_score":0.005358356,"about_ca_system_score_codex":0.0011611262,"about_ca_system_score_gemma":0.0005307351,"threshold_uncertainty_score":0.0179255},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011689623,0.00042851162,0.969507,0.00015492084,0.00015867152,0.00005283417,0.00042331798,0.0022241292,0.015360964],"genre_scores_gemma":[0.20393665,0.0022962466,0.76894283,0.00019059812,0.000097132484,0.00021097108,0.0013615122,0.0016229759,0.021341048],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997181,0.00006728464,0.000019933661,0.00006990973,0.00009608034,0.000028643355],"domain_scores_gemma":[0.9995189,0.00023845423,0.00003406111,0.00011394327,0.00005519361,0.000039456718],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027351142,0.0011755689,0.00087945495,0.0012694891,0.0006413577,0.003312569,0.0015279199,0.001198549,0.015819965],"category_scores_gemma":[0.0014801472,0.00093516795,0.0011626263,0.0022157317,0.0011619427,0.0031088102,0.0028548164,0.0015741872,0.0028867044],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001273052,0.000064418426,0.0004916132,0.00045358684,0.000049248007,0.00044714997,0.00091885636,0.35034907,0.011460409,0.39293012,0.012964772,0.22974345],"study_design_scores_gemma":[0.00003395162,0.000040630897,0.00018420287,0.00011786196,0.00003410577,0.00031651233,0.00030328776,0.63393587,0.007938414,0.29585174,0.061187338,0.00005620935],"about_ca_topic_score_codex":0.0020959456,"about_ca_topic_score_gemma":0.0029764627,"teacher_disagreement_score":0.015819965,"about_ca_system_score_codex":0.0005521683,"about_ca_system_score_gemma":0.00035174142,"threshold_uncertainty_score":0.052923083},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27173454,0.008496665,0.18131965,0.010967398,0.0020524743,0.00008798833,0.0010228663,0.0006143546,0.5237041],"genre_scores_gemma":[0.89566046,0.0041244477,0.041789744,0.0013000959,0.0021879652,0.0001645842,0.0006017381,0.000332031,0.053838857],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99879706,0.0002634543,0.00005342459,0.00027057886,0.0004192714,0.00019620538],"domain_scores_gemma":[0.9963223,0.0022789624,0.00041806707,0.0002937228,0.000361593,0.00032547422],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010114729,0.0006380152,0.0009767811,0.0052584196,0.0018978104,0.004429324,0.0013765196,0.0021221288,0.022850467],"category_scores_gemma":[0.0080560185,0.0005275267,0.00050003646,0.0044291667,0.0028699832,0.0077472627,0.0026916156,0.004144047,0.0022776003],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036088768,0.000010053174,0.00023317122,0.0000433564,0.000004524843,0.000056013527,0.00014100828,0.0007075444,0.00029201884,0.9858359,0.003430106,0.009210021],"study_design_scores_gemma":[0.000018093273,0.000019048042,0.00076061557,0.000038811817,0.0000136582485,0.00028916594,0.00019554699,0.0066362135,0.0005525011,0.97277,0.018692955,0.000013337174],"about_ca_topic_score_codex":0.0010455896,"about_ca_topic_score_gemma":0.000631643,"teacher_disagreement_score":0.022850467,"about_ca_system_score_codex":0.0014240885,"about_ca_system_score_gemma":0.00035056824,"threshold_uncertainty_score":0.07644236},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17981215,0.0011168638,0.7757554,0.00061522727,0.00030531015,0.0003022794,0.00056917995,0.0010857175,0.040437877],"genre_scores_gemma":[0.67025334,0.0011104998,0.27501354,0.00026216183,0.00020093037,0.00034346347,0.0012315945,0.0011973457,0.05038708],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99924856,0.00013915965,0.000039355004,0.00018225498,0.00030585018,0.000084791594],"domain_scores_gemma":[0.99848974,0.0006595652,0.00013192587,0.00015020871,0.00036028438,0.00020826152],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068132335,0.0014224884,0.001014193,0.002894329,0.0013732472,0.004367768,0.0015872696,0.0016758706,0.010593634],"category_scores_gemma":[0.0028876527,0.0006937972,0.0014021952,0.001527048,0.0024493576,0.0017514953,0.0017901695,0.0021323662,0.0017137342],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002836104,0.00015511249,0.0033289234,0.00047732325,0.00009986755,0.0013996918,0.0018849716,0.07376561,0.022099257,0.80289257,0.007293786,0.08631922],"study_design_scores_gemma":[0.00012026516,0.00020275642,0.0025361963,0.00015772173,0.00008918744,0.0025886921,0.0012863282,0.47099936,0.012296311,0.4162632,0.09336309,0.00009690922],"about_ca_topic_score_codex":0.0056530135,"about_ca_topic_score_gemma":0.0052319476,"teacher_disagreement_score":0.010593634,"about_ca_system_score_codex":0.0019171834,"about_ca_system_score_gemma":0.00051035034,"threshold_uncertainty_score":0.035439193},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3881881,0.009362159,0.37635168,0.032909106,0.0012392253,0.00115221,0.045251876,0.008960765,0.13658494],"genre_scores_gemma":[0.7873183,0.0057745255,0.13531955,0.0043358663,0.0009873755,0.00077625446,0.029718624,0.0012163263,0.034553126],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99815065,0.0001876744,0.0000917542,0.00071785727,0.00038102505,0.0004710612],"domain_scores_gemma":[0.99511564,0.0035088146,0.00035369044,0.00045429045,0.0003098435,0.00025762882],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067781634,0.001620097,0.002290454,0.00058458163,0.0019397921,0.0041930513,0.0023448607,0.0018407537,0.013343624],"category_scores_gemma":[0.0037134644,0.0009998274,0.0020875193,0.0022210872,0.0019055652,0.006072167,0.0024796652,0.004324261,0.002228677],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002457108,0.0012833051,0.007078646,0.0052540195,0.000670401,0.0020384523,0.0011166659,0.33582416,0.019069692,0.16359964,0.2239489,0.23765902],"study_design_scores_gemma":[0.0007170196,0.0002528671,0.002875067,0.00021231301,0.00025783823,0.0020389087,0.0010097807,0.4161102,0.008551676,0.5054498,0.062429696,0.00009488939],"about_ca_topic_score_codex":0.00825574,"about_ca_topic_score_gemma":0.009075311,"teacher_disagreement_score":0.013343624,"about_ca_system_score_codex":0.0026233143,"about_ca_system_score_gemma":0.0026260442,"threshold_uncertainty_score":0.044638872},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3164421,0.0037310007,0.5531412,0.0013380686,0.0007851886,0.00010410587,0.0017575509,0.0014004576,0.12130038],"genre_scores_gemma":[0.8065932,0.0017397562,0.1612771,0.0008792171,0.0003491795,0.00014935697,0.0017290297,0.00048895454,0.026794236],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989436,0.00016253932,0.000079458965,0.0003271295,0.0002712415,0.00021599144],"domain_scores_gemma":[0.9990402,0.00027887983,0.00011319397,0.00026224458,0.00016395672,0.00014149812],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057285937,0.00065488415,0.00067675393,0.00068240275,0.0006661269,0.0014197532,0.0008642837,0.001121732,0.010453173],"category_scores_gemma":[0.003993615,0.00036029608,0.000527956,0.0007656133,0.0012970751,0.0036496504,0.0028216024,0.0012998614,0.0029628556],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022719892,0.00005890897,0.0009657063,0.0003027778,0.000033942422,0.00015363962,0.00023090621,0.027669383,0.0138396425,0.87100035,0.0092067495,0.07631086],"study_design_scores_gemma":[0.00003662347,0.00016495996,0.00057182467,0.000068914764,0.000020384496,0.00026637776,0.0001855411,0.0431261,0.0069315424,0.9245222,0.024070157,0.000035245816],"about_ca_topic_score_codex":0.00029895524,"about_ca_topic_score_gemma":0.0006366094,"teacher_disagreement_score":0.010453173,"about_ca_system_score_codex":0.0005778185,"about_ca_system_score_gemma":0.00042606913,"threshold_uncertainty_score":0.03496933},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18493019,0.0032910702,0.5207595,0.003590142,0.0005569843,0.00025315429,0.0025664805,0.0015068882,0.2825456],"genre_scores_gemma":[0.580296,0.0036751297,0.2960246,0.0009942653,0.00052615267,0.0005173443,0.0030509662,0.0011776143,0.113738015],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99935097,0.00012706271,0.000033233617,0.00018194437,0.00017384066,0.00013296971],"domain_scores_gemma":[0.9989065,0.00054729707,0.00013645855,0.00016085262,0.000139099,0.00010974533],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050830864,0.0007133234,0.00091288204,0.0015784971,0.0018349828,0.0028382123,0.0017890426,0.001271353,0.015196026],"category_scores_gemma":[0.0024580245,0.0011874954,0.000967721,0.002503817,0.0013645173,0.0038919675,0.0015242224,0.0024800603,0.0023585057],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014532727,0.00005460698,0.0002256024,0.00023704316,0.000024036846,0.00005811563,0.00022248975,0.007080022,0.0038085985,0.93989056,0.009694302,0.03855938],"study_design_scores_gemma":[0.00002585447,0.000020167881,0.00032054706,0.000057207355,0.000023209503,0.00012471173,0.00011226257,0.012972677,0.0021061292,0.9665318,0.01769273,0.000012722538],"about_ca_topic_score_codex":0.0016119013,"about_ca_topic_score_gemma":0.0026326454,"teacher_disagreement_score":0.015196026,"about_ca_system_score_codex":0.0016299076,"about_ca_system_score_gemma":0.00076556107,"threshold_uncertainty_score":0.05083579},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.56369483,0.0017408716,0.38375437,0.0013510403,0.00007264304,0.00020797031,0.001195583,0.0008413646,0.047141332],"genre_scores_gemma":[0.8698218,0.0014353364,0.11869432,0.0004905628,0.000108269945,0.00027988435,0.0016022646,0.000397673,0.0071698828],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99812406,0.00046022853,0.00010667575,0.0004422852,0.0005306532,0.00033595503],"domain_scores_gemma":[0.99161166,0.0048778118,0.0012585915,0.0010104564,0.00073645246,0.0005050709],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014673239,0.0011378689,0.0009407059,0.001831036,0.0012900832,0.0017617532,0.001789096,0.00092134543,0.006291613],"category_scores_gemma":[0.011477661,0.0008336714,0.00093020085,0.002497893,0.0012494557,0.006621412,0.0021309198,0.0015974895,0.0007071977],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006776425,0.00021666083,0.0045082434,0.00053791323,0.00015828312,0.0008969112,0.0005865047,0.24615543,0.023080802,0.6394529,0.008038507,0.0756903],"study_design_scores_gemma":[0.00007904982,0.00017129269,0.0025778003,0.00011187302,0.000122025725,0.0009166543,0.00029210764,0.38807938,0.009919515,0.5863873,0.011262623,0.00008055422],"about_ca_topic_score_codex":0.0020687527,"about_ca_topic_score_gemma":0.002576809,"teacher_disagreement_score":0.006291613,"about_ca_system_score_codex":0.0013845777,"about_ca_system_score_gemma":0.00073550275,"threshold_uncertainty_score":0.021047473},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5060699,0.0012749194,0.46825296,0.004315438,0.00021059846,0.00031803676,0.0025244497,0.0028548506,0.0141788665],"genre_scores_gemma":[0.836485,0.00080666714,0.15330778,0.00064189825,0.00013703856,0.0002918848,0.0025182627,0.00069863035,0.0051128445],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99540377,0.0013840235,0.000261567,0.0010926648,0.0009050223,0.00095294503],"domain_scores_gemma":[0.97255105,0.019929597,0.0023244368,0.0029991793,0.0012405653,0.0009551664],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002989693,0.0012200088,0.0014518,0.0011568448,0.0011021963,0.0027636308,0.004231527,0.0020639875,0.0061930604],"category_scores_gemma":[0.023332302,0.0010357463,0.0014680779,0.0016298308,0.001484772,0.0068354504,0.0021628994,0.0019949395,0.00091946777],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000839917,0.00021777906,0.0033285306,0.00037520984,0.0001806685,0.0002475522,0.00019885934,0.87439114,0.0057160207,0.056066196,0.007940993,0.050497133],"study_design_scores_gemma":[0.000057160254,0.00007119369,0.0007242985,0.000014156401,0.00004069001,0.00014163916,0.00007906605,0.9378034,0.0015724552,0.058294773,0.0011815705,0.000019576939],"about_ca_topic_score_codex":0.004907338,"about_ca_topic_score_gemma":0.0040624617,"teacher_disagreement_score":0.0061930604,"about_ca_system_score_codex":0.003409665,"about_ca_system_score_gemma":0.0019479508,"threshold_uncertainty_score":0.024738967},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08503735,0.0002264106,0.81998473,0.0003597525,0.0003433447,0.000114796676,0.00046927689,0.0012517774,0.09221252],"genre_scores_gemma":[0.60911727,0.00028420024,0.36469078,0.0003262019,0.000054933505,0.00017759358,0.00067077787,0.0006305036,0.0240477],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99971193,0.000054674147,0.000019508769,0.000059291546,0.00010438571,0.000050107315],"domain_scores_gemma":[0.99960417,0.000096420925,0.00005619604,0.000111261164,0.00008686863,0.000045105076],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017714922,0.0004322675,0.0002575203,0.00046773092,0.00040900326,0.0012148948,0.00043343852,0.00053430896,0.011498011],"category_scores_gemma":[0.0014200297,0.0003491747,0.00047254036,0.00038727355,0.0007168405,0.00095537596,0.000912932,0.0006587863,0.0016945822],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039106363,0.00007105312,0.0019485543,0.00026835402,0.000043961856,0.00096875604,0.0003702922,0.14451335,0.08286126,0.59607714,0.016925901,0.15556031],"study_design_scores_gemma":[0.00012824524,0.0002461487,0.0022843303,0.00015352812,0.00003996321,0.0012335525,0.00036406948,0.5725832,0.052190635,0.23411085,0.13658412,0.00008142052],"about_ca_topic_score_codex":0.00082233344,"about_ca_topic_score_gemma":0.0011193143,"teacher_disagreement_score":0.011498011,"about_ca_system_score_codex":0.00029091787,"about_ca_system_score_gemma":0.00028811736,"threshold_uncertainty_score":0.038464665},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53551847,0.0019265364,0.4276098,0.00063788786,0.00015697457,0.00021042963,0.0011226851,0.0008838999,0.031933274],"genre_scores_gemma":[0.74586314,0.003129405,0.23647456,0.00036111547,0.00016729745,0.00017577624,0.0025448666,0.00036315309,0.010920588],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994673,0.0000876377,0.000036655114,0.00013818464,0.00011950938,0.0001507282],"domain_scores_gemma":[0.9993549,0.00026536954,0.00018232792,0.00009319008,0.000048993163,0.000055285273],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023092689,0.00078251545,0.0007363134,0.0011087598,0.0007710794,0.0014216047,0.0008777994,0.0011614016,0.0057524033],"category_scores_gemma":[0.0021129216,0.0008045868,0.0007431577,0.0019843953,0.0008924358,0.0032576444,0.002340687,0.0010558316,0.0013830693],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038739142,0.00028740687,0.004313735,0.0010834396,0.00009822553,0.0018237777,0.0011570171,0.34196877,0.0312933,0.40720326,0.013816109,0.19656758],"study_design_scores_gemma":[0.000067249275,0.00038385476,0.0026661616,0.00016703062,0.00007006396,0.0023651402,0.00080731115,0.3541523,0.015048417,0.5929547,0.03126508,0.00005281885],"about_ca_topic_score_codex":0.00073852076,"about_ca_topic_score_gemma":0.0006837536,"teacher_disagreement_score":0.0057524033,"about_ca_system_score_codex":0.0006095553,"about_ca_system_score_gemma":0.00024910638,"threshold_uncertainty_score":0.019243717},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013677542,0.000107297856,0.97980875,0.00012136614,0.00008932028,0.000021776896,0.00016148011,0.00067905325,0.005333385],"genre_scores_gemma":[0.47405115,0.00053243834,0.5117987,0.00019891707,0.00010644949,0.00012105407,0.0008002655,0.000857913,0.011533051],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99957544,0.00009317937,0.000019633459,0.00007694702,0.00016773454,0.00006700247],"domain_scores_gemma":[0.9992767,0.00021429804,0.00006307884,0.0002086693,0.00015856189,0.00007869635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043423893,0.000568989,0.0005969139,0.0012332681,0.00047448123,0.0033495892,0.0012776661,0.0011811164,0.00915342],"category_scores_gemma":[0.002369645,0.00043417685,0.00070362637,0.0012542605,0.0011371267,0.0026374375,0.0026584007,0.0015425868,0.0014506046],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001602981,0.000059937654,0.00033899365,0.000094825875,0.000018444174,0.00014320738,0.00034402285,0.1102243,0.008710206,0.77342916,0.0046401783,0.10183646],"study_design_scores_gemma":[0.000030475081,0.000045365145,0.00018351505,0.000039777035,0.000015487147,0.00009996359,0.00016046266,0.6237394,0.0043207137,0.35710648,0.014225816,0.00003246451],"about_ca_topic_score_codex":0.002053343,"about_ca_topic_score_gemma":0.0026600247,"teacher_disagreement_score":0.00915342,"about_ca_system_score_codex":0.0005500941,"about_ca_system_score_gemma":0.00054995203,"threshold_uncertainty_score":0.03062123},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021400828,0.013814792,0.38233706,0.003334444,0.001809075,0.00014751582,0.0028795325,0.002426387,0.57185036],"genre_scores_gemma":[0.27239716,0.024790836,0.27464205,0.0012912287,0.0039016244,0.00053473917,0.008070534,0.0034388395,0.41093287],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99886453,0.0001360505,0.000040747676,0.00024010369,0.00059190433,0.00012673347],"domain_scores_gemma":[0.99872106,0.00062515284,0.000054013588,0.00029715637,0.00019134986,0.00011120157],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004337491,0.0011493379,0.0012329645,0.0019260645,0.0012263112,0.0061499598,0.0018647662,0.0010684554,0.071701154],"category_scores_gemma":[0.0035340353,0.0008601279,0.001003079,0.004919426,0.0012911721,0.009445448,0.0023138304,0.0029434299,0.021345288],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000090074456,0.000048830112,0.00032757045,0.00025699142,0.00001851241,0.000035220284,0.00012273114,0.0048722546,0.0012898836,0.63866276,0.09216403,0.26211107],"study_design_scores_gemma":[0.000020865034,0.000025445624,0.00040742953,0.00007392762,0.000021046375,0.00019588805,0.00010001766,0.016224675,0.0011374895,0.8037445,0.17803498,0.000013756425],"about_ca_topic_score_codex":0.0013333529,"about_ca_topic_score_gemma":0.0011061556,"teacher_disagreement_score":0.071701154,"about_ca_system_score_codex":0.001980415,"about_ca_system_score_gemma":0.00083792914,"threshold_uncertainty_score":0.23986423},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4983096,0.001467126,0.47350693,0.005367407,0.00023491237,0.00036154647,0.0030924843,0.0026551555,0.015004819],"genre_scores_gemma":[0.84312254,0.0009065739,0.14583156,0.0006830825,0.0001708278,0.00032413835,0.0030144146,0.00073532516,0.005211559],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99525625,0.001512404,0.00024709007,0.0011663175,0.00087480067,0.00094308873],"domain_scores_gemma":[0.96907884,0.02300368,0.0022396946,0.00337508,0.0012637209,0.0010390179],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031694751,0.0013212891,0.0016599228,0.0011237598,0.0012014637,0.0030281849,0.004375871,0.002450848,0.0067705433],"category_scores_gemma":[0.023602536,0.001155001,0.0016784566,0.0017763983,0.0016537234,0.007686706,0.00221736,0.0022251045,0.0009860698],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011868434,0.00029777316,0.0037261427,0.00048608723,0.00023782073,0.00028880013,0.00024708794,0.849271,0.0063229534,0.07367877,0.010684282,0.053572457],"study_design_scores_gemma":[0.00007981296,0.00007940853,0.00076234585,0.00001705806,0.0000504527,0.00015044908,0.000076227894,0.92784,0.0016466278,0.067885794,0.0013907229,0.000021079146],"about_ca_topic_score_codex":0.005247116,"about_ca_topic_score_gemma":0.0054161213,"teacher_disagreement_score":0.0067705433,"about_ca_system_score_codex":0.00409572,"about_ca_system_score_gemma":0.0024214033,"threshold_uncertainty_score":0.02971667},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05477415,0.003716444,0.76688015,0.0010959532,0.0009411529,0.00009347711,0.0005588066,0.0028576497,0.16908224],"genre_scores_gemma":[0.6958889,0.0038256075,0.23025054,0.00038733575,0.00071526103,0.00011462253,0.0007904445,0.001953943,0.06607331],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99959964,0.000042109736,0.000014756358,0.00011280472,0.0001713975,0.000059366073],"domain_scores_gemma":[0.99897456,0.00044178742,0.00006756124,0.000197657,0.00016960145,0.00014887952],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003114669,0.0005879328,0.00049824564,0.0013794275,0.0007191954,0.002486615,0.0013943154,0.0008404856,0.016837683],"category_scores_gemma":[0.0026034713,0.00043219293,0.0004740095,0.001670367,0.0022568228,0.0033194574,0.0019184822,0.0024511642,0.0028548844],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000839412,0.000045278604,0.0006657559,0.00017174867,0.00001216502,0.00008338023,0.00019008452,0.017519575,0.0063230214,0.738163,0.012648089,0.22409393],"study_design_scores_gemma":[0.00001990947,0.000084657026,0.0012603825,0.00004525072,0.000030138994,0.0004348593,0.00019535125,0.08127922,0.008471307,0.86651236,0.04163353,0.000032941138],"about_ca_topic_score_codex":0.0011142822,"about_ca_topic_score_gemma":0.0014724398,"teacher_disagreement_score":0.016837683,"about_ca_system_score_codex":0.00076627673,"about_ca_system_score_gemma":0.0004509019,"threshold_uncertainty_score":0.0563277},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0074839,0.00028738886,0.9829806,0.00043161272,0.000070344635,0.00004142591,0.00061682734,0.0026049544,0.005482883],"genre_scores_gemma":[0.38767174,0.00043283717,0.59648514,0.00037006428,0.00022067895,0.00020784754,0.0030883367,0.0017490622,0.009774329],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985971,0.0003842906,0.00008658684,0.000324655,0.00042692112,0.00018052274],"domain_scores_gemma":[0.99647456,0.0018958389,0.00011872379,0.00094622414,0.000403084,0.0001615979],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011526309,0.0007793731,0.0015861401,0.00071212155,0.0005313656,0.0020864557,0.0023376746,0.0013233608,0.018418059],"category_scores_gemma":[0.0099013345,0.00055516127,0.00074731547,0.0016461469,0.0009568066,0.0035542178,0.0032810129,0.003109814,0.0034792868],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007884501,0.00026482987,0.0013406309,0.000461142,0.00006737681,0.00013863745,0.00014734386,0.38859913,0.005188399,0.19973245,0.041617494,0.36165407],"study_design_scores_gemma":[0.0000579634,0.00003943829,0.00019742856,0.000021657443,0.000008970328,0.000043912714,0.000025183303,0.87150586,0.0016052519,0.122338064,0.0041425135,0.000013811373],"about_ca_topic_score_codex":0.0039787292,"about_ca_topic_score_gemma":0.005110635,"teacher_disagreement_score":0.018418059,"about_ca_system_score_codex":0.0008441134,"about_ca_system_score_gemma":0.0012771848,"threshold_uncertainty_score":0.061614513},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.080514595,0.0038699599,0.8821296,0.0006940815,0.00014999561,0.00009806978,0.00088324194,0.0004172569,0.031243175],"genre_scores_gemma":[0.6033077,0.007357067,0.34872335,0.00009380318,0.00012470127,0.00029834508,0.0032642835,0.00028768997,0.036543094],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996929,0.000046694156,0.000012772827,0.00009104371,0.00011297502,0.000043593736],"domain_scores_gemma":[0.9996897,0.0001708768,0.00003194578,0.000025524932,0.000054610402,0.000027369557],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001750879,0.00058633124,0.000408054,0.00078509306,0.0006823419,0.0010340499,0.0006578188,0.0005369326,0.0033736932],"category_scores_gemma":[0.001380876,0.00038193076,0.00041826267,0.0010237221,0.0005400005,0.0010005159,0.0013134761,0.0007676712,0.0006909753],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000071888055,0.000034545268,0.0004980977,0.00034360334,0.000050203857,0.00017872003,0.00035214404,0.6144645,0.005411089,0.23053539,0.007863528,0.14019628],"study_design_scores_gemma":[0.00003816359,0.00006609722,0.0006353687,0.0000938157,0.000025146723,0.00017763083,0.00023972757,0.6111369,0.003009376,0.33963236,0.04491541,0.000029955287],"about_ca_topic_score_codex":0.0023897658,"about_ca_topic_score_gemma":0.0019194885,"teacher_disagreement_score":0.0033736932,"about_ca_system_score_codex":0.0006667338,"about_ca_system_score_gemma":0.00084151694,"threshold_uncertainty_score":0.01128608},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11839612,0.0010777048,0.874312,0.00045221587,0.00011086223,0.0001290318,0.0011054946,0.0014249879,0.0029915438],"genre_scores_gemma":[0.3590778,0.0005049477,0.6347611,0.000073841715,0.000092387476,0.00023165409,0.002110272,0.00018779136,0.002960263],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99760747,0.00035829243,0.00017068424,0.0006167808,0.001037516,0.00020933761],"domain_scores_gemma":[0.99681723,0.0012291581,0.0004894564,0.0008749561,0.0004148405,0.00017432129],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010896339,0.0011124474,0.0017247235,0.0024675876,0.00086688006,0.0015485863,0.0039345063,0.0016395272,0.0027528165],"category_scores_gemma":[0.014121916,0.0008853496,0.0009218108,0.0039729397,0.0009603203,0.004175874,0.0031439534,0.0016807641,0.001608193],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015961934,0.00027915643,0.008284035,0.0004814622,0.00014713765,0.00033246962,0.0005005207,0.6311124,0.01010072,0.036815,0.010115328,0.30023554],"study_design_scores_gemma":[0.00006749385,0.0001288926,0.0010591437,0.000023737439,0.000019620056,0.00019017581,0.00011838447,0.9601342,0.004868598,0.030585717,0.0027737315,0.000030440842],"about_ca_topic_score_codex":0.0059207045,"about_ca_topic_score_gemma":0.0067754067,"teacher_disagreement_score":0.0059207045,"about_ca_system_score_codex":0.0014970824,"about_ca_system_score_gemma":0.0011120997,"threshold_uncertainty_score":0.011772513},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028834028,0.00020164507,0.9624093,0.00021331015,0.00003682203,0.00006138085,0.00020911715,0.0022598645,0.0057745706],"genre_scores_gemma":[0.21024485,0.00025361407,0.78449196,0.00007681468,0.000019785712,0.00016078821,0.0009764476,0.00026580732,0.0035099452],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990023,0.00025471466,0.000073465635,0.00018904018,0.00032667792,0.0001538628],"domain_scores_gemma":[0.9983468,0.0007882256,0.00014350083,0.00048342886,0.00018380958,0.000054254837],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045225723,0.00060274603,0.00070805993,0.0010676912,0.0008037534,0.0015843766,0.001752265,0.0008340529,0.006422699],"category_scores_gemma":[0.004287567,0.00037721804,0.0005471929,0.0022176185,0.00095326145,0.0045572035,0.0022811193,0.0007930294,0.0015792827],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00054405205,0.00015539123,0.0017267701,0.0005188152,0.000047046975,0.00038281488,0.0004795351,0.28812853,0.016904954,0.23953034,0.009899387,0.44168237],"study_design_scores_gemma":[0.000062273044,0.00011915303,0.00031898016,0.00004982884,0.000020714224,0.00037821388,0.00023746314,0.75919807,0.011769161,0.20915183,0.018660806,0.000033498673],"about_ca_topic_score_codex":0.0019830575,"about_ca_topic_score_gemma":0.0037075258,"teacher_disagreement_score":0.006422699,"about_ca_system_score_codex":0.0009644088,"about_ca_system_score_gemma":0.0009930577,"threshold_uncertainty_score":0.021486044},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.085265614,0.0021829891,0.89235026,0.0012240607,0.00014797229,0.0001617285,0.00043802583,0.00047883234,0.017750453],"genre_scores_gemma":[0.6608419,0.0022153696,0.32083538,0.0005350167,0.00037647976,0.00042994105,0.0011970687,0.00039028187,0.013178511],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99839133,0.00054949755,0.000057355694,0.0003411132,0.00047448772,0.00018618848],"domain_scores_gemma":[0.99637246,0.0027128397,0.00027169834,0.00033717128,0.00016796385,0.00013796816],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010417209,0.0013338514,0.00147308,0.0011359546,0.0009468177,0.0016321074,0.0022093493,0.0019175485,0.005316964],"category_scores_gemma":[0.006179956,0.0008669449,0.0010485387,0.0025616726,0.0016305541,0.0040659416,0.0027958334,0.0018087641,0.00056762295],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002888936,0.00017141653,0.001295971,0.0006605025,0.00012346529,0.0005256197,0.00042010573,0.6216277,0.0056949095,0.25649375,0.013130602,0.09956702],"study_design_scores_gemma":[0.000060563372,0.00013550132,0.00059599464,0.000061362356,0.000044033568,0.0006934106,0.00016552866,0.73988074,0.0031360008,0.24329719,0.011898168,0.000031548825],"about_ca_topic_score_codex":0.0016308251,"about_ca_topic_score_gemma":0.0013415816,"teacher_disagreement_score":0.005316964,"about_ca_system_score_codex":0.001443657,"about_ca_system_score_gemma":0.0005157391,"threshold_uncertainty_score":0.01778704},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81760544,0.00044337797,0.12063719,0.00047597938,0.00014968967,0.00008388945,0.0005153792,0.00019025525,0.059898797],"genre_scores_gemma":[0.8958814,0.00051769556,0.0694503,0.00020316392,0.000055296277,0.00016702981,0.00088863226,0.00023840094,0.032598075],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996117,0.00008734962,0.000021156842,0.00008761167,0.00008084322,0.00011143243],"domain_scores_gemma":[0.9990845,0.0003642602,0.00016155578,0.00008514171,0.00013067125,0.00017393276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003884868,0.00054621685,0.00047313535,0.0016674252,0.0015245134,0.0017407957,0.0007894209,0.0010055111,0.008509142],"category_scores_gemma":[0.0019065528,0.00041194115,0.0004576947,0.0008829083,0.0018320708,0.0021495179,0.0018429576,0.0010631715,0.00092139764],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016774355,0.000043546876,0.0014966327,0.00007259601,0.000010365023,0.00037107267,0.00026296862,0.010256673,0.0047448836,0.9710977,0.0011139992,0.010361911],"study_design_scores_gemma":[0.000061630664,0.000081490376,0.002110986,0.000118765405,0.000015838754,0.0005581719,0.0004623217,0.05925113,0.0038712397,0.9233262,0.010098978,0.000043305845],"about_ca_topic_score_codex":0.0016137463,"about_ca_topic_score_gemma":0.0019387669,"teacher_disagreement_score":0.008509142,"about_ca_system_score_codex":0.0010949121,"about_ca_system_score_gemma":0.0004203181,"threshold_uncertainty_score":0.028465867},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12416061,0.0011389123,0.8555969,0.00040962093,0.00009262365,0.000081340775,0.00013373047,0.00023213499,0.01815417],"genre_scores_gemma":[0.7769645,0.0009358006,0.216728,0.00009086423,0.000076595956,0.00014630456,0.00020642484,0.0001622087,0.0046893586],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991148,0.00025392402,0.000039727176,0.00016228092,0.00028026206,0.00014898907],"domain_scores_gemma":[0.9982886,0.00082448346,0.00027732426,0.0002582086,0.00023528755,0.00011621049],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009719191,0.000788593,0.0007537575,0.0015139371,0.0007861636,0.0012439537,0.00069177983,0.0013731107,0.0039104824],"category_scores_gemma":[0.007607076,0.0005156843,0.00055136025,0.0011580802,0.0018348589,0.001955586,0.0015240113,0.00073009235,0.00056124467],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011998916,0.000044953562,0.0012078705,0.0001256603,0.000018947982,0.00011104701,0.00015749583,0.7156373,0.0040335464,0.21998447,0.0018369263,0.05672178],"study_design_scores_gemma":[0.000034828205,0.00014330012,0.00048171426,0.000055215038,0.000011365442,0.00018413598,0.00015020945,0.7525757,0.005123476,0.23234609,0.008860428,0.000033493125],"about_ca_topic_score_codex":0.00084222015,"about_ca_topic_score_gemma":0.0004996967,"teacher_disagreement_score":0.0039104824,"about_ca_system_score_codex":0.0009793097,"about_ca_system_score_gemma":0.00067917036,"threshold_uncertainty_score":0.013081849},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0061481786,0.000075404234,0.9849605,0.00008030767,0.00014856154,0.000088757544,0.00012486143,0.0012933329,0.0070801387],"genre_scores_gemma":[0.12775214,0.00022705994,0.86408323,0.00009074619,0.00005252968,0.00023841586,0.0005412448,0.0005495532,0.0064651784],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994722,0.000053468502,0.000020361547,0.00005131121,0.00036117394,0.00004154449],"domain_scores_gemma":[0.99935967,0.00017013724,0.000032753782,0.00020415337,0.00018970297,0.00004362873],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004905821,0.000537809,0.0005676803,0.00072965387,0.00051057315,0.0012306249,0.0013033033,0.001066319,0.005797346],"category_scores_gemma":[0.0018002182,0.00039625284,0.0006860498,0.0004913084,0.00048942794,0.0010342386,0.0016215421,0.0012458283,0.0020868378],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016300997,0.000098429126,0.0014349673,0.00037066662,0.00006502648,0.00065419683,0.0005804346,0.3478132,0.16975084,0.15735923,0.019204156,0.30250585],"study_design_scores_gemma":[0.00002251031,0.000038356895,0.00013096163,0.000016345251,0.0000081590715,0.00012960659,0.000023280878,0.9327899,0.029760748,0.011155767,0.02590609,0.00001821359],"about_ca_topic_score_codex":0.000790523,"about_ca_topic_score_gemma":0.00073133956,"teacher_disagreement_score":0.005797346,"about_ca_system_score_codex":0.00037873286,"about_ca_system_score_gemma":0.00070668064,"threshold_uncertainty_score":0.0193941},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06783487,0.00026078167,0.8857391,0.00020195606,0.000095771575,0.00015168598,0.0007477754,0.0013550124,0.04361313],"genre_scores_gemma":[0.38154566,0.00094745785,0.5604094,0.0001692196,0.000091729315,0.0002072381,0.0025870728,0.0011644827,0.052877724],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997013,0.00004070278,0.000014023856,0.00008243803,0.00012247729,0.000038937364],"domain_scores_gemma":[0.9996886,0.000071830786,0.000034299985,0.000121371704,0.00004674368,0.000037151625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014425917,0.0008291866,0.0008317877,0.00081329216,0.0004826698,0.0010590022,0.0015189751,0.0008515043,0.012170095],"category_scores_gemma":[0.0007268251,0.0005885908,0.0007016767,0.0015525845,0.0006767694,0.0018291267,0.0022474153,0.0013752995,0.0035835104],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00057760236,0.00023719022,0.00070102833,0.0004338879,0.00009520288,0.0010502723,0.00044587703,0.24997291,0.05649342,0.3076846,0.020404723,0.3619033],"study_design_scores_gemma":[0.00009064207,0.00021296612,0.0009235607,0.00006619214,0.0000743369,0.0013378698,0.00024175274,0.5827743,0.022674717,0.32773644,0.06380916,0.000058064277],"about_ca_topic_score_codex":0.0009456029,"about_ca_topic_score_gemma":0.0014707483,"teacher_disagreement_score":0.012170095,"about_ca_system_score_codex":0.00038095366,"about_ca_system_score_gemma":0.00035973886,"threshold_uncertainty_score":0.04071307},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011137628,0.0051519834,0.9641168,0.0016440171,0.00026213206,0.00006698461,0.00023128837,0.00025078742,0.01713833],"genre_scores_gemma":[0.30497465,0.0132599445,0.6625509,0.00045654422,0.00074291707,0.00042138493,0.0009256035,0.00047274792,0.016195305],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992281,0.00024358995,0.000036155416,0.00013534969,0.00030877258,0.00004802869],"domain_scores_gemma":[0.9981832,0.0011529733,0.000112261696,0.00024104079,0.00023895342,0.00007165451],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001107368,0.0008332934,0.0008396395,0.0016576035,0.0006973772,0.002362526,0.0009493881,0.00094025553,0.004738766],"category_scores_gemma":[0.004693926,0.00045008812,0.0009896754,0.0024162338,0.0027174114,0.0026668124,0.0018857805,0.0030190556,0.0009909029],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013901713,0.000014523701,0.0003055517,0.00016400048,0.000022080118,0.000025757763,0.00014782618,0.07780662,0.00078861124,0.8794068,0.0035293573,0.037774794],"study_design_scores_gemma":[0.000009544867,0.000021400427,0.00022395515,0.0000528848,0.000007872372,0.000028983455,0.00007018931,0.19490899,0.0005603539,0.7839323,0.020170487,0.000013047804],"about_ca_topic_score_codex":0.0025623352,"about_ca_topic_score_gemma":0.001531797,"teacher_disagreement_score":0.004738766,"about_ca_system_score_codex":0.0018497778,"about_ca_system_score_gemma":0.00088835234,"threshold_uncertainty_score":0.015852809},"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":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012128318,0.013873667,0.0005204166,0.01637263,0.94817096,0.000054057196,0.000365061,0.00016877327,0.020353071],"genre_scores_gemma":[0.0016981794,0.022752201,0.000711779,0.008676993,0.6861983,0.00010709645,0.00080266746,0.00058708416,0.27846575],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9975141,0.00016478205,0.0001537211,0.00028485825,0.0015996321,0.0002828658],"domain_scores_gemma":[0.99053776,0.0010040242,0.00039917332,0.00034407363,0.005729277,0.001985698],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028656116,0.0030270158,0.003369311,0.0052579734,0.0024955692,0.008481926,0.002866503,0.004329724,0.14759584],"category_scores_gemma":[0.008067095,0.00086751423,0.0016010139,0.0029961215,0.001006403,0.0035526983,0.00272527,0.005456942,0.07696107],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.00001757084,0.0000080387335,0.000014898615,0.00006148209,0.0000028079444,0.000010944893,0.000002612818,0.000020719823,0.000052330666,0.00019064354,0.99382824,0.00578963],"study_design_scores_gemma":[0.000019942583,0.000022365646,0.0002771941,0.00012341175,0.00001326786,0.000039940187,0.000017738923,0.00012928188,0.00008823567,0.000586657,0.99867296,0.000009090014],"about_ca_topic_score_codex":0.008931921,"about_ca_topic_score_gemma":0.026090736,"teacher_disagreement_score":0.99106807,"about_ca_system_score_codex":0.0028063848,"about_ca_system_score_gemma":0.005255772,"threshold_uncertainty_score":0.49375725},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.607539,0.0009114018,0.34854922,0.00070504984,0.00010779441,0.00016352709,0.0014203843,0.0006047991,0.03999882],"genre_scores_gemma":[0.9355602,0.0007083762,0.056563888,0.000105980085,0.000054346834,0.00008725137,0.0010997104,0.00007765998,0.0057425825],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990226,0.00037162492,0.00003641982,0.00015662455,0.00032430122,0.00008835498],"domain_scores_gemma":[0.99739933,0.0010435735,0.0005042332,0.0004971326,0.00035998292,0.00019564644],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005878306,0.00048032057,0.00042659385,0.001126296,0.0005377162,0.001497327,0.0006138585,0.0005960396,0.0041102706],"category_scores_gemma":[0.0047163093,0.00044792946,0.00033486166,0.0017943325,0.0008462967,0.0013435731,0.0006915501,0.0007205142,0.0003902337],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019217197,0.00006982166,0.0035867412,0.00016422156,0.00006903171,0.00072574004,0.0004549815,0.17258988,0.00898132,0.76621825,0.007199261,0.039748646],"study_design_scores_gemma":[0.00013427273,0.00019850262,0.005882606,0.000083492865,0.000067754976,0.0009922638,0.00034821787,0.35790226,0.007993445,0.5942871,0.032053724,0.000056411885],"about_ca_topic_score_codex":0.0014355137,"about_ca_topic_score_gemma":0.0018239322,"teacher_disagreement_score":0.0041102706,"about_ca_system_score_codex":0.0008512991,"about_ca_system_score_gemma":0.00024438027,"threshold_uncertainty_score":0.013750255},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.061702784,0.0003998289,0.923773,0.00028226795,0.00006479328,0.000115125775,0.0003275935,0.0005589737,0.01277565],"genre_scores_gemma":[0.43561253,0.00045600493,0.55245745,0.0002419039,0.000053809785,0.00034171387,0.00076350255,0.00053753884,0.009535535],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99925536,0.00014701553,0.000050283285,0.000110860914,0.00027462895,0.00016186599],"domain_scores_gemma":[0.9978688,0.001441566,0.000119951445,0.00023028097,0.00018503242,0.00015450899],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000826625,0.001100267,0.0013004533,0.0012461019,0.00069372344,0.0016432388,0.0015364988,0.001558732,0.010132659],"category_scores_gemma":[0.005138095,0.0010497851,0.0013523168,0.0011130642,0.0009926931,0.0018493396,0.0038710234,0.0024213274,0.001208414],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044990252,0.00022866736,0.0012174408,0.0003996678,0.000060148166,0.00014809359,0.0003504113,0.5996445,0.014503444,0.16497241,0.008597312,0.209428],"study_design_scores_gemma":[0.000053559404,0.00007960026,0.00019757795,0.00005466543,0.000016677071,0.00005603944,0.000083077386,0.8631016,0.0022065693,0.13168478,0.0024481118,0.000017669377],"about_ca_topic_score_codex":0.0017834336,"about_ca_topic_score_gemma":0.0038907235,"teacher_disagreement_score":0.010132659,"about_ca_system_score_codex":0.0010325133,"about_ca_system_score_gemma":0.00084130134,"threshold_uncertainty_score":0.03389716},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031951908,0.00032819094,0.91506016,0.0003486565,0.0002423832,0.00014106948,0.00034714656,0.002046233,0.049534332],"genre_scores_gemma":[0.35068882,0.00097336865,0.5950853,0.00032138109,0.0001277358,0.00020485221,0.0012257526,0.0014822658,0.049890514],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999585,0.000095354946,0.000020822856,0.00012663308,0.00013415831,0.000037985214],"domain_scores_gemma":[0.999516,0.00016311598,0.000033824457,0.00012620901,0.00008699054,0.00007384517],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029804368,0.0008404856,0.0005215547,0.0013281722,0.00063666736,0.0017360342,0.0011591022,0.001008199,0.024202442],"category_scores_gemma":[0.0015906609,0.00069735723,0.0006436626,0.0012663233,0.0008360011,0.002761396,0.002173525,0.0016074306,0.004021655],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013978867,0.00008486475,0.00050151034,0.00026033007,0.000050695016,0.00035799175,0.00063120277,0.059303354,0.01799445,0.66360915,0.015595022,0.24147163],"study_design_scores_gemma":[0.00003813687,0.00011298062,0.00029543278,0.000109204855,0.000047433816,0.00032325363,0.00033931396,0.18956733,0.013328572,0.70208436,0.09372502,0.000028937893],"about_ca_topic_score_codex":0.00082499493,"about_ca_topic_score_gemma":0.0016293654,"teacher_disagreement_score":0.024202442,"about_ca_system_score_codex":0.00048396277,"about_ca_system_score_gemma":0.00025226007,"threshold_uncertainty_score":0.08096522},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78065217,0.0004815486,0.16647536,0.00057696353,0.00007226753,0.00006572395,0.0001671555,0.00019987054,0.051308934],"genre_scores_gemma":[0.98499644,0.00016604709,0.010731107,0.000043800574,0.000051577117,0.000029889916,0.00012579444,0.000028995119,0.0038263176],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99901915,0.00020232343,0.000058362242,0.00017159311,0.00037885355,0.00016971954],"domain_scores_gemma":[0.9969559,0.001386237,0.0005345103,0.00036026957,0.00036114454,0.0004019617],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006826606,0.000335329,0.0006390123,0.0017227583,0.0012163619,0.0018422245,0.000760238,0.00083758944,0.0072306106],"category_scores_gemma":[0.0044063902,0.00027316378,0.00044222694,0.0010350824,0.0023477373,0.0030989072,0.0023708504,0.0014033127,0.000728437],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014647671,0.000053603,0.003093168,0.000067249384,0.000015742806,0.0003906549,0.0008241818,0.012389237,0.0027363913,0.96084243,0.0014383674,0.018002484],"study_design_scores_gemma":[0.000026232226,0.000092929775,0.0015249139,0.000025951449,0.000012106758,0.0004954777,0.00051474996,0.045451697,0.0044315755,0.9403912,0.007010484,0.000022692207],"about_ca_topic_score_codex":0.0008442228,"about_ca_topic_score_gemma":0.0005461323,"teacher_disagreement_score":0.0072306106,"about_ca_system_score_codex":0.00090782554,"about_ca_system_score_gemma":0.000225261,"threshold_uncertainty_score":0.024188817},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20790198,0.00063137437,0.7613757,0.00040124447,0.000060072813,0.00012507408,0.0012797,0.0011617217,0.027063057],"genre_scores_gemma":[0.6802992,0.0009160368,0.30520618,0.00021266272,0.000050302853,0.0001360512,0.0022447302,0.00030313426,0.010631711],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99917656,0.0001649731,0.00004153937,0.00021776075,0.00025460706,0.00014445816],"domain_scores_gemma":[0.99820423,0.00063732406,0.00031975537,0.00046838343,0.00022692264,0.00014336352],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000529612,0.00067886297,0.00045146185,0.0006527515,0.00041266964,0.0014111955,0.000981112,0.0007915296,0.007229375],"category_scores_gemma":[0.0040453756,0.0007145059,0.0005493715,0.0011594556,0.0009378251,0.0030183583,0.001210371,0.0010854573,0.00081795116],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003222268,0.00011321095,0.005806287,0.0005395901,0.000099858196,0.000937274,0.0006247644,0.15703455,0.02883886,0.6390792,0.013207567,0.15339655],"study_design_scores_gemma":[0.00009823602,0.00023169004,0.0047414633,0.0001732259,0.000114762726,0.001593711,0.0004941123,0.3878557,0.024109686,0.5213084,0.05919126,0.00008782187],"about_ca_topic_score_codex":0.0013773751,"about_ca_topic_score_gemma":0.0021784594,"teacher_disagreement_score":0.007229375,"about_ca_system_score_codex":0.0006904494,"about_ca_system_score_gemma":0.00032508667,"threshold_uncertainty_score":0.024184704},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2725855,0.003819683,0.6361406,0.00077527633,0.00023440573,0.00007417728,0.0007135257,0.0038595223,0.08179727],"genre_scores_gemma":[0.7656334,0.0015118904,0.22076751,0.00020186992,0.00015564436,0.0000714429,0.0007071209,0.000950397,0.010000831],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99876153,0.0002916559,0.00004645318,0.0002319839,0.00047513063,0.00019323992],"domain_scores_gemma":[0.9979012,0.0008875613,0.00021436643,0.0005468873,0.0003465648,0.00010343647],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008826055,0.0008840545,0.00053053885,0.0018714349,0.00050164625,0.0013384115,0.001626979,0.00058930874,0.008136684],"category_scores_gemma":[0.005807717,0.00033884682,0.00048103376,0.0020869859,0.0007487986,0.002776904,0.0017994035,0.0008992566,0.0014473137],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035381963,0.00007541395,0.0028248886,0.00035187026,0.000068992464,0.0001639422,0.000281687,0.31705123,0.023493292,0.30886337,0.017206071,0.32926542],"study_design_scores_gemma":[0.00003543317,0.0002840985,0.0043782387,0.00009414108,0.00009049902,0.0005997446,0.00030202168,0.7343851,0.025409732,0.20229173,0.032070898,0.000058448957],"about_ca_topic_score_codex":0.0014572879,"about_ca_topic_score_gemma":0.0021337566,"teacher_disagreement_score":0.008136684,"about_ca_system_score_codex":0.0012841529,"about_ca_system_score_gemma":0.00050465384,"threshold_uncertainty_score":0.027219951},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06794317,0.00024651556,0.8817289,0.00029921706,0.0000658362,0.00009532188,0.00050937216,0.00066447514,0.048447195],"genre_scores_gemma":[0.32789063,0.00038857354,0.645722,0.0001188344,0.000049895185,0.00019983253,0.0028799868,0.0005057607,0.02224451],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99923253,0.00018258502,0.000047878624,0.00015086129,0.0002958663,0.000090232315],"domain_scores_gemma":[0.9987111,0.00061077514,0.00007860756,0.00031413173,0.00021552661,0.000069960035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041200768,0.0005471647,0.00072322466,0.0012910229,0.0008959229,0.002579168,0.0017178628,0.0007622641,0.010263466],"category_scores_gemma":[0.0041010897,0.0006173077,0.00078744674,0.0017121214,0.0009014394,0.0022777943,0.0030868894,0.0015734942,0.0022019865],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019928823,0.00011757323,0.0021419744,0.00034272324,0.000031895695,0.0002682549,0.00052042236,0.08098035,0.0070396527,0.6555918,0.010119341,0.24264686],"study_design_scores_gemma":[0.00003728292,0.000056284094,0.0006272352,0.00008973902,0.000035003493,0.00035184677,0.00032121732,0.43497902,0.0058011436,0.5276462,0.030036397,0.000018596174],"about_ca_topic_score_codex":0.00094000436,"about_ca_topic_score_gemma":0.0021564993,"teacher_disagreement_score":0.010263466,"about_ca_system_score_codex":0.00044750585,"about_ca_system_score_gemma":0.0005312291,"threshold_uncertainty_score":0.03433472},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14604187,0.0025138678,0.79109424,0.011176667,0.00058059307,0.0006388705,0.006003906,0.011637976,0.03031209],"genre_scores_gemma":[0.43707362,0.0018853234,0.53623736,0.0018843331,0.0003002623,0.00050914095,0.008483024,0.002041143,0.011585758],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961849,0.00072371,0.00032940612,0.001012646,0.0010646988,0.00068461936],"domain_scores_gemma":[0.967778,0.02663408,0.001069847,0.0030232705,0.0011441875,0.00035064013],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022119451,0.0018740017,0.0016941589,0.00104126,0.002127121,0.003946912,0.0037878968,0.0028966363,0.01487025],"category_scores_gemma":[0.01595904,0.0015053614,0.0037616538,0.0028762904,0.0022721316,0.0072756163,0.003808695,0.005944799,0.0024986037],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007482715,0.0007637476,0.003995189,0.0038605258,0.0005420939,0.001361565,0.0008664164,0.25472108,0.015408107,0.21391265,0.072408356,0.43141195],"study_design_scores_gemma":[0.00022328543,0.000121237485,0.000561599,0.00017192794,0.00018306139,0.0006592664,0.0004270061,0.29896083,0.011355522,0.6668486,0.020427678,0.000059970276],"about_ca_topic_score_codex":0.0047371374,"about_ca_topic_score_gemma":0.006632194,"teacher_disagreement_score":0.01487025,"about_ca_system_score_codex":0.0017226435,"about_ca_system_score_gemma":0.0030330142,"threshold_uncertainty_score":0.049745977},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005359491,0.00034575633,0.98567724,0.00013931462,0.00012339366,0.00011956462,0.00018278607,0.0027419913,0.0053104754],"genre_scores_gemma":[0.0470061,0.00014633207,0.9445603,0.0001094272,0.000073248164,0.00024455928,0.0008112903,0.0016963413,0.0053524813],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99814415,0.00035879234,0.000117891286,0.00039836246,0.0007502468,0.00023053416],"domain_scores_gemma":[0.99500954,0.0029970855,0.00024337902,0.00089057465,0.0007179227,0.00014147356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002357086,0.0031432512,0.0025500208,0.0026844712,0.0011780995,0.0032097339,0.00422184,0.0023607498,0.03730956],"category_scores_gemma":[0.010857564,0.0018795693,0.0027203774,0.0028008563,0.0013643099,0.005651301,0.003972617,0.00566026,0.0057791206],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008459673,0.00024943383,0.00067107665,0.0004954243,0.00012587027,0.00009193386,0.00033958373,0.16395272,0.0071530496,0.08116626,0.025400402,0.7195083],"study_design_scores_gemma":[0.00021131849,0.000119809454,0.00040685342,0.00007704572,0.0000589071,0.00008320792,0.0001339023,0.86147356,0.004406127,0.12211364,0.010865112,0.000050457416],"about_ca_topic_score_codex":0.0053130845,"about_ca_topic_score_gemma":0.009375789,"teacher_disagreement_score":0.03730956,"about_ca_system_score_codex":0.0020855404,"about_ca_system_score_gemma":0.0017892774,"threshold_uncertainty_score":0.1248129},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17574559,0.00037834427,0.81103736,0.00020245816,0.0000928163,0.000154025,0.00136639,0.0019943716,0.009028699],"genre_scores_gemma":[0.43243527,0.00024347629,0.56082875,0.000034740642,0.000013481468,0.00007903199,0.0023245623,0.00032570955,0.0037149037],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995666,0.000049207207,0.00002884148,0.00011741524,0.00017431217,0.00006353491],"domain_scores_gemma":[0.99939215,0.00023855889,0.000078492565,0.00018680788,0.000057900525,0.000046059726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025144726,0.0007557444,0.0006975549,0.00059121026,0.0005215175,0.0009910257,0.0010118503,0.00090254983,0.0036554188],"category_scores_gemma":[0.002053134,0.0010535964,0.0010091801,0.0008421623,0.0009652569,0.0016198964,0.0020091485,0.001441853,0.00076134177],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010412991,0.00018215223,0.0068747406,0.00072056695,0.00021391644,0.001651056,0.0010859114,0.5230379,0.037682775,0.115911506,0.010390871,0.3012073],"study_design_scores_gemma":[0.00006302923,0.00014145485,0.0012008799,0.00007197052,0.000029980525,0.0006191394,0.00056273886,0.9087401,0.011332199,0.065505125,0.011700405,0.000033025597],"about_ca_topic_score_codex":0.0056518926,"about_ca_topic_score_gemma":0.009090448,"teacher_disagreement_score":0.0056518926,"about_ca_system_score_codex":0.0005470098,"about_ca_system_score_gemma":0.0006790966,"threshold_uncertainty_score":0.0122285485},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025450239,0.00044165895,0.86469465,0.00019607395,0.00040570687,0.0001345225,0.0007825759,0.0013810092,0.10651358],"genre_scores_gemma":[0.6021087,0.0014370226,0.26174912,0.00029019447,0.00030656785,0.00016510548,0.0027365321,0.0012538962,0.12995285],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992723,0.00007534619,0.00003759276,0.00018573302,0.00034887102,0.00008007598],"domain_scores_gemma":[0.99958783,0.000038124323,0.000052972846,0.00017710352,0.000113245216,0.000030696865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027073303,0.000643554,0.00048621366,0.0017024429,0.0005697865,0.0015557819,0.00076044485,0.0005372167,0.02241163],"category_scores_gemma":[0.0008706092,0.0004409489,0.0006096294,0.001130765,0.00089017546,0.0012709905,0.0018814764,0.0013215654,0.00819398],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015944561,0.000080477876,0.00080895284,0.00013901909,0.000037547026,0.00040195408,0.00025788238,0.0244629,0.041455127,0.57439643,0.011187218,0.34661314],"study_design_scores_gemma":[0.000066589826,0.00042559163,0.0028843891,0.000082907085,0.00007141436,0.002119829,0.0005543014,0.20701559,0.082961716,0.39857602,0.30515462,0.000087053835],"about_ca_topic_score_codex":0.0006139059,"about_ca_topic_score_gemma":0.0007462704,"teacher_disagreement_score":0.02241163,"about_ca_system_score_codex":0.0004233396,"about_ca_system_score_gemma":0.00035494525,"threshold_uncertainty_score":0.0749743},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09447374,0.00091709354,0.87767076,0.0014885443,0.00032816082,0.0001907824,0.0008979233,0.003785819,0.020247167],"genre_scores_gemma":[0.3956087,0.00040032587,0.58778256,0.0004455843,0.00016191996,0.00029430437,0.0020691254,0.0010426083,0.012194931],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99875796,0.0003163158,0.00006696498,0.00032362159,0.00032609352,0.00020911187],"domain_scores_gemma":[0.9973443,0.0017268639,0.000115684445,0.00045574273,0.00018069078,0.00017673263],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001301613,0.0013817094,0.0018228169,0.0011286299,0.0008878325,0.002202589,0.0020171874,0.0016506261,0.020857478],"category_scores_gemma":[0.0072958465,0.00066727155,0.001142719,0.0016878374,0.0013622825,0.0046276813,0.0027368627,0.0019328595,0.0037256728],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016819565,0.00044101442,0.002852468,0.0007811816,0.0002149643,0.00026716283,0.00030544665,0.3812455,0.010890338,0.14266072,0.04098812,0.41767117],"study_design_scores_gemma":[0.00016293243,0.00012115872,0.00034623503,0.000027521948,0.000047526733,0.00011205072,0.0001417493,0.72810596,0.002499416,0.2648794,0.003538264,0.000017738486],"about_ca_topic_score_codex":0.0024686065,"about_ca_topic_score_gemma":0.006054221,"teacher_disagreement_score":0.020857478,"about_ca_system_score_codex":0.0012119319,"about_ca_system_score_gemma":0.0018476476,"threshold_uncertainty_score":0.069775224},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04858166,0.00013052758,0.9387914,0.00011522446,0.000047465586,0.00008585322,0.00020438977,0.0002934082,0.011750138],"genre_scores_gemma":[0.50105995,0.00048584328,0.47671062,0.00017222883,0.00008862465,0.00034659475,0.0009048201,0.0004233309,0.01980791],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99909735,0.00014736467,0.00006859907,0.00024055576,0.00031719523,0.00012893778],"domain_scores_gemma":[0.9988846,0.00025044364,0.0002766612,0.00020215695,0.00026837076,0.00011773776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007155904,0.0006430329,0.00051781535,0.0020994092,0.0008676536,0.0015695415,0.0012301496,0.0012380306,0.008992258],"category_scores_gemma":[0.003580483,0.0004396608,0.00082264893,0.0013941454,0.0017797797,0.0034230165,0.0025279834,0.0013630684,0.002160844],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000391155,0.000028901546,0.0002818366,0.00006759325,0.0000105377985,0.00011494317,0.00013221239,0.02000257,0.006794067,0.9406026,0.0011271944,0.030798424],"study_design_scores_gemma":[0.000024077757,0.00009150307,0.0002905633,0.00003602771,0.00001593388,0.00026585252,0.00020146222,0.13826342,0.00677323,0.8400375,0.013966704,0.000033667842],"about_ca_topic_score_codex":0.00048373587,"about_ca_topic_score_gemma":0.0005980902,"teacher_disagreement_score":0.008992258,"about_ca_system_score_codex":0.0006351976,"about_ca_system_score_gemma":0.00048145346,"threshold_uncertainty_score":0.030082107},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006453216,0.0003652514,0.9807715,0.00018785133,0.00009457385,0.00007252474,0.0003755264,0.00234071,0.009338891],"genre_scores_gemma":[0.17420724,0.00094257505,0.80644685,0.00015298006,0.000071948416,0.0001494494,0.0015723757,0.0013095797,0.015146929],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99948287,0.00012794397,0.00002500411,0.00010406523,0.00020752328,0.00005257138],"domain_scores_gemma":[0.9989537,0.00043931388,0.000049177834,0.00030527453,0.00016889324,0.00008366189],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005263627,0.00086650474,0.00068061857,0.0016145887,0.0005864875,0.0020002096,0.0013569264,0.0009334161,0.015745332],"category_scores_gemma":[0.0034202943,0.0009206587,0.0010952674,0.0015235556,0.0007381935,0.0023890587,0.0025423297,0.0018202091,0.0037737745],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032384956,0.00010690105,0.0010301586,0.00049369346,0.00013736554,0.0003010237,0.000696971,0.16440986,0.019440738,0.23029402,0.043982886,0.53878254],"study_design_scores_gemma":[0.000060070368,0.00006430575,0.00039237647,0.000119441174,0.000055085093,0.0002711761,0.00021727069,0.6947689,0.009362461,0.24491742,0.04973752,0.000033899873],"about_ca_topic_score_codex":0.003199571,"about_ca_topic_score_gemma":0.0071427925,"teacher_disagreement_score":0.015745332,"about_ca_system_score_codex":0.0006121472,"about_ca_system_score_gemma":0.0005899393,"threshold_uncertainty_score":0.0526734},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31061456,0.00029600048,0.6776609,0.0005383421,0.000060318453,0.00019115402,0.0009317752,0.0009432029,0.008763817],"genre_scores_gemma":[0.7924204,0.0001538739,0.20271401,0.0001059213,0.00004136001,0.00012819095,0.0017526039,0.00017180727,0.00251186],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980959,0.00039075836,0.0001126936,0.00073733955,0.0003599687,0.00030334847],"domain_scores_gemma":[0.9948855,0.0024457728,0.00087972276,0.001181023,0.00032751236,0.00028040964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008191984,0.00084840896,0.0008589817,0.0009652637,0.00083210284,0.0020797926,0.0019538195,0.0019591947,0.0044282516],"category_scores_gemma":[0.009042655,0.0008109648,0.0015894322,0.0013519195,0.0014381806,0.0056362962,0.0029065649,0.002253797,0.0007130502],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013174722,0.00043033715,0.0073559093,0.00080436637,0.00017331773,0.0020091294,0.0020427564,0.26994812,0.03780404,0.4157102,0.006989369,0.25541493],"study_design_scores_gemma":[0.00010088385,0.00030825767,0.0013607745,0.00010270538,0.00007775503,0.00078199257,0.00071063824,0.43888155,0.018773992,0.5323796,0.006455135,0.00006672418],"about_ca_topic_score_codex":0.0011360731,"about_ca_topic_score_gemma":0.0012155343,"teacher_disagreement_score":0.0044282516,"about_ca_system_score_codex":0.0009012621,"about_ca_system_score_gemma":0.0006493776,"threshold_uncertainty_score":0.01481396},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03623426,0.0005066727,0.95620245,0.00025341442,0.000044522356,0.00007270491,0.0001492067,0.0007815695,0.0057551577],"genre_scores_gemma":[0.3015755,0.00074943627,0.69254684,0.00011933427,0.0000940387,0.0001204348,0.00081484555,0.00048676843,0.0034927842],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99832016,0.00026718923,0.00010458173,0.00036833156,0.0007111609,0.00022850987],"domain_scores_gemma":[0.99726534,0.0015409156,0.0002516728,0.0005494314,0.00028199056,0.00011069079],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009312194,0.00090975955,0.0016209664,0.0013812996,0.000987703,0.0016171687,0.001477307,0.0010776094,0.004811593],"category_scores_gemma":[0.006183542,0.0005348593,0.001282046,0.0024027205,0.0016121906,0.0036004917,0.0018347026,0.0015296405,0.00096173276],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023317918,0.00013758046,0.0011256099,0.0003578489,0.00007501951,0.00019339072,0.0002828794,0.66769135,0.012390227,0.09361497,0.004916952,0.218981],"study_design_scores_gemma":[0.00003562157,0.000089732486,0.0004850351,0.000030158093,0.000022193432,0.00010573465,0.0000843159,0.93119305,0.008694714,0.053999387,0.0052341353,0.000025852942],"about_ca_topic_score_codex":0.0032383034,"about_ca_topic_score_gemma":0.0036835647,"teacher_disagreement_score":0.004811593,"about_ca_system_score_codex":0.0015193318,"about_ca_system_score_gemma":0.0009400912,"threshold_uncertainty_score":0.016096354},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031569253,0.001839663,0.31374308,0.0003111017,0.00082552375,0.000115816205,0.0015536582,0.004514841,0.67393947],"genre_scores_gemma":[0.036572192,0.003927351,0.21537237,0.00024184828,0.00032236797,0.00016596187,0.0077640912,0.0029338282,0.73270005],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99978644,0.000013480327,0.000008310526,0.000049524402,0.00012235195,0.000019867608],"domain_scores_gemma":[0.9999019,0.000011612116,0.000004013875,0.000035039317,0.000035614088,0.000011739778],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000118356846,0.0009893997,0.0007141512,0.0013286397,0.0004983221,0.0017932745,0.00077325816,0.00046352303,0.15049028],"category_scores_gemma":[0.0003858616,0.00050849206,0.0006579373,0.0013912136,0.00034507766,0.0012109593,0.0013290707,0.0010343909,0.077172846],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036042067,0.000035988174,0.00010822343,0.00018966147,0.000012126639,0.00010105886,0.00008516513,0.0048363395,0.008295469,0.08199003,0.1406156,0.7636943],"study_design_scores_gemma":[0.000016375396,0.000028197173,0.00037451016,0.00009193359,0.000018674022,0.0004967845,0.00007902062,0.020684341,0.0055939667,0.05662528,0.9159773,0.000013539581],"about_ca_topic_score_codex":0.0012257175,"about_ca_topic_score_gemma":0.0018779605,"teacher_disagreement_score":0.15049028,"about_ca_system_score_codex":0.00034751755,"about_ca_system_score_gemma":0.00041432958,"threshold_uncertainty_score":0.50344014},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37560186,0.000610465,0.55779505,0.0010914566,0.00009574829,0.00022620792,0.00058926834,0.00026491113,0.06372509],"genre_scores_gemma":[0.8732357,0.00090847124,0.08488528,0.000306397,0.00009219345,0.00028441785,0.0007495335,0.00025452103,0.039283417],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996923,0.00006509936,0.000011836112,0.00006389724,0.00011171383,0.000055298035],"domain_scores_gemma":[0.9985997,0.0007422122,0.00020895993,0.00010124194,0.00019190881,0.00015599547],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036719974,0.0005224673,0.00064163527,0.0015852525,0.0014909515,0.0016327788,0.0011413259,0.0008674622,0.0072782277],"category_scores_gemma":[0.0033897124,0.0006263732,0.0005699736,0.0011517407,0.001964006,0.001449061,0.0017745754,0.001231522,0.0007011283],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052356998,0.00002751631,0.00059883285,0.000059045746,0.000010941287,0.00013389502,0.00035651584,0.026551299,0.0016229601,0.95303065,0.0019731824,0.015582689],"study_design_scores_gemma":[0.000025324533,0.000020749228,0.00043863477,0.000017867433,0.00000897911,0.0000833297,0.00019474901,0.089354895,0.00076474674,0.9053235,0.0037516395,0.000015625965],"about_ca_topic_score_codex":0.007784344,"about_ca_topic_score_gemma":0.008932613,"teacher_disagreement_score":0.007784344,"about_ca_system_score_codex":0.0013532019,"about_ca_system_score_gemma":0.00085645745,"threshold_uncertainty_score":0.02434814},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24540998,0.004178378,0.29569277,0.03699964,0.0025365716,0.0001683436,0.0023639826,0.0016519557,0.41099834],"genre_scores_gemma":[0.8602712,0.0026304454,0.093528695,0.0052678846,0.00214992,0.00016484858,0.0017573235,0.0006010258,0.033628628],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99866474,0.00037278293,0.000087074506,0.00033625693,0.00037395942,0.00016525698],"domain_scores_gemma":[0.9895822,0.0072220936,0.0007765759,0.0010896989,0.0008773245,0.00045214512],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019497316,0.000759524,0.00068495685,0.0015095624,0.0026386646,0.0028851975,0.0017514868,0.0021238825,0.018614177],"category_scores_gemma":[0.011609459,0.00069686864,0.00074087444,0.0016027251,0.005392914,0.006919496,0.002577619,0.003223316,0.0021213738],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016439178,0.00004013213,0.0010497435,0.0002110814,0.000016838645,0.00063180283,0.0011135144,0.002367936,0.0016749526,0.9648367,0.013783987,0.0141088255],"study_design_scores_gemma":[0.00003022013,0.00008240679,0.001382919,0.000067311856,0.000014836523,0.0003839257,0.0005019881,0.002639951,0.0015094758,0.9585356,0.034811825,0.000039589846],"about_ca_topic_score_codex":0.0014320387,"about_ca_topic_score_gemma":0.0011351552,"teacher_disagreement_score":0.018614177,"about_ca_system_score_codex":0.00083592144,"about_ca_system_score_gemma":0.00034609108,"threshold_uncertainty_score":0.06227064},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.100495316,0.014945946,0.67793095,0.024368154,0.0012564257,0.00025859804,0.002485826,0.0010910875,0.17716768],"genre_scores_gemma":[0.8117147,0.01164261,0.12575409,0.0032760378,0.003481343,0.000563448,0.00315695,0.0009168536,0.03949394],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997929,0.0005553508,0.00007409417,0.0006022839,0.0006028402,0.0002364686],"domain_scores_gemma":[0.98910284,0.008941591,0.00043708313,0.00085989735,0.00035579505,0.00030269974],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014698649,0.001049482,0.0022150963,0.0013774807,0.0020252746,0.0057953815,0.003827817,0.0032016828,0.012864534],"category_scores_gemma":[0.015788496,0.0011956481,0.0019434006,0.0025238912,0.004826931,0.012765568,0.0041402923,0.008598593,0.0018162972],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002743439,0.00017299947,0.0014833197,0.0011358,0.00009507311,0.00018659256,0.0006601466,0.045235615,0.0013828131,0.84243625,0.0421179,0.06481914],"study_design_scores_gemma":[0.00003734228,0.000022224067,0.00034117352,0.0000554142,0.000018676528,0.00016123077,0.00013390204,0.0254631,0.00044471244,0.96482664,0.0084823305,0.000013311715],"about_ca_topic_score_codex":0.0019176077,"about_ca_topic_score_gemma":0.0013704612,"teacher_disagreement_score":0.012864534,"about_ca_system_score_codex":0.002151814,"about_ca_system_score_gemma":0.0016240343,"threshold_uncertainty_score":0.043036163},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17165469,0.001201548,0.80749303,0.0012027199,0.00015114986,0.00009067076,0.0006707621,0.0005772617,0.016958226],"genre_scores_gemma":[0.8054157,0.0012232803,0.1647023,0.0003997286,0.0001680969,0.00025429533,0.0013727698,0.0004386218,0.026025163],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998985,0.00025684363,0.00005106808,0.0002690646,0.00032140227,0.00011658872],"domain_scores_gemma":[0.99649894,0.0014369411,0.00049524964,0.0006294655,0.0005050119,0.00043440887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001178227,0.001198105,0.00091238774,0.001487431,0.00069038884,0.0018814955,0.0015165284,0.0011665134,0.0054658833],"category_scores_gemma":[0.009651849,0.000560885,0.0010451438,0.00076407497,0.001623759,0.0042796875,0.0034909074,0.0025342323,0.00091075484],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015406086,0.0000415723,0.0022325916,0.00015523912,0.000050692706,0.00018851519,0.00030557977,0.13750677,0.005870742,0.8299976,0.002953102,0.020543534],"study_design_scores_gemma":[0.00001722855,0.000090994436,0.0011258695,0.000034487264,0.000016244447,0.00019004807,0.00010296624,0.5884952,0.002751918,0.39917406,0.007956186,0.00004485368],"about_ca_topic_score_codex":0.0032222942,"about_ca_topic_score_gemma":0.0023707172,"teacher_disagreement_score":0.0054658833,"about_ca_system_score_codex":0.0023428826,"about_ca_system_score_gemma":0.00048661217,"threshold_uncertainty_score":0.018285215},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.283895,0.002334808,0.55342466,0.0010346211,0.00047302296,0.00017250743,0.0013791997,0.00065224426,0.15663402],"genre_scores_gemma":[0.84242165,0.0021110387,0.12573515,0.00029260485,0.00025518378,0.00019993137,0.0009595534,0.000390316,0.027634565],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99905866,0.00014252585,0.000108282766,0.00022982761,0.00032516615,0.00013557772],"domain_scores_gemma":[0.99808705,0.0008011471,0.0003455784,0.00033271336,0.00022191345,0.00021172504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000656656,0.00049581024,0.0010181158,0.0021010241,0.0012581,0.005761719,0.0013708025,0.0007119998,0.010572105],"category_scores_gemma":[0.0032889848,0.00076460815,0.0012059319,0.003015838,0.0022522532,0.0030272708,0.002090226,0.0020722758,0.0016828481],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005249809,0.000016696968,0.00045969326,0.00006646242,0.00001200719,0.00013909198,0.00027081402,0.0030873562,0.0011578255,0.97893035,0.0018148039,0.013992324],"study_design_scores_gemma":[0.000033528864,0.000034000986,0.00040306474,0.00006306755,0.0000273017,0.00041641464,0.00044673146,0.011365246,0.0014691389,0.9672209,0.018493399,0.000027115651],"about_ca_topic_score_codex":0.0011635653,"about_ca_topic_score_gemma":0.00083350384,"teacher_disagreement_score":0.010572105,"about_ca_system_score_codex":0.0010089321,"about_ca_system_score_gemma":0.00041213832,"threshold_uncertainty_score":0.03536719},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32513526,0.0018355523,0.6276356,0.0022551178,0.000109515335,0.0003378471,0.0009278147,0.0011255638,0.04063769],"genre_scores_gemma":[0.73018956,0.0013699902,0.2561591,0.00030620926,0.00015257022,0.0003150307,0.0020853926,0.0002101581,0.009212018],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99866843,0.00040328014,0.00010741872,0.00033895852,0.00029696478,0.00018501654],"domain_scores_gemma":[0.9969337,0.0015448807,0.0004534525,0.00079356856,0.000111850975,0.00016255607],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010377439,0.0006692516,0.00077902863,0.0010367276,0.0015869741,0.0031800068,0.0015289722,0.0014274367,0.0055186874],"category_scores_gemma":[0.008767871,0.0004418658,0.0010675474,0.0030081188,0.0017652359,0.0074032103,0.0025709635,0.0016666029,0.0008687724],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038561746,0.00017973165,0.005090166,0.0003596898,0.0000686387,0.00025112455,0.00094039325,0.04459502,0.0043124408,0.77815545,0.00882343,0.15683834],"study_design_scores_gemma":[0.000069871436,0.0001027951,0.0009811141,0.00004866647,0.00004012831,0.00075246434,0.00031598445,0.1147669,0.0038992984,0.8682923,0.010707656,0.000022888004],"about_ca_topic_score_codex":0.0005287044,"about_ca_topic_score_gemma":0.00057170383,"teacher_disagreement_score":0.0055186874,"about_ca_system_score_codex":0.0018242786,"about_ca_system_score_gemma":0.0007125611,"threshold_uncertainty_score":0.018461823},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29321486,0.0015206726,0.5038046,0.033550873,0.0015866451,0.0005121223,0.009287434,0.003239161,0.15328355],"genre_scores_gemma":[0.7937402,0.0007718476,0.12509327,0.002600394,0.0011538177,0.0005603964,0.011292344,0.0011176436,0.06367009],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986553,0.0003968084,0.00006383705,0.00034341656,0.0002986801,0.0002419334],"domain_scores_gemma":[0.9951898,0.0034201,0.00028406034,0.00032760316,0.00025312192,0.0005253258],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012847754,0.001566087,0.0019333332,0.0008443438,0.0015377955,0.003742918,0.003883565,0.005495489,0.023639161],"category_scores_gemma":[0.01020028,0.00081792305,0.0011421443,0.0013190893,0.001668965,0.0065698866,0.002996055,0.0059681963,0.0017032282],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0027377994,0.0011010417,0.0025328477,0.0015996849,0.00018720333,0.0016052123,0.00049330894,0.13409075,0.0049472745,0.59893274,0.18469408,0.06707812],"study_design_scores_gemma":[0.0008022496,0.00018195929,0.00075883936,0.00010459521,0.00007926993,0.0008390895,0.00031710227,0.3515286,0.0019896014,0.6197358,0.023607524,0.000055289853],"about_ca_topic_score_codex":0.0019066309,"about_ca_topic_score_gemma":0.0021331315,"teacher_disagreement_score":0.023639161,"about_ca_system_score_codex":0.0012569986,"about_ca_system_score_gemma":0.00097593054,"threshold_uncertainty_score":0.07908094},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31733093,0.002608365,0.3847616,0.00491874,0.0012691297,0.000109129716,0.0013236154,0.00058682164,0.2870916],"genre_scores_gemma":[0.8559089,0.0017497644,0.08209259,0.0009973422,0.00054659357,0.00017068087,0.0012882262,0.0004234468,0.056822542],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99764,0.00035888172,0.00012749036,0.00078019523,0.0007688205,0.0003245171],"domain_scores_gemma":[0.99680614,0.0010497263,0.00051715755,0.00031820222,0.0008734774,0.00043532302],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013336577,0.0015077672,0.00077561045,0.0038280115,0.0020950155,0.0057075145,0.0019846398,0.0018152058,0.0150326835],"category_scores_gemma":[0.006993963,0.00063667673,0.00093497813,0.0014929802,0.0033718834,0.008258126,0.005546726,0.004548711,0.0045801057],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028079792,0.000010839599,0.00031730472,0.00004160136,0.000009612589,0.000088281646,0.00015414061,0.0007137964,0.0005697036,0.9915283,0.0017449763,0.004793377],"study_design_scores_gemma":[0.000028739683,0.000033197368,0.00052149326,0.000042619355,0.000014049869,0.00027588214,0.00037218138,0.008581013,0.0013416137,0.97207874,0.016676275,0.000034121083],"about_ca_topic_score_codex":0.0017487903,"about_ca_topic_score_gemma":0.0016546051,"teacher_disagreement_score":0.0150326835,"about_ca_system_score_codex":0.0027765105,"about_ca_system_score_gemma":0.00080760865,"threshold_uncertainty_score":0.050289333},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052916322,0.0019145842,0.85890454,0.0008461732,0.00033003997,0.00018174441,0.0006682392,0.00028100095,0.08395742],"genre_scores_gemma":[0.5607093,0.0022890333,0.40247333,0.000468665,0.00035611744,0.00033439975,0.0016970435,0.00038816177,0.031283952],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977944,0.00045843804,0.00012752395,0.00041831462,0.0009775256,0.00022391185],"domain_scores_gemma":[0.9974132,0.0010545974,0.00032166223,0.000372051,0.00048618816,0.00035228892],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009333685,0.00086785114,0.00092586817,0.0016105084,0.0016685716,0.0026528665,0.0017553746,0.001006953,0.012092943],"category_scores_gemma":[0.0043198327,0.00057958544,0.0009886718,0.0020160107,0.0033414725,0.0037796735,0.0037082904,0.0022024456,0.0019745794],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034547687,0.000024419745,0.00044953334,0.0000904727,0.000011986149,0.00008398055,0.00020274967,0.010128135,0.00076390785,0.96768224,0.003193674,0.01733431],"study_design_scores_gemma":[0.000023955223,0.000076015924,0.00054312765,0.00010367123,0.000018188126,0.0005283437,0.00032750604,0.05654321,0.0019851406,0.8653833,0.074443296,0.000024178313],"about_ca_topic_score_codex":0.0015409412,"about_ca_topic_score_gemma":0.0013387526,"teacher_disagreement_score":0.012092943,"about_ca_system_score_codex":0.0012164841,"about_ca_system_score_gemma":0.0005605494,"threshold_uncertainty_score":0.040454924},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17692149,0.0023642872,0.72660697,0.0036863948,0.0006458555,0.0017047309,0.013628184,0.05905475,0.015387314],"genre_scores_gemma":[0.35364053,0.000918813,0.6144899,0.0010007841,0.00012075416,0.0017521494,0.0197226,0.0034589092,0.004895488],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9812321,0.0037636084,0.002663169,0.002704236,0.008434598,0.0012022896],"domain_scores_gemma":[0.9491027,0.022067595,0.0018641853,0.020376015,0.005870601,0.00071891013],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0086817825,0.0015782522,0.0013382625,0.0018556744,0.0014625423,0.0046732198,0.004531453,0.0032244774,0.01411796],"category_scores_gemma":[0.05901762,0.0010098072,0.0012539924,0.006645584,0.00193741,0.017789187,0.005096621,0.0035094419,0.0052043837],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004889657,0.00204282,0.012822365,0.002938944,0.00032285476,0.0005515051,0.0022708143,0.08997218,0.038404834,0.17853506,0.13547911,0.53176993],"study_design_scores_gemma":[0.0010867239,0.0021324924,0.0023873455,0.00033342207,0.00016990957,0.0009258818,0.0015297272,0.5701738,0.06469112,0.22896774,0.12739503,0.00020681196],"about_ca_topic_score_codex":0.003285271,"about_ca_topic_score_gemma":0.0025316784,"teacher_disagreement_score":0.01411796,"about_ca_system_score_codex":0.0022619877,"about_ca_system_score_gemma":0.0038611325,"threshold_uncertainty_score":0.04722929},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6041711,0.0007968204,0.3450791,0.001249925,0.00014683603,0.00012144933,0.0006671749,0.0009849529,0.04678262],"genre_scores_gemma":[0.9457221,0.00036543695,0.04443049,0.0003291592,0.00008704907,0.000101616664,0.00074548926,0.00019028284,0.008028442],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99856347,0.00023709646,0.00010312539,0.0004825022,0.00033639185,0.0002774848],"domain_scores_gemma":[0.99387956,0.0023252456,0.0009142996,0.0016492533,0.0005012334,0.0007303447],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006782367,0.0006667188,0.0007408359,0.0011020676,0.0016459001,0.001634587,0.0010913163,0.0014931323,0.012254127],"category_scores_gemma":[0.0056172763,0.0011025566,0.0010550115,0.00086589484,0.004316218,0.0052320794,0.003418668,0.0025797838,0.0017705897],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003066745,0.000059559334,0.0031603773,0.00022796656,0.00003911782,0.0007113172,0.001145435,0.012444649,0.014840584,0.9445634,0.0025612123,0.019939732],"study_design_scores_gemma":[0.00005338995,0.00024325069,0.00320983,0.00007305521,0.000052309984,0.0010865277,0.0007735358,0.023949513,0.008194317,0.95028615,0.01202696,0.000051256553],"about_ca_topic_score_codex":0.00094214774,"about_ca_topic_score_gemma":0.0012323492,"teacher_disagreement_score":0.012254127,"about_ca_system_score_codex":0.0006198381,"about_ca_system_score_gemma":0.0002806398,"threshold_uncertainty_score":0.040994108},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030037299,0.00022902555,0.94718623,0.00015985373,0.00026812748,0.00009465882,0.0001855974,0.0010795556,0.020759696],"genre_scores_gemma":[0.2612394,0.0004626595,0.7107362,0.00021163064,0.00015460637,0.00020388434,0.00071111677,0.0010783332,0.025202073],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999331,0.0001168725,0.000047695936,0.00014839674,0.00027833015,0.00007777379],"domain_scores_gemma":[0.99911135,0.00021745125,0.000049277663,0.00031452326,0.00017782126,0.00012955353],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050767284,0.000878388,0.00088342244,0.0012831625,0.00089486747,0.0012063226,0.0017541776,0.0008199926,0.011987805],"category_scores_gemma":[0.002308713,0.0006605847,0.0009159143,0.0010288453,0.0011321747,0.0020142405,0.0046846806,0.0021376843,0.0036744652],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002596817,0.00020199241,0.001207712,0.0004886169,0.000050497427,0.00067600457,0.00061788165,0.036793098,0.04971185,0.62801045,0.013256007,0.26872623],"study_design_scores_gemma":[0.00010500767,0.0005574844,0.0009464933,0.00014914967,0.000087448745,0.0012512831,0.00036915528,0.23827659,0.03139861,0.6201022,0.106674865,0.0000816457],"about_ca_topic_score_codex":0.00054235605,"about_ca_topic_score_gemma":0.00078833796,"teacher_disagreement_score":0.011987805,"about_ca_system_score_codex":0.00037323034,"about_ca_system_score_gemma":0.00044424695,"threshold_uncertainty_score":0.040103197},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07321676,0.0004401291,0.92158574,0.0007783688,0.000042830492,0.000068205496,0.0004411238,0.0011739206,0.0022530174],"genre_scores_gemma":[0.75510573,0.00043646846,0.23722455,0.0003638122,0.00010830178,0.0001940486,0.0012573199,0.00024715127,0.0050625415],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99667275,0.00093576324,0.00020416369,0.00062410545,0.0011387531,0.0004244959],"domain_scores_gemma":[0.9900681,0.0044866023,0.00084259926,0.0035410768,0.00067250116,0.00038912563],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023850673,0.0010374587,0.002004492,0.0009447901,0.00082620216,0.0026484304,0.0027147105,0.001591275,0.0021852332],"category_scores_gemma":[0.019158687,0.0007664786,0.0012494731,0.0015552435,0.001933006,0.006402914,0.004904044,0.0035515588,0.00087764766],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00246426,0.00021974594,0.0051286025,0.00026619973,0.0001734365,0.00025278062,0.000683545,0.6483719,0.0148453275,0.21025506,0.007750756,0.10958846],"study_design_scores_gemma":[0.00003549878,0.00006655133,0.00042511744,0.000015154077,0.000012583951,0.00007214343,0.00004611107,0.933334,0.0030704893,0.061858367,0.0010465974,0.000017440654],"about_ca_topic_score_codex":0.0032418345,"about_ca_topic_score_gemma":0.0028000602,"teacher_disagreement_score":0.0037033432,"about_ca_system_score_codex":0.0037033432,"about_ca_system_score_gemma":0.0014960342,"threshold_uncertainty_score":0.026869774},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92272234,0.00041029765,0.05510981,0.00037309303,0.000058197355,0.000049613147,0.000116617426,0.00023048866,0.020929622],"genre_scores_gemma":[0.9941491,0.0001108163,0.0039703357,0.000043230895,0.000033547036,0.000038383965,0.00009325734,0.000039078655,0.0015222507],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99929106,0.00020249917,0.000023040771,0.0001473758,0.00023238883,0.00010357768],"domain_scores_gemma":[0.9935736,0.0034136116,0.0012260252,0.0005811006,0.00047094695,0.0007346808],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013725706,0.00030357193,0.00043202544,0.0022257979,0.001023334,0.0016864922,0.0013868106,0.0009349982,0.0045321803],"category_scores_gemma":[0.018228805,0.00049201,0.000468867,0.0004900491,0.0028194285,0.0027533756,0.0017403539,0.0009839404,0.00028505854],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034979687,0.00016474567,0.01490465,0.00022208525,0.000093684124,0.00096065376,0.00045875358,0.16832818,0.0143552665,0.7871591,0.0016477616,0.011355327],"study_design_scores_gemma":[0.00004601017,0.00012773158,0.006217252,0.00008218133,0.00003665362,0.00060569815,0.00018064407,0.7750328,0.004654038,0.21161927,0.0013429725,0.000054743155],"about_ca_topic_score_codex":0.0010354557,"about_ca_topic_score_gemma":0.0006255711,"teacher_disagreement_score":0.0045321803,"about_ca_system_score_codex":0.001001584,"about_ca_system_score_gemma":0.0003522755,"threshold_uncertainty_score":0.015161693},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0047004293,0.00008579339,0.9851011,0.000055467706,0.000070895316,0.00005027307,0.0002102679,0.004359565,0.005366098],"genre_scores_gemma":[0.06886269,0.00014027624,0.9162576,0.00014602928,0.000042074807,0.0001329632,0.0014509733,0.002391303,0.010576022],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997645,0.00002407477,0.000015106481,0.000041962932,0.00012533528,0.000028927909],"domain_scores_gemma":[0.9997391,0.00004011922,0.000023886108,0.00010605479,0.00006890877,0.000021958711],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022864244,0.0006866058,0.0004077616,0.0006754366,0.0003642034,0.0010616042,0.0010759261,0.000560057,0.018687664],"category_scores_gemma":[0.00072250614,0.00039099655,0.00054946897,0.0005494999,0.00038148987,0.0007081776,0.0013554294,0.0006854609,0.006896558],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019691486,0.00006715529,0.0009240677,0.000379371,0.000059768758,0.00013078896,0.00014388667,0.065071814,0.10761646,0.030210866,0.03506439,0.7601345],"study_design_scores_gemma":[0.00004892527,0.000119601485,0.00059752574,0.00004592147,0.00001731062,0.00025289448,0.000035532434,0.81488454,0.07367333,0.013313355,0.09697705,0.00003398032],"about_ca_topic_score_codex":0.0020600029,"about_ca_topic_score_gemma":0.0036639941,"teacher_disagreement_score":0.018687664,"about_ca_system_score_codex":0.00032980417,"about_ca_system_score_gemma":0.0005597395,"threshold_uncertainty_score":0.06251645},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8636835,0.00045599614,0.098170094,0.00037541086,0.00009860149,0.000044253742,0.00028332756,0.00018104434,0.03670785],"genre_scores_gemma":[0.97008955,0.00020289537,0.022342488,0.00011414672,0.00005632638,0.000051605442,0.0003136188,0.00006254116,0.0067668147],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99857986,0.000238536,0.00012389492,0.0002400829,0.0006135583,0.0002041081],"domain_scores_gemma":[0.9964725,0.0017276835,0.00047015442,0.00041139446,0.00044869425,0.0004696261],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010869955,0.00043821931,0.0008356917,0.0023682634,0.001296915,0.00293032,0.0009849009,0.0005135229,0.0074888305],"category_scores_gemma":[0.005716267,0.00054309453,0.0007423915,0.0013639845,0.0021936148,0.0026556472,0.0022336047,0.0010382897,0.00038374768],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020372076,0.000074227966,0.003490587,0.00015554763,0.00004977645,0.00039347375,0.00036911113,0.02435077,0.010765703,0.93255776,0.001038593,0.026550733],"study_design_scores_gemma":[0.000036331745,0.00023650416,0.0058336356,0.0001597277,0.00007136615,0.0013550028,0.0006729818,0.15449268,0.014447259,0.81230974,0.010340934,0.00004389292],"about_ca_topic_score_codex":0.00056270184,"about_ca_topic_score_gemma":0.00077069073,"teacher_disagreement_score":0.0074888305,"about_ca_system_score_codex":0.0011930594,"about_ca_system_score_gemma":0.00034058583,"threshold_uncertainty_score":0.025052607},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48548332,0.0060436795,0.26535735,0.0022675486,0.00033579743,0.00028659703,0.0042282133,0.001307027,0.2346905],"genre_scores_gemma":[0.85839397,0.0056405063,0.09811707,0.00031472338,0.00026698285,0.00037907265,0.0036630426,0.0012607726,0.03196382],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989034,0.00031809747,0.000034428456,0.00011426037,0.00043241374,0.00019747167],"domain_scores_gemma":[0.99536324,0.0036599243,0.00027188534,0.00022352226,0.00028178925,0.00019958614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056991825,0.0012556865,0.0010583467,0.0013536789,0.0005000703,0.0019596536,0.0018793752,0.0009529777,0.020440714],"category_scores_gemma":[0.006889492,0.0007820671,0.00045319952,0.0029957287,0.0006283686,0.0024559924,0.0015318,0.0008320275,0.0020203488],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00070017186,0.0001831553,0.0017376868,0.0009382931,0.000059010057,0.0003227038,0.00040083117,0.57156676,0.035572894,0.16281249,0.032849073,0.19285695],"study_design_scores_gemma":[0.000101932565,0.00031998602,0.0026252142,0.00013094782,0.00005663731,0.0005622009,0.0005688784,0.78786564,0.01065918,0.18089002,0.016169498,0.000049844442],"about_ca_topic_score_codex":0.0018614437,"about_ca_topic_score_gemma":0.0029805908,"teacher_disagreement_score":0.020440714,"about_ca_system_score_codex":0.001148511,"about_ca_system_score_gemma":0.0004714248,"threshold_uncertainty_score":0.06838107},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34861603,0.008622094,0.50249356,0.003279331,0.00022330412,0.00018128908,0.0012023038,0.0018620305,0.13352011],"genre_scores_gemma":[0.8913186,0.006578181,0.09296483,0.00069359964,0.00039274435,0.00022816945,0.0010097958,0.0009709916,0.0058430796],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969277,0.00081905955,0.000121975914,0.00063453714,0.00093982054,0.00055701914],"domain_scores_gemma":[0.98211354,0.013559098,0.0014859134,0.0011735004,0.0011125868,0.00055527204],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018576204,0.0016124647,0.0010400286,0.0039843265,0.001216279,0.0024279314,0.0020791187,0.0011400073,0.009166573],"category_scores_gemma":[0.02429942,0.0007575351,0.0007756131,0.003472941,0.0025173558,0.006225539,0.0028238788,0.0024482997,0.0022150574],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012103085,0.00031631233,0.007568173,0.0007113255,0.00017217443,0.00072132796,0.0006537367,0.25103536,0.046513792,0.49052784,0.017301654,0.18326792],"study_design_scores_gemma":[0.00010075703,0.0003407741,0.0051178453,0.00021010537,0.0001946685,0.0019098357,0.00059703714,0.43852472,0.034208216,0.49508047,0.023572413,0.00014318332],"about_ca_topic_score_codex":0.0014469492,"about_ca_topic_score_gemma":0.0009102763,"teacher_disagreement_score":0.009166573,"about_ca_system_score_codex":0.0017984991,"about_ca_system_score_gemma":0.00060026656,"threshold_uncertainty_score":0.030665219},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2993561,0.0012797939,0.65664643,0.00066076126,0.00018379658,0.00010153745,0.0007448612,0.0007988935,0.040227856],"genre_scores_gemma":[0.7409743,0.0011542405,0.22598547,0.00045553787,0.0002255205,0.00020339231,0.0012691972,0.0004409935,0.029291283],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991794,0.000173568,0.00005192253,0.00021380972,0.00026162385,0.00011971983],"domain_scores_gemma":[0.9985588,0.0005661132,0.00021556919,0.00029989387,0.00015337486,0.00020631484],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065302744,0.0007891535,0.000780279,0.0010771218,0.0006973044,0.0011961511,0.0011000319,0.0009947219,0.008778192],"category_scores_gemma":[0.004358931,0.00057890726,0.0008596649,0.0012378219,0.0015115847,0.00289233,0.0033790476,0.0021367753,0.002678023],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002823667,0.000050504616,0.00080614875,0.00019275249,0.000040955623,0.0002535366,0.00038465718,0.04732479,0.013967185,0.88041407,0.0041578547,0.052125197],"study_design_scores_gemma":[0.000046855595,0.00018288058,0.00046816672,0.000045453864,0.00001743574,0.00029319426,0.00011096014,0.06001803,0.0051494087,0.9214145,0.012216202,0.00003698997],"about_ca_topic_score_codex":0.0004252552,"about_ca_topic_score_gemma":0.0006475722,"teacher_disagreement_score":0.008778192,"about_ca_system_score_codex":0.0007112483,"about_ca_system_score_gemma":0.00032634244,"threshold_uncertainty_score":0.029365957},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12588017,0.00030111868,0.859625,0.0002644182,0.0000883918,0.00009350425,0.00022771719,0.00042760305,0.013092172],"genre_scores_gemma":[0.43185365,0.00070024736,0.5553571,0.0002478761,0.00008742109,0.00021162917,0.0009336876,0.00058685674,0.010021587],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991272,0.00024996704,0.0000522064,0.000116594645,0.00028850517,0.00016554253],"domain_scores_gemma":[0.9966659,0.0021747828,0.00029324993,0.000447163,0.00022086958,0.0001980368],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095930306,0.00092209666,0.0010558179,0.0010577474,0.00070604554,0.001454603,0.0014982962,0.0009141637,0.0047261007],"category_scores_gemma":[0.0063548777,0.000865748,0.0008976151,0.0014196403,0.0017947637,0.0026442849,0.004913974,0.002156845,0.00073958247],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005516503,0.00019540287,0.0019455322,0.00025707696,0.00004777246,0.0003100028,0.00054140337,0.36844647,0.010592885,0.47435433,0.0056611793,0.13709624],"study_design_scores_gemma":[0.00005413188,0.000097946264,0.00027697923,0.000051314324,0.000021353713,0.000106124346,0.00012817078,0.65535146,0.0027369584,0.33713502,0.0040233172,0.000017175773],"about_ca_topic_score_codex":0.0022703002,"about_ca_topic_score_gemma":0.0033689735,"teacher_disagreement_score":0.0047261007,"about_ca_system_score_codex":0.00063859316,"about_ca_system_score_gemma":0.0006402258,"threshold_uncertainty_score":0.01581043},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.69236916,0.00079281203,0.23331189,0.0014230837,0.00024819208,0.000089469075,0.0004493505,0.00055434625,0.0707616],"genre_scores_gemma":[0.9645823,0.00034276355,0.025640737,0.0001786972,0.0001314316,0.00010757479,0.00041334276,0.00016599988,0.008437151],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987476,0.00031735617,0.000068823625,0.0002945673,0.00035787944,0.00021379172],"domain_scores_gemma":[0.9956691,0.0022247352,0.0006011969,0.0004717845,0.00030552637,0.0007276905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001025272,0.0007606047,0.0011349206,0.0028342623,0.0028652302,0.0030493059,0.0021662351,0.0019230198,0.008094205],"category_scores_gemma":[0.006367953,0.0012059388,0.0009306095,0.0020341268,0.004019795,0.005718926,0.003901064,0.003809051,0.00064748956],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043560216,0.000020393278,0.00038889315,0.000048171445,0.000008948931,0.00015415362,0.0003291475,0.0056376406,0.000491711,0.98951095,0.0006917844,0.0026746197],"study_design_scores_gemma":[0.000010705062,0.000016146152,0.00020716188,0.000012175138,0.000008329561,0.00011263207,0.00019028598,0.00822464,0.00030290164,0.98980975,0.0010968529,0.000008278007],"about_ca_topic_score_codex":0.00076343084,"about_ca_topic_score_gemma":0.0013816567,"teacher_disagreement_score":0.008094205,"about_ca_system_score_codex":0.001185294,"about_ca_system_score_gemma":0.00053313107,"threshold_uncertainty_score":0.027077794},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79769653,0.0003561891,0.15874758,0.00063402933,0.000113055816,0.00007290401,0.0008122493,0.00045909337,0.041108333],"genre_scores_gemma":[0.9635288,0.00038246156,0.028330002,0.00020597801,0.000041313433,0.000051372903,0.00096929166,0.00016505054,0.006325719],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99935156,0.000064896514,0.000043753083,0.00021100254,0.00017147989,0.00015737905],"domain_scores_gemma":[0.99805534,0.0010176148,0.0002860023,0.00023718992,0.00012489223,0.00027892579],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037763358,0.0005797824,0.00060836546,0.00046934144,0.0008194369,0.0015120526,0.0009427215,0.00055659504,0.012962319],"category_scores_gemma":[0.0018585125,0.00069801515,0.0010476026,0.00066970114,0.0010842264,0.0021337322,0.0018379678,0.0016755803,0.0010395383],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009092825,0.00028169868,0.009838911,0.00055410044,0.00015631029,0.0031593575,0.0015226831,0.082636274,0.07365454,0.7514614,0.0068165986,0.069008864],"study_design_scores_gemma":[0.0004186434,0.0004022314,0.008606116,0.000094819974,0.00019251351,0.0024748768,0.00092366216,0.07944678,0.049708143,0.8300318,0.02756179,0.00013864748],"about_ca_topic_score_codex":0.00136732,"about_ca_topic_score_gemma":0.0014875578,"teacher_disagreement_score":0.012962319,"about_ca_system_score_codex":0.0006938124,"about_ca_system_score_gemma":0.00045735168,"threshold_uncertainty_score":0.043363273},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17993866,0.0016752263,0.76474255,0.0022877557,0.00018619472,0.0002565562,0.00080534717,0.004058372,0.04604931],"genre_scores_gemma":[0.57850313,0.0009358495,0.39759767,0.0005598994,0.00019289376,0.000278236,0.00224661,0.00093012303,0.018755583],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986424,0.00021299551,0.000066301596,0.00037521668,0.0004438839,0.00025916347],"domain_scores_gemma":[0.99841356,0.00075153896,0.000100962854,0.0004415431,0.00016033932,0.00013203286],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074075797,0.0010946592,0.0011983892,0.0010433567,0.0018391187,0.002815083,0.0018984879,0.00084217876,0.0086485185],"category_scores_gemma":[0.0034729328,0.0006256078,0.001656511,0.0022600011,0.002251182,0.0047997637,0.0052789673,0.003998825,0.0034207497],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004411309,0.00018828837,0.0017275256,0.0004890993,0.000048873815,0.00032039746,0.0010674453,0.04182437,0.013168946,0.75309294,0.013653783,0.17397724],"study_design_scores_gemma":[0.00010251971,0.00012391133,0.00063277245,0.00010263201,0.0000456685,0.00035373733,0.00044243466,0.16574138,0.014119145,0.77310854,0.045155413,0.00007190456],"about_ca_topic_score_codex":0.0029089125,"about_ca_topic_score_gemma":0.004374982,"teacher_disagreement_score":0.0086485185,"about_ca_system_score_codex":0.0026860086,"about_ca_system_score_gemma":0.0011808173,"threshold_uncertainty_score":0.028932154},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90260327,0.00054398953,0.05086841,0.0007975676,0.00014314477,0.00004502773,0.00032575717,0.00008967515,0.044583164],"genre_scores_gemma":[0.98739606,0.00017068742,0.008985293,0.00006104207,0.00007540234,0.000030684692,0.00019508961,0.000027968372,0.0030577162],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985488,0.00029780978,0.00007354329,0.00021495321,0.0005497858,0.00031503013],"domain_scores_gemma":[0.99343044,0.0035285838,0.0007865162,0.00067736726,0.000726109,0.00085108273],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012208668,0.0003163241,0.000830314,0.001335622,0.0018997019,0.0027697326,0.0010816585,0.0008137538,0.00805667],"category_scores_gemma":[0.0068987594,0.00036915054,0.00055154314,0.0007564299,0.004719675,0.0022804367,0.0021580637,0.0014481292,0.00039046927],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005695111,0.00006941295,0.011964802,0.00015982475,0.00003748521,0.0002399789,0.00061316654,0.013765219,0.004823204,0.9301148,0.003930382,0.033712246],"study_design_scores_gemma":[0.000046485235,0.00012194874,0.0054866816,0.00006266749,0.000020174492,0.00042385538,0.0006862795,0.06657635,0.0040632766,0.9178633,0.0045975316,0.000051366656],"about_ca_topic_score_codex":0.0018955644,"about_ca_topic_score_gemma":0.0011938222,"teacher_disagreement_score":0.00805667,"about_ca_system_score_codex":0.0011256123,"about_ca_system_score_gemma":0.00054693554,"threshold_uncertainty_score":0.026952267},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43829465,0.0014903224,0.51732737,0.00043485145,0.000058987618,0.00017865203,0.0006355244,0.00075617933,0.040823467],"genre_scores_gemma":[0.761504,0.0028513863,0.21545513,0.00011832775,0.00009818831,0.00017398543,0.0019368504,0.00024906083,0.017612971],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995603,0.00011322461,0.000023601353,0.00008786437,0.00015249074,0.0000625424],"domain_scores_gemma":[0.9979382,0.00083087623,0.0006255782,0.0002784033,0.00020420313,0.00012262118],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001947433,0.00081497844,0.00042820335,0.00072859216,0.00054748426,0.00092734786,0.0008893658,0.00069402595,0.0075891297],"category_scores_gemma":[0.0033995174,0.0006357963,0.00047940895,0.0015528448,0.00050492014,0.0020535148,0.0006735098,0.0009139925,0.0014942397],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003572921,0.0001983984,0.007302594,0.0007165013,0.00014905802,0.002107574,0.00072753895,0.40559602,0.055579174,0.30327174,0.010080889,0.21391323],"study_design_scores_gemma":[0.00013668952,0.00054757006,0.0056602876,0.00012665559,0.00012972271,0.0031401345,0.00062536524,0.58477426,0.0292828,0.3246792,0.050815497,0.00008174669],"about_ca_topic_score_codex":0.00094596687,"about_ca_topic_score_gemma":0.0021627264,"teacher_disagreement_score":0.0075891297,"about_ca_system_score_codex":0.00041119175,"about_ca_system_score_gemma":0.00018438805,"threshold_uncertainty_score":0.025388181},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.67342085,0.003884643,0.25486216,0.0021063623,0.0001319291,0.00009625144,0.0016798053,0.0005724163,0.06324563],"genre_scores_gemma":[0.9090783,0.0019195575,0.08166563,0.00024189427,0.00012187825,0.0001339715,0.001402164,0.00025328068,0.0051833196],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991906,0.00012595298,0.00004158768,0.00027007202,0.00020611135,0.00016565951],"domain_scores_gemma":[0.99383163,0.004629075,0.0004229231,0.0005463467,0.00019211836,0.0003777517],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067599973,0.00095259515,0.00093714625,0.0011221744,0.0011738687,0.0019356471,0.002086379,0.00097009656,0.00608294],"category_scores_gemma":[0.005380973,0.00071487704,0.0008586384,0.0009370784,0.0015728126,0.0039858557,0.0024247563,0.002210731,0.0007327505],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013971988,0.00045229474,0.02358365,0.0013139495,0.00024989227,0.0012115086,0.0012222129,0.40091854,0.047136102,0.4183458,0.016812952,0.08735585],"study_design_scores_gemma":[0.000081369835,0.00026562734,0.010508648,0.00013034038,0.00013327044,0.0009808363,0.00062272424,0.61010724,0.023628533,0.33841178,0.01504907,0.00008052884],"about_ca_topic_score_codex":0.0014403565,"about_ca_topic_score_gemma":0.0026486649,"teacher_disagreement_score":0.00608294,"about_ca_system_score_codex":0.0013162068,"about_ca_system_score_gemma":0.0003802445,"threshold_uncertainty_score":0.020349503},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70279175,0.000976824,0.27455834,0.00023748563,0.00004105129,0.00016592146,0.00060356024,0.00041678097,0.020208362],"genre_scores_gemma":[0.8356285,0.0005339075,0.15493736,0.0001159394,0.00003418675,0.00025821457,0.0014329152,0.00014837024,0.0069106836],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99917644,0.00015028134,0.00005859654,0.0001950011,0.00029346874,0.00012616723],"domain_scores_gemma":[0.9984579,0.00058033963,0.00037418786,0.0002002691,0.00023613992,0.00015116934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041099603,0.0005139771,0.0005947755,0.0024324604,0.000915339,0.0013701414,0.0011302092,0.000894092,0.0041306927],"category_scores_gemma":[0.0037809038,0.0005966708,0.0003734836,0.0023415266,0.0012075516,0.0017868512,0.002243424,0.0007759036,0.00083420944],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004924225,0.000121725265,0.006520525,0.0004321822,0.00008735159,0.0010140372,0.0015655259,0.17046179,0.020562876,0.6618341,0.005447126,0.13146025],"study_design_scores_gemma":[0.000099816556,0.00019103145,0.003266583,0.0001748505,0.00004803783,0.0013656016,0.0007350807,0.3179512,0.010810038,0.648372,0.016929453,0.00005626076],"about_ca_topic_score_codex":0.0012396631,"about_ca_topic_score_gemma":0.001251076,"teacher_disagreement_score":0.0041306927,"about_ca_system_score_codex":0.00070006,"about_ca_system_score_gemma":0.00028737856,"threshold_uncertainty_score":0.013818562},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.099774726,0.00033739643,0.832544,0.00037687208,0.00013318892,0.0001286958,0.00046877915,0.00041345513,0.06582282],"genre_scores_gemma":[0.7434509,0.0008642524,0.22564049,0.0004221695,0.00018356572,0.00030944988,0.0011338757,0.00027431248,0.027721059],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99940443,0.00008279839,0.000034091987,0.00011610862,0.00025285326,0.00010982569],"domain_scores_gemma":[0.9987186,0.00048437095,0.00016218238,0.00019640826,0.00031172787,0.00012682303],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006448526,0.0006198437,0.0004854625,0.0017903834,0.0009719788,0.0016817285,0.00087613566,0.000610409,0.0087849405],"category_scores_gemma":[0.0035609403,0.00035427877,0.0008005034,0.001167737,0.0017699391,0.002582741,0.0018703421,0.0014098214,0.0014960057],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012922422,0.000009638986,0.00016665693,0.000027248216,0.0000033793874,0.00003670906,0.00007059303,0.0048408024,0.0006992508,0.98220956,0.001107693,0.010815453],"study_design_scores_gemma":[0.0000132033465,0.000017665941,0.00017826966,0.00001111899,0.000004086997,0.00006913448,0.00008721834,0.031315655,0.0011190905,0.9609293,0.00624445,0.000010809329],"about_ca_topic_score_codex":0.0014957715,"about_ca_topic_score_gemma":0.0015273084,"teacher_disagreement_score":0.0087849405,"about_ca_system_score_codex":0.0009038803,"about_ca_system_score_gemma":0.00056793465,"threshold_uncertainty_score":0.029388607},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04405794,0.010057879,0.5843584,0.0076788794,0.0042657712,0.00030895145,0.0045462823,0.0035173774,0.34120855],"genre_scores_gemma":[0.29270202,0.01041429,0.51891756,0.0031458782,0.002637957,0.0018108743,0.00611445,0.0052863774,0.15897061],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978861,0.00028176865,0.000097921235,0.000561713,0.00073645444,0.0004360578],"domain_scores_gemma":[0.9929235,0.004954294,0.00023826148,0.0009780725,0.0005023593,0.000403505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018513007,0.003996892,0.002457369,0.0031816682,0.0025815254,0.005169389,0.0066771396,0.0030753158,0.0534793],"category_scores_gemma":[0.011750113,0.0016379006,0.0033927117,0.0038294136,0.0024553651,0.008522593,0.0075587644,0.011296219,0.0135738095],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010458339,0.0005650806,0.0016311542,0.0015964304,0.00024023965,0.00031059832,0.00042386583,0.07019852,0.020516463,0.43141916,0.15096955,0.32108316],"study_design_scores_gemma":[0.00011985783,0.00020886619,0.0025483689,0.00052525784,0.00032082025,0.000708735,0.0002150051,0.33729464,0.010231678,0.5617448,0.08592801,0.00015392913],"about_ca_topic_score_codex":0.0041996147,"about_ca_topic_score_gemma":0.010776457,"teacher_disagreement_score":0.0534793,"about_ca_system_score_codex":0.0037555117,"about_ca_system_score_gemma":0.0021678486,"threshold_uncertainty_score":0.17890608},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7677919,0.00038685204,0.18745609,0.0005255273,0.000039806044,0.000065782275,0.0007461168,0.0007169145,0.042271003],"genre_scores_gemma":[0.92489195,0.00046223996,0.06708302,0.0001545339,0.00004484879,0.00013096997,0.0011538452,0.0003376332,0.0057410644],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99927837,0.0001293706,0.000020280282,0.00019044886,0.00018928421,0.00019228371],"domain_scores_gemma":[0.99478465,0.0031459788,0.00066976075,0.0006311812,0.0003710914,0.0003973838],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047540636,0.0007065793,0.00076850125,0.0011146362,0.0015284948,0.0018552142,0.0012964866,0.00095867034,0.008922517],"category_scores_gemma":[0.0031745746,0.0007542684,0.0009026385,0.0022076177,0.0021008572,0.003410728,0.0024384405,0.0024364486,0.0009294066],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006132097,0.00015974973,0.009008134,0.00031645116,0.000098542456,0.0008841047,0.0011184224,0.05531337,0.032564715,0.8631837,0.0064812033,0.03025846],"study_design_scores_gemma":[0.00014457795,0.0001966828,0.010569865,0.00010457846,0.00016924714,0.0016218056,0.0012174968,0.18419546,0.033500414,0.75077057,0.017403293,0.00010600876],"about_ca_topic_score_codex":0.0017294318,"about_ca_topic_score_gemma":0.0019744365,"teacher_disagreement_score":0.008922517,"about_ca_system_score_codex":0.00098028,"about_ca_system_score_gemma":0.00062535563,"threshold_uncertainty_score":0.029848814},"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":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02025291,0.0012645255,0.77880955,0.00042441962,0.00058446144,0.0003152936,0.0045913113,0.09604152,0.097716086],"genre_scores_gemma":[0.18780215,0.0010918331,0.65715706,0.00083718094,0.00018363085,0.0005657332,0.017161231,0.013250487,0.1219507],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99925345,0.000057847177,0.00004152775,0.00015700443,0.0003962887,0.00009384573],"domain_scores_gemma":[0.99935275,0.00014520097,0.000049786613,0.00021816837,0.00017886306,0.000055207915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065428024,0.0009813574,0.00064910535,0.0009917798,0.00062743796,0.0014185086,0.0015609168,0.0011219606,0.06661078],"category_scores_gemma":[0.0012199874,0.0005053942,0.00069558335,0.00064636185,0.0005237824,0.0016278217,0.0013777162,0.0013502237,0.022480784],"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.00075147976,0.00023483361,0.0009772821,0.00078999664,0.00006764095,0.00038683784,0.0002844137,0.026622493,0.117845364,0.039587658,0.18667369,0.6257783],"study_design_scores_gemma":[0.00027804985,0.00033931618,0.00116682,0.000085205895,0.000033460827,0.00085291796,0.00011422248,0.22788328,0.17872167,0.013929951,0.5764628,0.00013232033],"about_ca_topic_score_codex":0.0014100067,"about_ca_topic_score_gemma":0.0033341474,"teacher_disagreement_score":0.06661078,"about_ca_system_score_codex":0.00067820505,"about_ca_system_score_gemma":0.0010407631,"threshold_uncertainty_score":0},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.095629446,0.0071645854,0.8061525,0.0031273814,0.00066458626,0.00033516536,0.0024303237,0.0045041274,0.07999189],"genre_scores_gemma":[0.44172177,0.004609021,0.5260697,0.0010106934,0.00069965067,0.00058759266,0.0039032705,0.0016724422,0.019725863],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99604094,0.0004513787,0.00017689921,0.00074187695,0.0015661226,0.0010227235],"domain_scores_gemma":[0.9927206,0.0040417,0.00034657016,0.0015805134,0.0009278984,0.00038264078],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001847076,0.0018590904,0.0015930474,0.0030129305,0.0016838763,0.0036705954,0.0032403618,0.0020030006,0.020860454],"category_scores_gemma":[0.015000735,0.00092336937,0.0021873042,0.004095627,0.0021060167,0.009285096,0.0053799115,0.0047030128,0.0048117912],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017214813,0.00042666207,0.0066065583,0.0013496369,0.00021785336,0.00083291775,0.0009978117,0.19891499,0.037207257,0.28834915,0.061681002,0.40169466],"study_design_scores_gemma":[0.00011786299,0.0004202352,0.0030421657,0.00030567398,0.00024642964,0.0012153371,0.00031004558,0.6031232,0.016755845,0.2956488,0.07869613,0.00011823563],"about_ca_topic_score_codex":0.0045563537,"about_ca_topic_score_gemma":0.0042646527,"teacher_disagreement_score":0.020860454,"about_ca_system_score_codex":0.0027104008,"about_ca_system_score_gemma":0.0014279336,"threshold_uncertainty_score":0.06978518},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23146388,0.0008301273,0.71997035,0.0008453428,0.00026226765,0.000091408976,0.0011380311,0.00075824553,0.04464029],"genre_scores_gemma":[0.68597895,0.0015617892,0.27019727,0.00025450625,0.00020571506,0.00017835818,0.0025087409,0.0009715239,0.038143188],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99928445,0.00012276364,0.00004801848,0.00017175838,0.0002710082,0.000102033526],"domain_scores_gemma":[0.9981444,0.00079515006,0.00018944952,0.0003333636,0.00029879957,0.00023887533],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043940582,0.00081660383,0.00065161684,0.0020771646,0.00082726876,0.0027449618,0.0012664607,0.0011820102,0.010677576],"category_scores_gemma":[0.0045712576,0.00074345805,0.0008446882,0.0015968644,0.0014146179,0.00475093,0.004204685,0.0038364234,0.0017380367],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010194757,0.000051529147,0.0007065808,0.00011043563,0.000013522748,0.00019453092,0.00060874486,0.009181339,0.0034141338,0.9379867,0.0028466883,0.044783857],"study_design_scores_gemma":[0.000018971554,0.000056998168,0.00051642244,0.000049261518,0.000019438294,0.0002806932,0.00037825934,0.039052956,0.0023806065,0.9414509,0.015777525,0.000018060618],"about_ca_topic_score_codex":0.0010880262,"about_ca_topic_score_gemma":0.0010872678,"teacher_disagreement_score":0.010677576,"about_ca_system_score_codex":0.00083501067,"about_ca_system_score_gemma":0.00032911633,"threshold_uncertainty_score":0.03572005},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20516796,0.0013810606,0.75080997,0.00484239,0.00032334347,0.00020340846,0.00088014157,0.0004527708,0.03593901],"genre_scores_gemma":[0.87336874,0.0017256018,0.108941205,0.0002445807,0.00022357507,0.00034605438,0.00063445215,0.000252977,0.014262892],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976351,0.0006759158,0.00010594176,0.00038819335,0.0008464263,0.0003483835],"domain_scores_gemma":[0.99302554,0.0048641176,0.0005181071,0.00071548234,0.0005488423,0.0003278839],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013919942,0.0006665143,0.0008076017,0.00094025285,0.001191599,0.0021219996,0.0020105469,0.0013616834,0.008603688],"category_scores_gemma":[0.013910429,0.0004222041,0.0004030287,0.0017238139,0.0015755713,0.0065328465,0.0019931612,0.0015043233,0.00075640687],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002439839,0.00005601337,0.0010065238,0.00018609651,0.0000260717,0.00024143938,0.00022561509,0.46476337,0.002170256,0.49247468,0.0065359487,0.032069962],"study_design_scores_gemma":[0.000032055934,0.00010262351,0.000704719,0.000032029046,0.00002745524,0.000276848,0.0002639544,0.7354345,0.0013238279,0.25224447,0.00953283,0.000024762781],"about_ca_topic_score_codex":0.0024237288,"about_ca_topic_score_gemma":0.0018286627,"teacher_disagreement_score":0.008603688,"about_ca_system_score_codex":0.002290283,"about_ca_system_score_gemma":0.0010131863,"threshold_uncertainty_score":0.028782189},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002527324,0.0006251418,0.9887305,0.00043038218,0.00010448702,0.000055379496,0.00011244415,0.00044399317,0.006970343],"genre_scores_gemma":[0.064218454,0.0013748908,0.9230701,0.00024237594,0.00026182804,0.0001885661,0.0005741592,0.00074473117,0.009324912],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99723756,0.0005272131,0.00019488108,0.0006558443,0.0012100828,0.0001744086],"domain_scores_gemma":[0.9966383,0.001985735,0.00019424995,0.0006335238,0.00042676486,0.00012142133],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001973701,0.0017518237,0.0018042466,0.0029830062,0.0014830353,0.0043474277,0.003983613,0.002361427,0.01410594],"category_scores_gemma":[0.01069399,0.0012441913,0.0019714884,0.004458582,0.0027228026,0.009981982,0.0050005997,0.0054148193,0.0038444446],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010440854,0.00006835144,0.00045666052,0.00034049104,0.00003412509,0.00011859164,0.00048387417,0.08945018,0.0025694151,0.6643083,0.012580008,0.2294855],"study_design_scores_gemma":[0.000024729527,0.00006916742,0.00011277867,0.000084818545,0.000019648092,0.00020009924,0.00017012499,0.25391364,0.0021024807,0.7054563,0.037813827,0.000032439395],"about_ca_topic_score_codex":0.0018085979,"about_ca_topic_score_gemma":0.001376294,"teacher_disagreement_score":0.01410594,"about_ca_system_score_codex":0.0020448607,"about_ca_system_score_gemma":0.0011240228,"threshold_uncertainty_score":0.047189116},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06608808,0.00024432194,0.8996354,0.00020424026,0.000070978305,0.000044499167,0.00022648339,0.000991971,0.03249402],"genre_scores_gemma":[0.5361281,0.00039997912,0.43862855,0.0002035482,0.00010625322,0.00023161512,0.00090368645,0.0008393838,0.022558829],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990326,0.00024573135,0.000053161435,0.00012034691,0.0004293119,0.00011889469],"domain_scores_gemma":[0.99790204,0.00091894955,0.00011270501,0.000541327,0.0003935345,0.00013147555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070973026,0.00039969955,0.00045288232,0.0009657182,0.0005073795,0.0021078205,0.000939609,0.0004497504,0.009496722],"category_scores_gemma":[0.004052921,0.0004741227,0.0006014059,0.0012075698,0.00080729707,0.002314549,0.0024514964,0.0013755967,0.002125571],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011428759,0.000049950362,0.0011065027,0.000111840454,0.000018781702,0.00016155205,0.00040407447,0.01571465,0.0096689155,0.86545527,0.005349657,0.10184455],"study_design_scores_gemma":[0.000037901424,0.00016380481,0.0007891335,0.000070374284,0.000029899798,0.00082639576,0.00025689715,0.22838815,0.022367047,0.7173275,0.02970097,0.00004192561],"about_ca_topic_score_codex":0.0003326528,"about_ca_topic_score_gemma":0.0005518605,"teacher_disagreement_score":0.009496722,"about_ca_system_score_codex":0.00064858096,"about_ca_system_score_gemma":0.00048421376,"threshold_uncertainty_score":0.031769693},"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":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0070215324,0.04322293,0.93583846,0.0014257702,0.0004172461,0.00007233011,0.0004817965,0.0008178114,0.010702082],"genre_scores_gemma":[0.1006499,0.12989342,0.7562615,0.00045965824,0.001207527,0.00030067188,0.0025111558,0.0010972295,0.0076188836],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99872214,0.0002366378,0.00012034737,0.00029194882,0.00056232704,0.0000665395],"domain_scores_gemma":[0.9955206,0.0031965098,0.00016087729,0.0004999035,0.00052994175,0.000092126094],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015755832,0.0015418768,0.0024893342,0.0039873286,0.0013005927,0.0042572725,0.0030657127,0.0027391673,0.0059826267],"category_scores_gemma":[0.008930592,0.0013776696,0.0017403616,0.0088586435,0.0022032598,0.008153109,0.0030667023,0.0037318303,0.0036973995],"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.000047658592,0.00006177186,0.0010098414,0.0022804805,0.00006694806,0.00008926208,0.00029532236,0.082151935,0.0009914514,0.41427746,0.01258027,0.48614758],"study_design_scores_gemma":[0.000022782939,0.000051978477,0.000501982,0.00045857785,0.00002938151,0.00032878204,0.00021709726,0.23609683,0.0012566826,0.68880534,0.072181284,0.00004935949],"about_ca_topic_score_codex":0.002476599,"about_ca_topic_score_gemma":0.001802105,"teacher_disagreement_score":0.0059826267,"about_ca_system_score_codex":0.001492229,"about_ca_system_score_gemma":0.0015855053,"threshold_uncertainty_score":0.020013928},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10393897,0.0009739418,0.8790023,0.0005623722,0.0001318542,0.00010494795,0.00025494242,0.0010888623,0.013941889],"genre_scores_gemma":[0.39263755,0.0007158448,0.58778125,0.00012992033,0.00006619349,0.00014327263,0.0005196902,0.000753684,0.017252618],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988871,0.0003087099,0.000056496723,0.00019853875,0.00036998512,0.00017918905],"domain_scores_gemma":[0.996765,0.0016374558,0.00027340712,0.00065486925,0.00042776126,0.00024145887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013079988,0.0009567715,0.0015307415,0.001621746,0.0009415932,0.0015530667,0.0021226974,0.0022023963,0.010213609],"category_scores_gemma":[0.009880927,0.0008098388,0.0007695884,0.0023149247,0.001085284,0.0035509497,0.001710515,0.0015406675,0.0019453585],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007164179,0.00019986877,0.001765324,0.00041587115,0.000060966235,0.000111999725,0.00019350027,0.50754696,0.014433908,0.117851004,0.012671691,0.3440326],"study_design_scores_gemma":[0.000033287724,0.00013501087,0.00040977297,0.00003337517,0.000025406114,0.000093316434,0.00007590408,0.91185033,0.0039229,0.079648495,0.0037581879,0.0000141640085],"about_ca_topic_score_codex":0.0029447302,"about_ca_topic_score_gemma":0.0057526077,"teacher_disagreement_score":0.010213609,"about_ca_system_score_codex":0.001332744,"about_ca_system_score_gemma":0.0013380074,"threshold_uncertainty_score":0.034167945},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027754333,0.027652545,0.7513044,0.017135352,0.012095691,0.00047633515,0.0049951905,0.0026758118,0.1559104],"genre_scores_gemma":[0.3977223,0.0241667,0.4750157,0.011528567,0.015106966,0.0016418622,0.005616692,0.002306944,0.0668944],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997624,0.0003265472,0.00014545799,0.00046233245,0.0011978623,0.00024382777],"domain_scores_gemma":[0.99319756,0.004051453,0.00039127003,0.0006403031,0.0011200751,0.00059935293],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016505474,0.0027381694,0.0012994237,0.002776133,0.0025623378,0.0028872504,0.0021445388,0.0018902484,0.032823525],"category_scores_gemma":[0.014140776,0.0016364098,0.002388662,0.0027848643,0.004106568,0.0058098044,0.007823699,0.009097048,0.007359337],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025097243,0.00016018744,0.001300422,0.002184697,0.00015685993,0.001253794,0.00088201754,0.018514687,0.018127078,0.7421471,0.09224283,0.122779325],"study_design_scores_gemma":[0.00005674102,0.00019487669,0.0014666576,0.00038525098,0.000076062606,0.0007300945,0.00018428573,0.011023278,0.003546708,0.8316905,0.1505369,0.00010864546],"about_ca_topic_score_codex":0.002105059,"about_ca_topic_score_gemma":0.0019051263,"teacher_disagreement_score":0.032823525,"about_ca_system_score_codex":0.0020116456,"about_ca_system_score_gemma":0.0008257444,"threshold_uncertainty_score":0.10980564},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27857473,0.00032311137,0.7031688,0.0008490214,0.00006075733,0.00036391665,0.0007055362,0.0011540448,0.01480003],"genre_scores_gemma":[0.63789773,0.0003506303,0.35498977,0.00017053807,0.00007507874,0.00038097487,0.0019776607,0.00022865832,0.003929029],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985501,0.0004853684,0.00008482685,0.0003967297,0.00033507717,0.0001477668],"domain_scores_gemma":[0.99512595,0.0028282944,0.00057040807,0.00091921235,0.0002608932,0.00029531005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009961198,0.0011812336,0.0008726078,0.0008250056,0.0008070505,0.0013852728,0.0018685743,0.0013669183,0.004530627],"category_scores_gemma":[0.006812892,0.0008014189,0.0011299159,0.0014236226,0.0016226433,0.0044207093,0.0028548518,0.0013542178,0.000633002],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008300061,0.0003898054,0.005105762,0.00074503303,0.00009212542,0.001392699,0.00079788186,0.53243214,0.029647663,0.2801653,0.006141507,0.14226],"study_design_scores_gemma":[0.00009641555,0.0002556833,0.0010985989,0.000077432844,0.000049479895,0.00090252014,0.00032524654,0.7093404,0.016673319,0.26103306,0.010099012,0.000048843314],"about_ca_topic_score_codex":0.00082038343,"about_ca_topic_score_gemma":0.000916291,"teacher_disagreement_score":0.004530627,"about_ca_system_score_codex":0.00069992826,"about_ca_system_score_gemma":0.00054925797,"threshold_uncertainty_score":0.0151565075},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.69873,0.002832552,0.1366069,0.0018615486,0.0003489986,0.00009355578,0.0012543676,0.0005764522,0.15769556],"genre_scores_gemma":[0.9719696,0.00077235256,0.014181069,0.00016313711,0.00018609251,0.00006165806,0.0010334081,0.00013165426,0.011501053],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99892277,0.00015502011,0.000041177747,0.00026372776,0.00037356836,0.00024370741],"domain_scores_gemma":[0.9980215,0.00095528987,0.00019668882,0.0002961326,0.0002566353,0.00027376376],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042362948,0.00044817693,0.00065198337,0.0014330224,0.001993147,0.0018538806,0.0005855042,0.0010149252,0.014163062],"category_scores_gemma":[0.003911961,0.00056348357,0.0009214437,0.0010837767,0.0013315344,0.0023367004,0.0018823508,0.0011114384,0.0012299241],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004254181,0.000052583728,0.008382175,0.00032419368,0.00008754202,0.0024926122,0.00209368,0.023164533,0.01713725,0.8632648,0.016732438,0.0658428],"study_design_scores_gemma":[0.000061934865,0.00016749003,0.011273897,0.0001956335,0.000086910004,0.0063809236,0.0017804711,0.12393219,0.010806599,0.72727,0.117965326,0.000078578894],"about_ca_topic_score_codex":0.0031043608,"about_ca_topic_score_gemma":0.0017502368,"teacher_disagreement_score":0.014163062,"about_ca_system_score_codex":0.0015840281,"about_ca_system_score_gemma":0.0002495766,"threshold_uncertainty_score":0.04738009},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22356802,0.001612593,0.6254859,0.0015449823,0.0007810795,0.00015794959,0.00044825487,0.0007839452,0.14561725],"genre_scores_gemma":[0.772108,0.0013804807,0.16695283,0.00035459187,0.0002947072,0.00013414466,0.00055821805,0.00056719413,0.057649694],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993389,0.00017360944,0.000040586645,0.000117147036,0.0001936395,0.0001361172],"domain_scores_gemma":[0.99911267,0.00032447896,0.00010243364,0.00015158155,0.00014581403,0.00016305778],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049852,0.0005883676,0.0007601489,0.0020975121,0.0015861478,0.003037149,0.0011775526,0.0013480136,0.014394487],"category_scores_gemma":[0.0033657248,0.0007378208,0.0007682622,0.0015979267,0.0026757417,0.003506991,0.0030641875,0.0023754272,0.0025130396],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027819462,0.000011607765,0.0002867422,0.00003665151,0.0000054556945,0.00006840941,0.00029405762,0.005553664,0.0007849011,0.9769693,0.0017576097,0.014203732],"study_design_scores_gemma":[0.000010293809,0.000020860647,0.00016688828,0.000029421904,0.0000050641024,0.00006775029,0.0002172722,0.0146454265,0.0003648093,0.974337,0.010126612,0.00000860226],"about_ca_topic_score_codex":0.0015579803,"about_ca_topic_score_gemma":0.0019402752,"teacher_disagreement_score":0.014394487,"about_ca_system_score_codex":0.0010123232,"about_ca_system_score_gemma":0.00035593304,"threshold_uncertainty_score":0.048154354},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45527738,0.00041467702,0.35954332,0.0004549876,0.0004055521,0.00013514054,0.00059940264,0.0009689883,0.18220045],"genre_scores_gemma":[0.878961,0.00029606427,0.074919656,0.00020866632,0.0000964503,0.00017610537,0.0005366238,0.0003173835,0.044487894],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996971,0.000036441244,0.000013809933,0.000079506615,0.00008082253,0.00009235973],"domain_scores_gemma":[0.99973255,0.000058429767,0.00004002495,0.00006043039,0.000047225134,0.00006132165],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016079063,0.00028924,0.00025253007,0.00046999307,0.0007851375,0.0010936825,0.00054537796,0.00030071582,0.0062547154],"category_scores_gemma":[0.00074679434,0.00020464073,0.0005060534,0.00030975675,0.0008668086,0.00086558424,0.0016932028,0.0007245178,0.0015886364],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015889277,0.00006581266,0.0009515327,0.000049362116,0.000012012909,0.00033227136,0.0005082581,0.007157984,0.010587368,0.93090963,0.004313948,0.044953015],"study_design_scores_gemma":[0.00007725886,0.00013513445,0.002104727,0.000030730745,0.00001768595,0.0005288004,0.00041403467,0.056029465,0.014701494,0.86123264,0.0646819,0.000046150442],"about_ca_topic_score_codex":0.0030479233,"about_ca_topic_score_gemma":0.0023753638,"teacher_disagreement_score":0.0062547154,"about_ca_system_score_codex":0.00067467446,"about_ca_system_score_gemma":0.00042215097,"threshold_uncertainty_score":0.020924091},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03308635,0.00006999881,0.95976806,0.000088203786,0.000045050387,0.00013705874,0.00003509237,0.0039396575,0.0028305203],"genre_scores_gemma":[0.6844066,0.000055405475,0.3102955,0.000119995704,0.000019826964,0.00030823675,0.00012520443,0.00013959708,0.0045296294],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99969983,0.000047283036,0.000027028043,0.00008407932,0.00011779228,0.000024032568],"domain_scores_gemma":[0.99934834,0.00021453243,0.00008178212,0.00010944397,0.00019748804,0.000048379636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000693132,0.0005093839,0.00054700725,0.00040135725,0.00035302457,0.000487809,0.0013756754,0.00070195895,0.0029529792],"category_scores_gemma":[0.0013707725,0.00036739407,0.0003762991,0.0001902371,0.0005503734,0.0005273075,0.0008569755,0.0005299228,0.00069095194],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020305191,0.00023096318,0.0015825437,0.000099837765,0.0000570479,0.00020004253,0.00013996847,0.7368355,0.044530723,0.00541876,0.0018843845,0.20881717],"study_design_scores_gemma":[0.0000086694445,0.000028885639,0.00007498762,0.0000028158881,0.0000029927498,0.000011888607,0.000001835051,0.9959709,0.0028939256,0.0004878126,0.0005113241,0.000003969468],"about_ca_topic_score_codex":0.0023024795,"about_ca_topic_score_gemma":0.002171714,"teacher_disagreement_score":0.0029529792,"about_ca_system_score_codex":0.0005138928,"about_ca_system_score_gemma":0.0005836285,"threshold_uncertainty_score":0.009878755},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013555398,0.000064655644,0.9830626,0.000049891685,0.000036022546,0.00007963026,0.00012684775,0.0022550786,0.00076991844],"genre_scores_gemma":[0.20609845,0.00008433565,0.7898672,0.00008681332,0.00003280773,0.00021988386,0.0007328934,0.0012674939,0.0016100728],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995741,0.00009310302,0.000028491224,0.00008377567,0.00018306491,0.000037472015],"domain_scores_gemma":[0.9990175,0.0004080642,0.00007233348,0.00028091334,0.00018342053,0.000037802445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084317406,0.00051379605,0.00066361733,0.0012326081,0.0003222131,0.0008675011,0.0013831478,0.0008545907,0.0032206958],"category_scores_gemma":[0.0026417559,0.0003291342,0.00073251734,0.000703798,0.0005746854,0.00064880936,0.0012674356,0.000774496,0.0013296499],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003522218,0.0001612006,0.002204337,0.00047789045,0.000053638738,0.0002231391,0.0004448019,0.15947026,0.1565987,0.03185389,0.009552087,0.63860786],"study_design_scores_gemma":[0.000057298577,0.000084417734,0.0005798458,0.000028350843,0.000012399299,0.00017200141,0.00005174881,0.93526363,0.03971449,0.015120356,0.008891681,0.000023737224],"about_ca_topic_score_codex":0.0006681765,"about_ca_topic_score_gemma":0.00090509455,"teacher_disagreement_score":0.0032206958,"about_ca_system_score_codex":0.0003473074,"about_ca_system_score_gemma":0.0004851052,"threshold_uncertainty_score":0.010774314},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05589409,0.00020913855,0.93145525,0.0001981376,0.00009389414,0.00006773954,0.00041159522,0.0008320849,0.010837954],"genre_scores_gemma":[0.72458124,0.00041448337,0.26691166,0.00007356674,0.00007565743,0.00011976757,0.0013611178,0.0005092965,0.0059531494],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995363,0.0000994399,0.000022069713,0.00012424405,0.00014178986,0.00007618558],"domain_scores_gemma":[0.99877363,0.0004681409,0.00014274685,0.00031747704,0.00019368136,0.00010430843],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035193097,0.00068402564,0.000688972,0.0013787951,0.00046835103,0.0023830486,0.0013658206,0.0012133394,0.008003403],"category_scores_gemma":[0.0035206124,0.0005570552,0.0008450187,0.0014003043,0.0006874911,0.003971102,0.0024747022,0.0017092753,0.00090001605],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004890074,0.0001447669,0.0013087827,0.00047731458,0.000069337875,0.0006827342,0.0012327058,0.13582572,0.019782005,0.6069119,0.007942299,0.2251334],"study_design_scores_gemma":[0.000046732013,0.00008740888,0.0004368644,0.00010042428,0.00004503089,0.00029423286,0.0003832047,0.63167435,0.0086060995,0.34672034,0.011575108,0.00003024027],"about_ca_topic_score_codex":0.0013108099,"about_ca_topic_score_gemma":0.0022151668,"teacher_disagreement_score":0.008003403,"about_ca_system_score_codex":0.0003969769,"about_ca_system_score_gemma":0.00040309536,"threshold_uncertainty_score":0.026774108},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20597097,0.00027005942,0.70618397,0.0007031155,0.0002148146,0.00025709183,0.0021097448,0.0021271375,0.08216315],"genre_scores_gemma":[0.5862228,0.00054038723,0.3577056,0.000270611,0.000073744886,0.00016135268,0.0037062943,0.0007758561,0.05054339],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996946,0.00003198514,0.000016372343,0.00010722414,0.000104813036,0.00004497994],"domain_scores_gemma":[0.9997402,0.000040612078,0.000047780402,0.00007258275,0.000049344668,0.000049437036],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013468855,0.0007777076,0.00060331076,0.0009711666,0.0006833454,0.0010888444,0.0012004308,0.0011241549,0.013943952],"category_scores_gemma":[0.0004930689,0.00037465824,0.00061366806,0.0012266412,0.0009055277,0.0017387244,0.0018570935,0.0011266909,0.0034438497],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00054463634,0.0002964486,0.0023096628,0.00044679537,0.00010272422,0.0026251785,0.0006381319,0.087568134,0.08138659,0.57856005,0.018908868,0.22661278],"study_design_scores_gemma":[0.00015279041,0.00049819896,0.0044695465,0.00013345949,0.00016099193,0.005560295,0.0010289475,0.30043924,0.074129395,0.46236262,0.1509252,0.0001392355],"about_ca_topic_score_codex":0.00086826883,"about_ca_topic_score_gemma":0.000986713,"teacher_disagreement_score":0.013943952,"about_ca_system_score_codex":0.00036030618,"about_ca_system_score_gemma":0.0003843126,"threshold_uncertainty_score":0.04664713},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10317883,0.0018237414,0.8396444,0.0003427521,0.00058674585,0.0002589013,0.00053238025,0.0012959469,0.05233629],"genre_scores_gemma":[0.57956004,0.0010664045,0.39718047,0.00011916307,0.00016547374,0.00024028735,0.0010069303,0.0003537595,0.02030751],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99887127,0.00026291612,0.00008699755,0.00025020752,0.0004004097,0.0001280359],"domain_scores_gemma":[0.99861944,0.0004312663,0.00015096975,0.00042463804,0.00024065678,0.00013301271],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056568126,0.00082140975,0.00096606737,0.001402336,0.001089416,0.0015470984,0.0014281212,0.001193895,0.0095799],"category_scores_gemma":[0.005544327,0.0007257423,0.0006722638,0.0014408105,0.0011350223,0.0021058826,0.0045662005,0.0010397607,0.0043951417],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013543833,0.00016420025,0.004207214,0.0007629942,0.00012702093,0.0016049539,0.0014655784,0.06196207,0.03240588,0.3569246,0.026226897,0.5127942],"study_design_scores_gemma":[0.00024013342,0.00073551637,0.00288828,0.0003433761,0.00013969652,0.0061333347,0.0012542019,0.31719342,0.05732161,0.43748322,0.1761446,0.00012253146],"about_ca_topic_score_codex":0.0007446344,"about_ca_topic_score_gemma":0.0005876357,"teacher_disagreement_score":0.0095799,"about_ca_system_score_codex":0.0004138667,"about_ca_system_score_gemma":0.0003876954,"threshold_uncertainty_score":0.032047927},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4331062,0.0018830386,0.44692305,0.001267476,0.0003859879,0.00017525589,0.00040344428,0.0006059585,0.11524951],"genre_scores_gemma":[0.8665272,0.0024670642,0.06401463,0.00026090577,0.00030165,0.00012811179,0.0006248099,0.00072096015,0.06495474],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998054,0.000051791656,0.0000074287414,0.000044178327,0.000061001974,0.000030231622],"domain_scores_gemma":[0.9994185,0.00026306466,0.00009347266,0.000096380776,0.000053344003,0.000075233846],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023752314,0.00068380014,0.0007680038,0.0013215119,0.0008042656,0.0011530663,0.0010784043,0.0007817534,0.007605049],"category_scores_gemma":[0.0014796575,0.00048336343,0.0005818734,0.0014174364,0.0019089045,0.0022148115,0.0020273197,0.0018306664,0.000960157],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008344211,0.000059951915,0.0004141265,0.00013295183,0.000014977435,0.0001866682,0.00048305487,0.066973306,0.005087297,0.8924416,0.0047237775,0.029398788],"study_design_scores_gemma":[0.000019242221,0.00005055263,0.00055854267,0.000024843028,0.000010136089,0.0001435024,0.00028699648,0.108911686,0.001204974,0.8824099,0.006363422,0.000016265149],"about_ca_topic_score_codex":0.0017194417,"about_ca_topic_score_gemma":0.0019595965,"teacher_disagreement_score":0.007605049,"about_ca_system_score_codex":0.00066089985,"about_ca_system_score_gemma":0.00020470942,"threshold_uncertainty_score":0.025441408},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1583162,0.00087434053,0.7548927,0.0006714138,0.00019469073,0.00021834271,0.0007692535,0.002053811,0.0820092],"genre_scores_gemma":[0.82594013,0.00039340122,0.15204225,0.00012298797,0.000037888647,0.000099386336,0.0008124555,0.000701145,0.019850327],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997602,0.000049461134,0.00000767019,0.000048060956,0.000093391696,0.00004125804],"domain_scores_gemma":[0.99960417,0.00019031829,0.000024690005,0.00007542716,0.000046195106,0.00005916936],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023130303,0.0005181847,0.0005789511,0.0004498462,0.0006217764,0.0011506524,0.0007124171,0.0006601775,0.009681941],"category_scores_gemma":[0.0015333637,0.0003517505,0.0005582468,0.00039906605,0.0008946924,0.001020077,0.0033832737,0.0007283669,0.0013163439],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014631237,0.00023483501,0.004010137,0.0006635589,0.000117697724,0.0029107293,0.0014091552,0.5246444,0.047039587,0.1097332,0.025505459,0.28226817],"study_design_scores_gemma":[0.000039567993,0.00011120234,0.0005665457,0.0000892582,0.000021081023,0.00065593433,0.000289019,0.9365929,0.008949516,0.033146877,0.019516192,0.000021987753],"about_ca_topic_score_codex":0.0015487316,"about_ca_topic_score_gemma":0.0020528573,"teacher_disagreement_score":0.009681941,"about_ca_system_score_codex":0.0002609551,"about_ca_system_score_gemma":0.00041240302,"threshold_uncertainty_score":0.032389343},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29043296,0.001118459,0.67806584,0.00051206764,0.00011831475,0.00016002961,0.0014267814,0.0007750917,0.027390495],"genre_scores_gemma":[0.7695144,0.00062612846,0.21284671,0.00009496597,0.000073076386,0.0001769811,0.0022663248,0.0005124965,0.01388887],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99940467,0.00012434741,0.000031874235,0.000092925635,0.000245627,0.00010041603],"domain_scores_gemma":[0.9985844,0.00067619316,0.0001393575,0.00027750648,0.00017234514,0.0001501068],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003904851,0.0007904567,0.0011282337,0.00096923095,0.00071568583,0.0012834931,0.0010124597,0.0011125279,0.008240504],"category_scores_gemma":[0.0058541717,0.00065888424,0.00064587296,0.000768917,0.0007781123,0.0017905682,0.0029363197,0.0010826678,0.0014282207],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00168884,0.00024843749,0.006244971,0.00104947,0.00017545497,0.00091750186,0.00093682023,0.38769478,0.04370597,0.1584438,0.03148077,0.36741322],"study_design_scores_gemma":[0.000089221234,0.00041022277,0.0047720014,0.00013525183,0.000051985087,0.0012126381,0.00051666325,0.7985623,0.02075212,0.15400618,0.019454883,0.000036488942],"about_ca_topic_score_codex":0.0010818692,"about_ca_topic_score_gemma":0.001095405,"teacher_disagreement_score":0.008240504,"about_ca_system_score_codex":0.00047809872,"about_ca_system_score_gemma":0.00036045891,"threshold_uncertainty_score":0.027567208},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36730137,0.00028154216,0.61356956,0.0013089861,0.00005742449,0.00035312588,0.00489319,0.0013923127,0.010842422],"genre_scores_gemma":[0.54023606,0.0002934559,0.44166964,0.00038112325,0.00006236006,0.0003471825,0.007976567,0.0005125547,0.00852114],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99940276,0.00013752286,0.000024147424,0.00022499428,0.00011142625,0.00009912771],"domain_scores_gemma":[0.9983016,0.0010165655,0.00017817772,0.00021752257,0.00014494342,0.00014114658],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004461531,0.0007810471,0.00096376357,0.0009537852,0.0011066704,0.0011902404,0.0014159435,0.0015020417,0.007557044],"category_scores_gemma":[0.0030229276,0.0007176224,0.0010808258,0.0017763806,0.0010042695,0.0028753963,0.0015204172,0.0011109757,0.00094518537],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010487598,0.0006032658,0.00820796,0.0013116709,0.0003472318,0.0018419495,0.0014547687,0.52331465,0.04689971,0.20557202,0.035952725,0.17344531],"study_design_scores_gemma":[0.00014077444,0.00015459573,0.0022834516,0.0000875186,0.00007250733,0.00046435284,0.0006670169,0.69483757,0.009496066,0.28238407,0.009362414,0.000049655806],"about_ca_topic_score_codex":0.0025496304,"about_ca_topic_score_gemma":0.0037393118,"teacher_disagreement_score":0.007557044,"about_ca_system_score_codex":0.000717804,"about_ca_system_score_gemma":0.0007694022,"threshold_uncertainty_score":0.025280774},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026870897,0.00041463756,0.9628628,0.00027911403,0.000084232626,0.00015574123,0.00025717213,0.0027707962,0.0063045197],"genre_scores_gemma":[0.09737653,0.00021009236,0.8978401,0.00010004042,0.000040910716,0.00015725155,0.0010919299,0.0005726923,0.0026104099],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904937,0.00013358814,0.00008067971,0.00023512534,0.0002988005,0.00020252164],"domain_scores_gemma":[0.99768686,0.0012669619,0.00021689368,0.00043915925,0.00026894337,0.00012121986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007913781,0.0016041817,0.0014528863,0.001139458,0.0010144834,0.0017990557,0.0021507782,0.0013997016,0.009179501],"category_scores_gemma":[0.004228559,0.001130493,0.0015341612,0.0014944368,0.0012023407,0.0023887258,0.0021304819,0.0022049756,0.002553979],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00063820183,0.00037275502,0.0015459716,0.000614126,0.000069569614,0.0001400324,0.00026450044,0.42694116,0.013124311,0.039816886,0.01852298,0.4979495],"study_design_scores_gemma":[0.0001621745,0.000082234175,0.0003059362,0.000036695037,0.00002372807,0.0000720432,0.00009296961,0.9351544,0.005333982,0.05403306,0.004681137,0.000021694012],"about_ca_topic_score_codex":0.004988817,"about_ca_topic_score_gemma":0.010442297,"teacher_disagreement_score":0.009179501,"about_ca_system_score_codex":0.0014248067,"about_ca_system_score_gemma":0.0019094605,"threshold_uncertainty_score":0.030708492},"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":"editorial","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034066443,0.0020593381,0.046616293,0.16560932,0.74704105,0.00007550571,0.0012632456,0.0024829938,0.03144566],"genre_scores_gemma":[0.21101844,0.010329498,0.11452795,0.19662325,0.14639442,0.0006429792,0.004753015,0.012041817,0.30366865],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.992335,0.0015517666,0.00096112903,0.0010771523,0.003479525,0.0005953691],"domain_scores_gemma":[0.9821911,0.006039771,0.0009714486,0.0020183206,0.008132396,0.00064703304],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0049920944,0.0018944904,0.0014630578,0.0021025485,0.005063026,0.0033275306,0.0035810715,0.005156533,0.032378845],"category_scores_gemma":[0.048866674,0.0011983721,0.001502865,0.0016250042,0.0056398567,0.0059848954,0.003318456,0.00959824,0.022385053],"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.00011539055,0.000020186526,0.0001434583,0.00014076906,0.000018939087,0.00029979134,0.00014423998,0.0004272591,0.0005457785,0.03774886,0.9494431,0.01095231],"study_design_scores_gemma":[0.00007841832,0.00008365262,0.00060543284,0.00037673418,0.0000822383,0.0009945224,0.00021388273,0.004297006,0.0057095694,0.060143493,0.9272723,0.00014273227],"about_ca_topic_score_codex":0.004922053,"about_ca_topic_score_gemma":0.003291726,"teacher_disagreement_score":0.032378845,"about_ca_system_score_codex":0.0029723886,"about_ca_system_score_gemma":0.0026378664,"threshold_uncertainty_score":0.10831803},"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":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5257742,0.0024508196,0.27074027,0.0022007264,0.00045145358,0.00012914806,0.0018487596,0.0022817152,0.19412296],"genre_scores_gemma":[0.8859455,0.0010941968,0.091610596,0.00088071276,0.00018498703,0.00010100854,0.002191098,0.00063548406,0.017356351],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991239,0.00019750546,0.00003493517,0.0002072099,0.00021306772,0.00022343236],"domain_scores_gemma":[0.9975151,0.0009756773,0.00020761504,0.0007048757,0.00028719183,0.00030962322],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009948532,0.0007291811,0.00067550223,0.001259681,0.0009771353,0.0011725209,0.0015225374,0.00075136684,0.017014146],"category_scores_gemma":[0.005812168,0.00044774756,0.0007659406,0.0012211365,0.00094954454,0.0025246032,0.003015557,0.0013503027,0.0037234612],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005723292,0.00017095078,0.003457484,0.0004918314,0.000097022945,0.0004564256,0.0006094354,0.065056205,0.021997342,0.74478394,0.030877085,0.13142994],"study_design_scores_gemma":[0.000082527935,0.00027417304,0.003001182,0.00016676397,0.00012211526,0.0009875394,0.00043865904,0.2450664,0.018465966,0.6859251,0.04541769,0.000051835374],"about_ca_topic_score_codex":0.0011218425,"about_ca_topic_score_gemma":0.001653377,"teacher_disagreement_score":0.017014146,"about_ca_system_score_codex":0.0008002395,"about_ca_system_score_gemma":0.00049270125,"threshold_uncertainty_score":0.056917965},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26981306,0.00041931713,0.7177936,0.0006576251,0.000087846725,0.00030902002,0.0009496969,0.0009824712,0.008987431],"genre_scores_gemma":[0.8096429,0.00014196614,0.18672493,0.00010939641,0.000045021137,0.00013224475,0.0012418394,0.00014714691,0.001814654],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974606,0.0005951921,0.00017437195,0.00087419676,0.00052431924,0.00037133452],"domain_scores_gemma":[0.9925068,0.0039478582,0.0011433866,0.0015529295,0.00047632732,0.00037259678],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001294106,0.0008317604,0.0009560784,0.0010346974,0.0009041448,0.0023571867,0.0018861925,0.002030929,0.004376615],"category_scores_gemma":[0.010746896,0.0008887478,0.0020658318,0.0014555695,0.0016184973,0.0075386167,0.003232162,0.002317847,0.00055629323],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016834891,0.00054962124,0.005853339,0.0010306397,0.00022487123,0.0018391326,0.0022331956,0.2897806,0.047298525,0.37065476,0.007308583,0.27154326],"study_design_scores_gemma":[0.00013009134,0.000394197,0.0012578313,0.00013587844,0.000109867,0.0009990182,0.0008740995,0.4934426,0.022810252,0.4728343,0.006928634,0.00008320956],"about_ca_topic_score_codex":0.0014108529,"about_ca_topic_score_gemma":0.001469035,"teacher_disagreement_score":0.004376615,"about_ca_system_score_codex":0.0010458805,"about_ca_system_score_gemma":0.0008713947,"threshold_uncertainty_score":0.014641225},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13981453,0.00012336679,0.84052193,0.00031070213,0.00008603467,0.00023146963,0.00070536614,0.00057345093,0.017633226],"genre_scores_gemma":[0.4134172,0.00024210873,0.57679904,0.00011945797,0.000025656735,0.00014946863,0.0016399607,0.00016630108,0.00744078],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99959344,0.00006570013,0.000015261967,0.000112646965,0.00017838855,0.0000346181],"domain_scores_gemma":[0.99935955,0.0001442166,0.000062988904,0.00012850422,0.00019178854,0.00011289266],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021553165,0.00042838525,0.0006035831,0.0018209751,0.00097265095,0.0008360369,0.0015165702,0.0009377238,0.0050742947],"category_scores_gemma":[0.0016152913,0.00041269875,0.00065283146,0.0012664124,0.00064006314,0.00093805214,0.0015778976,0.0009898933,0.0009035479],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002958038,0.00039869506,0.008225432,0.0005134802,0.000106781124,0.0018279845,0.0011846249,0.13137883,0.081290506,0.46127915,0.011134752,0.30236396],"study_design_scores_gemma":[0.00006898764,0.0002623472,0.0043686004,0.00007598953,0.00007209063,0.0013860805,0.0008628345,0.679146,0.020847946,0.26102236,0.03180221,0.00008452235],"about_ca_topic_score_codex":0.0033342137,"about_ca_topic_score_gemma":0.0038704409,"teacher_disagreement_score":0.0050742947,"about_ca_system_score_codex":0.00036384183,"about_ca_system_score_gemma":0.00064915046,"threshold_uncertainty_score":0.016975224},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028489882,0.00001394492,0.9945787,0.00002251984,0.00001635961,0.000042022515,0.00003657301,0.00078468764,0.0016562364],"genre_scores_gemma":[0.15441227,0.000059730224,0.8391619,0.000075968994,0.00001741672,0.00020187406,0.00039703076,0.000932305,0.0047414927],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985436,0.00017813392,0.00007043529,0.00018047898,0.0009362783,0.000090931935],"domain_scores_gemma":[0.9990221,0.00021982036,0.000068743866,0.00040772336,0.00022575785,0.00005584047],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008213041,0.00056278956,0.00052708964,0.00092574157,0.00055812154,0.0017029853,0.0018919358,0.00093976874,0.0045854654],"category_scores_gemma":[0.0046085874,0.00057509553,0.0009332951,0.0006638925,0.001219716,0.0013885485,0.0025104568,0.0016903752,0.0022591387],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014775782,0.00010403133,0.0011722593,0.00023302724,0.00004019714,0.00038423596,0.0006569933,0.47574273,0.06275388,0.17822848,0.0056473403,0.27488905],"study_design_scores_gemma":[0.000017761018,0.000060963237,0.00023547003,0.000019982243,0.0000072989096,0.00017904922,0.00006955637,0.9161606,0.019996777,0.046250932,0.016975356,0.000026358859],"about_ca_topic_score_codex":0.0011222899,"about_ca_topic_score_gemma":0.0015191552,"teacher_disagreement_score":0.0045854654,"about_ca_system_score_codex":0.0004820224,"about_ca_system_score_gemma":0.0006134283,"threshold_uncertainty_score":0.015339971},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05354944,0.005789731,0.77309185,0.001211593,0.000353125,0.0001576743,0.0016758415,0.00086672546,0.16330402],"genre_scores_gemma":[0.6062097,0.009060143,0.3132573,0.000829877,0.00094115204,0.00045602658,0.004179252,0.0009577328,0.06410891],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99950767,0.0000863322,0.000028675393,0.00014425557,0.00018278044,0.000050202583],"domain_scores_gemma":[0.99867284,0.00056865736,0.00018950319,0.00020864207,0.0002354841,0.00012481704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003672617,0.0006911936,0.0004033083,0.0015514599,0.0005072349,0.0013354929,0.0006740392,0.0006097023,0.026748389],"category_scores_gemma":[0.002313391,0.00038926935,0.0007797141,0.0013348534,0.001302888,0.0031055193,0.002091587,0.0024822839,0.0038139122],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002385477,0.000016708324,0.00019663003,0.000105183346,0.0000070434853,0.00006914149,0.00013924167,0.006812807,0.0017501976,0.9649536,0.004246917,0.021678664],"study_design_scores_gemma":[0.0000067618726,0.00005519614,0.00049994054,0.000055881243,0.000010657598,0.00025088174,0.000110478584,0.01854846,0.0015994787,0.9379686,0.04088047,0.000013070222],"about_ca_topic_score_codex":0.00062910054,"about_ca_topic_score_gemma":0.000616971,"teacher_disagreement_score":0.026748389,"about_ca_system_score_codex":0.0007591911,"about_ca_system_score_gemma":0.00038020936,"threshold_uncertainty_score":0.08948225},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01810106,0.00048064097,0.96323305,0.00029812043,0.000081316495,0.00029129224,0.0003827026,0.0059864786,0.011145309],"genre_scores_gemma":[0.09080342,0.0003700938,0.8983141,0.000105352774,0.000053396296,0.00031817454,0.0017203125,0.0008615466,0.007453601],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99773186,0.0002534744,0.00017251098,0.0005905673,0.00092981657,0.00032174692],"domain_scores_gemma":[0.997509,0.0011425086,0.00018211927,0.0006767149,0.00038955844,0.00009997773],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007965041,0.0020635712,0.0015510375,0.0016030984,0.0016708276,0.0023011337,0.0041400366,0.001490977,0.018560074],"category_scores_gemma":[0.0043877554,0.0011509467,0.0017232167,0.003066902,0.001100448,0.0050714836,0.0045332233,0.0021668784,0.0061156126],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046020473,0.0004397714,0.0012163687,0.00091354636,0.00009147603,0.00025698176,0.0006137008,0.09735707,0.018895917,0.099350154,0.028694939,0.7517098],"study_design_scores_gemma":[0.00041110624,0.00023016543,0.0005560581,0.00007497189,0.000073012714,0.00045228068,0.00058321614,0.71537673,0.027360162,0.21013376,0.04467562,0.00007289173],"about_ca_topic_score_codex":0.00204189,"about_ca_topic_score_gemma":0.0036259657,"teacher_disagreement_score":0.018560074,"about_ca_system_score_codex":0.001615625,"about_ca_system_score_gemma":0.0016708759,"threshold_uncertainty_score":0.06208968},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038630996,0.002634366,0.9457058,0.001168124,0.00006302017,0.00006742777,0.0005283472,0.00020855178,0.010993314],"genre_scores_gemma":[0.38511932,0.0033878093,0.59874123,0.0002995523,0.00027309766,0.00038821925,0.0020383345,0.00036208399,0.009390371],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99854434,0.0005870018,0.000077145836,0.00034226876,0.0003145253,0.000134734],"domain_scores_gemma":[0.9954846,0.0034902892,0.000309665,0.0002280939,0.00027296663,0.00021445428],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021900043,0.0009919731,0.0016438977,0.0016925088,0.0010398112,0.0018145241,0.0020845097,0.0022120157,0.0046846806],"category_scores_gemma":[0.0123442765,0.00082998886,0.0013401678,0.002140458,0.0017243662,0.004534224,0.0030712965,0.0019288522,0.00072449393],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013941475,0.00007641652,0.0010421638,0.00053773564,0.000104428786,0.00021769508,0.00031475304,0.37985018,0.0018678731,0.54641455,0.007827179,0.06160766],"study_design_scores_gemma":[0.000031387768,0.000048152404,0.00030994666,0.000072872695,0.000017894617,0.00016044741,0.000094154646,0.45998782,0.0008117362,0.5321789,0.006269355,0.000017392838],"about_ca_topic_score_codex":0.0015286854,"about_ca_topic_score_gemma":0.0013535479,"teacher_disagreement_score":0.0046846806,"about_ca_system_score_codex":0.0013270342,"about_ca_system_score_gemma":0.0007582454,"threshold_uncertainty_score":0.01567185},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04872577,0.00031175127,0.94767565,0.00053527096,0.000035480192,0.000054628574,0.00026403042,0.00079815177,0.0015993138],"genre_scores_gemma":[0.66468346,0.00040415616,0.32780504,0.0003356258,0.00011337514,0.00016541893,0.0010550688,0.00022773948,0.0052101887],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99694854,0.00085091224,0.00018496405,0.00055490865,0.0010750124,0.00038581598],"domain_scores_gemma":[0.98976594,0.0046348968,0.0009695206,0.0035186233,0.0007176167,0.00039340943],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027269502,0.0009964838,0.0018816583,0.0009795164,0.0008454915,0.0029693,0.0025649641,0.0016488433,0.00196645],"category_scores_gemma":[0.019118765,0.0008067199,0.0012491453,0.0015394739,0.0022012356,0.006930258,0.0051410226,0.0036237855,0.0007727359],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017922764,0.00016783662,0.0051505296,0.00021840664,0.00015686896,0.0002295281,0.0007569294,0.5990727,0.013022056,0.25911906,0.0061180126,0.11419572],"study_design_scores_gemma":[0.000027719969,0.000065049346,0.000409751,0.000015145288,0.00001069061,0.00007129238,0.00005399985,0.92001164,0.0032967904,0.07483501,0.0011848569,0.000018055802],"about_ca_topic_score_codex":0.0032093327,"about_ca_topic_score_gemma":0.0026296473,"teacher_disagreement_score":0.0035519658,"about_ca_system_score_codex":0.0035519658,"about_ca_system_score_gemma":0.0013402336,"threshold_uncertainty_score":0.02577138},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18646184,0.021983307,0.40328613,0.008451486,0.0017551099,0.00025977584,0.0037911208,0.0030766411,0.3709346],"genre_scores_gemma":[0.71916544,0.013942594,0.20909306,0.0021977,0.0026874412,0.0006445692,0.004451826,0.0027168181,0.045100547],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975931,0.00058730843,0.00009382231,0.00048050057,0.00077139854,0.00047377753],"domain_scores_gemma":[0.9843174,0.011985877,0.00051044306,0.0014751338,0.0009761004,0.0007350471],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003381449,0.0029223117,0.002288979,0.004494749,0.001473783,0.004031526,0.0060114544,0.001939483,0.0225513],"category_scores_gemma":[0.018649476,0.0011653046,0.0020899733,0.004488711,0.0026751894,0.008382324,0.0043595624,0.007585184,0.00562231],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001582534,0.0003960114,0.002676494,0.0014795177,0.0002640213,0.00040942777,0.00070444203,0.091213115,0.02052145,0.67457324,0.053807426,0.15237232],"study_design_scores_gemma":[0.00010089179,0.00027055357,0.0031413105,0.0003325312,0.00034074305,0.00064866664,0.0003121663,0.24899098,0.008623546,0.7135399,0.023598026,0.00010053401],"about_ca_topic_score_codex":0.0020150593,"about_ca_topic_score_gemma":0.0031748265,"teacher_disagreement_score":0.0225513,"about_ca_system_score_codex":0.0033878637,"about_ca_system_score_gemma":0.0011652496,"threshold_uncertainty_score":0.0754416},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6323227,0.0010470658,0.31001392,0.0025591075,0.00024811501,0.00021866067,0.002264119,0.0015115698,0.04981459],"genre_scores_gemma":[0.83023196,0.00055554585,0.15376557,0.00029703855,0.00009140967,0.00015751486,0.0020842974,0.0005941561,0.012222469],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971506,0.00068405655,0.00014741904,0.0006137617,0.0009109104,0.0004932909],"domain_scores_gemma":[0.9827627,0.011689585,0.001642816,0.0017866499,0.0013390593,0.0007791266],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016800979,0.0012578813,0.0010856816,0.0014972357,0.0016023824,0.004073665,0.0038355556,0.0024654698,0.009560257],"category_scores_gemma":[0.017229192,0.0011999907,0.0009401181,0.0019833662,0.0016364254,0.005294507,0.0025145414,0.0017604001,0.0015675878],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013893851,0.0003917997,0.021611854,0.0012072638,0.00031855688,0.0013836741,0.0010142387,0.41863796,0.043576088,0.39428216,0.028600784,0.08758617],"study_design_scores_gemma":[0.00007258175,0.00011674093,0.0028226166,0.00008066443,0.00010563495,0.0008060445,0.00029118176,0.74446064,0.016723093,0.229161,0.0053037778,0.000055964425],"about_ca_topic_score_codex":0.002938378,"about_ca_topic_score_gemma":0.005852124,"teacher_disagreement_score":0.009560257,"about_ca_system_score_codex":0.002158112,"about_ca_system_score_gemma":0.0012366122,"threshold_uncertainty_score":0.031982243},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.059882358,0.00072479766,0.93212575,0.0006249914,0.000044127595,0.00009011108,0.00040731436,0.0014775721,0.004622822],"genre_scores_gemma":[0.3916422,0.00065813167,0.5990058,0.00025111804,0.0000832911,0.00021472444,0.0025596467,0.0005745946,0.005010435],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982535,0.0005291018,0.00008640638,0.00048102206,0.00044593017,0.0002040056],"domain_scores_gemma":[0.99751234,0.0012230474,0.00036287596,0.0005901263,0.0001518734,0.00015974227],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001343328,0.0008591429,0.0013485574,0.0011744591,0.00071879727,0.0016917187,0.0017010203,0.0017493981,0.0060651805],"category_scores_gemma":[0.0071438747,0.0007666328,0.0010815952,0.001893532,0.0008991671,0.0037388445,0.0027005854,0.001935158,0.0016390792],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007530729,0.0002511228,0.003721869,0.00051305664,0.00009588272,0.00039235543,0.0005970873,0.41112292,0.015926588,0.2517072,0.022631649,0.2922872],"study_design_scores_gemma":[0.0000872984,0.00012754039,0.00061021256,0.00006320828,0.0000217043,0.00040243642,0.00028294034,0.8389213,0.008161853,0.13896182,0.012334942,0.000024754205],"about_ca_topic_score_codex":0.0013502307,"about_ca_topic_score_gemma":0.0020716575,"teacher_disagreement_score":0.0060651805,"about_ca_system_score_codex":0.00096184044,"about_ca_system_score_gemma":0.000532765,"threshold_uncertainty_score":0.020290077},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10490856,0.00041148713,0.88081676,0.00022028638,0.00008955018,0.00012207578,0.00055547716,0.0008013791,0.012074463],"genre_scores_gemma":[0.5554221,0.00043603784,0.4376551,0.000049587405,0.000047569465,0.00010885655,0.0010630807,0.0004062698,0.0048114597],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99954826,0.000057449215,0.000026566919,0.00012866118,0.00016822865,0.000070805196],"domain_scores_gemma":[0.9993394,0.00022635501,0.00012715858,0.0001379242,0.00010255092,0.00006658062],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022937589,0.0005004503,0.0006103462,0.0009586812,0.0005657608,0.0014038213,0.0009216079,0.0006108487,0.0038746288],"category_scores_gemma":[0.0025286241,0.00050920894,0.0005746533,0.0008594045,0.0013003065,0.0020413557,0.002360778,0.00089505425,0.00089315884],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00077543024,0.00012422298,0.005081297,0.0006322172,0.00009285416,0.001132158,0.0010796242,0.16909048,0.09420551,0.359853,0.009949901,0.35798332],"study_design_scores_gemma":[0.0001157528,0.00028141684,0.0023943014,0.000117007185,0.000051168645,0.0013031248,0.0004980672,0.64059776,0.06910501,0.235257,0.050177176,0.00010216981],"about_ca_topic_score_codex":0.0017500703,"about_ca_topic_score_gemma":0.0009657085,"teacher_disagreement_score":0.0038746288,"about_ca_system_score_codex":0.0004263572,"about_ca_system_score_gemma":0.0006789892,"threshold_uncertainty_score":0.012961924},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31997842,0.002349642,0.49081984,0.000552982,0.00065817323,0.00005422377,0.00042630572,0.00027615525,0.18488415],"genre_scores_gemma":[0.88091093,0.0014954259,0.08365129,0.00015997728,0.0003244869,0.000046433397,0.0005248315,0.00028593082,0.0326007],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997402,0.000061908024,0.000014441874,0.000043546806,0.000100234145,0.000039673723],"domain_scores_gemma":[0.9995185,0.00024018736,0.00006446086,0.000079976184,0.00004845428,0.00004835383],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002737509,0.00033615116,0.000423565,0.00068478874,0.0005033687,0.0014454185,0.0006322438,0.00037259827,0.005164036],"category_scores_gemma":[0.001855838,0.00038531443,0.00040795075,0.0006308961,0.0013406397,0.0015104063,0.0011703956,0.0015196472,0.00068589323],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010534539,0.000020901369,0.0004989729,0.00008881942,0.0000068004256,0.0002163337,0.0002682296,0.012183229,0.004586151,0.93959045,0.003193113,0.039241586],"study_design_scores_gemma":[0.000023319553,0.00012066942,0.0017263048,0.000064619635,0.000013920413,0.0008281243,0.00036745495,0.14606974,0.0030212044,0.82232934,0.025400048,0.000035256435],"about_ca_topic_score_codex":0.0005263308,"about_ca_topic_score_gemma":0.0004776184,"teacher_disagreement_score":0.005164036,"about_ca_system_score_codex":0.00031059215,"about_ca_system_score_gemma":0.00019074458,"threshold_uncertainty_score":0.017275393},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03297734,0.0018059836,0.9544106,0.0004527046,0.0004056513,0.000108384076,0.000046006022,0.000120822195,0.009672494],"genre_scores_gemma":[0.7269872,0.0028282015,0.24643588,0.00044388112,0.00068103254,0.00041071733,0.00026009418,0.00075516186,0.021197842],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992157,0.000344649,0.000025457708,0.000063901934,0.00028040455,0.00006979122],"domain_scores_gemma":[0.9959428,0.0026971442,0.00035121915,0.00021051234,0.0006478303,0.00015047722],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002437623,0.0009903357,0.0010333728,0.0016827176,0.000850787,0.0013169722,0.0020071885,0.0019854477,0.0060287626],"category_scores_gemma":[0.008965443,0.0005988993,0.001129594,0.0007802999,0.0018670638,0.0018385025,0.0017005889,0.0014055502,0.00050258456],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020087602,0.00009412774,0.00093291653,0.00029040372,0.00009966391,0.00010798397,0.00015420842,0.583769,0.0055715814,0.35779253,0.0023960762,0.048590496],"study_design_scores_gemma":[0.00000870445,0.00003276903,0.00015551843,0.00001849992,0.0000116726615,0.000017637956,0.0000144638525,0.9797778,0.00037420224,0.01857401,0.0010063241,0.000008271057],"about_ca_topic_score_codex":0.002289931,"about_ca_topic_score_gemma":0.0013766328,"teacher_disagreement_score":0.0060287626,"about_ca_system_score_codex":0.0009090408,"about_ca_system_score_gemma":0.0008659451,"threshold_uncertainty_score":0.020168245},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042897448,0.00054929045,0.948486,0.0005906494,0.00003839761,0.00068639126,0.0010650798,0.0010997913,0.0045870394],"genre_scores_gemma":[0.20455076,0.0004398261,0.78606164,0.00019555022,0.00008707996,0.0011280603,0.003003252,0.0005276685,0.0040060915],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99792826,0.00055894064,0.00017000601,0.00062042504,0.00044740416,0.0002749813],"domain_scores_gemma":[0.9942954,0.0041839182,0.00035376646,0.0006268349,0.00032965324,0.00021038814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027723943,0.002558677,0.0034876808,0.0025584092,0.0017620357,0.0026522737,0.0037474905,0.0026225469,0.0068626306],"category_scores_gemma":[0.011600007,0.0020861242,0.0028882488,0.004825106,0.0024427883,0.0077137803,0.004567926,0.0026336499,0.0018482597],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014229285,0.00043047286,0.003780348,0.0011842989,0.00028480333,0.00051268,0.0011235056,0.6005713,0.010431183,0.104135476,0.01875107,0.25737193],"study_design_scores_gemma":[0.00017794147,0.000110395165,0.00055600615,0.00007312662,0.00005032389,0.00018691676,0.00030701637,0.84944147,0.005709216,0.13955966,0.0037822572,0.000045706427],"about_ca_topic_score_codex":0.004402664,"about_ca_topic_score_gemma":0.0038386853,"teacher_disagreement_score":0.0068626306,"about_ca_system_score_codex":0.002030933,"about_ca_system_score_gemma":0.0020268934,"threshold_uncertainty_score":0.022957802},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04727342,0.000702678,0.9470924,0.00040456018,0.000035189598,0.0000762473,0.00028708304,0.0010497737,0.0030786186],"genre_scores_gemma":[0.34416017,0.0007611572,0.6471047,0.00019853644,0.00007922406,0.00021240092,0.0024808005,0.0005336732,0.004469388],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99805486,0.0006092099,0.00010231191,0.0005397558,0.00047363894,0.00022026109],"domain_scores_gemma":[0.9973404,0.0013883093,0.00040014548,0.00053455634,0.00015963965,0.00017685519],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015639651,0.0009245243,0.0014989818,0.001138969,0.0006220426,0.001691288,0.0016214696,0.0017464544,0.0055115004],"category_scores_gemma":[0.0074144807,0.0008238001,0.0010848788,0.0018715684,0.00089959893,0.0038446195,0.002624637,0.0019320586,0.0016506071],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008556956,0.000271519,0.003214988,0.000543072,0.00009997452,0.00046290527,0.0006151488,0.4632381,0.017417254,0.20140219,0.019037902,0.2928412],"study_design_scores_gemma":[0.00009843651,0.00017807067,0.0006571656,0.00007471798,0.000026220672,0.0005206,0.00030987646,0.85526156,0.00911288,0.12107924,0.012653193,0.00002802079],"about_ca_topic_score_codex":0.0011802078,"about_ca_topic_score_gemma":0.0016949542,"teacher_disagreement_score":0.0055115004,"about_ca_system_score_codex":0.0008122822,"about_ca_system_score_gemma":0.00049804925,"threshold_uncertainty_score":0.018437803},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13935272,0.006633318,0.80613387,0.003996799,0.0004117923,0.000571795,0.003816916,0.009991659,0.029091086],"genre_scores_gemma":[0.41381997,0.002300646,0.5640319,0.0006146332,0.00029029342,0.0004259446,0.0068085883,0.001044735,0.010663391],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99700147,0.000529096,0.0002024157,0.0008540472,0.00076096196,0.0006519904],"domain_scores_gemma":[0.9954046,0.0021591506,0.00049561384,0.0013704476,0.00029776606,0.00027242355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015534334,0.0024936006,0.0032808073,0.0023578666,0.0017991969,0.004385696,0.005836382,0.0031349475,0.013828892],"category_scores_gemma":[0.008744876,0.0010641894,0.0019851357,0.0070115263,0.0012847699,0.01060498,0.003614636,0.0029609024,0.00376236],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0021321536,0.0012846666,0.0042031184,0.0013335773,0.00046552793,0.00035510128,0.0006687785,0.49551255,0.005781702,0.07967423,0.05030038,0.35828832],"study_design_scores_gemma":[0.00029464238,0.00011608823,0.0006984298,0.000051869374,0.00011059905,0.00026759857,0.00024212501,0.88105154,0.0015470854,0.10962826,0.005956596,0.00003524439],"about_ca_topic_score_codex":0.0122988,"about_ca_topic_score_gemma":0.018586999,"teacher_disagreement_score":0.013828892,"about_ca_system_score_codex":0.004415038,"about_ca_system_score_gemma":0.0035937103,"threshold_uncertainty_score":0.046262264},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13111487,0.0005477925,0.8516467,0.00040890946,0.00007085402,0.00013346071,0.00037440265,0.00047204786,0.015230867],"genre_scores_gemma":[0.6390791,0.001263811,0.34294537,0.00043544982,0.00016819852,0.00030534726,0.0012781275,0.0005788279,0.013945756],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987525,0.00031217575,0.0000766407,0.00033257375,0.00034432596,0.00018177141],"domain_scores_gemma":[0.9957087,0.0023297395,0.00054495974,0.0006179185,0.0004599826,0.00033872027],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001291858,0.00094281905,0.0008805543,0.0015763013,0.0011487248,0.0014072118,0.001255039,0.0012137723,0.0073604165],"category_scores_gemma":[0.010984125,0.0005066729,0.0009018875,0.0017242201,0.002595486,0.004106457,0.0031111904,0.001659477,0.0015571838],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027284893,0.00009221751,0.002181544,0.00018120828,0.00004271166,0.0002474321,0.00048576843,0.3224508,0.0075105377,0.59873843,0.0037287967,0.06406769],"study_design_scores_gemma":[0.000037512433,0.00017429165,0.00044788697,0.00006360399,0.000018959465,0.00028570648,0.0001663434,0.33531657,0.004091066,0.6529029,0.0064664204,0.000028731023],"about_ca_topic_score_codex":0.0012699751,"about_ca_topic_score_gemma":0.0014130217,"teacher_disagreement_score":0.0073604165,"about_ca_system_score_codex":0.0009777467,"about_ca_system_score_gemma":0.00060727785,"threshold_uncertainty_score":0.024623096},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16665931,0.0004734779,0.7953522,0.00027316264,0.00013915812,0.00022489598,0.0012343026,0.000507505,0.035135955],"genre_scores_gemma":[0.6802719,0.00036794334,0.30263764,0.00015773695,0.000039285558,0.00020579077,0.0019139553,0.00044817384,0.013957546],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999559,0.00011682984,0.000021673535,0.00008197538,0.00014267217,0.00007788165],"domain_scores_gemma":[0.9993636,0.00023139834,0.00006207822,0.00011309302,0.00015911131,0.000070694296],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038024396,0.0006874524,0.0009459051,0.0007183083,0.00052416895,0.0014040613,0.001379622,0.00064691965,0.011580136],"category_scores_gemma":[0.0025558844,0.00045694553,0.0005438513,0.0007849318,0.0008196372,0.0011483796,0.0020215858,0.0013235492,0.0017578639],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012198329,0.00021463163,0.0018388546,0.00051581004,0.000073227675,0.00029349246,0.00045052991,0.30716196,0.020594927,0.33780327,0.019871116,0.30996227],"study_design_scores_gemma":[0.000093802315,0.00019812817,0.00075013266,0.00007957711,0.000023717348,0.00028956067,0.0002670462,0.8337035,0.00672331,0.14736935,0.010460405,0.00004151701],"about_ca_topic_score_codex":0.0030646927,"about_ca_topic_score_gemma":0.003583037,"teacher_disagreement_score":0.011580136,"about_ca_system_score_codex":0.00058295584,"about_ca_system_score_gemma":0.00052534515,"threshold_uncertainty_score":0.038739443},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022173362,0.00022990796,0.9528154,0.00029659178,0.00028461358,0.0001622541,0.00010568068,0.0073068575,0.016625334],"genre_scores_gemma":[0.26940313,0.00026895417,0.7075372,0.00027521662,0.000244503,0.00025135887,0.0006051562,0.0016617975,0.019752705],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988631,0.00014198276,0.00006278517,0.0002635159,0.00045304286,0.0002156394],"domain_scores_gemma":[0.99902034,0.00025985145,0.00006546718,0.00033762655,0.00024937486,0.0000673071],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009801128,0.0011615383,0.0011177416,0.001418173,0.0011625334,0.0014500328,0.0015875757,0.00060763996,0.028524457],"category_scores_gemma":[0.0028835847,0.00053506176,0.0011868095,0.00086067145,0.001004247,0.003047984,0.003538041,0.0013891013,0.00795351],"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.000644688,0.00025376494,0.0012881552,0.00030061044,0.000084623854,0.00035520218,0.00041526632,0.03326552,0.038507696,0.24753113,0.018070705,0.6592827],"study_design_scores_gemma":[0.00056176167,0.00051123044,0.0006420907,0.000112800255,0.000113940994,0.00091722794,0.0003350786,0.42989883,0.069814645,0.39019284,0.106794514,0.00010508355],"about_ca_topic_score_codex":0.0013311267,"about_ca_topic_score_gemma":0.0017051453,"teacher_disagreement_score":0.028524457,"about_ca_system_score_codex":0.00093162886,"about_ca_system_score_gemma":0.0012397658,"threshold_uncertainty_score":0.09542382},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009226316,0.0000412998,0.98887324,0.000038138198,0.000058350466,0.000029736382,0.000023711007,0.00033620303,0.0013730569],"genre_scores_gemma":[0.19763644,0.00012359675,0.7983646,0.000091538604,0.000054888733,0.00019028912,0.00025007452,0.0007613467,0.0025272053],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9988524,0.00025066442,0.00008078221,0.00016446237,0.0005909563,0.000060787395],"domain_scores_gemma":[0.99868065,0.00024929695,0.00013629167,0.0003896725,0.00048252635,0.00006147647],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095394335,0.00091946125,0.0009993456,0.00096879527,0.00037132067,0.00097026344,0.0013972005,0.00079061935,0.0027055126],"category_scores_gemma":[0.004038626,0.0005462817,0.0006027725,0.0015234078,0.00060217356,0.0011449739,0.0017877572,0.0016554932,0.0010588609],"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.00036562138,0.0003433706,0.0019440278,0.0001933048,0.000103258935,0.0001094654,0.00037770282,0.34410748,0.1127888,0.044702973,0.006212757,0.4887512],"study_design_scores_gemma":[0.000026075886,0.00007411827,0.00026353047,0.00000778478,0.00001661084,0.0000933979,0.000027311009,0.97749865,0.014841555,0.0032919124,0.0038326036,0.00002644132],"about_ca_topic_score_codex":0.0009885046,"about_ca_topic_score_gemma":0.0014396296,"teacher_disagreement_score":0.0027055126,"about_ca_system_score_codex":0.0003000829,"about_ca_system_score_gemma":0.0009335921,"threshold_uncertainty_score":0.009050846},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17821747,0.0043930816,0.75418806,0.0066201147,0.00027641244,0.0006518378,0.004188649,0.006791635,0.044672742],"genre_scores_gemma":[0.4953602,0.0026863182,0.479401,0.001117873,0.00050378585,0.00075213565,0.006565554,0.0010529308,0.012560211],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99628985,0.0007300486,0.0002339463,0.0010903501,0.00097197655,0.0006837927],"domain_scores_gemma":[0.9860998,0.010290383,0.00094566715,0.0016948984,0.0005886128,0.00038065505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015983239,0.001723521,0.0017484557,0.0017561619,0.0020920837,0.006093255,0.0032309592,0.0024507702,0.011594722],"category_scores_gemma":[0.011234117,0.0011323047,0.002335997,0.003872171,0.0023233052,0.011502417,0.0039305096,0.0032881454,0.002245907],"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.0016566019,0.00064249884,0.007955903,0.0014663767,0.0002869403,0.00046381063,0.0009959686,0.29028767,0.009375253,0.24909411,0.047454197,0.39032072],"study_design_scores_gemma":[0.00020461268,0.00012269487,0.0011548249,0.00009766856,0.00009593342,0.00044346642,0.00032395276,0.51074797,0.0040141414,0.47095042,0.011792503,0.000051884344],"about_ca_topic_score_codex":0.0054669045,"about_ca_topic_score_gemma":0.004829075,"teacher_disagreement_score":0.011594722,"about_ca_system_score_codex":0.0039902045,"about_ca_system_score_gemma":0.0025974854,"threshold_uncertainty_score":0.0387882},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05489757,0.00009340548,0.94133776,0.00007574442,0.000028238752,0.000053575168,0.00007383431,0.00029854456,0.0031414],"genre_scores_gemma":[0.5233576,0.00014214613,0.4728657,0.00003599664,0.000011999102,0.00013177474,0.00041711,0.0002473233,0.0027903537],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99966395,0.000049678263,0.000018181632,0.00006243994,0.00017175464,0.000034013985],"domain_scores_gemma":[0.9996061,0.00015004759,0.000040264968,0.00007608503,0.000113720234,0.000013832361],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048713523,0.00044762038,0.0004754764,0.00067504396,0.00025577686,0.00066142884,0.00064415816,0.0006044982,0.0019273637],"category_scores_gemma":[0.0014880097,0.00029357654,0.00053362263,0.0005587256,0.0004413941,0.0006124828,0.0007420339,0.00055790006,0.000520245],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000107461514,0.000090044436,0.0014457912,0.00016690567,0.000021093854,0.00012255061,0.0001348831,0.752926,0.065563515,0.015037948,0.0013367737,0.16304708],"study_design_scores_gemma":[0.000005178042,0.000038401544,0.00019393303,0.0000059895524,0.0000042092643,0.00004780079,0.000025458769,0.9805824,0.014903903,0.0026366743,0.00154918,0.0000068494423],"about_ca_topic_score_codex":0.0009150844,"about_ca_topic_score_gemma":0.0011990223,"teacher_disagreement_score":0.0019273637,"about_ca_system_score_codex":0.0004324643,"about_ca_system_score_gemma":0.00045615566,"threshold_uncertainty_score":0.0064477324},"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":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04175573,0.007706306,0.42205867,0.0049211397,0.0015489619,0.00013939633,0.0007925248,0.00037136988,0.5207058],"genre_scores_gemma":[0.42391714,0.010213839,0.23778659,0.0015469884,0.0016393897,0.00040731428,0.003236741,0.0010794263,0.32017252],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99950504,0.000108766755,0.000022130353,0.00014054177,0.00015991612,0.00006356251],"domain_scores_gemma":[0.99947745,0.00026543855,0.000045269615,0.000110607885,0.000054192416,0.000047008707],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005351104,0.0007471983,0.0010621495,0.0006973705,0.0012775316,0.0025495416,0.0017251348,0.0018143834,0.028774325],"category_scores_gemma":[0.0031346763,0.0007087958,0.0009341999,0.0013662258,0.0017801676,0.004098989,0.0028630255,0.004011859,0.0040322463],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008755395,0.0000442907,0.00014495161,0.00019405845,0.000021916288,0.00011220278,0.00012321866,0.013805581,0.0010006931,0.8743465,0.026792698,0.08332637],"study_design_scores_gemma":[0.000018902874,0.000013864237,0.00010888824,0.000054343822,0.000010498403,0.00017055166,0.00009117861,0.027443008,0.00074240426,0.9338281,0.03750862,0.000009593279],"about_ca_topic_score_codex":0.00081220135,"about_ca_topic_score_gemma":0.0006977049,"teacher_disagreement_score":0.028774325,"about_ca_system_score_codex":0.0007317725,"about_ca_system_score_gemma":0.0005833185,"threshold_uncertainty_score":0.09625971},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04265261,0.00066170795,0.9476447,0.00015952848,0.00011235413,0.00010089625,0.00027534048,0.00050326745,0.007889586],"genre_scores_gemma":[0.22522785,0.0013514858,0.7594041,0.00015874108,0.00009172136,0.00024131806,0.0011107429,0.00074140966,0.011672546],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993106,0.000206481,0.00003773522,0.00010334595,0.0002678561,0.00007398766],"domain_scores_gemma":[0.99674404,0.002414721,0.00015417654,0.0002457628,0.0003124165,0.000128867],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010645472,0.0016148614,0.00175236,0.0017916613,0.0006202393,0.0016587442,0.0025644896,0.0013326153,0.0065367254],"category_scores_gemma":[0.008307391,0.0010402928,0.0010052703,0.0032552052,0.0010891027,0.0027370488,0.002985635,0.0020888646,0.00094851106],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021519403,0.00009865643,0.0009497455,0.00031132787,0.000055242792,0.000083275896,0.00027521412,0.76992077,0.0037320515,0.0671472,0.005781855,0.15142947],"study_design_scores_gemma":[0.000010448093,0.000033658962,0.000098651166,0.000024038394,0.00000961208,0.000035206736,0.000063595464,0.965967,0.0006527954,0.03123077,0.0018672659,0.0000069578796],"about_ca_topic_score_codex":0.009208396,"about_ca_topic_score_gemma":0.0112973815,"teacher_disagreement_score":0.009208396,"about_ca_system_score_codex":0.0015055377,"about_ca_system_score_gemma":0.0006363765,"threshold_uncertainty_score":0.021867514},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38345495,0.0013125548,0.24275263,0.0027603025,0.0006241387,0.00037514808,0.0026051318,0.00075044215,0.36536467],"genre_scores_gemma":[0.68297017,0.0016137903,0.10950641,0.00041900834,0.00019216338,0.00021605921,0.0035246524,0.00084040046,0.20071729],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997576,0.00004871341,0.000010319472,0.000044285887,0.00006572164,0.00007339536],"domain_scores_gemma":[0.9993844,0.00019622249,0.00008561746,0.00005542215,0.00013018736,0.00014809787],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017682825,0.0005166939,0.00049191056,0.0010912124,0.0017878889,0.0026818234,0.00076066697,0.0009544138,0.030907843],"category_scores_gemma":[0.0017288357,0.00046424998,0.00050082116,0.00079602306,0.0013099231,0.0019355245,0.0020047238,0.0022005413,0.0046436195],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026159713,0.000051235984,0.000859602,0.0001439154,0.000012840637,0.00040137884,0.0006183945,0.012322693,0.0027077098,0.9393558,0.018826958,0.02443788],"study_design_scores_gemma":[0.00008102184,0.000062773535,0.0010614899,0.000094971874,0.000013891718,0.0005305906,0.0013328732,0.04876635,0.0018496239,0.8842103,0.0619686,0.000027448872],"about_ca_topic_score_codex":0.002962112,"about_ca_topic_score_gemma":0.004084311,"teacher_disagreement_score":0.030907843,"about_ca_system_score_codex":0.0010203909,"about_ca_system_score_gemma":0.00054044207,"threshold_uncertainty_score":0.10339701},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13913456,0.0004613563,0.8476782,0.0005484048,0.0000824693,0.0002525077,0.0009647713,0.0025772715,0.008300561],"genre_scores_gemma":[0.22640646,0.00032580228,0.7633091,0.00014031984,0.000026177837,0.00013722709,0.003184284,0.0006694477,0.0058010984],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995964,0.000051499872,0.000030008683,0.00012027411,0.000109013585,0.00009278485],"domain_scores_gemma":[0.99930406,0.00030278353,0.000051444462,0.00019941325,0.00010084813,0.000041382267],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034428178,0.0007857715,0.0008411715,0.00090772216,0.00068312796,0.0009514821,0.001100884,0.0006293467,0.0055251056],"category_scores_gemma":[0.001787091,0.00056568667,0.0008731912,0.0013478429,0.0006116448,0.0026469876,0.0021374838,0.0009804743,0.0017691482],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005614326,0.00025986452,0.0041344576,0.0006969366,0.00007564732,0.00035325816,0.00069203787,0.13658862,0.052836467,0.05603258,0.03207032,0.71569836],"study_design_scores_gemma":[0.00022636008,0.00031626606,0.002537339,0.00011463595,0.00010888815,0.00070358237,0.0010893317,0.6896355,0.047318224,0.21375333,0.044123366,0.000073150135],"about_ca_topic_score_codex":0.0032580318,"about_ca_topic_score_gemma":0.007635147,"teacher_disagreement_score":0.0055251056,"about_ca_system_score_codex":0.0005249195,"about_ca_system_score_gemma":0.00087952544,"threshold_uncertainty_score":0.01848334},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00820345,0.0020831889,0.96791315,0.00048575428,0.000228072,0.0001111531,0.0014523313,0.0055610985,0.013961834],"genre_scores_gemma":[0.15070385,0.0035958996,0.8031508,0.00037094727,0.00031963902,0.0003094038,0.009678488,0.0031226513,0.028748319],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9979843,0.00023279585,0.00018321422,0.00033389713,0.0011530063,0.00011272032],"domain_scores_gemma":[0.99802315,0.00081834244,0.00006773575,0.0007640546,0.00025307876,0.000073696276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009190439,0.0012012721,0.00226677,0.0015307758,0.0010091331,0.0032551945,0.002864793,0.0024874972,0.017961608],"category_scores_gemma":[0.0069155293,0.0007369926,0.0010522251,0.0033767456,0.0010986008,0.0077266307,0.0064363093,0.0023095994,0.00858773],"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.0003446403,0.0001216681,0.0006347811,0.0010872487,0.000068540336,0.00036992846,0.00069245667,0.04283044,0.012507287,0.26337123,0.098778404,0.5791934],"study_design_scores_gemma":[0.00008288311,0.00006530652,0.0003336299,0.00015282165,0.00003348883,0.0010816606,0.0003698914,0.3172238,0.01180389,0.54444385,0.12434336,0.000065360044],"about_ca_topic_score_codex":0.0016680873,"about_ca_topic_score_gemma":0.0016990984,"teacher_disagreement_score":0.017961608,"about_ca_system_score_codex":0.0010419437,"about_ca_system_score_gemma":0.000555651,"threshold_uncertainty_score":0.06008762},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1377406,0.0020385496,0.7636627,0.0006569332,0.00011460226,0.0000956531,0.00038359856,0.00024743468,0.09505987],"genre_scores_gemma":[0.8545341,0.0023106227,0.12269812,0.0002711914,0.00013993662,0.0001727283,0.0005929695,0.00029496028,0.018985284],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994104,0.00021865212,0.000023767769,0.000087244785,0.00017807902,0.00008194334],"domain_scores_gemma":[0.9978149,0.0016393322,0.00020514285,0.000060307,0.00017345978,0.000106854866],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010683679,0.0007250265,0.0009006101,0.0017904694,0.0008763628,0.00167635,0.0014986484,0.0008805019,0.0060504205],"category_scores_gemma":[0.0038754167,0.0005626265,0.0011238166,0.0013722243,0.0024793362,0.002514119,0.0018811749,0.001970616,0.00051206065],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013064613,0.000025951713,0.00025592058,0.00016966548,0.000018916482,0.00025364847,0.0003897042,0.11897901,0.0035185658,0.86461276,0.0014626896,0.010182454],"study_design_scores_gemma":[0.00002282198,0.00006744624,0.00040550652,0.000079467296,0.000025105805,0.0002214463,0.00015233796,0.33644375,0.0012601903,0.6569764,0.004312128,0.00003331617],"about_ca_topic_score_codex":0.0036966796,"about_ca_topic_score_gemma":0.0015517074,"teacher_disagreement_score":0.0060504205,"about_ca_system_score_codex":0.0014026352,"about_ca_system_score_gemma":0.0005813814,"threshold_uncertainty_score":0.020240605},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006951425,0.00018239318,0.9530931,0.0001879127,0.0004707157,0.00014110432,0.00012810672,0.0030378662,0.03580726],"genre_scores_gemma":[0.06404863,0.00068140373,0.8802406,0.00018454071,0.00008965373,0.00009577983,0.00042233875,0.0028456813,0.051391292],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995419,0.000029051726,0.000020175617,0.00008033436,0.00029075076,0.00003783578],"domain_scores_gemma":[0.9994042,0.0001865301,0.000024120114,0.0002535334,0.00010265679,0.00002900382],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044728027,0.00077365874,0.0005395362,0.0008867203,0.0005848483,0.0012740756,0.0016675188,0.0012160178,0.018649576],"category_scores_gemma":[0.0018671029,0.0005231817,0.0007780055,0.00089837407,0.0010436454,0.0020118053,0.0023853353,0.0020812063,0.007349402],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011390176,0.000093382245,0.0005426267,0.00054111046,0.0000311962,0.00056450535,0.0007718995,0.04427066,0.066498734,0.14727488,0.018886395,0.7204106],"study_design_scores_gemma":[0.000046091645,0.0003138491,0.0005310115,0.00030419952,0.00005465595,0.0021348598,0.0002934983,0.30862394,0.080948085,0.09255478,0.5140837,0.0001113585],"about_ca_topic_score_codex":0.00097566505,"about_ca_topic_score_gemma":0.0011058669,"teacher_disagreement_score":0.018649576,"about_ca_system_score_codex":0.00039044302,"about_ca_system_score_gemma":0.0007251084,"threshold_uncertainty_score":0.062389076},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.079204224,0.00066231727,0.8844936,0.0018332119,0.00067463645,0.00014270718,0.00020600048,0.0005623504,0.032220915],"genre_scores_gemma":[0.6114871,0.0013211413,0.37221384,0.0012416586,0.00022881295,0.00029595746,0.0003804609,0.0010593884,0.011771654],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990909,0.00023021255,0.000060818493,0.00019462773,0.00031759214,0.000105750274],"domain_scores_gemma":[0.9978435,0.00048886327,0.00020742547,0.0011574335,0.00013748284,0.00016521779],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013958532,0.0010270512,0.001575644,0.0011008474,0.0015023835,0.001880099,0.0017482176,0.0017638232,0.009327163],"category_scores_gemma":[0.009495059,0.0007556846,0.00087573717,0.00087085355,0.0025347702,0.0040157554,0.00556536,0.0027833076,0.0018209915],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036683318,0.00028764142,0.0021888416,0.0005728449,0.00014548916,0.00048112054,0.0005134584,0.26364774,0.03541937,0.58545285,0.005154348,0.105769485],"study_design_scores_gemma":[0.00006752297,0.00012657295,0.00043921187,0.00008353079,0.000049585167,0.00032223912,0.00023423928,0.4221317,0.0067122905,0.5520954,0.017697122,0.000040647858],"about_ca_topic_score_codex":0.00064631476,"about_ca_topic_score_gemma":0.0007484911,"teacher_disagreement_score":0.009327163,"about_ca_system_score_codex":0.00059495604,"about_ca_system_score_gemma":0.00081576075,"threshold_uncertainty_score":0.031202495},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009655711,0.0062440075,0.9533096,0.0017596326,0.0004382046,0.0002489529,0.00040840876,0.002806239,0.025129149],"genre_scores_gemma":[0.18710785,0.004547721,0.7829901,0.0014880411,0.0008098183,0.0008551346,0.0016548681,0.0035175825,0.017028796],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98398054,0.0031054462,0.0007572129,0.0030530584,0.006520512,0.0025833054],"domain_scores_gemma":[0.88531506,0.078187935,0.004168612,0.023623815,0.0063919695,0.0023125808],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012296453,0.0046035354,0.003912316,0.005122628,0.0034946117,0.007012108,0.01091117,0.0049555115,0.032520782],"category_scores_gemma":[0.088683,0.0030789403,0.004063193,0.0061849975,0.005336104,0.02454897,0.01322447,0.016105073,0.012216766],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0022283746,0.00074431504,0.0037739067,0.0023557807,0.00030070377,0.0005055659,0.0014951285,0.17486252,0.01748117,0.3158958,0.042618,0.43773875],"study_design_scores_gemma":[0.0001811353,0.00048925425,0.0018748906,0.00070021575,0.0003208935,0.00093952,0.00039753903,0.54148984,0.017653823,0.37018698,0.06558567,0.000180275],"about_ca_topic_score_codex":0.004165635,"about_ca_topic_score_gemma":0.0056284717,"teacher_disagreement_score":0.032520782,"about_ca_system_score_codex":0.004306381,"about_ca_system_score_gemma":0.002441219,"threshold_uncertainty_score":0.10879284},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28195333,0.00075723365,0.610842,0.0005362362,0.00066574,0.00019954226,0.00085443334,0.0013319937,0.10285959],"genre_scores_gemma":[0.8356281,0.0005908417,0.11626395,0.00020839945,0.0001369922,0.00012487468,0.0010523795,0.00079094805,0.045203485],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999506,0.000118414304,0.000026238098,0.000061490085,0.00019674428,0.00009116656],"domain_scores_gemma":[0.9990988,0.0002681919,0.000096521275,0.00022239868,0.00019690902,0.000117318436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038039644,0.00033845808,0.00036062373,0.0011405847,0.00087190757,0.0012121288,0.0006459296,0.000582531,0.0177032],"category_scores_gemma":[0.0030589085,0.00032243345,0.00041169327,0.00061452785,0.0012697085,0.0013627646,0.002468072,0.00091606664,0.0027980132],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021698451,0.0000368108,0.0008625078,0.00010734025,0.000015477124,0.0002658096,0.00031680253,0.016679293,0.007845382,0.8698942,0.011796079,0.09196335],"study_design_scores_gemma":[0.00008257489,0.00010929833,0.00094864133,0.00009044781,0.000021338528,0.00048227212,0.0005086916,0.14796638,0.012058511,0.7989974,0.038693015,0.000041408046],"about_ca_topic_score_codex":0.0010170334,"about_ca_topic_score_gemma":0.0020686453,"teacher_disagreement_score":0.0177032,"about_ca_system_score_codex":0.00044947802,"about_ca_system_score_gemma":0.00034898764,"threshold_uncertainty_score":0.059223115},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04496054,0.00027441696,0.9504496,0.00018232755,0.000038390786,0.00005389314,0.00010193722,0.00017326485,0.003765632],"genre_scores_gemma":[0.8545068,0.0005624833,0.14039822,0.00010470453,0.00004850354,0.00017083134,0.0003005194,0.00011440626,0.003793433],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982666,0.00048509962,0.00008299171,0.00032291652,0.0007006234,0.00014190824],"domain_scores_gemma":[0.9956033,0.0026935933,0.00061089837,0.00044085828,0.0005029413,0.0001483648],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020554203,0.00052374223,0.0007950349,0.001560167,0.0005452951,0.0018716885,0.0018595867,0.0011366885,0.0019256842],"category_scores_gemma":[0.012068336,0.0004805594,0.0005867069,0.0014217002,0.0025754366,0.002826435,0.001825061,0.00091620896,0.00051548233],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014240625,0.0000447046,0.0030870452,0.00012180187,0.000025838315,0.0005705525,0.00018969606,0.71352106,0.003228361,0.2566949,0.00085473165,0.021518923],"study_design_scores_gemma":[0.000015343614,0.000040250587,0.00060092425,0.000021512353,0.000007626983,0.0003214164,0.0000872001,0.9427969,0.0020396984,0.052409336,0.001633956,0.000025842806],"about_ca_topic_score_codex":0.0012351191,"about_ca_topic_score_gemma":0.0006827856,"teacher_disagreement_score":0.0020554203,"about_ca_system_score_codex":0.0013326164,"about_ca_system_score_gemma":0.00060643913,"threshold_uncertainty_score":0.010870218},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20432432,0.0004735623,0.78199637,0.000621055,0.00015547863,0.00006215697,0.0008243862,0.001511578,0.010031148],"genre_scores_gemma":[0.7220511,0.00027752307,0.26814523,0.00019310466,0.000095371004,0.00005267907,0.0009463523,0.0005772687,0.0076613836],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99933666,0.000095222946,0.00003166363,0.00015822698,0.00025303464,0.00012519887],"domain_scores_gemma":[0.997292,0.0014061106,0.00020743662,0.00040289178,0.00036734302,0.0003242146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010523434,0.0008330211,0.001359285,0.0019804507,0.0007704099,0.0033823554,0.0018293095,0.001437032,0.008172613],"category_scores_gemma":[0.0073378407,0.0008361401,0.0009465967,0.0013530182,0.0019964457,0.0048373574,0.003201984,0.0020856487,0.001064777],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006540989,0.00014559331,0.0042572124,0.00041091238,0.000106995634,0.00019884131,0.0006542917,0.2663979,0.009118946,0.5909673,0.00852413,0.11856379],"study_design_scores_gemma":[0.000020149586,0.00003591329,0.0004305054,0.000032137315,0.000016359141,0.00005830843,0.00011772158,0.47943938,0.0029856635,0.5142719,0.0025690026,0.000022873794],"about_ca_topic_score_codex":0.0027216272,"about_ca_topic_score_gemma":0.0059119267,"teacher_disagreement_score":0.008172613,"about_ca_system_score_codex":0.0017693352,"about_ca_system_score_gemma":0.0006496716,"threshold_uncertainty_score":0.027340055},"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":"other","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001633344,0.012606269,0.012728129,0.046595316,0.298755,0.0004997915,0.009522593,0.0016409256,0.61601865],"genre_scores_gemma":[0.007423093,0.0045761447,0.0032507773,0.007514316,0.034696266,0.00023727113,0.005298616,0.00084334944,0.93616015],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992834,0.00010495423,0.000039870756,0.00012598917,0.00038151455,0.00006425312],"domain_scores_gemma":[0.9949957,0.000693568,0.00016433295,0.0004286961,0.0028657892,0.0008519422],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012936784,0.0008543403,0.00059676915,0.0028180745,0.0023903113,0.0031082397,0.0011418577,0.0009297219,0.38139856],"category_scores_gemma":[0.010817015,0.00023648032,0.00047742474,0.001622078,0.00056755287,0.0022291574,0.001964637,0.0027555434,0.24360858],"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.000024081823,0.000019713241,0.00008979718,0.000068443274,0.0000016086555,0.000031476713,0.000050987634,0.00006563495,0.00012576835,0.0074822563,0.9521368,0.039903566],"study_design_scores_gemma":[0.0000038677485,0.000009910949,0.00019036084,0.0000819016,0.0000015947223,0.00003139985,0.000055007426,0.000038913146,0.00010474815,0.004607018,0.99487126,0.000004058328],"about_ca_topic_score_codex":0.0034125794,"about_ca_topic_score_gemma":0.004973599,"teacher_disagreement_score":0.38139856,"about_ca_system_score_codex":0.0020171239,"about_ca_system_score_gemma":0.0020919023,"threshold_uncertainty_score":0},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9109339,0.0011010831,0.07016785,0.0004897225,0.00014241853,0.000046471574,0.0007024025,0.00040292522,0.01601321],"genre_scores_gemma":[0.99137986,0.00024909546,0.006623221,0.00005616845,0.000059890932,0.000027702175,0.00027418905,0.00005863488,0.0012712206],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989812,0.00015792742,0.00005595007,0.00029003425,0.00029670302,0.00021818044],"domain_scores_gemma":[0.99367505,0.0028649783,0.0013845882,0.0007792562,0.0005070504,0.00078890333],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001146213,0.0004826654,0.00058031594,0.0037109319,0.0009583873,0.0022843317,0.00077962835,0.00068176474,0.0042323065],"category_scores_gemma":[0.010148703,0.00045380456,0.00025920742,0.0020945848,0.0012612195,0.0021866872,0.0011171763,0.00083688897,0.0003846795],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014518186,0.00019556432,0.029311845,0.00032215103,0.00010463172,0.00097618543,0.0008126574,0.27389002,0.029426118,0.56276625,0.011154354,0.08958841],"study_design_scores_gemma":[0.00008695448,0.00015674793,0.009033829,0.000073010124,0.00006035316,0.0015520948,0.00031429055,0.4416343,0.010299386,0.52601177,0.0107200155,0.000057269703],"about_ca_topic_score_codex":0.0007619268,"about_ca_topic_score_gemma":0.00063449057,"teacher_disagreement_score":0.0042323065,"about_ca_system_score_codex":0.0019474085,"about_ca_system_score_gemma":0.00036926634,"threshold_uncertainty_score":0.014158487},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12054986,0.0011009882,0.8662807,0.0008738613,0.00011125819,0.00010643763,0.0008678719,0.0031924834,0.006916607],"genre_scores_gemma":[0.5332325,0.00072364474,0.4598209,0.0002893937,0.000072733,0.00019054892,0.0013720941,0.00040394563,0.0038942622],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968701,0.00067421916,0.00027515588,0.0004961036,0.0011872896,0.0004972072],"domain_scores_gemma":[0.99187225,0.0027554538,0.00085755874,0.0033819014,0.00083757273,0.00029511578],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018830998,0.00066999317,0.0012528527,0.001071884,0.00071446877,0.0029117907,0.0030161836,0.0010547729,0.005265408],"category_scores_gemma":[0.011786048,0.00049856416,0.0008637086,0.0025068866,0.00093166967,0.0059729926,0.004799488,0.0013558083,0.0012399147],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011907401,0.00027649742,0.0043897405,0.00053742924,0.00013155282,0.00032481726,0.0014978175,0.18158653,0.032412637,0.15734518,0.019545961,0.6007611],"study_design_scores_gemma":[0.00013835948,0.00040778428,0.0017705993,0.00008641462,0.000052795545,0.0006186724,0.0008997271,0.821879,0.03291604,0.1264796,0.01462976,0.00012120661],"about_ca_topic_score_codex":0.0021242283,"about_ca_topic_score_gemma":0.0012440769,"teacher_disagreement_score":0.005265408,"about_ca_system_score_codex":0.00075348635,"about_ca_system_score_gemma":0.0009650821,"threshold_uncertainty_score":0.017614543},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17812556,0.000120957244,0.7681975,0.00018028595,0.00029851907,0.00022923225,0.0005291271,0.0016972264,0.050621618],"genre_scores_gemma":[0.736117,0.00006316977,0.24222857,0.000079749196,0.000015829715,0.00008518535,0.0005181173,0.00035432732,0.020538218],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998976,0.000013222526,0.0000061659634,0.000019743147,0.000048315138,0.0000149635225],"domain_scores_gemma":[0.9998995,0.000020350815,0.0000059278723,0.000040688414,0.00002423544,0.000009267116],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017446281,0.00022955923,0.0003350919,0.00034553307,0.00026298722,0.0005906122,0.0003811487,0.00041819966,0.008095196],"category_scores_gemma":[0.0004075776,0.00017545356,0.00037639795,0.00021637937,0.00035988993,0.00026111162,0.000559926,0.00043358025,0.0011731577],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003056411,0.00015205101,0.0019581104,0.00019994087,0.000044878776,0.00044047588,0.0004431417,0.71588993,0.113393255,0.04073373,0.006274432,0.120164365],"study_design_scores_gemma":[0.000019523952,0.000062035215,0.000982852,0.000018153307,0.000008489707,0.0000762438,0.000065841705,0.963963,0.020695623,0.006078107,0.0080171665,0.000013142595],"about_ca_topic_score_codex":0.0018383432,"about_ca_topic_score_gemma":0.0033856765,"teacher_disagreement_score":0.008095196,"about_ca_system_score_codex":0.0003009269,"about_ca_system_score_gemma":0.00038487153,"threshold_uncertainty_score":0.027081132},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016825309,0.0017467444,0.37850326,0.0014248731,0.0008672573,0.00019269709,0.002082844,0.0025068894,0.5958501],"genre_scores_gemma":[0.50658846,0.003450135,0.18589285,0.0010262261,0.0008398225,0.00047772712,0.006566077,0.0032062272,0.2919525],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983652,0.0002255113,0.00013060535,0.0004826468,0.0005956512,0.00020035157],"domain_scores_gemma":[0.9985165,0.00042846304,0.00008030791,0.0006508431,0.000251453,0.00007245057],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008175412,0.0008912856,0.0009112548,0.0012717921,0.0019942503,0.004518836,0.0012852926,0.00085438305,0.0356824],"category_scores_gemma":[0.0028171395,0.0007981753,0.0010976122,0.0014140563,0.002814174,0.010341531,0.0033656943,0.0024875458,0.009988907],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019641413,0.000017509212,0.00005182152,0.000066416775,0.000006218739,0.000060784863,0.0002592542,0.00038490986,0.00086852605,0.952723,0.012445144,0.033096842],"study_design_scores_gemma":[0.000007701754,0.000009832561,0.000052450603,0.000033986595,0.000009572437,0.00021280027,0.00009640952,0.0015983463,0.0014317927,0.9008152,0.09571922,0.000012569358],"about_ca_topic_score_codex":0.00091238203,"about_ca_topic_score_gemma":0.0010567739,"teacher_disagreement_score":0.0356824,"about_ca_system_score_codex":0.0012324555,"about_ca_system_score_gemma":0.0010903401,"threshold_uncertainty_score":0.11936957},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5708402,0.02124008,0.27064782,0.0026646794,0.0020011244,0.00090443663,0.03946837,0.022594875,0.06963843],"genre_scores_gemma":[0.6318319,0.0055361036,0.22331837,0.000696062,0.00025966912,0.0006901705,0.12336012,0.005399841,0.008907716],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961659,0.00058330415,0.00033570387,0.0005685039,0.0021707842,0.00017579118],"domain_scores_gemma":[0.99450994,0.0028148622,0.0001968136,0.0010966039,0.0012027,0.0001790903],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028112559,0.001447941,0.0009681945,0.0029495487,0.0008393368,0.0018034213,0.0023559502,0.0018138868,0.004504162],"category_scores_gemma":[0.011679813,0.00056652597,0.001268443,0.0028693555,0.00091594015,0.002038461,0.001886937,0.0014361346,0.0029424476],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014330416,0.0012036704,0.023647044,0.004725625,0.0005195711,0.0006807888,0.00066063594,0.34082285,0.018357698,0.020113865,0.16921994,0.4186153],"study_design_scores_gemma":[0.00031232243,0.0009505428,0.02878987,0.0006204678,0.00015768385,0.0013799072,0.0010650967,0.7325622,0.035337098,0.014586036,0.18406105,0.00017761246],"about_ca_topic_score_codex":0.0036963355,"about_ca_topic_score_gemma":0.0065590427,"teacher_disagreement_score":0.004504162,"about_ca_system_score_codex":0.0006429799,"about_ca_system_score_gemma":0.0009130486,"threshold_uncertainty_score":0.015067935},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04698751,0.002770951,0.88799196,0.0012753512,0.00031832827,0.000042430005,0.00038568303,0.00025082444,0.05997693],"genre_scores_gemma":[0.76922,0.0030617095,0.1856077,0.00088311883,0.00076111604,0.00037522495,0.0012134608,0.0002638318,0.0386138],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996819,0.0013313994,0.00015682161,0.00051417574,0.0009917142,0.00018677773],"domain_scores_gemma":[0.9933848,0.0043552704,0.00042958066,0.00084712484,0.00066228764,0.000320886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023789632,0.0007265045,0.00077793404,0.0011797274,0.0012938085,0.0028181875,0.0010193352,0.00097582594,0.004667532],"category_scores_gemma":[0.012515916,0.00033333662,0.0006194191,0.000913569,0.0034483531,0.00360467,0.0030693873,0.002719252,0.001148918],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009857693,0.0000067313567,0.0001310669,0.00003508875,0.000007339657,0.000029841585,0.00006355359,0.0025346328,0.00034980816,0.99058187,0.0007044005,0.0055457964],"study_design_scores_gemma":[0.0000041722774,0.000013618123,0.00016750731,0.000017379945,0.0000030699964,0.00008986617,0.000029947774,0.016498584,0.00039665826,0.97600466,0.006765526,0.000009054876],"about_ca_topic_score_codex":0.00039424267,"about_ca_topic_score_gemma":0.00029044872,"teacher_disagreement_score":0.004667532,"about_ca_system_score_codex":0.00097515533,"about_ca_system_score_gemma":0.0006074593,"threshold_uncertainty_score":0.01561439},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6974978,0.0031986362,0.18287708,0.0021872933,0.0002176607,0.00010809197,0.0010078062,0.00070014776,0.11220547],"genre_scores_gemma":[0.9404987,0.0018485636,0.048033595,0.00031560144,0.00024444817,0.00008461077,0.0007218081,0.00047074104,0.0077819414],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989416,0.00045349693,0.000040833722,0.0001689189,0.0002588133,0.0001363958],"domain_scores_gemma":[0.9857481,0.011378494,0.0010965611,0.00046874225,0.0007481099,0.00056003116],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019208613,0.001093546,0.00071684626,0.0032310958,0.00066264876,0.0021372195,0.0017858087,0.0008513396,0.010673396],"category_scores_gemma":[0.020413268,0.00047078446,0.0004698018,0.0018744156,0.0014454032,0.0029924633,0.0010646563,0.001486236,0.0012297045],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000710822,0.00018523334,0.0038396234,0.0003621087,0.000065700646,0.00025284747,0.00059697963,0.13753092,0.009346047,0.721044,0.012288365,0.11377728],"study_design_scores_gemma":[0.00007411029,0.00022928629,0.0042114467,0.00011719216,0.00010281172,0.0007752137,0.0005718273,0.45179963,0.0063571455,0.52790576,0.0077954507,0.00006017177],"about_ca_topic_score_codex":0.0018764863,"about_ca_topic_score_gemma":0.0015056897,"teacher_disagreement_score":0.010673396,"about_ca_system_score_codex":0.0013553313,"about_ca_system_score_gemma":0.00052638876,"threshold_uncertainty_score":0.035706103},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1274266,0.0012919668,0.8514672,0.0028013503,0.0001516126,0.00022372407,0.0013916384,0.0026918903,0.012553973],"genre_scores_gemma":[0.49890098,0.00040383294,0.49010077,0.0008642533,0.00010887658,0.00043174773,0.0029761584,0.0009828177,0.005230541],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998987,0.00049161445,0.000030482082,0.00019696174,0.00016437368,0.00012957647],"domain_scores_gemma":[0.9972485,0.0020400994,0.00013915499,0.00030783683,0.00014191095,0.00012237199],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011316825,0.0007682772,0.0014567898,0.0006694484,0.0007916439,0.0010739696,0.0019355632,0.0018025254,0.0071771336],"category_scores_gemma":[0.00608653,0.00055052264,0.0010569612,0.0012948089,0.0012330925,0.0021789768,0.0020547006,0.0019520536,0.0010328916],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00070751755,0.00036410717,0.002020318,0.0005887212,0.00016409092,0.00039556413,0.00052880263,0.6784463,0.006279091,0.09537155,0.045303565,0.16983035],"study_design_scores_gemma":[0.00016329772,0.000096759286,0.00024190731,0.000034151297,0.000037538997,0.00009306509,0.00020512285,0.8952255,0.0021636984,0.09732514,0.004396734,0.000016917666],"about_ca_topic_score_codex":0.0025876937,"about_ca_topic_score_gemma":0.0041374364,"teacher_disagreement_score":0.0071771336,"about_ca_system_score_codex":0.0008440692,"about_ca_system_score_gemma":0.0011850789,"threshold_uncertainty_score":0.024009943},"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":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014929132,0.0022370603,0.90397453,0.00033110738,0.00052789797,0.00014406588,0.0014403053,0.007975001,0.08187708],"genre_scores_gemma":[0.044944674,0.003616362,0.73216087,0.00054055464,0.00044065926,0.00052936404,0.0049581127,0.004073757,0.20873559],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99900657,0.00012219111,0.000056436056,0.00018271372,0.0005619505,0.000070125505],"domain_scores_gemma":[0.9991085,0.00020637467,0.00003082609,0.00035492337,0.0002561784,0.000043143325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007371057,0.0010507347,0.001086185,0.0015131804,0.0009909086,0.0029166802,0.0024064893,0.0009370231,0.0984979],"category_scores_gemma":[0.0027468356,0.00062816706,0.0009381442,0.0023397205,0.00087381597,0.0030067905,0.0026845885,0.0015003721,0.046367913],"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.00008629393,0.00007762887,0.00026839762,0.00036516282,0.000048247133,0.00006985643,0.00016735807,0.006766806,0.003867398,0.27713862,0.12720226,0.58394194],"study_design_scores_gemma":[0.00006776036,0.000057159286,0.0003789473,0.00016367158,0.000045152203,0.00047923878,0.0001238635,0.09685075,0.00748277,0.29138082,0.60292387,0.00004599878],"about_ca_topic_score_codex":0.0020724337,"about_ca_topic_score_gemma":0.002966523,"teacher_disagreement_score":0.0984979,"about_ca_system_score_codex":0.00055855524,"about_ca_system_score_gemma":0.0010752646,"threshold_uncertainty_score":0.3295083},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0069388016,0.0037569376,0.1291559,0.0007262009,0.0021594614,0.00008719037,0.0009855495,0.00070484617,0.855485],"genre_scores_gemma":[0.14829163,0.008610241,0.08468619,0.0007625617,0.0014613244,0.00018924933,0.002777875,0.0013313545,0.75188947],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997644,0.000027576627,0.000011553811,0.000043980624,0.00013153967,0.00002092109],"domain_scores_gemma":[0.9998343,0.000037693117,0.000014257781,0.000038413385,0.000054651646,0.000020558262],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017034441,0.00055821013,0.00045036862,0.0007280102,0.00066932087,0.0019788125,0.00076100806,0.00038517048,0.04681122],"category_scores_gemma":[0.0006323291,0.00039688457,0.00046041975,0.0008731809,0.00069439947,0.0014722652,0.0009607826,0.0014863979,0.016472686],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038371214,0.000040034796,0.00011897152,0.00024450535,0.0000072137063,0.00008761749,0.00012432024,0.0025390673,0.0021074475,0.77924615,0.08470199,0.13074434],"study_design_scores_gemma":[0.0000121668345,0.000024845443,0.000320197,0.00009192214,0.000008657901,0.00051724183,0.00009288913,0.005249858,0.0017631858,0.5248102,0.46709755,0.000011304648],"about_ca_topic_score_codex":0.00074897095,"about_ca_topic_score_gemma":0.0009192707,"teacher_disagreement_score":0.04681122,"about_ca_system_score_codex":0.00059841486,"about_ca_system_score_gemma":0.0003811609,"threshold_uncertainty_score":0.15659916},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008743066,0.010871944,0.10475403,0.029146487,0.025260411,0.000086874454,0.0020018488,0.0012363581,0.81789905],"genre_scores_gemma":[0.21027349,0.011721123,0.09001742,0.0062282565,0.01178899,0.00019588669,0.0020194203,0.0018116862,0.66594374],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992205,0.00016967574,0.000032175267,0.00021082058,0.0002781805,0.00008865257],"domain_scores_gemma":[0.9992848,0.00015418662,0.000031046093,0.00010633921,0.00029446612,0.0001291068],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009019966,0.0009405391,0.0006002694,0.0012775267,0.0016077239,0.0029514537,0.00079269207,0.0009483615,0.049056012],"category_scores_gemma":[0.0022836037,0.00033259633,0.00072665757,0.0007195659,0.0017179529,0.003949494,0.0017249779,0.0030842624,0.02251428],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000093819735,0.000010190176,0.00010829737,0.00006116264,0.000006562679,0.000025699734,0.00019944979,0.0002672988,0.00039389048,0.81281203,0.15533595,0.030770129],"study_design_scores_gemma":[0.000004689798,0.000018869072,0.00023990752,0.00006641065,0.000005624436,0.00012258724,0.00013177741,0.0007014352,0.00045335465,0.37926176,0.6189806,0.000012999678],"about_ca_topic_score_codex":0.000854916,"about_ca_topic_score_gemma":0.0010531879,"teacher_disagreement_score":0.049056012,"about_ca_system_score_codex":0.0022080252,"about_ca_system_score_gemma":0.0009187344,"threshold_uncertainty_score":0.1641087},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14236802,0.000484328,0.8192343,0.00034703795,0.00019195584,0.00018358017,0.0007759076,0.0010542334,0.03536058],"genre_scores_gemma":[0.72868574,0.0007678584,0.22423643,0.00019316249,0.00010600625,0.00016760656,0.0017205782,0.00033304817,0.043789633],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996408,0.000063847896,0.000026310223,0.000080710844,0.000112950176,0.00007526623],"domain_scores_gemma":[0.99935585,0.00016224795,0.00005632296,0.00020881642,0.00012702214,0.000089782814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003371146,0.00044190936,0.00045554905,0.00082409254,0.0005995636,0.00094210147,0.0007101,0.0005176949,0.009411247],"category_scores_gemma":[0.001303908,0.00023653825,0.0003285019,0.00085813657,0.0005487642,0.0016691032,0.002219807,0.00064227916,0.001398545],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044369206,0.0000959475,0.00088544405,0.00021124209,0.00005498201,0.0004475861,0.00031927705,0.34057832,0.02127621,0.4460213,0.009871713,0.17979418],"study_design_scores_gemma":[0.0000366819,0.00014339018,0.00030477374,0.000041498985,0.0000147893,0.000147866,0.0001400102,0.5678231,0.008929414,0.39889136,0.023510115,0.00001698578],"about_ca_topic_score_codex":0.0011866569,"about_ca_topic_score_gemma":0.00155037,"teacher_disagreement_score":0.009411247,"about_ca_system_score_codex":0.0004837405,"about_ca_system_score_gemma":0.00036154507,"threshold_uncertainty_score":0.03148377},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005883975,0.00009868422,0.99294657,0.00008595743,0.000058163587,0.00002903899,0.00004255899,0.000252386,0.0006026417],"genre_scores_gemma":[0.15335728,0.0004459959,0.8412879,0.00016842716,0.0000910714,0.00010902616,0.00034640578,0.0004029389,0.0037909255],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99947673,0.00012291966,0.000028712897,0.00008279017,0.00025880156,0.000030058078],"domain_scores_gemma":[0.99855775,0.00062335253,0.00013333432,0.00038960017,0.00024581398,0.00005014186],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009967383,0.0008092279,0.00071728637,0.0009103973,0.0002685443,0.0011501603,0.0015029123,0.0018759177,0.0019027601],"category_scores_gemma":[0.004537329,0.0008328291,0.00068885554,0.00094198034,0.0008204452,0.0012613336,0.0015200119,0.0015771316,0.00069731165],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046756546,0.00013251377,0.0014248264,0.00038947034,0.00013381841,0.00030970838,0.00028028295,0.50667894,0.07732928,0.024516197,0.00829322,0.38004422],"study_design_scores_gemma":[0.000010293814,0.0000155961,0.00013150698,0.0000070350643,0.0000071175846,0.00005068866,0.000013760832,0.99189574,0.003525941,0.0031528794,0.0011806854,0.000008782943],"about_ca_topic_score_codex":0.0017775758,"about_ca_topic_score_gemma":0.0022221399,"teacher_disagreement_score":0.0019027601,"about_ca_system_score_codex":0.00025601644,"about_ca_system_score_gemma":0.0006449386,"threshold_uncertainty_score":0.006365359},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007623599,0.0005005462,0.98512393,0.00035624197,0.00011427701,0.00007657371,0.0001833044,0.00033225486,0.00568929],"genre_scores_gemma":[0.41045058,0.0019429903,0.55840075,0.00044583864,0.0002381058,0.0004556297,0.000973602,0.0006024148,0.026490167],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983485,0.00044358513,0.000106756226,0.00043863026,0.00048035174,0.00018226767],"domain_scores_gemma":[0.9978835,0.00092954113,0.00017549911,0.0002541413,0.00067011104,0.000087303946],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019474418,0.0016608111,0.0015496727,0.0010496291,0.0011881153,0.0027777888,0.0026965176,0.0017031602,0.0095816],"category_scores_gemma":[0.0061647603,0.00091337226,0.0017193232,0.001507267,0.0011618851,0.0026352985,0.002002808,0.002297645,0.0017674908],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035632364,0.00014175157,0.0024059152,0.0011937852,0.0001507436,0.00028850065,0.0004934507,0.69846845,0.018869795,0.062377837,0.008477093,0.20677643],"study_design_scores_gemma":[0.000023278706,0.00016258402,0.0006303989,0.000054888358,0.000044237233,0.0001677309,0.00014579443,0.96373814,0.004424888,0.018631216,0.01193622,0.000040578114],"about_ca_topic_score_codex":0.012291607,"about_ca_topic_score_gemma":0.010968848,"teacher_disagreement_score":0.012291607,"about_ca_system_score_codex":0.0018223209,"about_ca_system_score_gemma":0.0028338633,"threshold_uncertainty_score":0.03205365},"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":"editorial","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00031232813,0.014373625,0.0012956084,0.028566308,0.8552599,0.00013196829,0.00090536324,0.0008080469,0.09834681],"genre_scores_gemma":[0.0028696524,0.019285856,0.001386127,0.012262354,0.38109028,0.00012312928,0.0011467448,0.00090041955,0.5809354],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99773324,0.00016111265,0.00020333593,0.00032062808,0.0013937549,0.00018789314],"domain_scores_gemma":[0.9853302,0.001374357,0.00061773945,0.0007240198,0.009278087,0.00267558],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.002276371,0.0017718357,0.001668647,0.0038936054,0.0017572698,0.0068838364,0.0019584498,0.002494336,0.3057856],"category_scores_gemma":[0.012759386,0.00055472704,0.0011972721,0.002209811,0.0006320806,0.0040634493,0.0024037277,0.0036367418,0.30372792],"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.000009523113,0.00000676192,0.000025884874,0.00009113762,0.0000016724609,0.000022407987,0.000009810877,0.00001621757,0.00006968591,0.00034800015,0.97715354,0.022245461],"study_design_scores_gemma":[0.0000032873857,0.000010274545,0.00008617125,0.00010461921,0.0000027541578,0.000071380375,0.000019843403,0.000023952862,0.00007216588,0.00036613768,0.9992353,0.0000041526096],"about_ca_topic_score_codex":0.00078398176,"about_ca_topic_score_gemma":0.0016854769,"teacher_disagreement_score":0.6942144,"about_ca_system_score_codex":0.0012409129,"about_ca_system_score_gemma":0.0020281496,"threshold_uncertainty_score":0.9902126},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031317,0.00036490997,0.9296327,0.0003863963,0.00029374813,0.00024339108,0.00031027582,0.0017655472,0.035685975],"genre_scores_gemma":[0.16678056,0.0005096246,0.8040014,0.0001575077,0.00007461454,0.00016705909,0.00068438484,0.00061993726,0.027004907],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999215,0.00007278023,0.000054440883,0.00020351213,0.0003785193,0.000075753414],"domain_scores_gemma":[0.9994679,0.00014330319,0.000051993913,0.0001695419,0.000116872354,0.000050452512],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037984343,0.0005537645,0.0004783415,0.0011060728,0.00061322254,0.0013927725,0.00077658443,0.00084094505,0.018020732],"category_scores_gemma":[0.0014578355,0.0005066248,0.0008633137,0.0011042278,0.0007809753,0.0010905099,0.001695059,0.0011311097,0.0048544467],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00056943,0.00018397298,0.0016155083,0.0005810322,0.00008029569,0.0010406848,0.0007692215,0.08426328,0.08953938,0.07624123,0.020914292,0.7242016],"study_design_scores_gemma":[0.00022531662,0.0012947577,0.0022358524,0.0003449641,0.000108462824,0.0022363495,0.00068239874,0.4691801,0.09495002,0.06881261,0.35981354,0.00011566758],"about_ca_topic_score_codex":0.0009842447,"about_ca_topic_score_gemma":0.0011185702,"teacher_disagreement_score":0.018020732,"about_ca_system_score_codex":0.0004126384,"about_ca_system_score_gemma":0.00050360843,"threshold_uncertainty_score":0.06028533},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029451568,0.0057069995,0.09109542,0.0003733286,0.0014872187,0.000068135465,0.0006210734,0.0011933533,0.8965093],"genre_scores_gemma":[0.0409125,0.010075984,0.060496595,0.0004378071,0.00085491297,0.00014116635,0.002643992,0.0013858296,0.88305134],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99975497,0.00001956024,0.0000111486415,0.00006648721,0.00012689654,0.00002091052],"domain_scores_gemma":[0.9999007,0.000015865446,0.000005731919,0.000028370228,0.00003304001,0.000016263786],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015113688,0.0010106706,0.0006392566,0.001558878,0.0006755988,0.002140358,0.000940054,0.0005469535,0.10580728],"category_scores_gemma":[0.00043853084,0.00037907652,0.0004031851,0.0016474796,0.00097221404,0.0023885383,0.0020811646,0.0015762495,0.051191702],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019494433,0.00002496762,0.000076661105,0.00020400173,0.000007969733,0.000067027235,0.00017152933,0.0018391614,0.0023709354,0.5358351,0.09563923,0.36374393],"study_design_scores_gemma":[0.0000038341145,0.000022436237,0.000137138,0.00010185188,0.000005735452,0.00027295802,0.00006519875,0.0014916551,0.0011597074,0.20764433,0.7890857,0.000009519654],"about_ca_topic_score_codex":0.0004112882,"about_ca_topic_score_gemma":0.0009482283,"teacher_disagreement_score":0.10580728,"about_ca_system_score_codex":0.00045674518,"about_ca_system_score_gemma":0.0005021445,"threshold_uncertainty_score":0.35396057},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0062045236,0.020329734,0.13897252,0.0024686398,0.0019310323,0.000051397754,0.0012689013,0.0005892425,0.828184],"genre_scores_gemma":[0.15850748,0.021589551,0.062034402,0.0008724705,0.0019011899,0.00022343616,0.0020264674,0.00079783273,0.7520472],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99957436,0.00007307101,0.000021320659,0.00008775348,0.00021593396,0.000027515069],"domain_scores_gemma":[0.99976176,0.000052473035,0.000016841046,0.000052774245,0.00008383903,0.0000324455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000364738,0.0016309811,0.0010144897,0.0024792408,0.0011739458,0.0033855864,0.0008835281,0.00072747516,0.025225798],"category_scores_gemma":[0.0007819862,0.00047718678,0.0004206959,0.003308928,0.0020017533,0.0036471998,0.0015646293,0.0023749606,0.010329513],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000036873532,0.000006859585,0.00003438891,0.00005759004,0.000005325322,0.00001919839,0.00013453908,0.00030517997,0.00028077708,0.93996376,0.027603278,0.031585492],"study_design_scores_gemma":[0.000003576888,0.000011720383,0.00015521706,0.000042998472,0.000007834682,0.00015510785,0.000089615314,0.0012061751,0.00034778746,0.660685,0.33728495,0.000010067915],"about_ca_topic_score_codex":0.0015041542,"about_ca_topic_score_gemma":0.001784281,"teacher_disagreement_score":0.025225798,"about_ca_system_score_codex":0.0014980421,"about_ca_system_score_gemma":0.00067266397,"threshold_uncertainty_score":0.08438867},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013050921,0.0021917117,0.9255947,0.00069336616,0.00013681148,0.00024968016,0.0007771764,0.0059434464,0.05136215],"genre_scores_gemma":[0.06279693,0.0023586664,0.91239184,0.0002768121,0.00010639781,0.0003256672,0.002499493,0.0013859903,0.017858142],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992699,0.000080991806,0.00004589437,0.00021404923,0.00024585958,0.00014331825],"domain_scores_gemma":[0.99864405,0.0006683632,0.00011109781,0.0003617371,0.0001723239,0.0000423465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039472178,0.0018674219,0.0008039591,0.0012495463,0.0008203807,0.0018281005,0.0027872836,0.0011089905,0.022945493],"category_scores_gemma":[0.002784511,0.00087230396,0.0013010008,0.002859737,0.0009535181,0.0058574253,0.0019104679,0.0023332338,0.008045356],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024003431,0.00030415697,0.0006954212,0.0011406752,0.000053432115,0.000093868446,0.00034260485,0.070988886,0.013298052,0.2077374,0.05033645,0.654769],"study_design_scores_gemma":[0.0001823593,0.00012848205,0.0007189791,0.0001730718,0.00006196642,0.00036152158,0.000188879,0.35571682,0.016578102,0.54124737,0.0845965,0.00004590204],"about_ca_topic_score_codex":0.0028318982,"about_ca_topic_score_gemma":0.0036292938,"teacher_disagreement_score":0.022945493,"about_ca_system_score_codex":0.0021231722,"about_ca_system_score_gemma":0.0013419982,"threshold_uncertainty_score":0.07676035},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016116471,0.020857722,0.0029100035,0.19418883,0.3779455,0.00008311185,0.0012369632,0.0018160008,0.39935017],"genre_scores_gemma":[0.0066407095,0.007200988,0.0009983062,0.0475965,0.05201471,0.000037667127,0.0009244427,0.0006544776,0.88393223],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99795026,0.00020794981,0.00007740819,0.00024976305,0.0011802254,0.00033436753],"domain_scores_gemma":[0.9941048,0.0010814625,0.00025984942,0.0009332027,0.0019996348,0.0016209473],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023173508,0.0011144489,0.00083628873,0.0023111273,0.002113526,0.007649127,0.0015128462,0.0045980215,0.20164113],"category_scores_gemma":[0.009718227,0.0005083714,0.00075035513,0.0015685405,0.001717903,0.005398506,0.0031714477,0.0067469133,0.13858348],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027927626,0.000008112495,0.000034323963,0.00003473823,0.0000022170716,0.000041690968,0.000016786542,0.000020637344,0.00012840315,0.0025726394,0.972973,0.024139524],"study_design_scores_gemma":[0.0000053319573,0.0000093319695,0.000090248,0.000041366413,0.0000018809425,0.000034144858,0.00003857543,0.000037987513,0.00008772742,0.0018790698,0.99777114,0.0000032311225],"about_ca_topic_score_codex":0.0019212753,"about_ca_topic_score_gemma":0.0052243196,"teacher_disagreement_score":0.20164113,"about_ca_system_score_codex":0.0015315016,"about_ca_system_score_gemma":0.0016645518,"threshold_uncertainty_score":0.67455673},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6807556,0.0004207953,0.18531305,0.00028170526,0.00015864338,0.00014902129,0.0014191173,0.0008863408,0.13061564],"genre_scores_gemma":[0.8669249,0.00047015067,0.078314826,0.000099798315,0.0000519154,0.00012171699,0.0022879066,0.00019868494,0.05153009],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996542,0.000023119172,0.00001557401,0.00009871412,0.00012380295,0.00008451651],"domain_scores_gemma":[0.99972075,0.000045406254,0.0000555359,0.000059302813,0.0000606802,0.000058267597],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010027845,0.00037154462,0.00046073634,0.0008609827,0.0005737626,0.0009156539,0.0005511257,0.00046405353,0.015234909],"category_scores_gemma":[0.0006975799,0.00030746273,0.0003009995,0.00081434805,0.00047485836,0.00097114895,0.0015094358,0.0006902036,0.0035014483],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00061432784,0.00019246506,0.0067029824,0.00036644447,0.00007727117,0.0015918094,0.00095500494,0.071377955,0.054764524,0.6021353,0.013017247,0.2482047],"study_design_scores_gemma":[0.00016955029,0.00048064906,0.007702089,0.00015464371,0.000057547397,0.002744301,0.0011658273,0.15973926,0.051150206,0.6097394,0.1668107,0.00008591653],"about_ca_topic_score_codex":0.00069571304,"about_ca_topic_score_gemma":0.0010637606,"teacher_disagreement_score":0.015234909,"about_ca_system_score_codex":0.0002780755,"about_ca_system_score_gemma":0.00026184783,"threshold_uncertainty_score":0.050965905},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00039101276,0.013336784,0.0067568,0.005722807,0.014174001,0.00012879311,0.01344668,0.0016023192,0.9444408],"genre_scores_gemma":[0.0013698534,0.0058228043,0.0030829613,0.0017668739,0.0010863657,0.00006931432,0.00907561,0.0008571519,0.97686905],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.999226,0.000078789904,0.000036343536,0.000096277145,0.0005066849,0.000055916298],"domain_scores_gemma":[0.9985195,0.00025909155,0.00004918084,0.00020487385,0.00084212597,0.00012528502],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0006840423,0.0008405861,0.0008085176,0.0061237994,0.0013135456,0.0026098408,0.0017951047,0.0012147208,0.54768527],"category_scores_gemma":[0.0047294083,0.0002917086,0.0005921518,0.0062009688,0.0004195609,0.0025631923,0.0016912677,0.0013377991,0.53084695],"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.000007914767,0.000013192303,0.000054165615,0.00012365296,0.0000020048626,0.000023494691,0.000028036318,0.0000814412,0.000069591624,0.0060214475,0.9126343,0.0809407],"study_design_scores_gemma":[0.0000010795678,0.0000018309212,0.00007309984,0.00010183413,0.0000018251925,0.000023692988,0.000018278168,0.000026084741,0.00006255865,0.0023503317,0.9973363,0.0000029059684],"about_ca_topic_score_codex":0.0089566475,"about_ca_topic_score_gemma":0.01822147,"teacher_disagreement_score":0.45231473,"about_ca_system_score_codex":0.0016232312,"about_ca_system_score_gemma":0.0018832855,"threshold_uncertainty_score":0},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013214194,0.00043949796,0.9750611,0.00090095395,0.00015955725,0.00024006874,0.0018241188,0.005961315,0.0021991753],"genre_scores_gemma":[0.18882567,0.00037991154,0.7975419,0.000534906,0.00022482628,0.0012316215,0.006239123,0.0008282258,0.0041937814],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99640876,0.00046524475,0.00043010482,0.00073558616,0.0016079686,0.00035233883],"domain_scores_gemma":[0.9918527,0.001865526,0.000673527,0.004312178,0.00086896354,0.00042714938],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017281306,0.000980309,0.00239216,0.0020832522,0.0021022323,0.0028448368,0.0061737145,0.0020666893,0.00750082],"category_scores_gemma":[0.011663027,0.0013028571,0.0016140437,0.004966989,0.0018863452,0.008303378,0.008064879,0.0029710722,0.0033760236],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019431335,0.0008848081,0.004181194,0.0006688155,0.00017551819,0.00042051895,0.00065758306,0.18888898,0.026697109,0.20640811,0.06328851,0.50578564],"study_design_scores_gemma":[0.0004021287,0.00044840292,0.0005370597,0.00006411768,0.000059897826,0.00040905338,0.00016063049,0.8215416,0.014551489,0.12394663,0.03774539,0.0001335866],"about_ca_topic_score_codex":0.0029665725,"about_ca_topic_score_gemma":0.0039433218,"teacher_disagreement_score":0.00750082,"about_ca_system_score_codex":0.002021526,"about_ca_system_score_gemma":0.0026107172,"threshold_uncertainty_score":0.02509278},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028200487,0.009988207,0.11610781,0.006984493,0.0035286283,0.00004632998,0.0007092747,0.00063178246,0.83380306],"genre_scores_gemma":[0.51198447,0.015220765,0.057940193,0.0042018523,0.0059714816,0.00015934864,0.0012441908,0.0014703837,0.40180743],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996606,0.000040870404,0.00001276652,0.00011011565,0.0001378457,0.000037824324],"domain_scores_gemma":[0.99943715,0.0002380755,0.000043031596,0.00014270934,0.00009473323,0.00004430316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027101403,0.00035741655,0.00036674738,0.00069038686,0.0012056798,0.0028204918,0.0006404064,0.0006293803,0.01765068],"category_scores_gemma":[0.0020372313,0.00038534275,0.00049927225,0.00075533544,0.0021347762,0.0032602048,0.0011445654,0.001615625,0.004026773],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020089508,0.0000075181206,0.0001478023,0.00007455322,0.000004773333,0.00012806713,0.00012357073,0.00051778427,0.000843618,0.9300217,0.037799053,0.030311491],"study_design_scores_gemma":[0.000006199768,0.000012338085,0.00029907812,0.000028729317,0.0000068286217,0.0004623942,0.00006759466,0.001077271,0.00092633354,0.8214727,0.1756338,0.00000670411],"about_ca_topic_score_codex":0.00092363765,"about_ca_topic_score_gemma":0.000850652,"teacher_disagreement_score":0.01765068,"about_ca_system_score_codex":0.00071885955,"about_ca_system_score_gemma":0.00029143618,"threshold_uncertainty_score":0.05904746},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.061170693,0.0004895338,0.9274456,0.0005786981,0.0002308551,0.00020700372,0.00040560256,0.001912579,0.0075594108],"genre_scores_gemma":[0.24531679,0.00027598985,0.7459339,0.0002461463,0.00016441505,0.0003369841,0.0011987183,0.00047207047,0.006054947],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993299,0.00012683593,0.000050499457,0.00014432817,0.00023237217,0.00011601961],"domain_scores_gemma":[0.998089,0.00089524646,0.00010552218,0.00043046623,0.00028657354,0.0001931433],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010999475,0.0010569189,0.0015042516,0.00088174274,0.0008594561,0.0012708518,0.0026378315,0.0012313912,0.0070062433],"category_scores_gemma":[0.0055390904,0.00063471106,0.0008667252,0.0015907708,0.00085195067,0.002726402,0.0029696007,0.0017025985,0.0012032675],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015698095,0.00045358037,0.0018733304,0.00047440027,0.00011506289,0.00017934867,0.00034130804,0.40109527,0.013889315,0.09615343,0.027464112,0.4563911],"study_design_scores_gemma":[0.000114800125,0.00008057671,0.00013228644,0.000014838745,0.000012183166,0.000044513497,0.00004426661,0.9432429,0.00113038,0.05355943,0.0016154958,0.000008299463],"about_ca_topic_score_codex":0.0035237952,"about_ca_topic_score_gemma":0.0054745763,"teacher_disagreement_score":0.0070062433,"about_ca_system_score_codex":0.0010635463,"about_ca_system_score_gemma":0.0019201356,"threshold_uncertainty_score":0.023438275},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2438231,0.006920542,0.5887644,0.017277485,0.00131008,0.00029640875,0.0017995358,0.0007131693,0.13909534],"genre_scores_gemma":[0.59131056,0.0051843454,0.31981784,0.0021026656,0.0011681543,0.00036025202,0.004529275,0.00038431445,0.075142615],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999206,0.0002532792,0.000044502503,0.00018393356,0.00020825375,0.00010408652],"domain_scores_gemma":[0.99744534,0.0016143109,0.00028016037,0.00025554426,0.00016506968,0.00023960507],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078724494,0.00096294575,0.0009544811,0.000906628,0.0021201465,0.0018050581,0.0014048083,0.0037928445,0.012990547],"category_scores_gemma":[0.007221426,0.00044623943,0.0011793262,0.0023249593,0.0022093009,0.0048625534,0.0021964847,0.0027929621,0.0010848246],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025766014,0.00021691697,0.0014401025,0.0005876749,0.000057846373,0.0007746945,0.0009129424,0.09000832,0.002028872,0.757581,0.04608633,0.10004762],"study_design_scores_gemma":[0.0001463858,0.00011678254,0.0011247968,0.00013121201,0.000029944138,0.0010879595,0.001013241,0.1139167,0.0014510021,0.77695197,0.10396982,0.00006011031],"about_ca_topic_score_codex":0.0022402916,"about_ca_topic_score_gemma":0.0018479502,"teacher_disagreement_score":0.012990547,"about_ca_system_score_codex":0.00085836306,"about_ca_system_score_gemma":0.000583776,"threshold_uncertainty_score":0.043457687},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11137842,0.036210075,0.521315,0.008768134,0.028208578,0.00014735702,0.0012215703,0.0012314683,0.29151946],"genre_scores_gemma":[0.54074794,0.018699557,0.12289909,0.002551932,0.008051393,0.00015653206,0.0025921855,0.0021526157,0.30214864],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99969184,0.00005261583,0.000021041664,0.00010150869,0.00007898006,0.00005392572],"domain_scores_gemma":[0.99966323,0.00009273204,0.000033426066,0.000080396916,0.00007850712,0.000051767107],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038697204,0.0007216893,0.00074058183,0.0011646143,0.0011103823,0.0019476595,0.00076910533,0.0008728631,0.024201082],"category_scores_gemma":[0.0018683838,0.0003987135,0.00069665676,0.0009755209,0.0015597905,0.0032740298,0.002268267,0.0015748927,0.0033390247],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007210996,0.000034276847,0.0003251083,0.0001624335,0.000022385582,0.00010163074,0.0002687127,0.0057274587,0.0020382472,0.83121324,0.032968577,0.12706575],"study_design_scores_gemma":[0.000010136437,0.00003523707,0.00037557704,0.000080735954,0.00002385583,0.00020598783,0.00017516772,0.007103948,0.0016279749,0.8721227,0.11821514,0.000023487415],"about_ca_topic_score_codex":0.0006584269,"about_ca_topic_score_gemma":0.0011673282,"teacher_disagreement_score":0.024201082,"about_ca_system_score_codex":0.00045565044,"about_ca_system_score_gemma":0.00036931896,"threshold_uncertainty_score":0.08096075},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002463941,0.0013212244,0.79263645,0.00036341362,0.0009187331,0.00011417947,0.0011503643,0.003820001,0.19721161],"genre_scores_gemma":[0.08968882,0.0033517391,0.5900657,0.00040451076,0.00039563014,0.00034830626,0.006410226,0.004428897,0.30490613],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99950266,0.000030946547,0.000021369488,0.000104941835,0.00030708872,0.00003302875],"domain_scores_gemma":[0.99965787,0.000043453867,0.000009156763,0.00014510489,0.00012386944,0.00002055389],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028052452,0.0011083527,0.0013623344,0.0011434496,0.0009709492,0.0019828896,0.0017370749,0.0006958453,0.083676144],"category_scores_gemma":[0.00091347366,0.00074333407,0.0011282316,0.0015833994,0.0006981209,0.0014019955,0.002038455,0.0017056875,0.03672273],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006797955,0.00006152702,0.00024241734,0.00029414074,0.000040756524,0.000057367757,0.000070014954,0.04031252,0.0054501886,0.18812443,0.11232437,0.6529543],"study_design_scores_gemma":[0.000049227772,0.000048849386,0.0004613643,0.00015373246,0.000040817093,0.00025362492,0.00006670905,0.22264859,0.00886871,0.21995862,0.54741347,0.00003633735],"about_ca_topic_score_codex":0.0020805518,"about_ca_topic_score_gemma":0.0031599654,"teacher_disagreement_score":0.083676144,"about_ca_system_score_codex":0.00058682717,"about_ca_system_score_gemma":0.00083965034,"threshold_uncertainty_score":0.27992457},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91074383,0.00032952204,0.06718491,0.000113429094,0.0000680965,0.000035732028,0.000106059786,0.00025754704,0.02116096],"genre_scores_gemma":[0.9861979,0.00014198647,0.01123409,0.000028720935,0.000020660731,0.000044145254,0.0001597565,0.000054844226,0.0021179137],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995883,0.00006663571,0.000025568706,0.00009389795,0.00013126375,0.00009426465],"domain_scores_gemma":[0.99824655,0.0006118821,0.00032549136,0.00016577405,0.0002637021,0.00038664468],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005187757,0.0003270507,0.00029812838,0.0019399602,0.00090548064,0.001313829,0.00051503244,0.00043906772,0.0029486988],"category_scores_gemma":[0.0035980395,0.00028017786,0.00030769847,0.0006279818,0.0012333427,0.000962352,0.0007924768,0.0007667529,0.00026437166],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004739969,0.000098643264,0.006745359,0.00019374494,0.000037264075,0.000971238,0.0012377435,0.04944775,0.06181704,0.84461343,0.0025127481,0.03185098],"study_design_scores_gemma":[0.000066645356,0.00045261567,0.010225851,0.00015708472,0.00008183076,0.0020584094,0.0010801734,0.20403601,0.048862033,0.7143509,0.018531995,0.000096424425],"about_ca_topic_score_codex":0.00045183173,"about_ca_topic_score_gemma":0.00040933272,"teacher_disagreement_score":0.0029486988,"about_ca_system_score_codex":0.00086634327,"about_ca_system_score_gemma":0.00027901906,"threshold_uncertainty_score":0.00986439},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019405772,0.0010735589,0.99189514,0.00071595033,0.00044359863,0.000027067445,0.00006234053,0.0005032975,0.0033384892],"genre_scores_gemma":[0.08142922,0.0026696734,0.90801334,0.0006565029,0.0008253524,0.00019780923,0.00035130503,0.0004601391,0.005396629],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977653,0.0006386144,0.00016707127,0.00027191086,0.0009733942,0.00018365278],"domain_scores_gemma":[0.9973807,0.0016156355,0.00010044058,0.0005267515,0.00033067138,0.00004580079],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001771883,0.00090568425,0.0009870158,0.00071223825,0.0010472314,0.0016725775,0.002027399,0.00086175546,0.003623961],"category_scores_gemma":[0.0068590534,0.0007470637,0.0010252574,0.0020370753,0.0013739988,0.0037285679,0.0019758635,0.0021321685,0.0015506698],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002886378,0.000050694696,0.0005731507,0.000360442,0.0000842847,0.0002483092,0.00016757601,0.25126848,0.00559416,0.52578896,0.027010642,0.18856467],"study_design_scores_gemma":[0.000079749196,0.00006727953,0.00024553473,0.000052140684,0.000040978142,0.00021626432,0.000041052346,0.640131,0.0077926065,0.2672245,0.084050104,0.000058815032],"about_ca_topic_score_codex":0.004604114,"about_ca_topic_score_gemma":0.0047753835,"teacher_disagreement_score":0.004604114,"about_ca_system_score_codex":0.0014832132,"about_ca_system_score_gemma":0.0014115282,"threshold_uncertainty_score":0.012123346},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005308732,0.0023602578,0.9688157,0.00033420132,0.00016959483,0.000057312132,0.00031378848,0.0005811019,0.022059267],"genre_scores_gemma":[0.30312687,0.0047187954,0.6578045,0.00017009393,0.00029186913,0.00029429677,0.0010952041,0.00033003424,0.03216824],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99967647,0.000082060425,0.0000148672525,0.000052319956,0.00014996203,0.00002431153],"domain_scores_gemma":[0.9996679,0.00014627485,0.000027070695,0.00007296204,0.000068852816,0.000017006989],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026744916,0.00041374503,0.0004447974,0.00093302975,0.00037161526,0.0010655264,0.0006067655,0.0003850365,0.008182869],"category_scores_gemma":[0.0018141147,0.0002591286,0.00034516092,0.0012004995,0.00049189833,0.0011193063,0.0008893382,0.0007534134,0.001749199],"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.000053230953,0.000019396799,0.00026142463,0.00015643268,0.000026526292,0.000065326676,0.00008097206,0.12642394,0.0024209262,0.639061,0.012124426,0.21930644],"study_design_scores_gemma":[0.000023099854,0.000016319813,0.0001427524,0.000035454465,0.000007824055,0.00009042847,0.000030613253,0.29420286,0.0010915955,0.64060074,0.06374975,0.00000858143],"about_ca_topic_score_codex":0.0017574012,"about_ca_topic_score_gemma":0.0032228134,"teacher_disagreement_score":0.008182869,"about_ca_system_score_codex":0.0007784631,"about_ca_system_score_gemma":0.0006448335,"threshold_uncertainty_score":0.027374446},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4708324,0.0038332315,0.18207866,0.0012119589,0.00071116514,0.00020932876,0.0013308164,0.0003806696,0.3394118],"genre_scores_gemma":[0.9150492,0.0011130816,0.040894765,0.00017573625,0.00017981246,0.000086582324,0.00082556583,0.000083510895,0.041591946],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99961406,0.00005055348,0.000030145518,0.00008529741,0.00014540633,0.00007454843],"domain_scores_gemma":[0.9997466,0.000035069676,0.000060470215,0.00003650988,0.000058184367,0.00006324551],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002203608,0.00052156294,0.00025815307,0.0014254411,0.0010805618,0.0034962264,0.0005350757,0.00045212338,0.007469087],"category_scores_gemma":[0.00085661944,0.00023346752,0.00039425245,0.001054982,0.0020254296,0.0024173362,0.0016552277,0.0008387987,0.0012610098],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024739848,0.00001102348,0.00045266165,0.00003585398,0.0000043068067,0.00009841165,0.00034294673,0.0015627651,0.0018633169,0.98259187,0.0018639496,0.0111481],"study_design_scores_gemma":[0.00001113868,0.00006738305,0.0012009413,0.000034012017,0.000010530263,0.0006390444,0.00085759285,0.012320657,0.003446112,0.92082226,0.060565162,0.000025144123],"about_ca_topic_score_codex":0.0012310816,"about_ca_topic_score_gemma":0.0008705275,"teacher_disagreement_score":0.007469087,"about_ca_system_score_codex":0.0009155135,"about_ca_system_score_gemma":0.00037801935,"threshold_uncertainty_score":0.024986565},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0050629415,0.00009783102,0.968779,0.00009474116,0.000070035996,0.00005658996,0.0002660109,0.0029318128,0.022641018],"genre_scores_gemma":[0.15656182,0.0005983585,0.80206305,0.00016355248,0.00006450844,0.0001644192,0.0015377213,0.0020743927,0.036772177],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995585,0.000041335014,0.000017840859,0.00007172506,0.00026485822,0.000045623365],"domain_scores_gemma":[0.99964046,0.00009052718,0.000017417307,0.00013916216,0.00008275564,0.000029776636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031682028,0.0009989281,0.0007455908,0.0009830175,0.00041835196,0.0014500177,0.0018861262,0.00080659194,0.023560544],"category_scores_gemma":[0.0010882377,0.0007828052,0.000724341,0.0011939616,0.00065672793,0.001583483,0.002431749,0.0011353884,0.0041056746],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000131938,0.000080287326,0.0003682202,0.00022362926,0.000056417528,0.00016076842,0.00021529816,0.1444105,0.026144907,0.13270769,0.038262703,0.65723765],"study_design_scores_gemma":[0.000031638127,0.000044267214,0.00028885677,0.00005083457,0.000022909155,0.000346427,0.00006635132,0.8178869,0.016280664,0.09028858,0.07465173,0.000040773906],"about_ca_topic_score_codex":0.0021181693,"about_ca_topic_score_gemma":0.004364847,"teacher_disagreement_score":0.023560544,"about_ca_system_score_codex":0.00037974623,"about_ca_system_score_gemma":0.00047394534,"threshold_uncertainty_score":0.078817904},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006494826,0.017943854,0.003427635,0.07315236,0.37612918,0.00028242293,0.0027219509,0.0011273928,0.52456576],"genre_scores_gemma":[0.0018441378,0.0038721566,0.0007408728,0.0147420475,0.03188979,0.000121245794,0.0012919813,0.00049745635,0.9450004],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992036,0.00009486648,0.000046870326,0.00012629307,0.00043460823,0.00009373623],"domain_scores_gemma":[0.996813,0.00041215128,0.00014751875,0.00022561078,0.0017033562,0.0006984509],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00102124,0.0009156813,0.00083569804,0.0019592256,0.0016676077,0.003531316,0.0011771101,0.0021843757,0.40884963],"category_scores_gemma":[0.0070519396,0.00024409407,0.0005804509,0.0011319062,0.0005441147,0.0025024298,0.0022356831,0.0027611337,0.42026567],"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.000013737373,0.000008123971,0.000027117248,0.00005325862,0.0000012132298,0.00001939713,0.000010772608,0.0000108217555,0.00007892311,0.001792693,0.96520543,0.032778475],"study_design_scores_gemma":[0.000003294057,0.0000072552407,0.00008042719,0.00006126939,0.0000014708196,0.0000392848,0.000015159094,0.000014957886,0.00006523637,0.0010933023,0.99861586,0.0000024781232],"about_ca_topic_score_codex":0.0017955849,"about_ca_topic_score_gemma":0.003069996,"teacher_disagreement_score":0.5911504,"about_ca_system_score_codex":0.0013226874,"about_ca_system_score_gemma":0.0020105985,"threshold_uncertainty_score":0},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05286727,0.0003874056,0.93915397,0.00027214008,0.00004166683,0.000082489074,0.00016131319,0.0030862594,0.00394745],"genre_scores_gemma":[0.604787,0.00022848189,0.3897744,0.0002143482,0.0000381022,0.00019589714,0.0004899197,0.00049658254,0.003775298],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998777,0.0002375043,0.000100674944,0.00026952446,0.00041000408,0.00020526057],"domain_scores_gemma":[0.99677485,0.0009907883,0.00027344163,0.0015439681,0.00032994084,0.00008703662],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010157963,0.0006806763,0.0008821091,0.0006556004,0.0009318463,0.0014553332,0.0022885348,0.0008062864,0.0028641257],"category_scores_gemma":[0.005961953,0.00048114106,0.00061330793,0.00089346565,0.0010412455,0.002751228,0.0031631615,0.0011472425,0.0010487629],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014502945,0.00014316726,0.0022642028,0.00043259785,0.00009119856,0.000207958,0.00064093026,0.3754578,0.051338512,0.12710723,0.01178432,0.42908183],"study_design_scores_gemma":[0.00013319026,0.00023257274,0.00040497672,0.00003093231,0.000052271287,0.00017275101,0.000116675335,0.8742632,0.036051422,0.081085816,0.007414321,0.000041936637],"about_ca_topic_score_codex":0.0017544032,"about_ca_topic_score_gemma":0.0029691588,"teacher_disagreement_score":0.0028641257,"about_ca_system_score_codex":0.001357755,"about_ca_system_score_gemma":0.0010316058,"threshold_uncertainty_score":0.009851217},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05517216,0.000061505954,0.9390229,0.00006411932,0.00003300507,0.000049966045,0.000069363974,0.0016976591,0.0038293463],"genre_scores_gemma":[0.6365059,0.00007309067,0.3609991,0.000052664967,0.000011702439,0.000059438447,0.00019822075,0.00041313778,0.0016867035],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99895704,0.00014610699,0.00004653074,0.000111207475,0.00062930427,0.00010985717],"domain_scores_gemma":[0.9982773,0.00070351193,0.00014923418,0.00052041915,0.00027999803,0.00006952309],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078358134,0.0005369057,0.00071952894,0.0005449581,0.0004229812,0.0010986751,0.0014204126,0.00073755713,0.0032076172],"category_scores_gemma":[0.0049762786,0.00035089976,0.00040302926,0.00038734742,0.0010559829,0.0010785337,0.0022785813,0.00085222395,0.0006216754],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003681811,0.00010853763,0.005236513,0.00025291,0.00004138817,0.00033836707,0.0005035079,0.69208324,0.057000786,0.083111204,0.0028321755,0.15812312],"study_design_scores_gemma":[0.00001559967,0.000046820864,0.00021333827,0.000008387053,0.000004072904,0.00007284849,0.000038713824,0.97992295,0.010763661,0.007109394,0.0017910356,0.000013281253],"about_ca_topic_score_codex":0.001352921,"about_ca_topic_score_gemma":0.0014070495,"teacher_disagreement_score":0.0032076172,"about_ca_system_score_codex":0.0005720458,"about_ca_system_score_gemma":0.00093710696,"threshold_uncertainty_score":0.010730565},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030054512,0.00008829161,0.9609537,0.00011374641,0.000070420545,0.000109994966,0.00017582528,0.0017988761,0.00663458],"genre_scores_gemma":[0.21099344,0.00021110944,0.7800451,0.000084495936,0.000026391988,0.00013370096,0.00070335396,0.0006343199,0.007168123],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999435,0.000060100658,0.000034264547,0.00011641165,0.00027515547,0.00007908683],"domain_scores_gemma":[0.99936515,0.00014529792,0.00007391356,0.000240077,0.0001323321,0.00004325363],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034581273,0.00059304363,0.00056366913,0.0009419368,0.00052023877,0.00090798474,0.00091463584,0.00057517586,0.0071813986],"category_scores_gemma":[0.002192973,0.0005508423,0.0007539985,0.00081035134,0.0007754357,0.0014117991,0.0025689027,0.0011334815,0.0011359103],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020836863,0.00008362439,0.0013480344,0.00023731557,0.000043630476,0.00027396358,0.0003324641,0.10523248,0.041257475,0.16984539,0.010621758,0.6705155],"study_design_scores_gemma":[0.0000920839,0.00019197482,0.00088681944,0.00005526776,0.000061974744,0.0007621345,0.0003249833,0.6642469,0.049189396,0.20893359,0.075182654,0.00007231761],"about_ca_topic_score_codex":0.0011145816,"about_ca_topic_score_gemma":0.0015188848,"teacher_disagreement_score":0.0071813986,"about_ca_system_score_codex":0.00043247128,"about_ca_system_score_gemma":0.00037309143,"threshold_uncertainty_score":0.024024189},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021958004,0.0045706206,0.9795671,0.00044556393,0.00032789473,0.000029991514,0.000045012894,0.00024400247,0.01257408],"genre_scores_gemma":[0.11631109,0.012456987,0.8352426,0.00023475295,0.00062867976,0.0002594447,0.00015966663,0.00040767092,0.03429913],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99972683,0.000062485444,0.000014946136,0.000050087376,0.00013197173,0.000013695908],"domain_scores_gemma":[0.99956495,0.0002495248,0.000026705475,0.00006867189,0.00007241752,0.000017686678],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046709867,0.0006501947,0.00083312276,0.0009171487,0.00047221707,0.0012461714,0.0014699174,0.0019569956,0.0058277426],"category_scores_gemma":[0.0015776242,0.0005594736,0.000529115,0.0015000806,0.0009661264,0.0011526857,0.0015697583,0.001813212,0.0018283771],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008151483,0.00007242768,0.000517759,0.00027371247,0.00003283834,0.00018544475,0.00014628645,0.14402735,0.008201568,0.21983235,0.013648095,0.6129806],"study_design_scores_gemma":[0.000021918087,0.00003893072,0.0002548331,0.00006346057,0.000013813601,0.00033624098,0.000034109882,0.8625199,0.0026417833,0.085093535,0.048958413,0.000022961985],"about_ca_topic_score_codex":0.00073842605,"about_ca_topic_score_gemma":0.0006424041,"teacher_disagreement_score":0.0058277426,"about_ca_system_score_codex":0.00035540847,"about_ca_system_score_gemma":0.00028281385,"threshold_uncertainty_score":0.019495785},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0047996696,0.00013428373,0.99312156,0.000055255972,0.000023337907,0.000032207972,0.000026286101,0.00013695288,0.0016704345],"genre_scores_gemma":[0.15598965,0.00036943477,0.8383608,0.00006660272,0.000033084034,0.00022016,0.00017881546,0.00020088434,0.004580626],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994611,0.00019548797,0.0000255646,0.000025409283,0.00025909857,0.000033231543],"domain_scores_gemma":[0.999451,0.00029735654,0.00003870137,0.00007186715,0.00011096068,0.000030089537],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074628677,0.00042752546,0.00036818034,0.00047823868,0.000352135,0.00044660605,0.0007424697,0.0005038017,0.0018542891],"category_scores_gemma":[0.0020197663,0.0003082408,0.0005552285,0.0007362559,0.00069056614,0.0005200947,0.001134812,0.0010881128,0.0007024485],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000106836604,0.00008160554,0.0008088451,0.00029649562,0.000037120655,0.00011288134,0.00049699703,0.51634645,0.034951758,0.30667087,0.0042579407,0.1358321],"study_design_scores_gemma":[0.000010832286,0.000024505447,0.00009755922,0.000014672822,0.000005068442,0.000018090717,0.00002070074,0.9687649,0.0020843768,0.023896944,0.0050553866,0.0000070850015],"about_ca_topic_score_codex":0.0025249717,"about_ca_topic_score_gemma":0.003913318,"teacher_disagreement_score":0.0025249717,"about_ca_system_score_codex":0.00047480926,"about_ca_system_score_gemma":0.00075176364,"threshold_uncertainty_score":0.006203234},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003897597,0.00032343165,0.9807118,0.00016017366,0.00016247663,0.00014380252,0.0017196282,0.008464593,0.0044164318],"genre_scores_gemma":[0.03835697,0.00037560266,0.945897,0.00015222206,0.000046599518,0.0003521997,0.0071078823,0.002005484,0.0057060523],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99916387,0.00005815766,0.0001346074,0.00013808868,0.00044270503,0.00006252833],"domain_scores_gemma":[0.99883646,0.00021839842,0.00007079986,0.00046134216,0.00032624794,0.00008675524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006075829,0.0007136012,0.0008258676,0.0016740614,0.0009969315,0.0022889844,0.0024537386,0.0009259167,0.009163408],"category_scores_gemma":[0.0025181284,0.0006799106,0.0015228405,0.0032178543,0.0008028578,0.0033551494,0.0028535707,0.0017983005,0.004721252],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037437427,0.00023626788,0.0019918047,0.0007738418,0.00008273195,0.00043110564,0.0009374133,0.043450862,0.022502461,0.14244507,0.0768398,0.7099342],"study_design_scores_gemma":[0.0001572526,0.00030396017,0.00077171513,0.0002692355,0.00007306448,0.00071150163,0.00028333327,0.37298936,0.032878242,0.10127507,0.49012035,0.00016688682],"about_ca_topic_score_codex":0.0033188488,"about_ca_topic_score_gemma":0.0058881096,"teacher_disagreement_score":0.009163408,"about_ca_system_score_codex":0.00066848285,"about_ca_system_score_gemma":0.0012641582,"threshold_uncertainty_score":0.030654669},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006548634,0.00008533266,0.9903598,0.00013209411,0.000025047662,0.000021870059,0.000022347478,0.0003706473,0.0024343033],"genre_scores_gemma":[0.28900138,0.00042524294,0.70628303,0.00014133075,0.00006209335,0.00012399362,0.00018533762,0.0004777434,0.0032999038],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99947137,0.0001643999,0.000019841413,0.00007409341,0.00022146762,0.000048726826],"domain_scores_gemma":[0.9987373,0.0005767838,0.000089156936,0.000336977,0.00022249256,0.000037331894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007197308,0.0004821249,0.00045645385,0.00074716884,0.00054478465,0.0016379576,0.0015615209,0.0010786431,0.0030469818],"category_scores_gemma":[0.0034117752,0.00036741752,0.0005504749,0.00062221574,0.0015551546,0.002598507,0.00091582705,0.0010624891,0.0008502991],"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.00008787737,0.000045015317,0.0014417621,0.00012052687,0.000024576919,0.00015952406,0.00021463321,0.35393196,0.025729865,0.49628857,0.0018010746,0.12015472],"study_design_scores_gemma":[0.000004928784,0.000019602854,0.00019673958,0.000008767508,0.0000028497172,0.00008773325,0.00004104464,0.92220384,0.008367678,0.06488628,0.0041605947,0.000019957713],"about_ca_topic_score_codex":0.0013004855,"about_ca_topic_score_gemma":0.00078586774,"teacher_disagreement_score":0.0030469818,"about_ca_system_score_codex":0.00058103516,"about_ca_system_score_gemma":0.00034414692,"threshold_uncertainty_score":0.010193169},"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":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016883444,0.38783157,0.40468735,0.06990572,0.005053591,0.00008010692,0.0004635313,0.0005874356,0.114507206],"genre_scores_gemma":[0.33279067,0.3049337,0.28331715,0.013868525,0.035517644,0.00044204821,0.0011971617,0.0008338412,0.027099237],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971349,0.0010339688,0.00012074516,0.0006189579,0.00089708157,0.00019423704],"domain_scores_gemma":[0.98780537,0.009421919,0.00029609507,0.0010992163,0.0010481806,0.0003293799],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006056299,0.0013763929,0.001866991,0.003056801,0.002074546,0.0062026763,0.003250175,0.0028735227,0.008256193],"category_scores_gemma":[0.0141348,0.000953336,0.0012876053,0.0068488684,0.008894533,0.018236682,0.0037959232,0.010962969,0.002210528],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027389375,0.00003999053,0.00013728371,0.0004269014,0.000015037508,0.000025702517,0.000102395774,0.0021409933,0.00009546474,0.94370747,0.011210746,0.04207075],"study_design_scores_gemma":[0.000013112851,0.000031808166,0.00018601684,0.00014890276,0.000013694593,0.0000942266,0.00008561423,0.00984009,0.00019864223,0.9322188,0.0571528,0.000016325417],"about_ca_topic_score_codex":0.001663347,"about_ca_topic_score_gemma":0.0009560024,"teacher_disagreement_score":0.008256193,"about_ca_system_score_codex":0.0043005417,"about_ca_system_score_gemma":0.0014249613,"threshold_uncertainty_score":0.032029152},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4153858,0.00093555194,0.5115863,0.000708841,0.00024112962,0.00018300366,0.003217951,0.0017201888,0.0660211],"genre_scores_gemma":[0.7871818,0.00034337363,0.1928137,0.00019376277,0.000092633854,0.00019168772,0.0029804083,0.00038596115,0.01581671],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99836713,0.00020798824,0.00012070797,0.00037002834,0.0006333355,0.00030091312],"domain_scores_gemma":[0.9953625,0.0013158352,0.0006062246,0.0010742565,0.00076621433,0.00087503094],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010750382,0.00082608836,0.0011985815,0.0019283731,0.0016066823,0.0027457557,0.0020350572,0.00107031,0.009883597],"category_scores_gemma":[0.0069761956,0.0010621515,0.0009360388,0.0012534836,0.0031110707,0.0038918694,0.004988516,0.0019915549,0.0012634438],"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.0010517023,0.00008709324,0.010148359,0.0006537786,0.00013293463,0.0010061624,0.0007059304,0.059687257,0.02473658,0.8261141,0.010772852,0.06490333],"study_design_scores_gemma":[0.000103674975,0.0002910625,0.007058203,0.00030876746,0.0001225749,0.0024431518,0.0007896701,0.17492704,0.03944577,0.7382537,0.03606776,0.00018867252],"about_ca_topic_score_codex":0.0006805041,"about_ca_topic_score_gemma":0.00081447605,"teacher_disagreement_score":0.009883597,"about_ca_system_score_codex":0.0007849662,"about_ca_system_score_gemma":0.0007224896,"threshold_uncertainty_score":0.03306389},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09751798,0.00026011106,0.88513964,0.0005068214,0.000061142724,0.00006621452,0.0002678118,0.0002686903,0.015911603],"genre_scores_gemma":[0.6104947,0.00042277944,0.3826907,0.00016008456,0.000038298032,0.00029078702,0.00041127802,0.00030527465,0.0051861163],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99966085,0.000094388255,0.00001528813,0.00007554129,0.0001013098,0.000052625786],"domain_scores_gemma":[0.9981846,0.0011272484,0.00022895129,0.00019228585,0.0001683695,0.0000984509],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010380588,0.000619481,0.0007022172,0.0006799086,0.000518913,0.0011612595,0.00091983366,0.0008335261,0.0032849468],"category_scores_gemma":[0.006840191,0.00052657316,0.0008148844,0.00038410563,0.0014143714,0.0015869463,0.0010680234,0.0011702011,0.0005251226],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056688248,0.000034722667,0.0016944035,0.00013408136,0.000011546852,0.00010188006,0.00008855478,0.8797517,0.0031945584,0.100047834,0.0018029679,0.013081048],"study_design_scores_gemma":[0.000006858754,0.00001742235,0.00012693266,0.000019617544,0.0000028893169,0.000027478693,0.00004023743,0.9679635,0.0011529289,0.029253688,0.0013826343,0.0000057937777],"about_ca_topic_score_codex":0.0026689097,"about_ca_topic_score_gemma":0.0034841676,"teacher_disagreement_score":0.0032849468,"about_ca_system_score_codex":0.0009496992,"about_ca_system_score_gemma":0.0012864174,"threshold_uncertainty_score":0.010989308},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014251918,0.00008691259,0.98133117,0.00021312105,0.000120366996,0.00009414499,0.0005454203,0.01132368,0.004859961],"genre_scores_gemma":[0.032691855,0.00025418607,0.95140344,0.00032583185,0.00008164944,0.0005069379,0.0029379718,0.0051676854,0.006630461],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992009,0.000091323185,0.00004593678,0.000064948326,0.00055527326,0.000041550444],"domain_scores_gemma":[0.99908245,0.00026362253,0.000086045075,0.00019460176,0.00032285048,0.00005045557],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008507209,0.0010881718,0.0005204389,0.0009942675,0.00073650957,0.0011199681,0.002899807,0.0014752552,0.019206358],"category_scores_gemma":[0.0023193571,0.0006604191,0.00079698354,0.0011246331,0.00088634726,0.0010917011,0.0016663539,0.0016674624,0.008079747],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017938702,0.00010673673,0.0012540892,0.00083202985,0.000077429664,0.00078464975,0.00042150906,0.20858295,0.052477393,0.056036223,0.25896415,0.4202835],"study_design_scores_gemma":[0.0000648879,0.000044259108,0.00033202537,0.000062640815,0.000009184752,0.00036072335,0.00003001781,0.8227765,0.03440771,0.011711678,0.13013263,0.000067830995],"about_ca_topic_score_codex":0.0021017073,"about_ca_topic_score_gemma":0.002539114,"teacher_disagreement_score":0.019206358,"about_ca_system_score_codex":0.0005271587,"about_ca_system_score_gemma":0.0010732649,"threshold_uncertainty_score":0.0642516},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12375251,0.005344945,0.7764623,0.0072477567,0.0013296643,0.0005047797,0.004732813,0.0035635957,0.077061504],"genre_scores_gemma":[0.45371768,0.004097271,0.49635035,0.0017953761,0.00076448533,0.0011399492,0.0058566234,0.0024811646,0.033797085],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.995698,0.0007772308,0.00029984256,0.0009829105,0.0015221736,0.0007198812],"domain_scores_gemma":[0.979385,0.014991434,0.0007945981,0.0027709003,0.0009826116,0.0010754125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030611618,0.003011855,0.0023420793,0.002273876,0.002132572,0.0050655347,0.006068841,0.0028935736,0.028028194],"category_scores_gemma":[0.024706226,0.0016447416,0.00241738,0.0034415433,0.0026939807,0.010442918,0.007256626,0.006890434,0.0053653414],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002790033,0.000987594,0.0064148237,0.0027815541,0.00047536156,0.00063115207,0.0007937641,0.33515856,0.039192423,0.20069718,0.06764786,0.34242967],"study_design_scores_gemma":[0.00022572652,0.0002587059,0.001928212,0.0002570112,0.00018064202,0.00055024726,0.00025804294,0.6845272,0.0080578355,0.28706005,0.016604327,0.000092025904],"about_ca_topic_score_codex":0.003165961,"about_ca_topic_score_gemma":0.00843248,"teacher_disagreement_score":0.028028194,"about_ca_system_score_codex":0.0030303837,"about_ca_system_score_gemma":0.0023946634,"threshold_uncertainty_score":0.09376365},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16341713,0.01983667,0.48002017,0.001939341,0.0007804595,0.00015137879,0.00065987057,0.00066376297,0.33253115],"genre_scores_gemma":[0.8293064,0.010419801,0.107231,0.00029435268,0.0004448846,0.00012173841,0.00048504406,0.00030585163,0.05139098],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997303,0.000046109202,0.000017412844,0.0000608414,0.00010767917,0.00003756869],"domain_scores_gemma":[0.9995977,0.00014121746,0.000069068956,0.00007160587,0.00007751625,0.000042777847],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020844102,0.0005075584,0.00032834534,0.0015820663,0.00092155044,0.0013844096,0.000574122,0.00045869994,0.007700863],"category_scores_gemma":[0.001749478,0.00031596996,0.00048518705,0.0017082773,0.0021274458,0.0024105452,0.0016423733,0.001066763,0.0009050101],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036606903,0.000008988926,0.00046920488,0.00012253145,0.0000068025097,0.0001473599,0.00027246843,0.010093956,0.0016115297,0.93856347,0.0033831035,0.045284107],"study_design_scores_gemma":[0.000010697952,0.000083500476,0.001126839,0.00011806355,0.000017354425,0.0007153023,0.00041181984,0.02462905,0.0022969313,0.8545718,0.11598897,0.0000295142],"about_ca_topic_score_codex":0.0020552415,"about_ca_topic_score_gemma":0.0019838815,"teacher_disagreement_score":0.007700863,"about_ca_system_score_codex":0.0008749711,"about_ca_system_score_gemma":0.0003260041,"threshold_uncertainty_score":0.025761962},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004902991,0.00016183968,0.98520976,0.00018821757,0.000112391346,0.00018278808,0.00012097765,0.0013676382,0.007753355],"genre_scores_gemma":[0.04419568,0.00013506405,0.9467305,0.0001129591,0.00006193374,0.0003597621,0.0006200785,0.00048418972,0.007299771],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991517,0.00012890768,0.000040193696,0.00022960713,0.00033599217,0.00011364968],"domain_scores_gemma":[0.99905974,0.0004608531,0.00004984536,0.00018570361,0.00016939543,0.000074431955],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006192352,0.0016030899,0.0019216348,0.0018362594,0.0015826124,0.0019658727,0.0036169223,0.0023740558,0.027228164],"category_scores_gemma":[0.0034299626,0.0010075825,0.0013593511,0.0025938102,0.000989551,0.0032004488,0.0055443062,0.0031282876,0.0061077513],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034814863,0.00040352973,0.0005059266,0.00041708883,0.00007543681,0.00024589308,0.0002722588,0.092555195,0.008283841,0.12908113,0.036394596,0.7314169],"study_design_scores_gemma":[0.00030687824,0.00014668607,0.00025523314,0.0000463407,0.000047447105,0.00031839218,0.00018762203,0.80110353,0.0049346853,0.16804725,0.024561029,0.000044918845],"about_ca_topic_score_codex":0.003137619,"about_ca_topic_score_gemma":0.0037173,"teacher_disagreement_score":0.027228164,"about_ca_system_score_codex":0.0010458117,"about_ca_system_score_gemma":0.0016701308,"threshold_uncertainty_score":0.09108734},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15439536,0.015222912,0.5043524,0.034985118,0.0017202521,0.000382948,0.0043719127,0.0014755437,0.2830935],"genre_scores_gemma":[0.8666214,0.009136705,0.07217142,0.0034221562,0.0033025343,0.00053289224,0.0035053287,0.00085487514,0.040452704],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99742955,0.00068049366,0.000085771346,0.0006794561,0.00077780656,0.00034687272],"domain_scores_gemma":[0.9879067,0.009920947,0.000497314,0.00089697505,0.00037427552,0.00040381053],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013038886,0.0011176553,0.0026612266,0.001431158,0.0023465948,0.0058821808,0.004320875,0.0033923762,0.015252181],"category_scores_gemma":[0.015344505,0.0013081253,0.0020636222,0.002608791,0.004715495,0.011653143,0.004484647,0.009254778,0.00202797],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00052073726,0.00022511321,0.0014130787,0.0016689356,0.00012881066,0.00030389515,0.0008551369,0.052652095,0.0020144496,0.82759434,0.056825668,0.055797786],"study_design_scores_gemma":[0.00006444245,0.00002899479,0.00038290193,0.00006506703,0.000021971553,0.00020120038,0.00015811584,0.023451785,0.00051566423,0.9665485,0.008544666,0.000016741975],"about_ca_topic_score_codex":0.0023301644,"about_ca_topic_score_gemma":0.0016142726,"teacher_disagreement_score":0.015252181,"about_ca_system_score_codex":0.0025080135,"about_ca_system_score_gemma":0.0016556713,"threshold_uncertainty_score":0.051023602},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017039353,0.0026452788,0.9645065,0.00029780823,0.000103023274,0.000035003068,0.000074311254,0.00023477335,0.015064083],"genre_scores_gemma":[0.4267469,0.009088982,0.54013133,0.00028370597,0.00014799871,0.00017034906,0.00067341205,0.00023762624,0.022519693],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99980813,0.000028687242,0.000012138466,0.00005490033,0.00007565401,0.000020447174],"domain_scores_gemma":[0.999882,0.000047832866,0.000008215282,0.000015654332,0.000038221027,0.000008083027],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001504381,0.00032591182,0.0004518539,0.00043965952,0.0005170952,0.0005454222,0.0005450501,0.00044471835,0.003635118],"category_scores_gemma":[0.00073193153,0.00020220193,0.0005616425,0.0013043892,0.0003346804,0.0013151065,0.00047078717,0.0005665743,0.00059978786],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045475957,0.000041184572,0.0019437348,0.00045447738,0.00003577669,0.00016689824,0.0002922085,0.4715715,0.0070259348,0.17197353,0.00939588,0.33705342],"study_design_scores_gemma":[0.000010871099,0.00006129307,0.00067910587,0.000044732253,0.000016101169,0.0002483494,0.000075161166,0.91977066,0.0016304363,0.043686036,0.033759255,0.000017996994],"about_ca_topic_score_codex":0.0054226085,"about_ca_topic_score_gemma":0.0030894775,"teacher_disagreement_score":0.0054226085,"about_ca_system_score_codex":0.00051519275,"about_ca_system_score_gemma":0.0007552314,"threshold_uncertainty_score":0.012160659},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25620854,0.001848748,0.6312395,0.0040514315,0.00030188082,0.00083842996,0.009012377,0.0032064011,0.09329287],"genre_scores_gemma":[0.5943708,0.0018126261,0.36086646,0.001012617,0.00019796885,0.0005069013,0.017118888,0.0005731403,0.02354065],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.998125,0.00027971325,0.0001423211,0.0007040546,0.00043701197,0.0003118386],"domain_scores_gemma":[0.99659234,0.00145906,0.00049520214,0.00081791304,0.00041065796,0.00022481737],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006097874,0.0013042327,0.0010151714,0.0008045212,0.0012551334,0.0026575022,0.0018516154,0.001843111,0.013433246],"category_scores_gemma":[0.0057248534,0.0008360393,0.0016537524,0.0014212461,0.0014852675,0.005874424,0.0026703733,0.0026683523,0.0027712293],"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.0012543882,0.00029271262,0.005960205,0.0014225038,0.00018583759,0.0010263817,0.0009339316,0.14415973,0.022308031,0.41736817,0.055866163,0.34922194],"study_design_scores_gemma":[0.00024205414,0.00056567317,0.0022838863,0.0002829932,0.00013387491,0.0016451393,0.0009771299,0.23964094,0.01874176,0.64611,0.089238025,0.0001386173],"about_ca_topic_score_codex":0.002362717,"about_ca_topic_score_gemma":0.0030577222,"teacher_disagreement_score":0.013433246,"about_ca_system_score_codex":0.0008466033,"about_ca_system_score_gemma":0.0009383444,"threshold_uncertainty_score":0.044938684},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.076721884,0.0012077738,0.55548066,0.001194181,0.00082912954,0.000097128046,0.00053650996,0.0009355445,0.36299726],"genre_scores_gemma":[0.664506,0.0019577686,0.112174824,0.00077290105,0.0008096744,0.00020271359,0.0016783876,0.0017207714,0.21617694],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99967504,0.00006289232,0.000016464595,0.00005758393,0.00013545917,0.00005253613],"domain_scores_gemma":[0.9997023,0.000062460254,0.000036062487,0.00008046663,0.000067851135,0.00005084079],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003571645,0.0008424317,0.00062509347,0.0016160274,0.0009508052,0.0021441379,0.0008601221,0.0010255142,0.026817301],"category_scores_gemma":[0.0014251799,0.0003496072,0.0004626155,0.0014399531,0.0012066282,0.0037518349,0.0025574847,0.0022671367,0.00573475],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001630033,0.000014703274,0.000033742454,0.000021671132,0.000002345407,0.00002566212,0.000081236336,0.00093643443,0.0007122948,0.9726456,0.0033809342,0.022129113],"study_design_scores_gemma":[0.0000074280642,0.000013157352,0.00005575721,0.000018229062,0.0000034634556,0.00006434087,0.0000578679,0.008899693,0.00045830396,0.9771867,0.0132293105,0.000005751553],"about_ca_topic_score_codex":0.0005457498,"about_ca_topic_score_gemma":0.0007519374,"teacher_disagreement_score":0.026817301,"about_ca_system_score_codex":0.0006171539,"about_ca_system_score_gemma":0.00025731316,"threshold_uncertainty_score":0.0897128},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45424378,0.00074367283,0.51406425,0.0011031973,0.000085689986,0.00009485043,0.0010824562,0.0007919762,0.027790213],"genre_scores_gemma":[0.92609453,0.00035974558,0.06816845,0.00010469004,0.00006795835,0.000069999325,0.0013568683,0.00016162744,0.0036160129],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99893695,0.00019329946,0.00007200838,0.00037407436,0.00026788315,0.0001557018],"domain_scores_gemma":[0.995865,0.0019343094,0.00082001515,0.00082245085,0.0002814574,0.00027681148],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034874337,0.0004550521,0.0005356822,0.0007781175,0.0005138644,0.0031072295,0.0014965094,0.0010194936,0.0040065222],"category_scores_gemma":[0.0047346856,0.00052944897,0.00056461256,0.0015448572,0.0019527123,0.0032010635,0.0015289992,0.0014625131,0.00058399333],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031149172,0.00016501044,0.008424116,0.0005027929,0.00005936938,0.0009974035,0.0009809163,0.14024557,0.03344393,0.68566275,0.009549289,0.11965733],"study_design_scores_gemma":[0.000033700937,0.00008142885,0.0035638695,0.000051740524,0.00003464725,0.0013360126,0.00055353664,0.22526921,0.016190743,0.7401749,0.012664052,0.00004616469],"about_ca_topic_score_codex":0.0009952058,"about_ca_topic_score_gemma":0.0007990337,"teacher_disagreement_score":0.0040065222,"about_ca_system_score_codex":0.00060351717,"about_ca_system_score_gemma":0.00035333046,"threshold_uncertainty_score":0.013403177},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0051982817,0.00005574809,0.99301493,0.000058361908,0.00002740169,0.000023823559,0.000022590371,0.00010862039,0.0014901679],"genre_scores_gemma":[0.27475557,0.00022093905,0.7205429,0.00012643688,0.000046126348,0.00027031876,0.00028037876,0.00021345861,0.0035439227],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99967015,0.00009677885,0.000012832619,0.000031469754,0.00016352697,0.000025207728],"domain_scores_gemma":[0.9995326,0.00021328624,0.000042034575,0.00007202878,0.00010594544,0.0000341915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074073183,0.00034201602,0.00037052573,0.00037541,0.0002773598,0.00048469473,0.0006708995,0.00066415255,0.0017655746],"category_scores_gemma":[0.0016263439,0.0002774939,0.0005190339,0.0003342525,0.0005392601,0.00037198566,0.0010735318,0.00085165125,0.00044642706],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005973511,0.000037073292,0.0005482969,0.00007772003,0.000019744346,0.00007743638,0.00006952999,0.826314,0.014867579,0.12232764,0.0018233025,0.033778057],"study_design_scores_gemma":[0.0000034641544,0.0000043132213,0.000021425802,0.0000019384136,6.3088385e-7,0.0000068947234,0.0000018311706,0.9948407,0.00053592667,0.0038987764,0.00068246864,0.0000017044688],"about_ca_topic_score_codex":0.001068464,"about_ca_topic_score_gemma":0.0010249765,"teacher_disagreement_score":0.0017655746,"about_ca_system_score_codex":0.0005529884,"about_ca_system_score_gemma":0.00063910254,"threshold_uncertainty_score":0.0059064627},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15457809,0.0005912031,0.80510324,0.00035007406,0.00016690668,0.00011439865,0.0015673474,0.0024567586,0.035071995],"genre_scores_gemma":[0.5278345,0.00041975887,0.4530896,0.00009737438,0.00009282742,0.00007462166,0.0049695163,0.0011280775,0.012293792],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993352,0.000079572186,0.000040349376,0.00013373487,0.00029642545,0.000114670846],"domain_scores_gemma":[0.99871826,0.00074190256,0.00009054317,0.00020202884,0.00015038616,0.000096857715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053592917,0.0009707618,0.0013518538,0.0011717986,0.00058903836,0.0032146792,0.0014993337,0.0006957998,0.013808819],"category_scores_gemma":[0.0035815192,0.00079885666,0.00084155786,0.0014044945,0.0009572744,0.003508325,0.0023147815,0.0019943824,0.0024613836],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009964852,0.00026612208,0.004704976,0.0009766292,0.00011546567,0.0005483374,0.0005809598,0.36283258,0.018376442,0.13554677,0.021204436,0.45385075],"study_design_scores_gemma":[0.000041109088,0.00012806525,0.0013236424,0.00009366746,0.000026960617,0.00019967591,0.00036323394,0.89440554,0.008188281,0.08733473,0.00786717,0.000028029473],"about_ca_topic_score_codex":0.0014132566,"about_ca_topic_score_gemma":0.0024787171,"teacher_disagreement_score":0.013808819,"about_ca_system_score_codex":0.0006192284,"about_ca_system_score_gemma":0.0004523797,"threshold_uncertainty_score":0.04619509},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7215851,0.0004147535,0.19090039,0.0007869865,0.00068236864,0.00018992276,0.0011120655,0.0012586681,0.083069645],"genre_scores_gemma":[0.87163216,0.00037458172,0.06948649,0.00037824217,0.00013866519,0.00019649013,0.0011657225,0.001000911,0.05562661],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992613,0.00010724423,0.000064681386,0.00014731521,0.00015083229,0.00026856264],"domain_scores_gemma":[0.9989735,0.00036187956,0.00013454724,0.00022939657,0.00012215304,0.000178526],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004429264,0.00067683036,0.001181413,0.0017683569,0.0024542266,0.0037478234,0.0010866987,0.0015073933,0.017787453],"category_scores_gemma":[0.0018475878,0.0007267119,0.0015308005,0.0022849424,0.0018804345,0.0034970536,0.0022172693,0.0021814955,0.0020708356],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005955154,0.00012948358,0.0007245601,0.00012699584,0.000038005164,0.0004100008,0.00039492545,0.008917959,0.006880282,0.95502365,0.004670832,0.022087792],"study_design_scores_gemma":[0.000098612225,0.000074216536,0.0004928468,0.000036982266,0.00004152959,0.00026986335,0.00023890541,0.019318335,0.0045168856,0.9651245,0.009739628,0.000047713915],"about_ca_topic_score_codex":0.001712347,"about_ca_topic_score_gemma":0.002522157,"teacher_disagreement_score":0.017787453,"about_ca_system_score_codex":0.0009860491,"about_ca_system_score_gemma":0.00096462615,"threshold_uncertainty_score":0.059504986},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8103765,0.0009159165,0.119644426,0.0003833688,0.00015200298,0.00005362072,0.00051705923,0.00045439144,0.067502685],"genre_scores_gemma":[0.9595734,0.00046676505,0.023639377,0.00008228951,0.000064415566,0.000054266835,0.0010064391,0.00010108586,0.015012012],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991991,0.0000794067,0.000045841996,0.00023758881,0.0002491898,0.00018885343],"domain_scores_gemma":[0.99842596,0.00067792146,0.00016662256,0.00032492614,0.00015899783,0.00024551494],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041306383,0.000567313,0.00045756774,0.001007536,0.00095839263,0.0015469365,0.0006566231,0.00052428216,0.006011249],"category_scores_gemma":[0.0023004133,0.0005734283,0.0006819964,0.00055446324,0.0012213739,0.0015180671,0.002077315,0.0015588432,0.0010682385],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029892602,0.00016979729,0.013235093,0.00027330956,0.00009167156,0.003455326,0.0021642095,0.022771863,0.033763777,0.82599485,0.006583514,0.09119773],"study_design_scores_gemma":[0.00009229832,0.00020681252,0.009759857,0.00009628843,0.00009473751,0.005949907,0.0011306714,0.06037537,0.031503838,0.8361594,0.05456305,0.00006778583],"about_ca_topic_score_codex":0.00052573363,"about_ca_topic_score_gemma":0.0004021882,"teacher_disagreement_score":0.006011249,"about_ca_system_score_codex":0.0006717242,"about_ca_system_score_gemma":0.00021034328,"threshold_uncertainty_score":0.020109653},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023552882,0.00037226555,0.9788032,0.000100283105,0.00036500473,0.000032298958,0.000038188613,0.0002317621,0.017701713],"genre_scores_gemma":[0.08294959,0.0018808777,0.8780421,0.0001952176,0.00045297775,0.0001036175,0.00016591286,0.000556147,0.03565352],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99966824,0.000057312565,0.0000120280165,0.000037171707,0.00020473337,0.000020540521],"domain_scores_gemma":[0.9995433,0.00019174571,0.000019131854,0.0000802435,0.0001295049,0.000035984034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053596543,0.00062143843,0.00082687155,0.0011380066,0.0005426195,0.0010554097,0.0011614829,0.0008056294,0.006528305],"category_scores_gemma":[0.0016020385,0.0003884979,0.0012900057,0.0008986647,0.00088713947,0.0011019239,0.0016707416,0.0020760037,0.0023321616],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007066559,0.000084750616,0.00029483254,0.0002669552,0.000029507119,0.00023496887,0.00021251448,0.11307658,0.013914819,0.52836883,0.011907453,0.33153802],"study_design_scores_gemma":[0.000019775229,0.00006736854,0.00018999097,0.000044288605,0.000017689654,0.0002940032,0.000022684653,0.7564748,0.003752785,0.16383982,0.075252585,0.000024269426],"about_ca_topic_score_codex":0.0011858027,"about_ca_topic_score_gemma":0.0012992591,"teacher_disagreement_score":0.006528305,"about_ca_system_score_codex":0.00036328347,"about_ca_system_score_gemma":0.0005757249,"threshold_uncertainty_score":0.02183938},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036475603,0.00033264872,0.9482235,0.00027768168,0.00010172796,0.00017934822,0.0015561274,0.008777685,0.004075661],"genre_scores_gemma":[0.19835006,0.0002864202,0.7860416,0.0001421045,0.00006857257,0.0003425225,0.0077656684,0.0023091028,0.0046939324],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981608,0.00017876938,0.00021605592,0.0003628508,0.0007727482,0.00030880066],"domain_scores_gemma":[0.99653447,0.0009196921,0.0002345281,0.0016047497,0.00057146716,0.00013520796],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087970466,0.0017629705,0.0017971676,0.0024805323,0.001181592,0.0030419682,0.002890194,0.0014582236,0.011025086],"category_scores_gemma":[0.007149363,0.0011037457,0.0020934888,0.003918825,0.0011412036,0.0053657563,0.0057578273,0.0025809777,0.004614145],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020297,0.0002686282,0.0058640544,0.00078576466,0.00017126862,0.0006353875,0.0017299473,0.10237136,0.03621034,0.05915628,0.043273125,0.7475041],"study_design_scores_gemma":[0.00016832858,0.00022009741,0.0014782934,0.00012698634,0.000061804974,0.000366804,0.0009981279,0.8121123,0.04216183,0.10469644,0.037530042,0.00007899114],"about_ca_topic_score_codex":0.003990701,"about_ca_topic_score_gemma":0.0065309806,"teacher_disagreement_score":0.011025086,"about_ca_system_score_codex":0.0010225669,"about_ca_system_score_gemma":0.0010974957,"threshold_uncertainty_score":0.03688264},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016617968,0.000017236238,0.99757093,0.00003080675,0.000017087952,0.000016250206,0.000015934074,0.00007882513,0.0005912212],"genre_scores_gemma":[0.13355328,0.000083653526,0.86237746,0.00010414772,0.00003633825,0.00021574974,0.00019300176,0.00020271173,0.0032337098],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995303,0.00014971134,0.000018941619,0.00006163619,0.00020771688,0.0000317645],"domain_scores_gemma":[0.9995214,0.00019755539,0.00003807292,0.00009010497,0.000111819856,0.000041089763],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000845382,0.00035079004,0.00042658974,0.0004182828,0.00032494566,0.00053084234,0.0011664751,0.00066322944,0.0027053352],"category_scores_gemma":[0.001562458,0.00033107688,0.000551002,0.00039546433,0.0005889511,0.00047189445,0.0012350131,0.001080782,0.0006822909],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008372446,0.000049673552,0.00055444747,0.00009956492,0.000034296543,0.00012886256,0.00010895782,0.6906509,0.024428798,0.20694272,0.002714639,0.07420338],"study_design_scores_gemma":[0.000009707487,0.000010151563,0.00002521052,0.0000027357316,0.0000015952544,0.000017896416,0.000002802371,0.9888466,0.0015689093,0.008105787,0.0014038354,0.000004791579],"about_ca_topic_score_codex":0.0008766777,"about_ca_topic_score_gemma":0.00094934506,"teacher_disagreement_score":0.0027053352,"about_ca_system_score_codex":0.00044474105,"about_ca_system_score_gemma":0.00064462645,"threshold_uncertainty_score":0.00905025},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.111709654,0.0018652779,0.86130655,0.004674173,0.00013771631,0.00021373885,0.00037448568,0.0002071221,0.01951135],"genre_scores_gemma":[0.74643207,0.0020996453,0.23602383,0.0007370532,0.00021462221,0.00058040634,0.00060464215,0.00046188055,0.012845877],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989453,0.0004376148,0.000046107987,0.00019596258,0.00023238288,0.00014273464],"domain_scores_gemma":[0.9933153,0.005329308,0.00040710848,0.00043784338,0.00022404862,0.00028640052],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025604262,0.0010167083,0.0008990082,0.00093064056,0.00077106466,0.0011577581,0.0018099551,0.0015948154,0.008108148],"category_scores_gemma":[0.01592569,0.0005393082,0.0005877566,0.0013440601,0.0028378344,0.0033180998,0.0027048397,0.0016092714,0.00063971186],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004895709,0.00007084959,0.0019438077,0.00041218213,0.000035603505,0.00010539034,0.00032203144,0.8314959,0.005205929,0.1271574,0.0036522455,0.029109007],"study_design_scores_gemma":[0.00004729697,0.00017653886,0.00070345134,0.00006591423,0.000024949624,0.000078121535,0.00017426327,0.9496695,0.002307034,0.04391835,0.0028145113,0.000020081608],"about_ca_topic_score_codex":0.002564131,"about_ca_topic_score_gemma":0.0027129555,"teacher_disagreement_score":0.008108148,"about_ca_system_score_codex":0.0025163514,"about_ca_system_score_gemma":0.0010063397,"threshold_uncertainty_score":0.027124405},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02010026,0.0003816837,0.9612358,0.00029165903,0.00014714879,0.000121856465,0.00020486637,0.00062176934,0.016894845],"genre_scores_gemma":[0.27608028,0.0011955157,0.69170207,0.0004991594,0.00023012335,0.00035612404,0.0013331207,0.0010281232,0.02757548],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987581,0.00033977575,0.00005599607,0.000256275,0.00044476124,0.00014515482],"domain_scores_gemma":[0.9974375,0.0014735932,0.00015479581,0.0004556119,0.000276026,0.00020253571],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012540406,0.001567882,0.0016830235,0.001744105,0.0010542836,0.0015406954,0.0028961515,0.0016621604,0.01778732],"category_scores_gemma":[0.0078082974,0.0008948198,0.001111495,0.002337371,0.0020859316,0.0039138678,0.006238125,0.0024184966,0.0029391032],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028998608,0.00016425621,0.0007203217,0.00027421446,0.000054600718,0.00015581073,0.00026513715,0.3622818,0.003857224,0.45277727,0.013112167,0.16604719],"study_design_scores_gemma":[0.000032556665,0.00009207825,0.000115862116,0.000052280102,0.000017494514,0.00008146307,0.000076537035,0.49321985,0.0010465544,0.4995116,0.0057392735,0.00001451575],"about_ca_topic_score_codex":0.001937992,"about_ca_topic_score_gemma":0.0027385356,"teacher_disagreement_score":0.01778732,"about_ca_system_score_codex":0.0008517328,"about_ca_system_score_gemma":0.0009783487,"threshold_uncertainty_score":0.05950445},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010127731,0.00012857963,0.9873646,0.00016752313,0.00004757828,0.000035527224,0.000018787763,0.0003524431,0.0017572053],"genre_scores_gemma":[0.7215177,0.00014092047,0.27291152,0.00031316612,0.00008019328,0.00021173841,0.00011440146,0.0002455944,0.0044648433],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996125,0.00013631597,0.000017503107,0.000090882764,0.000092843795,0.000049985265],"domain_scores_gemma":[0.9978648,0.0015036071,0.00013344678,0.00011756933,0.00027847258,0.000102134894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013773273,0.00084700907,0.0012142112,0.0005788363,0.0004184649,0.0008623855,0.0017265067,0.0018786158,0.004027716],"category_scores_gemma":[0.00422,0.0007329998,0.0005684497,0.00040065957,0.0012808236,0.00087221543,0.0015900878,0.0018599833,0.00060526957],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054619457,0.000027059512,0.00020229109,0.000033255845,0.000019677937,0.00003459832,0.000023333787,0.96489435,0.0009853825,0.0050100177,0.000629244,0.028086135],"study_design_scores_gemma":[0.0000026370033,0.0000031563447,0.000006802689,0.0000011824784,8.3444473e-7,0.0000016382788,8.420616e-7,0.99918,0.00006854105,0.00069778576,0.000035764315,7.271697e-7],"about_ca_topic_score_codex":0.0053894473,"about_ca_topic_score_gemma":0.0052572475,"teacher_disagreement_score":0.0053894473,"about_ca_system_score_codex":0.0009325631,"about_ca_system_score_gemma":0.0010314893,"threshold_uncertainty_score":0.013474107},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2818943,0.0007477967,0.621083,0.0013061635,0.00025757783,0.000110839275,0.0009873243,0.0005988081,0.093014285],"genre_scores_gemma":[0.8466552,0.00041409096,0.12533326,0.0003472835,0.00011232317,0.0002494314,0.0012478019,0.00035807927,0.025282495],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99888855,0.0001864495,0.00006515711,0.00033835717,0.0003895024,0.00013206746],"domain_scores_gemma":[0.99885225,0.0003511499,0.00017306363,0.0003230123,0.00015719184,0.00014341966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007309657,0.00052947446,0.00056036934,0.0011436837,0.0010974439,0.0027093324,0.0013436908,0.0008884045,0.008070614],"category_scores_gemma":[0.0020876026,0.00045138743,0.0011693281,0.00071864354,0.002514527,0.004582772,0.0033110613,0.0020825078,0.0012392234],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019596244,0.000011219272,0.000313446,0.00003400593,0.000009232929,0.00006803245,0.00016099881,0.0012085867,0.0016400099,0.9916666,0.00050783803,0.0043604597],"study_design_scores_gemma":[0.000019089308,0.00005202281,0.00071460154,0.000031389496,0.000021892762,0.00040654492,0.00039754205,0.02089373,0.0054519023,0.9418176,0.03016745,0.00002637693],"about_ca_topic_score_codex":0.00085690315,"about_ca_topic_score_gemma":0.0009993741,"teacher_disagreement_score":0.008070614,"about_ca_system_score_codex":0.0012197318,"about_ca_system_score_gemma":0.00045207492,"threshold_uncertainty_score":0.026998878},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0038040313,0.0002739988,0.99284184,0.00013603889,0.00003731951,0.000046957728,0.0000751142,0.0005076065,0.002277119],"genre_scores_gemma":[0.062372543,0.0004020725,0.93231326,0.00011236537,0.000070430884,0.0002648719,0.0005926649,0.00036635902,0.0035053687],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99849224,0.0002780878,0.00008202639,0.00028718926,0.0007194983,0.00014090505],"domain_scores_gemma":[0.9979214,0.0010187853,0.00019134475,0.00046698333,0.0003023946,0.000099200784],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014039858,0.0014828877,0.0016461287,0.0020979992,0.00068420364,0.0020335189,0.0028720489,0.0019823527,0.005087089],"category_scores_gemma":[0.008399865,0.0011308516,0.0017619904,0.0025617639,0.0013891873,0.0031207248,0.0040185046,0.0038380325,0.0021490464],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024801525,0.00015780526,0.0008698121,0.00031691729,0.00005784254,0.000110534485,0.0003274179,0.5133449,0.0051244968,0.14988023,0.012516218,0.31704587],"study_design_scores_gemma":[0.000032939548,0.00003209737,0.00008151092,0.000025705287,0.0000079841675,0.00006316228,0.000030278148,0.9533558,0.0011770849,0.040301256,0.004881625,0.000010543304],"about_ca_topic_score_codex":0.0028138622,"about_ca_topic_score_gemma":0.0035009792,"teacher_disagreement_score":0.005087089,"about_ca_system_score_codex":0.0016586311,"about_ca_system_score_gemma":0.0011111584,"threshold_uncertainty_score":0.01701796},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041233342,0.000318703,0.9507001,0.00052001065,0.000085515385,0.000058500023,0.00021007484,0.00058891386,0.0062848125],"genre_scores_gemma":[0.75828695,0.0007370541,0.23280807,0.00034493988,0.00048916764,0.00030372545,0.0008316925,0.000768217,0.005430184],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99277955,0.0013349812,0.00030705298,0.001220948,0.0037455205,0.0006119811],"domain_scores_gemma":[0.96688354,0.018965209,0.002162286,0.00841486,0.0029319525,0.0006421886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042653214,0.0012946036,0.0015506403,0.003209319,0.0010023877,0.0032209668,0.002457481,0.0011059184,0.005211847],"category_scores_gemma":[0.035736762,0.0007823585,0.0018302578,0.002061978,0.003397891,0.0088344645,0.0031109508,0.003616563,0.0008242123],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015132835,0.00007333263,0.0023729645,0.00021598989,0.000073619645,0.00013353329,0.00014417875,0.49670103,0.0054550236,0.45016325,0.0029300048,0.041585676],"study_design_scores_gemma":[0.0000059839617,0.000039155573,0.00044067064,0.00001291827,0.000019881436,0.00006270352,0.000017548116,0.7814461,0.0022525892,0.21425666,0.0014310819,0.000014735538],"about_ca_topic_score_codex":0.0012286268,"about_ca_topic_score_gemma":0.0012887317,"teacher_disagreement_score":0.005211847,"about_ca_system_score_codex":0.0028130088,"about_ca_system_score_gemma":0.0018152747,"threshold_uncertainty_score":0.022557437},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041558057,0.0008691603,0.94035894,0.00033917886,0.0001472012,0.00015475799,0.00018733933,0.001297395,0.0150881],"genre_scores_gemma":[0.2753802,0.0011549084,0.6945708,0.00027054295,0.00021215668,0.0005014799,0.00075354567,0.0008965195,0.026259769],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99934226,0.00017639376,0.00004265246,0.0001647275,0.00018417211,0.00008978177],"domain_scores_gemma":[0.99776065,0.0012360753,0.00017726344,0.00048276,0.00019885536,0.00014440664],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088087603,0.0011221268,0.00139818,0.0011198967,0.00084402855,0.0015389873,0.0026639032,0.0010256139,0.009302367],"category_scores_gemma":[0.004575975,0.0007047971,0.00069340284,0.0017914728,0.0009239823,0.004289768,0.0036485773,0.0018931879,0.0023520028],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005661275,0.00024062459,0.00057414925,0.00061661255,0.00008364304,0.00013787644,0.00038565655,0.37170652,0.013445636,0.27966437,0.01823053,0.31434822],"study_design_scores_gemma":[0.00010333998,0.00020268444,0.00019243822,0.000060281593,0.000036235848,0.00012199312,0.00013640696,0.75982046,0.004153282,0.22793123,0.007214769,0.00002686781],"about_ca_topic_score_codex":0.00069329684,"about_ca_topic_score_gemma":0.0013238203,"teacher_disagreement_score":0.009302367,"about_ca_system_score_codex":0.00086521433,"about_ca_system_score_gemma":0.0005723643,"threshold_uncertainty_score":0.031119525},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12601298,0.00039347756,0.82371354,0.00019217702,0.00017854777,0.00015882944,0.00028363458,0.0006774457,0.048389304],"genre_scores_gemma":[0.5249452,0.00093732396,0.42729747,0.00013052725,0.00008722712,0.00021429149,0.00083590474,0.0009808271,0.044571254],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99893624,0.000117290845,0.0000537139,0.00015813114,0.0005989931,0.00013564077],"domain_scores_gemma":[0.9988815,0.0005533756,0.00011103079,0.00021681363,0.00013474286,0.0001024879],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005894975,0.0012491078,0.001339681,0.0012084201,0.0009014528,0.0023732393,0.0019012955,0.0017039648,0.009630818],"category_scores_gemma":[0.003056137,0.0012791217,0.0013156733,0.0015543884,0.0016382057,0.0017994111,0.0064123217,0.003114101,0.0029583555],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045582122,0.00014857911,0.0016136966,0.0004329465,0.00012871811,0.002653251,0.0016708951,0.3088348,0.04904846,0.33995852,0.0068472615,0.2882071],"study_design_scores_gemma":[0.000067586996,0.00029421743,0.0006200455,0.00018210658,0.00004498432,0.0024280741,0.0011161836,0.7165628,0.025709422,0.2247717,0.028113788,0.00008907753],"about_ca_topic_score_codex":0.0009635262,"about_ca_topic_score_gemma":0.0012693511,"teacher_disagreement_score":0.009630818,"about_ca_system_score_codex":0.0005335204,"about_ca_system_score_gemma":0.00059242925,"threshold_uncertainty_score":0.032218337},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12640467,0.0014297904,0.8291373,0.0010266309,0.0006418166,0.00085316855,0.0014171911,0.0035835125,0.035505954],"genre_scores_gemma":[0.47048798,0.0008875989,0.502198,0.000730168,0.00016526216,0.00042502215,0.0035611705,0.00081092963,0.020733872],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964978,0.0005066601,0.0003041009,0.0013624815,0.0008993505,0.00042963],"domain_scores_gemma":[0.9962763,0.0015898007,0.00030864237,0.0011463028,0.00048222364,0.00019674057],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012578184,0.001194197,0.0018924997,0.00080428587,0.0013827151,0.0017044662,0.0021261547,0.0017064518,0.009935575],"category_scores_gemma":[0.0069235046,0.0007627389,0.0021136256,0.0012141846,0.0019561667,0.0037872777,0.0031801078,0.001855126,0.0036167249],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016703724,0.00044261705,0.0032633485,0.001222721,0.00019514035,0.0028605796,0.00095155207,0.13144219,0.052181046,0.14574836,0.032132346,0.62788975],"study_design_scores_gemma":[0.00029046042,0.0011849338,0.0014893451,0.00031270963,0.00023089821,0.0031891544,0.0008702979,0.42253548,0.09710704,0.37135792,0.10121046,0.00022130826],"about_ca_topic_score_codex":0.0010502788,"about_ca_topic_score_gemma":0.0010264585,"teacher_disagreement_score":0.009935575,"about_ca_system_score_codex":0.00073439156,"about_ca_system_score_gemma":0.0006981748,"threshold_uncertainty_score":0.033237875},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010560276,0.0003069886,0.96936774,0.00010203675,0.00013937821,0.000081248836,0.00028816122,0.004348445,0.014805681],"genre_scores_gemma":[0.14057988,0.0011217752,0.8316092,0.00009935588,0.000041912786,0.00012471531,0.0010189121,0.0030456353,0.022358598],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996979,0.00002884139,0.00001432791,0.00006725904,0.00016686824,0.000024868976],"domain_scores_gemma":[0.9997203,0.00008915733,0.00002223371,0.00010270062,0.000048989717,0.000016591772],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023846529,0.0011416723,0.0006010566,0.0013090757,0.0003797674,0.0012630185,0.0012632639,0.0007169569,0.017946811],"category_scores_gemma":[0.0010046756,0.0010522777,0.00086503016,0.0012276751,0.00068884925,0.001341777,0.0023270117,0.0013910381,0.003888248],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006069464,0.00005063746,0.00035103105,0.00043672684,0.00006203959,0.00024793166,0.00042106776,0.1518604,0.046045274,0.08469273,0.020928998,0.69484246],"study_design_scores_gemma":[0.000035870093,0.00012643865,0.0005368303,0.0001817202,0.000060683986,0.0010816547,0.00031419404,0.65385544,0.04959612,0.13343944,0.16068505,0.00008645569],"about_ca_topic_score_codex":0.0016505033,"about_ca_topic_score_gemma":0.0032372356,"teacher_disagreement_score":0.017946811,"about_ca_system_score_codex":0.00039939923,"about_ca_system_score_gemma":0.0002890856,"threshold_uncertainty_score":0.06003803},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6610229,0.0021689374,0.27964398,0.0031412777,0.00010373792,0.0002365344,0.0014587741,0.001527934,0.05069597],"genre_scores_gemma":[0.9027649,0.0011297007,0.08490464,0.0005819187,0.00013275137,0.00019711426,0.0015696004,0.00035857415,0.008360687],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980496,0.00037287394,0.000104005434,0.00063039816,0.00047430454,0.00036880284],"domain_scores_gemma":[0.9870522,0.009259598,0.0015271369,0.0010549923,0.00045092573,0.00065520953],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016296036,0.00092647225,0.0010314776,0.0015999867,0.0012793989,0.0024715895,0.0020614788,0.0017230657,0.012412628],"category_scores_gemma":[0.015336116,0.0009665847,0.001059998,0.0025335276,0.0018999956,0.0069856155,0.003154111,0.0016183577,0.0011520177],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013825267,0.000353419,0.008030634,0.0016249224,0.00021418945,0.00094890816,0.0012183327,0.14608334,0.040447727,0.6842768,0.01323079,0.10218831],"study_design_scores_gemma":[0.00013608864,0.0001673164,0.0020879307,0.000111515335,0.00012348415,0.0006160879,0.00040419702,0.123449974,0.018869054,0.8409084,0.013077937,0.000048021557],"about_ca_topic_score_codex":0.0012655316,"about_ca_topic_score_gemma":0.0019711526,"teacher_disagreement_score":0.012412628,"about_ca_system_score_codex":0.0016172942,"about_ca_system_score_gemma":0.0006796327,"threshold_uncertainty_score":0.04152441},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0043411315,0.000077800316,0.9945663,0.00008596523,0.000031057672,0.000018659099,0.00002163214,0.000047045436,0.00081047264],"genre_scores_gemma":[0.30103812,0.00047428318,0.6938954,0.00012505717,0.000071876704,0.00027833434,0.00014948894,0.00015894482,0.003808569],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996897,0.00010602062,0.000016145823,0.000043883414,0.00012382225,0.000020519174],"domain_scores_gemma":[0.9995877,0.00022079154,0.000052143165,0.00004083049,0.000070322996,0.000028193208],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072088855,0.00057611323,0.00056278554,0.00074427505,0.00037656625,0.0012123407,0.0011829699,0.0013107237,0.0010109253],"category_scores_gemma":[0.0015018815,0.00044394977,0.00078147365,0.0005619068,0.0014035058,0.0006901658,0.0011073617,0.0012823561,0.0003576855],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012662522,0.000029477176,0.00040873155,0.00008739773,0.000016598062,0.00010206202,0.000093006995,0.91155744,0.007250642,0.06419051,0.0004050647,0.015846422],"study_design_scores_gemma":[0.0000022217764,0.000006528769,0.000026982165,0.000003916441,0.0000016713241,0.000009470322,0.0000029034882,0.9943065,0.0005312337,0.004459911,0.000645713,0.0000029776677],"about_ca_topic_score_codex":0.0015875552,"about_ca_topic_score_gemma":0.0010878558,"teacher_disagreement_score":0.0015875552,"about_ca_system_score_codex":0.0006383163,"about_ca_system_score_gemma":0.0008636831,"threshold_uncertainty_score":0.0046313405},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04679793,0.00017103397,0.92293656,0.00025247238,0.00018174431,0.0010305211,0.00060005754,0.018664913,0.00936477],"genre_scores_gemma":[0.20314017,0.0003216664,0.7832852,0.00021808878,0.00004960965,0.0011195105,0.003449218,0.0025154345,0.005901099],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99836534,0.00027733424,0.00009641998,0.00023453585,0.00083819195,0.00018814509],"domain_scores_gemma":[0.99812704,0.00035022848,0.0001163092,0.0004250383,0.0007294938,0.0002518588],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033065039,0.0007741027,0.0005348498,0.0006008481,0.00047148843,0.0012661127,0.002574916,0.0008589256,0.0038887889],"category_scores_gemma":[0.004176945,0.0006057234,0.00056809164,0.00029401967,0.0006517392,0.001961582,0.0024885517,0.0019450391,0.002125571],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006231701,0.0007808135,0.011534746,0.00089486525,0.0001689656,0.0014124723,0.0019669423,0.17674644,0.22442089,0.03275566,0.02328734,0.5254077],"study_design_scores_gemma":[0.00043158943,0.0019382444,0.006948051,0.00028708106,0.00008792219,0.00088031724,0.0004675927,0.62276477,0.18597507,0.008052759,0.17197283,0.0001937631],"about_ca_topic_score_codex":0.0029831794,"about_ca_topic_score_gemma":0.0014792504,"teacher_disagreement_score":0.0038887889,"about_ca_system_score_codex":0.0005790642,"about_ca_system_score_gemma":0.0026930675,"threshold_uncertainty_score":0.017486691},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38616267,0.0018581814,0.28392598,0.0020082411,0.00067738397,0.00012128367,0.0006599203,0.0009672625,0.32361913],"genre_scores_gemma":[0.9018625,0.0013465091,0.042504415,0.00026150912,0.0003681007,0.0000781462,0.00052426645,0.00045830713,0.052596264],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997867,0.000034793775,0.000010187236,0.000037091406,0.00007575815,0.00005549609],"domain_scores_gemma":[0.999577,0.00014307807,0.000064589185,0.000060353952,0.000072135095,0.000082930994],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026346958,0.00055805314,0.00050123426,0.0017682802,0.0010427525,0.0032367108,0.001066677,0.0009608096,0.009300364],"category_scores_gemma":[0.0013355789,0.00041901652,0.00058204256,0.0012430832,0.0014707176,0.0034372627,0.0014309441,0.0019065802,0.0011064447],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014957995,0.000007803461,0.000040502917,0.000019303843,0.000001984944,0.00003535228,0.00019499296,0.0011530025,0.0005924742,0.9902755,0.0013040176,0.0063600675],"study_design_scores_gemma":[0.000006205558,0.000008379968,0.000099742196,0.000012862128,0.0000046976393,0.00007648389,0.00014187017,0.008596577,0.00039375923,0.98551047,0.005139185,0.000009839152],"about_ca_topic_score_codex":0.0016467881,"about_ca_topic_score_gemma":0.0014607796,"teacher_disagreement_score":0.009300364,"about_ca_system_score_codex":0.0010631041,"about_ca_system_score_gemma":0.0003908609,"threshold_uncertainty_score":0.03111279},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009461591,0.000094965566,0.98633665,0.0001525279,0.00008985852,0.000044335306,0.000053926506,0.0011755218,0.002590459],"genre_scores_gemma":[0.23626538,0.00009907108,0.7571931,0.00016738274,0.000079887315,0.00015582173,0.00026093834,0.0006667547,0.005111696],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99899894,0.0002904211,0.00004160421,0.00015108185,0.0004262063,0.00009183673],"domain_scores_gemma":[0.99786466,0.0009949931,0.00013513665,0.00051573757,0.00039066985,0.00009886705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011648501,0.00078744837,0.001495473,0.00069727877,0.00066530844,0.001071145,0.0019818821,0.0017138893,0.00887318],"category_scores_gemma":[0.0050543603,0.0006405214,0.00083104067,0.00087215693,0.00086715515,0.0012960952,0.0018553653,0.0019105714,0.0022747316],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00071903283,0.00020209544,0.00086007814,0.00019737192,0.000073073315,0.00012273605,0.00013924671,0.6486317,0.021936113,0.038430445,0.010574279,0.27811378],"study_design_scores_gemma":[0.000018166604,0.000017802762,0.000030407758,0.0000031592344,0.000002763328,0.00001276935,0.0000059316885,0.99587953,0.00096026756,0.0025343294,0.00053153926,0.0000033477272],"about_ca_topic_score_codex":0.0029848788,"about_ca_topic_score_gemma":0.005387924,"teacher_disagreement_score":0.00887318,"about_ca_system_score_codex":0.00072237704,"about_ca_system_score_gemma":0.0011690208,"threshold_uncertainty_score":0.029683769},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12735301,0.0073528066,0.76854867,0.010805706,0.0007356735,0.000430937,0.002402713,0.0013297672,0.08104074],"genre_scores_gemma":[0.65905845,0.0053153904,0.30314744,0.0018417079,0.00104011,0.00071604707,0.0042457758,0.0011069432,0.023528147],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969043,0.0007183537,0.00013845184,0.00078419456,0.00065566984,0.0007990543],"domain_scores_gemma":[0.98595864,0.010588161,0.0007181471,0.0011335548,0.00073241285,0.0008690993],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002239994,0.0022960126,0.0026019884,0.0015297608,0.0023848247,0.0047236052,0.0055322256,0.003101324,0.017266752],"category_scores_gemma":[0.016349558,0.0008480832,0.0025871487,0.0023044006,0.0026417547,0.012160939,0.0048392536,0.005507237,0.0018809099],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014176584,0.0006228679,0.0063667637,0.0029886286,0.00034862407,0.0007398228,0.0011148786,0.38226324,0.009644463,0.41045967,0.064838365,0.119194955],"study_design_scores_gemma":[0.00011807863,0.00024619748,0.0009983139,0.00020997514,0.00015466339,0.0005868245,0.00042649943,0.59072644,0.0031316876,0.38994914,0.013388177,0.00006403321],"about_ca_topic_score_codex":0.0028051573,"about_ca_topic_score_gemma":0.003194857,"teacher_disagreement_score":0.017266752,"about_ca_system_score_codex":0.0029753875,"about_ca_system_score_gemma":0.0017343427,"threshold_uncertainty_score":0.05776304},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028644914,0.00007311976,0.94844735,0.00018936922,0.00012457451,0.00017752951,0.0015039352,0.011316817,0.009522378],"genre_scores_gemma":[0.11299532,0.00008424122,0.87842304,0.00011032359,0.00003115906,0.00044686891,0.0028525805,0.0021307236,0.0029257275],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99963427,0.000058595833,0.000028202778,0.00004438583,0.00018304608,0.000051446103],"domain_scores_gemma":[0.99903935,0.00033667943,0.00006462688,0.00019337147,0.00029487876,0.000071071474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063063373,0.00077103084,0.00071585196,0.0005770268,0.000497515,0.00081212865,0.0020230908,0.00081627665,0.0089436],"category_scores_gemma":[0.0020775867,0.00041620954,0.00084087776,0.00095751975,0.00045965082,0.00079546566,0.0012613372,0.0012843277,0.0028428368],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022470328,0.00025500017,0.0041264216,0.00038307413,0.00010190478,0.00059920765,0.00042862518,0.6742791,0.028142141,0.0537205,0.051630497,0.18610878],"study_design_scores_gemma":[0.00011140329,0.000027981112,0.00019769797,0.0000137506,0.00000485316,0.00006920196,0.000033214834,0.97986686,0.0043239356,0.007149696,0.00818737,0.0000140407],"about_ca_topic_score_codex":0.003878175,"about_ca_topic_score_gemma":0.0048094424,"teacher_disagreement_score":0.0089436,"about_ca_system_score_codex":0.00048314143,"about_ca_system_score_gemma":0.0016411672,"threshold_uncertainty_score":0.029919267},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.063384265,0.028552761,0.70497644,0.0091699045,0.002118602,0.00046830485,0.0055163093,0.0027216051,0.18309179],"genre_scores_gemma":[0.45995712,0.023939142,0.44635847,0.0045163683,0.0041146483,0.001667325,0.009535677,0.0031345147,0.046776656],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99266326,0.0012645348,0.0002842307,0.0012905452,0.0025545962,0.0019428532],"domain_scores_gemma":[0.97453296,0.017378528,0.0012106802,0.0031723499,0.0024742645,0.0012313229],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005278088,0.0047970423,0.0030791233,0.0062454953,0.002529263,0.0058892844,0.0070961397,0.002730589,0.029611766],"category_scores_gemma":[0.035337314,0.0017110956,0.0043269494,0.009049733,0.003603596,0.022459263,0.007656257,0.012675978,0.0075401547],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013975592,0.0005109915,0.0039162454,0.001834026,0.00034049302,0.0006420146,0.0013416997,0.11325186,0.01176317,0.61605173,0.07435212,0.17459811],"study_design_scores_gemma":[0.00011550005,0.00029635653,0.0028913098,0.0006086173,0.0003928324,0.00071934226,0.00036171195,0.2745641,0.005906997,0.6508917,0.06308019,0.00017132428],"about_ca_topic_score_codex":0.007772956,"about_ca_topic_score_gemma":0.009719945,"teacher_disagreement_score":0.029611766,"about_ca_system_score_codex":0.006742556,"about_ca_system_score_gemma":0.002371145,"threshold_uncertainty_score":0.09906125},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28166756,0.001464046,0.6650134,0.00033314273,0.00015317922,0.000096558266,0.00074728037,0.00096529967,0.049559627],"genre_scores_gemma":[0.7129461,0.00090259215,0.25734457,0.00007930228,0.00008527152,0.00015999499,0.0010653539,0.0006422183,0.026774572],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995741,0.000106346066,0.000023473238,0.000060012855,0.00017362944,0.00006247221],"domain_scores_gemma":[0.9992902,0.00033754305,0.00006169448,0.00017564667,0.000077747485,0.000057003297],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025673362,0.00079643045,0.0013395911,0.0008347645,0.00054867245,0.0009945291,0.001204314,0.0008336588,0.006909307],"category_scores_gemma":[0.0026086892,0.0006000503,0.0005642032,0.0010641043,0.00064139557,0.0012500653,0.0023820559,0.0011044724,0.0011216518],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012591999,0.00014030494,0.002228326,0.0010669802,0.00012156968,0.0004172561,0.0005463892,0.27565792,0.062180318,0.21046843,0.017256187,0.4286571],"study_design_scores_gemma":[0.00009137478,0.00051578006,0.0029315301,0.00010712891,0.00005008496,0.00091903115,0.00025577442,0.714122,0.029230772,0.22995053,0.021787278,0.000038763385],"about_ca_topic_score_codex":0.0007420728,"about_ca_topic_score_gemma":0.00065318216,"teacher_disagreement_score":0.006909307,"about_ca_system_score_codex":0.00039180118,"about_ca_system_score_gemma":0.0002133482,"threshold_uncertainty_score":0.023113966},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0055365185,0.00021251594,0.9873772,0.000073218216,0.00016979966,0.00007506598,0.00008180602,0.000809353,0.0056645675],"genre_scores_gemma":[0.03229214,0.00022212994,0.95491374,0.000063123094,0.00005102235,0.00014685812,0.00021882466,0.00049429596,0.011597858],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990521,0.00012787113,0.000054340824,0.00019912604,0.0004773133,0.00008923277],"domain_scores_gemma":[0.99913895,0.0002269736,0.000039787745,0.00033892423,0.00021183865,0.000043400007],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007488899,0.001460977,0.0016110957,0.0013728589,0.00084480335,0.0013581442,0.0038415617,0.0015229572,0.016548652],"category_scores_gemma":[0.002548184,0.0008494221,0.0019836305,0.0018979487,0.0014384422,0.0023059675,0.0038166072,0.002946845,0.0027962814],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003151979,0.00014681461,0.00048246572,0.0004901649,0.0001031629,0.0001400581,0.00028794183,0.21754692,0.020120194,0.17355026,0.0108956285,0.5759211],"study_design_scores_gemma":[0.0000754409,0.00008871959,0.00037265528,0.000042001157,0.000054366905,0.00023303185,0.000082864615,0.86992836,0.0063980687,0.10351672,0.019154714,0.000053038006],"about_ca_topic_score_codex":0.0028610427,"about_ca_topic_score_gemma":0.0061268215,"teacher_disagreement_score":0.016548652,"about_ca_system_score_codex":0.0010445312,"about_ca_system_score_gemma":0.001014351,"threshold_uncertainty_score":0.055360794},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6053056,0.001091491,0.33135974,0.0014129835,0.00062223984,0.00019311471,0.0008053026,0.0014478011,0.057761703],"genre_scores_gemma":[0.88522285,0.0013208232,0.06388195,0.0004297905,0.0009097954,0.00015727525,0.0026932165,0.0008484691,0.04453588],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992126,0.000110846544,0.00006584115,0.00020530155,0.00025394934,0.00015133612],"domain_scores_gemma":[0.9974082,0.000970593,0.0005159399,0.00024165295,0.0004126067,0.00045100754],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007516308,0.0009935659,0.0011111478,0.0048626987,0.0017594126,0.004122228,0.0014164371,0.0017729232,0.010558332],"category_scores_gemma":[0.0031362441,0.0006173298,0.0011043225,0.0022637758,0.0028525398,0.0048446646,0.0019052468,0.0031599172,0.0022589152],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001845671,0.00018190852,0.0020540573,0.00013087531,0.000019922452,0.00026930988,0.0009783546,0.0024042276,0.0047193114,0.93778807,0.004938933,0.04633055],"study_design_scores_gemma":[0.000072831834,0.00028332794,0.0028411436,0.00011691905,0.000055516073,0.00091917836,0.0009394768,0.03186269,0.008123832,0.9301026,0.0246068,0.00007575299],"about_ca_topic_score_codex":0.0008537279,"about_ca_topic_score_gemma":0.0004412033,"teacher_disagreement_score":0.010558332,"about_ca_system_score_codex":0.00091946777,"about_ca_system_score_gemma":0.00057962554,"threshold_uncertainty_score":0.035321176},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043961722,0.00036435176,0.93632704,0.0003598531,0.00017982816,0.00036499882,0.0009924924,0.002596026,0.014853762],"genre_scores_gemma":[0.25349784,0.00038473366,0.7351916,0.00007667137,0.000060564715,0.00021505235,0.0021878418,0.0007422547,0.0076434407],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99926275,0.000055729044,0.00004387948,0.00018463665,0.0003754584,0.00007757219],"domain_scores_gemma":[0.99913496,0.00022182633,0.00011792393,0.00019005197,0.00025957086,0.00007570004],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002965217,0.00069295336,0.00090765697,0.001517372,0.0009373789,0.001561046,0.0011927832,0.0009663206,0.007695611],"category_scores_gemma":[0.0041831974,0.00055936695,0.00081720325,0.0012333614,0.0011264875,0.0017162291,0.002380522,0.0008437483,0.0027974837],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007129603,0.00012964595,0.004667486,0.0009809835,0.00008205648,0.0012411649,0.000815801,0.112989336,0.04809181,0.20651214,0.03710019,0.5866764],"study_design_scores_gemma":[0.00016789942,0.00026558642,0.001695112,0.00018105221,0.00005706228,0.0017266521,0.0005269706,0.6024899,0.050048627,0.25010285,0.09262975,0.00010856457],"about_ca_topic_score_codex":0.001831824,"about_ca_topic_score_gemma":0.0016328861,"teacher_disagreement_score":0.007695611,"about_ca_system_score_codex":0.00058206613,"about_ca_system_score_gemma":0.0010333493,"threshold_uncertainty_score":0.025744379},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011312355,0.0020031102,0.95928985,0.0013696124,0.00026943046,0.00017256908,0.0008599341,0.00021572145,0.024507333],"genre_scores_gemma":[0.2619526,0.0048575727,0.700673,0.0009660708,0.00059414713,0.00088934007,0.0032879377,0.0005787631,0.026200598],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974438,0.00093881524,0.00014507861,0.0006927039,0.00054964924,0.00022993408],"domain_scores_gemma":[0.99581593,0.0031486277,0.00027953045,0.0002824796,0.00034632147,0.00012717742],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001915809,0.0022761002,0.0024759127,0.0012200286,0.0013096131,0.0032682212,0.002099831,0.0028761963,0.011730667],"category_scores_gemma":[0.009011669,0.00096892304,0.0017916381,0.0024619962,0.0019180877,0.0033233974,0.0031593149,0.003186757,0.0017675919],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008288271,0.00008548792,0.0005942184,0.0005621734,0.00010079723,0.00032485608,0.0001312434,0.62764317,0.0007701643,0.3066393,0.011177472,0.051888235],"study_design_scores_gemma":[0.00003649724,0.00005784218,0.00022545796,0.00010029818,0.000025671545,0.00021117572,0.00011274248,0.63402236,0.00055818463,0.33935925,0.025259733,0.0000308246],"about_ca_topic_score_codex":0.0036617212,"about_ca_topic_score_gemma":0.0028936726,"teacher_disagreement_score":0.011730667,"about_ca_system_score_codex":0.0017911462,"about_ca_system_score_gemma":0.0015571639,"threshold_uncertainty_score":0.039242983},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0071927393,0.004899428,0.53881925,0.0010561914,0.0025987485,0.0001481451,0.0015317876,0.002150997,0.44160268],"genre_scores_gemma":[0.11578768,0.011969893,0.42932165,0.0006188415,0.0017460004,0.0003128417,0.004369016,0.0023592685,0.43351486],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997216,0.000030132782,0.000017113562,0.00005965477,0.0001527733,0.000018721365],"domain_scores_gemma":[0.99976784,0.000060145732,0.000012071149,0.000062202555,0.00006797722,0.00002986644],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025862065,0.00084366545,0.000719713,0.001836525,0.00071113073,0.0027733739,0.0010682773,0.0005644299,0.03872835],"category_scores_gemma":[0.00091668137,0.00044161483,0.00060243136,0.0030925176,0.0009107409,0.0028815605,0.0017003542,0.0016217729,0.014607719],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031277035,0.000014966651,0.000110118366,0.00028908436,0.000012355491,0.0001292776,0.00016509833,0.0052551073,0.0028563363,0.7323604,0.06387745,0.19489856],"study_design_scores_gemma":[0.000011319063,0.000032090302,0.00018944505,0.00007843039,0.000015671514,0.00062162033,0.00009769342,0.0145538,0.0017142926,0.49611992,0.48654982,0.00001582416],"about_ca_topic_score_codex":0.0004932922,"about_ca_topic_score_gemma":0.0006679129,"teacher_disagreement_score":0.03872835,"about_ca_system_score_codex":0.0005373993,"about_ca_system_score_gemma":0.0003713757,"threshold_uncertainty_score":0.12955928},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08088472,0.004217301,0.87873065,0.002737621,0.00044740416,0.00021429213,0.0017850153,0.009295248,0.021687787],"genre_scores_gemma":[0.49828655,0.0019761992,0.47910106,0.00088673935,0.00046759954,0.00038883288,0.0031912602,0.0012450534,0.01445675],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99848735,0.00023018321,0.000079042744,0.00038482412,0.00060061517,0.000217947],"domain_scores_gemma":[0.99569416,0.0018436932,0.00032077607,0.0015603745,0.0003950286,0.00018589987],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013753171,0.001628569,0.0013473115,0.00089525856,0.00068896386,0.0017326213,0.0026585183,0.0015776054,0.010284374],"category_scores_gemma":[0.01246416,0.00049934746,0.0010480334,0.002774151,0.0011263668,0.0077941827,0.0027902194,0.0026413288,0.004425083],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0030216873,0.00048782976,0.002451885,0.0013356106,0.00023208348,0.0003924932,0.000635232,0.3872329,0.024940621,0.12145573,0.053139716,0.4046742],"study_design_scores_gemma":[0.00015803035,0.00024211996,0.00047066438,0.00007362682,0.000075122596,0.00038256642,0.00009433355,0.86475575,0.007300093,0.11154221,0.014878176,0.000027257984],"about_ca_topic_score_codex":0.0024864883,"about_ca_topic_score_gemma":0.003562521,"teacher_disagreement_score":0.010284374,"about_ca_system_score_codex":0.0018748029,"about_ca_system_score_gemma":0.0011108574,"threshold_uncertainty_score":0.034404635},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2954401,0.0037994515,0.5974542,0.0071971803,0.0006623581,0.0003912925,0.003481982,0.00756502,0.08400848],"genre_scores_gemma":[0.7537308,0.0021915054,0.20856272,0.0011530088,0.00052244985,0.0006779016,0.0062828143,0.0020428693,0.02483596],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9957194,0.0006384595,0.00020650972,0.0011691508,0.0013366836,0.0009298235],"domain_scores_gemma":[0.97829586,0.012765771,0.0008979311,0.006100268,0.0010594198,0.0008807625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002079011,0.0030945912,0.0016557928,0.0013469484,0.0020232669,0.004734839,0.005756307,0.0022444415,0.030184897],"category_scores_gemma":[0.017169062,0.0015896525,0.002423384,0.0026070548,0.0026331022,0.020397399,0.009162798,0.00544313,0.007066324],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0046844594,0.0011196799,0.010228331,0.0027735492,0.0005209255,0.0012340199,0.0012322289,0.18023865,0.065701,0.30082464,0.06441329,0.3670292],"study_design_scores_gemma":[0.0005202689,0.0006302173,0.0028726866,0.00020387587,0.00045764865,0.0013303345,0.0005152841,0.48731884,0.031780865,0.44404164,0.030190654,0.00013763092],"about_ca_topic_score_codex":0.0012911427,"about_ca_topic_score_gemma":0.0030483075,"teacher_disagreement_score":0.030184897,"about_ca_system_score_codex":0.0021052535,"about_ca_system_score_gemma":0.0014635392,"threshold_uncertainty_score":0.10097855},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0068592057,0.00006685357,0.99038094,0.00007111939,0.000044738914,0.001313533,0.00006393915,0.00024180833,0.0009577008],"genre_scores_gemma":[0.056153033,0.00007808322,0.93719006,0.00012509749,0.000028638091,0.0059446557,0.000090202964,0.00006347388,0.00032685755],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9288391,0.05842137,0.0016237589,0.0038175574,0.006839097,0.00045900312],"domain_scores_gemma":[0.84048504,0.12893009,0.006315494,0.01497515,0.008223441,0.0010707718],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.050988343,0.0010300414,0.001576257,0.0025975604,0.0008222504,0.0018038421,0.0028399322,0.0014963776,0.005660249],"category_scores_gemma":[0.12166353,0.00081276655,0.0013191277,0.002045579,0.0028588874,0.002531728,0.0023433163,0.0025504138,0.00070451805],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019785538,0.0011405841,0.0071152914,0.0019938701,0.00094250427,0.00020089699,0.0012305275,0.1675002,0.0086748665,0.47157547,0.0025736608,0.3350736],"study_design_scores_gemma":[0.0015924554,0.0047328095,0.004098541,0.00033384882,0.00047705253,0.00018876191,0.00028372105,0.58889294,0.011339097,0.36840636,0.019454654,0.00019970122],"about_ca_topic_score_codex":0.00058581313,"about_ca_topic_score_gemma":0.00074012356,"teacher_disagreement_score":0.050988343,"about_ca_system_score_codex":0.001379,"about_ca_system_score_gemma":0.002886611,"threshold_uncertainty_score":0.26965535},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.71333057,0.0059131416,0.20066157,0.0022602037,0.00017890111,0.00023816421,0.0028302614,0.0005844073,0.07400269],"genre_scores_gemma":[0.90591234,0.0027733801,0.071352094,0.0007067396,0.00018693494,0.00013934204,0.004025731,0.00012626933,0.014777135],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99965155,0.0000501641,0.000019263023,0.00009871932,0.000084935484,0.00009528248],"domain_scores_gemma":[0.99924326,0.00024596442,0.00021654656,0.00008340314,0.00008674407,0.0001241644],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002756166,0.0003938796,0.00037206995,0.0013063524,0.0008124471,0.0018471341,0.0006006469,0.00060604216,0.004439003],"category_scores_gemma":[0.0010763269,0.00048840453,0.0008423048,0.001868095,0.000978619,0.0015815768,0.0010418117,0.0010256456,0.0005130576],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001421667,0.00009479109,0.0032635443,0.00027092022,0.00006251843,0.00042619844,0.0013452726,0.0121084945,0.012255525,0.91933066,0.008455888,0.04224397],"study_design_scores_gemma":[0.00004363573,0.00005980838,0.0038057968,0.00010866594,0.00007009373,0.0006513413,0.00061773934,0.023662183,0.0034394034,0.94611716,0.021398604,0.000025634807],"about_ca_topic_score_codex":0.003382597,"about_ca_topic_score_gemma":0.0039173663,"teacher_disagreement_score":0.004439003,"about_ca_system_score_codex":0.0014456979,"about_ca_system_score_gemma":0.00043644922,"threshold_uncertainty_score":0.014849901},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006834459,0.00007114145,0.9905048,0.000045099277,0.000049895883,0.00004776566,0.00003145607,0.0005519204,0.0018635566],"genre_scores_gemma":[0.12345455,0.00017065638,0.8725833,0.00007560095,0.00008157528,0.00008546342,0.0001378265,0.00023606974,0.0031750076],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993451,0.000090916445,0.000033272554,0.00013807818,0.00032806527,0.00006455954],"domain_scores_gemma":[0.99939406,0.00016617952,0.00006535635,0.00017632973,0.00014597297,0.00005213013],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005531363,0.0007820085,0.0006943465,0.00090003747,0.00043487485,0.0010704182,0.0016501632,0.00076782744,0.005757112],"category_scores_gemma":[0.0013470826,0.00038374422,0.0006771023,0.0009517768,0.00063012575,0.0010292542,0.0017004245,0.0011413101,0.0013594986],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040306788,0.00016824817,0.00090932637,0.000410203,0.0001005063,0.00083481095,0.00039734715,0.1946669,0.20988837,0.07161895,0.008527664,0.5120746],"study_design_scores_gemma":[0.0000246302,0.00012132583,0.00021734451,0.000016433607,0.000018782432,0.00032534057,0.00005344217,0.9427786,0.038609672,0.0057821344,0.012027109,0.000025310224],"about_ca_topic_score_codex":0.0012030366,"about_ca_topic_score_gemma":0.00075225596,"teacher_disagreement_score":0.005757112,"about_ca_system_score_codex":0.00032560466,"about_ca_system_score_gemma":0.00052609557,"threshold_uncertainty_score":0.019259512},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08343562,0.0001553362,0.90695167,0.00017865552,0.000050306393,0.00005912575,0.00015780525,0.00064184767,0.008369528],"genre_scores_gemma":[0.6845891,0.0002633167,0.30900922,0.000099638644,0.000026069649,0.00022816844,0.00021281435,0.0002807303,0.0052910675],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998534,0.000032973672,0.0000075278463,0.000025692856,0.000063403306,0.000016965363],"domain_scores_gemma":[0.99969304,0.00013285625,0.000032201446,0.000082617655,0.000032448803,0.000026924155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027263924,0.00040234235,0.00045197192,0.00026045597,0.00039353097,0.0011362995,0.001110376,0.001189229,0.0030048285],"category_scores_gemma":[0.00070624234,0.00028297596,0.0004442245,0.00031266472,0.0008666451,0.0011307984,0.00088205823,0.00085119647,0.0004812025],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042712916,0.00004114723,0.0007806693,0.000059658607,0.000011509015,0.00010081721,0.00009438206,0.9296518,0.017505638,0.037093956,0.00040844173,0.014209265],"study_design_scores_gemma":[0.00000510734,0.000010646144,0.00006772489,0.0000033794113,0.0000012821394,0.000014766886,0.0000067657784,0.99245065,0.0021260118,0.0037161673,0.0015940315,0.0000034850962],"about_ca_topic_score_codex":0.0013817772,"about_ca_topic_score_gemma":0.0015075598,"teacher_disagreement_score":0.0030048285,"about_ca_system_score_codex":0.0004126311,"about_ca_system_score_gemma":0.0005453185,"threshold_uncertainty_score":0.0100521445},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28932187,0.00048383177,0.6758803,0.00029118508,0.00014427441,0.0001347822,0.00042630383,0.00086065533,0.03245681],"genre_scores_gemma":[0.6387131,0.00034559495,0.35085997,0.000040626608,0.000028508566,0.000057654503,0.0005113843,0.00045533042,0.008987746],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99982244,0.00003349739,0.000013076722,0.00003615088,0.000072413924,0.000022341668],"domain_scores_gemma":[0.9995765,0.00021783504,0.00005022165,0.00006406067,0.00005589059,0.000035574227],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027617082,0.00055902184,0.00075371657,0.00059271813,0.00036413086,0.0012613697,0.0010519259,0.0007937148,0.0028718247],"category_scores_gemma":[0.0024759278,0.00042161788,0.00043649186,0.00074063794,0.0009190728,0.00078780594,0.0014568439,0.00091415277,0.00110799],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011255404,0.0001389189,0.00455539,0.00095934427,0.00006857696,0.0013333461,0.0013198799,0.53105915,0.039219096,0.1563505,0.010683418,0.2531869],"study_design_scores_gemma":[0.000046603796,0.00011590335,0.00061417796,0.00005640146,0.000019984489,0.00050490705,0.00024752188,0.9397059,0.0058246832,0.043311533,0.009530368,0.00002206014],"about_ca_topic_score_codex":0.0019780726,"about_ca_topic_score_gemma":0.0020003954,"teacher_disagreement_score":0.0028718247,"about_ca_system_score_codex":0.0004954802,"about_ca_system_score_gemma":0.00031537557,"threshold_uncertainty_score":0.009607196},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20473373,0.005522036,0.6372857,0.01260789,0.0015819331,0.00046612564,0.0043174415,0.0064102574,0.12707484],"genre_scores_gemma":[0.70521665,0.004355871,0.226677,0.0030441904,0.001674117,0.00089607446,0.006935301,0.004341677,0.046859056],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9922666,0.0011866392,0.0004134349,0.0019323335,0.0023563954,0.0018445965],"domain_scores_gemma":[0.9528374,0.032988634,0.0013711693,0.008635075,0.0021962875,0.0019713049],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045297304,0.004832202,0.0030966278,0.0030038073,0.0030629872,0.010750107,0.009493678,0.004312568,0.037017137],"category_scores_gemma":[0.037642036,0.0030916973,0.0040256716,0.0055161626,0.004367826,0.039395105,0.015652757,0.010109762,0.008136803],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0038420998,0.001072371,0.0059670247,0.002851114,0.0004671703,0.00093384215,0.0015498754,0.12235686,0.026138334,0.54748726,0.06415479,0.2231793],"study_design_scores_gemma":[0.0002726495,0.000228629,0.0010126047,0.00019328711,0.00035948533,0.0004776015,0.00042474078,0.23431227,0.009101904,0.73896486,0.014549892,0.00010204863],"about_ca_topic_score_codex":0.0021675609,"about_ca_topic_score_gemma":0.0041022818,"teacher_disagreement_score":0.037017137,"about_ca_system_score_codex":0.0043254765,"about_ca_system_score_gemma":0.0029071565,"threshold_uncertainty_score":0.12383467},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030415969,0.000039899045,0.99455124,0.00009062237,0.000037412156,0.000026873104,0.000040381565,0.00038658775,0.0017853422],"genre_scores_gemma":[0.08686891,0.00011771502,0.90940243,0.00013324353,0.000057332207,0.00025209933,0.00016003761,0.00028343106,0.0027248382],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994584,0.00012144239,0.000023975012,0.000043236705,0.0003113429,0.000041663017],"domain_scores_gemma":[0.999476,0.00022384625,0.00004519751,0.00009505221,0.00011386973,0.000046046243],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006322378,0.00044531372,0.0006952808,0.00034745692,0.00054679165,0.0006772514,0.0013537807,0.0011018174,0.0051157773],"category_scores_gemma":[0.0018583429,0.00045174322,0.00074798026,0.00042430215,0.00067198003,0.00070525805,0.0018352842,0.0021954526,0.0014742104],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013455824,0.0001426925,0.00073993346,0.00025275804,0.00006801181,0.00021088788,0.00025222515,0.68388146,0.04272608,0.108244166,0.00841627,0.15493096],"study_design_scores_gemma":[0.000012976351,0.000014935533,0.00004036445,0.000007121821,0.0000035595779,0.000016513739,0.0000051252787,0.9897781,0.002999709,0.00400714,0.003108267,0.0000062032973],"about_ca_topic_score_codex":0.0022283408,"about_ca_topic_score_gemma":0.0026715205,"teacher_disagreement_score":0.0051157773,"about_ca_system_score_codex":0.00034981442,"about_ca_system_score_gemma":0.0011300676,"threshold_uncertainty_score":0.017113984},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43826395,0.0013453711,0.15367705,0.0020882813,0.0011249238,0.00012332968,0.00092250295,0.00063135003,0.40182325],"genre_scores_gemma":[0.945942,0.00046367996,0.012947445,0.0002560281,0.00035656735,0.00005183615,0.0004658007,0.00020304373,0.039313525],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993206,0.00011362121,0.000032260905,0.00010734832,0.00023719728,0.00018898575],"domain_scores_gemma":[0.9993098,0.0001747807,0.0001089472,0.000121977144,0.00012381862,0.00016072969],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043619072,0.0005566677,0.00064040604,0.0014619442,0.0016562192,0.0035192424,0.0006765937,0.00093830324,0.016788967],"category_scores_gemma":[0.0018422568,0.00030550384,0.0008227454,0.00062505825,0.0026083034,0.0023575367,0.0024073746,0.0017981671,0.002332202],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014941644,0.0000061109986,0.00005713555,0.000016055748,0.0000026515984,0.000070529706,0.00010446723,0.0013500769,0.00027898606,0.995456,0.0009594561,0.0016837622],"study_design_scores_gemma":[0.000013871386,0.000025344403,0.00017326562,0.000017091084,0.0000045353254,0.00011674002,0.00023147171,0.008060745,0.00039124515,0.9844401,0.0065095187,0.000016137776],"about_ca_topic_score_codex":0.0011609967,"about_ca_topic_score_gemma":0.0011796071,"teacher_disagreement_score":0.016788967,"about_ca_system_score_codex":0.0012000016,"about_ca_system_score_gemma":0.0005645238,"threshold_uncertainty_score":0.056164682},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0305546,0.0012466614,0.730569,0.0006709094,0.0006526198,0.000324499,0.0019103611,0.0027280054,0.23134336],"genre_scores_gemma":[0.22126868,0.0030828742,0.52974737,0.00032581209,0.00019451827,0.00036532347,0.003897793,0.0015697712,0.23954791],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99950564,0.00009146306,0.000024344517,0.0001387128,0.0001787315,0.0000610877],"domain_scores_gemma":[0.9992361,0.00020854086,0.00006109441,0.00027584418,0.00017113319,0.0000472283],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001900665,0.0010611189,0.00067516946,0.00065484265,0.0006511975,0.0012169704,0.0022674634,0.0010615546,0.06830495],"category_scores_gemma":[0.0015135767,0.0009221955,0.0005014873,0.0012249396,0.00048631313,0.0019453837,0.0011857828,0.0015070962,0.017849416],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027202247,0.00015757114,0.00033203448,0.0013200849,0.000048088947,0.0006041621,0.00031435315,0.054233633,0.03620771,0.19420315,0.10075544,0.6115519],"study_design_scores_gemma":[0.00016871176,0.00024831068,0.002274095,0.00037479887,0.00008590066,0.0027154353,0.00036264517,0.17358395,0.02916892,0.29054365,0.50036424,0.00010935119],"about_ca_topic_score_codex":0.0010841251,"about_ca_topic_score_gemma":0.002990684,"teacher_disagreement_score":0.06830495,"about_ca_system_score_codex":0.0005603173,"about_ca_system_score_gemma":0.00032323797,"threshold_uncertainty_score":0.22850287},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25011483,0.0024894108,0.6536037,0.001274146,0.0004717714,0.0001937694,0.0004754607,0.00097159366,0.09040531],"genre_scores_gemma":[0.7856128,0.0027706043,0.1735361,0.00043798907,0.00048467974,0.00015038611,0.0006437144,0.0006941122,0.035669684],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994784,0.00014686279,0.000034315017,0.00013164985,0.00012427299,0.00008451527],"domain_scores_gemma":[0.9964193,0.0022609602,0.00038711025,0.00030013447,0.0003005194,0.00033192628],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082657696,0.0010792583,0.0012790072,0.0054252245,0.002062145,0.0024207698,0.0018549938,0.0019909884,0.012440915],"category_scores_gemma":[0.006248654,0.0008945833,0.001424532,0.00609519,0.0027707918,0.0040040454,0.0029486318,0.0026667363,0.00087594916],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006973891,0.0000665626,0.001350336,0.00016115411,0.00002297849,0.0004701029,0.0007158086,0.045435984,0.0020046153,0.91058433,0.0041952175,0.034923207],"study_design_scores_gemma":[0.000016257056,0.00004305155,0.0005198471,0.00007469122,0.000023852723,0.00025036436,0.00023747102,0.16730943,0.0006221501,0.8240394,0.0068371207,0.000026351016],"about_ca_topic_score_codex":0.0034948708,"about_ca_topic_score_gemma":0.004159523,"teacher_disagreement_score":0.012440915,"about_ca_system_score_codex":0.0016033349,"about_ca_system_score_gemma":0.00047712607,"threshold_uncertainty_score":0.041619003},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27124444,0.0012650653,0.60707825,0.0010445113,0.0005010249,0.00026831104,0.0008346628,0.0010670059,0.11669676],"genre_scores_gemma":[0.86139125,0.0004950298,0.113411166,0.00013457579,0.00011967205,0.00019158405,0.0004983077,0.00036035723,0.023398107],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996306,0.00007813303,0.000018734161,0.00007620177,0.00014465093,0.00005167707],"domain_scores_gemma":[0.99905974,0.0004372711,0.0001187001,0.00017299216,0.00012099925,0.000090285226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025125194,0.0006554867,0.00066085707,0.0009045346,0.00072944316,0.0015305927,0.0006811542,0.00076802174,0.009410046],"category_scores_gemma":[0.0024471472,0.0007107855,0.0004615381,0.0007639039,0.0011115458,0.0013245385,0.0017610413,0.0008764317,0.0012253193],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00049045583,0.00022999954,0.0049607847,0.0007426728,0.00008637437,0.002161468,0.00038514056,0.2933132,0.04415065,0.508137,0.014292463,0.13104981],"study_design_scores_gemma":[0.00010219786,0.00020809309,0.0035002236,0.00006437184,0.000064707034,0.0020182957,0.00034810073,0.7092718,0.018236853,0.22841674,0.03771352,0.00005517053],"about_ca_topic_score_codex":0.0005383324,"about_ca_topic_score_gemma":0.000724292,"teacher_disagreement_score":0.009410046,"about_ca_system_score_codex":0.00025343263,"about_ca_system_score_gemma":0.0003187298,"threshold_uncertainty_score":0.031479776},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16969287,0.0017706719,0.8193754,0.00045668034,0.000066842105,0.00022105142,0.0031182524,0.0024282068,0.002869988],"genre_scores_gemma":[0.6069944,0.00067578047,0.38685134,0.00010862116,0.00007190384,0.0002008823,0.0031636772,0.0006161442,0.0013172494],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99720407,0.00035293543,0.00027508827,0.00076461595,0.001125953,0.00027732278],"domain_scores_gemma":[0.9808755,0.00949962,0.0028695778,0.003433055,0.002276821,0.0010454311],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025986887,0.0010108035,0.0012809853,0.005429203,0.001217241,0.0030791601,0.001951876,0.0016402558,0.003188002],"category_scores_gemma":[0.03090491,0.0008097547,0.0010560724,0.0052486914,0.0022165077,0.007689728,0.004002167,0.0021219945,0.00070924073],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014861706,0.00022250388,0.1000947,0.0013167156,0.0003051162,0.00037043015,0.0029751998,0.26569837,0.027267804,0.13297723,0.008855836,0.4584299],"study_design_scores_gemma":[0.000052675718,0.00029132175,0.018024605,0.00022084672,0.00006690452,0.00072930567,0.000856241,0.8182389,0.020556493,0.12676917,0.014075013,0.00011862441],"about_ca_topic_score_codex":0.0040225396,"about_ca_topic_score_gemma":0.005028619,"teacher_disagreement_score":0.005429203,"about_ca_system_score_codex":0.002082162,"about_ca_system_score_gemma":0.0011906951,"threshold_uncertainty_score":0.015107274},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01653783,0.0035198713,0.9361053,0.004290222,0.00044601914,0.0000572247,0.00009198053,0.00011276302,0.038838826],"genre_scores_gemma":[0.69375885,0.005048545,0.271686,0.0012115566,0.0010639885,0.00031654225,0.00036634094,0.0003181335,0.02623006],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99699485,0.0016130848,0.000099542325,0.00039214917,0.00070412585,0.00019626963],"domain_scores_gemma":[0.99460757,0.00376592,0.00037957192,0.00028839207,0.000656588,0.00030196147],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002536602,0.0009818148,0.001310803,0.0010979171,0.00095213554,0.0021731528,0.0010421214,0.0013467291,0.0045132856],"category_scores_gemma":[0.011842128,0.0004171505,0.000880918,0.0010599964,0.0044051083,0.002659454,0.0030562095,0.0036647427,0.000690632],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055757457,0.000027789762,0.00020841745,0.00010299903,0.00002186208,0.000076026874,0.000098248245,0.054068424,0.00073285645,0.92236227,0.006445269,0.015800098],"study_design_scores_gemma":[0.00001917765,0.000039167764,0.00018668635,0.00005159663,0.000008316972,0.0000619491,0.000055545264,0.19361393,0.00057509117,0.79725814,0.008116988,0.000013377426],"about_ca_topic_score_codex":0.0020629172,"about_ca_topic_score_gemma":0.0009516652,"teacher_disagreement_score":0.0045132856,"about_ca_system_score_codex":0.0014965009,"about_ca_system_score_gemma":0.0010878355,"threshold_uncertainty_score":0.015098453},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.058877338,0.0007761483,0.880446,0.00020888673,0.00016429798,0.000058584537,0.00030960882,0.0011078366,0.05805127],"genre_scores_gemma":[0.6201008,0.0018591422,0.30463693,0.0001387021,0.00016461358,0.00010286285,0.0011366984,0.0013181632,0.070542105],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997422,0.000032026834,0.000014167407,0.000067804554,0.00007056538,0.0000732636],"domain_scores_gemma":[0.99937844,0.00024201508,0.00007276368,0.00015697362,0.0000899199,0.000059748152],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020593789,0.00053433544,0.0007235808,0.00050299143,0.0006960857,0.0015864598,0.0008942752,0.0006931429,0.010694852],"category_scores_gemma":[0.0015257783,0.00046255862,0.0006002065,0.00082560006,0.0009323495,0.002225997,0.0024512375,0.0017003663,0.0025393122],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00060557824,0.00008739616,0.0010181671,0.0005140255,0.000051714927,0.00052999536,0.0010021998,0.05951796,0.037897214,0.6421259,0.013894708,0.24275516],"study_design_scores_gemma":[0.000051687726,0.00015056776,0.0010309959,0.00012619869,0.00005110538,0.0007975593,0.0004233489,0.2789239,0.020112572,0.65372956,0.04455048,0.000052138344],"about_ca_topic_score_codex":0.0016405728,"about_ca_topic_score_gemma":0.001557519,"teacher_disagreement_score":0.010694852,"about_ca_system_score_codex":0.0005935378,"about_ca_system_score_gemma":0.0005086016,"threshold_uncertainty_score":0.035777867},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.091049306,0.00009944038,0.8892333,0.00025735598,0.00013573987,0.00029951503,0.00019356953,0.0019381514,0.016793575],"genre_scores_gemma":[0.76955974,0.000106989384,0.21834113,0.00011381534,0.000018217055,0.00027152576,0.0004639295,0.0007136719,0.01041099],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99944526,0.00011519713,0.000026821877,0.00011691183,0.00020834574,0.00008740007],"domain_scores_gemma":[0.9984012,0.00073777087,0.00012770535,0.0003691462,0.00020594378,0.00015830592],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088998885,0.0007449005,0.00057620875,0.00056119193,0.0005109495,0.0012846354,0.0015562708,0.0009783113,0.009073682],"category_scores_gemma":[0.0051937765,0.00043291904,0.0006309866,0.00026887402,0.0010725934,0.0013365275,0.0025960663,0.0009596139,0.0010487525],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00050698913,0.00032685546,0.004658523,0.00024399675,0.000097141405,0.0008965509,0.00076203805,0.6925562,0.032115374,0.130283,0.0080088,0.12954457],"study_design_scores_gemma":[0.000035721056,0.000101107915,0.00039434593,0.000036534897,0.0000134389,0.00011738683,0.0001352438,0.9627906,0.008220718,0.021518812,0.006609937,0.000026106482],"about_ca_topic_score_codex":0.0013429022,"about_ca_topic_score_gemma":0.0022760492,"teacher_disagreement_score":0.009073682,"about_ca_system_score_codex":0.0005581862,"about_ca_system_score_gemma":0.00059870817,"threshold_uncertainty_score":0.03035444},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.266888,0.0013786242,0.7006409,0.0016703465,0.000088874156,0.0003198827,0.0018982098,0.0017912046,0.025324017],"genre_scores_gemma":[0.7341965,0.00102569,0.24711442,0.0005018879,0.00019217673,0.00036638175,0.0068841344,0.0009224289,0.008796445],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982256,0.00067261606,0.000059321403,0.0003743215,0.0003640085,0.00030402074],"domain_scores_gemma":[0.9953454,0.0029060384,0.0006146621,0.0005022997,0.00034555755,0.00028603472],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090655923,0.0012020407,0.0012364786,0.0013945956,0.0010229304,0.0016234322,0.0021089632,0.0011164125,0.0071820817],"category_scores_gemma":[0.006564349,0.0011002246,0.0013495029,0.0032460592,0.0012581839,0.004610758,0.0027229388,0.0017708415,0.0008803093],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00075466663,0.00047361344,0.004721813,0.0011857959,0.00026618788,0.00078718236,0.0008250867,0.44259408,0.01034885,0.38310236,0.025764557,0.12917581],"study_design_scores_gemma":[0.000104157974,0.000085142136,0.0016376562,0.00007524265,0.00008835264,0.0004006179,0.00024583814,0.51783556,0.004354482,0.465896,0.009244454,0.000032460248],"about_ca_topic_score_codex":0.0034496102,"about_ca_topic_score_gemma":0.003173529,"teacher_disagreement_score":0.0071820817,"about_ca_system_score_codex":0.0018313706,"about_ca_system_score_gemma":0.00089977385,"threshold_uncertainty_score":0.024026513},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028941477,0.00042331498,0.9481247,0.0005059618,0.00013364413,0.00004598405,0.00013795984,0.0002553743,0.02143153],"genre_scores_gemma":[0.43999457,0.0016759869,0.49684384,0.00053501996,0.00024003476,0.0003026769,0.0009913513,0.0021908076,0.057225745],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99976295,0.000081111946,0.000008810947,0.000036196783,0.00008424854,0.000026648226],"domain_scores_gemma":[0.99957484,0.00022984066,0.000027124432,0.00006308809,0.00006822204,0.00003684208],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052305526,0.0009784782,0.0009136217,0.0007978194,0.0004306626,0.0011349947,0.0012264403,0.0014173303,0.0056921486],"category_scores_gemma":[0.002105575,0.00047125184,0.00056096044,0.0010307486,0.001045135,0.0015525025,0.0019702325,0.0012548431,0.001253483],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009454135,0.00006602996,0.00029020867,0.00021151603,0.000040365,0.00006433249,0.00014030363,0.36326316,0.009320616,0.505243,0.011106966,0.11015897],"study_design_scores_gemma":[0.00001129717,0.0000434941,0.00014717961,0.000026116511,0.000011062858,0.00006367862,0.00006373325,0.7166727,0.00123107,0.27768174,0.004036219,0.000011634069],"about_ca_topic_score_codex":0.0015612667,"about_ca_topic_score_gemma":0.0022426408,"teacher_disagreement_score":0.0056921486,"about_ca_system_score_codex":0.00078561617,"about_ca_system_score_gemma":0.00045930326,"threshold_uncertainty_score":0.019042134},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06544693,0.004588208,0.5544447,0.0013548314,0.0006416179,0.00022481919,0.004063041,0.002278976,0.36695695],"genre_scores_gemma":[0.3455704,0.008655611,0.44194865,0.00054788287,0.00036282744,0.00027296194,0.0062068794,0.0023561532,0.19407858],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99962914,0.000063981315,0.000023267738,0.00010402866,0.0001205409,0.00005900641],"domain_scores_gemma":[0.99937767,0.00018937416,0.000063116684,0.00018293,0.00012521262,0.0000616927],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002037972,0.0009959271,0.00070769864,0.00095280254,0.00061468105,0.0023978702,0.0016118191,0.0008034801,0.027819162],"category_scores_gemma":[0.0016733086,0.0012456723,0.00069325714,0.0021498196,0.00070288545,0.0030473727,0.0015120569,0.0024337834,0.0075828945],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017041287,0.000059211012,0.0004354102,0.00080292096,0.000048355298,0.00017382202,0.0004093155,0.022230342,0.010382967,0.5576149,0.06130214,0.34637016],"study_design_scores_gemma":[0.000032757547,0.00005398788,0.0010286273,0.0001480536,0.00004531371,0.00074099906,0.00022381006,0.025967123,0.00686665,0.8062959,0.15855968,0.000037053025],"about_ca_topic_score_codex":0.0011100321,"about_ca_topic_score_gemma":0.0025119223,"teacher_disagreement_score":0.027819162,"about_ca_system_score_codex":0.00091826275,"about_ca_system_score_gemma":0.00037486243,"threshold_uncertainty_score":0.09306437},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7248911,0.0026156022,0.22206724,0.0004036362,0.00089027133,0.00035444947,0.0020274918,0.006718563,0.040031694],"genre_scores_gemma":[0.8736984,0.0006158986,0.11500272,0.00006928046,0.000040930554,0.000075360316,0.0023265923,0.0009770135,0.007193751],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99878913,0.00019963256,0.000099152865,0.00021155778,0.0005884883,0.000111972295],"domain_scores_gemma":[0.9946154,0.0031342956,0.00021670158,0.0010280424,0.00088978093,0.00011583028],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076821353,0.00078784535,0.0006584197,0.0013391401,0.0004555258,0.0011251834,0.0011259103,0.00070315885,0.016884768],"category_scores_gemma":[0.009069472,0.00025438427,0.00044150915,0.0017169932,0.0004754392,0.0012764352,0.0008307881,0.00043607142,0.0025224835],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0075186626,0.001256013,0.0071673756,0.0011759026,0.00011886165,0.00029827122,0.00026272307,0.14279425,0.08713885,0.0092546595,0.009188797,0.7338256],"study_design_scores_gemma":[0.00032808218,0.0034281563,0.010519962,0.00013439385,0.00013583469,0.0006736038,0.00052362523,0.8521212,0.11186846,0.004862781,0.0153322555,0.000071715],"about_ca_topic_score_codex":0.0017615334,"about_ca_topic_score_gemma":0.0016192526,"teacher_disagreement_score":0.016884768,"about_ca_system_score_codex":0.00034131488,"about_ca_system_score_gemma":0.0003857334,"threshold_uncertainty_score":0.056485176},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6022101,0.00077627227,0.35020778,0.0005147574,0.000095177515,0.00014265631,0.0006773096,0.00046865622,0.044907194],"genre_scores_gemma":[0.93023676,0.00033275108,0.052375227,0.00006637926,0.00005179808,0.000060066657,0.0009089247,0.00022509761,0.015743049],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99957496,0.00006742087,0.00001777609,0.00010363981,0.0001551657,0.00008113661],"domain_scores_gemma":[0.9989171,0.0004588799,0.00016245086,0.00017096747,0.00012853775,0.00016215567],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002800702,0.0002750729,0.0005118584,0.0014911281,0.0009130647,0.0017046981,0.00081203686,0.00065360963,0.007955143],"category_scores_gemma":[0.003261084,0.00045455853,0.00039417297,0.000939802,0.0011211926,0.001495914,0.0020678854,0.0009957033,0.000713199],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000302494,0.00007961543,0.005479353,0.0001819097,0.000036318565,0.00035108213,0.001094052,0.057426415,0.010043766,0.82167697,0.010031513,0.09329649],"study_design_scores_gemma":[0.00005507231,0.00008620137,0.0053424817,0.00007324514,0.000035858626,0.0007039544,0.00091378513,0.25082174,0.0073788823,0.71549046,0.01906861,0.000029724273],"about_ca_topic_score_codex":0.00245079,"about_ca_topic_score_gemma":0.0027563034,"teacher_disagreement_score":0.007955143,"about_ca_system_score_codex":0.0008183086,"about_ca_system_score_gemma":0.00027444473,"threshold_uncertainty_score":0.02661258},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011386048,0.0005609729,0.97913605,0.00025921877,0.00011969287,0.00009978631,0.00024447776,0.0008862842,0.007307398],"genre_scores_gemma":[0.11585894,0.000421725,0.8735668,0.00018507874,0.00007903616,0.00023060104,0.0006420271,0.00074945885,0.008266339],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99876887,0.00030992282,0.00007187223,0.00022241707,0.0004969675,0.00012992875],"domain_scores_gemma":[0.9952205,0.002994722,0.00019085963,0.00089935143,0.0005441858,0.0001503278],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011597605,0.0012609288,0.0015878938,0.0026099277,0.001146669,0.0016796131,0.002634752,0.0019949318,0.019313265],"category_scores_gemma":[0.011769775,0.0010717129,0.0009536889,0.003987037,0.0011723634,0.0045846235,0.0034114202,0.0024862706,0.002607728],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010342953,0.00023071382,0.001172969,0.00066588435,0.000081852624,0.00029365797,0.00022137945,0.1454667,0.012404597,0.20831469,0.02301371,0.60709953],"study_design_scores_gemma":[0.000115432114,0.00012199155,0.00030217975,0.00007561672,0.00003300912,0.00021691296,0.00007140428,0.84087336,0.008055264,0.13789791,0.012197609,0.000039325256],"about_ca_topic_score_codex":0.0031705392,"about_ca_topic_score_gemma":0.004345626,"teacher_disagreement_score":0.019313265,"about_ca_system_score_codex":0.0005776877,"about_ca_system_score_gemma":0.0010768925,"threshold_uncertainty_score":0.06460935},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15536746,0.00041532918,0.83699304,0.00042469113,0.000059170263,0.00012233034,0.000555124,0.0011475352,0.0049152803],"genre_scores_gemma":[0.45067126,0.00024291888,0.5449112,0.000059624654,0.000027769058,0.00011693652,0.0012113316,0.00026042483,0.0024984933],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995497,0.00008940486,0.0000354,0.000106000014,0.00015603579,0.00006338919],"domain_scores_gemma":[0.99868065,0.0007132434,0.00016579758,0.00022760805,0.00014028985,0.000072383125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004710057,0.00059176615,0.0009979516,0.0009827736,0.00048126237,0.0008769071,0.0012904144,0.001024423,0.0022571867],"category_scores_gemma":[0.005179885,0.0004864485,0.00079564576,0.0010415462,0.0008094007,0.0012478348,0.0015494898,0.00071800104,0.0008177134],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00059986656,0.000090473935,0.005136414,0.0004971307,0.00007034864,0.0005400949,0.0004034137,0.7842034,0.013409978,0.036301736,0.0063328696,0.15241423],"study_design_scores_gemma":[0.00002725232,0.000037869602,0.00036211542,0.000013745445,0.0000072219996,0.00013347233,0.00006235197,0.97705334,0.003203211,0.01707717,0.002012448,0.000009823258],"about_ca_topic_score_codex":0.0033510812,"about_ca_topic_score_gemma":0.0032738878,"teacher_disagreement_score":0.0033510812,"about_ca_system_score_codex":0.00074033346,"about_ca_system_score_gemma":0.00065408385,"threshold_uncertainty_score":0.007551074},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04386549,0.00019706071,0.9545225,0.00010270751,0.000033562465,0.00003315273,0.00003645945,0.00008996313,0.0011192489],"genre_scores_gemma":[0.49365133,0.0005536303,0.50156415,0.00010154556,0.00006333951,0.00014178688,0.00013107603,0.000108968874,0.0036841854],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995183,0.00012619616,0.000021493353,0.000097001044,0.0001993883,0.000037778063],"domain_scores_gemma":[0.99889636,0.00064187,0.000120745935,0.00017419712,0.0001305103,0.000036296988],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009805472,0.00056548073,0.00072952034,0.000630123,0.00024198653,0.00096357404,0.001393274,0.0012179666,0.000922588],"category_scores_gemma":[0.0028646705,0.0004585648,0.0007042184,0.00048936496,0.00088573864,0.0018531891,0.0005243177,0.00056256994,0.0003826618],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006700287,0.000055112,0.0010712761,0.00011247609,0.00002525715,0.00011633811,0.0001005951,0.93365747,0.018489493,0.023757908,0.00030282073,0.022244308],"study_design_scores_gemma":[0.000005623801,0.000019292269,0.000104668856,0.0000028814682,0.000002093452,0.000023838793,0.000008124188,0.99589264,0.0012975422,0.0023567681,0.00028174077,0.0000047105905],"about_ca_topic_score_codex":0.0011867761,"about_ca_topic_score_gemma":0.00093287596,"teacher_disagreement_score":0.001393274,"about_ca_system_score_codex":0.0005026483,"about_ca_system_score_gemma":0.00055435806,"threshold_uncertainty_score":0.0051856637},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.823812,0.0010382136,0.12662762,0.0006461325,0.00010069047,0.000095810414,0.0018288714,0.0010215676,0.044829167],"genre_scores_gemma":[0.9496357,0.0007526896,0.037512675,0.0002187765,0.00006782785,0.000086264576,0.002195665,0.00037657408,0.009153767],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992349,0.000082727354,0.000037977414,0.00034848857,0.00014483949,0.00015100172],"domain_scores_gemma":[0.9965663,0.0011965277,0.0007229146,0.00069682585,0.00033598233,0.0004814492],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043347673,0.00070376013,0.0005621028,0.0011064248,0.0009877547,0.001702143,0.00081761024,0.00047419115,0.008542441],"category_scores_gemma":[0.0034969405,0.00046109417,0.0007858198,0.0013613481,0.0012953023,0.002849694,0.0009852871,0.0010950977,0.001137857],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012314125,0.00024391469,0.025947975,0.00079158176,0.00016002268,0.0013559937,0.0020358479,0.0727464,0.06979043,0.6868924,0.017583452,0.121220574],"study_design_scores_gemma":[0.00009795685,0.00037604416,0.023710081,0.00013225657,0.00020177319,0.004307936,0.00071097823,0.1653491,0.034072746,0.71523666,0.05567643,0.0001280715],"about_ca_topic_score_codex":0.0020771043,"about_ca_topic_score_gemma":0.0017570776,"teacher_disagreement_score":0.008542441,"about_ca_system_score_codex":0.0010820136,"about_ca_system_score_gemma":0.00056446163,"threshold_uncertainty_score":0.028577328},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011518838,0.00021758248,0.984005,0.00008255641,0.000054153283,0.000106054584,0.000049486796,0.0005108478,0.0034554736],"genre_scores_gemma":[0.15319833,0.00014578542,0.8420349,0.0001048189,0.000043733286,0.0003272267,0.00015348937,0.0002307984,0.0037609688],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99973935,0.00006340273,0.000015283029,0.00004340315,0.00009599235,0.000042681982],"domain_scores_gemma":[0.9994754,0.0002871301,0.00004732447,0.00003546133,0.00011660992,0.00003803716],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007149343,0.00083575345,0.0009891711,0.001467275,0.0007180154,0.0007848813,0.0013421637,0.0012560281,0.0053356183],"category_scores_gemma":[0.0017662949,0.00065399223,0.0006765476,0.00084682915,0.0006364572,0.00079976686,0.0010953164,0.0007908326,0.0009089412],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025400074,0.00013227,0.0010542582,0.00025698662,0.00006851196,0.0002382777,0.00017329087,0.73495746,0.011173092,0.026259752,0.0053655757,0.2200665],"study_design_scores_gemma":[0.000027367,0.00003158146,0.000049567243,0.000010511138,0.000006021038,0.000024964389,0.000016082875,0.9957847,0.0007035301,0.0020490175,0.0012903404,0.0000062747035],"about_ca_topic_score_codex":0.0046316413,"about_ca_topic_score_gemma":0.00613144,"teacher_disagreement_score":0.0053356183,"about_ca_system_score_codex":0.0005393601,"about_ca_system_score_gemma":0.0015537395,"threshold_uncertainty_score":0.017849445},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2613032,0.00050117355,0.63125557,0.0032975408,0.00075790216,0.00076307834,0.0041149035,0.0026946613,0.09531202],"genre_scores_gemma":[0.69584674,0.0003057885,0.24519794,0.0006879388,0.0005161527,0.0008049872,0.008313921,0.0017525067,0.046574082],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979005,0.00058962964,0.00010550397,0.0004234967,0.0004591554,0.00052167795],"domain_scores_gemma":[0.9878982,0.0063422043,0.00064301776,0.0022639008,0.0012900177,0.0015627351],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028348581,0.0011271541,0.0016733739,0.0021279086,0.0033171535,0.0029988878,0.0031897724,0.0023938606,0.013134369],"category_scores_gemma":[0.018140376,0.0007650476,0.0022860288,0.0018578679,0.0024630362,0.002761076,0.0031243924,0.0035617643,0.0024225323],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0053683645,0.0008072634,0.004879991,0.0009383899,0.00021847941,0.0012320032,0.0009420887,0.16830826,0.012357557,0.57255924,0.09881084,0.13357767],"study_design_scores_gemma":[0.00030306986,0.0002723248,0.0026299197,0.00011103234,0.000107395805,0.0006803528,0.0003087774,0.42573538,0.0117864115,0.5433957,0.014578738,0.0000909324],"about_ca_topic_score_codex":0.0042995634,"about_ca_topic_score_gemma":0.005542429,"teacher_disagreement_score":0.013134369,"about_ca_system_score_codex":0.0014150343,"about_ca_system_score_gemma":0.0034570883,"threshold_uncertainty_score":0.043938816},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92650074,0.00068451744,0.05407228,0.00050943106,0.00008024199,0.00009255485,0.0021666805,0.00059936463,0.015294107],"genre_scores_gemma":[0.9682464,0.00031488016,0.02182806,0.000078148405,0.000079180754,0.00008012725,0.0047467374,0.00013152171,0.0044949697],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994338,0.00007558567,0.000055195862,0.00011885683,0.00021283259,0.00010379797],"domain_scores_gemma":[0.9972516,0.0014164132,0.00043731177,0.0003057164,0.00033169257,0.0002572655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044022675,0.00066994946,0.000775001,0.0019982527,0.0017849198,0.0016082864,0.00054001104,0.00066072325,0.008967439],"category_scores_gemma":[0.0038221225,0.00036075868,0.00110638,0.001340953,0.0014798351,0.0014734027,0.0013484951,0.0010405217,0.0012156147],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0022995507,0.0006257378,0.06089713,0.0019653798,0.00022016605,0.007189568,0.0044908347,0.032270733,0.05558992,0.62097174,0.031415444,0.18206376],"study_design_scores_gemma":[0.00033027554,0.00087548903,0.03481941,0.00020149272,0.00020287289,0.00599421,0.0020487881,0.04088234,0.025815504,0.7578957,0.1306917,0.00024228937],"about_ca_topic_score_codex":0.0009572606,"about_ca_topic_score_gemma":0.0009548285,"teacher_disagreement_score":0.008967439,"about_ca_system_score_codex":0.00048719512,"about_ca_system_score_gemma":0.00052051357,"threshold_uncertainty_score":0.029999018},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014428216,0.00007943613,0.98039675,0.00014790098,0.000029366407,0.000031530984,0.00009290302,0.00022852061,0.0045653703],"genre_scores_gemma":[0.40986034,0.00045391737,0.5683302,0.00021511165,0.00009134579,0.00024825215,0.00055216963,0.0008397825,0.01940875],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99890053,0.00024954023,0.00004281827,0.00020454376,0.00047648506,0.00012612],"domain_scores_gemma":[0.9967714,0.0018468121,0.00024089163,0.00057421497,0.00040554607,0.00016119436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008476825,0.00093914004,0.0010985039,0.000798701,0.00045114654,0.0016216155,0.0016755029,0.0019628839,0.0053738425],"category_scores_gemma":[0.007616307,0.0015126725,0.00091941445,0.00096053956,0.001318791,0.002347478,0.0031533227,0.0024013275,0.0017866071],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004752313,0.00012822701,0.0014292859,0.00029433586,0.00007846138,0.00039511733,0.0003500113,0.72676986,0.04192785,0.10253165,0.0064755003,0.11914449],"study_design_scores_gemma":[0.000019936582,0.000030450261,0.00032669323,0.000015925812,0.0000070042274,0.00011037544,0.000040069805,0.9709735,0.0055423854,0.021333497,0.0015839265,0.000016227086],"about_ca_topic_score_codex":0.0015356789,"about_ca_topic_score_gemma":0.0014074068,"teacher_disagreement_score":0.0053738425,"about_ca_system_score_codex":0.00096400274,"about_ca_system_score_gemma":0.00048578446,"threshold_uncertainty_score":0.017977297},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9353661,0.00096117915,0.041632205,0.0020513185,0.0001153761,0.00006128052,0.00052933494,0.00041508253,0.018868148],"genre_scores_gemma":[0.9909971,0.0002672371,0.0056828167,0.00014248147,0.00006386115,0.00007087713,0.0002547355,0.00015139111,0.002369452],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993449,0.0002582118,0.000021414276,0.00010872081,0.000117375654,0.00014937055],"domain_scores_gemma":[0.9892184,0.007354026,0.0012567735,0.0004704974,0.0005334221,0.0011669275],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001274651,0.0005059181,0.00080994994,0.0025574213,0.001364223,0.0034613241,0.0018460382,0.0014791292,0.006710169],"category_scores_gemma":[0.013952646,0.00094093895,0.00055674836,0.0011180653,0.0029660095,0.0032403679,0.0013792916,0.0014036923,0.0004450311],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006525929,0.00017962726,0.0026860745,0.0002153191,0.000041598767,0.00019793135,0.00069285074,0.07283287,0.0062952624,0.8996534,0.009042439,0.0075099557],"study_design_scores_gemma":[0.00015416797,0.00011956405,0.003245981,0.000117989344,0.000033973993,0.00023131141,0.00060385175,0.44456458,0.0041476344,0.54439306,0.0023275218,0.000060333212],"about_ca_topic_score_codex":0.0014695626,"about_ca_topic_score_gemma":0.0014849367,"teacher_disagreement_score":0.006710169,"about_ca_system_score_codex":0.002098148,"about_ca_system_score_gemma":0.0008394115,"threshold_uncertainty_score":0.022447765},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13197923,0.003724827,0.80141383,0.001440945,0.0002035812,0.00025170544,0.002108877,0.0012878792,0.05758909],"genre_scores_gemma":[0.5793948,0.007939442,0.37530622,0.0008379134,0.00040689285,0.00044939434,0.005216811,0.00094343105,0.029505054],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99715024,0.0006176536,0.00022345828,0.0008129612,0.0007104511,0.00048522954],"domain_scores_gemma":[0.9881924,0.0059696385,0.0019984348,0.0021053958,0.0011086548,0.00062553544],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010101276,0.0017725233,0.0012686574,0.0014835431,0.001235575,0.0038576352,0.0029381965,0.0014104868,0.014856563],"category_scores_gemma":[0.011579977,0.001566026,0.0013066187,0.0032798732,0.0014802889,0.008114294,0.0029072408,0.0028334875,0.0028601629],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041243242,0.00017872655,0.002470891,0.0012367299,0.000103440565,0.0006870387,0.00068510044,0.09203642,0.01146506,0.71973765,0.021808205,0.14917836],"study_design_scores_gemma":[0.00006634258,0.00014997344,0.001997889,0.00017879081,0.00008454264,0.0022232977,0.00038158268,0.14455229,0.0077901906,0.79037094,0.05213444,0.00006981686],"about_ca_topic_score_codex":0.0011171619,"about_ca_topic_score_gemma":0.0019224379,"teacher_disagreement_score":0.014856563,"about_ca_system_score_codex":0.001471762,"about_ca_system_score_gemma":0.0006854871,"threshold_uncertainty_score":0.0497002},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.59601825,0.0007884159,0.35028616,0.0015270751,0.000061268875,0.00011816295,0.0011496957,0.00089698465,0.049153976],"genre_scores_gemma":[0.9299782,0.00063808926,0.053296514,0.0005309278,0.00006533996,0.0001566387,0.0017894086,0.00023711997,0.013307785],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993262,0.00009117303,0.000034808276,0.00020975329,0.00020641157,0.00013159102],"domain_scores_gemma":[0.9957014,0.0020025452,0.0005468132,0.00080196594,0.00057326845,0.00037390552],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006002005,0.00054550567,0.0006546046,0.00073127303,0.0012605254,0.0017247908,0.0014158613,0.0010352663,0.007952795],"category_scores_gemma":[0.004233372,0.0008514537,0.001190041,0.001061584,0.0025362016,0.0060827266,0.002194904,0.0018397289,0.0010554615],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001973186,0.000049523005,0.004001452,0.00024009765,0.000043617456,0.00035683537,0.0006094719,0.018939953,0.008276926,0.9402299,0.003524806,0.023530046],"study_design_scores_gemma":[0.000081011625,0.00024979387,0.0031746551,0.000049555147,0.0000968779,0.0016846388,0.0003709011,0.058411762,0.012758836,0.89551216,0.027562967,0.00004678713],"about_ca_topic_score_codex":0.0009790531,"about_ca_topic_score_gemma":0.0014388497,"teacher_disagreement_score":0.007952795,"about_ca_system_score_codex":0.0009153046,"about_ca_system_score_gemma":0.00046204613,"threshold_uncertainty_score":0.026604772},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93920124,0.00007796006,0.05280362,0.00019052869,0.000029023036,0.00006241731,0.0003395605,0.00020666434,0.007089056],"genre_scores_gemma":[0.9895601,0.000036983856,0.009775072,0.000019596624,0.0000036355318,0.00003094375,0.00009542897,0.000032811156,0.00044546594],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99988735,0.00003488796,0.000005204836,0.000018932704,0.000028611563,0.000024979663],"domain_scores_gemma":[0.999089,0.0006314827,0.00007581461,0.000069227426,0.0000855542,0.00004893078],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034462658,0.00044442635,0.000379273,0.00033476177,0.00027479243,0.00048249983,0.0004695164,0.00072048715,0.0010116941],"category_scores_gemma":[0.0021672908,0.00018886461,0.000311007,0.00024990115,0.00045021105,0.0004555221,0.00039992444,0.0005063885,0.000097165794],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004686572,0.00004912136,0.0025335466,0.000018860434,0.000006168551,0.00004323212,0.000036029687,0.9897405,0.003342316,0.0011634419,0.00008209196,0.002937738],"study_design_scores_gemma":[0.0000017597638,0.000009628269,0.00014937957,0.0000013864807,8.4319805e-7,0.0000035007897,0.000006259525,0.9991736,0.0004596307,0.00014362419,0.00004868138,0.0000017625855],"about_ca_topic_score_codex":0.0059196884,"about_ca_topic_score_gemma":0.0045398,"teacher_disagreement_score":0.0059196884,"about_ca_system_score_codex":0.00038175707,"about_ca_system_score_gemma":0.00053519587,"threshold_uncertainty_score":0.011770487},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17773333,0.0003042517,0.8152919,0.00018917922,0.000072994444,0.00010951609,0.00041282785,0.00089435256,0.0049916697],"genre_scores_gemma":[0.71412784,0.00032640362,0.27665752,0.00011140702,0.000058560083,0.00018165454,0.0011875869,0.00017187817,0.007177204],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992884,0.00013937475,0.00005562343,0.00019837239,0.00021485162,0.00010338475],"domain_scores_gemma":[0.9989556,0.00022380927,0.00014763068,0.00041492793,0.0001601393,0.00009778417],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042995953,0.000600539,0.0006073409,0.00068342226,0.0006459865,0.00061788666,0.0010405682,0.00065730716,0.004059644],"category_scores_gemma":[0.0018910356,0.00030117316,0.00041942435,0.0009472498,0.0006426628,0.0024067082,0.0031219115,0.0006688209,0.0010839351],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010060233,0.00011398992,0.002943132,0.00038585468,0.00013085632,0.0011111189,0.0005525648,0.5175126,0.086744994,0.13258402,0.006146566,0.2507683],"study_design_scores_gemma":[0.00005109874,0.00037931936,0.0010709959,0.000037446545,0.000026604983,0.0005295846,0.00024819473,0.8224759,0.0332616,0.122764006,0.01911762,0.000037669113],"about_ca_topic_score_codex":0.000835421,"about_ca_topic_score_gemma":0.0009578199,"teacher_disagreement_score":0.004059644,"about_ca_system_score_codex":0.0005299137,"about_ca_system_score_gemma":0.00026406383,"threshold_uncertainty_score":0.013580859},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1331109,0.002593254,0.76627547,0.0008823288,0.00039078455,0.00022305126,0.0015620012,0.0015423994,0.093419895],"genre_scores_gemma":[0.7479681,0.00092913565,0.23242685,0.0008204764,0.0004779887,0.0003334292,0.0011438432,0.0004732014,0.015426917],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99860865,0.00018787156,0.00016510276,0.00047790064,0.0002918321,0.0002686643],"domain_scores_gemma":[0.998312,0.0008811134,0.00018091664,0.00025658152,0.00021111357,0.00015827698],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013562171,0.0007933276,0.00064591947,0.0024494566,0.0013348387,0.0025653313,0.001893215,0.000726265,0.0042909165],"category_scores_gemma":[0.0040199533,0.00054950773,0.0012519606,0.0018958614,0.0029104413,0.0058071637,0.0026780663,0.0019281566,0.00095430197],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017734156,0.000029571138,0.00088670355,0.00017514313,0.00001827055,0.00032434685,0.00097204256,0.004372655,0.005725884,0.95649636,0.002348826,0.028472919],"study_design_scores_gemma":[0.000051004983,0.0001262075,0.0010859774,0.00013092127,0.00004989811,0.0007366882,0.0003582552,0.02829421,0.008928156,0.90069574,0.059454106,0.00008894384],"about_ca_topic_score_codex":0.002511547,"about_ca_topic_score_gemma":0.002244041,"teacher_disagreement_score":0.0042909165,"about_ca_system_score_codex":0.0021719774,"about_ca_system_score_gemma":0.000630692,"threshold_uncertainty_score":0.015758872},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6059676,0.00070377,0.3451328,0.00097566046,0.0001991155,0.00006328068,0.0002701468,0.00031738827,0.046370294],"genre_scores_gemma":[0.97056264,0.0002319577,0.020675506,0.00009477684,0.00012800164,0.000038090868,0.0002799981,0.00012037171,0.007868675],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982597,0.0004581338,0.00009189139,0.00038848547,0.00056486926,0.00023694772],"domain_scores_gemma":[0.99262285,0.0033184835,0.0011572879,0.0012595374,0.00076690334,0.0008749365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013106507,0.00069990626,0.00085005927,0.0028035708,0.0024336039,0.0031934876,0.0018889488,0.0015248698,0.0085058315],"category_scores_gemma":[0.009216117,0.0011098662,0.0010186436,0.0010376445,0.0048663393,0.0059406157,0.0044052945,0.0027079773,0.00084442674],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015305236,0.000067122055,0.0019796602,0.00008980151,0.00002209511,0.00032697507,0.00046887563,0.010268956,0.004279048,0.9658364,0.00087070663,0.015637217],"study_design_scores_gemma":[0.000023471943,0.00010910841,0.0038612152,0.000041977073,0.000026845915,0.0005926917,0.0003790122,0.057215154,0.0035365426,0.9316808,0.002483134,0.000050136598],"about_ca_topic_score_codex":0.000628855,"about_ca_topic_score_gemma":0.000660024,"teacher_disagreement_score":0.0085058315,"about_ca_system_score_codex":0.0006243899,"about_ca_system_score_gemma":0.000525539,"threshold_uncertainty_score":0.02845478},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11660935,0.019438587,0.32007155,0.252528,0.016936393,0.00012352601,0.0015697309,0.0028074842,0.26991537],"genre_scores_gemma":[0.74750274,0.013915467,0.10009669,0.037234303,0.020494327,0.00035990233,0.0024844704,0.0012581164,0.07665401],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99683315,0.0010127196,0.00014334093,0.0007969467,0.0007295257,0.00048432942],"domain_scores_gemma":[0.9833061,0.0111978585,0.0008698603,0.0019517479,0.0015226131,0.0011518712],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005758488,0.0013809536,0.0014440673,0.0013121188,0.0031402123,0.0023918333,0.0035837574,0.0029660382,0.024441421],"category_scores_gemma":[0.02079652,0.00057844585,0.0012015502,0.0019308259,0.005939946,0.013201057,0.003575004,0.006117212,0.0037055712],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045951398,0.00013281517,0.003105686,0.00038660935,0.000048918675,0.00066842034,0.00078149495,0.010686294,0.0016466521,0.84892607,0.09845158,0.034705978],"study_design_scores_gemma":[0.00009904257,0.00016303419,0.0017702824,0.00013948312,0.000030808915,0.00034930906,0.00057538575,0.012004428,0.0010656118,0.9222404,0.06147469,0.000087527704],"about_ca_topic_score_codex":0.0030774875,"about_ca_topic_score_gemma":0.002210341,"teacher_disagreement_score":0.024441421,"about_ca_system_score_codex":0.0011875428,"about_ca_system_score_gemma":0.0006663561,"threshold_uncertainty_score":0.0817647},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19490471,0.0080727665,0.607694,0.0047144354,0.0011965688,0.00008855488,0.0006752572,0.00023321582,0.1824206],"genre_scores_gemma":[0.86601585,0.006143944,0.08197619,0.00090008497,0.0011969716,0.00018065848,0.00063157926,0.00036392533,0.042590782],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991616,0.00028467938,0.000038618506,0.0001499843,0.00027128053,0.00009381097],"domain_scores_gemma":[0.9974038,0.0013637515,0.0002658409,0.00014374313,0.00042431374,0.00039848898],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016180759,0.0010871694,0.0007876952,0.0032181938,0.0013865306,0.003470519,0.0015301636,0.0011554456,0.0075792535],"category_scores_gemma":[0.006000432,0.00047896523,0.00066002714,0.0013304955,0.0046644583,0.0056449217,0.0029063425,0.004179183,0.0012547676],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030094976,0.000011021284,0.000112148206,0.000038549664,0.0000050378094,0.000025971116,0.00012155522,0.0025254763,0.0006201093,0.98939985,0.0011853433,0.00592488],"study_design_scores_gemma":[0.000008034751,0.000026247955,0.00020060841,0.000024907938,0.0000047357717,0.00006730231,0.00007464671,0.014060504,0.00041192863,0.9813007,0.00380374,0.000016642945],"about_ca_topic_score_codex":0.0018449086,"about_ca_topic_score_gemma":0.0011640958,"teacher_disagreement_score":0.0075792535,"about_ca_system_score_codex":0.0013120121,"about_ca_system_score_gemma":0.00086659845,"threshold_uncertainty_score":0.02535516},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6225799,0.0009249913,0.34235662,0.00065425213,0.00017450328,0.00010413311,0.00095886004,0.00062354887,0.03162324],"genre_scores_gemma":[0.9377997,0.00042182932,0.055853736,0.00017322128,0.000050728275,0.00006033434,0.0007098842,0.00009471714,0.0048358226],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99934465,0.00014150981,0.000036903846,0.00011349907,0.00019159555,0.00017184278],"domain_scores_gemma":[0.9961863,0.0017973415,0.0005546041,0.00061651634,0.00046935963,0.00037590778],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056934543,0.00035311157,0.0003247905,0.0009683541,0.0005968209,0.0008555065,0.00071801065,0.0003703382,0.00319948],"category_scores_gemma":[0.0031658723,0.00037182064,0.00046234878,0.00090508856,0.00097263005,0.0011433422,0.0009440217,0.00082738814,0.00018999964],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040443396,0.00008815565,0.007780492,0.0003105512,0.00005421181,0.0005934697,0.00042691774,0.17553535,0.0239251,0.7288698,0.006146153,0.055865314],"study_design_scores_gemma":[0.000097970005,0.0001691929,0.004464574,0.000077075136,0.00007029165,0.0011572457,0.0005028793,0.33981928,0.018840224,0.595706,0.03902678,0.00006847384],"about_ca_topic_score_codex":0.0036456145,"about_ca_topic_score_gemma":0.0041516204,"teacher_disagreement_score":0.0036456145,"about_ca_system_score_codex":0.0010623281,"about_ca_system_score_gemma":0.00051956705,"threshold_uncertainty_score":0.010703325},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036376796,0.0001775349,0.992475,0.0005051063,0.00008905646,0.000025147476,0.000027635722,0.000046242658,0.003016595],"genre_scores_gemma":[0.18636797,0.0009747257,0.80070823,0.00051875075,0.00038577625,0.00031934475,0.00014399267,0.00021482464,0.010366292],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991103,0.00036017614,0.000050600138,0.00016991043,0.00024912533,0.000059789567],"domain_scores_gemma":[0.9986475,0.0007573902,0.0001232034,0.00017553703,0.00020324976,0.000093091265],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019572917,0.0006834842,0.00076401816,0.0011654728,0.00082055194,0.0012021873,0.0013760502,0.0017830993,0.004408922],"category_scores_gemma":[0.006481296,0.00048415636,0.0011963266,0.00075281854,0.0025042933,0.002615405,0.00412785,0.0026262377,0.0009243517],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043504122,0.00003194921,0.00074981333,0.00015533433,0.000034977682,0.00013651924,0.00025548096,0.07860934,0.004409904,0.8632494,0.0023766018,0.049947187],"study_design_scores_gemma":[0.00004940813,0.00011612599,0.00021245866,0.00008832496,0.000025197543,0.00022196319,0.00014448902,0.5397375,0.00242116,0.43669713,0.020244697,0.00004156346],"about_ca_topic_score_codex":0.0007399674,"about_ca_topic_score_gemma":0.000712754,"teacher_disagreement_score":0.004408922,"about_ca_system_score_codex":0.00051984866,"about_ca_system_score_gemma":0.0009581494,"threshold_uncertainty_score":0.014749348},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34793413,0.0015012921,0.5745656,0.00416957,0.0007792668,0.00033697893,0.0046569486,0.0043516606,0.061704624],"genre_scores_gemma":[0.55757266,0.0010570828,0.40214917,0.00057544163,0.000271962,0.00024874136,0.0060797217,0.00217348,0.029871698],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996111,0.000103669154,0.000016562248,0.00012621307,0.00007767046,0.00006479097],"domain_scores_gemma":[0.9983394,0.0008510959,0.00010135677,0.0003515679,0.00020288769,0.00015355978],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003979281,0.0008588446,0.0010492472,0.0008062722,0.0010524858,0.0016228581,0.0012285654,0.0008560629,0.020442901],"category_scores_gemma":[0.0033260423,0.0006375001,0.00054232863,0.0011843713,0.0007726714,0.0023780898,0.0012507603,0.0015537419,0.0024244413],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007217872,0.0005693342,0.0018889837,0.00070075906,0.00007220244,0.00014067451,0.00050900585,0.14928795,0.018626811,0.2601636,0.102297485,0.46502137],"study_design_scores_gemma":[0.00012797418,0.00011668642,0.001227452,0.00009464146,0.00006357491,0.00008978821,0.00033338374,0.32671943,0.007524055,0.64496624,0.018708257,0.000028468407],"about_ca_topic_score_codex":0.0027357945,"about_ca_topic_score_gemma":0.0068825125,"teacher_disagreement_score":0.020442901,"about_ca_system_score_codex":0.0013106264,"about_ca_system_score_gemma":0.00116421,"threshold_uncertainty_score":0.06838834},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00048210204,0.0003645579,0.98914474,0.00017433558,0.00017677994,0.00003421915,0.00014868488,0.0036553827,0.0058192667],"genre_scores_gemma":[0.019173048,0.00084914453,0.9692835,0.00023885892,0.00030337909,0.00024909605,0.0006417086,0.0027294902,0.006531765],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99773276,0.00038771055,0.00015002987,0.0002861736,0.0013375191,0.00010586547],"domain_scores_gemma":[0.9978612,0.0007366138,0.00012776794,0.00057244964,0.00058064424,0.00012130928],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014992374,0.0014173513,0.00096644164,0.0024108777,0.0009984586,0.0031247668,0.0029998573,0.0011534365,0.025880702],"category_scores_gemma":[0.009802112,0.0007251114,0.0012945924,0.0033410501,0.0019522699,0.005262684,0.004032633,0.0040488425,0.013943597],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001286509,0.0000550024,0.00028622535,0.00034540123,0.000041118434,0.000109571076,0.00030191834,0.02012241,0.0041191517,0.4018538,0.05358062,0.5190562],"study_design_scores_gemma":[0.0000836019,0.00008622339,0.00022312917,0.00023955556,0.00002448923,0.00035405843,0.00008848818,0.2754857,0.0110196965,0.4007173,0.31158444,0.00009330043],"about_ca_topic_score_codex":0.0019383489,"about_ca_topic_score_gemma":0.0017408462,"teacher_disagreement_score":0.025880702,"about_ca_system_score_codex":0.001114038,"about_ca_system_score_gemma":0.001716631,"threshold_uncertainty_score":0.08657956},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011041503,0.000085612126,0.98450017,0.00011840348,0.00004471542,0.00003153783,0.000055771117,0.00016861122,0.003953609],"genre_scores_gemma":[0.3635398,0.00014201227,0.6284581,0.00014927505,0.000058478476,0.00024591645,0.00033945305,0.00049935,0.0065677017],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995128,0.00014422205,0.000017694038,0.000054675773,0.00023101456,0.000039538103],"domain_scores_gemma":[0.99929976,0.0002730304,0.00006289342,0.00010174543,0.0001947282,0.0000677951],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009156552,0.00046922735,0.0006012629,0.0009899843,0.00037404656,0.0013168042,0.0010217899,0.00073902693,0.0029221685],"category_scores_gemma":[0.003334529,0.00044044442,0.0003902611,0.00049967674,0.0010979039,0.00079217105,0.002086543,0.0013171931,0.0006937423],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001024318,0.00006243486,0.00064116897,0.00011157148,0.00002635133,0.000076849974,0.00015692455,0.58439636,0.009653212,0.32805806,0.004590482,0.072124146],"study_design_scores_gemma":[0.000007584903,0.000009156855,0.00004077081,0.000009976216,0.0000017684765,0.00001832352,0.0000137733505,0.9491911,0.001891566,0.04601036,0.0028011696,0.0000045060856],"about_ca_topic_score_codex":0.0006393382,"about_ca_topic_score_gemma":0.00089618244,"teacher_disagreement_score":0.0029221685,"about_ca_system_score_codex":0.00073576457,"about_ca_system_score_gemma":0.00070228754,"threshold_uncertainty_score":0.009775639},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.73569286,0.0008590951,0.2081893,0.00053246843,0.00021528355,0.00021385442,0.0030270715,0.0014026072,0.049867544],"genre_scores_gemma":[0.9162064,0.00041688734,0.069583796,0.000115797455,0.0000650504,0.000050657003,0.004917465,0.00023450852,0.008409373],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994487,0.00005196347,0.000038742422,0.000106855434,0.00022139735,0.0001323654],"domain_scores_gemma":[0.9981363,0.00049667264,0.00022833163,0.00029672502,0.00062025373,0.00022170946],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002654051,0.00043667518,0.00060406997,0.0031945005,0.001152076,0.0034481941,0.0011380033,0.0010265495,0.006068392],"category_scores_gemma":[0.0030339614,0.00034484628,0.0004628848,0.0029122268,0.0010219899,0.0015883129,0.0010541305,0.001246064,0.0011346007],"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.0012446214,0.00030561173,0.045422804,0.00056102156,0.00005532692,0.0006610128,0.00096645905,0.06094638,0.027612574,0.37199542,0.026033172,0.46419555],"study_design_scores_gemma":[0.00008404968,0.00026430222,0.02202369,0.00028954598,0.000067576984,0.0013568825,0.0015464255,0.556019,0.022858785,0.3538062,0.04158844,0.00009506789],"about_ca_topic_score_codex":0.0043701204,"about_ca_topic_score_gemma":0.0031230887,"teacher_disagreement_score":0.006068392,"about_ca_system_score_codex":0.00090168684,"about_ca_system_score_gemma":0.00050051714,"threshold_uncertainty_score":0.020300746},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053724594,0.00025598993,0.9402852,0.00012287464,0.000055988443,0.000023462713,0.000062847335,0.0002869725,0.005182032],"genre_scores_gemma":[0.5166012,0.0004512327,0.47630498,0.00007079858,0.000034124576,0.00006471947,0.00018833352,0.000118656484,0.006165962],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99982566,0.00003431408,0.000015261978,0.00002858615,0.000078130775,0.00001801572],"domain_scores_gemma":[0.99968636,0.000078388926,0.000039618277,0.00011316871,0.00006123315,0.000021316742],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003952574,0.00021705069,0.00027587684,0.00035255303,0.00026434846,0.0006796557,0.00048485186,0.00043812956,0.0021570802],"category_scores_gemma":[0.0010635138,0.00018329194,0.00037458757,0.00038486032,0.00075444125,0.00080190937,0.0008179204,0.0007854335,0.00046622747],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000100875186,0.000030858282,0.0011378065,0.000096343574,0.000013580188,0.00008163125,0.0002879061,0.23168406,0.0529403,0.6033353,0.0020127723,0.10827854],"study_design_scores_gemma":[0.000013235789,0.000055768454,0.00035973475,0.000017106102,0.0000061470714,0.00007970997,0.000030122663,0.9299998,0.007056487,0.051338565,0.011031929,0.000011407875],"about_ca_topic_score_codex":0.0007405854,"about_ca_topic_score_gemma":0.0008478691,"teacher_disagreement_score":0.0021570802,"about_ca_system_score_codex":0.00042832806,"about_ca_system_score_gemma":0.00035333197,"threshold_uncertainty_score":0.007216215},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38591576,0.003402804,0.4853331,0.0023833532,0.0005153625,0.00012619555,0.0008466946,0.00052728114,0.12094948],"genre_scores_gemma":[0.8396922,0.0027677985,0.103231505,0.00039978136,0.00036304025,0.00014634451,0.0010635348,0.0003976884,0.051938105],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99950314,0.00012559457,0.00002335448,0.00014014826,0.00014436833,0.00006329171],"domain_scores_gemma":[0.99845004,0.00084205373,0.00020775612,0.0001953068,0.00017532901,0.00012952756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003973642,0.00070617744,0.0005570732,0.0025150042,0.0012770686,0.0028928376,0.0010031329,0.001165968,0.011193379],"category_scores_gemma":[0.003986329,0.00054288877,0.0005427537,0.002546792,0.0015809317,0.0034358338,0.0017939686,0.0013611355,0.00087513245],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023568866,0.000021555856,0.0005782965,0.00007345115,0.000008290029,0.000091051326,0.00015725342,0.00654999,0.0011611861,0.96614766,0.0022079174,0.022979787],"study_design_scores_gemma":[0.0000054531347,0.0000051236407,0.00019655134,0.000020933707,0.000006415034,0.00008922703,0.00008723576,0.009896135,0.00073464366,0.9825147,0.0064381254,0.000005398313],"about_ca_topic_score_codex":0.0007980703,"about_ca_topic_score_gemma":0.0012494195,"teacher_disagreement_score":0.011193379,"about_ca_system_score_codex":0.00097446295,"about_ca_system_score_gemma":0.0004748348,"threshold_uncertainty_score":0.037445545},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15792626,0.001794907,0.82928586,0.00090669084,0.000063936335,0.00018038225,0.0007213364,0.0022904738,0.006830091],"genre_scores_gemma":[0.481663,0.0006784106,0.51252145,0.00017635766,0.000079667385,0.00022757925,0.001561163,0.00030378514,0.002788665],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998863,0.00020819835,0.00007802317,0.00029145528,0.00033021453,0.00022914469],"domain_scores_gemma":[0.99694246,0.0016990036,0.0003815436,0.00063634786,0.0001811168,0.00015957077],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009006145,0.0010728907,0.0017353516,0.0014094065,0.00093518844,0.0021375937,0.0029055579,0.0017114946,0.004044922],"category_scores_gemma":[0.007626993,0.0008220342,0.0010613742,0.0029208336,0.0009067294,0.0044124066,0.0026093966,0.0014688267,0.0008078387],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011607732,0.00028215637,0.0046208664,0.00053500023,0.00014444877,0.0002415668,0.0007804002,0.6981837,0.008085816,0.052164376,0.013594183,0.22020671],"study_design_scores_gemma":[0.00007432745,0.00006581719,0.0004952345,0.000020833455,0.00001849918,0.0001747999,0.00010216253,0.9634304,0.001759193,0.03162042,0.002226795,0.00001141884],"about_ca_topic_score_codex":0.0038741927,"about_ca_topic_score_gemma":0.0043887575,"teacher_disagreement_score":0.004044922,"about_ca_system_score_codex":0.0021592807,"about_ca_system_score_gemma":0.00091204786,"threshold_uncertainty_score":0.015666783},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5427796,0.0007041792,0.41478932,0.0009780086,0.0003389437,0.00008653713,0.00039745076,0.00055897515,0.039367042],"genre_scores_gemma":[0.9569338,0.00043740202,0.028378239,0.00012175882,0.00009612251,0.00004796878,0.00020659597,0.000269105,0.013509008],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998202,0.00002919654,0.000008472581,0.00004371207,0.000056619057,0.00004186489],"domain_scores_gemma":[0.99894696,0.0002929372,0.0001881714,0.000116881856,0.0001899584,0.00026518988],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032086155,0.00041725015,0.0003858454,0.002168222,0.0007885735,0.001996915,0.0011333773,0.0011528345,0.008120622],"category_scores_gemma":[0.0027829884,0.0004889113,0.00048732097,0.0006398436,0.0016276366,0.0027420877,0.0014822566,0.0011595698,0.0006267103],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006541188,0.000056108387,0.0010895904,0.00005240651,0.0000134037955,0.00019994627,0.00042840184,0.03900106,0.005779753,0.9335098,0.0017588906,0.018045235],"study_design_scores_gemma":[0.000012666373,0.000046441644,0.0014561599,0.000035064884,0.00000871834,0.0002679852,0.00039603485,0.27998334,0.001774841,0.71172136,0.004257228,0.00004014573],"about_ca_topic_score_codex":0.0012131401,"about_ca_topic_score_gemma":0.0010395908,"teacher_disagreement_score":0.008120622,"about_ca_system_score_codex":0.00076386164,"about_ca_system_score_gemma":0.00036976163,"threshold_uncertainty_score":0.027166188},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010106416,0.00015806154,0.98163074,0.00016447247,0.000075835436,0.00008061961,0.00030825473,0.0015700293,0.00590558],"genre_scores_gemma":[0.15654904,0.00015214611,0.83190984,0.00016938116,0.000032270345,0.0002723947,0.000723199,0.0010675511,0.009124167],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99968815,0.00005824803,0.000021214022,0.00003990258,0.000154961,0.000037586386],"domain_scores_gemma":[0.9994778,0.000200467,0.000045120196,0.00009734389,0.00012655515,0.000052683536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063591753,0.000743242,0.0006225291,0.0004601436,0.00042488723,0.0011173327,0.0018286149,0.0012646393,0.012039064],"category_scores_gemma":[0.0019008766,0.00066501903,0.0007513067,0.0004344776,0.00050414295,0.0011850501,0.0024138994,0.0016224557,0.0020700237],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014758135,0.0001000738,0.0010930471,0.0002912429,0.00006482149,0.00018887232,0.000109252556,0.88289744,0.010323863,0.029098874,0.0063822214,0.06930268],"study_design_scores_gemma":[0.000020093754,0.000008647526,0.000035759345,0.0000093561275,0.0000023499138,0.000016052576,0.000006395646,0.99447846,0.0012049156,0.0017525016,0.0024617976,0.0000037006935],"about_ca_topic_score_codex":0.004624983,"about_ca_topic_score_gemma":0.00515802,"teacher_disagreement_score":0.012039064,"about_ca_system_score_codex":0.000656518,"about_ca_system_score_gemma":0.0016020829,"threshold_uncertainty_score":0.04027468},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09929812,0.0013818064,0.87768877,0.0005192667,0.00007774615,0.000057909296,0.00023189823,0.0005529548,0.020191541],"genre_scores_gemma":[0.7342095,0.0012484922,0.24687603,0.00018751838,0.00012543249,0.000113720576,0.00059695175,0.0004767985,0.016165607],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99911433,0.00024055,0.000052276522,0.0002461223,0.0002324918,0.00011417197],"domain_scores_gemma":[0.9977798,0.001081637,0.00033599595,0.00039577295,0.00023918875,0.00016756674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00130845,0.0006469906,0.0012022159,0.0017838546,0.0010251527,0.0022709484,0.001637422,0.0015853213,0.0061929487],"category_scores_gemma":[0.008279037,0.00067472534,0.0008526434,0.002041248,0.0016903364,0.005867577,0.0038281023,0.0018958846,0.0011211871],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003369287,0.00010561143,0.0016698573,0.00030285332,0.00006970085,0.00015916416,0.00036616414,0.11151223,0.0057096346,0.7209689,0.0052913087,0.15350762],"study_design_scores_gemma":[0.000051108596,0.00010823395,0.0010037166,0.00005759873,0.000039884424,0.00023212998,0.0002343054,0.25567305,0.0041264934,0.7318596,0.006583587,0.000030223195],"about_ca_topic_score_codex":0.0009198442,"about_ca_topic_score_gemma":0.0013681627,"teacher_disagreement_score":0.0061929487,"about_ca_system_score_codex":0.00085360144,"about_ca_system_score_gemma":0.0005356276,"threshold_uncertainty_score":0.020717502},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019748809,0.00008379893,0.9726486,0.00008125092,0.000041797357,0.00007527909,0.00021722734,0.003409007,0.003694184],"genre_scores_gemma":[0.12024245,0.00017571935,0.8743878,0.000046497673,0.00001641845,0.000112871574,0.00082456984,0.000668412,0.0035252392],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99956876,0.000052367326,0.000029364091,0.000100279285,0.00018776832,0.00006146159],"domain_scores_gemma":[0.9995197,0.00014453093,0.000049699902,0.0001799159,0.00008267056,0.000023440776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028039937,0.00065568666,0.0005446432,0.00073993846,0.00035645356,0.00069735624,0.00085653947,0.00049341284,0.008765848],"category_scores_gemma":[0.0015956189,0.0005303159,0.00078699674,0.0009335494,0.0005234962,0.0013421087,0.0017780437,0.0009353105,0.0016197915],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024117432,0.00007921566,0.0011737414,0.00031031828,0.000047906306,0.0002741356,0.00032914203,0.10928482,0.044811804,0.08605596,0.013347127,0.74404454],"study_design_scores_gemma":[0.00011522666,0.00020515689,0.00095042336,0.000068380505,0.00005528203,0.00066261337,0.00023327093,0.74417514,0.058869656,0.12808079,0.06651143,0.00007265549],"about_ca_topic_score_codex":0.0012533009,"about_ca_topic_score_gemma":0.001736888,"teacher_disagreement_score":0.008765848,"about_ca_system_score_codex":0.00036253547,"about_ca_system_score_gemma":0.00031931742,"threshold_uncertainty_score":0.02932465},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04706119,0.00016991026,0.94507474,0.00012959294,0.00006761657,0.00007790938,0.00028880392,0.0011914236,0.005938929],"genre_scores_gemma":[0.38271493,0.0002461134,0.6118757,0.00006993879,0.000024042192,0.00020296873,0.00090219174,0.00039676094,0.0035673256],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99969816,0.000052808948,0.000023288614,0.00004767348,0.00013990997,0.00003820041],"domain_scores_gemma":[0.9996001,0.00012666895,0.000035149547,0.0001200543,0.00008464753,0.00003337898],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029494165,0.00044250695,0.0006900616,0.00066697557,0.00051108276,0.0011209506,0.0010181027,0.00055803667,0.0037593765],"category_scores_gemma":[0.0014705964,0.0003584816,0.00060184824,0.0009703795,0.0006225491,0.0011047081,0.0019913767,0.0006661952,0.0010365152],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008894155,0.000043659136,0.0018511504,0.00016944297,0.000033061162,0.00017852186,0.00027806766,0.7791164,0.010636716,0.060352664,0.0053129722,0.14193837],"study_design_scores_gemma":[0.00001958511,0.00002557351,0.00012771472,0.000009393517,0.000005771971,0.000031653275,0.0000756666,0.9754724,0.0024334162,0.01667251,0.0051178425,0.000008490238],"about_ca_topic_score_codex":0.003670653,"about_ca_topic_score_gemma":0.004084398,"teacher_disagreement_score":0.0037593765,"about_ca_system_score_codex":0.0005753228,"about_ca_system_score_gemma":0.00077458785,"threshold_uncertainty_score":0.012576401},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.64723283,0.00048454115,0.29912123,0.0007016247,0.00012582798,0.00014598375,0.00079898495,0.00040833108,0.050980628],"genre_scores_gemma":[0.89710814,0.00048138908,0.08353028,0.00017306594,0.00009630384,0.0001283987,0.0012540377,0.00023938602,0.01698883],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991979,0.00022548683,0.000041734667,0.000148388,0.00023376792,0.00015273843],"domain_scores_gemma":[0.99709094,0.0013453916,0.000455365,0.0005677106,0.00022782227,0.00031273422],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035335435,0.0004823559,0.0008226818,0.00092775084,0.0012722549,0.0021773218,0.0016322108,0.001555433,0.010710641],"category_scores_gemma":[0.005157308,0.0007042654,0.0007268812,0.001846865,0.0013499183,0.003036188,0.0021768596,0.0013563856,0.0011902852],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036484748,0.00017311316,0.002891915,0.00030514356,0.000038956314,0.00077990536,0.0011334404,0.07866223,0.008124049,0.8133671,0.008962051,0.08519724],"study_design_scores_gemma":[0.000046781544,0.000069282796,0.0012728961,0.00005447038,0.000029478197,0.000603075,0.00058281654,0.19784883,0.0042012823,0.78855425,0.0067118187,0.000025051986],"about_ca_topic_score_codex":0.0015410468,"about_ca_topic_score_gemma":0.0015466927,"teacher_disagreement_score":0.010710641,"about_ca_system_score_codex":0.00056091446,"about_ca_system_score_gemma":0.00036089306,"threshold_uncertainty_score":0.035830617},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040107515,0.0000700432,0.9353307,0.00017705768,0.0002661984,0.0000980146,0.00048391058,0.004161547,0.01930503],"genre_scores_gemma":[0.58276194,0.00015769151,0.38748842,0.00011011665,0.00007764701,0.000101201476,0.00080300623,0.0019251767,0.026574673],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996581,0.00003728949,0.000021664731,0.000088659945,0.00013754895,0.000056734618],"domain_scores_gemma":[0.9995859,0.00006127028,0.000023521918,0.00022012887,0.00007285747,0.00003643848],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036538078,0.000637446,0.000732584,0.0014204868,0.000796459,0.0013481138,0.0007933771,0.0006004337,0.025651136],"category_scores_gemma":[0.0013705343,0.00042436083,0.0008064167,0.0009474123,0.001053642,0.0012021466,0.003469881,0.001101406,0.0032567543],"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.0007055331,0.00014054053,0.0024907868,0.0002840205,0.000070973976,0.00048406786,0.0005435752,0.1086952,0.0464997,0.1904036,0.015882533,0.63379955],"study_design_scores_gemma":[0.00016095555,0.00029862864,0.001228294,0.0000933429,0.000063246785,0.0005867538,0.0005209944,0.6585614,0.037096795,0.20857945,0.09272685,0.00008335353],"about_ca_topic_score_codex":0.0026752213,"about_ca_topic_score_gemma":0.0030068008,"teacher_disagreement_score":0.025651136,"about_ca_system_score_codex":0.00047535356,"about_ca_system_score_gemma":0.0005561509,"threshold_uncertainty_score":0.085811555},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019542405,0.0041235173,0.19982708,0.005618245,0.0010590791,0.00014643074,0.00054903387,0.00027935192,0.76885486],"genre_scores_gemma":[0.40895778,0.0060166344,0.18678257,0.00198097,0.001409496,0.0005113573,0.0030964795,0.00052249926,0.39072224],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99877757,0.00032085693,0.000074334544,0.00029579535,0.00035655714,0.00017493567],"domain_scores_gemma":[0.99903107,0.0004609733,0.00006301638,0.00017716107,0.00019043968,0.000077355806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007614622,0.0008138042,0.00056725624,0.00096975977,0.0021793386,0.0029762154,0.0012260035,0.0016266351,0.035510283],"category_scores_gemma":[0.0027014192,0.00044058086,0.0010830748,0.0013764723,0.0033169913,0.0041737966,0.0024701932,0.0029689285,0.0067292047],"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.000015184382,0.000010553181,0.000064287146,0.000052433374,0.0000031316818,0.000064011845,0.00013152753,0.0022396964,0.00024611937,0.9700159,0.011739441,0.015417744],"study_design_scores_gemma":[0.000013169554,0.000014656405,0.00014081283,0.000062047795,0.000007091491,0.0002443016,0.00016393611,0.006540619,0.00069225684,0.8158535,0.17625745,0.000010126387],"about_ca_topic_score_codex":0.0023226442,"about_ca_topic_score_gemma":0.001713607,"teacher_disagreement_score":0.035510283,"about_ca_system_score_codex":0.0019826782,"about_ca_system_score_gemma":0.00092190603,"threshold_uncertainty_score":0.11879367},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0110664535,0.0021513002,0.04802182,0.0064025945,0.0008039875,0.00007495835,0.00031837664,0.00018874617,0.9309718],"genre_scores_gemma":[0.46204057,0.005258976,0.044920802,0.003413567,0.0012825609,0.0002917787,0.001647375,0.00056561857,0.48057875],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983259,0.00051533326,0.00010096092,0.00037920405,0.0004521062,0.0002265105],"domain_scores_gemma":[0.9982804,0.00089070195,0.0001049056,0.00020185595,0.0003670862,0.0001549216],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012844035,0.0006529301,0.0005924465,0.00131243,0.0031900213,0.004714931,0.0013635746,0.002311866,0.0496603],"category_scores_gemma":[0.005252529,0.00037606567,0.0010694059,0.001706668,0.0041771154,0.008335009,0.0034307207,0.0045110066,0.0060753305],"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.000008194488,0.0000073192414,0.000044998953,0.000030440931,0.0000029741482,0.000047276342,0.00014187225,0.0009384667,0.00004639307,0.97494465,0.01504151,0.008745892],"study_design_scores_gemma":[0.000007842607,0.000007882994,0.000065493354,0.00007167039,0.000005107011,0.000169762,0.0002885943,0.0023117585,0.00020253142,0.83263296,0.16422719,0.000009281132],"about_ca_topic_score_codex":0.0033089328,"about_ca_topic_score_gemma":0.0020401876,"teacher_disagreement_score":0.0496603,"about_ca_system_score_codex":0.003596081,"about_ca_system_score_gemma":0.0016340635,"threshold_uncertainty_score":0.16613024},"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":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.56181264,0.00029544558,0.42995176,0.00034742217,0.00003192255,0.00019615075,0.0008401113,0.002543826,0.0039807223],"genre_scores_gemma":[0.72191817,0.00013690427,0.27324462,0.00010865007,0.000024059516,0.00012816448,0.0021893533,0.00036746697,0.0018826127],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991887,0.00013104158,0.000058594356,0.00026790902,0.00020724666,0.00014641641],"domain_scores_gemma":[0.99743074,0.0012721267,0.000302141,0.0006789484,0.0001586867,0.00015726931],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051299034,0.0007798442,0.0011986004,0.0008432142,0.00080745586,0.0016286046,0.0011339244,0.0010532371,0.0027324166],"category_scores_gemma":[0.0048670317,0.0007066511,0.0012616062,0.0014545483,0.0010553151,0.0026253685,0.0018345594,0.0010507761,0.00050961995],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013912759,0.00032377933,0.01061379,0.0005210338,0.00011338732,0.0006348826,0.0011126461,0.7197537,0.03477587,0.041933924,0.0069621503,0.18186355],"study_design_scores_gemma":[0.000093703595,0.00011077801,0.0010626259,0.000026396407,0.000024356292,0.00019156137,0.0002231678,0.9260902,0.008359715,0.062187213,0.0016092265,0.000021057716],"about_ca_topic_score_codex":0.0029917208,"about_ca_topic_score_gemma":0.004731889,"teacher_disagreement_score":0.0029917208,"about_ca_system_score_codex":0.0010419809,"about_ca_system_score_gemma":0.00088411086,"threshold_uncertainty_score":0.009140849},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16013317,0.0021303783,0.769959,0.005853813,0.0007419385,0.00017907986,0.0009771202,0.0028196361,0.05720598],"genre_scores_gemma":[0.78113353,0.0007912397,0.196727,0.0016659386,0.00047728076,0.00028055027,0.0012296925,0.0017624691,0.015932146],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99672914,0.0006641353,0.00019434771,0.0007585889,0.0010702895,0.00058344833],"domain_scores_gemma":[0.9859532,0.0080007035,0.00039848473,0.0044895317,0.00071157765,0.00044663384],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002856314,0.0011283993,0.0020203951,0.0017521256,0.0017735477,0.003642915,0.003705823,0.0020292096,0.015199466],"category_scores_gemma":[0.019460745,0.0010135073,0.003192932,0.0014778775,0.0045153857,0.009726225,0.0063359155,0.008683847,0.0015993988],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004064717,0.00023508337,0.0014974787,0.00042602254,0.000106239655,0.00016766414,0.0005058154,0.11271245,0.0040012454,0.8281959,0.011364053,0.04038151],"study_design_scores_gemma":[0.000035851688,0.000029488627,0.00038944054,0.000029004108,0.000031986867,0.000045661513,0.000068398724,0.11671318,0.0009838893,0.8781149,0.0035420272,0.000016159096],"about_ca_topic_score_codex":0.0031226198,"about_ca_topic_score_gemma":0.00470812,"teacher_disagreement_score":0.015199466,"about_ca_system_score_codex":0.002989753,"about_ca_system_score_gemma":0.0013904169,"threshold_uncertainty_score":0.050847232},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78298676,0.00062536803,0.166532,0.0009165253,0.000044943503,0.000056272092,0.00033654374,0.00022782614,0.04827371],"genre_scores_gemma":[0.97496563,0.0003201847,0.01897592,0.00007612811,0.00005855271,0.00004835505,0.00023630881,0.000069266076,0.0052496647],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99982196,0.000035590703,0.000007925153,0.000025700183,0.000072411065,0.000036481928],"domain_scores_gemma":[0.99928707,0.00034751027,0.00009794235,0.00009123251,0.00007124887,0.00010502211],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033469792,0.00028118672,0.00029136115,0.0012399902,0.00063263834,0.0018181915,0.00056300365,0.0005132464,0.005052303],"category_scores_gemma":[0.0025280963,0.00018947246,0.00041756904,0.00046633012,0.0016450619,0.003165374,0.001277242,0.0012204342,0.0003065469],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032075815,0.000014640672,0.00092015654,0.000035344452,0.000007098703,0.00007578423,0.00013835722,0.020184072,0.0013322103,0.9722634,0.00076206506,0.0042348234],"study_design_scores_gemma":[0.000008363412,0.000012222099,0.0007506003,0.000013050781,0.0000043541268,0.00005577243,0.00006815021,0.19256221,0.0009135058,0.8044117,0.0011874659,0.000012602954],"about_ca_topic_score_codex":0.0013885207,"about_ca_topic_score_gemma":0.0013453203,"teacher_disagreement_score":0.005052303,"about_ca_system_score_codex":0.0009378479,"about_ca_system_score_gemma":0.00048304445,"threshold_uncertainty_score":0.016901612},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03146433,0.00024289227,0.9477655,0.00029126706,0.0000680375,0.00012710666,0.00048210376,0.00013571064,0.019423015],"genre_scores_gemma":[0.4239106,0.0005459459,0.55446696,0.00033753805,0.00016582443,0.000641443,0.0010977319,0.00032022898,0.018513715],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995277,0.00010525709,0.000026984528,0.00009239834,0.00016581261,0.00008189428],"domain_scores_gemma":[0.9994301,0.00023618374,0.00007594037,0.00010277808,0.00011037894,0.000044731896],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073451194,0.0010379737,0.00049922586,0.00039820073,0.000314518,0.0015001913,0.0015207545,0.00083404256,0.0064618853],"category_scores_gemma":[0.0017659528,0.00044990238,0.0010737332,0.00051821553,0.0007965751,0.0023389137,0.0012645068,0.0021601408,0.0006857962],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000083754574,0.00009981344,0.0003843671,0.00021134858,0.000029651987,0.0003112879,0.0002091215,0.34295985,0.005609695,0.6091939,0.004436424,0.036470786],"study_design_scores_gemma":[0.00004538532,0.000103745864,0.00018223426,0.00005503363,0.00001716653,0.00011202902,0.00011914809,0.7539609,0.0021206646,0.22942188,0.0138390595,0.000022794855],"about_ca_topic_score_codex":0.00120736,"about_ca_topic_score_gemma":0.0024465665,"teacher_disagreement_score":0.0064618853,"about_ca_system_score_codex":0.00092476176,"about_ca_system_score_gemma":0.00071527506,"threshold_uncertainty_score":0.021617174},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031790342,0.0015765086,0.8935024,0.0007470661,0.00037278875,0.00023410929,0.0010084994,0.0026038764,0.06816439],"genre_scores_gemma":[0.36660406,0.0015285084,0.6009162,0.00045891694,0.0001402869,0.00027564535,0.0022647432,0.0009923469,0.026819324],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988953,0.00014571268,0.00005580203,0.00030972096,0.00035628353,0.00023709518],"domain_scores_gemma":[0.9990221,0.00029001708,0.00011964586,0.00034314912,0.00009920854,0.00012575806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041110674,0.001115985,0.0011553455,0.0008489706,0.0013234616,0.0022264917,0.0027351934,0.0016627802,0.01869998],"category_scores_gemma":[0.002428428,0.00063126144,0.0013304796,0.0011684597,0.0018870034,0.004458733,0.0039189816,0.0024065604,0.0043248213],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004416306,0.00019347481,0.0016839508,0.00076743274,0.00006744818,0.0010298857,0.0007749431,0.30533028,0.022302192,0.3455927,0.032654483,0.28916153],"study_design_scores_gemma":[0.000074401425,0.00030754623,0.00087899744,0.00024316197,0.00007127763,0.0016806106,0.0005336066,0.5282246,0.018962542,0.26141587,0.18751141,0.0000959937],"about_ca_topic_score_codex":0.0029353215,"about_ca_topic_score_gemma":0.0030415533,"teacher_disagreement_score":0.01869998,"about_ca_system_score_codex":0.0009485468,"about_ca_system_score_gemma":0.0009827984,"threshold_uncertainty_score":0.06255764},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8692099,0.0014033178,0.08642359,0.001131112,0.00007086317,0.000052940155,0.0014902964,0.0004132914,0.039804734],"genre_scores_gemma":[0.9599685,0.0013006424,0.031228669,0.00012329553,0.0000661872,0.00010965325,0.0011895163,0.00012305494,0.0058905855],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99968314,0.000058472146,0.000012541051,0.00007133668,0.00008944135,0.00008500348],"domain_scores_gemma":[0.99862933,0.000730503,0.00018076405,0.00010440004,0.00015490364,0.00020024525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032079732,0.00042610997,0.0005342833,0.0017502734,0.00078687636,0.0016310666,0.000864815,0.00065140944,0.0034847155],"category_scores_gemma":[0.0027839125,0.00038438075,0.0004125322,0.0011309653,0.0013566026,0.0017765955,0.0011765929,0.0010977037,0.00056918425],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000234605,0.00006385955,0.004724096,0.00022951027,0.000028722361,0.00014844435,0.0003196884,0.03636517,0.014996725,0.8949555,0.006953219,0.040980395],"study_design_scores_gemma":[0.000037541773,0.000078208934,0.004265468,0.00006850992,0.00003236612,0.00052277435,0.0002645648,0.092658825,0.008135085,0.87963974,0.014247328,0.000049571074],"about_ca_topic_score_codex":0.0009621471,"about_ca_topic_score_gemma":0.0008417488,"teacher_disagreement_score":0.0034847155,"about_ca_system_score_codex":0.00090133597,"about_ca_system_score_gemma":0.0004535113,"threshold_uncertainty_score":0.011657596},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26852491,0.005699748,0.5522935,0.0011784775,0.00041287948,0.000092049115,0.001405897,0.0010966684,0.16929583],"genre_scores_gemma":[0.81798595,0.002873659,0.16317596,0.00016370071,0.0002521903,0.00010313807,0.0007545408,0.000657954,0.014032845],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994161,0.00013511244,0.000019766905,0.00013883392,0.00024518816,0.000044934703],"domain_scores_gemma":[0.99881786,0.0007403586,0.00009254024,0.00014633442,0.00014379955,0.000059043257],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005479716,0.0005366077,0.0006304723,0.0017260277,0.00045961273,0.0012723404,0.0012966291,0.00075237174,0.008657648],"category_scores_gemma":[0.005809832,0.0004381153,0.00030714893,0.0013489538,0.00095189194,0.0029002083,0.0011013555,0.00094457535,0.0012799968],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023425552,0.000059361,0.0013096062,0.00047997676,0.000044162516,0.00019128007,0.0002792347,0.15604304,0.010333681,0.5891271,0.012972054,0.22892626],"study_design_scores_gemma":[0.000018960263,0.00007361192,0.0016917998,0.0000773695,0.00003853104,0.00064061873,0.00021818791,0.44151515,0.005554119,0.5341381,0.015994968,0.000038658396],"about_ca_topic_score_codex":0.0010411564,"about_ca_topic_score_gemma":0.0010074025,"teacher_disagreement_score":0.008657648,"about_ca_system_score_codex":0.00063733093,"about_ca_system_score_gemma":0.00034448042,"threshold_uncertainty_score":0.028962672},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32364,0.019762311,0.5512461,0.0023272035,0.005795832,0.00028559222,0.0009975547,0.003834263,0.0921112],"genre_scores_gemma":[0.72750044,0.01090582,0.15131433,0.0004455328,0.00053309713,0.00007936624,0.00087126787,0.0010143843,0.10733584],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99971694,0.000013453088,0.000027915059,0.000028046881,0.00018480197,0.000028862274],"domain_scores_gemma":[0.9999291,0.00001796724,0.000012301183,0.000018019955,0.00001504553,0.0000075892426],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001834813,0.00076721667,0.00041415935,0.0010707179,0.00034115714,0.00056750444,0.0008627401,0.00061818026,0.007914132],"category_scores_gemma":[0.00046616525,0.00019008733,0.0006299438,0.0005774585,0.00040024557,0.0004355118,0.00050608284,0.000989509,0.0019216384],"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.00020365842,0.000099947356,0.0039054009,0.00048060337,0.00007549129,0.011611199,0.00019655433,0.0036855927,0.05349687,0.0042315493,0.009851467,0.91216177],"study_design_scores_gemma":[0.00016952849,0.0019968082,0.042977385,0.0009110327,0.00033008697,0.65140224,0.00051536685,0.023708254,0.08318525,0.011258026,0.18336822,0.0001777462],"about_ca_topic_score_codex":0.00087755435,"about_ca_topic_score_gemma":0.0028513058,"teacher_disagreement_score":0.007914132,"about_ca_system_score_codex":0.00022517124,"about_ca_system_score_gemma":0.00046477976,"threshold_uncertainty_score":0.02647537},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00056171196,0.00042209536,0.00089249335,0.00035800412,0.00030717885,0.00012005894,0.00080207136,0.0010341752,0.9955023],"genre_scores_gemma":[0.00079282705,0.0002987406,0.00051251607,0.0002531325,0.00006220998,0.00006643965,0.0005160446,0.0002603238,0.9972378],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99926335,0.000055085962,0.00006889161,0.00026528098,0.00018917219,0.00015821341],"domain_scores_gemma":[0.9974389,0.0006970081,0.0001467396,0.00035174994,0.0005895396,0.0007760445],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0011484354,0.0030374322,0.0019360691,0.002970914,0.0026347735,0.0040482525,0.003513012,0.005296099,0.9884425],"category_scores_gemma":[0.0018467366,0.0010337594,0.0015010615,0.002802439,0.0025460385,0.0054529333,0.0034500773,0.0027585614,0.99195355],"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.0004038104,0.00026222848,0.0010508448,0.00070581876,0.00004737152,0.00029947376,0.00013727575,0.0006169944,0.0026194977,0.005898549,0.4137297,0.5742285],"study_design_scores_gemma":[0.000065128195,0.0001347719,0.00093933183,0.0003788794,0.000019619734,0.00039514416,0.00016160693,0.00029221966,0.0004884987,0.00094241754,0.9961522,0.000030126675],"about_ca_topic_score_codex":0.0056421096,"about_ca_topic_score_gemma":0.0043871203,"teacher_disagreement_score":0.011557519,"about_ca_system_score_codex":0.0011806351,"about_ca_system_score_gemma":0.0010121699,"threshold_uncertainty_score":0.016485393},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00071269635,0.0003700261,0.0012258596,0.00038481216,0.00032831382,0.00015836433,0.0011644171,0.0013914555,0.99426407],"genre_scores_gemma":[0.0010749265,0.00027975193,0.0007153581,0.000289899,0.00006999584,0.00007662814,0.0008409368,0.0003619657,0.99629056],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991437,0.00006739802,0.000071601884,0.0003053186,0.0001972071,0.00021469723],"domain_scores_gemma":[0.99731606,0.0007442378,0.00014376668,0.0003979682,0.000565165,0.0008327853],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0011891327,0.003190617,0.0018970664,0.0030253862,0.002629342,0.0038272734,0.0037564558,0.0055696,0.98855394],"category_scores_gemma":[0.0019304997,0.0010502313,0.0017065785,0.0027044695,0.0025012707,0.005300771,0.0041022934,0.002604773,0.9912362],"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.00057006493,0.00036729683,0.0012429551,0.00066560105,0.00005443443,0.00032780142,0.00014358012,0.0007329293,0.0032165758,0.0055932268,0.41588148,0.57120407],"study_design_scores_gemma":[0.00009289976,0.0001639313,0.0011245923,0.00038800813,0.000022348948,0.00037750308,0.00016121242,0.00044800917,0.0006021081,0.001044655,0.99554056,0.000034217326],"about_ca_topic_score_codex":0.006496214,"about_ca_topic_score_gemma":0.0043311194,"teacher_disagreement_score":0.011446059,"about_ca_system_score_codex":0.0011624796,"about_ca_system_score_gemma":0.000924084,"threshold_uncertainty_score":0.016326427},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000619659,0.00041275215,0.0010708795,0.00035491734,0.00031497102,0.00012757769,0.00093464623,0.0011832971,0.99498147],"genre_scores_gemma":[0.0008884218,0.00028462673,0.0005421625,0.00023440772,0.00006534569,0.00006249428,0.000556931,0.00026672246,0.9970989],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992367,0.00005688723,0.00007286939,0.00027937393,0.00018106816,0.00017305365],"domain_scores_gemma":[0.9971781,0.0007572273,0.00016345474,0.0003778529,0.00067129725,0.00085207087],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0012891103,0.0032079343,0.0019575562,0.0029176886,0.0025322577,0.0041824724,0.0033579378,0.0049293214,0.98870903],"category_scores_gemma":[0.0018038274,0.0011015492,0.0015518544,0.002879732,0.0026594049,0.005506636,0.0036574616,0.002958831,0.992753],"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.0005084137,0.0002746632,0.0011966139,0.00071207643,0.000055539662,0.0002987234,0.00013740524,0.0007259886,0.0032670067,0.0057369857,0.3895035,0.5975831],"study_design_scores_gemma":[0.000082075436,0.00017132454,0.0010525642,0.00044769485,0.000022493708,0.00042635176,0.00018806526,0.0004245618,0.0006222433,0.0009649495,0.9955615,0.000036169873],"about_ca_topic_score_codex":0.0051229876,"about_ca_topic_score_gemma":0.0039122454,"teacher_disagreement_score":0.011290967,"about_ca_system_score_codex":0.0011533151,"about_ca_system_score_gemma":0.000904542,"threshold_uncertainty_score":0.016105175},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15260395,0.0015931968,0.8134287,0.0013849725,0.0002941718,0.000057802965,0.00015543822,0.00014531372,0.030336356],"genre_scores_gemma":[0.857181,0.001533567,0.11843155,0.00041277835,0.0002274712,0.000112090616,0.00027704964,0.0003797767,0.021444727],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996284,0.00014721874,0.000017396997,0.000071479735,0.000094766634,0.00004076562],"domain_scores_gemma":[0.9987722,0.00073974964,0.000119922726,0.00004136162,0.00020986382,0.00011689173],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012806803,0.00068768766,0.0008822137,0.0019835928,0.00054667104,0.0016451307,0.0010416331,0.0011444144,0.004105246],"category_scores_gemma":[0.005185874,0.00042236852,0.00047028408,0.0011572157,0.0022146546,0.0020328949,0.001649904,0.002003402,0.0005156487],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000117512594,0.000050387152,0.0006881412,0.00016618845,0.00002949291,0.00011851528,0.00023869934,0.05155797,0.005217473,0.9086641,0.0030239732,0.030127542],"study_design_scores_gemma":[0.00002033492,0.00006607077,0.000621341,0.00006844453,0.000015001982,0.00013912587,0.00011178129,0.4618564,0.0017362066,0.5317895,0.0035461686,0.000029662739],"about_ca_topic_score_codex":0.0018770044,"about_ca_topic_score_gemma":0.0018014902,"teacher_disagreement_score":0.004105246,"about_ca_system_score_codex":0.0012270918,"about_ca_system_score_gemma":0.0007178683,"threshold_uncertainty_score":0.013733387},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5138943,0.0015591462,0.18003207,0.0018062918,0.00013169437,0.00014060621,0.000851623,0.0003596331,0.30122456],"genre_scores_gemma":[0.9069766,0.0011586872,0.03844552,0.00029456883,0.00015639569,0.00016395147,0.0008447869,0.00026259903,0.05169694],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992663,0.00015107142,0.00003128841,0.0001425699,0.00027594017,0.0001327993],"domain_scores_gemma":[0.99767166,0.0014772927,0.00019647031,0.00020664251,0.0002555637,0.00019229374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062708854,0.00052404485,0.00093373714,0.0021717232,0.0028803933,0.0028283428,0.0016204865,0.0008696653,0.0087800175],"category_scores_gemma":[0.0032261468,0.00087814534,0.0009503007,0.0038745776,0.0024350109,0.0038118423,0.0019785874,0.0026773557,0.00057111506],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039022296,0.000021928554,0.0004526754,0.000065455766,0.000016490712,0.00013416006,0.00047182027,0.0037988517,0.00088056724,0.97807795,0.002734766,0.013306158],"study_design_scores_gemma":[0.00001394896,0.000010265583,0.00045938033,0.000023035702,0.000024192259,0.00028850444,0.00023563152,0.012824155,0.0008414559,0.9783059,0.006964076,0.000009465696],"about_ca_topic_score_codex":0.002421666,"about_ca_topic_score_gemma":0.002852956,"teacher_disagreement_score":0.0087800175,"about_ca_system_score_codex":0.0018724593,"about_ca_system_score_gemma":0.00062163273,"threshold_uncertainty_score":0.029372156},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.061404604,0.013302585,0.3096132,0.0010081462,0.0007153198,0.00010661299,0.0012295172,0.00069940754,0.6119206],"genre_scores_gemma":[0.57531536,0.015236162,0.12492246,0.0006738396,0.00096141157,0.00023017888,0.0029913988,0.0012325465,0.27843654],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997404,0.000026859494,0.000009149584,0.00006032814,0.00011870363,0.00004455302],"domain_scores_gemma":[0.99962044,0.00018391441,0.000023080434,0.00007664413,0.000051061354,0.00004484734],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015053539,0.00047465813,0.0004791577,0.001269356,0.0007642152,0.0019736306,0.0007140672,0.000615437,0.020963086],"category_scores_gemma":[0.0009859082,0.00046167188,0.0004975546,0.0017704455,0.0010120884,0.0030491278,0.0014492624,0.001515453,0.0031434724],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042611107,0.000017574517,0.00018347734,0.0001917543,0.000010425703,0.00012665425,0.00018445104,0.0063729137,0.0033665402,0.86422616,0.018432295,0.1068452],"study_design_scores_gemma":[0.000007189439,0.000023196995,0.0007433828,0.00009497914,0.00002003971,0.0006475727,0.0001429936,0.011784806,0.0021130887,0.8412024,0.1432071,0.000013181739],"about_ca_topic_score_codex":0.0009790522,"about_ca_topic_score_gemma":0.0012442251,"teacher_disagreement_score":0.020963086,"about_ca_system_score_codex":0.00067700294,"about_ca_system_score_gemma":0.00022986191,"threshold_uncertainty_score":0.07012844},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043800958,0.0019793322,0.8724708,0.0022631385,0.001388613,0.000109614586,0.0004104051,0.0003318143,0.07724529],"genre_scores_gemma":[0.665766,0.0028963506,0.26482487,0.001843356,0.0015003651,0.00027949814,0.0008447096,0.0008152705,0.061229568],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99918455,0.00017494106,0.000037466627,0.00018206575,0.00030175026,0.00011921765],"domain_scores_gemma":[0.9982743,0.00078779523,0.00010728155,0.0003647755,0.0003465131,0.00011937344],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011998718,0.00083184405,0.0012986646,0.0017629545,0.0012270625,0.0016155997,0.0020255337,0.0012718557,0.010455747],"category_scores_gemma":[0.007957996,0.00038776416,0.0014402652,0.001567018,0.0016091489,0.0043540066,0.0041440506,0.0025326335,0.0018227537],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014934257,0.00008148168,0.0010834225,0.00028349512,0.000069700895,0.00024298485,0.00025378383,0.026474217,0.0054072286,0.88661385,0.011951657,0.06738881],"study_design_scores_gemma":[0.00002821196,0.000067961555,0.00096703955,0.000044368826,0.000044957123,0.00029713532,0.00009082266,0.28243986,0.002096297,0.69548684,0.018397579,0.00003891049],"about_ca_topic_score_codex":0.0022062843,"about_ca_topic_score_gemma":0.002453971,"teacher_disagreement_score":0.010455747,"about_ca_system_score_codex":0.0007745702,"about_ca_system_score_gemma":0.0008967684,"threshold_uncertainty_score":0.034977973},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12025575,0.0004315839,0.862277,0.00034375416,0.00019630953,0.00007660878,0.00025389544,0.000882966,0.015282203],"genre_scores_gemma":[0.6469713,0.00030152718,0.34295055,0.00021213731,0.00011089984,0.00014471656,0.00044107335,0.00031931617,0.00854856],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992718,0.00016090302,0.000039822946,0.00015713478,0.00022010649,0.00015018952],"domain_scores_gemma":[0.9981186,0.0006159209,0.00013254635,0.00044688772,0.0002644048,0.00042164378],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008236764,0.00035600274,0.00054448954,0.0016041121,0.0011945695,0.0017164521,0.0010571047,0.00070863875,0.0036967534],"category_scores_gemma":[0.0022604538,0.00055801653,0.0006752592,0.0008915616,0.0014638759,0.0019598186,0.003295569,0.0012614159,0.0006702972],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012519171,0.000092513634,0.0018208227,0.00014242675,0.000024728188,0.0005068524,0.00044304854,0.017529404,0.020024458,0.90945697,0.0035215998,0.046312127],"study_design_scores_gemma":[0.000067065004,0.000098045406,0.0012281423,0.000089954876,0.000056387373,0.0009133919,0.0001733137,0.15044853,0.013967235,0.7956865,0.037224073,0.000047388156],"about_ca_topic_score_codex":0.00089369767,"about_ca_topic_score_gemma":0.001526526,"teacher_disagreement_score":0.0036967534,"about_ca_system_score_codex":0.0005614509,"about_ca_system_score_gemma":0.00050414755,"threshold_uncertainty_score":0.012366831},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12994331,0.00015407811,0.8452607,0.00028492237,0.00013872897,0.000112456444,0.00013805034,0.0002702049,0.023697605],"genre_scores_gemma":[0.8650951,0.0002081403,0.12327478,0.00023430382,0.00017439402,0.00024789298,0.00022702619,0.00022448698,0.010313878],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99888855,0.0001598908,0.00012197387,0.00018439861,0.0004919449,0.00015338777],"domain_scores_gemma":[0.99595165,0.0010755326,0.0007560274,0.00092121563,0.0009309198,0.00036462123],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000944126,0.00047067725,0.0004312443,0.0011659003,0.0009486276,0.0012845473,0.00086957123,0.00064856827,0.008118379],"category_scores_gemma":[0.006317896,0.00033932622,0.00062175473,0.0006271973,0.0017370178,0.0027585824,0.0022914154,0.0012121011,0.0015551279],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000099585835,0.000048866474,0.0026683486,0.00011903563,0.000015459345,0.00055406225,0.00024576444,0.0084322505,0.04829185,0.90251654,0.0016100397,0.035398245],"study_design_scores_gemma":[0.000034481487,0.00022771808,0.0014018585,0.000036996058,0.000018168872,0.0011781612,0.00015705003,0.08994723,0.035446007,0.86222607,0.009281788,0.00004454557],"about_ca_topic_score_codex":0.00027765162,"about_ca_topic_score_gemma":0.0003993208,"teacher_disagreement_score":0.008118379,"about_ca_system_score_codex":0.0003615094,"about_ca_system_score_gemma":0.0005126357,"threshold_uncertainty_score":0.027158737},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25453606,0.00027422907,0.7334718,0.00010321624,0.0000690588,0.00012347466,0.00046495328,0.0019045076,0.009052572],"genre_scores_gemma":[0.4478803,0.00017090325,0.54379886,0.000074579126,0.000028343185,0.00012944303,0.0017315602,0.0009434142,0.00524262],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995629,0.000090455615,0.000026518986,0.000094620984,0.00015369375,0.000071653725],"domain_scores_gemma":[0.9984668,0.000855612,0.000104164275,0.00031375824,0.00015605117,0.00010357329],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039399526,0.0009359185,0.0012796841,0.0010326697,0.0005635558,0.0014799669,0.001346472,0.0009456569,0.007086141],"category_scores_gemma":[0.003604721,0.000849599,0.0007931998,0.0013184287,0.00082632375,0.0016445701,0.0020652697,0.0011576285,0.0012342052],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010376672,0.00023257574,0.0029898668,0.00043561653,0.00007927112,0.0003281643,0.00055670075,0.67528003,0.022710802,0.05275874,0.007609309,0.23598121],"study_design_scores_gemma":[0.000047418423,0.0000917454,0.0003088686,0.000022661481,0.000010489426,0.00005646349,0.000100759244,0.9653288,0.0029187817,0.029582964,0.0015202343,0.000010807533],"about_ca_topic_score_codex":0.0030008957,"about_ca_topic_score_gemma":0.005347472,"teacher_disagreement_score":0.007086141,"about_ca_system_score_codex":0.0005106815,"about_ca_system_score_gemma":0.00054706354,"threshold_uncertainty_score":0.023705482},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52866626,0.0032239603,0.3858466,0.0012201848,0.00019180245,0.00007379838,0.0011911681,0.00087722327,0.07870894],"genre_scores_gemma":[0.93431747,0.0008369342,0.060591035,0.000083073115,0.00008109504,0.00004626291,0.00040701017,0.00021661217,0.0034205937],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994029,0.00016312164,0.000021549136,0.00013304588,0.00022288559,0.000056504497],"domain_scores_gemma":[0.9982317,0.0011368335,0.0001579113,0.00019201344,0.00019539318,0.00008616362],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068182644,0.00044708012,0.00048055325,0.0016944588,0.0004483265,0.0011442465,0.0011060549,0.00086248654,0.006572557],"category_scores_gemma":[0.008370362,0.0003440334,0.00024636622,0.0010050485,0.00093118695,0.0027126959,0.0010739205,0.00070719334,0.00081087317],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038299582,0.00008376226,0.0036571568,0.00051195594,0.000062760766,0.00034125076,0.00037250278,0.2784272,0.012039184,0.5320539,0.009420195,0.16264711],"study_design_scores_gemma":[0.00002379766,0.00006942738,0.0022498986,0.000059977327,0.000030815616,0.000568492,0.00024189243,0.65318227,0.004682794,0.3329238,0.0059342883,0.0000325986],"about_ca_topic_score_codex":0.0010485947,"about_ca_topic_score_gemma":0.0009880451,"teacher_disagreement_score":0.006572557,"about_ca_system_score_codex":0.0005757089,"about_ca_system_score_gemma":0.000376455,"threshold_uncertainty_score":0.021987379},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5165452,0.0005028828,0.4488139,0.00028399564,0.000063587526,0.000088137516,0.00063780573,0.00050229277,0.032562297],"genre_scores_gemma":[0.8915412,0.0002942373,0.09931959,0.00006867372,0.000042047643,0.00008475432,0.0009849354,0.00011883942,0.00754578],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99921954,0.00014050778,0.000060756985,0.00010744664,0.00033747527,0.00013431408],"domain_scores_gemma":[0.99787724,0.0009722624,0.00025399507,0.00029340762,0.00039064387,0.00021249484],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047295878,0.000272488,0.0004886169,0.001473254,0.0008959519,0.0012045703,0.001013996,0.000643662,0.007872579],"category_scores_gemma":[0.004003568,0.00032245403,0.000405096,0.0010381043,0.000956782,0.002658,0.0019842384,0.0009800545,0.00096254126],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032908234,0.00006788745,0.003078517,0.0005128337,0.000037552523,0.0003799411,0.0005263422,0.023650695,0.02110452,0.8517944,0.0024888685,0.09602932],"study_design_scores_gemma":[0.000041251496,0.00018964906,0.0027111028,0.000115330695,0.00005728994,0.0012637803,0.0007648292,0.11750083,0.016526489,0.8449258,0.015853489,0.000050073893],"about_ca_topic_score_codex":0.0002495126,"about_ca_topic_score_gemma":0.00043129627,"teacher_disagreement_score":0.007872579,"about_ca_system_score_codex":0.00048113213,"about_ca_system_score_gemma":0.00027526755,"threshold_uncertainty_score":0.026336432},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.72483885,0.0037122539,0.18175311,0.0052181147,0.00035628068,0.00006958491,0.0010645669,0.0005826357,0.08240465],"genre_scores_gemma":[0.9654845,0.0007540883,0.02590007,0.00048480218,0.00024826863,0.00011708304,0.000823504,0.00014612857,0.006041501],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987451,0.00036556303,0.00004618367,0.00024037258,0.00025138923,0.00035146734],"domain_scores_gemma":[0.99476695,0.0039245775,0.00027556068,0.00040461365,0.00016708278,0.000461168],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015378256,0.00079210725,0.0013654135,0.0013656913,0.0018801928,0.0024907673,0.001542758,0.0015897858,0.007149941],"category_scores_gemma":[0.006815226,0.0006612338,0.0010694946,0.0011417413,0.0024585112,0.0036875953,0.002536526,0.0023604038,0.0007143575],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040616494,0.00010554722,0.0030481378,0.0002794178,0.00006919256,0.00038974712,0.0003580116,0.08324982,0.00411245,0.8726964,0.012944755,0.022340337],"study_design_scores_gemma":[0.00007278682,0.000062913205,0.0017852281,0.00006312403,0.00002334307,0.0003287858,0.00022209153,0.25128666,0.002470666,0.73813146,0.005507268,0.000045691522],"about_ca_topic_score_codex":0.0017292802,"about_ca_topic_score_gemma":0.0011780512,"teacher_disagreement_score":0.007149941,"about_ca_system_score_codex":0.0019513385,"about_ca_system_score_gemma":0.00046024867,"threshold_uncertainty_score":0.023918927},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029949518,0.0002542405,0.9248694,0.0001988385,0.00044988832,0.00018368119,0.00045802887,0.0013698963,0.042266622],"genre_scores_gemma":[0.26897678,0.00032658226,0.7112336,0.00014711655,0.00006595774,0.0002799687,0.002141543,0.0010024133,0.015826026],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.996628,0.0003421851,0.00021801968,0.00048013573,0.0020131487,0.0003184334],"domain_scores_gemma":[0.9978447,0.00060094224,0.00017139205,0.0005530213,0.0007131426,0.00011682048],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096303516,0.0008088733,0.0013841755,0.002015884,0.0018517175,0.0037232172,0.0025219724,0.001334854,0.0211655],"category_scores_gemma":[0.00673406,0.0006823306,0.0014325441,0.0022405272,0.0015223165,0.0033659807,0.005226962,0.002121169,0.0065762666],"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.00045389752,0.00019717528,0.0030101917,0.00056039187,0.00008088408,0.00088710134,0.0008635496,0.059984226,0.016241895,0.49820125,0.01918335,0.40033615],"study_design_scores_gemma":[0.00007670836,0.00018709706,0.0008074403,0.00017846918,0.00004229807,0.0013462538,0.0010568227,0.5391897,0.045226786,0.3295623,0.08220737,0.00011879973],"about_ca_topic_score_codex":0.0013683497,"about_ca_topic_score_gemma":0.0015433641,"teacher_disagreement_score":0.0211655,"about_ca_system_score_codex":0.00085607107,"about_ca_system_score_gemma":0.0014143627,"threshold_uncertainty_score":0.07080561},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010214931,0.00033856995,0.974812,0.00013707254,0.0001354079,0.00009437339,0.0004020027,0.0054249205,0.0084407395],"genre_scores_gemma":[0.063462265,0.00034548168,0.92522436,0.000076506665,0.000050500643,0.00015242938,0.0014815131,0.0016834816,0.007523458],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99913174,0.00013503173,0.000057015513,0.00014365763,0.00039694546,0.00013550362],"domain_scores_gemma":[0.99773455,0.00088905636,0.00011838652,0.00069975504,0.0004471663,0.000111040674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006446658,0.0016800482,0.0017489818,0.0018491907,0.00076664845,0.0027773373,0.0029353187,0.0013250925,0.040284045],"category_scores_gemma":[0.0048290114,0.0012898258,0.0019805122,0.0037484036,0.0006354189,0.0039161923,0.002870267,0.0025553557,0.008834982],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004006178,0.00015725133,0.00077079656,0.0006667549,0.00012832986,0.00016040559,0.00038396165,0.14646481,0.008907812,0.12457264,0.042617377,0.6747693],"study_design_scores_gemma":[0.00020230669,0.00007131706,0.0004030911,0.00006702039,0.000056749544,0.00016803962,0.00018067658,0.82574993,0.005857903,0.13883556,0.02835793,0.00004947574],"about_ca_topic_score_codex":0.007067837,"about_ca_topic_score_gemma":0.013810113,"teacher_disagreement_score":0.040284045,"about_ca_system_score_codex":0.0013018951,"about_ca_system_score_gemma":0.0010658827,"threshold_uncertainty_score":0.13476354},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4044923,0.0005796078,0.56803197,0.00042708238,0.000120298224,0.0001110446,0.0012872821,0.0008174718,0.024132961],"genre_scores_gemma":[0.9133603,0.0004780492,0.07916943,0.000101857215,0.0001416973,0.000128091,0.0012327357,0.0002667101,0.005121107],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992126,0.00013643698,0.00002442355,0.00020490584,0.00029860518,0.00012300548],"domain_scores_gemma":[0.99523747,0.0016685083,0.00094209873,0.0006260941,0.0008732197,0.0006526206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008518074,0.000555229,0.0007034285,0.0044829464,0.00063087925,0.0014093522,0.0009889784,0.00072633004,0.0066564814],"category_scores_gemma":[0.0056680106,0.0002383371,0.00066489866,0.0018141615,0.0026276507,0.0038594785,0.0013921128,0.001342741,0.0008384746],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016594719,0.00007013445,0.005100132,0.000145993,0.000031699074,0.00025136,0.00027612128,0.06691128,0.007893237,0.88255364,0.004144028,0.0324564],"study_design_scores_gemma":[0.000021029267,0.000120856734,0.0051885485,0.000036352198,0.000020596344,0.00035580914,0.00022144342,0.2561794,0.004745276,0.72293544,0.010111165,0.00006410168],"about_ca_topic_score_codex":0.0014378643,"about_ca_topic_score_gemma":0.0009569725,"teacher_disagreement_score":0.0066564814,"about_ca_system_score_codex":0.0008767244,"about_ca_system_score_gemma":0.00054839376,"threshold_uncertainty_score":0.022268116},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23947807,0.00026687502,0.74302477,0.00050045614,0.00007800478,0.00012500769,0.00031769372,0.006123827,0.010085298],"genre_scores_gemma":[0.6486717,0.0000931525,0.3470093,0.00010210722,0.000023576597,0.00016378314,0.0006392467,0.00043222218,0.0028648928],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994727,0.0001119102,0.00002821078,0.000067703186,0.00022127453,0.000098276636],"domain_scores_gemma":[0.99883336,0.00046847193,0.00009694271,0.0003092472,0.00018787476,0.00010411549],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051104254,0.0004812385,0.00059461506,0.0005976443,0.0008839988,0.0010631942,0.0016099388,0.0007945078,0.0027052849],"category_scores_gemma":[0.0027057906,0.00033743776,0.0005058701,0.0010819528,0.00068041356,0.0015059937,0.001821829,0.0008022999,0.0006479841],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005664255,0.0002941511,0.0073027597,0.00024486776,0.000088860885,0.00038243952,0.0010444317,0.6943838,0.0448744,0.07209848,0.010807762,0.16791168],"study_design_scores_gemma":[0.000024575362,0.000038113158,0.00024243636,0.0000051555667,0.0000044108874,0.000036148842,0.00007933078,0.98398453,0.0046992716,0.009186856,0.0016911362,0.000008108307],"about_ca_topic_score_codex":0.006122427,"about_ca_topic_score_gemma":0.0105004655,"teacher_disagreement_score":0.006122427,"about_ca_system_score_codex":0.0009010698,"about_ca_system_score_gemma":0.0013648045,"threshold_uncertainty_score":0.012173593},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9407235,0.00078838615,0.053077713,0.00023026357,0.00003696679,0.00002082345,0.000091209164,0.00012591822,0.004905244],"genre_scores_gemma":[0.99579215,0.00032492093,0.0029226686,0.000031388718,0.0000156667,0.000026587126,0.00006831457,0.000028706881,0.0007896712],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993352,0.00018561953,0.000023888211,0.00014677021,0.00015308712,0.00015537102],"domain_scores_gemma":[0.9975236,0.0013065059,0.00043079103,0.0003170697,0.0001364098,0.000285621],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009248256,0.00033850264,0.0009922292,0.001023042,0.00095976517,0.0016483568,0.0016245787,0.0010366411,0.0027299153],"category_scores_gemma":[0.0044996077,0.000679374,0.0008453043,0.0006989221,0.0025386745,0.003594299,0.0016034349,0.0009850393,0.00019470172],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022076852,0.00010098577,0.003856118,0.00025391285,0.00008980636,0.0005189206,0.00034612033,0.74135894,0.012131002,0.23484428,0.0005123837,0.005766885],"study_design_scores_gemma":[0.00004992319,0.0001632354,0.002447863,0.00003655452,0.000034798468,0.0002135437,0.00015073817,0.8588181,0.003907517,0.13310948,0.0009952886,0.000073032075],"about_ca_topic_score_codex":0.0026497836,"about_ca_topic_score_gemma":0.001186001,"teacher_disagreement_score":0.0027299153,"about_ca_system_score_codex":0.0009805701,"about_ca_system_score_gemma":0.0005830525,"threshold_uncertainty_score":0.009132504},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32491878,0.001247183,0.5306828,0.0009387469,0.0008879016,0.00023323354,0.00042463402,0.00085036946,0.13981634],"genre_scores_gemma":[0.79897374,0.00093183666,0.10857425,0.00028970605,0.00020270837,0.00016674606,0.0006003582,0.0010043418,0.08925635],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995066,0.00008572025,0.000024500054,0.000084296684,0.00022986092,0.00006899235],"domain_scores_gemma":[0.9992473,0.00023703175,0.00009388535,0.00017197277,0.00013668004,0.00011315871],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041171696,0.00090005086,0.001037552,0.0016954165,0.0011259173,0.0022319125,0.0014054719,0.001427262,0.009897993],"category_scores_gemma":[0.0034698576,0.00060712965,0.00052145135,0.0013041693,0.0013459155,0.0016314619,0.0040767943,0.0020546252,0.002845942],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015848377,0.000049443363,0.00039499218,0.00011941565,0.000022401873,0.00048402193,0.000520854,0.027964262,0.0062438133,0.901856,0.005218959,0.05696743],"study_design_scores_gemma":[0.00005573497,0.00015113263,0.0003761309,0.000061262355,0.000017147051,0.00090221537,0.0005940878,0.20165125,0.009245573,0.74561024,0.04130279,0.000032419513],"about_ca_topic_score_codex":0.0006500943,"about_ca_topic_score_gemma":0.0005890903,"teacher_disagreement_score":0.009897993,"about_ca_system_score_codex":0.0007377241,"about_ca_system_score_gemma":0.00042738975,"threshold_uncertainty_score":0.03311211},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16256627,0.002580489,0.806333,0.0032680067,0.00039398487,0.00014981185,0.0004760332,0.0009147912,0.023317585],"genre_scores_gemma":[0.8959791,0.0028146417,0.075265236,0.0014170546,0.0010677032,0.0007035833,0.0008382334,0.00096961146,0.020944828],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969938,0.0011598282,0.000113352326,0.00058546744,0.00067302556,0.00047452762],"domain_scores_gemma":[0.94044536,0.04511763,0.0033827175,0.0030929684,0.004157299,0.0038041184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010813453,0.0013902057,0.003997095,0.0075828447,0.0025319746,0.006704257,0.0073360936,0.0037665567,0.012256886],"category_scores_gemma":[0.050686896,0.0016850525,0.0025337648,0.0039063003,0.008921443,0.010470755,0.0059770965,0.006487218,0.0010865607],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006288802,0.000068905945,0.0005439116,0.00012020767,0.000048645335,0.0000867091,0.00017944076,0.017896922,0.00077160436,0.9750149,0.0018202225,0.003385602],"study_design_scores_gemma":[0.000043116317,0.000030065301,0.0003893632,0.000048052458,0.000031652,0.0001311301,0.00006360959,0.21702062,0.00035301285,0.78110373,0.00074597815,0.00003967942],"about_ca_topic_score_codex":0.003018631,"about_ca_topic_score_gemma":0.0018040532,"teacher_disagreement_score":0.012256886,"about_ca_system_score_codex":0.003955103,"about_ca_system_score_gemma":0.002217496,"threshold_uncertainty_score":0.057187736},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016843718,0.007595218,0.1343503,0.0017184052,0.0016659888,0.000096788186,0.0012072413,0.0011487477,0.8353737],"genre_scores_gemma":[0.20381853,0.0075903195,0.03920755,0.0008898232,0.0014273911,0.00026176075,0.0020283875,0.0010631877,0.74371314],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996158,0.000057127952,0.000021514545,0.00007493011,0.00017610918,0.00005440494],"domain_scores_gemma":[0.99963844,0.00011650943,0.000035470934,0.000054958637,0.00012102708,0.00003347053],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032216212,0.00083364686,0.00061495,0.0017562321,0.0008613228,0.0023231062,0.00073113333,0.0005362056,0.05625424],"category_scores_gemma":[0.0019071756,0.00042232446,0.0004756117,0.0023159864,0.0009150971,0.0019707116,0.0011240682,0.002069227,0.016684923],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020297864,0.000020969086,0.00008456395,0.000097693985,0.0000076108427,0.000043643475,0.0001645698,0.0012842654,0.0012146652,0.8488733,0.04258441,0.105604015],"study_design_scores_gemma":[0.000015261347,0.000042182473,0.0002683603,0.000082111,0.000016668282,0.00026564288,0.00009448701,0.0074465517,0.0023485532,0.79578656,0.19360563,0.00002799105],"about_ca_topic_score_codex":0.0011566437,"about_ca_topic_score_gemma":0.0015836586,"teacher_disagreement_score":0.05625424,"about_ca_system_score_codex":0.0011953077,"about_ca_system_score_gemma":0.00076594856,"threshold_uncertainty_score":0.18818915},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06619378,0.0005573259,0.9266523,0.00055203604,0.00007202624,0.00010913176,0.00094593724,0.0017085037,0.0032090216],"genre_scores_gemma":[0.42254552,0.00075003825,0.56892097,0.0002798579,0.00019576642,0.00016055623,0.0024182736,0.00042849427,0.004300559],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99516547,0.0006667885,0.0004210523,0.0009375216,0.0022569105,0.0005522791],"domain_scores_gemma":[0.9895663,0.00500163,0.0010618034,0.002774959,0.0012539005,0.0003414851],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025081567,0.0011066619,0.0018048949,0.0020854382,0.0009022252,0.004427653,0.0023608082,0.0012410654,0.0040678713],"category_scores_gemma":[0.014664012,0.00084897666,0.0018954661,0.0050640283,0.0018373147,0.009642463,0.0025728974,0.0024380463,0.000983791],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012414402,0.00017856613,0.0040501957,0.00061721756,0.00018340454,0.00034180618,0.00097500585,0.48581043,0.011833357,0.25590503,0.0048663574,0.23399726],"study_design_scores_gemma":[0.00008331273,0.00036949303,0.0011500644,0.00006188478,0.00009789237,0.00027687583,0.00025745912,0.6621154,0.012740838,0.31426558,0.008502754,0.00007846768],"about_ca_topic_score_codex":0.004948899,"about_ca_topic_score_gemma":0.0045629377,"teacher_disagreement_score":0.004948899,"about_ca_system_score_codex":0.002152408,"about_ca_system_score_gemma":0.0023817273,"threshold_uncertainty_score":0.015616894},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29452714,0.06644832,0.37426952,0.017147442,0.012096974,0.00019985426,0.0027356546,0.002541839,0.2300333],"genre_scores_gemma":[0.8088786,0.025314245,0.052547675,0.0018825999,0.0032269624,0.00019060208,0.001576087,0.0011271533,0.10525613],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99971324,0.000048254708,0.000019353816,0.000061966886,0.0000995788,0.000057561694],"domain_scores_gemma":[0.99922466,0.00019840933,0.00008320123,0.00017238694,0.00017232084,0.00014903146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040542998,0.00078048423,0.0010186727,0.0023903889,0.002351146,0.0017999585,0.0012928414,0.0011689144,0.01055726],"category_scores_gemma":[0.0022684282,0.0006637723,0.0012055666,0.0015291942,0.0020330488,0.0034857176,0.0021222217,0.0038870678,0.0037685724],"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.0005310307,0.0002003419,0.0011479149,0.00082089036,0.00013043697,0.0017257406,0.001411635,0.009054384,0.018177832,0.7934245,0.09079729,0.08257798],"study_design_scores_gemma":[0.00006211535,0.0002509789,0.0027219988,0.000116038354,0.0001271613,0.0022495233,0.00080938556,0.014599797,0.008078526,0.8882186,0.082600005,0.00016592807],"about_ca_topic_score_codex":0.0016059796,"about_ca_topic_score_gemma":0.0015004483,"teacher_disagreement_score":0.01055726,"about_ca_system_score_codex":0.00050983205,"about_ca_system_score_gemma":0.0004458555,"threshold_uncertainty_score":0.03531754},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09083804,0.008863501,0.6644012,0.02532299,0.0076052295,0.0058767796,0.030864567,0.013592199,0.15263557],"genre_scores_gemma":[0.26166046,0.002667542,0.5721694,0.004774061,0.0015433207,0.008348863,0.07341821,0.008630379,0.0667878],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98506457,0.004721001,0.00046001916,0.0019552652,0.0065461146,0.0012531383],"domain_scores_gemma":[0.9767621,0.007192047,0.00042174247,0.0048794476,0.007089409,0.003655245],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013388326,0.0020438663,0.002081026,0.0014232817,0.0015110493,0.0046589207,0.00550796,0.0038253574,0.021298248],"category_scores_gemma":[0.035651993,0.0007524843,0.0016072782,0.0013754232,0.0034966564,0.004182069,0.010457025,0.0046068383,0.013427806],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015755981,0.0013707401,0.0017350564,0.0022396946,0.00017277541,0.0002523226,0.0006110233,0.06574801,0.009716106,0.12788488,0.6209633,0.16773045],"study_design_scores_gemma":[0.0010726904,0.001668769,0.0033614927,0.000603489,0.00009796084,0.00060378725,0.0008739702,0.2967759,0.024989912,0.11662418,0.5531591,0.00016869536],"about_ca_topic_score_codex":0.004565115,"about_ca_topic_score_gemma":0.0046542683,"teacher_disagreement_score":0.021298248,"about_ca_system_score_codex":0.0035137483,"about_ca_system_score_gemma":0.005210035,"threshold_uncertainty_score":0.07124978},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17430496,0.002462571,0.7553225,0.0009685841,0.00043516274,0.00012794799,0.00025872714,0.00025874272,0.06586079],"genre_scores_gemma":[0.738568,0.0024445346,0.22176717,0.00044356188,0.00033917336,0.00036209196,0.0008182037,0.00037103277,0.03488619],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994349,0.00012936951,0.000043158903,0.00015107862,0.00016549391,0.0000760797],"domain_scores_gemma":[0.99935514,0.0002604549,0.00009238301,0.00011950406,0.00007272389,0.00009992386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006082672,0.00050189183,0.00037104587,0.0006310402,0.00082771503,0.0013420621,0.0006602895,0.0005663543,0.00431729],"category_scores_gemma":[0.002050999,0.00055021973,0.0010409406,0.0005396355,0.0027232338,0.0023381629,0.002181697,0.002021679,0.000591725],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004043512,0.000020881516,0.00055752037,0.00014541068,0.000010197717,0.00024153953,0.00050423323,0.017254274,0.009250533,0.946146,0.0025441067,0.023284772],"study_design_scores_gemma":[0.000039353177,0.00014380662,0.0016046409,0.00015771762,0.000024745032,0.0007707775,0.0006173508,0.08610256,0.012330266,0.82916605,0.068998046,0.00004476087],"about_ca_topic_score_codex":0.0007554362,"about_ca_topic_score_gemma":0.00078170677,"teacher_disagreement_score":0.00431729,"about_ca_system_score_codex":0.00091283413,"about_ca_system_score_gemma":0.00035102258,"threshold_uncertainty_score":0.014442742},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15422668,0.0017166886,0.82159066,0.0010946029,0.00017669481,0.00035038398,0.0013172756,0.0012130017,0.01831406],"genre_scores_gemma":[0.5884515,0.0015344247,0.39366826,0.00027506627,0.00015543659,0.00029038216,0.0025587785,0.0004892966,0.012576846],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988985,0.00021909563,0.00004680251,0.00031071657,0.00027687172,0.00024795835],"domain_scores_gemma":[0.9965364,0.0022706348,0.00028578876,0.0005375553,0.0001784718,0.00019122577],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007735706,0.0012528701,0.0012169263,0.0012071105,0.0012074215,0.0014151348,0.0015404174,0.0018269105,0.008651577],"category_scores_gemma":[0.0060467566,0.00073269533,0.0014679402,0.0024860518,0.0011032057,0.0047777863,0.0023089282,0.0017021933,0.0011521917],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000775746,0.00023036382,0.001751342,0.0006661112,0.00011820797,0.0005729866,0.00036339092,0.7192812,0.010171795,0.10376293,0.013031444,0.14927453],"study_design_scores_gemma":[0.0000906425,0.00029555376,0.00045613194,0.00007672946,0.000051652743,0.00051046856,0.00012024567,0.8405317,0.005991532,0.14099583,0.010852171,0.0000272516],"about_ca_topic_score_codex":0.0029257608,"about_ca_topic_score_gemma":0.0025584884,"teacher_disagreement_score":0.008651577,"about_ca_system_score_codex":0.0011902988,"about_ca_system_score_gemma":0.0009974061,"threshold_uncertainty_score":0.028942406},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09357327,0.00080215465,0.89190125,0.00062697957,0.00008065704,0.00006844047,0.00017575517,0.00015819211,0.012613251],"genre_scores_gemma":[0.65952617,0.0012502316,0.32538646,0.00020825978,0.00030047665,0.00021832515,0.0007801356,0.00023154334,0.012098308],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99869746,0.00047748073,0.00006297444,0.00023985757,0.00037709172,0.00014519462],"domain_scores_gemma":[0.9969459,0.0018537433,0.0003419605,0.0003039992,0.00029467593,0.00025977448],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017774962,0.00080623035,0.0011346823,0.00196016,0.0012633223,0.0021812785,0.001588725,0.0015977868,0.0046608667],"category_scores_gemma":[0.006855932,0.000488079,0.0010245377,0.0016120416,0.0040268074,0.005884694,0.004556752,0.0024979347,0.00053607806],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004042239,0.00002661376,0.0004813191,0.0000729102,0.000010688295,0.00006648775,0.00018457744,0.026408982,0.00071452715,0.9566982,0.0015240106,0.013771276],"study_design_scores_gemma":[0.00001516015,0.00003335279,0.00035797255,0.000023064014,0.0000073465903,0.00009333482,0.00017039383,0.13261709,0.0011158901,0.8611777,0.004369916,0.000018811792],"about_ca_topic_score_codex":0.0014518739,"about_ca_topic_score_gemma":0.0012062478,"teacher_disagreement_score":0.0046608667,"about_ca_system_score_codex":0.0015133611,"about_ca_system_score_gemma":0.0007437486,"threshold_uncertainty_score":0.015592158},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00951099,0.00011483849,0.9892725,0.0000629697,0.000012999665,0.000023409531,0.000039588194,0.00023265475,0.0007300773],"genre_scores_gemma":[0.10910501,0.0002019638,0.88873285,0.000031089992,0.0000223579,0.0000791343,0.00026421453,0.00018050097,0.001382933],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992624,0.00018469416,0.000061055835,0.00013206158,0.00030048608,0.000059179994],"domain_scores_gemma":[0.99830544,0.0009196885,0.0001497225,0.00027777973,0.0002750456,0.00007236739],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009227857,0.00073621416,0.0010858751,0.0011246374,0.00050675427,0.0013514438,0.0021692717,0.00093060825,0.0026334366],"category_scores_gemma":[0.006260729,0.0005880267,0.00065056595,0.0010498326,0.0009926482,0.0021674116,0.00279965,0.0015819834,0.000752835],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027540216,0.00009279245,0.0014628061,0.000337008,0.000050455765,0.00015810205,0.0005571241,0.4321337,0.01313121,0.23850702,0.0048657055,0.3084287],"study_design_scores_gemma":[0.00005458544,0.00004936766,0.00019567605,0.00002721333,0.000009574412,0.000096308926,0.000103153274,0.8951957,0.0051742396,0.094111025,0.0049650082,0.000018106113],"about_ca_topic_score_codex":0.0017753629,"about_ca_topic_score_gemma":0.002186474,"teacher_disagreement_score":0.0026334366,"about_ca_system_score_codex":0.0006089964,"about_ca_system_score_gemma":0.0005172355,"threshold_uncertainty_score":0.008809686},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9285233,0.00033065907,0.022072634,0.00013792008,0.000072438525,0.00004761584,0.00035006757,0.0002795604,0.048185896],"genre_scores_gemma":[0.9913509,0.000097645694,0.0039562914,0.00003529249,0.000027591841,0.000024501918,0.00027650018,0.00004793525,0.00418339],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995315,0.00007894383,0.000023462568,0.00014230829,0.00012788175,0.000095945295],"domain_scores_gemma":[0.99917185,0.00016115104,0.00021239142,0.0001387506,0.00012834759,0.00018746211],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015710155,0.00043142829,0.0003902912,0.0015296581,0.0012459138,0.0012837658,0.00065035396,0.0007846585,0.007450657],"category_scores_gemma":[0.0012834816,0.00036765385,0.00046295475,0.00083281315,0.0022458846,0.0015044886,0.0012631887,0.0006459309,0.0006428512],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018518064,0.00003324155,0.0063151293,0.00012289765,0.000032929653,0.0011564523,0.00082856975,0.009438031,0.012190661,0.9457364,0.0027304979,0.021229949],"study_design_scores_gemma":[0.000045435056,0.00011893188,0.0114036305,0.000055129625,0.000040282568,0.0032109222,0.00093640183,0.02041272,0.008318434,0.9435982,0.011786369,0.00007358834],"about_ca_topic_score_codex":0.0009421437,"about_ca_topic_score_gemma":0.0009105631,"teacher_disagreement_score":0.007450657,"about_ca_system_score_codex":0.00053713965,"about_ca_system_score_gemma":0.00020791125,"threshold_uncertainty_score":0.024924994},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032210096,0.000032401636,0.9926871,0.000042906777,0.00001780652,0.000057498793,0.00006622048,0.0025384286,0.0013365465],"genre_scores_gemma":[0.042692527,0.000037998132,0.9533392,0.000049766782,0.000009519948,0.0002737387,0.00030944942,0.0005769734,0.0027108134],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99962485,0.000078457844,0.000028378932,0.00007598762,0.00014630845,0.000045992092],"domain_scores_gemma":[0.99931216,0.00036907697,0.00004870699,0.00009592013,0.0001377845,0.00003626219],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075976073,0.00069504493,0.0009052352,0.0006891523,0.0005871388,0.0013457584,0.0021457747,0.0011313602,0.011366059],"category_scores_gemma":[0.0023723138,0.00048168714,0.0010362092,0.00059973187,0.00073369936,0.0010543595,0.001693933,0.0012480784,0.002327068],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045109546,0.00014386178,0.001600731,0.0004686349,0.00008554195,0.00037485216,0.00058596686,0.32658267,0.014039366,0.15749905,0.016943611,0.48122454],"study_design_scores_gemma":[0.00005536198,0.000040364754,0.0000722245,0.000015848,0.000006330407,0.000084226114,0.00003293181,0.9708283,0.003662929,0.01514794,0.010042547,0.000010992171],"about_ca_topic_score_codex":0.002616566,"about_ca_topic_score_gemma":0.0032601927,"teacher_disagreement_score":0.011366059,"about_ca_system_score_codex":0.00086702546,"about_ca_system_score_gemma":0.0012628266,"threshold_uncertainty_score":0.038023293},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15023905,0.0012213384,0.84298563,0.00036287418,0.00007151528,0.00018774933,0.0007864153,0.001067834,0.0030775797],"genre_scores_gemma":[0.3570411,0.00055194384,0.6357751,0.00006498552,0.000046860692,0.00022312108,0.0017701129,0.00022397854,0.0043028127],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983895,0.00038135436,0.000106167055,0.00047923965,0.00043952576,0.00020422983],"domain_scores_gemma":[0.99748933,0.0014168064,0.000305506,0.0003208675,0.00029001015,0.0001774422],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008963545,0.0012933803,0.0014419265,0.001999003,0.00082973856,0.0017864048,0.0025571585,0.0015593509,0.0052616014],"category_scores_gemma":[0.0071847313,0.0008704968,0.00093425694,0.0025117097,0.000718308,0.003956441,0.0022449424,0.0011234633,0.0011712293],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001034968,0.00019414534,0.0021276027,0.00053531374,0.0001850415,0.0003968437,0.00037687796,0.7724014,0.0062136347,0.028191442,0.004988322,0.18335444],"study_design_scores_gemma":[0.0000505933,0.00011472918,0.0002812655,0.000026545687,0.0000200148,0.000118460055,0.00014975712,0.9669297,0.0024571056,0.02715946,0.0026773263,0.000015046194],"about_ca_topic_score_codex":0.00517731,"about_ca_topic_score_gemma":0.005046647,"teacher_disagreement_score":0.0052616014,"about_ca_system_score_codex":0.0009892441,"about_ca_system_score_gemma":0.00095087045,"threshold_uncertainty_score":0.017601788},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4693432,0.0015811855,0.4899731,0.00082816003,0.00014503761,0.000065295506,0.0004841273,0.0011706197,0.036409333],"genre_scores_gemma":[0.9051455,0.00067372253,0.08807,0.00015052194,0.00006582348,0.00008776099,0.0004114862,0.00016662847,0.0052285427],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99862945,0.000211434,0.000094531184,0.00023532548,0.00049898925,0.0003302239],"domain_scores_gemma":[0.9958515,0.0021822422,0.00037392732,0.0008486633,0.0003696499,0.0003738977],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014345435,0.00091137976,0.0010332095,0.0012954201,0.0008656444,0.001732064,0.0015881555,0.00077177625,0.004399605],"category_scores_gemma":[0.0059219,0.0005249027,0.0010797776,0.0010460907,0.0018851327,0.0029084522,0.003831271,0.0022697905,0.0009341184],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011663539,0.00018746768,0.012396872,0.0006467764,0.00012832435,0.0006232868,0.00096022955,0.20946981,0.07201246,0.5850293,0.0071682557,0.110210836],"study_design_scores_gemma":[0.00008413866,0.0002958406,0.00572291,0.000089200286,0.000106624466,0.0005718712,0.00030292833,0.64368415,0.040674027,0.29684895,0.011497639,0.00012183785],"about_ca_topic_score_codex":0.002253339,"about_ca_topic_score_gemma":0.0026783096,"teacher_disagreement_score":0.004399605,"about_ca_system_score_codex":0.0013493116,"about_ca_system_score_gemma":0.0007455105,"threshold_uncertainty_score":0.014718115},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2941556,0.005214369,0.51747924,0.059926607,0.0010046918,0.0003232601,0.0022494022,0.0060248785,0.113621876],"genre_scores_gemma":[0.81099236,0.002623237,0.16071865,0.0044226088,0.0006942472,0.00028853555,0.0017289001,0.0017346079,0.01679694],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9923173,0.0019744984,0.00031676507,0.0019002061,0.0026369863,0.00085417175],"domain_scores_gemma":[0.9523707,0.028545449,0.0024137706,0.012386665,0.0033195333,0.0009638068],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036616272,0.0011662312,0.0013476695,0.0006850737,0.0016868254,0.0043550692,0.003512785,0.002664813,0.020241458],"category_scores_gemma":[0.037373845,0.0011334539,0.0017292266,0.0013112499,0.004149318,0.017866325,0.0051005394,0.0063790837,0.003942769],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00069865654,0.00025311252,0.0045444462,0.0008931331,0.00011201693,0.0005884512,0.0011490794,0.048595607,0.01754608,0.55244815,0.043301895,0.3298695],"study_design_scores_gemma":[0.0001156428,0.00027228965,0.0011456916,0.00017425092,0.00008704611,0.00088960864,0.0007744877,0.06446556,0.009662483,0.8664146,0.055928532,0.00006987497],"about_ca_topic_score_codex":0.00222337,"about_ca_topic_score_gemma":0.0022366438,"teacher_disagreement_score":0.020241458,"about_ca_system_score_codex":0.0018758399,"about_ca_system_score_gemma":0.0014193889,"threshold_uncertainty_score":0},"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":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5097666,0.00032890154,0.46824145,0.0017859878,0.00007368496,0.0005086112,0.0041439733,0.003962406,0.01118838],"genre_scores_gemma":[0.72054166,0.0001357148,0.26780623,0.00025283848,0.000059474136,0.0003264259,0.0048704925,0.00054526,0.0054619103],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99742836,0.0003875383,0.00018375173,0.0007406046,0.00090102176,0.00035877273],"domain_scores_gemma":[0.99034214,0.004379621,0.001188258,0.002188966,0.0011240274,0.00077698514],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011467547,0.00077332964,0.0012684864,0.0013940565,0.0019661991,0.0026240554,0.0025447686,0.0013612943,0.00702421],"category_scores_gemma":[0.0076249363,0.00082623324,0.0010909417,0.0025353031,0.001564966,0.006001157,0.0040185847,0.0025253752,0.0013443186],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004502618,0.0018094516,0.02362699,0.001348562,0.00039279406,0.0010972753,0.0028817472,0.19033284,0.1024145,0.36891574,0.038156636,0.26452097],"study_design_scores_gemma":[0.0002867676,0.00032169692,0.0039687767,0.00008061513,0.00010732597,0.0008776645,0.00082425284,0.71113926,0.06126779,0.20028229,0.020713989,0.00012961066],"about_ca_topic_score_codex":0.0028245812,"about_ca_topic_score_gemma":0.0040085623,"teacher_disagreement_score":0.00702421,"about_ca_system_score_codex":0.0024757443,"about_ca_system_score_gemma":0.0020942818,"threshold_uncertainty_score":0.023498297},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03022873,0.0009866887,0.9511831,0.0021589268,0.00022724399,0.00010828943,0.00017809763,0.00015714002,0.014771848],"genre_scores_gemma":[0.60505927,0.003601054,0.3619196,0.0021324484,0.0012301998,0.0007041829,0.0009924758,0.0009801958,0.023380537],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9946114,0.0031508442,0.00022491936,0.0006875529,0.000883123,0.0004421955],"domain_scores_gemma":[0.9499609,0.039426193,0.0029882921,0.0032394757,0.0021894067,0.0021956963],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.018755358,0.0028557668,0.0026360545,0.0036562835,0.0026331337,0.005173365,0.005254214,0.0036185875,0.0102613885],"category_scores_gemma":[0.06060564,0.0018384053,0.0031982025,0.00410664,0.009775121,0.016854892,0.011536782,0.013574326,0.000955012],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008350727,0.00009214218,0.00044077757,0.00011960747,0.000026184298,0.000039051192,0.00032656823,0.03583026,0.00036271193,0.9533713,0.0015599331,0.0077478853],"study_design_scores_gemma":[0.00001797229,0.000050272036,0.0001813514,0.00007693686,0.00001800104,0.000023219842,0.00011059801,0.21301459,0.00023751211,0.7845395,0.0017057605,0.000024173569],"about_ca_topic_score_codex":0.0024739453,"about_ca_topic_score_gemma":0.0027175196,"teacher_disagreement_score":0.018755358,"about_ca_system_score_codex":0.0033524942,"about_ca_system_score_gemma":0.0029242742,"threshold_uncertainty_score":0.09918904},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50545406,0.00095342606,0.41470048,0.00067339896,0.00023590175,0.00010862253,0.00034913293,0.0006368169,0.07688819],"genre_scores_gemma":[0.94539106,0.00042631556,0.03829238,0.00015945797,0.00018343823,0.00005847381,0.00023953349,0.00013966576,0.015109566],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99890125,0.00010205999,0.000075906915,0.00031483403,0.00041153282,0.0001944075],"domain_scores_gemma":[0.9981584,0.0004278456,0.00023051394,0.00037202335,0.0005896513,0.00022167886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010676454,0.00050923345,0.00042138685,0.0027597684,0.0013136569,0.0024279752,0.0009753095,0.0008585823,0.007993014],"category_scores_gemma":[0.0025003834,0.0003668199,0.00060781057,0.0010910705,0.0035145697,0.005363024,0.0031386556,0.0017033062,0.00079159526],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020476844,0.000014935659,0.0006813398,0.000040914085,0.0000066963385,0.00017089534,0.00051007885,0.0006155604,0.0041143945,0.9834589,0.0003198542,0.010046008],"study_design_scores_gemma":[0.000016176566,0.00016656905,0.0031289367,0.00005477244,0.00004093575,0.0015079598,0.0011738265,0.01081323,0.017485412,0.9321712,0.03338808,0.000052900985],"about_ca_topic_score_codex":0.0005262428,"about_ca_topic_score_gemma":0.00037075186,"teacher_disagreement_score":0.007993014,"about_ca_system_score_codex":0.0007096383,"about_ca_system_score_gemma":0.00035444548,"threshold_uncertainty_score":0.0267393},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.123261414,0.00067545683,0.8321684,0.0005386989,0.0002626821,0.0004232415,0.0012859266,0.0029349297,0.038449213],"genre_scores_gemma":[0.5400229,0.00044962027,0.4436092,0.0001102645,0.00009768278,0.00020674033,0.0022082438,0.0007345083,0.012560821],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992861,0.0000751099,0.00003895469,0.00016389685,0.00035647955,0.000079399986],"domain_scores_gemma":[0.9988973,0.00026289385,0.00016995524,0.00018465187,0.0003532715,0.00013188938],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003218008,0.00083590864,0.0009770651,0.0019951113,0.0010499075,0.0015844406,0.0011703371,0.00087811437,0.009220502],"category_scores_gemma":[0.003729684,0.0005982652,0.0008220757,0.0014058602,0.0013564825,0.0017040338,0.0023203613,0.0009301862,0.0030508356],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014007281,0.00019564787,0.0066025713,0.0009515929,0.00012094375,0.0019204009,0.0008027726,0.17241095,0.052027594,0.27847397,0.037430022,0.44766274],"study_design_scores_gemma":[0.00018180917,0.00044736464,0.0018896736,0.0001532766,0.00006908698,0.0014374768,0.00044007998,0.64970154,0.03773361,0.24774204,0.06008865,0.000115397095],"about_ca_topic_score_codex":0.0017614043,"about_ca_topic_score_gemma":0.0012102368,"teacher_disagreement_score":0.009220502,"about_ca_system_score_codex":0.0006246846,"about_ca_system_score_gemma":0.00083720003,"threshold_uncertainty_score":0.030845702},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5252672,0.0009056248,0.39260796,0.0011556884,0.0001542617,0.00008583999,0.00050537736,0.0004844664,0.07883363],"genre_scores_gemma":[0.9377997,0.0005011177,0.048083246,0.00014183338,0.0001061069,0.00006690553,0.00048809036,0.00018745234,0.012625606],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995078,0.000133387,0.000026692795,0.000092966075,0.00015490201,0.000084320425],"domain_scores_gemma":[0.99741226,0.0011882356,0.0004653082,0.00027097735,0.0004196387,0.00024367748],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056333,0.00036720323,0.0006872811,0.0023522882,0.0016009063,0.002423692,0.0013607971,0.0012998836,0.010977481],"category_scores_gemma":[0.0056189816,0.00053280866,0.00030079237,0.0016962603,0.0025185584,0.0030460476,0.0018421033,0.0019195061,0.0013845942],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006312411,0.000033654032,0.0007763751,0.000047279445,0.000006123572,0.00012485316,0.00025474463,0.012834085,0.0011425142,0.96698576,0.001645196,0.016086346],"study_design_scores_gemma":[0.000016799668,0.0000381632,0.00043128576,0.000032083848,0.0000062059794,0.00018840295,0.00021536925,0.057294786,0.0007111216,0.9377309,0.0033192742,0.000015681637],"about_ca_topic_score_codex":0.00042468577,"about_ca_topic_score_gemma":0.00057367486,"teacher_disagreement_score":0.010977481,"about_ca_system_score_codex":0.0006097267,"about_ca_system_score_gemma":0.00031570857,"threshold_uncertainty_score":0.036723316},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5033825,0.0006007252,0.40954405,0.0010895549,0.00023588727,0.000179598,0.0051314384,0.0017787792,0.0780575],"genre_scores_gemma":[0.86162823,0.00021727613,0.11358137,0.00012037686,0.00012521738,0.00021994323,0.005230132,0.00036288318,0.018514527],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99959475,0.000055977067,0.00001476721,0.00014003406,0.0001213492,0.00007320007],"domain_scores_gemma":[0.99800736,0.0008903063,0.00023393672,0.00032442957,0.00029777552,0.00024624166],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005636329,0.00065624557,0.0005612685,0.003046989,0.0009777574,0.0018048811,0.0017757136,0.00082669547,0.013839822],"category_scores_gemma":[0.005389394,0.00044223663,0.0008643294,0.0014027976,0.0013104647,0.0019287576,0.0014006164,0.0014539687,0.0019438696],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00080849614,0.00017609475,0.013262902,0.00056406186,0.00018032778,0.00044779244,0.0005306552,0.17138188,0.0077842386,0.66347384,0.026179442,0.1152103],"study_design_scores_gemma":[0.00009393035,0.0001031448,0.006460577,0.000084548,0.000076710676,0.0002522349,0.00018366746,0.4556127,0.006730721,0.5157263,0.014617867,0.000057660684],"about_ca_topic_score_codex":0.002221974,"about_ca_topic_score_gemma":0.004834246,"teacher_disagreement_score":0.013839822,"about_ca_system_score_codex":0.0024062446,"about_ca_system_score_gemma":0.0009870845,"threshold_uncertainty_score":0.046298802},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5239336,0.0038318746,0.43861088,0.0016130817,0.00012482052,0.00012753755,0.0005197541,0.0009108898,0.030327631],"genre_scores_gemma":[0.9424508,0.0029792741,0.050803997,0.00035040808,0.00009608152,0.00012564013,0.00040775436,0.00023375783,0.0025522106],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986357,0.00041724055,0.00005783888,0.0002496652,0.00035456184,0.00028501975],"domain_scores_gemma":[0.9818611,0.0138035165,0.001599226,0.0012035307,0.0006520528,0.0008805534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013713262,0.0013922866,0.0011014227,0.0021322516,0.0011161227,0.0014177117,0.0019241021,0.00083627756,0.0040286304],"category_scores_gemma":[0.019984901,0.00065682904,0.0006588811,0.0026199864,0.0022605988,0.0041610305,0.0027338383,0.001695504,0.000499264],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006690925,0.00018120764,0.0056501273,0.0006290397,0.00009763709,0.0005645059,0.00038435962,0.62062097,0.012352273,0.28689653,0.0046743364,0.067280024],"study_design_scores_gemma":[0.000046758007,0.00019242622,0.0017209465,0.000121175595,0.00006393311,0.000588882,0.00021800712,0.75898284,0.00759062,0.22684102,0.003582202,0.00005122395],"about_ca_topic_score_codex":0.0022454178,"about_ca_topic_score_gemma":0.002646416,"teacher_disagreement_score":0.0040286304,"about_ca_system_score_codex":0.0016863524,"about_ca_system_score_gemma":0.0007661219,"threshold_uncertainty_score":0.013477087},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.629856,0.00045730243,0.31144148,0.0007282994,0.00013719806,0.00027484528,0.0013024241,0.0006324438,0.055169936],"genre_scores_gemma":[0.9132122,0.00031284476,0.06689995,0.0002636287,0.00010647683,0.00026990054,0.0023773354,0.00021013702,0.016347598],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99919504,0.0001308053,0.000057984358,0.0002347621,0.00017638326,0.00020501658],"domain_scores_gemma":[0.9976598,0.00091077003,0.00041474905,0.0004290105,0.00025146926,0.00033424408],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042506447,0.0004476317,0.00056791754,0.001041075,0.002067796,0.0023302187,0.0013484637,0.00074468117,0.01172055],"category_scores_gemma":[0.0026826768,0.00041058153,0.0009315867,0.0016286349,0.0012259429,0.001679088,0.0012291581,0.0013406824,0.00089124613],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039820877,0.00018699157,0.003634957,0.00022562074,0.00006731305,0.00059106405,0.0009335145,0.030945355,0.016891263,0.8754063,0.006024746,0.06469461],"study_design_scores_gemma":[0.00020590823,0.0003304379,0.004442635,0.00006242486,0.00010324284,0.0007803215,0.00028744555,0.09765117,0.009944465,0.8433029,0.042811174,0.00007792041],"about_ca_topic_score_codex":0.0021189405,"about_ca_topic_score_gemma":0.0022647283,"teacher_disagreement_score":0.01172055,"about_ca_system_score_codex":0.0011537425,"about_ca_system_score_gemma":0.00054139335,"threshold_uncertainty_score":0.039209127},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47583678,0.0018192803,0.48936284,0.002101898,0.00019656988,0.00031433982,0.0019648487,0.002905504,0.025497971],"genre_scores_gemma":[0.7713129,0.0011647742,0.21620159,0.0002738487,0.00017991064,0.00017938825,0.0033664827,0.0005864898,0.006734533],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99915123,0.00021856163,0.000041718988,0.00022842479,0.00022011415,0.00014001224],"domain_scores_gemma":[0.9919527,0.0062371804,0.00046433255,0.0006467529,0.00042955272,0.0002693212],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008182259,0.0012752753,0.001366794,0.0031107808,0.001358581,0.0026239692,0.002712923,0.0015512028,0.009500842],"category_scores_gemma":[0.01462616,0.000754921,0.0009933349,0.0037863748,0.0020534983,0.005506602,0.0031113916,0.0017095486,0.0010909655],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00086128793,0.00031960022,0.011457317,0.00093301485,0.00016201897,0.00034190028,0.0011520375,0.5468916,0.007377754,0.14781405,0.015426505,0.26726285],"study_design_scores_gemma":[0.00007723301,0.0001224461,0.002179017,0.000091907605,0.00005841016,0.000109781846,0.0003199937,0.73945904,0.0028633776,0.25152808,0.0031620201,0.000028669103],"about_ca_topic_score_codex":0.0065431446,"about_ca_topic_score_gemma":0.01316529,"teacher_disagreement_score":0.009500842,"about_ca_system_score_codex":0.0012391815,"about_ca_system_score_gemma":0.00091837946,"threshold_uncertainty_score":0.03178346},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51573116,0.0049258266,0.20368582,0.010617639,0.0008732527,0.00015562963,0.0017856603,0.0005639514,0.26166105],"genre_scores_gemma":[0.9412613,0.0035670106,0.032200746,0.0011697478,0.0012094686,0.00023401315,0.0013248533,0.0003171955,0.018715674],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99874276,0.00039252063,0.000054576365,0.00024996593,0.0003578219,0.00020242318],"domain_scores_gemma":[0.9759532,0.019578924,0.0013454421,0.0008586123,0.00078827894,0.0014756449],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019082405,0.0012263895,0.0013090115,0.0046342467,0.002150115,0.0031730642,0.0025808525,0.0020919035,0.011363418],"category_scores_gemma":[0.015681893,0.0013384797,0.0009823092,0.0041803555,0.0044090035,0.006479021,0.0033100385,0.0054402426,0.0012634944],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000373908,0.0001344492,0.0032515496,0.0003308171,0.00004242814,0.00015352943,0.0003820764,0.02306105,0.002511551,0.9223155,0.012410677,0.035032526],"study_design_scores_gemma":[0.000052757867,0.00003865742,0.002255799,0.00007313425,0.000035205103,0.00017745009,0.00009024245,0.05406123,0.0011974963,0.9374698,0.004508542,0.000039681257],"about_ca_topic_score_codex":0.0017357382,"about_ca_topic_score_gemma":0.0019156055,"teacher_disagreement_score":0.011363418,"about_ca_system_score_codex":0.0022847631,"about_ca_system_score_gemma":0.0008598861,"threshold_uncertainty_score":0.038014412},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07903447,0.00013774361,0.9172511,0.0001442814,0.00007983553,0.000107931075,0.00022236512,0.002087535,0.0009346088],"genre_scores_gemma":[0.67946845,0.00007014877,0.31740496,0.00010648817,0.00003680273,0.0001770726,0.0012979734,0.00018726864,0.0012508734],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9994741,0.00011352589,0.00003092944,0.00014617371,0.00019075905,0.000044424283],"domain_scores_gemma":[0.99803907,0.0008853175,0.00013458698,0.00041011555,0.00047442483,0.000056518358],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013164883,0.0008448444,0.00071897643,0.0010415254,0.00027263584,0.0005333122,0.00125532,0.0010393254,0.002108918],"category_scores_gemma":[0.0043990603,0.00038766253,0.0005421002,0.0008821775,0.0005512381,0.0008641775,0.00090520026,0.00092101976,0.00070881576],"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.00039799802,0.00018472919,0.004859376,0.00013746995,0.000057395973,0.0001198258,0.000054436023,0.6665764,0.0221121,0.002545303,0.0032078722,0.29974717],"study_design_scores_gemma":[0.000008701932,0.000029987366,0.0003031197,0.0000026802234,0.0000028895568,0.000011274816,0.0000065246713,0.9947596,0.003885828,0.0007245972,0.00026220994,0.0000026941236],"about_ca_topic_score_codex":0.001418951,"about_ca_topic_score_gemma":0.0018505659,"teacher_disagreement_score":0.002108918,"about_ca_system_score_codex":0.000521469,"about_ca_system_score_gemma":0.00052510435,"threshold_uncertainty_score":0.007055104},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41073033,0.002154263,0.54332674,0.0024898092,0.00016912368,0.0002888134,0.0009701667,0.0012106745,0.038660083],"genre_scores_gemma":[0.74386066,0.00051303866,0.24772343,0.00011320083,0.00010153104,0.0001884502,0.001135215,0.0002386534,0.006125822],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99825007,0.0004745525,0.00011702018,0.00038567453,0.00057963043,0.00019301796],"domain_scores_gemma":[0.9888376,0.008074609,0.0008552363,0.0012580076,0.000589852,0.00038476294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013933948,0.0007710588,0.0013361692,0.002135334,0.0016366676,0.0027317214,0.0035397627,0.0019524801,0.007936687],"category_scores_gemma":[0.017605832,0.00081205624,0.0008617144,0.002254699,0.0024701438,0.004495148,0.004215438,0.0013288644,0.0011115549],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008754245,0.00013610466,0.010374862,0.000535284,0.000082896804,0.0005556426,0.0007473403,0.7158922,0.0040401216,0.18984658,0.0051068026,0.0718067],"study_design_scores_gemma":[0.00006825753,0.00005829469,0.0007729957,0.000032558335,0.000018211687,0.00017540829,0.0001858478,0.9158728,0.0017865226,0.07688472,0.004125271,0.000019164148],"about_ca_topic_score_codex":0.0046259863,"about_ca_topic_score_gemma":0.004604713,"teacher_disagreement_score":0.007936687,"about_ca_system_score_codex":0.0013988095,"about_ca_system_score_gemma":0.0007791422,"threshold_uncertainty_score":0.026550889},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026125345,0.00019485025,0.95961875,0.00012619916,0.00005687661,0.000088135246,0.00023250171,0.0011709695,0.012386428],"genre_scores_gemma":[0.21947517,0.00029353137,0.7711991,0.0001002249,0.00003577639,0.00021642553,0.0009756993,0.00061255647,0.0070915334],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99949574,0.00010406836,0.000038545968,0.000118068376,0.00016667898,0.000076814424],"domain_scores_gemma":[0.9992848,0.00027193024,0.000073459225,0.00022497159,0.00010740673,0.000037333946],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040900154,0.00070110324,0.00072127953,0.0012450928,0.0008393267,0.001759436,0.0012833861,0.00060057046,0.008341907],"category_scores_gemma":[0.0024522417,0.00043084015,0.00093910116,0.0013496,0.0009859984,0.0023560512,0.0025584225,0.0011533886,0.0026503028],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011799847,0.000059224978,0.001001814,0.00030755685,0.000027527703,0.00011670918,0.0005537066,0.06584504,0.008673128,0.52552414,0.0083400505,0.38943315],"study_design_scores_gemma":[0.00004875907,0.00008026563,0.0003242714,0.000096583935,0.000022405835,0.00022782337,0.0003628766,0.39573103,0.013601899,0.561167,0.028286975,0.000050132086],"about_ca_topic_score_codex":0.0022459498,"about_ca_topic_score_gemma":0.0041602524,"teacher_disagreement_score":0.008341907,"about_ca_system_score_codex":0.00110927,"about_ca_system_score_gemma":0.0009032819,"threshold_uncertainty_score":0.027906477},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37676716,0.013146815,0.5016929,0.017371614,0.0010597524,0.001314469,0.02648001,0.019700788,0.04246653],"genre_scores_gemma":[0.60821915,0.0027920315,0.34567606,0.0026708099,0.0008521153,0.0011747321,0.021087548,0.0029005134,0.014627085],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.97183055,0.0031157543,0.0024914593,0.0069257077,0.010217178,0.005419388],"domain_scores_gemma":[0.93660206,0.03388395,0.0049949577,0.017535085,0.0035541535,0.0034297083],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007560696,0.004884506,0.0072170924,0.0038984611,0.0056517776,0.009849428,0.01514196,0.0042874566,0.019753238],"category_scores_gemma":[0.05445942,0.0038022809,0.0053693485,0.010620611,0.0047264937,0.03184026,0.015649047,0.009373125,0.0075331246],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.013633687,0.0039180014,0.03651354,0.0052430253,0.0014932726,0.0010066257,0.0049364734,0.30179363,0.07862411,0.12550414,0.114875756,0.3124578],"study_design_scores_gemma":[0.0011970111,0.0010575873,0.005848548,0.0005021281,0.0008128431,0.001727285,0.0016276541,0.7545781,0.03676855,0.16487217,0.030713387,0.00029479963],"about_ca_topic_score_codex":0.009580813,"about_ca_topic_score_gemma":0.018660117,"teacher_disagreement_score":0.019753238,"about_ca_system_score_codex":0.0063361735,"about_ca_system_score_gemma":0.009084367,"threshold_uncertainty_score":0.066081166},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22561589,0.00023729309,0.76462275,0.00032381347,0.000039677783,0.000052519725,0.00020090422,0.0005918996,0.008315222],"genre_scores_gemma":[0.7970303,0.0003171312,0.19833504,0.00005769124,0.000022740218,0.00012262604,0.0005261471,0.00015733995,0.0034309702],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99867284,0.0002719561,0.0001059726,0.0002734108,0.0005077776,0.00016814226],"domain_scores_gemma":[0.9969453,0.0013145457,0.00030722222,0.0010155843,0.00020131376,0.00021598142],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007465852,0.00097011094,0.00057683355,0.0005032166,0.00055038754,0.0018707357,0.0013536124,0.000859443,0.002427369],"category_scores_gemma":[0.0068457937,0.00059834105,0.0012933243,0.0006090057,0.0022782148,0.0042770244,0.00443237,0.002114384,0.00042777538],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001719898,0.00004073534,0.00148439,0.0001595906,0.0000414378,0.00029397046,0.0004764986,0.5201155,0.009507586,0.4353962,0.000694273,0.031617828],"study_design_scores_gemma":[0.00003157753,0.0001755302,0.0005845881,0.000039182258,0.000030622894,0.00031256687,0.00020870507,0.62324387,0.01159356,0.35595942,0.007784246,0.000036072437],"about_ca_topic_score_codex":0.0024881149,"about_ca_topic_score_gemma":0.0018846383,"teacher_disagreement_score":0.0024881149,"about_ca_system_score_codex":0.0012081946,"about_ca_system_score_gemma":0.0007241543,"threshold_uncertainty_score":0.008766174},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10802626,0.00018316851,0.8887897,0.00019529153,0.000039781436,0.000056816003,0.00036695224,0.0007542872,0.0015877762],"genre_scores_gemma":[0.44125038,0.00021613768,0.553925,0.000063630985,0.000038121525,0.00009894621,0.0014338364,0.00022091038,0.0027529695],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999126,0.00019842682,0.00004467813,0.00028930246,0.00023943886,0.000102248],"domain_scores_gemma":[0.9980288,0.00089239154,0.00024272213,0.0004892239,0.00026236163,0.00008454277],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070379436,0.00084241555,0.0010514491,0.0014881209,0.0004509492,0.0010403245,0.0016842114,0.0017035438,0.0025957206],"category_scores_gemma":[0.0060641402,0.00081792305,0.0006134929,0.0013449218,0.0010648323,0.0026482064,0.0021299995,0.0011916669,0.00091392506],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012362031,0.0001408466,0.0057746773,0.0004246868,0.00009231635,0.00052969187,0.00077122875,0.47079328,0.02470703,0.07979322,0.0065414766,0.40919527],"study_design_scores_gemma":[0.00004677921,0.00010259778,0.0006323848,0.000038125356,0.000015484928,0.00019528215,0.0002403838,0.9308874,0.009909437,0.053836934,0.004050674,0.000044509507],"about_ca_topic_score_codex":0.0023802288,"about_ca_topic_score_gemma":0.0033557648,"teacher_disagreement_score":0.0025957206,"about_ca_system_score_codex":0.0005123336,"about_ca_system_score_gemma":0.000542924,"threshold_uncertainty_score":0.008683562},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32034856,0.00102283,0.35919738,0.0023763988,0.0005006042,0.00016211999,0.0011469375,0.0015352375,0.31370994],"genre_scores_gemma":[0.88578016,0.00051295455,0.046478692,0.0004777386,0.00018976587,0.00016372543,0.0017179803,0.00056992366,0.06410913],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993345,0.00012828085,0.000038080834,0.000117940515,0.00023486566,0.00014621325],"domain_scores_gemma":[0.9984145,0.0007255228,0.00014580639,0.00025458058,0.00019638836,0.00026316958],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005198157,0.00055929605,0.00067392905,0.002846019,0.002436933,0.003440073,0.001200878,0.0013039892,0.018444244],"category_scores_gemma":[0.0031221076,0.0005248302,0.0009933416,0.0012246391,0.0026019288,0.0037101568,0.00445599,0.0026017025,0.0023212193],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023807253,0.000017499826,0.00028141632,0.00003422267,0.0000059993927,0.000077329656,0.0001761495,0.0010779245,0.0005505833,0.9896013,0.0025598714,0.0055937963],"study_design_scores_gemma":[0.000009657829,0.000008983716,0.00030471923,0.000021765456,0.000009279042,0.00013008274,0.00017093103,0.006200195,0.0006884724,0.9831728,0.009272095,0.000011044259],"about_ca_topic_score_codex":0.0013681882,"about_ca_topic_score_gemma":0.0020994702,"teacher_disagreement_score":0.018444244,"about_ca_system_score_codex":0.0012617619,"about_ca_system_score_gemma":0.00045269588,"threshold_uncertainty_score":0.061702132},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012293928,0.000808822,0.97577083,0.0004083286,0.00017670222,0.00012857701,0.00028556623,0.001625427,0.0085017495],"genre_scores_gemma":[0.10749381,0.0007182254,0.88073295,0.00028516073,0.0002422356,0.00043644028,0.0012696948,0.0013116286,0.007509951],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99701464,0.0006663697,0.0001999846,0.0005918649,0.001162375,0.00036471256],"domain_scores_gemma":[0.9900456,0.0056334157,0.00040844924,0.002629747,0.000938132,0.00034454511],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024867367,0.0024603773,0.0023644282,0.002011476,0.0011487473,0.0039891982,0.0053979247,0.0026239667,0.017717484],"category_scores_gemma":[0.019626522,0.001450733,0.0024775101,0.004514278,0.0018491459,0.009101743,0.0047579356,0.0072000707,0.0031887705],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007490947,0.000613853,0.0012067361,0.00072761613,0.00014102779,0.00013014249,0.00042845937,0.33386043,0.0070135607,0.19150564,0.023239134,0.44038424],"study_design_scores_gemma":[0.0001817823,0.000073996205,0.0003469272,0.000057503785,0.000057192,0.00008809569,0.00007879049,0.7756956,0.0020922297,0.21497029,0.0063266577,0.000030851916],"about_ca_topic_score_codex":0.004456788,"about_ca_topic_score_gemma":0.008925832,"teacher_disagreement_score":0.017717484,"about_ca_system_score_codex":0.0030209636,"about_ca_system_score_gemma":0.0029666529,"threshold_uncertainty_score":0.05927086},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008567256,0.069721445,0.31622663,0.010728885,0.048859857,0.0008923046,0.017967818,0.027775306,0.4992604],"genre_scores_gemma":[0.008307785,0.02484267,0.06567615,0.00074786245,0.0022604587,0.00019269792,0.014003099,0.004641762,0.87932754],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99936765,0.000047187736,0.000023491542,0.00009731878,0.0003943493,0.00007004463],"domain_scores_gemma":[0.9984395,0.00022013488,0.000028763634,0.00017814846,0.00082327187,0.0003101405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012834044,0.0018584915,0.0020970271,0.0013969976,0.0010971726,0.004683374,0.0021435388,0.0009515274,0.14042842],"category_scores_gemma":[0.0018229686,0.00094972143,0.00096509675,0.003293222,0.0008397203,0.002377763,0.0016423201,0.0032186205,0.095693365],"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.00007238187,0.000052284126,0.00013839698,0.00017918888,0.000014928483,0.00003164338,0.00003549244,0.0010812131,0.0013668166,0.004420096,0.8381101,0.15449755],"study_design_scores_gemma":[0.000037377613,0.00005260387,0.0008812713,0.00012311361,0.000022619593,0.00016565231,0.000045654855,0.005414079,0.0017695922,0.007474511,0.98398906,0.00002459979],"about_ca_topic_score_codex":0.023928655,"about_ca_topic_score_gemma":0.068307415,"teacher_disagreement_score":0.14042842,"about_ca_system_score_codex":0.0022370322,"about_ca_system_score_gemma":0.005208785,"threshold_uncertainty_score":0.46977985},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05565492,0.0009009086,0.9124333,0.00043104956,0.00015478866,0.00017461779,0.0004755559,0.0005647447,0.029210119],"genre_scores_gemma":[0.3316698,0.0016449466,0.6378407,0.00035863943,0.00020689995,0.000255217,0.0020762912,0.0008908935,0.025056757],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99878055,0.00024076334,0.00009433096,0.00027611552,0.00049035175,0.000117972304],"domain_scores_gemma":[0.9927609,0.0045961756,0.000514072,0.0012773494,0.0005458003,0.00030568568],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012381603,0.0014027021,0.0019430685,0.0023497886,0.0015645259,0.003222697,0.0024206454,0.002616211,0.015270202],"category_scores_gemma":[0.011052082,0.0017990121,0.0021017762,0.0018570635,0.0029806772,0.006142518,0.0058408827,0.0031039286,0.0024196303],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006239326,0.00052263885,0.004663945,0.00071262877,0.0001099901,0.0005333023,0.001050091,0.3352559,0.009997095,0.4183235,0.015715992,0.21249115],"study_design_scores_gemma":[0.00008798457,0.00018394657,0.0008221035,0.000081588514,0.000049763454,0.0005459026,0.0003417488,0.6251817,0.0052960245,0.35525867,0.012093119,0.00005745683],"about_ca_topic_score_codex":0.0019593728,"about_ca_topic_score_gemma":0.002228834,"teacher_disagreement_score":0.015270202,"about_ca_system_score_codex":0.0007991544,"about_ca_system_score_gemma":0.00061227125,"threshold_uncertainty_score":0.051083922},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08513944,0.0002940162,0.91062015,0.00011463178,0.0000280528,0.00006966176,0.0003109573,0.00028994528,0.003133179],"genre_scores_gemma":[0.3127839,0.00039964804,0.67942995,0.00011365229,0.000047589434,0.00013493287,0.0013572252,0.00027992396,0.00545324],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983948,0.0004115019,0.00012633052,0.00039554472,0.00048783157,0.00018396959],"domain_scores_gemma":[0.9968766,0.0018189405,0.00027685467,0.0005527494,0.00030167465,0.00017305702],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016715484,0.0011351752,0.0012525378,0.0017324489,0.00091198477,0.002274418,0.0024328495,0.0016413017,0.0029179356],"category_scores_gemma":[0.005397175,0.0011749722,0.0014506509,0.0018623992,0.0033260917,0.0030924235,0.0038962343,0.0017291881,0.00077904266],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043661767,0.00006677014,0.0025421602,0.00041348813,0.000050951494,0.00049872143,0.0011910564,0.65542305,0.013450458,0.27083987,0.0017833378,0.05330351],"study_design_scores_gemma":[0.000048663307,0.00010387723,0.00071856874,0.00009909021,0.000018314817,0.00032920035,0.00019414006,0.83598775,0.0057454975,0.15140304,0.005297679,0.000054142092],"about_ca_topic_score_codex":0.0045308247,"about_ca_topic_score_gemma":0.0038073545,"teacher_disagreement_score":0.0045308247,"about_ca_system_score_codex":0.001431032,"about_ca_system_score_gemma":0.00048586456,"threshold_uncertainty_score":0.010382891},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5838708,0.000891143,0.22038396,0.0044513894,0.00060771976,0.00008082466,0.0013382337,0.00086429185,0.18751167],"genre_scores_gemma":[0.9416181,0.00055706844,0.02531364,0.00051240355,0.00030495677,0.00013504695,0.00072024734,0.00026395865,0.030574685],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99906284,0.0001623734,0.000045735753,0.00023225977,0.00024388621,0.00025288857],"domain_scores_gemma":[0.99593854,0.0023011088,0.0002988452,0.0005177917,0.00027002068,0.0006737741],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010064034,0.0006432735,0.0011729694,0.0027744372,0.0031541574,0.003648172,0.0016036569,0.0015197427,0.015468665],"category_scores_gemma":[0.0041292184,0.0006808158,0.0009533065,0.0014374809,0.0038506472,0.0042218096,0.0033980492,0.0035393573,0.0018193403],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008126254,0.000015642454,0.0004961906,0.00004950043,0.000008370822,0.000071705865,0.0002069801,0.003565787,0.0017472984,0.98563254,0.001855938,0.0062689185],"study_design_scores_gemma":[0.000021261489,0.000031642416,0.0007132569,0.000030664756,0.000017244256,0.00019783076,0.00013263793,0.01028674,0.0022254495,0.9771812,0.009136716,0.000025344394],"about_ca_topic_score_codex":0.0013596326,"about_ca_topic_score_gemma":0.0018718267,"teacher_disagreement_score":0.015468665,"about_ca_system_score_codex":0.0016912443,"about_ca_system_score_gemma":0.00083449215,"threshold_uncertainty_score":0.0517478},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09625294,0.0013279403,0.77509403,0.0016453317,0.0008139579,0.00017217574,0.0018385197,0.0012557587,0.12159933],"genre_scores_gemma":[0.5941452,0.000985911,0.35070115,0.0006845265,0.00035971156,0.00026613695,0.002942337,0.0009764127,0.048938595],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999212,0.00015584986,0.000047539863,0.00015363788,0.00031434893,0.000116626565],"domain_scores_gemma":[0.9976184,0.0012348022,0.00016528515,0.000535408,0.00028763546,0.0001583963],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005860974,0.0004587834,0.00085241033,0.0011775324,0.0010851595,0.0016311076,0.0012749685,0.0010300757,0.01850779],"category_scores_gemma":[0.005290254,0.00052521774,0.00089295243,0.00090957974,0.0011209053,0.0021400873,0.0036628435,0.0019684772,0.003181204],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033123558,0.00007855,0.00084040314,0.00051124307,0.00004500572,0.0002608148,0.00039544443,0.02716483,0.011561689,0.7813253,0.03250028,0.1449853],"study_design_scores_gemma":[0.00007264491,0.00007162036,0.0005557481,0.00017123645,0.000024543147,0.00040940175,0.00024063517,0.07527388,0.010374186,0.87424344,0.03853716,0.000025597568],"about_ca_topic_score_codex":0.0009088655,"about_ca_topic_score_gemma":0.002273519,"teacher_disagreement_score":0.01850779,"about_ca_system_score_codex":0.00078677025,"about_ca_system_score_gemma":0.00053067063,"threshold_uncertainty_score":0.061914682},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17075638,0.00081446656,0.680936,0.0009905748,0.0006624863,0.00022449944,0.0017915162,0.0011364765,0.14268763],"genre_scores_gemma":[0.6421294,0.0009567074,0.2803945,0.00029897745,0.00024890827,0.0002394182,0.0031344916,0.0006236995,0.071973875],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99945444,0.00010407805,0.000023910732,0.00008149812,0.00023718447,0.000098853874],"domain_scores_gemma":[0.9995845,0.00014643444,0.00004446365,0.00007220667,0.000075509015,0.000076847915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023938243,0.00043892,0.0006028713,0.0011652868,0.0010916829,0.0022374983,0.00076656195,0.00063801615,0.020213693],"category_scores_gemma":[0.0014263124,0.00033682867,0.000639062,0.0009836911,0.0013785956,0.0017720222,0.001978577,0.001681904,0.004190697],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014637646,0.00008047984,0.0008289621,0.00016058779,0.000020761865,0.0003906171,0.00029634268,0.023607338,0.00521228,0.8624633,0.016204914,0.090588],"study_design_scores_gemma":[0.000040101535,0.00007883139,0.00059334293,0.000066361994,0.000013397227,0.00058524695,0.00047162562,0.091500044,0.0037299318,0.8701186,0.032773994,0.000028554812],"about_ca_topic_score_codex":0.0014439346,"about_ca_topic_score_gemma":0.0026437845,"teacher_disagreement_score":0.020213693,"about_ca_system_score_codex":0.00050602877,"about_ca_system_score_gemma":0.00038937738,"threshold_uncertainty_score":0.06762153},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25955516,0.0013827276,0.7122508,0.0013862114,0.00009690351,0.00053734105,0.0031724053,0.0033363518,0.018282128],"genre_scores_gemma":[0.5742778,0.0010456784,0.40172046,0.00029245246,0.0001310624,0.00032499974,0.008002954,0.0009481354,0.0132565275],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984686,0.00031712986,0.00009572406,0.00047874037,0.00040278398,0.00023701062],"domain_scores_gemma":[0.99676526,0.001739915,0.0004243475,0.00068601756,0.00021043078,0.00017408245],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006488072,0.0011467022,0.0013808728,0.0008435915,0.001104645,0.002033635,0.0017943068,0.001671125,0.008261763],"category_scores_gemma":[0.0050590793,0.0007187613,0.0018310664,0.0021593415,0.0011095046,0.0044476786,0.0014800782,0.0020576036,0.0013326089],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034709505,0.00024225768,0.0027637412,0.00084948936,0.0001367451,0.00076646847,0.00047906628,0.76272243,0.011716341,0.056411378,0.013936615,0.14962842],"study_design_scores_gemma":[0.00006079724,0.0001424525,0.0012546704,0.00006882952,0.00006180745,0.00047584463,0.00023665711,0.88022053,0.008621345,0.093604505,0.0152244,0.0000281043],"about_ca_topic_score_codex":0.0033193517,"about_ca_topic_score_gemma":0.004776811,"teacher_disagreement_score":0.008261763,"about_ca_system_score_codex":0.0015546253,"about_ca_system_score_gemma":0.00075533724,"threshold_uncertainty_score":0.027638376},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15679331,0.0014088142,0.82276857,0.0002912031,0.0001160513,0.00011228089,0.00065851514,0.0005325878,0.017318634],"genre_scores_gemma":[0.6894728,0.0012576832,0.3031503,0.00008553484,0.00006147644,0.00014411166,0.00088031346,0.00044504093,0.004502685],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99807477,0.00022477804,0.00012690722,0.00035809295,0.0010305158,0.00018490867],"domain_scores_gemma":[0.9966382,0.0015024601,0.00045448507,0.0006651845,0.00055426545,0.00018547375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011127335,0.0005835195,0.00062662584,0.0009991195,0.0005288185,0.0012514764,0.00093186455,0.000745583,0.0060265805],"category_scores_gemma":[0.011318619,0.000552746,0.00047814773,0.0011321029,0.0012463814,0.0030411961,0.0021108396,0.0010707332,0.0011507268],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006812233,0.00008952782,0.010468685,0.00077133474,0.00011028074,0.0005663772,0.0010001867,0.57910174,0.039534356,0.12563583,0.004995426,0.23704502],"study_design_scores_gemma":[0.000036977675,0.00017808235,0.004063617,0.00017008692,0.00002970656,0.00074995996,0.00069194037,0.8307309,0.020728769,0.12968461,0.012874263,0.00006105944],"about_ca_topic_score_codex":0.0022105228,"about_ca_topic_score_gemma":0.0024978598,"teacher_disagreement_score":0.0060265805,"about_ca_system_score_codex":0.00081603247,"about_ca_system_score_gemma":0.00046649552,"threshold_uncertainty_score":0.020160854},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.69377166,0.002263547,0.24615905,0.0016683221,0.00019073141,0.00004792868,0.00038522523,0.00033688065,0.05517672],"genre_scores_gemma":[0.95498854,0.0013644703,0.036911577,0.00027070066,0.000209721,0.00005895476,0.0003243121,0.0002071425,0.0056645437],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990707,0.00022969671,0.00005091344,0.00019024973,0.000257374,0.00020114105],"domain_scores_gemma":[0.9953002,0.0024643722,0.00078468747,0.0006508412,0.0003597637,0.0004401469],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010046441,0.0006800843,0.00059216534,0.0016547006,0.0010938346,0.0019174288,0.0012432152,0.0011037902,0.0049910024],"category_scores_gemma":[0.0069424044,0.0009592715,0.0006356242,0.00129197,0.003988687,0.0063327793,0.0031292185,0.0022478022,0.0007942205],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031988745,0.000051232975,0.0060051586,0.00022201044,0.000039186758,0.00055203406,0.0012871919,0.044537555,0.011885539,0.8925593,0.0038436535,0.038697205],"study_design_scores_gemma":[0.000028924145,0.00008055177,0.0033016696,0.00008054193,0.00004296332,0.0010269292,0.0006529757,0.0480432,0.00463751,0.93291223,0.009146756,0.000045770033],"about_ca_topic_score_codex":0.0006107195,"about_ca_topic_score_gemma":0.00048505364,"teacher_disagreement_score":0.0049910024,"about_ca_system_score_codex":0.00095997687,"about_ca_system_score_gemma":0.0002337642,"threshold_uncertainty_score":0},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17882109,0.0029106585,0.8036491,0.0012649765,0.00013612286,0.00038033602,0.0016359384,0.0015900206,0.009611666],"genre_scores_gemma":[0.5535705,0.002155148,0.42814168,0.00041809582,0.00024358074,0.00070006156,0.005230416,0.00043753182,0.009102889],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983222,0.00040114415,0.000119801836,0.00049255067,0.00043076146,0.00023338781],"domain_scores_gemma":[0.9966162,0.0022565662,0.0003375749,0.00031217685,0.00026307462,0.00021449135],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010312167,0.0020262375,0.0025803593,0.0019827255,0.0015831408,0.0025559391,0.0036510087,0.0026738872,0.009197839],"category_scores_gemma":[0.008074776,0.00095286017,0.0017446853,0.005772231,0.0014816385,0.0055010556,0.0024953685,0.0019804933,0.0011521232],"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.00046111533,0.00032462747,0.0024806191,0.0008850775,0.0002004791,0.0005553579,0.0005070204,0.7638893,0.00381713,0.10983181,0.011786425,0.10526105],"study_design_scores_gemma":[0.000078967554,0.00011760387,0.0005027541,0.00004432404,0.00003392626,0.00026061616,0.00018264192,0.87510806,0.0014051876,0.11892842,0.0033031346,0.000034390494],"about_ca_topic_score_codex":0.006262681,"about_ca_topic_score_gemma":0.0038742812,"teacher_disagreement_score":0.009197839,"about_ca_system_score_codex":0.002162746,"about_ca_system_score_gemma":0.0010958309,"threshold_uncertainty_score":0.030769825},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13488439,0.0025220844,0.82647884,0.0025486741,0.00036258125,0.00030257006,0.0037805843,0.011916228,0.01720409],"genre_scores_gemma":[0.4880384,0.0011653866,0.48781732,0.0011139176,0.00032508888,0.00056278787,0.007684466,0.0014956292,0.011796927],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9941711,0.00079024426,0.0006395944,0.0013731044,0.002013945,0.0010120142],"domain_scores_gemma":[0.9904032,0.0029908011,0.00080207764,0.0046109683,0.0007863117,0.00040665464],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017015346,0.0016026306,0.0028673522,0.0017767198,0.0022466488,0.0042269547,0.0055886847,0.00268507,0.013229094],"category_scores_gemma":[0.011137095,0.0011265153,0.0018413424,0.008503813,0.002900895,0.0175054,0.00956014,0.003132147,0.005214325],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0038758244,0.0007660276,0.007859503,0.0012360901,0.00020990288,0.00055456546,0.0018767661,0.17694901,0.034994457,0.29351166,0.06974356,0.40842268],"study_design_scores_gemma":[0.0004546297,0.0006513488,0.0018905818,0.000117742005,0.00013972998,0.0008118451,0.00130415,0.6165327,0.0365602,0.28739423,0.053941153,0.00020162648],"about_ca_topic_score_codex":0.008172366,"about_ca_topic_score_gemma":0.007941513,"teacher_disagreement_score":0.013229094,"about_ca_system_score_codex":0.0026471561,"about_ca_system_score_gemma":0.0026326291,"threshold_uncertainty_score":0.044255733},"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":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007904094,0.2315294,0.051957805,0.049211722,0.41710293,0.0002992788,0.006521349,0.0022909208,0.23318258],"genre_scores_gemma":[0.046342235,0.20176232,0.033850197,0.006183244,0.21806896,0.0002140642,0.015646016,0.005977742,0.47195524],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99727386,0.00024730168,0.00019148666,0.000498786,0.0016555797,0.00013291651],"domain_scores_gemma":[0.99294126,0.0015350581,0.00025373444,0.0009909484,0.0031319817,0.0011469431],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024795,0.0016561057,0.0020129038,0.0050829663,0.0015955794,0.0064338488,0.0015349911,0.0013852887,0.07732012],"category_scores_gemma":[0.008925748,0.00084231765,0.0011936027,0.0048982026,0.0014565804,0.003672645,0.0029736084,0.0035571067,0.029930687],"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.00005400223,0.00003001678,0.00057866174,0.0006783375,0.00004483723,0.00006320536,0.000041450698,0.0009042421,0.0007473488,0.012159603,0.8834683,0.10122999],"study_design_scores_gemma":[0.000017925031,0.000045051103,0.001647069,0.00045873006,0.000033337776,0.00039038394,0.00006605023,0.0015943127,0.0007166844,0.01926921,0.9757386,0.000022652903],"about_ca_topic_score_codex":0.0023487816,"about_ca_topic_score_gemma":0.0061078956,"teacher_disagreement_score":0.07732012,"about_ca_system_score_codex":0.0030995363,"about_ca_system_score_gemma":0.003983435,"threshold_uncertainty_score":0.25866163},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.57228243,0.032686967,0.02061524,0.0018444199,0.0012080685,0.00027658237,0.29343647,0.0009341192,0.07671576],"genre_scores_gemma":[0.577048,0.024346638,0.029923536,0.0011746774,0.00031312616,0.00057642226,0.29810777,0.00031991742,0.068189815],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9995789,0.00003280712,0.00005691366,0.000113392474,0.00017386026,0.00004406663],"domain_scores_gemma":[0.99750346,0.00030048366,0.00067477423,0.00029723087,0.0011221007,0.00010191406],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007676621,0.00031622942,0.00018721724,0.004288236,0.0008028991,0.00062198855,0.00039086686,0.00027860067,0.0071027684],"category_scores_gemma":[0.0020961014,0.0003128609,0.0002478236,0.005700902,0.0005018545,0.00048221662,0.00097356044,0.0003003007,0.0018191949],"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.00018725653,0.000037003127,0.40078676,0.0013269874,0.0002149728,0.00068844063,0.0031799914,0.0009316898,0.002989047,0.002581075,0.08549387,0.50158286],"study_design_scores_gemma":[0.0000049919095,0.000017800365,0.6036691,0.00041497417,0.00006195141,0.00043427435,0.0010668844,0.00022943315,0.0010096801,0.00038381215,0.39268646,0.0000205564],"about_ca_topic_score_codex":0.16743088,"about_ca_topic_score_gemma":0.38321224,"teacher_disagreement_score":0.8325691,"about_ca_system_score_codex":0.0013905884,"about_ca_system_score_gemma":0.0018786445,"threshold_uncertainty_score":0.33291262},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07582261,0.0006591831,0.8750202,0.0005923669,0.00012422069,0.00007239464,0.00042018387,0.00024697333,0.047041856],"genre_scores_gemma":[0.86548907,0.00082357717,0.12646751,0.0002327368,0.00015216858,0.0001767705,0.00047774782,0.00021360755,0.005966753],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99889284,0.00020138796,0.000057979203,0.00018693406,0.00040960417,0.00025121862],"domain_scores_gemma":[0.9973564,0.00094898813,0.0004164943,0.00047926363,0.0005894076,0.00020949681],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008712113,0.0006383571,0.0005953875,0.0015826464,0.0009941648,0.0032872097,0.0009462463,0.0006424742,0.0035294238],"category_scores_gemma":[0.0043638838,0.00045732467,0.0010029385,0.0012537189,0.0031294608,0.0031983852,0.0038017735,0.0019121561,0.0004740766],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005104446,0.000019438607,0.0013928786,0.00007460581,0.000029042625,0.00024588557,0.0002728426,0.024117919,0.0039533335,0.944267,0.0020898134,0.023486197],"study_design_scores_gemma":[0.000028463703,0.00006119229,0.0032138876,0.00009025324,0.000034068118,0.00085126946,0.00042626355,0.16114071,0.009856716,0.7953452,0.028887346,0.00006477181],"about_ca_topic_score_codex":0.0019036562,"about_ca_topic_score_gemma":0.0013376902,"teacher_disagreement_score":0.0035294238,"about_ca_system_score_codex":0.0008753047,"about_ca_system_score_gemma":0.0006833209,"threshold_uncertainty_score":0.011807144},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025334869,0.15460934,0.3342506,0.021518711,0.023156809,0.00017818614,0.002278928,0.0022619383,0.43641067],"genre_scores_gemma":[0.27452123,0.1303793,0.24101101,0.0036807377,0.010599322,0.0002162221,0.0046903566,0.0029671188,0.3319348],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99839586,0.0002299412,0.000115109324,0.00031467865,0.00088566024,0.0000588217],"domain_scores_gemma":[0.998061,0.0003620581,0.0001058593,0.00064263423,0.00063477916,0.0001936074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001269289,0.0010226731,0.0012942385,0.0022331083,0.0012435977,0.0075292257,0.0010072375,0.0009885795,0.051193554],"category_scores_gemma":[0.004417791,0.0007828973,0.0010161225,0.0023872764,0.0030269942,0.0027202195,0.0028370896,0.0034562538,0.013045707],"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.00010599496,0.00008877604,0.003595365,0.0009181344,0.00019204101,0.0002478275,0.00029169873,0.008775874,0.0060218554,0.30351898,0.29183924,0.3844042],"study_design_scores_gemma":[0.000031203585,0.000074324846,0.0051732063,0.00029024438,0.00012470642,0.0018827514,0.00026200348,0.017182484,0.002175537,0.3045389,0.66820997,0.000054624572],"about_ca_topic_score_codex":0.0031459553,"about_ca_topic_score_gemma":0.005977496,"teacher_disagreement_score":0.051193554,"about_ca_system_score_codex":0.001314868,"about_ca_system_score_gemma":0.002295627,"threshold_uncertainty_score":0.17125946},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1857975,0.0016347705,0.770665,0.0043818,0.00033086713,0.00028825464,0.004849549,0.012256326,0.01979596],"genre_scores_gemma":[0.78246826,0.000500223,0.19958065,0.00094386237,0.00032503385,0.0003351827,0.0055824565,0.0008628708,0.009401391],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99382246,0.00074775395,0.00066135783,0.002150214,0.001767524,0.0008507599],"domain_scores_gemma":[0.97602844,0.010312379,0.001299507,0.010037039,0.0014731096,0.00084950164],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028244911,0.0010003534,0.0020936232,0.0010254806,0.0011513941,0.0043991352,0.0046359017,0.0033530584,0.013767522],"category_scores_gemma":[0.023865946,0.00079465995,0.0016504343,0.0023112053,0.0023246685,0.019203322,0.005462649,0.0056322166,0.0034634992],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002644366,0.00053202454,0.008224177,0.0009747888,0.00014038516,0.00042170275,0.00076836493,0.11920712,0.027046427,0.5756015,0.027825268,0.23661382],"study_design_scores_gemma":[0.00019732564,0.00037068737,0.0013491313,0.00010001923,0.00006254115,0.00060348026,0.0003202006,0.43146682,0.022584168,0.5216448,0.021176344,0.00012449968],"about_ca_topic_score_codex":0.0017323088,"about_ca_topic_score_gemma":0.0017598665,"teacher_disagreement_score":0.013767522,"about_ca_system_score_codex":0.003024831,"about_ca_system_score_gemma":0.002041957,"threshold_uncertainty_score":0.046056926},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.092210494,0.0004805088,0.8904344,0.0007835003,0.00007103277,0.00024425823,0.0013091912,0.0039938493,0.010472716],"genre_scores_gemma":[0.24609861,0.0003132,0.7402407,0.00017893307,0.00004968067,0.00018487906,0.0047171884,0.001035969,0.0071809036],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992028,0.00006613717,0.000042586926,0.0003500001,0.00020867615,0.000129775],"domain_scores_gemma":[0.99891686,0.00048753954,0.00014503607,0.000248829,0.000111371126,0.00009035431],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003750896,0.0016955078,0.0018408587,0.0007189959,0.0009778179,0.0018477355,0.0018131515,0.0020675852,0.011285074],"category_scores_gemma":[0.0025636312,0.000887426,0.001609259,0.0015771887,0.0010469526,0.0031818922,0.0019016828,0.0017664117,0.0036258742],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00060152175,0.0004197985,0.0020947412,0.0010604061,0.00014577304,0.0006477983,0.00035333793,0.49901333,0.031580564,0.032505233,0.024904326,0.40667322],"study_design_scores_gemma":[0.00014217195,0.0002619485,0.0005857858,0.00006107012,0.000046892324,0.00049341115,0.00019606973,0.90947294,0.0121928835,0.06360878,0.012885611,0.000052394746],"about_ca_topic_score_codex":0.0047111465,"about_ca_topic_score_gemma":0.0046349177,"teacher_disagreement_score":0.011285074,"about_ca_system_score_codex":0.0011646387,"about_ca_system_score_gemma":0.0014734146,"threshold_uncertainty_score":0.03775233},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042481065,0.00038270451,0.9431679,0.0005729231,0.000052911153,0.00012671741,0.00052656716,0.0005515951,0.012137656],"genre_scores_gemma":[0.52009624,0.0004964719,0.47211182,0.00022960194,0.000049645718,0.00035032895,0.0014886914,0.00021992504,0.004957267],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99918824,0.00024596098,0.00002856324,0.00020446048,0.00022680586,0.00010600959],"domain_scores_gemma":[0.9985416,0.0010269342,0.000079719306,0.0001462415,0.00013146989,0.0000740367],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008574259,0.00066093577,0.0007366469,0.00068225246,0.0005539305,0.0013936231,0.00097104907,0.0014560651,0.009672879],"category_scores_gemma":[0.0052515976,0.0005301956,0.00077622343,0.00058879174,0.0007213187,0.001997052,0.0019433849,0.0014221151,0.000943137],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027040046,0.00017391362,0.0020630856,0.00031131363,0.00006656438,0.00033190797,0.00040592597,0.60399276,0.007197446,0.15077628,0.009551487,0.22485894],"study_design_scores_gemma":[0.000040862546,0.00011885607,0.00030606694,0.000034264744,0.000016687793,0.00008729855,0.00019195546,0.8749903,0.002216412,0.115728065,0.0062538157,0.000015481757],"about_ca_topic_score_codex":0.002184997,"about_ca_topic_score_gemma":0.0024386076,"teacher_disagreement_score":0.009672879,"about_ca_system_score_codex":0.00065221486,"about_ca_system_score_gemma":0.0010848406,"threshold_uncertainty_score":0.032359004},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6166704,0.0040702084,0.34574753,0.0015761765,0.00011201003,0.00010469467,0.0005097078,0.0007321664,0.030477012],"genre_scores_gemma":[0.9576989,0.0030503657,0.03543711,0.00029201322,0.00009450736,0.00011289087,0.0004167932,0.00020068338,0.002696706],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987256,0.00040337438,0.000051009025,0.00022510724,0.00032874205,0.0002662897],"domain_scores_gemma":[0.9844226,0.011792257,0.0015146071,0.0009133378,0.0005252945,0.00083198235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011771517,0.0014191923,0.0010751515,0.002184674,0.001090082,0.0014339985,0.0016309036,0.00083435496,0.003963548],"category_scores_gemma":[0.0165701,0.00068497384,0.00062786567,0.0024902117,0.0023136388,0.0035161932,0.002631102,0.0015943256,0.00047352086],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00064353604,0.00016487471,0.0050980337,0.00065128173,0.0000994881,0.0005887043,0.00041477577,0.5756316,0.01293594,0.33569953,0.004625627,0.06344662],"study_design_scores_gemma":[0.000056321784,0.00020180267,0.002047404,0.00013868332,0.00006912743,0.0006252089,0.00024363799,0.6706378,0.0074756844,0.3144104,0.004036835,0.000057203706],"about_ca_topic_score_codex":0.0022064447,"about_ca_topic_score_gemma":0.0024328781,"teacher_disagreement_score":0.003963548,"about_ca_system_score_codex":0.001597059,"about_ca_system_score_gemma":0.0006400211,"threshold_uncertainty_score":0.013259411},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009986454,0.000061142906,0.98800254,0.000077847435,0.00001897035,0.00003695185,0.000033428325,0.00040869083,0.0013738984],"genre_scores_gemma":[0.29471803,0.0001713895,0.6995447,0.00012005137,0.000038760023,0.00030631278,0.00026814148,0.00057741173,0.0042552287],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9977481,0.00043303875,0.000117132564,0.00050584215,0.0010430721,0.00015273907],"domain_scores_gemma":[0.997079,0.0013044075,0.00029360046,0.00062671746,0.0005569119,0.00013948741],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016447736,0.0010967641,0.00091357075,0.0012340107,0.0010025444,0.0014549543,0.0018925915,0.0012355474,0.0031142046],"category_scores_gemma":[0.009072996,0.00080506917,0.00091620855,0.0008273681,0.0017674792,0.0020604136,0.0052244705,0.0017523508,0.001266509],"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.00024255987,0.000038801543,0.0011034631,0.00016208406,0.000057293582,0.00016653273,0.00041277017,0.7526061,0.023028359,0.108827665,0.0019235465,0.111430794],"study_design_scores_gemma":[0.000013140652,0.000045786015,0.000098488745,0.000016119144,0.000007188141,0.00006308427,0.000034486857,0.9292522,0.009436435,0.05825331,0.002763264,0.00001642666],"about_ca_topic_score_codex":0.0025546276,"about_ca_topic_score_gemma":0.001400675,"teacher_disagreement_score":0.0031142046,"about_ca_system_score_codex":0.0014443377,"about_ca_system_score_gemma":0.00095024507,"threshold_uncertainty_score":0.01047945},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014213392,0.00042523746,0.9543764,0.00044741036,0.00017477294,0.00017126344,0.00303461,0.018981231,0.008175694],"genre_scores_gemma":[0.15367341,0.0007234972,0.8314639,0.0001867909,0.0000748459,0.0004067266,0.003926697,0.0035079268,0.0060362346],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996598,0.00007082161,0.00002105227,0.00005574651,0.00015724181,0.00003542403],"domain_scores_gemma":[0.9993636,0.00028943087,0.000043676322,0.00012867668,0.000108914006,0.0000656874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046320344,0.0012216362,0.00071024144,0.0013788772,0.00055699865,0.0019084703,0.001605093,0.00074056594,0.024464307],"category_scores_gemma":[0.0026941733,0.0006900221,0.0008529742,0.0015597489,0.00043526755,0.0027452125,0.0021467214,0.0011052728,0.0022054624],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012547837,0.00021844206,0.0023257663,0.0011037184,0.0001220679,0.00063556904,0.0006929203,0.17188329,0.05276442,0.08594739,0.12576304,0.5572885],"study_design_scores_gemma":[0.0001949815,0.00014863232,0.00062668044,0.00010390894,0.000032155123,0.00038880424,0.00018170271,0.828158,0.018846992,0.068305194,0.08292891,0.00008407976],"about_ca_topic_score_codex":0.00200648,"about_ca_topic_score_gemma":0.0048851115,"teacher_disagreement_score":0.024464307,"about_ca_system_score_codex":0.00060725264,"about_ca_system_score_gemma":0.0006531881,"threshold_uncertainty_score":0.08184129},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009172718,0.004295951,0.08340589,0.02627153,0.0063492376,0.027237987,0.0955339,0.01389939,0.7338333],"genre_scores_gemma":[0.05823299,0.007216071,0.17436264,0.01223145,0.0016471816,0.092441976,0.03187352,0.011159422,0.61083466],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9884073,0.005387285,0.000882818,0.00091411796,0.0039871596,0.00042135592],"domain_scores_gemma":[0.9555134,0.022151232,0.001315072,0.004169184,0.015873877,0.0009772799],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.017376527,0.0009704826,0.0010149837,0.00381602,0.0017009686,0.0047828355,0.0012611708,0.001612279,0.6354321],"category_scores_gemma":[0.05979522,0.00078502233,0.0009859853,0.003677455,0.0016417174,0.0045748716,0.004315536,0.002904076,0.260692],"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.00017806147,0.00007476238,0.0003193572,0.0032561775,0.000016109088,0.00008717265,0.006919133,0.0001294822,0.0010090834,0.009551381,0.8261092,0.15235023],"study_design_scores_gemma":[0.000068785936,0.000043876713,0.0010099534,0.00202416,0.000011383256,0.000057942845,0.005618205,0.000195116,0.000778601,0.0075427433,0.9826182,0.000030935196],"about_ca_topic_score_codex":0.0021900127,"about_ca_topic_score_gemma":0.0039550993,"teacher_disagreement_score":0.36456788,"about_ca_system_score_codex":0.002313052,"about_ca_system_score_gemma":0.007401595,"threshold_uncertainty_score":0.5200118},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0096036205,0.039956756,0.0018776786,0.036067948,0.006978662,0.00060472224,0.016311828,0.0038479199,0.8847508],"genre_scores_gemma":[0.026592448,0.025819398,0.0058095315,0.014795323,0.00086667953,0.00023073936,0.008537127,0.0010122171,0.9163365],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99948716,0.00003280661,0.000013645163,0.00005919178,0.00031747518,0.000089642315],"domain_scores_gemma":[0.9985215,0.000073787174,0.000050422626,0.000040709452,0.0006347148,0.0006788099],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00048468227,0.00050925283,0.00038701578,0.0009509153,0.002325791,0.0026969304,0.0008686777,0.0016925579,0.25683123],"category_scores_gemma":[0.0014472847,0.00022031335,0.00044877653,0.0009039039,0.0005928224,0.0012380524,0.0015155908,0.0020475034,0.0522255],"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.00034665706,0.00012383326,0.0005286549,0.0003809451,0.0000112901735,0.00014374476,0.00010341162,0.000012344975,0.0019427625,0.0025158615,0.86600745,0.127883],"study_design_scores_gemma":[0.00008363232,0.00005051465,0.0016510844,0.0001994339,0.000013038091,0.00014805215,0.00008617591,0.00003137486,0.00044695154,0.00033948314,0.9969373,0.00001305571],"about_ca_topic_score_codex":0.21303973,"about_ca_topic_score_gemma":0.5145336,"teacher_disagreement_score":0.7431688,"about_ca_system_score_codex":0.004154782,"about_ca_system_score_gemma":0.011647899,"threshold_uncertainty_score":0.85918605},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6721915,0.051888116,0.0059181536,0.0014780964,0.0016665076,0.00096041965,0.004929467,0.00046958102,0.2604981],"genre_scores_gemma":[0.94984627,0.009923554,0.008528165,0.0012471448,0.00018848071,0.00040952914,0.0027297176,0.000048374557,0.027078895],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99986196,0.0000132814785,0.000014431075,0.000051185398,0.00003261022,0.000026479578],"domain_scores_gemma":[0.99985254,0.000023817207,0.00006008123,0.000014794817,0.000027762806,0.00002097922],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016343321,0.00069652696,0.000365635,0.0009135181,0.0010815638,0.00045531287,0.0006175619,0.000625538,0.0052476833],"category_scores_gemma":[0.0004334914,0.00030146647,0.00024589384,0.00075140345,0.0005926298,0.0011367168,0.0006861021,0.0006036898,0.0017419262],"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.00087557425,0.00020089831,0.05645313,0.0021083409,0.00018119541,0.010349045,0.007500421,0.0011866488,0.049959585,0.008455696,0.018651018,0.84407836],"study_design_scores_gemma":[0.00018393467,0.00045262015,0.4744487,0.0012037196,0.0003398234,0.02691266,0.0035229677,0.0007499908,0.0049975794,0.0018742362,0.4852298,0.00008394514],"about_ca_topic_score_codex":0.014944537,"about_ca_topic_score_gemma":0.038971737,"teacher_disagreement_score":0.014944537,"about_ca_system_score_codex":0.00062745565,"about_ca_system_score_gemma":0.0005129637,"threshold_uncertainty_score":0.029715061},"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":"software","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":"software","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00093398266,0.000470176,0.29145393,0.00033920747,0.0003551929,0.00021028495,0.037189428,0.6337657,0.035282023],"genre_scores_gemma":[0.016836194,0.00064399577,0.1528003,0.0007816116,0.00016982899,0.0010678185,0.124028385,0.63867563,0.06499616],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985455,0.00016754701,0.00013941161,0.00024420855,0.0007079764,0.0001952977],"domain_scores_gemma":[0.9986009,0.00036640963,0.000073695985,0.00034454532,0.00046404338,0.0001503808],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018254606,0.0032202702,0.001791159,0.0019453798,0.0008397359,0.0033771018,0.007957733,0.0033538789,0.28256482],"category_scores_gemma":[0.005645002,0.0025123537,0.0019772819,0.0016594328,0.00097316306,0.003811031,0.0046978993,0.0040641557,0.3091347],"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.00024017802,0.00006384077,0.0002455257,0.00096239476,0.00006561757,0.00012864966,0.000109182496,0.0040560146,0.0049470016,0.009747054,0.90871054,0.070723936],"study_design_scores_gemma":[0.0004906376,0.00008483175,0.0006529304,0.00044121733,0.000052733598,0.00050595996,0.000052776464,0.046665937,0.023100318,0.023654073,0.9040955,0.00020309018],"about_ca_topic_score_codex":0.0030516884,"about_ca_topic_score_gemma":0.0031382693,"teacher_disagreement_score":0.28256482,"about_ca_system_score_codex":0.00084527355,"about_ca_system_score_gemma":0.0013076338,"threshold_uncertainty_score":0.9452735},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.69946,0.004337863,0.19428915,0.016729264,0.0008662555,0.0030109845,0.019738235,0.003057377,0.058510937],"genre_scores_gemma":[0.9017448,0.001149442,0.07488293,0.0014139862,0.00021135285,0.0017064218,0.015632262,0.001035398,0.0022234425],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.693611,0.16866142,0.03587929,0.015931329,0.07578453,0.010132479],"domain_scores_gemma":[0.25972247,0.49637997,0.038832247,0.15575248,0.042962443,0.006350406],"candidate_categories":["metaresearch","open_science"],"consensus_categories":[],"category_scores_codex":[0.2150327,0.0009989372,0.001796533,0.008006637,0.0048331055,0.019905085,0.0046319114,0.0054868725,0.003487129],"category_scores_gemma":[0.4898635,0.0014176246,0.0022018997,0.017171549,0.0079007065,0.02998275,0.011288303,0.0053964783,0.0011744933],"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.0073495945,0.0018632159,0.23185414,0.0024587428,0.0012799023,0.00074302923,0.00968684,0.08071964,0.006597754,0.429695,0.026504181,0.20124798],"study_design_scores_gemma":[0.0014240396,0.0018880595,0.13259473,0.003206776,0.0009109795,0.0014332641,0.028195689,0.2760178,0.051117577,0.31382567,0.18843453,0.00095092494],"about_ca_topic_score_codex":0.010710528,"about_ca_topic_score_gemma":0.0065923943,"teacher_disagreement_score":0.99536806,"about_ca_system_score_codex":0.008700751,"about_ca_system_score_gemma":0.009256168,"threshold_uncertainty_score":0.96800447},"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":"empirical","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55624866,0.0054453183,0.0052778064,0.0011636266,0.00076367165,0.0002520329,0.01999639,0.0014458355,0.40940657],"genre_scores_gemma":[0.88335884,0.0011289712,0.0045031593,0.0003524032,0.000058821643,0.00009208992,0.0110444585,0.00016545878,0.09929582],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9999248,0.0000075861994,0.0000037250613,0.000029401624,0.00001564406,0.00001894026],"domain_scores_gemma":[0.99995184,0.0000055951127,0.000017099048,0.0000042446595,0.0000079440715,0.000013300951],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006771211,0.0002569126,0.00013486693,0.0014349007,0.0008829962,0.0004149948,0.0002648664,0.0003169257,0.027799025],"category_scores_gemma":[0.00014532392,0.00010142547,0.00017000805,0.0010591313,0.0005973257,0.0002909373,0.00051952194,0.00042349013,0.008350261],"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.0009770647,0.00012959562,0.1411486,0.00083346653,0.00009500082,0.0037208246,0.006128042,0.00064653065,0.07375165,0.00528595,0.13120428,0.6360791],"study_design_scores_gemma":[0.00003415333,0.00012705401,0.5278766,0.00014643309,0.00008226884,0.0031374681,0.003151976,0.00035031993,0.0023060844,0.00066424574,0.4620967,0.000026662692],"about_ca_topic_score_codex":0.02072993,"about_ca_topic_score_gemma":0.07751931,"teacher_disagreement_score":0.027799025,"about_ca_system_score_codex":0.00042854168,"about_ca_system_score_gemma":0.00019956693,"threshold_uncertainty_score":0.092997074},"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":"empirical","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99927694,0.00007104229,0.000040063023,0.000009175639,0.000002112485,0.000001949138,0.0001773807,0.0000026016517,0.0004187005],"genre_scores_gemma":[0.9988518,0.000049305283,0.00015747505,0.000015042627,0.0000043329537,0.0000043065143,0.00015825778,0.0000028727375,0.00075657654],"study_design_codex":"observational","study_design_gemma":"not_applicable","domain_scores_codex":[0.9999443,0.000008755164,0.0000035276096,0.000022332842,0.000006935211,0.000014071683],"domain_scores_gemma":[0.9997733,0.000058835543,0.00006811218,0.0000073243905,0.000027596288,0.00006478937],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000141367,0.00022842041,0.00014411604,0.0007999323,0.00028159932,0.00017610875,0.00019454083,0.00026936588,0.004267511],"category_scores_gemma":[0.00036035155,0.00009321044,0.00009388824,0.00030712754,0.00027613895,0.00013699624,0.00023296209,0.00013611458,0.00037268992],"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.0023714807,0.00012245399,0.9055486,0.00010281612,0.00007475667,0.00039891506,0.00044728722,0.00031338428,0.07486137,0.00008394112,0.00071164424,0.014963446],"study_design_scores_gemma":[0.0000046097143,0.00015247992,0.9986099,0.0000029221542,0.000012880809,0.00009362703,0.00013464419,0.00014014528,0.0006784532,0.0000117681075,0.00015646788,0.0000020897598],"about_ca_topic_score_codex":0.007876166,"about_ca_topic_score_gemma":0.022541827,"teacher_disagreement_score":0.007876166,"about_ca_system_score_codex":0.00018643345,"about_ca_system_score_gemma":0.00005927368,"threshold_uncertainty_score":0.015660644},"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":"review","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007568311,0.73398864,0.000700186,0.24864452,0.007956843,0.0000073105966,0.00004907384,0.00009794183,0.0077986205],"genre_scores_gemma":[0.012979005,0.80748624,0.0019932964,0.14336093,0.015825013,0.000027294962,0.00011883151,0.00013126244,0.018078122],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9980178,0.00062091986,0.00019030714,0.00024067632,0.0007204198,0.00020982494],"domain_scores_gemma":[0.9940183,0.002361142,0.00035013838,0.00025363662,0.0015871591,0.0014295737],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0055033914,0.0005987661,0.001025997,0.0013106838,0.001521694,0.0044425763,0.0009498513,0.0038724046,0.0062722825],"category_scores_gemma":[0.010401917,0.00030559968,0.00047859413,0.0013059406,0.004189264,0.0063747843,0.0021379204,0.011769865,0.0040211584],"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.0001801879,0.000055625213,0.00041906087,0.00086995505,0.000025141997,0.00041440368,0.0009721794,0.00010574794,0.0007492883,0.02644956,0.53845376,0.43130496],"study_design_scores_gemma":[0.000013667588,0.00006679814,0.00024493775,0.000839743,0.000008249369,0.00072122447,0.00034584588,0.0000439769,0.00011648391,0.008898734,0.98868436,0.000016060627],"about_ca_topic_score_codex":0.0048788427,"about_ca_topic_score_gemma":0.007782454,"teacher_disagreement_score":0.0062722825,"about_ca_system_score_codex":0.0031692644,"about_ca_system_score_gemma":0.0043691928,"threshold_uncertainty_score":0.029105008},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.64768547,0.0007327271,0.3110776,0.0005470406,0.00025988332,0.00032863737,0.0014196301,0.0035025897,0.03444637],"genre_scores_gemma":[0.8517231,0.00041785004,0.13493563,0.00015656829,0.00006357683,0.00019693653,0.0020913642,0.00037618895,0.010038798],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982888,0.00023929983,0.00012280505,0.0004447334,0.0004391871,0.00046519507],"domain_scores_gemma":[0.99737096,0.0008256206,0.0004433357,0.0007362582,0.000362004,0.00026180316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004132214,0.00061108253,0.0007380522,0.00074825686,0.0012693361,0.0014196377,0.0011146229,0.000645425,0.0058232383],"category_scores_gemma":[0.0038353775,0.00065627747,0.0011439343,0.0015554826,0.0014991538,0.0016536484,0.0017000093,0.0011465444,0.0011068254],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018671671,0.00023204405,0.010508902,0.0007097501,0.00014765197,0.0018491143,0.0018675615,0.48235267,0.11068704,0.19861637,0.012517403,0.17864434],"study_design_scores_gemma":[0.00026937944,0.00053104217,0.00744131,0.0000954621,0.000086059525,0.00085503026,0.0010842454,0.5971321,0.057644002,0.29781973,0.036866575,0.00017506252],"about_ca_topic_score_codex":0.011766005,"about_ca_topic_score_gemma":0.012251334,"teacher_disagreement_score":0.011766005,"about_ca_system_score_codex":0.0020804943,"about_ca_system_score_gemma":0.0010354123,"threshold_uncertainty_score":0.023395061},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010865302,0.0031448805,0.00085366867,0.003436237,0.001461997,0.00005733652,0.013759362,0.00063173746,0.97556823],"genre_scores_gemma":[0.0034910343,0.00082848826,0.00039536666,0.0004415036,0.000055889872,0.0000151504755,0.0023746311,0.00017022812,0.99222773],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.999534,0.000025652775,0.000010239598,0.00010570863,0.00021508876,0.000109343906],"domain_scores_gemma":[0.9990061,0.000059517213,0.000026444022,0.000056776287,0.00066796975,0.00018317632],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041597252,0.0011242696,0.0006477071,0.0012833158,0.0056814225,0.0051028267,0.001018127,0.0015343137,0.73490167],"category_scores_gemma":[0.0010009496,0.00046746325,0.00053318974,0.002337489,0.0007717895,0.0012706115,0.0012317178,0.0013670856,0.2620132],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.00003955595,0.000020969033,0.00032153164,0.00008500733,0.0000058567184,0.00009972106,0.0000665574,0.00013967637,0.0003218326,0.0056565185,0.9510752,0.042167533],"study_design_scores_gemma":[0.00000690853,0.000005023973,0.0007822696,0.00004658375,0.0000031366985,0.000042597283,0.000102361424,0.0001143896,0.00013407467,0.00034842986,0.99840647,0.0000076843735],"about_ca_topic_score_codex":0.83717525,"about_ca_topic_score_gemma":0.953326,"teacher_disagreement_score":0.73490167,"about_ca_system_score_codex":0.011308337,"about_ca_system_score_gemma":0.013678512,"threshold_uncertainty_score":0},"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":"editorial","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006902927,0.2169567,0.043474358,0.046477687,0.46974906,0.00028240634,0.0066237836,0.0023838936,0.20714912],"genre_scores_gemma":[0.038088568,0.19187471,0.029706713,0.0066380827,0.2763037,0.00023306451,0.017469931,0.00654409,0.43314108],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9970298,0.00026244993,0.00020844028,0.00058870146,0.0017543755,0.00015610443],"domain_scores_gemma":[0.992097,0.0018854459,0.0002953378,0.0010492916,0.0033749084,0.0012979995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023636837,0.0017034684,0.0022611248,0.0055058687,0.0017229739,0.00690258,0.0016033112,0.0014935462,0.089414604],"category_scores_gemma":[0.009267996,0.0008657649,0.0012292824,0.0052642445,0.0014803128,0.0041896896,0.0032784974,0.003803522,0.037086237],"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.000047890207,0.000030200117,0.0004950007,0.0006673354,0.00003984945,0.00006373652,0.00003707635,0.0006645398,0.00063238025,0.01053411,0.8969283,0.08985954],"study_design_scores_gemma":[0.000017891292,0.00004165376,0.0013474906,0.0004478329,0.00003148091,0.0004306878,0.00006424556,0.0012943271,0.0006114916,0.017678006,0.9780131,0.000021762604],"about_ca_topic_score_codex":0.0018137314,"about_ca_topic_score_gemma":0.0046193292,"teacher_disagreement_score":0.089414604,"about_ca_system_score_codex":0.0030556165,"about_ca_system_score_gemma":0.0038165818,"threshold_uncertainty_score":0.29912162},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81123525,0.0010214188,0.17212391,0.001629299,0.00008868161,0.00026493703,0.0020227102,0.003631831,0.00798186],"genre_scores_gemma":[0.9556412,0.0001344017,0.04137643,0.00015144993,0.000025356234,0.00009321087,0.0010668107,0.00031954472,0.0011916107],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99584645,0.00087055255,0.00026566844,0.00095690676,0.0010413458,0.0010190367],"domain_scores_gemma":[0.982614,0.010298765,0.0013475238,0.00389773,0.0010773571,0.00076466077],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023978893,0.0010969924,0.0012898498,0.0007246766,0.0013286177,0.0026517804,0.0041978084,0.0020076383,0.0036891778],"category_scores_gemma":[0.02174983,0.0011102421,0.00073263596,0.0015497338,0.002043883,0.0067509026,0.003207291,0.0012461012,0.00049660035],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017952975,0.00028994065,0.0072624693,0.00039197103,0.00014130145,0.0004940393,0.00037836653,0.9128907,0.012659015,0.015337209,0.0066530495,0.041706663],"study_design_scores_gemma":[0.00008654075,0.00014478467,0.0006374755,0.0000099518675,0.000050607807,0.00021118102,0.00018657715,0.9753982,0.0040581087,0.018042522,0.0011519925,0.000022147025],"about_ca_topic_score_codex":0.005789129,"about_ca_topic_score_gemma":0.009525684,"teacher_disagreement_score":0.005789129,"about_ca_system_score_codex":0.0019755927,"about_ca_system_score_gemma":0.00167656,"threshold_uncertainty_score":0.014334023},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007970592,0.00009584981,0.9817114,0.00014792949,0.00006320392,0.00007030515,0.0022999304,0.0042504123,0.003390334],"genre_scores_gemma":[0.16257302,0.0002894598,0.81904197,0.00017822527,0.00005833522,0.00047427826,0.010678755,0.0017325949,0.0049733073],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99926084,0.00008226273,0.00009260459,0.0001679945,0.00031048444,0.000085904074],"domain_scores_gemma":[0.9980276,0.00038463186,0.00017511017,0.00076332607,0.0005713399,0.00007791169],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006238635,0.00080927456,0.00083917764,0.0017725081,0.0006450754,0.002229168,0.0021398694,0.0011816572,0.014308555],"category_scores_gemma":[0.004789654,0.0005406435,0.0010654929,0.0030582673,0.00096058525,0.0051410547,0.0027934187,0.002198354,0.0051024393],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038013136,0.00014971524,0.0019799282,0.0006868621,0.00005510863,0.0002938618,0.00065940263,0.11511914,0.020599639,0.38424867,0.046803523,0.42902407],"study_design_scores_gemma":[0.0000672747,0.00021788139,0.00054808374,0.00012524119,0.000040565083,0.00042547233,0.00033426084,0.5976528,0.020536918,0.2859372,0.09402271,0.000091647635],"about_ca_topic_score_codex":0.0020286911,"about_ca_topic_score_gemma":0.0032897901,"teacher_disagreement_score":0.014308555,"about_ca_system_score_codex":0.000780231,"about_ca_system_score_gemma":0.0009040035,"threshold_uncertainty_score":0.04786682},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029241458,0.14297363,0.34989625,0.021046126,0.021973884,0.00017814519,0.0023533762,0.0022287567,0.4301084],"genre_scores_gemma":[0.30126095,0.12102366,0.24143769,0.0036717127,0.009911295,0.00020253408,0.004487193,0.002862429,0.31514257],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99841464,0.00023903689,0.00011795563,0.0003054271,0.0008662161,0.00005672336],"domain_scores_gemma":[0.9980254,0.0003726214,0.00011407897,0.00061426737,0.0006760848,0.00019747618],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013185613,0.0009448315,0.0011104345,0.0021646298,0.0012774068,0.0073130345,0.0009686231,0.00094407966,0.04826329],"category_scores_gemma":[0.0045066704,0.0007355374,0.0009444994,0.0022554111,0.0030714,0.0026330687,0.003062281,0.0033839955,0.012074415],"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.000104404215,0.000078270125,0.0035894602,0.0009190476,0.00017722769,0.0002416778,0.00031330838,0.008338402,0.0056922236,0.34763396,0.25730255,0.37560943],"study_design_scores_gemma":[0.000028174776,0.00007172204,0.005197098,0.00032360782,0.0001115743,0.0018581818,0.0002799057,0.016090738,0.0021475367,0.31611684,0.6577212,0.000053455056],"about_ca_topic_score_codex":0.0029385933,"about_ca_topic_score_gemma":0.005426053,"teacher_disagreement_score":0.04826329,"about_ca_system_score_codex":0.0013110221,"about_ca_system_score_gemma":0.0022810302,"threshold_uncertainty_score":0.16145676},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.847607,0.00025407784,0.13396159,0.00016032986,0.000024657827,0.00007464042,0.0009002851,0.0002560564,0.01676133],"genre_scores_gemma":[0.91748345,0.00024505358,0.0752455,0.00006945025,0.000013377511,0.00007981076,0.0020904199,0.000085151805,0.0046878406],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99983394,0.000021176646,0.00001331771,0.00004371534,0.00004104233,0.000046774287],"domain_scores_gemma":[0.99934214,0.00021274347,0.0001386671,0.000111727524,0.0001243177,0.00007032629],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011344664,0.00031416048,0.00033131085,0.0010154108,0.0005410753,0.001042168,0.00088097685,0.00040743,0.00278882],"category_scores_gemma":[0.00090987654,0.00023643725,0.00033700455,0.0012174387,0.0009049299,0.0012192351,0.00074681814,0.0004889787,0.0003745797],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00054023525,0.00013665188,0.01313359,0.00069308595,0.000047862628,0.0010642125,0.0019675172,0.072067134,0.076149225,0.7109849,0.005070892,0.11814473],"study_design_scores_gemma":[0.00004877703,0.00016179567,0.012068882,0.00013027467,0.00009878306,0.0017588214,0.0013333551,0.2671355,0.06492877,0.6193347,0.032904804,0.000095638505],"about_ca_topic_score_codex":0.0023318413,"about_ca_topic_score_gemma":0.0040859873,"teacher_disagreement_score":0.00278882,"about_ca_system_score_codex":0.0007229532,"about_ca_system_score_gemma":0.0004387027,"threshold_uncertainty_score":0.009329498},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9985507,0.00056287245,0.0000531625,0.000111340916,0.0000038184976,0.000014497204,0.00019480225,0.0000025849818,0.00050629565],"genre_scores_gemma":[0.9992151,0.0004893066,0.00006778535,0.000032688386,0.000009062931,0.0000064200503,0.000100259014,4.876462e-7,0.000078863544],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9995981,0.00007157961,0.00008424621,0.00007480076,0.00009552749,0.00007570833],"domain_scores_gemma":[0.9987112,0.00018133677,0.00081147917,0.000025522431,0.00011845247,0.00015195158],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002683728,0.00017178468,0.0002979596,0.0008870947,0.00053915964,0.00036951425,0.0001994625,0.0002474968,0.0018400652],"category_scores_gemma":[0.0011165311,0.00017241629,0.00021912278,0.00084958156,0.00032459706,0.00040116254,0.0003717044,0.0003263723,0.000110382534],"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.000026446862,0.00002819456,0.9971163,0.000033182994,0.000012624163,0.0003464483,0.00015137176,0.000028248389,0.00008591392,0.000017744684,0.00012849708,0.0020250708],"study_design_scores_gemma":[0.000002322075,0.00015439866,0.9969261,0.000028775306,0.000010370468,0.0015761509,0.0008471462,0.00009129306,0.000044664568,0.000022107317,0.00029120845,0.0000054243883],"about_ca_topic_score_codex":0.007069513,"about_ca_topic_score_gemma":0.0074040582,"teacher_disagreement_score":0.007069513,"about_ca_system_score_codex":0.00031871707,"about_ca_system_score_gemma":0.00047488144,"threshold_uncertainty_score":0.014056742},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003680092,0.004313248,0.00041119105,0.00612133,0.014242131,0.00014489338,0.0056274193,0.0012095338,0.96756214],"genre_scores_gemma":[0.00041075933,0.0010625534,0.00011752928,0.0008742389,0.00084075343,0.000029179924,0.0018117605,0.00015165027,0.99470156],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994443,0.000043416338,0.00003042794,0.00009179027,0.00031041887,0.00007970201],"domain_scores_gemma":[0.99860376,0.00014706586,0.00006284937,0.0001164026,0.0008048284,0.0002651074],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0006414861,0.001050556,0.00078304094,0.0017970445,0.0018266131,0.006060267,0.0013264593,0.0023131466,0.76189],"category_scores_gemma":[0.002179541,0.0004950711,0.00047783426,0.0021058295,0.0003550632,0.0025622183,0.0014552078,0.0018310804,0.71071386],"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.00001596769,0.00001288854,0.000036257978,0.00006225846,9.3451763e-7,0.000024686728,0.000014430269,0.000010728228,0.0000886176,0.0005144001,0.9732519,0.025967008],"study_design_scores_gemma":[0.0000029330101,0.0000039130064,0.0002017573,0.000032752672,7.519882e-7,0.00001605102,0.000018541137,0.000009076866,0.000022723858,0.00008745256,0.99960214,0.0000018642013],"about_ca_topic_score_codex":0.009870726,"about_ca_topic_score_gemma":0.020108437,"teacher_disagreement_score":0.76189,"about_ca_system_score_codex":0.0014511248,"about_ca_system_score_gemma":0.002122246,"threshold_uncertainty_score":0.339635},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014334032,0.12032607,0.0028818746,0.30372196,0.044592377,0.000060028466,0.00043434245,0.00031808522,0.5133313],"genre_scores_gemma":[0.08278288,0.018165164,0.0009062633,0.01290377,0.0029449363,0.000027250759,0.00009938318,0.00017464579,0.8819957],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99842286,0.00046765708,0.000034727098,0.00022745013,0.00047155604,0.00037575618],"domain_scores_gemma":[0.99869555,0.00042633538,0.00005763206,0.00004049195,0.00039735646,0.0003826682],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019424768,0.0006986667,0.0006056334,0.0011817433,0.007696718,0.0033440383,0.0006107061,0.0025888423,0.03656878],"category_scores_gemma":[0.003102175,0.00028377702,0.00025188708,0.0008837474,0.0022438895,0.0018857366,0.001888538,0.0034590075,0.0072661275],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.00007118706,0.000036374815,0.00075744814,0.00014670168,0.000010899027,0.0004643414,0.0044948803,0.00020483548,0.00023412768,0.13687307,0.7968317,0.059874397],"study_design_scores_gemma":[0.0000029703322,0.000006134069,0.00032351105,0.000059860766,0.0000012887292,0.00012535459,0.00064648886,0.00003724205,0.00009159662,0.0015653374,0.9971341,0.000006076955],"about_ca_topic_score_codex":0.07513348,"about_ca_topic_score_gemma":0.10868996,"teacher_disagreement_score":0.9248665,"about_ca_system_score_codex":0.0076729874,"about_ca_system_score_gemma":0.0062429835,"threshold_uncertainty_score":0.1493923},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12924111,0.008802016,0.6929549,0.026558822,0.0024936239,0.00061247626,0.007228103,0.009520436,0.122588575],"genre_scores_gemma":[0.4922432,0.003467261,0.42405388,0.0064354013,0.0027578387,0.0011602975,0.011779937,0.004132841,0.0539693],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9909972,0.0016320442,0.0006081359,0.0022395004,0.0028932495,0.0016297593],"domain_scores_gemma":[0.95780504,0.03233237,0.0012398646,0.005443732,0.0017843887,0.0013946089],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044776658,0.0038344664,0.003080293,0.0024972076,0.0029020235,0.008832089,0.007042419,0.0035195248,0.03384101],"category_scores_gemma":[0.03783918,0.0014098295,0.0034636226,0.004179822,0.0035775327,0.026323376,0.007872437,0.008869511,0.010985208],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.005736023,0.0012138181,0.009108391,0.0033954082,0.00062822277,0.0006700598,0.0015462645,0.11111798,0.021859732,0.3369477,0.14062159,0.3671547],"study_design_scores_gemma":[0.00040257865,0.0003120243,0.0015073235,0.00025488753,0.00030716526,0.00062623364,0.00043966636,0.27428097,0.008021127,0.6868383,0.026881842,0.00012790189],"about_ca_topic_score_codex":0.003644603,"about_ca_topic_score_gemma":0.007816004,"teacher_disagreement_score":0.03384101,"about_ca_system_score_codex":0.004969358,"about_ca_system_score_gemma":0.005246675,"threshold_uncertainty_score":0.113209486},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9661546,0.000091637456,0.02730608,0.000089503585,0.000007042399,0.000023635797,0.00010442038,0.000055942488,0.0061671515],"genre_scores_gemma":[0.9824473,0.00013561637,0.014512568,0.000035185083,0.000010752325,0.00002147775,0.00036019005,0.000023640267,0.0024531835],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998654,0.00001834419,0.000005470489,0.000041343126,0.000028848644,0.0000405651],"domain_scores_gemma":[0.9990658,0.000371972,0.0002489753,0.000079706566,0.000093070325,0.00014052556],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019361687,0.000332034,0.00018348412,0.0010995839,0.00074683706,0.0007153119,0.00042319373,0.00045575728,0.0019431231],"category_scores_gemma":[0.0013411561,0.00027165687,0.00031876416,0.0008198239,0.0008662851,0.00094126526,0.00065458403,0.000534684,0.00020400368],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034833635,0.00027445075,0.080008395,0.00027273185,0.000072917144,0.0025085884,0.0033458646,0.22052439,0.047743205,0.5676504,0.00552858,0.07172221],"study_design_scores_gemma":[0.00004261274,0.00023734444,0.03741434,0.00009812382,0.00009219524,0.001447528,0.0037135961,0.4540387,0.017006686,0.46915886,0.016692912,0.000057158697],"about_ca_topic_score_codex":0.0037671777,"about_ca_topic_score_gemma":0.005641684,"teacher_disagreement_score":0.0037671777,"about_ca_system_score_codex":0.00076513365,"about_ca_system_score_gemma":0.0002960604,"threshold_uncertainty_score":0.0074905157},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012679593,0.00030513405,0.9727787,0.00019439499,0.0003583606,0.0000852645,0.00027418716,0.006731842,0.006592568],"genre_scores_gemma":[0.304669,0.00066367537,0.6671696,0.0002434412,0.00013775365,0.0003274413,0.001662383,0.002346414,0.022780277],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997242,0.000063408545,0.00001838517,0.000041323496,0.0001256596,0.000027072505],"domain_scores_gemma":[0.9995264,0.00023261477,0.000028960489,0.00008526845,0.00009529363,0.000031452324],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058903696,0.0006496273,0.0006482175,0.00068759883,0.00043639657,0.0011475765,0.0012231149,0.0012116642,0.012585388],"category_scores_gemma":[0.0014674488,0.00049361936,0.00087737833,0.0004763576,0.000397343,0.0007661953,0.0013945013,0.001035175,0.0036378736],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036570823,0.00011046956,0.0016817054,0.00025720362,0.000095264695,0.00017533106,0.00017599498,0.55106807,0.028121276,0.0075154733,0.019999115,0.39043444],"study_design_scores_gemma":[0.000012047628,0.000011922779,0.00019006587,0.0000143703055,0.0000025082593,0.0000196913,0.000013582067,0.99167144,0.0016923473,0.0008857935,0.0054782815,0.000008002515],"about_ca_topic_score_codex":0.0052730036,"about_ca_topic_score_gemma":0.0059465887,"teacher_disagreement_score":0.012585388,"about_ca_system_score_codex":0.0004827004,"about_ca_system_score_gemma":0.00070018176,"threshold_uncertainty_score":0.042102337},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013459366,0.004397672,0.90308124,0.003195915,0.0008230339,0.00085401477,0.01019417,0.012386425,0.05160819],"genre_scores_gemma":[0.13709334,0.0056691873,0.7549174,0.0014665623,0.0005444356,0.0010207262,0.036886554,0.0027679086,0.059633914],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99781066,0.00034983177,0.00016201238,0.00085639424,0.00058330933,0.00023775767],"domain_scores_gemma":[0.9960742,0.0013665039,0.00023213169,0.0014438307,0.00070670794,0.00017663489],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010928316,0.0025050319,0.0016282721,0.0034609688,0.0018557371,0.0051077725,0.0037525713,0.0023284226,0.04269083],"category_scores_gemma":[0.008035039,0.0011628972,0.0022119377,0.005565909,0.00087698724,0.008899461,0.004051984,0.0029132126,0.02009164],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020121074,0.00031355533,0.0010555607,0.000888126,0.00015366088,0.00015956291,0.00029709324,0.04329686,0.0021676046,0.12543282,0.14014705,0.685887],"study_design_scores_gemma":[0.00013120972,0.00011010027,0.000580168,0.00020514124,0.00008493798,0.0004946856,0.00044310678,0.256994,0.0037286745,0.57470506,0.16247046,0.00005251766],"about_ca_topic_score_codex":0.0030929542,"about_ca_topic_score_gemma":0.003862815,"teacher_disagreement_score":0.04269083,"about_ca_system_score_codex":0.0022597893,"about_ca_system_score_gemma":0.0018413514,"threshold_uncertainty_score":0.14281511},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005460884,0.00003641186,0.9905261,0.000036793706,0.0000396141,0.00006552279,0.00010452324,0.000989116,0.002740998],"genre_scores_gemma":[0.082634404,0.00011572143,0.91318065,0.000044683267,0.00001649616,0.00016063909,0.0005703531,0.00065114914,0.0026258873],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995654,0.00006974603,0.00002833271,0.000054269698,0.00025357454,0.000028627319],"domain_scores_gemma":[0.9994025,0.00023521294,0.00003499447,0.00019441346,0.00011013091,0.000022739632],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045249678,0.00047803405,0.0006684937,0.0008863258,0.00033835066,0.00081993564,0.000993679,0.00049441186,0.0070499224],"category_scores_gemma":[0.0019599325,0.0004942832,0.0009859796,0.00051730353,0.0005902236,0.0005999088,0.001969909,0.0011219527,0.0019585553],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014324037,0.000047569374,0.0011990214,0.00043833474,0.000050975726,0.00046651528,0.00070849847,0.45672312,0.048432518,0.09457793,0.0087184105,0.38849387],"study_design_scores_gemma":[0.00002898326,0.000029719035,0.00025555928,0.000042369335,0.0000071698864,0.00018943689,0.00007628852,0.9468952,0.010682968,0.021586698,0.020183397,0.000022148206],"about_ca_topic_score_codex":0.0012876274,"about_ca_topic_score_gemma":0.0018264392,"teacher_disagreement_score":0.0070499224,"about_ca_system_score_codex":0.00043285568,"about_ca_system_score_gemma":0.00058834406,"threshold_uncertainty_score":0.023584306},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43900844,0.008942481,0.46832106,0.0025741458,0.00068153976,0.00052408635,0.0031374816,0.0023437028,0.07446711],"genre_scores_gemma":[0.8100769,0.0023760765,0.16962406,0.0004900081,0.0003514376,0.00035268627,0.0029638794,0.00041095485,0.013353959],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99764675,0.00052726956,0.00018773643,0.0006526174,0.00049617776,0.0004893483],"domain_scores_gemma":[0.9941713,0.003077717,0.0005840533,0.0013561941,0.00040727554,0.00040333916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087830145,0.001203616,0.0024544846,0.0017484374,0.001948124,0.0039423946,0.002775258,0.0021980351,0.013165004],"category_scores_gemma":[0.011614964,0.0011113156,0.0011399504,0.0049810903,0.0012538139,0.005049114,0.0033714543,0.0013076178,0.002522949],"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.003656108,0.0007020162,0.0077222344,0.0015508679,0.00045988022,0.0013297353,0.0015966801,0.4532504,0.021648934,0.1738635,0.045549672,0.2886701],"study_design_scores_gemma":[0.0002530557,0.0005764585,0.0023676509,0.00018551633,0.00012574541,0.0010562164,0.0010389616,0.76472247,0.01714982,0.17828235,0.03415819,0.00008363168],"about_ca_topic_score_codex":0.0028601002,"about_ca_topic_score_gemma":0.0019097314,"teacher_disagreement_score":0.013165004,"about_ca_system_score_codex":0.0022672368,"about_ca_system_score_gemma":0.0007846551,"threshold_uncertainty_score":0.044041276},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009445439,0.018961005,0.10800296,0.012969,0.039080035,0.00066341844,0.007887475,0.008087014,0.7949036],"genre_scores_gemma":[0.012688849,0.009402585,0.018053485,0.00043992247,0.0014378508,0.00006656872,0.0047059827,0.0013208762,0.951884],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99941516,0.00005494537,0.000020011148,0.0000888993,0.00030409748,0.00011693585],"domain_scores_gemma":[0.9981833,0.00013590121,0.000025708297,0.00023419852,0.0010312826,0.0003895195],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011834437,0.001272401,0.0015595342,0.0011809455,0.0016170902,0.0047762017,0.0014658483,0.0007275656,0.23121464],"category_scores_gemma":[0.0015930778,0.000478674,0.0007043029,0.0015728747,0.000949185,0.0011513974,0.0018634275,0.0024686803,0.11063849],"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.00016354682,0.00010415944,0.00038252998,0.000095035524,0.00002780125,0.00005619575,0.000054886015,0.00094300404,0.0015442054,0.006893131,0.8472377,0.14249791],"study_design_scores_gemma":[0.000042592375,0.000044835364,0.0010797768,0.000074281284,0.000023375473,0.00010112491,0.000081785816,0.0066311024,0.0025321054,0.004019589,0.98534644,0.000023033708],"about_ca_topic_score_codex":0.09518517,"about_ca_topic_score_gemma":0.2320362,"teacher_disagreement_score":0.23121464,"about_ca_system_score_codex":0.0034701878,"about_ca_system_score_gemma":0.0070218327,"threshold_uncertainty_score":0.7734901},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03487766,0.012457602,0.0026711405,0.044510618,0.0235462,0.00074366137,0.16644797,0.00087183947,0.71387315],"genre_scores_gemma":[0.013610479,0.0039313245,0.00092539075,0.0010063926,0.0007554804,0.00029830073,0.011081615,0.0002586674,0.96813244],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.998793,0.00013703364,0.00006758061,0.000083887455,0.0006711992,0.00024724865],"domain_scores_gemma":[0.99658394,0.0003290513,0.00021715224,0.00021966711,0.0019680667,0.0006820833],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016733356,0.0006048662,0.0004067935,0.0042365673,0.00256837,0.0014895975,0.0005985284,0.00079949753,0.05998684],"category_scores_gemma":[0.005557217,0.00042840443,0.0002860378,0.0028247517,0.00076746533,0.0009701567,0.0020147562,0.0012422719,0.020035656],"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.00002393567,0.000020722699,0.0020126,0.000067186316,0.000002765602,0.000039522158,0.0002931375,0.00006632591,0.00010483606,0.0014568892,0.9787522,0.017160082],"study_design_scores_gemma":[0.0000021547712,0.000009908715,0.013277125,0.000083392224,0.0000033080069,0.00004020235,0.0008600012,0.000036887035,0.00017061371,0.00019071419,0.98531634,0.000009350772],"about_ca_topic_score_codex":0.08505449,"about_ca_topic_score_gemma":0.21353869,"teacher_disagreement_score":0.08505449,"about_ca_system_score_codex":0.0017824457,"about_ca_system_score_gemma":0.008569638,"threshold_uncertainty_score":0.20067596},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7111513,0.049725927,0.0011738735,0.004282976,0.0033731826,0.00013265162,0.004956546,0.00019160948,0.22501196],"genre_scores_gemma":[0.90307903,0.022993153,0.0027663836,0.0005383687,0.0012550289,0.00014617751,0.0039515463,0.0004015824,0.06486871],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9953945,0.0016284877,0.00055088534,0.0006834916,0.001286007,0.00045646398],"domain_scores_gemma":[0.9874378,0.004006977,0.0016326692,0.001243141,0.0050827865,0.0005966135],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0062320833,0.00050461025,0.00044601125,0.0076002316,0.0020938285,0.0032301378,0.0007297157,0.00042087343,0.006556844],"category_scores_gemma":[0.014082046,0.0002490273,0.00021034709,0.009023557,0.0024910565,0.0010610486,0.0018063629,0.00069298735,0.002892227],"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.0011252837,0.000105224455,0.05498581,0.0038332965,0.0000831948,0.0048685493,0.3704187,0.0007062055,0.0068844147,0.04448357,0.11184371,0.40066203],"study_design_scores_gemma":[0.000046157602,0.0000938581,0.14954239,0.0013035593,0.000037321075,0.0011721724,0.055949323,0.00018386009,0.0017513402,0.0013494052,0.7885126,0.000057961995],"about_ca_topic_score_codex":0.0135468105,"about_ca_topic_score_gemma":0.016836442,"teacher_disagreement_score":0.0135468105,"about_ca_system_score_codex":0.0056377156,"about_ca_system_score_gemma":0.002715976,"threshold_uncertainty_score":0.0409047},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012853353,0.0010744982,0.0009001821,0.025185866,0.016970675,0.00016950567,0.0015388922,0.0015297667,0.9513452],"genre_scores_gemma":[0.004356523,0.0003204111,0.0004197458,0.0036731078,0.0011940909,0.00004797468,0.00040284972,0.00027709763,0.9893083],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99907637,0.000114457944,0.000039893912,0.00017555399,0.00042132175,0.00017230514],"domain_scores_gemma":[0.9956014,0.00043823503,0.00021251325,0.00024401667,0.0021991301,0.0013045953],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0009352446,0.0008766017,0.00060432276,0.0010552277,0.003857624,0.0033834695,0.0007824602,0.002375156,0.7453298],"category_scores_gemma":[0.005706808,0.00047983893,0.00032861717,0.0008919881,0.0005554784,0.0023135738,0.0027602057,0.0024610257,0.5010586],"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.000017942886,0.000014462352,0.0001016621,0.000017065015,6.594033e-7,0.000019431105,0.000051063027,0.000010850029,0.000055340024,0.0006717321,0.98511004,0.013929641],"study_design_scores_gemma":[0.000005584634,0.000009083976,0.00019126569,0.00001477845,8.8719923e-7,0.00003779457,0.00014591069,0.000024117693,0.00006497975,0.00028773592,0.9992143,0.0000035162038],"about_ca_topic_score_codex":0.0059613967,"about_ca_topic_score_gemma":0.013330678,"teacher_disagreement_score":0.2546702,"about_ca_system_score_codex":0.0012476399,"about_ca_system_score_gemma":0.0015637759,"threshold_uncertainty_score":0.3632561},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036858477,0.05649319,0.011447227,0.1485552,0.0034912385,0.000047681475,0.00046663074,0.000511161,0.7421292],"genre_scores_gemma":[0.43466,0.020810094,0.004858132,0.007261346,0.0011366399,0.00009270417,0.0002269282,0.00050278974,0.53045136],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9969309,0.0014222712,0.000074155716,0.00028407932,0.00082756154,0.00046110226],"domain_scores_gemma":[0.9966453,0.0015975302,0.0002189371,0.00025356925,0.0009030601,0.00038160445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036634528,0.0007687565,0.0005239165,0.0012487486,0.013998466,0.009829471,0.0012542336,0.002600365,0.035951186],"category_scores_gemma":[0.007763367,0.00034928272,0.00026237237,0.0016257423,0.017178167,0.0034227495,0.002930745,0.006606356,0.0045401575],"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.000060113398,0.000036855174,0.0013747608,0.00021916926,0.000010068525,0.00039014415,0.051197335,0.00043514208,0.00067457784,0.72161967,0.14264636,0.08133593],"study_design_scores_gemma":[0.000004545889,0.0000048690845,0.0010070455,0.0001347033,0.0000016250316,0.00012849456,0.0055327876,0.00015850506,0.00018514956,0.011030889,0.9817994,0.000012005548],"about_ca_topic_score_codex":0.49204248,"about_ca_topic_score_gemma":0.61131805,"teacher_disagreement_score":0.49204248,"about_ca_system_score_codex":0.02657112,"about_ca_system_score_gemma":0.019508269,"threshold_uncertainty_score":0.97835696},"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":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0135637205,0.08216588,0.008234944,0.33667958,0.005846719,0.00012149103,0.00023311478,0.000096297415,0.5530582],"genre_scores_gemma":[0.5651362,0.05093272,0.008590392,0.07097585,0.004206162,0.0007590757,0.0002708522,0.00021408242,0.29891458],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9893477,0.007671886,0.000300821,0.0007238179,0.0011356005,0.0008201404],"domain_scores_gemma":[0.99134666,0.0063511194,0.00044576824,0.000416569,0.00089266803,0.0005472042],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.015334898,0.00063689833,0.00052472536,0.0021573512,0.0044351653,0.014682531,0.002279493,0.013544179,0.011708803],"category_scores_gemma":[0.013107177,0.00038310693,0.00036295407,0.0060679815,0.019154612,0.013902314,0.0045988834,0.006835337,0.0015082698],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001471851,0.00001025323,0.00013352859,0.000115695984,0.0000016483156,0.00006264294,0.0051362757,0.00013724572,0.000018182249,0.9535528,0.031128373,0.00968866],"study_design_scores_gemma":[0.000015794449,0.0000229086,0.0009283184,0.00083508785,0.00000440117,0.000093019305,0.008198876,0.00029121045,0.00015081657,0.0894904,0.8999464,0.000022791253],"about_ca_topic_score_codex":0.03409542,"about_ca_topic_score_gemma":0.024929859,"teacher_disagreement_score":0.03409542,"about_ca_system_score_codex":0.022387851,"about_ca_system_score_gemma":0.013494575,"threshold_uncertainty_score":0.16243595},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40397954,0.00023740261,0.57556134,0.00024124075,0.000024990595,0.00043858754,0.000236672,0.0008144112,0.018465867],"genre_scores_gemma":[0.827434,0.00013501543,0.16677752,0.00005508897,0.000008034382,0.00027715124,0.00033227445,0.00016300201,0.0048178374],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991493,0.00027989244,0.000050491675,0.00017467732,0.00018073748,0.00016491732],"domain_scores_gemma":[0.9965917,0.0022967837,0.00027450197,0.00035244838,0.0002228219,0.0002617109],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009821198,0.0009099004,0.0008266073,0.0010894082,0.0009124481,0.0015729078,0.0013879852,0.0011457786,0.003423955],"category_scores_gemma":[0.007537162,0.00057077385,0.0009015005,0.0006158345,0.0012631274,0.0027680655,0.0023311146,0.0007544021,0.00046041847],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00052786287,0.00026222077,0.0051896693,0.0003257563,0.00012150002,0.00047443275,0.001955995,0.7272646,0.0084757535,0.14435959,0.002663735,0.10837889],"study_design_scores_gemma":[0.00004147116,0.00018214798,0.0006546524,0.00003097814,0.000032422326,0.00016210931,0.00044966897,0.9398692,0.0030775946,0.05278615,0.002691761,0.000021932165],"about_ca_topic_score_codex":0.0041456963,"about_ca_topic_score_gemma":0.0054483605,"teacher_disagreement_score":0.0041456963,"about_ca_system_score_codex":0.0010494395,"about_ca_system_score_gemma":0.0011952644,"threshold_uncertainty_score":0.011454284},"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":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.542489,0.0011255348,0.44304824,0.0005517354,0.000094007075,0.00028324005,0.0002184689,0.0010460751,0.011143714],"genre_scores_gemma":[0.83465654,0.0003941816,0.16119292,0.00014856359,0.000019001202,0.00017650779,0.00018564588,0.00006211353,0.0031644702],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99947757,0.00012655114,0.00003875167,0.00013216423,0.00011653446,0.000108533946],"domain_scores_gemma":[0.9995833,0.00016679663,0.00007685149,0.000023911623,0.0001185628,0.00003062666],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000852325,0.0010447995,0.0009927824,0.0010035062,0.00048898754,0.0011350607,0.00078718347,0.0009180925,0.0014445322],"category_scores_gemma":[0.0014844602,0.00046513657,0.00092824735,0.00087871164,0.00027978545,0.0005777816,0.00073994027,0.00048761052,0.00019730594],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004939201,0.0006716186,0.015657691,0.0004728093,0.00021907582,0.0006658521,0.00055790384,0.6417924,0.033595297,0.002413253,0.0018382678,0.30162197],"study_design_scores_gemma":[0.000024034847,0.00036703315,0.0040645427,0.00002231211,0.00014246513,0.000066549685,0.0002488219,0.9881891,0.0047180834,0.000636179,0.0014955156,0.000025444417],"about_ca_topic_score_codex":0.012471392,"about_ca_topic_score_gemma":0.015457034,"teacher_disagreement_score":0.012471392,"about_ca_system_score_codex":0.0005537663,"about_ca_system_score_gemma":0.0012791619,"threshold_uncertainty_score":0.024797559},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9944805,0.000892465,0.000024831226,0.0017199392,0.00001993459,0.000015590418,0.0009893328,0.0000042001675,0.0018531365],"genre_scores_gemma":[0.9988764,0.0003552772,0.00003361459,0.00016768806,0.000011403254,0.000010276804,0.00031064867,0.000001326738,0.0002334381],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9992434,0.00019133567,0.00007424668,0.000053297386,0.00014303304,0.00029472334],"domain_scores_gemma":[0.9981193,0.00019935147,0.00044079503,0.000029584533,0.00033570555,0.00087529566],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064145157,0.00015078665,0.0002960655,0.0008403127,0.00057569187,0.0009116117,0.00038855898,0.0006996295,0.0031119625],"category_scores_gemma":[0.004327578,0.0001487179,0.00060064544,0.0014479038,0.00025348918,0.0007119862,0.001243885,0.0005577371,0.0002930765],"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.0003060424,0.0003223734,0.96188384,0.00007765687,0.00012868026,0.00027756076,0.00070864777,0.00024339264,0.00013824823,0.00015379625,0.0025276223,0.033232182],"study_design_scores_gemma":[0.000016221438,0.0001217958,0.9964965,0.00006375776,0.00004539455,0.000115187766,0.0021112089,0.00031052122,0.000024758408,0.00013877,0.00054758054,0.000008343696],"about_ca_topic_score_codex":0.059325248,"about_ca_topic_score_gemma":0.109906584,"teacher_disagreement_score":0.059325248,"about_ca_system_score_codex":0.0013519233,"about_ca_system_score_gemma":0.0015495525,"threshold_uncertainty_score":0.11795986},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00046522016,0.00020046419,0.0014023796,0.0006886388,0.0009240747,0.000045216915,0.003798034,0.0027750821,0.9897009],"genre_scores_gemma":[0.0014190883,0.00013331322,0.00034021403,0.00013448046,0.000082043975,0.000014929283,0.0021228627,0.00067557924,0.99507743],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99966466,0.000038068898,0.000015183194,0.000077963465,0.00014638044,0.000057780486],"domain_scores_gemma":[0.9990447,0.000085744236,0.000030672894,0.00016691785,0.0003145734,0.0003573394],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00050894567,0.0007285158,0.0004871812,0.0011415107,0.0015850503,0.0047539813,0.000916932,0.001591623,0.92116344],"category_scores_gemma":[0.0014978987,0.00035370424,0.00043685336,0.0014641506,0.00040603668,0.0021319655,0.002400358,0.0011831467,0.8601304],"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.000057827918,0.00002974303,0.00015254834,0.00006444327,0.000002566704,0.000056590034,0.000050892602,0.00007231179,0.0007236606,0.004403804,0.9159019,0.07848382],"study_design_scores_gemma":[0.0000070209667,0.0000131500465,0.0002964241,0.00003444969,0.0000012724032,0.0000393154,0.00004748298,0.00010557128,0.00015844393,0.00055107096,0.9987419,0.0000038558],"about_ca_topic_score_codex":0.0046232888,"about_ca_topic_score_gemma":0.0094903335,"teacher_disagreement_score":0.07883656,"about_ca_system_score_codex":0.00094643974,"about_ca_system_score_gemma":0.0007623992,"threshold_uncertainty_score":0},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00090448593,0.000084043444,0.00078316045,0.000411897,0.00035539654,0.00010249857,0.0010813201,0.004294194,0.991983],"genre_scores_gemma":[0.0017335201,0.000054054763,0.0002404546,0.00016421522,0.000049982424,0.000027806253,0.000476736,0.0005094044,0.9967438],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996276,0.000026317251,0.0000120125105,0.00008085862,0.00017230964,0.00008089148],"domain_scores_gemma":[0.99859565,0.00016404482,0.000051882394,0.00025563117,0.0005222121,0.0004104701],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00029331577,0.0010780329,0.0006274493,0.0010107037,0.0017542344,0.0029335916,0.0010803835,0.001871205,0.9478883],"category_scores_gemma":[0.0021453234,0.00056364795,0.0005779237,0.0006149726,0.00034238628,0.002164152,0.001474956,0.0012181642,0.9087936],"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.00004156971,0.00007544823,0.0002905502,0.0000324753,0.000002422702,0.000067129244,0.000026529236,0.00003822284,0.00085485535,0.0007128923,0.95894027,0.038917616],"study_design_scores_gemma":[0.000028540373,0.00006510348,0.0014015954,0.000052073003,0.0000049900937,0.00016386474,0.000072219846,0.00020812481,0.00087705336,0.00028325093,0.9968309,0.000012170387],"about_ca_topic_score_codex":0.004868214,"about_ca_topic_score_gemma":0.007827956,"teacher_disagreement_score":0.052111685,"about_ca_system_score_codex":0.0006659107,"about_ca_system_score_gemma":0.0007643943,"threshold_uncertainty_score":0.074330986},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048091635,0.008757736,0.000985914,0.033621304,0.0046559824,0.00033968437,0.0063360375,0.0010047704,0.8962069],"genre_scores_gemma":[0.07877202,0.0041581816,0.0018276133,0.02132983,0.00095480314,0.00020568701,0.0032093055,0.00032427412,0.8892183],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993025,0.000057108522,0.00003080533,0.00025005406,0.00014589168,0.00021353955],"domain_scores_gemma":[0.9991417,0.0000467973,0.000046889236,0.000049978018,0.00021412344,0.00050046435],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00037272737,0.000968738,0.00046803177,0.0010533289,0.004914228,0.002155896,0.0011291357,0.0024254115,0.45484194],"category_scores_gemma":[0.0012674188,0.00047353032,0.00046240588,0.000868823,0.0009030057,0.0015809453,0.0024278252,0.0025010519,0.15511253],"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.0006952929,0.0007412529,0.04702054,0.00039558375,0.000085139545,0.011341843,0.0010020059,0.00022270992,0.0026123424,0.010800117,0.60042727,0.32465586],"study_design_scores_gemma":[0.00025779151,0.00034380247,0.054142404,0.00080629176,0.00003924324,0.0078299735,0.0018954092,0.0004337615,0.0006995608,0.0047066747,0.9287517,0.00009342406],"about_ca_topic_score_codex":0.040253587,"about_ca_topic_score_gemma":0.15330993,"teacher_disagreement_score":0.545158,"about_ca_system_score_codex":0.0045507923,"about_ca_system_score_gemma":0.0053597796,"threshold_uncertainty_score":0.7776018},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19837591,0.009796325,0.45621714,0.005398232,0.0013878768,0.00012857515,0.0017245224,0.0023281928,0.32464322],"genre_scores_gemma":[0.8278097,0.0067136334,0.112575166,0.00066670217,0.0004822337,0.00017976125,0.0009095043,0.0004230786,0.050240133],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997596,0.00006352688,0.000015889145,0.00006465572,0.000059570513,0.00003671545],"domain_scores_gemma":[0.9996227,0.000118429256,0.00010965343,0.000047432484,0.000027985834,0.000073787574],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025400572,0.00068887026,0.00061213906,0.00087316136,0.00069572224,0.003077594,0.0011436212,0.0019257923,0.037502687],"category_scores_gemma":[0.0006833167,0.00054472574,0.0007181721,0.0009884321,0.0012953762,0.0013501046,0.0011827495,0.0007961528,0.0075990306],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024295558,0.00018565179,0.007777797,0.00048158452,0.00010633162,0.00081205764,0.000330814,0.5744335,0.007171993,0.30001655,0.017572442,0.09086824],"study_design_scores_gemma":[0.000045328143,0.00007463248,0.0009382894,0.00011548396,0.000027348584,0.00046251377,0.00037397342,0.76875967,0.0014781735,0.1897746,0.03791547,0.000034536493],"about_ca_topic_score_codex":0.0052869506,"about_ca_topic_score_gemma":0.0042262804,"teacher_disagreement_score":0.037502687,"about_ca_system_score_codex":0.0013630476,"about_ca_system_score_gemma":0.00081428594,"threshold_uncertainty_score":0.12545896},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008260652,0.0073584267,0.94647545,0.0017202102,0.0005151558,0.00030445354,0.0043939636,0.015545475,0.0154261235],"genre_scores_gemma":[0.06067467,0.0051449304,0.9105361,0.00067371374,0.00027469042,0.0005075942,0.010256932,0.0034553392,0.008476063],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9980578,0.00030811137,0.00022193443,0.00037067913,0.0008145874,0.00022689886],"domain_scores_gemma":[0.99589264,0.0016767249,0.0001986766,0.0015599697,0.00053150015,0.00014057117],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017992406,0.0030366455,0.0025656924,0.0074078436,0.0023130553,0.0023619663,0.004766999,0.0023713196,0.030835472],"category_scores_gemma":[0.01226578,0.0037056506,0.0033069912,0.009954283,0.0024220657,0.009049202,0.005567934,0.0041491822,0.020352812],"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.0004888575,0.00012887457,0.0020742572,0.00047877053,0.00018117191,0.00016581092,0.00051233516,0.022703482,0.0033804285,0.04592479,0.20349461,0.7204667],"study_design_scores_gemma":[0.0004614813,0.00019956421,0.0034132395,0.00033482542,0.0003454058,0.0011056281,0.0005839615,0.21483298,0.017042533,0.47211185,0.289163,0.00040558178],"about_ca_topic_score_codex":0.014161804,"about_ca_topic_score_gemma":0.02090372,"teacher_disagreement_score":0.030835472,"about_ca_system_score_codex":0.0018045221,"about_ca_system_score_gemma":0.0025165118,"threshold_uncertainty_score":0.10315496},"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":"dataset","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006714107,0.00047238264,0.0004661736,0.00042565863,0.00009255028,0.00048791204,0.99184656,0.00010649628,0.0054308646],"genre_scores_gemma":[0.010718256,0.0025504504,0.004914434,0.0007267227,0.00010768023,0.0026751189,0.9703361,0.00021572893,0.007755465],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9884526,0.00072179816,0.0016906501,0.0008095124,0.007298178,0.0010271621],"domain_scores_gemma":[0.94146293,0.0043652966,0.0030186009,0.0024527737,0.046638336,0.0020620576],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0047271126,0.001808801,0.0027072218,0.024608038,0.0030964848,0.0027838105,0.0067008506,0.0011474966,0.06832052],"category_scores_gemma":[0.047333863,0.0010572794,0.0017624737,0.040388495,0.0009356653,0.0011226347,0.0022723533,0.0026575727,0.014491507],"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.00015258673,0.000056402092,0.012275131,0.0024842862,0.00013791636,0.000114058865,0.00018056038,0.0013562178,0.00006626077,0.002298857,0.9545039,0.026373828],"study_design_scores_gemma":[0.00031270966,0.000031003427,0.056427278,0.002936617,0.00031268664,0.00019391158,0.0009006729,0.0011926795,0.00043892444,0.0030766665,0.9339977,0.00017922382],"about_ca_topic_score_codex":0.9726327,"about_ca_topic_score_gemma":0.9791268,"teacher_disagreement_score":0.9316795,"about_ca_system_score_codex":0.03238897,"about_ca_system_score_gemma":0.09965616,"threshold_uncertainty_score":0.23499954},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017945904,0.0009723244,0.9447782,0.0013144587,0.00021152833,0.00007202519,0.00008047959,0.00044234743,0.03418273],"genre_scores_gemma":[0.38379437,0.0029304328,0.5898073,0.0011252019,0.00038322352,0.00037768864,0.00046938533,0.0014334872,0.019678988],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99447757,0.0018761441,0.00023850448,0.00045909936,0.00265594,0.00029276154],"domain_scores_gemma":[0.9917252,0.003342254,0.0004216775,0.0032778827,0.0009004584,0.0003324869],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004428273,0.0011684408,0.0014411577,0.0018692272,0.0029184571,0.0023871514,0.0020863772,0.0016802344,0.0067207958],"category_scores_gemma":[0.018123236,0.00085309934,0.0014226408,0.0014981498,0.0064674225,0.0065848418,0.009204781,0.0053172745,0.0022548544],"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.000049795177,0.00003324047,0.00043144036,0.00016899974,0.000021436705,0.000091280235,0.00039097937,0.04287919,0.001537922,0.90568006,0.0023517013,0.046363965],"study_design_scores_gemma":[0.000016287639,0.000038907958,0.0001330513,0.00006773861,0.000010521337,0.00013799357,0.00008402171,0.11581876,0.0016459058,0.8683433,0.013682442,0.000021034193],"about_ca_topic_score_codex":0.00089877227,"about_ca_topic_score_gemma":0.0008992708,"teacher_disagreement_score":0.0067207958,"about_ca_system_score_codex":0.0013797219,"about_ca_system_score_gemma":0.0010892614,"threshold_uncertainty_score":0.023419201},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15672271,0.001444139,0.5469205,0.011391918,0.0015312344,0.00054107304,0.010656059,0.0031876587,0.2676047],"genre_scores_gemma":[0.7338589,0.0013491994,0.1423546,0.001047323,0.00030390924,0.0003329586,0.0076906607,0.00027601694,0.11278649],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99940336,0.00004678831,0.000022174789,0.0001876678,0.00016378515,0.00017617422],"domain_scores_gemma":[0.99915314,0.00024128513,0.000061286344,0.00019217475,0.00025409897,0.000098015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003044069,0.0005795714,0.00055088743,0.00037779458,0.0014283165,0.0023620427,0.0016118576,0.0014927322,0.03439459],"category_scores_gemma":[0.002417627,0.00033370257,0.00040499985,0.0011356599,0.0007477258,0.0027805124,0.0015161537,0.00092380535,0.0068580015],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013345232,0.00021508575,0.007326346,0.00039638803,0.00011499049,0.0029765358,0.0007432754,0.14663257,0.0078032855,0.5369602,0.16140498,0.13409193],"study_design_scores_gemma":[0.00022244376,0.00014301827,0.0011682189,0.000078653895,0.000049713184,0.0013076594,0.0009343593,0.42073596,0.0061723446,0.33541268,0.23371191,0.00006310189],"about_ca_topic_score_codex":0.005280422,"about_ca_topic_score_gemma":0.0075673433,"teacher_disagreement_score":0.03439459,"about_ca_system_score_codex":0.0009522335,"about_ca_system_score_gemma":0.0011799217,"threshold_uncertainty_score":0.1150614},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6944021,0.0022473887,0.25007886,0.0024905058,0.000109475666,0.000155833,0.00059099135,0.000272523,0.049652282],"genre_scores_gemma":[0.8935638,0.0016317674,0.09662036,0.000362908,0.0003186681,0.00029418967,0.0012381442,0.00013058323,0.00583964],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983461,0.00044920575,0.00015454162,0.0003824692,0.00039010294,0.0002775175],"domain_scores_gemma":[0.9694462,0.025153732,0.0017582304,0.0012688775,0.0013796836,0.000993297],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027490454,0.0006890226,0.0016318533,0.002325053,0.0025325106,0.0028305976,0.0018596957,0.0026385866,0.0070506535],"category_scores_gemma":[0.018731255,0.0012494392,0.0012389147,0.0018922602,0.0048539657,0.007215767,0.0045667943,0.0021672403,0.00101579],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0027545406,0.00037539657,0.038968883,0.0009746216,0.00019203723,0.0033270332,0.0036525754,0.061751947,0.02028067,0.75521624,0.008998124,0.10350798],"study_design_scores_gemma":[0.00036080263,0.001214926,0.01506004,0.0008112579,0.000279785,0.0044763037,0.0035717213,0.3185187,0.028000936,0.60673654,0.020720199,0.00024890763],"about_ca_topic_score_codex":0.0008630509,"about_ca_topic_score_gemma":0.00053664943,"teacher_disagreement_score":0.0070506535,"about_ca_system_score_codex":0.0009949603,"about_ca_system_score_gemma":0.000536643,"threshold_uncertainty_score":0.02358681},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12798667,0.0009581769,0.85033524,0.00038670728,0.00006847415,0.00041846256,0.0013798042,0.00810299,0.0103635155],"genre_scores_gemma":[0.33887777,0.0002503173,0.654992,0.00016929823,0.0000299709,0.0003945944,0.0022305879,0.00033324794,0.0027221602],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99765044,0.0005461219,0.00041632078,0.00046717474,0.0006977023,0.000222125],"domain_scores_gemma":[0.99457693,0.0022563783,0.00047741778,0.0016805618,0.0008678481,0.00014080942],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014954046,0.000641638,0.0013424123,0.0032278125,0.00089968933,0.0021257813,0.0022371206,0.0013821976,0.0048500565],"category_scores_gemma":[0.012013574,0.0006078097,0.0009804943,0.005795758,0.0007992671,0.0042079804,0.0033232889,0.00070272136,0.0024706044],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017976656,0.0003916724,0.01478337,0.00083812606,0.00028267526,0.0005185242,0.0011539019,0.16230895,0.019718137,0.051105887,0.021308614,0.72579235],"study_design_scores_gemma":[0.00027154956,0.00052100705,0.002502321,0.000091951195,0.00008113767,0.0016273756,0.00074822764,0.9136468,0.023508547,0.03919336,0.017691396,0.000116399715],"about_ca_topic_score_codex":0.0026757454,"about_ca_topic_score_gemma":0.0029368822,"teacher_disagreement_score":0.0048500565,"about_ca_system_score_codex":0.00060786295,"about_ca_system_score_gemma":0.0010468918,"threshold_uncertainty_score":0.01622504},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08413739,0.0032557647,0.8732632,0.0011830012,0.0002451627,0.00029276003,0.0030605663,0.015652452,0.018909793],"genre_scores_gemma":[0.52182364,0.001618611,0.45592365,0.0006091424,0.00017238686,0.00036706278,0.006568768,0.0011991324,0.011717579],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960639,0.0004909722,0.00041332276,0.0009919108,0.0014819927,0.00055795757],"domain_scores_gemma":[0.9868527,0.0019599972,0.00092785596,0.008459306,0.0013983271,0.00040189407],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017558284,0.00093382434,0.001527896,0.0019833313,0.0011113457,0.003609465,0.007981242,0.0013785536,0.008380121],"category_scores_gemma":[0.011867522,0.00090609293,0.0009813379,0.005602256,0.0009956022,0.01120498,0.0069035995,0.002012922,0.0039073965],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0021390778,0.0005478687,0.00945056,0.0009044168,0.00024002741,0.0005461188,0.0013929557,0.072823346,0.03683689,0.077836044,0.05758813,0.73969454],"study_design_scores_gemma":[0.000261862,0.0006192191,0.0038446353,0.00023057882,0.00024187416,0.0025968484,0.0014157733,0.6707195,0.097269975,0.10783931,0.11464642,0.00031400583],"about_ca_topic_score_codex":0.0032632933,"about_ca_topic_score_gemma":0.0025041145,"teacher_disagreement_score":0.008380121,"about_ca_system_score_codex":0.0011792324,"about_ca_system_score_gemma":0.0014461234,"threshold_uncertainty_score":0.02803427},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0507583,0.00040320153,0.92706656,0.00026362026,0.00007595907,0.00006696387,0.0008285815,0.0019002404,0.0186367],"genre_scores_gemma":[0.4477263,0.0011309106,0.53467816,0.00016691753,0.000105564,0.00020547355,0.0024116314,0.00055964594,0.013015484],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991893,0.00014074602,0.000050481758,0.00019573212,0.00031244097,0.00011131155],"domain_scores_gemma":[0.9985713,0.0003319048,0.00021575615,0.0005613506,0.00019632254,0.0001234305],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028560235,0.0008157961,0.0004771472,0.000691973,0.00041810318,0.0018138239,0.0015061091,0.000805304,0.010763486],"category_scores_gemma":[0.0029780013,0.00080305064,0.0005991751,0.0013041197,0.000871614,0.0029848733,0.0019504757,0.0015888988,0.0024108056],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003649317,0.000108282125,0.0017084606,0.0005341578,0.00008294072,0.0006425255,0.00055478903,0.251553,0.0477113,0.4037601,0.02391204,0.26906744],"study_design_scores_gemma":[0.00010091314,0.00022303525,0.001738967,0.00016642049,0.000063389845,0.00095584564,0.00022470568,0.5184621,0.034680113,0.36054188,0.082744904,0.000097806034],"about_ca_topic_score_codex":0.0007953004,"about_ca_topic_score_gemma":0.0015782289,"teacher_disagreement_score":0.010763486,"about_ca_system_score_codex":0.00074611005,"about_ca_system_score_gemma":0.00024947073,"threshold_uncertainty_score":0.036007464},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18380842,0.0020487804,0.7372825,0.0060086087,0.00045064677,0.00071766163,0.005769239,0.002293745,0.06162035],"genre_scores_gemma":[0.5431082,0.0015160666,0.42156553,0.00086561445,0.0004484866,0.0005999439,0.007845117,0.000778375,0.023272673],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983525,0.00042704903,0.00005727066,0.00062668603,0.00028464748,0.0002518249],"domain_scores_gemma":[0.9967925,0.0018693734,0.0002605338,0.00058323285,0.000252826,0.00024147014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007355469,0.0009185125,0.0011355581,0.0008845541,0.0025081434,0.0019694946,0.00189801,0.0014873821,0.00964988],"category_scores_gemma":[0.0046822317,0.00077625155,0.0016451699,0.0021220844,0.0013241601,0.0050349715,0.0018562963,0.0019274977,0.0017481544],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010885522,0.00056557043,0.002319801,0.0015741006,0.00041778063,0.0013042075,0.0011321009,0.18059435,0.021375263,0.5282374,0.09004241,0.17134859],"study_design_scores_gemma":[0.00023807597,0.00014472588,0.0016869201,0.0000973571,0.00011473878,0.0006416243,0.0004989018,0.33289474,0.0070236237,0.5943302,0.062261015,0.0000680308],"about_ca_topic_score_codex":0.0047930554,"about_ca_topic_score_gemma":0.006017575,"teacher_disagreement_score":0.00964988,"about_ca_system_score_codex":0.0014148813,"about_ca_system_score_gemma":0.0013015759,"threshold_uncertainty_score":0.032282054},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3977111,0.00055661367,0.5909615,0.00023266206,0.0000797812,0.00011875183,0.0008874771,0.002607321,0.006844689],"genre_scores_gemma":[0.6132945,0.00032868207,0.3790518,0.0001372929,0.00008621694,0.00016667698,0.00272877,0.00031829657,0.0038878126],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99917287,0.00008563861,0.000072837705,0.00028138768,0.0002445452,0.00014266167],"domain_scores_gemma":[0.9988643,0.00033995873,0.00019059719,0.00031634857,0.00015634095,0.00013242192],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004056192,0.00075208175,0.0008435393,0.0011709281,0.00043065601,0.0010259061,0.00092474365,0.00064951245,0.003203316],"category_scores_gemma":[0.0034471455,0.0003989236,0.00061839976,0.00159494,0.00071884284,0.0032365231,0.0019007925,0.0006168672,0.0011743105],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013859149,0.00025796395,0.01301367,0.00057347794,0.00018454375,0.0007328602,0.0010911569,0.26768923,0.07689872,0.11200791,0.01394291,0.51222163],"study_design_scores_gemma":[0.000110656736,0.000489552,0.0033815657,0.000058616595,0.0000666233,0.00076358067,0.0005125055,0.77120364,0.03491819,0.17455225,0.013883007,0.000059799168],"about_ca_topic_score_codex":0.0009948176,"about_ca_topic_score_gemma":0.0014985879,"teacher_disagreement_score":0.003203316,"about_ca_system_score_codex":0.0006062568,"about_ca_system_score_gemma":0.00045255004,"threshold_uncertainty_score":0.01071614},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3548339,0.0029046778,0.5384982,0.0028292723,0.00030850075,0.00041772044,0.0013529452,0.00092024484,0.09793451],"genre_scores_gemma":[0.8785711,0.0016994315,0.096983634,0.00077385904,0.00021952977,0.00045267268,0.0010096101,0.0006641599,0.019625936],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99854726,0.0004906404,0.00007110832,0.00042404328,0.00021501601,0.00025204872],"domain_scores_gemma":[0.9940848,0.0032808203,0.0012415983,0.0005208283,0.00019648948,0.00067559653],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008709241,0.0013915674,0.0008462217,0.0018429514,0.0016759305,0.003013707,0.0016992568,0.0018295366,0.011782427],"category_scores_gemma":[0.0068894033,0.00059340434,0.0010508057,0.0015764056,0.003500575,0.004376091,0.0020342835,0.0021696948,0.0014545982],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018038726,0.00011358159,0.0023164258,0.0002448288,0.00004211631,0.00050906505,0.0011769958,0.06498628,0.004570222,0.8948258,0.0066346754,0.024399666],"study_design_scores_gemma":[0.00003630019,0.00013201892,0.0020814256,0.00007761304,0.000036653273,0.0005971193,0.00051700097,0.11483453,0.001256065,0.8526191,0.027741771,0.000070407674],"about_ca_topic_score_codex":0.0024789257,"about_ca_topic_score_gemma":0.002561078,"teacher_disagreement_score":0.011782427,"about_ca_system_score_codex":0.0017963185,"about_ca_system_score_gemma":0.00063141884,"threshold_uncertainty_score":0.039416194},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22561589,0.00023729309,0.76462275,0.00032381347,0.000039677783,0.000052519725,0.00020090422,0.0005918996,0.008315222],"genre_scores_gemma":[0.7970303,0.0003171312,0.19833504,0.00005769124,0.000022740218,0.00012262604,0.0005261471,0.00015733995,0.0034309702],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99867284,0.0002719561,0.0001059726,0.0002734108,0.0005077776,0.00016814226],"domain_scores_gemma":[0.9969453,0.0013145457,0.00030722222,0.0010155843,0.00020131376,0.00021598142],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007465852,0.00097011094,0.00057683355,0.0005032166,0.00055038754,0.0018707357,0.0013536124,0.000859443,0.002427369],"category_scores_gemma":[0.0068457937,0.00059834105,0.0012933243,0.0006090057,0.0022782148,0.0042770244,0.00443237,0.002114384,0.00042777538],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001719898,0.00004073534,0.00148439,0.0001595906,0.0000414378,0.00029397046,0.0004764986,0.5201155,0.009507586,0.4353962,0.000694273,0.031617828],"study_design_scores_gemma":[0.00003157753,0.0001755302,0.0005845881,0.000039182258,0.000030622894,0.00031256687,0.00020870507,0.62324387,0.01159356,0.35595942,0.007784246,0.000036072437],"about_ca_topic_score_codex":0.0024881149,"about_ca_topic_score_gemma":0.0018846383,"teacher_disagreement_score":0.0024881149,"about_ca_system_score_codex":0.0012081946,"about_ca_system_score_gemma":0.0007241543,"threshold_uncertainty_score":0.008766174},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41785637,0.009448091,0.51724243,0.008846185,0.0005122485,0.0006767754,0.016565097,0.009036128,0.019816725],"genre_scores_gemma":[0.69116354,0.002282132,0.28098255,0.0011269642,0.00052461005,0.0006999081,0.014601337,0.0015589927,0.007059989],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.97963655,0.0024822978,0.002073365,0.0043067206,0.007432842,0.004068255],"domain_scores_gemma":[0.93295634,0.040152665,0.005695006,0.015220792,0.0028857058,0.003089422],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0072930367,0.0031123636,0.0058523077,0.0039839516,0.0034994008,0.007661806,0.010614967,0.003152804,0.010761283],"category_scores_gemma":[0.05893777,0.0028717606,0.0032215698,0.009465032,0.003788215,0.021682221,0.013441338,0.005498242,0.003743263],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0151270665,0.0024854867,0.0411388,0.0041411268,0.0011674989,0.0009773801,0.0041621285,0.38532633,0.08471099,0.1033759,0.055337835,0.30204955],"study_design_scores_gemma":[0.000783016,0.00088898075,0.006159755,0.00034049203,0.00048183886,0.0014976957,0.0010183199,0.7762934,0.03295842,0.16334383,0.016062867,0.00017136477],"about_ca_topic_score_codex":0.004958004,"about_ca_topic_score_gemma":0.00855065,"teacher_disagreement_score":0.010761283,"about_ca_system_score_codex":0.0042276713,"about_ca_system_score_gemma":0.0046845074,"threshold_uncertainty_score":0.03856969},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.71094435,0.0007327572,0.2611519,0.0003506185,0.0000434053,0.00006362187,0.00065524114,0.00048031844,0.02557782],"genre_scores_gemma":[0.9638193,0.00022800973,0.032042943,0.000066911205,0.000030429226,0.000047487167,0.0005887162,0.000040207473,0.0031359338],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997713,0.000038176506,0.000009860265,0.000054668842,0.00008013217,0.00004587057],"domain_scores_gemma":[0.9993943,0.0001645315,0.00015096762,0.00015014091,0.00007847597,0.00006161993],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000097301454,0.00024113047,0.00023266308,0.0007457432,0.00036055633,0.0009466615,0.0005686,0.00036867734,0.0035324825],"category_scores_gemma":[0.0009220668,0.0002189624,0.0002584947,0.000909516,0.0006858341,0.0019875283,0.0008588446,0.00058884,0.00039237735],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002573564,0.000070554874,0.002723889,0.00022243006,0.000026740126,0.00068106706,0.0011282515,0.06174943,0.028612792,0.82925874,0.002803237,0.07246546],"study_design_scores_gemma":[0.00004411742,0.00019958112,0.0042045377,0.000060169812,0.0000203311,0.001261119,0.00090950326,0.316363,0.013615501,0.6395401,0.023736272,0.000045755838],"about_ca_topic_score_codex":0.00079605484,"about_ca_topic_score_gemma":0.0008897315,"teacher_disagreement_score":0.0035324825,"about_ca_system_score_codex":0.00053339254,"about_ca_system_score_gemma":0.00013225847,"threshold_uncertainty_score":0.0118172765},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08899309,0.0074342466,0.8105661,0.0030738427,0.00071142474,0.00036278125,0.002475569,0.0049444516,0.08143848],"genre_scores_gemma":[0.43041536,0.004853092,0.53578246,0.001114047,0.0007558268,0.0006434918,0.0040882765,0.0017411178,0.020606376],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99566627,0.00047384427,0.00019240951,0.00081674865,0.0016965456,0.0011541571],"domain_scores_gemma":[0.9922667,0.0042734873,0.00037198587,0.0016280016,0.001037661,0.00042220016],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019301937,0.0020253237,0.0016340836,0.0030968294,0.0017623244,0.0037979793,0.0033886284,0.002025985,0.022366414],"category_scores_gemma":[0.015581643,0.0009756316,0.0023181997,0.0042020404,0.0022283695,0.010170315,0.0055116573,0.0048691635,0.0053983983],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018612468,0.0004693352,0.006383753,0.0014514936,0.00023228036,0.00086218683,0.00103873,0.20021096,0.038433924,0.26775363,0.06851052,0.41279197],"study_design_scores_gemma":[0.0001361673,0.0005116923,0.0032015482,0.0003449795,0.00028691025,0.0013311807,0.0003417332,0.6005782,0.017082572,0.2918651,0.08418187,0.00013805347],"about_ca_topic_score_codex":0.0052575795,"about_ca_topic_score_gemma":0.0049003735,"teacher_disagreement_score":0.022366414,"about_ca_system_score_codex":0.002945814,"about_ca_system_score_gemma":0.0016113289,"threshold_uncertainty_score":0.07482308},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03574586,0.0029126063,0.91982853,0.0030000329,0.0002507373,0.0005253051,0.0018021144,0.0073416075,0.028593164],"genre_scores_gemma":[0.22946708,0.0016337693,0.74769217,0.0007283681,0.00028595031,0.0006353534,0.00470303,0.0014927409,0.013361621],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998111,0.00029833373,0.0001120463,0.0005452346,0.00036581504,0.00056760135],"domain_scores_gemma":[0.996323,0.0024241859,0.00025075156,0.000640058,0.00021140242,0.00015061826],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001157831,0.0026259592,0.0022577215,0.0013272283,0.002072757,0.0034007565,0.0051051294,0.0030173582,0.017723983],"category_scores_gemma":[0.0061567635,0.0010753364,0.0027730877,0.0035690456,0.0015788422,0.0068332492,0.0032735674,0.003856891,0.004295752],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005903977,0.0008402819,0.0010595615,0.0015894431,0.00015712378,0.00034971832,0.00070852455,0.43292412,0.0046876906,0.17219132,0.076254115,0.30864775],"study_design_scores_gemma":[0.00028254028,0.00009263313,0.00032245886,0.000066409,0.00006802237,0.0003069399,0.0003310517,0.6896376,0.002080643,0.28771436,0.01905687,0.00004034249],"about_ca_topic_score_codex":0.008607207,"about_ca_topic_score_gemma":0.012025375,"teacher_disagreement_score":0.017723983,"about_ca_system_score_codex":0.0031171902,"about_ca_system_score_gemma":0.002856033,"threshold_uncertainty_score":0.059292614},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01202083,0.00032030762,0.9821124,0.00007191758,0.000019177336,0.000025506857,0.000009183546,0.00007431351,0.0053463825],"genre_scores_gemma":[0.506165,0.0008321467,0.48843446,0.0000781764,0.00003455585,0.00010282448,0.00006001692,0.00010868832,0.004184133],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997812,0.000051165745,0.000010088911,0.000039740182,0.0000952605,0.000022517468],"domain_scores_gemma":[0.99979144,0.00009885599,0.000019193209,0.000036698206,0.00004151319,0.000012340188],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044765987,0.00034992112,0.0004956037,0.00042331638,0.00032730802,0.00080155715,0.0007298973,0.00056653516,0.0015878024],"category_scores_gemma":[0.0010714817,0.0002877218,0.00054099766,0.0004049458,0.00067399844,0.00063351623,0.00068092934,0.0007746602,0.0002974269],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055938068,0.00005328594,0.0010259568,0.00016572936,0.000027286382,0.00013799564,0.00024204246,0.6625008,0.028557757,0.18324977,0.00092181965,0.12306153],"study_design_scores_gemma":[0.0000021398637,0.000013694142,0.000114930604,0.0000086555865,0.000003607628,0.000033201653,0.00001092786,0.99135464,0.0021624353,0.0047068726,0.0015840916,0.0000048397646],"about_ca_topic_score_codex":0.0020869174,"about_ca_topic_score_gemma":0.0016212164,"teacher_disagreement_score":0.0020869174,"about_ca_system_score_codex":0.00041190424,"about_ca_system_score_gemma":0.00047380012,"threshold_uncertainty_score":0.0053117275},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001664716,0.0050491835,0.014222527,0.0012406397,0.0025988598,0.00037353142,0.01447584,0.014532601,0.94584215],"genre_scores_gemma":[0.0038004587,0.0025506134,0.0025353408,0.00067611696,0.00014311109,0.00018367033,0.00982348,0.0017875731,0.97849965],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99945647,0.000042952146,0.00004782199,0.0001545622,0.00019783404,0.000100472],"domain_scores_gemma":[0.9991301,0.0001677292,0.000040765273,0.00029132777,0.00021445753,0.00015561297],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0010762874,0.002637015,0.001648483,0.0019638706,0.0017335856,0.003874178,0.0021297492,0.0037130357,0.92303485],"category_scores_gemma":[0.0020403943,0.0011134598,0.00093326805,0.006677978,0.0011078867,0.007261468,0.0040775337,0.0022396338,0.9438435],"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.00016953182,0.000103889906,0.00028508555,0.00041499626,0.00002472011,0.00013201515,0.000056199617,0.00048419295,0.0011916365,0.004872416,0.72295797,0.26930732],"study_design_scores_gemma":[0.00002161658,0.000017624407,0.0004543496,0.00014766393,0.000020181024,0.00008881658,0.000053404594,0.0007105539,0.00032615964,0.0014393296,0.99670225,0.000018056919],"about_ca_topic_score_codex":0.014294002,"about_ca_topic_score_gemma":0.01248369,"teacher_disagreement_score":0.07696515,"about_ca_system_score_codex":0.0017155128,"about_ca_system_score_gemma":0.0009662901,"threshold_uncertainty_score":0.109781444},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024543318,0.0050248727,0.017997047,0.0012506578,0.0019437205,0.0004281165,0.016853902,0.016374044,0.9376734],"genre_scores_gemma":[0.0049345535,0.002353834,0.0032227405,0.00056130305,0.00012674594,0.00018980209,0.009951431,0.0023563956,0.9763032],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99938047,0.000045211465,0.000048801496,0.00016788328,0.00023508708,0.00012251963],"domain_scores_gemma":[0.99866307,0.0002804168,0.000057867666,0.0004836936,0.0003191728,0.00019581383],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0014161007,0.002989676,0.00205158,0.0026222204,0.002108901,0.004114663,0.0026081235,0.004283619,0.92478967],"category_scores_gemma":[0.0028729392,0.0013898953,0.0011899343,0.00817167,0.0013076228,0.007618401,0.0047628535,0.0023080176,0.9377686],"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.00027081693,0.00014030897,0.0004318061,0.00050859235,0.000034008728,0.00015877151,0.00007905284,0.0011439241,0.0013391243,0.007944002,0.61695147,0.37099802],"study_design_scores_gemma":[0.00003701112,0.000025203646,0.000590249,0.00020722319,0.000035423454,0.00012118212,0.0000590839,0.0012449481,0.0005115665,0.0021707362,0.99497366,0.00002369482],"about_ca_topic_score_codex":0.02537087,"about_ca_topic_score_gemma":0.018442336,"teacher_disagreement_score":0.07521033,"about_ca_system_score_codex":0.002322146,"about_ca_system_score_gemma":0.0012649941,"threshold_uncertainty_score":0.10727835},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11617209,0.00062016706,0.872998,0.00038854612,0.000091079535,0.00009770484,0.0010040279,0.0010877905,0.00754063],"genre_scores_gemma":[0.31862408,0.0006296534,0.67280674,0.0001421593,0.00004981626,0.0001522409,0.0019183767,0.00021063628,0.0054663904],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994005,0.000076911696,0.00007073439,0.00014496934,0.00024276409,0.000064033266],"domain_scores_gemma":[0.9992567,0.00013384031,0.000100351856,0.00030941045,0.00012022498,0.00007955781],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041474568,0.0003699855,0.00071886403,0.0011890613,0.00061562035,0.00103547,0.0011686789,0.00069990894,0.0029290484],"category_scores_gemma":[0.0019934808,0.0003568206,0.00058356486,0.0021679106,0.00092504773,0.0040685837,0.0024387504,0.0009493075,0.0013014866],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045631084,0.00017202017,0.003534455,0.00041822952,0.000058015274,0.00039895411,0.0008087894,0.16239847,0.0302424,0.46934423,0.008505435,0.3236626],"study_design_scores_gemma":[0.000074325726,0.0004854952,0.0015690012,0.00008357359,0.00003629013,0.00095593435,0.00047032727,0.5668485,0.028549438,0.35769945,0.043128572,0.00009909241],"about_ca_topic_score_codex":0.0018749258,"about_ca_topic_score_gemma":0.0026645064,"teacher_disagreement_score":0.0029290484,"about_ca_system_score_codex":0.00069395755,"about_ca_system_score_gemma":0.0006034899,"threshold_uncertainty_score":0.009798706},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030834671,0.00010521442,0.96166915,0.00005546981,0.00004964071,0.00008743562,0.000101224454,0.0023006897,0.004796583],"genre_scores_gemma":[0.28693342,0.00014291014,0.7091859,0.000036359477,0.000012938038,0.00015613095,0.000580815,0.00028994124,0.0026616047],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997141,0.000053089843,0.000022770551,0.000038940576,0.00013109708,0.000040013063],"domain_scores_gemma":[0.9995548,0.00013445053,0.000022699174,0.000137651,0.00012790132,0.000022585013],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041696703,0.00029989754,0.0004259,0.00037398346,0.00042267283,0.00044459244,0.000821708,0.00028118325,0.0026708408],"category_scores_gemma":[0.0011153979,0.00020143739,0.00044153232,0.0006942356,0.00025619153,0.00047331303,0.00058833143,0.00040949445,0.0006332328],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004210802,0.0002457543,0.004153599,0.00028417548,0.00007983443,0.0002304721,0.00052864983,0.30078703,0.083244085,0.03272447,0.00814481,0.56915605],"study_design_scores_gemma":[0.00004030582,0.000088947345,0.0006174558,0.000007647325,0.000014676725,0.000075173746,0.000037867132,0.9645362,0.02105373,0.0046419865,0.008872022,0.000013953809],"about_ca_topic_score_codex":0.0030184072,"about_ca_topic_score_gemma":0.0035169455,"teacher_disagreement_score":0.0030184072,"about_ca_system_score_codex":0.00034098074,"about_ca_system_score_gemma":0.00078517414,"threshold_uncertainty_score":0.008934915},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19744536,0.00038420028,0.6108722,0.00031356374,0.00039089192,0.00029061644,0.0011216392,0.001301841,0.18787967],"genre_scores_gemma":[0.69208723,0.0007748588,0.21087247,0.00020784633,0.000107577915,0.00029481482,0.002681235,0.0015412802,0.09143273],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995975,0.00006158716,0.000018154782,0.000072156596,0.00018003238,0.00007065307],"domain_scores_gemma":[0.99960417,0.00015738339,0.000033040425,0.00005934636,0.00009732704,0.000048786358],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032995795,0.0008496447,0.0007914433,0.0011994587,0.0007519965,0.0018572331,0.0009685073,0.000915084,0.017132811],"category_scores_gemma":[0.0014294907,0.00069467345,0.0008432347,0.00078086066,0.00088883884,0.0017856456,0.0016459917,0.00161678,0.005298594],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011456257,0.00008874196,0.00038613536,0.00029170103,0.000028465769,0.00042500577,0.0006542845,0.011835106,0.018085508,0.8656516,0.0077194967,0.09471939],"study_design_scores_gemma":[0.000078073135,0.000078808254,0.00037334126,0.000112261696,0.000044049983,0.00045052753,0.0003462486,0.028271606,0.01817615,0.89965826,0.05236621,0.000044324148],"about_ca_topic_score_codex":0.00031531844,"about_ca_topic_score_gemma":0.00077141233,"teacher_disagreement_score":0.017132811,"about_ca_system_score_codex":0.0005443383,"about_ca_system_score_gemma":0.00033018703,"threshold_uncertainty_score":0.057314992},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0042517795,0.0014873627,0.92705745,0.0007909161,0.0005472797,0.00008714854,0.00021593118,0.0012046397,0.0643575],"genre_scores_gemma":[0.11680002,0.0038614974,0.7393589,0.0006272592,0.00039329653,0.00041222898,0.0010386639,0.0014709395,0.13603725],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993783,0.000132336,0.000029463483,0.00013830695,0.00025769323,0.00006389374],"domain_scores_gemma":[0.9993678,0.00021941878,0.00002872201,0.00018641751,0.00013206329,0.00006555901],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005080974,0.0013914164,0.0010941556,0.0012703205,0.0013193815,0.0024655282,0.0020859602,0.0019367213,0.02926149],"category_scores_gemma":[0.0026128227,0.00082086667,0.0011739022,0.0020117136,0.0029003005,0.0029455784,0.0046553663,0.0049133184,0.009645556],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000101781305,0.00004878893,0.0001087395,0.00019966866,0.000019038558,0.00008174482,0.0002923864,0.026997054,0.0014357887,0.7111875,0.022906005,0.23662151],"study_design_scores_gemma":[0.000028247272,0.00004424535,0.00006568496,0.00009216037,0.000012701264,0.00011739677,0.00009023176,0.05327704,0.001273126,0.8478141,0.097166084,0.000019007814],"about_ca_topic_score_codex":0.0018639766,"about_ca_topic_score_gemma":0.0017642085,"teacher_disagreement_score":0.02926149,"about_ca_system_score_codex":0.0014648617,"about_ca_system_score_gemma":0.00090273476,"threshold_uncertainty_score":0.09788948},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14734365,0.00016955829,0.81930673,0.0006080753,0.00031696682,0.00014127001,0.0004552013,0.0013974946,0.03026103],"genre_scores_gemma":[0.66949594,0.00037365558,0.29273036,0.00017931081,0.000119068354,0.000067565976,0.0009505645,0.0016363589,0.034447208],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99970007,0.00003809295,0.000012597182,0.00008466253,0.00012209288,0.000042506534],"domain_scores_gemma":[0.9994917,0.00009377255,0.000039971135,0.00014235855,0.0001454343,0.00008670426],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041754398,0.0005298781,0.00072102185,0.0013007747,0.0008213092,0.0011843973,0.0005819738,0.0011102352,0.011120319],"category_scores_gemma":[0.0016507714,0.00037263255,0.0006951758,0.0007557783,0.0010830171,0.0015434199,0.002160953,0.0015749084,0.002630952],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003162302,0.00012575038,0.00146226,0.00021424609,0.000048658076,0.0007599277,0.0008795036,0.07360343,0.040949166,0.71245956,0.010306045,0.1588752],"study_design_scores_gemma":[0.000033916247,0.00026533773,0.0008534862,0.000050882616,0.000022967513,0.00052790734,0.00041226385,0.37105775,0.017161014,0.5655208,0.04405606,0.000037478007],"about_ca_topic_score_codex":0.0009885201,"about_ca_topic_score_gemma":0.00101809,"teacher_disagreement_score":0.011120319,"about_ca_system_score_codex":0.000651692,"about_ca_system_score_gemma":0.00053330715,"threshold_uncertainty_score":0.037201166},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0046039796,0.00040826105,0.98646206,0.00015512948,0.000053418913,0.000030532712,0.00008791128,0.0003749556,0.007823709],"genre_scores_gemma":[0.1407054,0.0006128264,0.8459929,0.00011317342,0.00010548972,0.00029804627,0.0003004558,0.00048548786,0.0113862315],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99958616,0.00010454233,0.000018604605,0.00007117443,0.00015523125,0.000064269894],"domain_scores_gemma":[0.9991704,0.0004998115,0.0000512052,0.00012471368,0.00012096649,0.000032838405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008417214,0.001640444,0.0015754813,0.000824005,0.00089326047,0.0011941162,0.0018190952,0.0011304719,0.009151787],"category_scores_gemma":[0.0032909082,0.001043065,0.0009171968,0.001860271,0.001113174,0.0022936785,0.0019312322,0.0021127136,0.0015061457],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012677304,0.00007402479,0.00021169006,0.00017460575,0.00003207049,0.000036169095,0.00010112068,0.7332165,0.0011837994,0.11164047,0.0075156894,0.14568694],"study_design_scores_gemma":[0.00003750935,0.000013884206,0.00006063123,0.000009696881,0.000007362772,0.000015023406,0.00001889677,0.9053038,0.00048517733,0.09177711,0.0022650568,0.0000058921332],"about_ca_topic_score_codex":0.0059352373,"about_ca_topic_score_gemma":0.012553695,"teacher_disagreement_score":0.009151787,"about_ca_system_score_codex":0.0015800009,"about_ca_system_score_gemma":0.0016049608,"threshold_uncertainty_score":0.030615747},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10125346,0.0002931846,0.8919415,0.00030836798,0.00003647668,0.00007779917,0.00012673803,0.00019955581,0.0057629016],"genre_scores_gemma":[0.7737938,0.00025042862,0.21824612,0.000103713435,0.00004447135,0.00017225416,0.00035560562,0.0003494985,0.00668414],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996437,0.00012318125,0.000013982078,0.000060034778,0.000118217686,0.000040923922],"domain_scores_gemma":[0.9992186,0.00044018094,0.000100198384,0.00007424753,0.00010653923,0.000060282164],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010560323,0.00062931795,0.00076760363,0.00064451894,0.00035283394,0.00095636584,0.0008629025,0.0012336446,0.002444805],"category_scores_gemma":[0.0038490614,0.0004331368,0.0005768866,0.00048894814,0.0011442498,0.001034718,0.0017098085,0.000775425,0.00048664212],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012981235,0.000050828905,0.0009535302,0.00015193793,0.000026792153,0.00012050475,0.0001977291,0.9141817,0.0055781873,0.040268376,0.0016007766,0.036739852],"study_design_scores_gemma":[0.0000071734094,0.000018710181,0.000050699015,0.00000567274,0.0000021362512,0.000013397093,0.00002403173,0.9904931,0.0005215501,0.008515627,0.00034457236,0.0000033217927],"about_ca_topic_score_codex":0.0022471093,"about_ca_topic_score_gemma":0.0025786685,"teacher_disagreement_score":0.002444805,"about_ca_system_score_codex":0.0009300901,"about_ca_system_score_gemma":0.0004752093,"threshold_uncertainty_score":0.008178711},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022517085,0.0010666554,0.89948654,0.00026814497,0.00042625278,0.00014454317,0.0009830388,0.0011928697,0.07391482],"genre_scores_gemma":[0.19424926,0.0017051673,0.73766905,0.0002810476,0.00020180145,0.00021466087,0.0038843388,0.0013382903,0.06045634],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996915,0.000038589344,0.000029450099,0.000054040298,0.00014344916,0.000042981344],"domain_scores_gemma":[0.9996315,0.00007710421,0.000029596764,0.000120576944,0.00008639438,0.00005480088],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002573961,0.000684981,0.00051407015,0.0016006351,0.00062726066,0.0018610583,0.0007001638,0.0004955388,0.014964725],"category_scores_gemma":[0.0011984445,0.00046121815,0.001028277,0.0011771276,0.00081076426,0.0018691169,0.0021139625,0.0016065119,0.0068840906],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013973731,0.0000861437,0.0006269951,0.00038479196,0.00003246368,0.00031820586,0.00046424972,0.011162771,0.014049839,0.61422807,0.037073117,0.32143363],"study_design_scores_gemma":[0.00004860014,0.000068647074,0.00056624546,0.00015571232,0.00004982397,0.000960324,0.00034031138,0.065837085,0.0067256466,0.7454741,0.17974772,0.000025980977],"about_ca_topic_score_codex":0.00070425763,"about_ca_topic_score_gemma":0.0014671771,"teacher_disagreement_score":0.014964725,"about_ca_system_score_codex":0.0004150512,"about_ca_system_score_gemma":0.00036139396,"threshold_uncertainty_score":0.050062},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05610665,0.0015406338,0.59067726,0.0024272155,0.0007348349,0.00010264199,0.0013011025,0.0005848393,0.34652478],"genre_scores_gemma":[0.73835075,0.0026989398,0.1694553,0.0012058325,0.0006525495,0.00039272205,0.0019480229,0.0007067184,0.08458918],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99939287,0.000112006004,0.00004847481,0.0001570491,0.00020584228,0.00008365215],"domain_scores_gemma":[0.99898154,0.00050735846,0.0000955788,0.00016900848,0.00016527077,0.00008116744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086934713,0.00052748516,0.00048522867,0.0013576051,0.0021430524,0.002412213,0.0011871147,0.001239568,0.018621277],"category_scores_gemma":[0.0034823997,0.00057035213,0.0010552941,0.001067169,0.0023451475,0.005902095,0.0021537184,0.0032898462,0.0045684725],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016287293,0.000012873132,0.00009187444,0.00003524647,0.0000053177387,0.000039285424,0.000076979064,0.00091492385,0.0004198285,0.9873418,0.0027340685,0.008311586],"study_design_scores_gemma":[0.000008535272,0.000007687963,0.000091885246,0.000017480637,0.000005861895,0.00010283184,0.000031321768,0.0024245565,0.00036040889,0.9896527,0.007288998,0.0000076991155],"about_ca_topic_score_codex":0.0008826244,"about_ca_topic_score_gemma":0.0010571036,"teacher_disagreement_score":0.018621277,"about_ca_system_score_codex":0.0009703472,"about_ca_system_score_gemma":0.00085740787,"threshold_uncertainty_score":0.062294364},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37769008,0.0028820494,0.5456024,0.0028009636,0.00023814615,0.00018839847,0.0010534582,0.0007709183,0.06877363],"genre_scores_gemma":[0.9199849,0.0012165138,0.07471527,0.00022939146,0.00011653076,0.00019054583,0.00047447687,0.00013306265,0.0029392408],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976598,0.0004193076,0.00013511909,0.00051281333,0.00087870064,0.00039435405],"domain_scores_gemma":[0.9940276,0.0034787953,0.0011414642,0.00058170856,0.0004458543,0.00032444388],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016293544,0.0005842962,0.0007644938,0.0009782289,0.0010183987,0.0014597226,0.0009553523,0.0012567976,0.0053893835],"category_scores_gemma":[0.023127688,0.00049191853,0.0005233305,0.0014346807,0.0012723628,0.0021475654,0.0019127205,0.0008810397,0.0014346848],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012261021,0.00016400887,0.028123569,0.0010968081,0.00032138109,0.0041566766,0.0015529426,0.14185145,0.07545332,0.4833893,0.017448891,0.24521558],"study_design_scores_gemma":[0.0001975543,0.0008558345,0.019183632,0.0003952814,0.00020589076,0.015617716,0.0016588839,0.4028867,0.060775876,0.4495111,0.048554126,0.00015745581],"about_ca_topic_score_codex":0.0005843961,"about_ca_topic_score_gemma":0.00036032475,"teacher_disagreement_score":0.0053893835,"about_ca_system_score_codex":0.0005418706,"about_ca_system_score_gemma":0.0004304666,"threshold_uncertainty_score":0.018029332},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015161487,0.00007199573,0.9980617,0.000030296176,0.0000099708295,0.000010037921,0.000022235934,0.0001010439,0.00017660054],"genre_scores_gemma":[0.105828084,0.00037762255,0.8908023,0.00007275052,0.0000824936,0.00021923732,0.00044504102,0.00024234033,0.0019300531],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971848,0.0009368094,0.00015287574,0.00040457334,0.0012130274,0.000107910135],"domain_scores_gemma":[0.99546635,0.0025520853,0.00026306373,0.0010946427,0.00055530533,0.00006853461],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024170498,0.00093543925,0.0024152407,0.0015883173,0.00043323403,0.0018201431,0.0022985023,0.0014437077,0.001352664],"category_scores_gemma":[0.010563579,0.001203854,0.0022046294,0.0019960525,0.001703016,0.0015709462,0.0042110067,0.0032794103,0.00091729866],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023849097,0.000095794836,0.0006900242,0.00031202496,0.00013624284,0.00010636478,0.00019381728,0.5503114,0.014454486,0.07879036,0.0031419522,0.35152906],"study_design_scores_gemma":[0.000005619042,0.000020806136,0.000116343734,0.000010189764,0.000009929513,0.00004983694,0.000010677691,0.9748039,0.0021438128,0.02151966,0.0012983211,0.000010798693],"about_ca_topic_score_codex":0.0016266211,"about_ca_topic_score_gemma":0.0011991977,"teacher_disagreement_score":0.0024170498,"about_ca_system_score_codex":0.0007431754,"about_ca_system_score_gemma":0.00085237785,"threshold_uncertainty_score":0.012782693},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00033313123,0.00039718175,0.99066657,0.000089548426,0.00015721183,0.000022322487,0.000046281377,0.0003934896,0.007894286],"genre_scores_gemma":[0.018022796,0.0011590912,0.95481443,0.00017206943,0.00012841252,0.00012956216,0.00021750286,0.0006470471,0.024709074],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996499,0.00005296406,0.000017137974,0.000041152343,0.00022383394,0.000015058796],"domain_scores_gemma":[0.99973756,0.0001004081,0.000009292933,0.0000640867,0.000075766206,0.000012832321],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040180032,0.0009095312,0.0008067929,0.0013171046,0.0005537263,0.0017799049,0.0021654095,0.0012396319,0.013565939],"category_scores_gemma":[0.0009665632,0.00067933026,0.0011099217,0.0011646238,0.00096554664,0.0013763674,0.0016342261,0.0019721442,0.004717176],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000312546,0.00006048672,0.00019067302,0.00042187376,0.00006379971,0.00017385796,0.00018737868,0.07448098,0.019418314,0.53429115,0.030908205,0.33977193],"study_design_scores_gemma":[0.000010938859,0.00003575843,0.00019066733,0.00007682468,0.000031668977,0.00046321232,0.000040622486,0.5684738,0.0058642896,0.30326134,0.12151919,0.00003170654],"about_ca_topic_score_codex":0.0006359681,"about_ca_topic_score_gemma":0.0011877131,"teacher_disagreement_score":0.013565939,"about_ca_system_score_codex":0.00039992158,"about_ca_system_score_gemma":0.00043203533,"threshold_uncertainty_score":0.04538256},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04171307,0.048661537,0.49856046,0.003397313,0.0014671143,0.00011267163,0.0008118952,0.00037749435,0.40489846],"genre_scores_gemma":[0.7170163,0.020060811,0.15943064,0.0005351382,0.0015323377,0.0002944008,0.0008214028,0.00044131785,0.09986774],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998197,0.00061603397,0.00012335069,0.00031375844,0.0006280802,0.00012181367],"domain_scores_gemma":[0.9975842,0.0013271162,0.00014497082,0.00029805745,0.0004956647,0.00014993772],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013559555,0.00070450164,0.001114787,0.005442733,0.0024490396,0.008011835,0.0017482725,0.0014238112,0.010081313],"category_scores_gemma":[0.009224306,0.0007677894,0.0008377662,0.006199244,0.0047632814,0.0071653253,0.0029004398,0.0024758878,0.0020812836],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025283853,0.0000019019259,0.000037526977,0.000013758796,0.00000219354,0.000010207171,0.000119533994,0.0002466219,0.00003108812,0.9935097,0.00058999466,0.0054349364],"study_design_scores_gemma":[0.0000027069693,0.0000021499404,0.000050458984,0.000020202686,0.000003756159,0.00007447319,0.00008144362,0.001897742,0.00009539739,0.97468954,0.023076238,0.0000058998685],"about_ca_topic_score_codex":0.0028818948,"about_ca_topic_score_gemma":0.0025769437,"teacher_disagreement_score":0.010081313,"about_ca_system_score_codex":0.0021597063,"about_ca_system_score_gemma":0.0007324203,"threshold_uncertainty_score":0.03372538},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00910162,0.00009643527,0.98715043,0.000033145647,0.000057142228,0.000075656186,0.00012074107,0.001484587,0.001880222],"genre_scores_gemma":[0.058812436,0.0000873877,0.9374279,0.00003363619,0.000018798164,0.00008904925,0.00047371548,0.00031796185,0.002739202],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993024,0.000061725485,0.000046620215,0.00015686575,0.00032660158,0.00010582946],"domain_scores_gemma":[0.99937505,0.00020534529,0.000042590287,0.00017596487,0.00014010076,0.00006103663],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005907175,0.0014321009,0.001970239,0.0013996182,0.00061546423,0.0015057857,0.0023510142,0.0016375975,0.012320214],"category_scores_gemma":[0.001934972,0.0010888698,0.0019037874,0.0012519223,0.000694561,0.001695252,0.0033388345,0.0022319865,0.0028056111],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041483535,0.00017819385,0.00079833675,0.00021142767,0.00008428446,0.00013673597,0.00025091472,0.20493303,0.016426107,0.02152387,0.009209926,0.7458323],"study_design_scores_gemma":[0.000029451698,0.00006478098,0.00013958412,0.00001915578,0.0000121237335,0.000083854,0.000052065345,0.98521346,0.0037289085,0.007118661,0.0035224722,0.000015442825],"about_ca_topic_score_codex":0.0066711586,"about_ca_topic_score_gemma":0.008862878,"teacher_disagreement_score":0.012320214,"about_ca_system_score_codex":0.00065824186,"about_ca_system_score_gemma":0.0011568432,"threshold_uncertainty_score":0.04121524},"labels":[],"label_agreement":null}]}