{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":115,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":115,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"query_hash":"d040838b2c79","filters":{"venue":"Canadian Conference on Computational Geometry"}},"results":[{"id":"W2140984273","doi":"","title":"Planar Case of the Maximum Box and Related Problems","year":2003,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Mathematical Approximation and Integration","field":"Mathematics","cited_by":26,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"","keywords":"Cardinality (data modeling); Planar; Combinatorics; Mathematics; Extension (predicate logic); Planar graph; Approximation algorithm; Discrete mathematics; Computer science; Graph","retraction":null,"screen_n_in":null,"score":{"opus":0.04753680883092413,"gpt":0.273286509639956,"spread":0.2257497008090319,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000255106,0.0001065898,0.0001456105,0.0001716443,0.00012774,0.00003500158,0.00008409158,0.00007785467,0.0007820737],"category_scores_gemma":[0.000488613,0.00007759854,0.00003873172,0.0003115021,0.00009534866,0.00005012262,0.000006181774,0.0001465311,0.00002098789],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005513278,"about_ca_system_score_gemma":0.0002974702,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007160645,"about_ca_topic_score_gemma":0.003328571,"domain_scores_codex":[0.9991684,0.00007736228,0.0002936022,0.0001484965,0.000168313,0.000143812],"domain_scores_gemma":[0.9991264,0.0002757985,0.0001199067,0.0001457992,0.0001742844,0.0001578203],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[7.933141e-7,0.00002467698,0.00007680035,0.00005804756,0.00001444018,0.000009431068,0.0002656563,0.00005226379,0.000006892083,0.9979678,0.0006866445,0.0008365195],"study_design_scores_gemma":[0.0002020897,0.00003246834,0.0002491316,0.00007697751,0.00001086656,0.0003578364,0.0002928941,0.01028482,0.00006353323,0.9878517,0.0004809649,0.00009670768],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7343409,0.00005366727,0.02583701,0.003820556,0.0002821276,0.001133727,0.0001600902,0.00006178091,0.2343102],"genre_scores_gemma":[0.9889485,0.000001068854,0.01014354,0.0002055141,0.000005056209,0.000009716137,0.000009042546,0.000009191936,0.0006683264],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2546076,"threshold_uncertainty_score":0.8563159,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02840429613742914,"gpt":0.2476286008519265,"spread":0.2192243047144974,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004056531,0.0001811328,0.0001554348,0.0003687043,0.0007201697,0.0003185546,0.0008616376,0.00008178378,0.00005022716],"category_scores_gemma":[0.0001326806,0.0001274968,0.000119714,0.001324982,0.00008126324,0.0002848484,0.00004681137,0.0001884921,0.00004047275],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000142591,"about_ca_system_score_gemma":0.001087398,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004912972,"about_ca_topic_score_gemma":0.0007069857,"domain_scores_codex":[0.9982126,0.0001269574,0.0003868525,0.0003562083,0.0005948028,0.0003226195],"domain_scores_gemma":[0.9983522,0.0002713864,0.0002104281,0.0004454714,0.0005260264,0.0001944658],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001826626,0.00003172806,0.001376753,0.000005162125,0.00004621352,0.000004062308,0.0007566207,0.1390084,0.0002083053,0.7544357,0.004353373,0.09975545],"study_design_scores_gemma":[0.0005147282,0.0001720528,0.3575144,0.00005565305,0.00001480381,0.00002166672,0.00004594196,0.5189375,0.001380279,0.1172317,0.003805356,0.0003059017],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1900923,0.0001958882,0.7615309,0.03950915,0.001357834,0.0006412769,0.00004969514,0.00007553307,0.00654752],"genre_scores_gemma":[0.9936664,0.000004252138,0.002400626,0.002813177,0.0001195852,0.000007746037,0.00002593906,0.000006212057,0.0009560717],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8035741,"threshold_uncertainty_score":0.5539036,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2102775149","doi":"","title":"Zipper Unfoldings of Polyhedral Complexes","year":2010,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Advanced Materials and Mechanics","field":"Engineering","cited_by":18,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Zipper; Polyhedron; Tetrahedron; Enhanced Data Rates for GSM Evolution; Combinatorics; Planar; Regular polygon; Hamiltonian (control theory); Mathematics; Topology (electrical circuits); Crystallography; Computer science; Geometry; Algorithm; Chemistry; Computer graphics (images); Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.01254562570413728,"gpt":0.2210780970289299,"spread":0.2085324713247927,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00004933236,0.0001078458,0.000140509,0.000244714,0.00004480833,0.00002570393,0.000131761,0.00006949234,0.0008144551],"category_scores_gemma":[0.00002319989,0.0001176007,0.00002855573,0.0001597032,0.00003861993,0.00006396323,0.000008748375,0.0001371994,0.00005312693],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003494114,"about_ca_system_score_gemma":0.0001771563,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001184395,"about_ca_topic_score_gemma":0.005039158,"domain_scores_codex":[0.9993993,0.000004201122,0.0001559495,0.0001109513,0.0001183616,0.0002112615],"domain_scores_gemma":[0.9995153,0.0000394985,0.00002639546,0.0001043029,0.0000983248,0.0002162103],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000007706678,0.0000149706,0.0002680837,0.00006256918,0.00003140423,0.000009416817,0.00009206923,0.06002835,0.1047616,0.8236935,0.001291801,0.009738455],"study_design_scores_gemma":[0.002165883,0.0003791605,0.04169131,0.0002597711,0.00005048271,0.0001035117,0.0004721982,0.5327818,0.114057,0.251924,0.05382451,0.00229029],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9831145,0.00001943406,0.009029201,0.000156356,0.0009892407,0.00008655109,0.0002121105,0.00007232039,0.006320218],"genre_scores_gemma":[0.994729,0.000003876894,0.004919945,0.0001499166,0.000067305,0.000003586097,0.00005340364,0.00001706451,0.00005585915],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5717695,"threshold_uncertainty_score":0.8917712,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01171564186456953,"gpt":0.236447379208302,"spread":0.2247317373437325,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005895751,0.0002019727,0.0002332093,0.000989935,0.0002062696,0.0001591205,0.0009081899,0.0001194484,0.000262046],"category_scores_gemma":[0.0001454658,0.00018205,0.00007506486,0.001607893,0.0001177639,0.0002385258,0.00008419851,0.0004671751,0.0001247215],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008836465,"about_ca_system_score_gemma":0.00136804,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002521286,"about_ca_topic_score_gemma":0.007232716,"domain_scores_codex":[0.9981499,0.00009962993,0.0004422641,0.0004474898,0.0004660495,0.0003946949],"domain_scores_gemma":[0.9983585,0.0004875928,0.0001695426,0.0003790183,0.0003426033,0.0002626859],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001068748,0.00009936976,0.0007165085,0.0000146161,0.00002650381,0.00002185698,0.0004253423,0.2539245,0.001604311,0.6727569,0.001124397,0.06927494],"study_design_scores_gemma":[0.0003695483,0.00008873798,0.0476775,0.0000307594,0.000003407539,0.00002631895,0.00001909605,0.9275584,0.0003824709,0.02215887,0.00144699,0.0002378855],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6586443,0.00004464078,0.3232192,0.006701491,0.001314529,0.000477837,0.0000518595,0.0000702867,0.009475894],"genre_scores_gemma":[0.97517,0.000001174854,0.02350508,0.0008455002,0.000176659,0.000007701116,0.00006285392,0.00000975732,0.0002212486],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6736339,"threshold_uncertainty_score":0.7423782,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2188440933","doi":"","title":"Optimal Bounds on Theta-Graphs: More is not Always Better.","year":2012,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Combinatorics; Mathematics; Upper and lower bounds; Discrete mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.05157835567815482,"gpt":0.3078867761724915,"spread":0.2563084204943367,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005001245,0.0003277809,0.0002691509,0.001419955,0.0004723787,0.000341764,0.001409014,0.0001378154,0.0005112232],"category_scores_gemma":[0.0001016265,0.0003287392,0.0001419274,0.001408507,0.0002700008,0.000659192,0.0001334655,0.0005269334,0.0009204489],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002804134,"about_ca_system_score_gemma":0.0008041356,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007485782,"about_ca_topic_score_gemma":0.0002644963,"domain_scores_codex":[0.9968674,0.0001235204,0.0002932046,0.0006391663,0.0009477531,0.001128911],"domain_scores_gemma":[0.9972061,0.0004475822,0.0001006663,0.0007167707,0.0003363134,0.001192574],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002424586,0.00008785901,0.002169043,0.00001044844,0.00006087375,0.00003360207,0.0006721725,0.007477235,0.00003273539,0.9549258,0.004963297,0.02954264],"study_design_scores_gemma":[0.002586549,0.001395956,0.1471507,0.0002601788,0.00003715714,0.0001919337,0.0006121701,0.341957,0.002706412,0.4167524,0.08299987,0.003349659],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6051238,0.0002855218,0.3079892,0.03639081,0.002017955,0.0009831844,0.0006117362,0.0004444992,0.04615334],"genre_scores_gemma":[0.9716557,0.000005686322,0.01614264,0.01137603,0.0001343224,0.00003243456,0.0000489091,0.00002652789,0.0005777131],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5381734,"threshold_uncertainty_score":0.9999165,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2112429204","doi":"","title":"Optimistic Shortest Paths on Uncertain Terrains","year":2004,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"K shortest path routing; Shortest path problem; Euclidean shortest path; Yen's algorithm; Shortest Path Faster Algorithm; Constrained Shortest Path First; Terrain; Computer science; Geodesic; Longest path problem; Path (computing); Widest path problem; Pathfinding; Mathematical optimization; Algorithm; Mathematics; Dijkstra's algorithm; Theoretical computer science; Geography; Graph; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.04657298695031612,"gpt":0.2724671985039716,"spread":0.2258942115536555,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002403203,0.0002805915,0.0002315861,0.0007975913,0.0002962969,0.0002999422,0.001018949,0.0001316339,0.00007576467],"category_scores_gemma":[0.0002345345,0.0002962633,0.00006690395,0.0008690935,0.0001029166,0.000179248,0.00005198992,0.0003855715,0.0007048017],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006699042,"about_ca_system_score_gemma":0.002581824,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004502239,"about_ca_topic_score_gemma":0.0009674235,"domain_scores_codex":[0.9977904,0.00005643831,0.0002855296,0.0006710957,0.0005776429,0.0006188946],"domain_scores_gemma":[0.9981358,0.0002828571,0.00008900394,0.0004972433,0.0002243542,0.0007707303],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000002125834,0.00004527515,0.0001496182,0.000004044925,0.0000151757,0.0003173875,0.0002017784,0.7546544,0.000003435911,0.2322479,0.0005626846,0.0117962],"study_design_scores_gemma":[0.0009626428,0.000797057,0.02606535,0.0002784869,0.000009155705,0.0001396498,0.00009544959,0.9051948,0.00002836888,0.06463924,0.0009185842,0.0008712838],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0115905,0.00002620659,0.9583579,0.007116472,0.0009881295,0.0002958878,0.0001185779,0.0002424288,0.02126385],"genre_scores_gemma":[0.8854265,0.000001435806,0.1106493,0.003504696,0.00009976081,0.00001659365,0.00008880042,0.00001629479,0.0001965904],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.873836,"threshold_uncertainty_score":0.999949,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01562046188455601,"gpt":0.2340983481156226,"spread":0.2184778862310666,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004935513,0.0001830231,0.0001689761,0.0007423927,0.0004674363,0.0003651865,0.0006739699,0.00007700858,0.00003741108],"category_scores_gemma":[0.0001399644,0.0001557344,0.00004834282,0.001831964,0.00004805536,0.0002813496,0.00003599819,0.0002317921,0.0001688781],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002879872,"about_ca_system_score_gemma":0.001231703,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001463056,"about_ca_topic_score_gemma":0.005248954,"domain_scores_codex":[0.9981718,0.0001254037,0.0003684295,0.000425697,0.0004598518,0.0004488037],"domain_scores_gemma":[0.9985186,0.0004953025,0.00009823186,0.0003279122,0.0002571324,0.000302849],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000004968342,0.0000422775,0.0001112642,0.000002894891,0.000008059198,0.00002661449,0.000097998,0.06875783,0.00002745646,0.8346088,0.00260729,0.09370457],"study_design_scores_gemma":[0.0005504475,0.000272535,0.06650396,0.00007488515,0.000003566667,0.00003523578,0.00003664212,0.4023676,0.00005386126,0.5250234,0.004705201,0.0003727115],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4230486,0.0009821801,0.4303276,0.1058191,0.002363787,0.001842314,0.0000520364,0.0004377879,0.03512663],"genre_scores_gemma":[0.9725944,0.00001615671,0.02426505,0.002656081,0.00006559964,0.00001872735,0.00004471091,0.000006028886,0.000333179],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5495459,"threshold_uncertainty_score":0.6350663,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2127519911","doi":"","title":"Tiling Layouts with Dominoes","year":2004,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":9,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Colored; Domino; Tile; Mathematics; Hexagonal tiling; Set (abstract data type); Combinatorics; Square tiling; Tessellation (computer graphics); Plane (geometry); Unit square; Discrete mathematics; Computer science; Grid; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.01965923282744558,"gpt":0.2392991311069203,"spread":0.2196398982794747,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000732899,0.0001251121,0.00009569076,0.0001082552,0.0001267009,0.00004817571,0.0001513155,0.00009107526,0.0000481214],"category_scores_gemma":[0.00004175523,0.0001002465,0.00003413681,0.0001527832,0.00007406123,0.000002697292,0.00002261618,0.00009482122,0.00004920363],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004281474,"about_ca_system_score_gemma":0.0005943528,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001103858,"about_ca_topic_score_gemma":0.004632034,"domain_scores_codex":[0.9992119,0.00001651292,0.0001074702,0.0002917899,0.0001155485,0.0002567536],"domain_scores_gemma":[0.9994696,0.00001682996,0.00003717149,0.0001120754,0.000131143,0.0002331649],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","study_design_scores_codex":[0.0005817493,0.0003664999,0.044878,0.00007730838,0.0004392813,0.0003913608,0.0002621765,0.6309661,0.03537726,0.201798,0.002106894,0.08275543],"study_design_scores_gemma":[0.02092118,0.01652701,0.6115958,0.001270421,0.0001740848,0.001010356,0.002108592,0.01928105,0.08428956,0.1055562,0.1286292,0.008636477],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9831044,0.00005006774,0.007689672,0.00067682,0.00008016394,0.00009053219,0.00002774773,0.00001442689,0.008266183],"genre_scores_gemma":[0.994985,0.000003141505,0.002951489,0.00156645,0.0001328877,0.000003855639,0.0002029703,0.00000870819,0.0001454967],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.611685,"threshold_uncertainty_score":0.4087932,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2172037166","doi":"","title":"Approximation Algorithms for the Discrete Piercing Set Problem for Unit Disks","year":2011,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Mechanical Behavior of Composites","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of New Brunswick","funders":"","keywords":"Approximation algorithm; Set (abstract data type); Unit (ring theory); RADIUS; Algorithm; Simple (philosophy); Mathematics; Time complexity; Combinatorics; Constant (computer programming); Running time; Polynomial; Factor (programming language); Computer science; Discrete mathematics; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.1020232372391494,"gpt":0.2829609674534197,"spread":0.1809377302142703,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001900226,0.0001649006,0.0001460443,0.0002105116,0.0002115441,0.00008375273,0.0002853001,0.0000818347,0.0001374941],"category_scores_gemma":[0.00004526382,0.0001429225,0.00007146378,0.0002212957,0.00003648079,0.0001034618,0.0000118895,0.0001351339,0.00002292319],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001021149,"about_ca_system_score_gemma":0.0001589878,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007893717,"about_ca_topic_score_gemma":0.001533879,"domain_scores_codex":[0.9990748,0.00001341849,0.0002247387,0.0002002714,0.0001570828,0.0003296598],"domain_scores_gemma":[0.9989688,0.0003962386,0.00004095864,0.0001636257,0.0001974917,0.0002328433],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00006865505,0.00004401323,0.0006761908,0.0003268785,0.0002345674,0.0000048547,0.001243572,0.1855783,0.0004778858,0.6636644,0.003643104,0.1440376],"study_design_scores_gemma":[0.0003638353,0.0001138541,0.003570236,0.00005041789,0.0000397582,0.000003349343,0.0001199419,0.9537829,0.0005520068,0.03945993,0.001669583,0.0002741736],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01507384,0.00004583023,0.9805428,0.0004139328,0.0003228289,0.001161255,0.0005643403,0.0001168672,0.00175825],"genre_scores_gemma":[0.9457752,0.000002462625,0.05324636,0.000129994,0.00007495115,0.0003239539,0.0003327869,0.00003365846,0.00008061895],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9307014,"threshold_uncertainty_score":0.5828208,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.0761986086665031,"gpt":0.2723684118473931,"spread":0.19616980318089,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005681869,0.0002792645,0.0002640793,0.001768108,0.0003816016,0.0002954172,0.000580746,0.0001390154,0.0001020601],"category_scores_gemma":[0.000317737,0.0002999102,0.0000829177,0.001775331,0.00008205545,0.0005082962,0.0000838292,0.0001806972,0.0001343474],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001696815,"about_ca_system_score_gemma":0.00108406,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001564935,"about_ca_topic_score_gemma":0.0004654934,"domain_scores_codex":[0.99776,0.00006863647,0.0004260851,0.0007894457,0.0004397165,0.0005160958],"domain_scores_gemma":[0.99773,0.0004564699,0.0001647345,0.000341549,0.0006667011,0.0006405804],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001675831,0.000197924,0.0006396766,0.00008734328,0.0001764263,0.00007499594,0.001460601,0.02381744,0.00002483563,0.6127759,0.03442097,0.3261563],"study_design_scores_gemma":[0.003033517,0.0008804583,0.05758412,0.00007405007,0.00003113491,0.000110733,0.0001075774,0.8117409,0.0003765057,0.07931022,0.04556869,0.001182127],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01547483,0.0001642362,0.9710461,0.001277846,0.001132688,0.0005676617,0.0005638252,0.0001134847,0.009659308],"genre_scores_gemma":[0.925945,0.0000196079,0.07094517,0.001474828,0.0001623698,0.00005501487,0.0003893503,0.00001718967,0.0009914985],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9104701,"threshold_uncertainty_score":0.9999453,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.03807973057664759,"gpt":0.2652294900331958,"spread":0.2271497594565482,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004819845,0.0002691424,0.0002220379,0.0008493132,0.0004374992,0.0003454335,0.0006635831,0.0001258004,0.0002144042],"category_scores_gemma":[0.0001130366,0.0002920589,0.0001181945,0.001186246,0.00005502071,0.0002806635,0.00006387578,0.0001935676,0.000409466],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004288819,"about_ca_system_score_gemma":0.001608132,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006640994,"about_ca_topic_score_gemma":0.001931687,"domain_scores_codex":[0.9977068,0.00006265669,0.0003562386,0.0006906156,0.0006185839,0.0005651243],"domain_scores_gemma":[0.997968,0.0002721913,0.0001246088,0.0003230075,0.0007174166,0.0005947682],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000005798351,0.00004915152,0.00001815519,0.000006996223,0.00001815675,0.000003057529,0.00009280075,0.563543,0.00002361064,0.3247616,0.008083617,0.103394],"study_design_scores_gemma":[0.0005823794,0.0001347427,0.001103224,0.0000285812,0.00000712933,0.00002091659,0.00001439776,0.9234087,0.0001681449,0.01880959,0.05534977,0.0003723625],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003842313,0.00009476521,0.9692625,0.01645502,0.0004671919,0.000623136,0.00008798276,0.0001264514,0.009040589],"genre_scores_gemma":[0.7307652,0.000002290426,0.2659032,0.001960617,0.0003373142,0.00008251665,0.0001256454,0.00001681116,0.0008063977],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7269229,"threshold_uncertainty_score":0.9999532,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.0257945182085321,"gpt":0.2495050461420711,"spread":0.223710527933539,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003371779,0.0001838474,0.0001939769,0.0005874856,0.0003083747,0.0001520083,0.0005426913,0.00008560322,0.000111949],"category_scores_gemma":[0.0002080199,0.0001649476,0.00009999934,0.00114304,0.00008872232,0.0001705947,0.00002212692,0.0001040614,0.00002762435],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001090289,"about_ca_system_score_gemma":0.001704328,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000593545,"about_ca_topic_score_gemma":0.0005331222,"domain_scores_codex":[0.9984071,0.00009021469,0.0003718752,0.000393015,0.0004025997,0.0003352121],"domain_scores_gemma":[0.9978896,0.0007261823,0.0001598878,0.0003119867,0.0006692489,0.0002431373],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000004212185,0.00005278459,0.0001815118,0.00001697108,0.0000596223,0.00000381245,0.0001680388,0.1149703,0.00004150378,0.7207063,0.001890594,0.1619043],"study_design_scores_gemma":[0.0005546192,0.0001736372,0.006754521,0.0000207509,0.00001482713,0.00002690135,0.00005579989,0.942519,0.0002922043,0.04002221,0.00932881,0.0002367207],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003245329,0.000284272,0.9929087,0.001184648,0.0006309497,0.0004742866,0.00007525399,0.00003079606,0.001165826],"genre_scores_gemma":[0.8421531,0.00001188415,0.1562429,0.001096563,0.00007782014,0.00005780392,0.00005106122,0.00001190221,0.000297033],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8389077,"threshold_uncertainty_score":0.6726367,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02716924511353718,"gpt":0.2463687711943489,"spread":0.2191995260808117,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003719415,0.0001688947,0.0001443682,0.0003443932,0.0006906922,0.00029473,0.000827364,0.00007658174,0.00004712822],"category_scores_gemma":[0.0001230878,0.0001178917,0.0001137814,0.001269257,0.00007630718,0.0002645156,0.00004355647,0.0001761851,0.00003871787],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001317954,"about_ca_system_score_gemma":0.00102037,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004482868,"about_ca_topic_score_gemma":0.0006514001,"domain_scores_codex":[0.9983165,0.0001165102,0.0003625924,0.0003372212,0.0005635203,0.0003036045],"domain_scores_gemma":[0.9984512,0.0002530527,0.0001967018,0.0004250644,0.0004920322,0.0001819308],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002244692,0.00002791083,0.001096995,0.000004389261,0.00004239802,0.000003547079,0.0006675211,0.1343796,0.0001687174,0.763126,0.003571637,0.09688886],"study_design_scores_gemma":[0.0005344506,0.0002037498,0.3383361,0.00005136142,0.00001400898,0.00002064663,0.00004438911,0.5313054,0.001282009,0.1242815,0.003631197,0.0002952168],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1947235,0.0001868844,0.7559499,0.04038236,0.001330034,0.0006140855,0.00004513584,0.00007212345,0.006695936],"genre_scores_gemma":[0.99408,0.000003935244,0.002283918,0.002695309,0.000110967,0.000007045327,0.00002278374,0.000005626322,0.0007904009],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7993565,"threshold_uncertainty_score":0.5312316,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4452397","doi":"","title":"Characterization of Polygons Searchable by a Boundary 1-Searcher.","year":2006,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Lethbridge","funders":"","keywords":"Polygon (computer graphics); Boundary (topology); Computer science; Schedule; Visibility polygon; Combinatorics; Simple polygon; Mathematics; Monotone polygon; Geometry; Computer network","retraction":null,"screen_n_in":null,"score":{"opus":0.0312801140977795,"gpt":0.2698366473880019,"spread":0.2385565332902224,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002534605,0.000148763,0.0001723601,0.0006125639,0.0002045902,0.0002325445,0.0007273146,0.00008791225,0.0003003964],"category_scores_gemma":[0.00005875175,0.0001679969,0.00005219822,0.0009743394,0.0002063986,0.0003558352,0.0000641099,0.0001861797,0.0002041703],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001948179,"about_ca_system_score_gemma":0.001691642,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.02302672,"about_ca_topic_score_gemma":0.005760689,"domain_scores_codex":[0.998288,0.00007690499,0.0003291073,0.0003725268,0.0004999696,0.0004335236],"domain_scores_gemma":[0.9987195,0.0001582898,0.0001120927,0.0002948566,0.0004355869,0.0002797063],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001375151,0.0001873867,0.004950182,0.00003306652,0.00003485164,0.00002961178,0.0003661574,0.005665336,0.02202232,0.899491,0.007946502,0.05925988],"study_design_scores_gemma":[0.000355991,0.0004296564,0.06345355,0.0001495295,0.000009428712,0.0000272908,0.0001524461,0.6894599,0.03418998,0.183158,0.02760616,0.001008173],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4163059,0.00007122102,0.5647994,0.00576793,0.0003274269,0.0003073246,0.0003206733,0.00009931045,0.01200086],"genre_scores_gemma":[0.9944805,0.000004506804,0.003555671,0.0005104074,0.00005671586,0.00001173882,0.0002179532,0.00001176872,0.001150767],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.716333,"threshold_uncertainty_score":0.983479,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.0404761246826628,"gpt":0.2720561725661819,"spread":0.2315800478835191,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005936774,0.0001761176,0.0002019464,0.0006121481,0.000319378,0.000179039,0.0005357604,0.00009006261,0.0001277877],"category_scores_gemma":[0.0001702327,0.0001569545,0.00009166801,0.0009803033,0.00006879411,0.0003114344,0.00001365036,0.000113708,0.0000166037],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001143692,"about_ca_system_score_gemma":0.001457624,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007052447,"about_ca_topic_score_gemma":0.0008431614,"domain_scores_codex":[0.9984418,0.0001157538,0.000348642,0.0004006745,0.0003912609,0.0003018853],"domain_scores_gemma":[0.9978361,0.0007032011,0.0001660756,0.0003595334,0.0006536739,0.0002814661],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00000766123,0.00005921456,0.0000828111,0.000007558372,0.00003680588,0.000002277746,0.0001601474,0.1068914,0.00009384393,0.6473929,0.0006850552,0.2445804],"study_design_scores_gemma":[0.0005914993,0.0002267248,0.004506867,0.00001370184,0.00001156353,0.00001432976,0.00007591993,0.9496232,0.0006027039,0.03983604,0.004289257,0.0002081775],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006880086,0.0001173666,0.9898056,0.001076807,0.0005526353,0.0004698382,0.0001018038,0.00003456275,0.000961301],"genre_scores_gemma":[0.9013334,0.000003934347,0.09735283,0.000834426,0.00007874179,0.00004776026,0.0001502274,0.00001019194,0.000188496],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8944533,"threshold_uncertainty_score":0.640042,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W172707356","doi":"","title":"Realization of Degree 10 Minimum Spanning Trees in 3-Space.","year":2006,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Realization (probability); Spanning tree; Minimum spanning tree; Degree (music); Minimum degree spanning tree; Computer science; Space (punctuation); Mathematics; Combinatorics; Physics; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.04623352070635248,"gpt":0.287654651805582,"spread":0.2414211310992296,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000369627,0.0001451114,0.0001930299,0.001672361,0.00009041292,0.00008295933,0.0006283089,0.00007959497,0.0001391245],"category_scores_gemma":[0.0001339671,0.0001636538,0.00004321318,0.001856501,0.0001175213,0.000281761,0.00005483345,0.0001549426,0.00004784828],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002023861,"about_ca_system_score_gemma":0.0009385856,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_topic_score_codex":0.009425364,"about_ca_topic_score_gemma":0.03555441,"domain_scores_codex":[0.9983566,0.0001217822,0.0003084999,0.000382108,0.0004289788,0.0004019974],"domain_scores_gemma":[0.998736,0.0003080887,0.0001101119,0.0002976575,0.0003512513,0.0001968614],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000007599918,0.00002968802,0.004251677,0.000007922528,0.000004784826,0.00002739067,0.00006642284,0.09370883,0.000107264,0.8902981,0.0005916489,0.01089871],"study_design_scores_gemma":[0.0006129004,0.0001456153,0.1871073,0.0001096509,0.000002077529,0.000009026031,0.00007157731,0.3449361,0.0003033306,0.4655436,0.0008396943,0.000319125],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09451278,0.0001106932,0.8599246,0.001478483,0.0001628435,0.0002905063,0.00005237552,0.00006404093,0.04340374],"genre_scores_gemma":[0.9880242,0.000002492707,0.01111092,0.00009631919,0.00003043752,0.000009858972,0.00006266586,0.00001025597,0.0006528655],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8935114,"threshold_uncertainty_score":0.997171,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2783355325","doi":"","title":"Upward Order-Preserving 8-Grid-Drawings of Binary Trees.","year":2017,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Binary number; Binary tree; Grid; Computer graphics (images); Algorithm; Mathematics; Geometry; Arithmetic","retraction":null,"screen_n_in":null,"score":{"opus":0.05160737549822516,"gpt":0.3132392146103923,"spread":0.2616318391121672,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004468424,0.000207025,0.0002752875,0.001007254,0.0007515569,0.0004116453,0.003271655,0.0001003579,0.000247872],"category_scores_gemma":[0.0007223852,0.0002222725,0.00008429413,0.0006771045,0.0003534982,0.0007895364,0.0004360728,0.0003159463,0.0001206495],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001498165,"about_ca_system_score_gemma":0.00176439,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007399025,"about_ca_topic_score_gemma":0.006767237,"domain_scores_codex":[0.9978675,0.00008426868,0.0002967065,0.0005513511,0.0006306253,0.0005695657],"domain_scores_gemma":[0.9968992,0.0003405066,0.0001695513,0.001227229,0.000791365,0.0005720935],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002771405,0.0000656253,0.007631505,0.0000484282,0.00006623141,0.0001516486,0.0002992501,0.03097015,0.00047481,0.9227329,0.002978206,0.03455353],"study_design_scores_gemma":[0.001188784,0.0004305634,0.267414,0.0002809162,0.000009170964,0.0000312302,0.0001357904,0.410459,0.0007108055,0.3131077,0.005394885,0.0008370402],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5151331,0.0002679284,0.3758002,0.02341972,0.002107356,0.0009367694,0.0003423099,0.0002607056,0.08173184],"genre_scores_gemma":[0.9791776,0.000008869372,0.019843,0.0003756672,0.00007033598,0.00001230199,0.00002210813,0.00001595182,0.0004741953],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6096252,"threshold_uncertainty_score":0.9992108,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02769961273247762,"gpt":0.2479184367730683,"spread":0.2202188240405907,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002950461,0.0003044344,0.0002310093,0.001439327,0.0004835175,0.0004695379,0.0009090025,0.0001364795,0.0002241241],"category_scores_gemma":[0.00005959148,0.0003358947,0.0001049784,0.001264626,0.0000844984,0.0007306299,0.00006685455,0.0002817512,0.0001741516],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004594894,"about_ca_system_score_gemma":0.003656898,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_topic_score_codex":0.006978568,"about_ca_topic_score_gemma":0.03590395,"domain_scores_codex":[0.9975035,0.00006582982,0.000371924,0.0007422988,0.000706795,0.000609658],"domain_scores_gemma":[0.997836,0.00009615636,0.0001219474,0.0004440198,0.0004929515,0.001008903],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000007342388,0.0000792566,0.0002131692,0.000006517668,0.00002463793,0.00004433507,0.0004038057,0.1325382,0.00003401557,0.836016,0.0004273116,0.03020543],"study_design_scores_gemma":[0.001213973,0.0005533785,0.02883833,0.00005412619,0.00001077512,0.0001383252,0.00007921081,0.09085364,0.000189251,0.8741325,0.003146568,0.0007899491],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1965676,0.00006324326,0.7842578,0.01152544,0.0008469725,0.0003614997,0.000141463,0.0002265523,0.006009423],"genre_scores_gemma":[0.9476994,0.000003896831,0.046501,0.004940621,0.0001954421,0.00002667262,0.0004200264,0.00001797751,0.0001950132],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7511318,"threshold_uncertainty_score":0.9999093,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.0822544231741283,"gpt":0.260772768141475,"spread":0.1785183449673468,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004989253,0.0001712808,0.0001606705,0.0007543741,0.0001800988,0.00009885368,0.0005318237,0.00008673,0.00006490239],"category_scores_gemma":[0.0003959999,0.0001469286,0.00007423924,0.001146816,0.00007990281,0.0003271812,0.00004218234,0.0002254635,0.0002005159],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002608552,"about_ca_system_score_gemma":0.001577522,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001532096,"about_ca_topic_score_gemma":0.002496686,"domain_scores_codex":[0.9983588,0.0001435161,0.0002998274,0.0003673089,0.0005757867,0.0002547118],"domain_scores_gemma":[0.9978727,0.0005170832,0.0001809047,0.000354704,0.0006781228,0.0003964661],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002012304,0.00005098726,0.0001012252,0.000005334455,0.00002111342,0.00001926782,0.0002480911,0.1471584,0.00001685784,0.817206,0.02597546,0.009177138],"study_design_scores_gemma":[0.0008447626,0.0006505859,0.007836151,0.00009457795,0.00001183163,0.00009289053,0.0002379654,0.6590738,0.0003885306,0.3236163,0.006715077,0.0004375884],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2858541,0.00004641872,0.6579062,0.02539863,0.001531031,0.0005718446,0.00003390836,0.0001131077,0.02854474],"genre_scores_gemma":[0.9924846,0.000002342252,0.003625641,0.003322101,0.00009262042,0.00001532373,0.00005511295,0.000008391578,0.0003939272],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7066304,"threshold_uncertainty_score":0.5991575,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2398258650","doi":"","title":"Time-Windowed Closest Pair","year":2015,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Quadtree; Dimension (graph theory); Point (geometry); Interval (graph theory); Set (abstract data type); Computer science; Binary logarithm; Computational geometry; Data structure; Algorithm; Word (group theory); Combinatorics; Constant (computer programming); Mathematics; Theoretical computer science; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.04467829215851175,"gpt":0.2542515261167814,"spread":0.2095732339582696,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002597569,0.0001873486,0.0001815843,0.0005108961,0.000174084,0.0002973173,0.0009736451,0.00009259253,0.0002163391],"category_scores_gemma":[0.0001172418,0.0001838868,0.00004720045,0.0006766299,0.00007400011,0.0004497735,0.0001348845,0.0001943955,0.002237088],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002196172,"about_ca_system_score_gemma":0.00219008,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002644434,"about_ca_topic_score_gemma":0.0006396543,"domain_scores_codex":[0.9983076,0.00006985571,0.0002182138,0.0004753638,0.0005210848,0.0004078631],"domain_scores_gemma":[0.9978467,0.0001317016,0.00007507349,0.0004672437,0.0004218398,0.001057405],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002335501,0.0001665307,0.001725565,0.00001399426,0.00006106327,0.0003370121,0.0005658942,0.03857445,0.00001747913,0.5004117,0.2665959,0.1915071],"study_design_scores_gemma":[0.000716118,0.0002094542,0.008213755,0.00004880253,0.000003986155,0.00004293059,0.00005168495,0.876018,0.00002705336,0.04138005,0.07281667,0.000471518],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05985162,0.0002584394,0.7890081,0.01461688,0.002216454,0.0007208008,0.0003371208,0.0007081322,0.1322824],"genre_scores_gemma":[0.9641809,0.000001449203,0.03108429,0.002926805,0.0001761967,0.0000119898,0.0002227746,0.00001472959,0.001380837],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9043293,"threshold_uncertainty_score":0.9985398,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2294012348","doi":"","title":"Almost Online Square Packing","year":2014,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Competitive analysis; Logarithm; Square (algebra); Online algorithm; Advice (programming); Oracle; Packing problems; Computer science; Algorithm; Sequence (biology); Mathematics; Mathematical optimization; Upper and lower bounds","retraction":null,"screen_n_in":null,"score":{"opus":0.0393397463407652,"gpt":0.2710083307283992,"spread":0.231668584387634,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002875773,0.0001461308,0.0001439474,0.0005981618,0.0002420422,0.0003307081,0.0006725352,0.00007218542,0.0005442919],"category_scores_gemma":[0.0001883111,0.000154092,0.00004491448,0.0007896189,0.00005066859,0.0002437956,0.0000608026,0.0002067071,0.0005884965],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001272792,"about_ca_system_score_gemma":0.0007814654,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001786027,"about_ca_topic_score_gemma":0.005818189,"domain_scores_codex":[0.9985037,0.000102933,0.0002058755,0.0004068803,0.0003871382,0.000393442],"domain_scores_gemma":[0.9984118,0.0002155185,0.00006206378,0.0003234328,0.0004151504,0.0005719737],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000001437799,0.00003799935,0.0008663604,0.00001079797,0.00001088339,0.00001010647,0.0001476668,0.09301045,0.000004185288,0.8215846,0.002943174,0.08137234],"study_design_scores_gemma":[0.0002657482,0.00006503382,0.008659016,0.00004191135,0.000001360576,0.000009233502,0.00003063626,0.9522459,0.000006268494,0.02126778,0.01717975,0.00022737],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004529597,0.00001149892,0.9517449,0.01042651,0.0003360637,0.0001623444,0.00004789841,0.0001312969,0.03260989],"genre_scores_gemma":[0.9482698,0.000003746447,0.04552127,0.005284698,0.00008290416,0.000006249415,0.0001568045,0.00001107238,0.0006634105],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9437402,"threshold_uncertainty_score":0.7564129,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02609874843551627,"gpt":0.2523889027367248,"spread":0.2262901543012085,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007451346,0.0002437367,0.0001956443,0.00179267,0.0004662029,0.0003678846,0.0007614138,0.0001223904,0.0001360572],"category_scores_gemma":[0.0001152106,0.0002725236,0.00009334957,0.001849868,0.00006405569,0.0004786107,0.00004517373,0.0002862893,0.0003412513],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002515657,"about_ca_system_score_gemma":0.001015588,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002144105,"about_ca_topic_score_gemma":0.004798341,"domain_scores_codex":[0.9977149,0.0000469012,0.0003892201,0.0005871736,0.0006428356,0.000618966],"domain_scores_gemma":[0.9980622,0.0003362925,0.0001202046,0.0003258992,0.0004261271,0.0007292698],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000008359335,0.00003707554,0.0006380742,0.000008033434,0.00002988414,0.0001115995,0.0001820324,0.03638735,0.0001281471,0.917021,0.003328406,0.04211999],"study_design_scores_gemma":[0.001509204,0.0004500616,0.1660825,0.0001399773,0.0000207682,0.0002718391,0.00019351,0.3593298,0.001110009,0.435982,0.03310826,0.001802025],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04317343,0.00006907789,0.9363164,0.002634262,0.0008766275,0.0001832402,0.00002483386,0.0001563381,0.01656584],"genre_scores_gemma":[0.9480151,0.000003615773,0.04754776,0.003724247,0.0002149444,0.000006114744,0.0001242987,0.00001334157,0.0003505958],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9048417,"threshold_uncertainty_score":0.9999727,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.04666611281999775,"gpt":0.2427950566893644,"spread":0.1961289438693667,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004294607,0.000161324,0.0001536388,0.0005517491,0.0003767841,0.000143017,0.0009446474,0.00007132548,0.0001750082],"category_scores_gemma":[0.0001364659,0.0001370578,0.00008104709,0.00107831,0.0001107271,0.0002724817,0.00007693057,0.0001573261,0.0001654454],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009512086,"about_ca_system_score_gemma":0.001327753,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002050368,"about_ca_topic_score_gemma":0.002761808,"domain_scores_codex":[0.998428,0.00008482686,0.000355363,0.0003472738,0.0004329906,0.000351526],"domain_scores_gemma":[0.9981715,0.0003348232,0.0001547057,0.0003926175,0.0006044267,0.0003419021],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001322588,0.00004285275,0.0004408263,0.000006102194,0.00003009111,0.000009296336,0.0003088172,0.003498823,0.00002629389,0.9223243,0.001739723,0.07155966],"study_design_scores_gemma":[0.0008578263,0.0005385139,0.1239707,0.00007536953,0.00001575289,0.00005709366,0.0001610046,0.3288467,0.002186074,0.5341711,0.008436342,0.000683512],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1125199,0.000379158,0.7906931,0.004575264,0.002189826,0.000625399,0.0001003683,0.0001492094,0.08876783],"genre_scores_gemma":[0.9750527,0.00001298257,0.0237384,0.0006227588,0.0000528529,0.00001340326,0.00002531196,0.000008155481,0.0004734],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8625329,"threshold_uncertainty_score":0.5589054,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.0670509323113462,"gpt":0.2543895345018169,"spread":0.1873386021904707,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003685325,0.0002154652,0.0002024028,0.001450796,0.0001960073,0.0001709616,0.0004095136,0.0001073949,0.0002118146],"category_scores_gemma":[0.00008829308,0.0002444494,0.00004006787,0.001564094,0.00006862556,0.0005528053,0.00007202259,0.000199686,0.000119297],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002583535,"about_ca_system_score_gemma":0.001110961,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008669162,"about_ca_topic_score_gemma":0.007190412,"domain_scores_codex":[0.9982575,0.00009706242,0.000367832,0.0005557766,0.0003400086,0.0003818914],"domain_scores_gemma":[0.9987621,0.0001407807,0.0001105884,0.0002421581,0.0003647819,0.0003796263],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002084569,0.0001126318,0.003506426,0.00003428975,0.0000333201,0.00007002508,0.001100418,0.06270716,0.0001152217,0.8953838,0.0002854779,0.03663038],"study_design_scores_gemma":[0.0004266555,0.0001167119,0.07238744,0.00006404176,0.000005787767,0.00005021702,0.00009174801,0.8667737,0.00009443138,0.05926506,0.0003727841,0.0003513766],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2902104,0.0001874176,0.6985849,0.001229258,0.0005576595,0.0003663595,0.00001399702,0.00008702876,0.008763021],"genre_scores_gemma":[0.9550639,0.000008551696,0.0436537,0.001028566,0.00005817464,0.00001274761,0.00004650833,0.00001124155,0.0001165711],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8361188,"threshold_uncertainty_score":0.9979322,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.04038020508012392,"gpt":0.2786134197567494,"spread":0.2382332146766254,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006537775,0.0002081156,0.0002041135,0.001324305,0.0002026508,0.0002375593,0.0005144264,0.0001148924,0.0001308669],"category_scores_gemma":[0.0002111855,0.0002344492,0.00008135151,0.001279561,0.00003880872,0.0007814824,0.00004874546,0.0001726215,0.0001691065],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003424145,"about_ca_system_score_gemma":0.001218869,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009806758,"about_ca_topic_score_gemma":0.00197949,"domain_scores_codex":[0.9981723,0.00008325228,0.0003064723,0.0004037936,0.0003542916,0.0006799203],"domain_scores_gemma":[0.9983268,0.0004535645,0.00008440738,0.0002615618,0.0002968901,0.0005767666],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000006063865,0.00007041755,0.001558451,0.00001229807,0.00001294228,0.000003647675,0.0002328612,0.0243308,0.00003026443,0.9108747,0.003394912,0.05947261],"study_design_scores_gemma":[0.00185766,0.0003157573,0.2056874,0.00008797778,0.00001174264,0.0000531135,0.0001352872,0.6084315,0.0004173971,0.1100642,0.0717885,0.001149462],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03597579,0.0002631872,0.9431136,0.006116481,0.001539675,0.0005217387,0.0001041405,0.00008653343,0.01227884],"genre_scores_gemma":[0.9579061,0.000004204232,0.03932486,0.001771905,0.0003173832,0.00006721346,0.0001743251,0.00001310945,0.0004208818],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9219303,"threshold_uncertainty_score":0.9560559,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02737413182330261,"gpt":0.2344320232530039,"spread":0.2070578914297013,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001769798,0.0001620219,0.000195877,0.001330439,0.00008046249,0.0001240125,0.0004686778,0.00007729895,0.0001760557],"category_scores_gemma":[0.00003913258,0.0001682795,0.00005020546,0.001496741,0.00004464482,0.0003941426,0.00004535022,0.000139628,0.0001479501],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001564902,"about_ca_system_score_gemma":0.0007958708,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006209726,"about_ca_topic_score_gemma":0.003092299,"domain_scores_codex":[0.9984673,0.00007051243,0.0004080728,0.0003825734,0.0003686349,0.0003028702],"domain_scores_gemma":[0.9986746,0.000152815,0.0001327329,0.0002335085,0.0005535467,0.0002527696],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000007729863,0.0001538278,0.003887541,0.00004979654,0.00003119178,0.00002484011,0.0003708499,0.09410509,0.0001800268,0.7424318,0.005268658,0.1534887],"study_design_scores_gemma":[0.0007471907,0.0002095023,0.09605246,0.0001330057,0.000003860603,0.00001864996,0.00005890866,0.7164518,0.0003288554,0.1831377,0.002448327,0.0004096894],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3209513,0.0001605109,0.6470078,0.01330805,0.0005943109,0.001086095,0.00001997018,0.00009645128,0.01677555],"genre_scores_gemma":[0.9578236,0.000007523824,0.04093549,0.000775101,0.00005457175,0.00005144161,0.00006234882,0.000007095859,0.0002828529],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6368723,"threshold_uncertainty_score":0.9387289,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.0533389688352964,"gpt":0.273573053030554,"spread":0.2202340841952576,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003972954,0.0003278641,0.0002599077,0.002493747,0.000376182,0.0003453092,0.0006540475,0.0001545722,0.0004320887],"category_scores_gemma":[0.0003049614,0.0002776334,0.00006771616,0.002478913,0.0001272284,0.0004874957,0.0001073386,0.0002366198,0.0006159574],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002233889,"about_ca_system_score_gemma":0.001326506,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001063839,"about_ca_topic_score_gemma":0.00118686,"domain_scores_codex":[0.997534,0.0001573811,0.0003561958,0.0007627724,0.0006478663,0.0005417615],"domain_scores_gemma":[0.9970563,0.001053684,0.0001366924,0.0004345655,0.0005299682,0.0007887806],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","study_design_scores_codex":[0.00002522531,0.00006386307,0.003158804,0.00001726641,0.0000515197,0.00005624042,0.0001289051,0.01847089,0.00005578716,0.8309563,0.004207767,0.1428075],"study_design_scores_gemma":[0.004290019,0.001872575,0.4275443,0.0005078836,0.00003857211,0.0001932886,0.0000897734,0.2198802,0.001093723,0.2027478,0.1391455,0.002596332],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2366324,0.0001193202,0.7365659,0.01208726,0.0007890305,0.0004759062,0.0003754738,0.00019461,0.01276],"genre_scores_gemma":[0.9915457,0.00003326597,0.003369522,0.002892998,0.0001261994,0.00002298323,0.000123247,0.00001962793,0.001866424],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7549133,"threshold_uncertainty_score":0.9999676,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.03263138537768494,"gpt":0.2572229821769649,"spread":0.22459159679928,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003866566,0.0003033126,0.0002588804,0.00130227,0.0006514288,0.0006134442,0.0006826255,0.0001225922,0.0002680276],"category_scores_gemma":[0.0001809169,0.000341575,0.0001134135,0.00143735,0.00008901035,0.0005049095,0.00005796626,0.0002709491,0.0004831516],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004091973,"about_ca_system_score_gemma":0.001581594,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002044334,"about_ca_topic_score_gemma":0.00267872,"domain_scores_codex":[0.9975237,0.000202982,0.0004089251,0.0006947588,0.0005944716,0.0005751761],"domain_scores_gemma":[0.9979377,0.0003552489,0.0001273035,0.0004235798,0.0004096693,0.000746445],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000005461706,0.00008540339,0.0007454548,0.00001110355,0.00004795249,0.00003325393,0.0002211072,0.03046508,0.0002928236,0.9484866,0.001475903,0.01812992],"study_design_scores_gemma":[0.001575264,0.0003137624,0.02868871,0.0001112598,0.00002198981,0.0001731021,0.00008162184,0.4710554,0.001331272,0.44336,0.05183076,0.001456874],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1090209,0.0001376757,0.8703347,0.002754258,0.001331771,0.0002924673,0.000023627,0.0001470496,0.01595753],"genre_scores_gemma":[0.8806578,0.000004220663,0.1160328,0.002790922,0.00007071046,0.00001815733,0.0001225858,0.00001698243,0.0002858025],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7716368,"threshold_uncertainty_score":0.9999036,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.03309736335871667,"gpt":0.2452450391259678,"spread":0.2121476757672511,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000483176,0.0002364629,0.0002176412,0.0009587655,0.0002060648,0.0001724093,0.0005035554,0.0001102348,0.0002635272],"category_scores_gemma":[0.0001153769,0.0002652607,0.00006100718,0.001073037,0.00007680284,0.0007497531,0.00008000853,0.0002636193,0.000479495],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003957985,"about_ca_system_score_gemma":0.0007539613,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002089087,"about_ca_topic_score_gemma":0.001397252,"domain_scores_codex":[0.9979327,0.0001213814,0.0003624403,0.0004769909,0.0004796553,0.0006268775],"domain_scores_gemma":[0.9986256,0.0002386545,0.0001036604,0.0003300434,0.0001207978,0.0005811926],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001845621,0.0002237625,0.01073106,0.00002084101,0.0000266376,0.00004051635,0.0009474214,0.07154649,0.00009726195,0.8614641,0.001227945,0.05365552],"study_design_scores_gemma":[0.001324073,0.0003581201,0.3232808,0.000133038,0.00001190574,0.000125943,0.000294722,0.5654414,0.0005104554,0.05978408,0.04728391,0.001451533],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3381068,0.0006902926,0.6362005,0.004572496,0.001536145,0.0006763695,0.00008293177,0.0001724688,0.01796205],"genre_scores_gemma":[0.9625553,0.00002452881,0.03541685,0.001298435,0.0001664039,0.00004199863,0.00009161195,0.00001227236,0.0003925566],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.80168,"threshold_uncertainty_score":0.99998,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2604824923","doi":"","title":"The Length of the Beacon Attraction Trajectory.","year":2016,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Underwater Vehicles and Communication Systems","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Queen's University","funders":"","keywords":"Trajectory; Attraction; Computer science; Physics; Astronomy","retraction":null,"screen_n_in":null,"score":{"opus":0.02376571612090318,"gpt":0.2096249538330686,"spread":0.1858592377121654,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000125864,0.00007544541,0.00007115972,0.00008316865,0.0001717606,0.0000359098,0.0003114583,0.00004308314,0.00006290687],"category_scores_gemma":[0.000009013808,0.00004048876,0.00004381445,0.0001733412,0.00007261994,0.00005201849,0.00001046783,0.00009135345,0.00004618615],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001378922,"about_ca_system_score_gemma":0.0001768147,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001156757,"about_ca_topic_score_gemma":0.00921488,"domain_scores_codex":[0.9993973,0.00004378299,0.0001724149,0.00007853425,0.0001609779,0.0001469666],"domain_scores_gemma":[0.9993038,0.0002305336,0.00004269162,0.0002320216,0.0001056851,0.00008525134],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"observational","study_design_scores_codex":[0.00002347424,0.00004540745,0.009849538,0.00006557244,0.0003162733,0.000002279718,0.000696373,0.05513185,0.0121479,0.1501803,0.00751454,0.7640265],"study_design_scores_gemma":[0.001390749,0.0001444878,0.4839487,0.000501261,0.00003530363,0.00003333133,0.0009958354,0.05223076,0.01418032,0.02120156,0.4244939,0.0008437473],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9362229,0.0003752178,0.02685762,0.01036178,0.0009870064,0.0004498516,0.0001513625,0.0001275564,0.02446667],"genre_scores_gemma":[0.9994081,0.00002566357,0.00006779414,0.00008445876,0.00003651888,0.000009700503,0.000003359784,0.000009596442,0.0003548366],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7631828,"threshold_uncertainty_score":0.514212,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2186560431","doi":"","title":"Maximum Independent Set for Interval Graphs and Trees in Space Efficient Models.","year":2014,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Interval (graph theory); Maximal independent set; Set (abstract data type); Interval graph; Combinatorics; Space (punctuation); Independent set; Mathematics; Upper and lower bounds; Discrete mathematics; Product (mathematics); Algorithm; Computer science; Pathwidth; Graph; Line graph","retraction":null,"screen_n_in":null,"score":{"opus":0.04062558458719696,"gpt":0.28570176632086,"spread":0.2450761817336631,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006009868,0.0001804561,0.0002087276,0.001355729,0.0001469654,0.000196908,0.0006373269,0.00008102013,0.00001596623],"category_scores_gemma":[0.0001266718,0.0001901649,0.00005179516,0.0007325778,0.0001236307,0.0001978453,0.0001099081,0.0002312625,0.0000142483],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001606932,"about_ca_system_score_gemma":0.0004269461,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001485441,"about_ca_topic_score_gemma":0.01169936,"domain_scores_codex":[0.998235,0.0001022828,0.0002198032,0.0005653234,0.0003661393,0.0005114592],"domain_scores_gemma":[0.9984968,0.0004804582,0.0000585391,0.0002875888,0.0002215015,0.0004550793],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001434259,0.00001899562,0.0003714354,0.000009371942,0.000006985211,0.000006045489,0.000199143,0.1937319,0.00000768184,0.7891036,0.00007957395,0.01645096],"study_design_scores_gemma":[0.0003586666,0.00009893551,0.003872951,0.00002455681,8.576346e-7,0.000005630597,0.00004466876,0.5467315,0.00001130474,0.4485774,0.000146738,0.0001268139],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1752529,0.00004685883,0.8200243,0.002100325,0.0001674614,0.0003606585,0.00005792032,0.0000430332,0.001946609],"genre_scores_gemma":[0.985227,0.000003398065,0.01412842,0.0004719986,0.00001433547,0.00004193455,0.00002433275,0.00001209328,0.00007645527],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8099741,"threshold_uncertainty_score":0.7754698,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2402872817","doi":"","title":"Buttons & Scissors is NP-Complete.","year":2015,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Semantic Web and Ontologies","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.111604466273656,"gpt":0.2840601614178798,"spread":0.1724556951442238,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002972454,0.000199746,0.0002192913,0.0007005624,0.0001925224,0.0003511442,0.001126223,0.00009578742,0.0001862128],"category_scores_gemma":[0.0002037628,0.0002006687,0.00006609152,0.0008555123,0.0001178918,0.000287364,0.00009655015,0.0001866346,0.001279661],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002226631,"about_ca_system_score_gemma":0.002265446,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01071491,"about_ca_topic_score_gemma":0.006844671,"domain_scores_codex":[0.9981596,0.0000595039,0.0002369784,0.0005040499,0.0005254586,0.0005143904],"domain_scores_gemma":[0.9979464,0.0001972601,0.00007422375,0.0004477359,0.0004624367,0.0008718986],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000005916713,0.00004129141,0.003378438,0.000007892029,0.00003985261,0.0001128454,0.0008676247,0.004379927,0.000007959818,0.8834636,0.08670353,0.02099109],"study_design_scores_gemma":[0.001393889,0.0004428443,0.05264059,0.00007596926,0.00001589107,0.0001928383,0.0006024321,0.3856779,0.0001165749,0.4177025,0.1398959,0.001242699],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1360128,0.0004498897,0.5938613,0.09691078,0.003795459,0.0006321824,0.0002702665,0.0007008094,0.1673665],"genre_scores_gemma":[0.9696549,0.000002426324,0.02117735,0.008401959,0.00008055364,0.000008822233,0.00002566184,0.000009381463,0.0006390106],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8336421,"threshold_uncertainty_score":0.999498,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2908455634","doi":"","title":"Emanation Graph: A New t-Spanner.","year":2018,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Spanner; Computer science; Graph; Theoretical computer science; Distributed computing","retraction":null,"screen_n_in":null,"score":{"opus":0.03388365239077264,"gpt":0.2652970401426861,"spread":0.2314133877519134,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000151433,0.0001692291,0.0001389157,0.0007908836,0.0003339869,0.0003481619,0.0008746319,0.00008592582,0.0004502764],"category_scores_gemma":[0.00006404268,0.0001691056,0.00004820859,0.001044771,0.00008207973,0.0004918982,0.00009706984,0.0001497852,0.0008152241],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000123846,"about_ca_system_score_gemma":0.001463607,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01125925,"about_ca_topic_score_gemma":0.009362139,"domain_scores_codex":[0.9984584,0.00003881517,0.0002069224,0.0004923682,0.0004255674,0.0003779681],"domain_scores_gemma":[0.9983481,0.00008552333,0.00008102103,0.0004180326,0.0003918731,0.0006754659],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000004892847,0.00002363071,0.0001724991,0.000003676869,0.00001800192,0.0000209605,0.0001945079,0.001293136,0.00001419192,0.770586,0.05860182,0.1690667],"study_design_scores_gemma":[0.0006496257,0.0003576476,0.02636839,0.00008581659,0.000006238773,0.00003451479,0.00004186416,0.6625692,0.0001055984,0.2476636,0.06152909,0.0005884013],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004488775,0.00004398287,0.9725305,0.004912164,0.0008659666,0.000143083,0.00004044098,0.000126393,0.01684872],"genre_scores_gemma":[0.9366968,0.000004665931,0.05885448,0.002985341,0.0004099114,0.00000561464,0.0001061185,0.00001090464,0.0009261156],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9322081,"threshold_uncertainty_score":0.9999627,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.0630496311394427,"gpt":0.2724424684038645,"spread":0.2093928372644218,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005527287,0.0002072351,0.0001584238,0.0004285492,0.0003598483,0.000471219,0.0006744813,0.00008762506,0.0001001782],"category_scores_gemma":[0.0001146575,0.0001747182,0.00007602723,0.001073011,0.00006392346,0.0004673042,0.00007711109,0.0001629643,0.0003498598],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002163238,"about_ca_system_score_gemma":0.001622298,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009097823,"about_ca_topic_score_gemma":0.0009206042,"domain_scores_codex":[0.9982666,0.00007578091,0.0002928766,0.0004448071,0.0005442256,0.0003757016],"domain_scores_gemma":[0.9978541,0.0004575487,0.0001230323,0.0003090583,0.0007963518,0.0004599362],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000008881554,0.00004224957,0.00008469028,0.000008012109,0.00004276837,0.000004112037,0.0003001669,0.3038698,0.000003446953,0.3036698,0.0208359,0.3711302],"study_design_scores_gemma":[0.0005540722,0.0001306639,0.001271189,0.00001289966,0.000009142154,0.00001628879,0.00004045095,0.8858624,0.00002195077,0.07473604,0.03712663,0.0002182517],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0007137588,0.00006347144,0.9863892,0.006389597,0.0005673072,0.0006434972,0.00008821809,0.0000654504,0.005079523],"genre_scores_gemma":[0.6780989,0.000004260186,0.3138973,0.004563015,0.000359959,0.0002298417,0.0003945054,0.0000240532,0.002428221],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6773851,"threshold_uncertainty_score":0.71248,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02848420590755417,"gpt":0.2638921882300127,"spread":0.2354079823224585,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002837602,0.0002329645,0.0002130559,0.0008371538,0.0005611164,0.0005039274,0.0004744167,0.0001046397,0.00002234078],"category_scores_gemma":[0.0001735885,0.000264003,0.00007329984,0.0008575887,0.00007523085,0.0004499404,0.00007588167,0.0001732839,0.00005563318],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002349125,"about_ca_system_score_gemma":0.001629828,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001705321,"about_ca_topic_score_gemma":0.002335955,"domain_scores_codex":[0.9982315,0.0000370656,0.0003102823,0.000609008,0.0003294119,0.0004827648],"domain_scores_gemma":[0.9982468,0.0004445725,0.0001079442,0.0002433314,0.0003955752,0.0005617658],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000006173467,0.00003061606,0.00008947203,0.00001444599,0.00002380174,0.000008179873,0.0001950317,0.1168613,0.0000517458,0.8296044,0.0003603975,0.05275434],"study_design_scores_gemma":[0.002629525,0.0005565732,0.03587692,0.0001348553,0.00002193716,0.0001416918,0.0001455368,0.6357786,0.0003944789,0.3145851,0.008680854,0.001053939],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05836974,0.0001444065,0.92965,0.00874744,0.0005221806,0.0003519835,0.00008242012,0.0001102549,0.002021534],"genre_scores_gemma":[0.8975875,0.000005305407,0.09885318,0.00311163,0.0001693905,0.0000155322,0.0001319824,0.00001358151,0.0001119444],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8392177,"threshold_uncertainty_score":0.9999812,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.05257903836359342,"gpt":0.2725959820000142,"spread":0.2200169436364208,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002748257,0.0002283165,0.0001890524,0.001183683,0.0004047387,0.0004207246,0.0007461999,0.000102307,0.0004374635],"category_scores_gemma":[0.000112943,0.0002559578,0.00008400615,0.001748882,0.00004519584,0.0004946552,0.00007041647,0.0002296074,0.0008302848],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002500137,"about_ca_system_score_gemma":0.001342489,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001433791,"about_ca_topic_score_gemma":0.002036028,"domain_scores_codex":[0.9980099,0.00006858238,0.0003131336,0.000573574,0.0005302487,0.0005045765],"domain_scores_gemma":[0.9983116,0.0001733742,0.0000955631,0.0003499309,0.0004598144,0.0006097439],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000007691465,0.00005346727,0.0007904748,0.000007410442,0.00003344639,0.0001178366,0.0001913257,0.1794423,0.00005387235,0.6909651,0.004236508,0.1241006],"study_design_scores_gemma":[0.0006414246,0.0001874791,0.03248713,0.00005713545,0.000007620786,0.0002173657,0.00006319782,0.8069023,0.00008170695,0.08310499,0.07553272,0.0007169343],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05987838,0.0001241119,0.8883646,0.00903123,0.001104817,0.0002471957,0.00002479429,0.0002147483,0.04101017],"genre_scores_gemma":[0.9730166,0.00001579616,0.02111783,0.00401552,0.0002619282,0.00001675845,0.0001089704,0.00001293986,0.001433706],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9131382,"threshold_uncertainty_score":0.9999893,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02250077548283974,"gpt":0.2500785208696665,"spread":0.2275777453868267,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000730049,0.000255908,0.0002020262,0.00154814,0.0003873415,0.0003780815,0.0005918032,0.00009723725,0.0001256768],"category_scores_gemma":[0.00009200753,0.0002437152,0.0000606806,0.001961217,0.00008512531,0.0001777737,0.00005718629,0.0002850881,0.0002366142],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004306575,"about_ca_system_score_gemma":0.001335825,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001142849,"about_ca_topic_score_gemma":0.004156295,"domain_scores_codex":[0.9976703,0.00004892422,0.0003419458,0.0006064794,0.000721478,0.000610874],"domain_scores_gemma":[0.9978908,0.0003942949,0.0001183762,0.0003213459,0.0006032183,0.0006720101],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001381668,0.00004689575,0.0002741686,0.000006554197,0.00002499674,0.00007436296,0.0001401068,0.4951856,0.00002747752,0.4793583,0.000365219,0.02448257],"study_design_scores_gemma":[0.0007289964,0.0003258649,0.02235652,0.00008595707,0.00001083423,0.0001550086,0.0001260349,0.9550595,0.0002569282,0.01478668,0.00545337,0.00065435],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08461986,0.00003892051,0.9003203,0.001712462,0.0005224074,0.0002056256,0.00001243665,0.000100645,0.01246736],"genre_scores_gemma":[0.9326467,8.793629e-7,0.06509992,0.001661033,0.0001471531,0.000008837083,0.00006265989,0.00001404135,0.0003587756],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8480268,"threshold_uncertainty_score":0.9938419,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2140740564","doi":"","title":"Multidimensional Orthogonal Range Search Using Tries.","year":2003,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of New Brunswick","funders":"","keywords":"Rectangle; Range (aeronautics); Competitive analysis; Set (abstract data type); Algorithm; Space (punctuation); Computer science; Range query (database); Online algorithm; Combinatorics; Search algorithm; Mathematics; Theoretical computer science; Search engine; Information retrieval; Upper and lower bounds; Web search query; Engineering; Geometry; Sargable","retraction":null,"screen_n_in":null,"score":{"opus":0.06550581335891824,"gpt":0.2802458608807452,"spread":0.2147400475218269,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004486314,0.000198825,0.0001758936,0.0008228378,0.000346052,0.0002980864,0.0005913869,0.00006844674,0.0006186973],"category_scores_gemma":[0.0000835088,0.0002109621,0.00006422359,0.001022807,0.00008667968,0.0005025541,0.00008401575,0.0002187625,0.0003702694],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001941022,"about_ca_system_score_gemma":0.001690159,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001792093,"about_ca_topic_score_gemma":0.0007914428,"domain_scores_codex":[0.9979762,0.0001103115,0.0002351011,0.000530887,0.0006193431,0.0005281152],"domain_scores_gemma":[0.9986491,0.0001588915,0.00005481171,0.0003367726,0.0002903376,0.0005100539],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000003209487,0.00003737699,0.001042056,0.000007566262,0.00002892255,0.00006829362,0.00005147797,0.01582654,0.00000876809,0.9694266,0.001558913,0.01194026],"study_design_scores_gemma":[0.001094562,0.00009396183,0.01044731,0.00004937403,0.000009835324,0.00003293669,0.00008398353,0.9484717,0.00007175733,0.01671916,0.02228676,0.0006386833],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09372063,0.00009580059,0.879312,0.001921066,0.001152146,0.0004142155,0.0001694834,0.0001313824,0.02308323],"genre_scores_gemma":[0.8879965,0.000004018871,0.1095282,0.001591121,0.00007391609,0.000003739994,0.0001024585,0.00001338735,0.0006866029],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9527075,"threshold_uncertainty_score":0.8602784,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Bounded function; Normalization (sociology); Curvature; Mathematics; Path (computing); Computer science; Mathematical analysis; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.01295605834622334,"gpt":0.2180384118051253,"spread":0.2050823534589019,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002464576,0.0002403407,0.0001760858,0.000926102,0.0004415869,0.0005568539,0.0005733988,0.0001365606,0.0001962646],"category_scores_gemma":[0.00005364798,0.0002643451,0.00007494643,0.001595744,0.0000511912,0.0005882542,0.00005106237,0.0002131482,0.000329548],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002855835,"about_ca_system_score_gemma":0.001371816,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003979692,"about_ca_topic_score_gemma":0.005739437,"domain_scores_codex":[0.9979914,0.0000764457,0.0003443398,0.0005473967,0.0005930852,0.0004472756],"domain_scores_gemma":[0.9985313,0.0001379579,0.0001299664,0.0003129427,0.0005617643,0.0003260836],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00000280946,0.00004061392,0.0004202467,0.000006887082,0.00001131019,0.00002114031,0.00003944726,0.1186965,0.00002717851,0.8638806,0.008944138,0.007909096],"study_design_scores_gemma":[0.0005667185,0.0001324292,0.0507681,0.00003983115,0.000009168016,0.00005348636,0.00001767495,0.6484442,0.0001362954,0.2578853,0.0413304,0.0006163693],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02500541,0.0001224298,0.9345096,0.004137985,0.0009086764,0.0002694681,0.00006960259,0.000200455,0.03477637],"genre_scores_gemma":[0.9668527,0.000003811856,0.02864541,0.002322484,0.000300948,0.00001921681,0.0006641229,0.00001390964,0.001177386],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9418473,"threshold_uncertainty_score":0.9999809,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W165396895","doi":"","title":"K-Nearest Neighbor Search using the Pyramid Technique.","year":2006,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of New Brunswick","funders":"","keywords":"Pyramid (geometry); k-nearest neighbors algorithm; RADIUS; Best bin first; Nearest neighbor graph; Nearest neighbor search; Nearest-neighbor chain algorithm; Range (aeronautics); Point (geometry); Range query (database); Mathematics; Computer science; Pattern recognition (psychology); Algorithm; Artificial intelligence; Combinatorics; Geometry; Search engine; Information retrieval; Cluster analysis; Web search query","retraction":null,"screen_n_in":null,"score":{"opus":0.04234192041526704,"gpt":0.2690653430377264,"spread":0.2267234226224593,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003321209,0.0001592955,0.0001164153,0.0005515924,0.0004152929,0.0007250426,0.001274665,0.00005508286,0.0001345879],"category_scores_gemma":[0.00001809414,0.0001345855,0.00004681569,0.001111447,0.0001230558,0.0003805865,0.0001579021,0.0002200421,0.0001441538],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001789497,"about_ca_system_score_gemma":0.0007405661,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.02386615,"about_ca_topic_score_gemma":0.00443914,"domain_scores_codex":[0.9984418,0.00006019503,0.0001944207,0.000395789,0.0004650658,0.0004426889],"domain_scores_gemma":[0.998996,0.0001159614,0.00005317559,0.0004473826,0.000201597,0.000185932],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000001802048,0.00002830915,0.0005418776,0.000008387229,0.00001419252,0.00005894303,0.00002573104,0.02988347,0.00003958682,0.9454305,0.005021274,0.01894595],"study_design_scores_gemma":[0.0001895945,0.0000595707,0.01248828,0.00003522048,0.00000555418,0.00002152367,0.00004273995,0.935026,0.000112969,0.03949968,0.01219313,0.0003256694],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00622216,0.00003740421,0.9696585,0.004957411,0.0003216359,0.0003950076,0.00008280575,0.00011054,0.01821453],"genre_scores_gemma":[0.9611409,0.000001772226,0.03685314,0.001125814,0.0001625276,0.00001639037,0.0001016609,0.00001164973,0.0005861534],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9549187,"threshold_uncertainty_score":0.982634,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W129388523","doi":"","title":"On the Computation and Chromatic Number of Colored Domino Tilings.","year":2005,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Regina","funders":"","keywords":"Colored; Domino; Rectangle; Polygon (computer graphics); Mathematics; Combinatorics; Set (abstract data type); Simple (philosophy); Computer science; Frame (networking); Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.02039873376255215,"gpt":0.2572388969856839,"spread":0.2368401632231317,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001818535,0.0001222647,0.0001387348,0.000198912,0.0001991749,0.0001282156,0.0003849136,0.00005078051,0.000150569],"category_scores_gemma":[0.00005379786,0.0001031842,0.00003572964,0.0004702438,0.0001097067,0.0001170299,0.00003912841,0.0001189522,0.0002291692],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008445507,"about_ca_system_score_gemma":0.0003923524,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006632396,"about_ca_topic_score_gemma":0.0007668461,"domain_scores_codex":[0.9990039,0.00004539037,0.0002316497,0.0002645136,0.000265695,0.0001887996],"domain_scores_gemma":[0.9988299,0.0004970361,0.0001094695,0.0002260391,0.0001584994,0.0001790479],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000002364242,0.00003669492,0.0001392791,0.000009241912,0.00001578664,0.00000194636,0.000236867,0.009613825,0.00004960978,0.9660699,0.001763996,0.02206048],"study_design_scores_gemma":[0.000287494,0.00004865045,0.01425076,0.00004069057,0.000005935971,0.00002077239,0.00004099702,0.9260005,0.0001810126,0.05792862,0.001033162,0.0001614598],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7662101,0.0000272911,0.209512,0.01154881,0.0000928291,0.000374522,0.00004365582,0.00006347312,0.01212724],"genre_scores_gemma":[0.9848792,0.000002568195,0.013565,0.001377357,0.00002640075,0.00001812458,0.00003113854,0.000006335677,0.00009388118],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9163866,"threshold_uncertainty_score":0.420773,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2293145487","doi":"","title":"An In-Place Priority Search Tree","year":2011,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Tree (set theory); Search tree; Data structure; Set (abstract data type); Point (geometry); Range tree; Segment tree; K-ary tree; Tree structure; Interval tree; Space (punctuation); Theoretical computer science; Data mining; Algorithm; Search algorithm; Mathematics; Combinatorics","retraction":null,"screen_n_in":null,"score":{"opus":0.05831943655892484,"gpt":0.2812326171816245,"spread":0.2229131806226997,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003256507,0.0001572037,0.0001558112,0.0007627408,0.0001533374,0.00017284,0.001146744,0.00009079522,0.0002920375],"category_scores_gemma":[0.00002608759,0.0001613114,0.0000298641,0.0007739718,0.00005798694,0.0006364022,0.00008959229,0.00027806,0.000212319],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001803323,"about_ca_system_score_gemma":0.001429385,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_topic_score_codex":0.02723455,"about_ca_topic_score_gemma":0.02654904,"domain_scores_codex":[0.9983569,0.0001015275,0.000210978,0.0005222824,0.000371676,0.0004366283],"domain_scores_gemma":[0.9985688,0.00008127921,0.00004228223,0.0005027483,0.0001931944,0.0006116902],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002184799,0.000235479,0.01158939,0.00001345928,0.00001346483,0.0002571262,0.001515202,0.004664905,0.00004047942,0.739198,0.001072413,0.2413782],"study_design_scores_gemma":[0.0004305812,0.0002286117,0.3044531,0.00004128863,0.00000151569,0.000017952,0.00009529106,0.671657,0.00008752384,0.02156622,0.00106894,0.0003519668],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3037485,0.00006751798,0.6515759,0.001257044,0.0007907873,0.0004378966,0.0001310482,0.0001887608,0.04180259],"genre_scores_gemma":[0.9476177,0.000003807298,0.05162214,0.000570915,0.0000434525,0.000006841449,0.00005456536,0.000007860193,0.00007268208],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7176318,"threshold_uncertainty_score":0.9912139,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2113703646","doi":"","title":"On the nonexistence of dimension reduction for $\\ell2_2$ metrics.","year":2008,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Dimension (graph theory); Metric (unit); Dimensionality reduction; Combinatorics; Dimension function; Metric dimension; Reduction (mathematics); Embedding; Lemma (botany); Discrete mathematics; Effective dimension; Metric space; Euclidean distance; Hausdorff dimension; Computer science; Graph","retraction":null,"screen_n_in":null,"score":{"opus":0.08041085738545625,"gpt":0.2616961247978016,"spread":0.1812852674123453,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000303081,0.0001478753,0.0001758712,0.0007699401,0.0004881742,0.00005649463,0.0007477568,0.0000630834,0.00006424941],"category_scores_gemma":[0.0002367766,0.0001244321,0.000100654,0.001401394,0.0001969704,0.0001227005,0.00004729633,0.0001721398,0.00004024894],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000109244,"about_ca_system_score_gemma":0.0007046491,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001448614,"about_ca_topic_score_gemma":0.0002276603,"domain_scores_codex":[0.9985951,0.00005501853,0.0002573658,0.0003769272,0.0004346321,0.0002809893],"domain_scores_gemma":[0.9980268,0.0008193627,0.0001332792,0.0003890005,0.0004332921,0.0001982807],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000009130471,0.00004208621,0.00003613645,0.000007277425,0.00001559193,0.000005396916,0.0001640669,0.006134881,0.00003084937,0.9826964,0.003075163,0.007783004],"study_design_scores_gemma":[0.0005635149,0.0006927202,0.006978327,0.00009956221,0.000008754639,0.00009313202,0.0001116492,0.5793054,0.001029016,0.4086625,0.002022842,0.0004326887],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1997704,0.0001220086,0.7744947,0.01083806,0.001803908,0.0009789045,0.0001701587,0.0001082589,0.01171361],"genre_scores_gemma":[0.9763702,0.000009736022,0.02259333,0.0007564962,0.00004964544,0.00002105672,0.00001989686,0.000007103459,0.0001726046],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7765997,"threshold_uncertainty_score":0.5074195,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02099672393193426,"gpt":0.2391670746110382,"spread":0.218170350679104,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003232096,0.0002135421,0.0001893944,0.0009357132,0.0004443012,0.0004377127,0.0005541477,0.0001050322,0.0001477973],"category_scores_gemma":[0.00008318921,0.000236453,0.00010606,0.0008850179,0.00004689963,0.0003591693,0.00004138712,0.0001383448,0.000168964],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003122371,"about_ca_system_score_gemma":0.001429722,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00210217,"about_ca_topic_score_gemma":0.006331849,"domain_scores_codex":[0.9982204,0.00004448705,0.0003406513,0.0005541523,0.0003664384,0.0004738008],"domain_scores_gemma":[0.9983988,0.0003356078,0.000112779,0.0002761991,0.0005556931,0.0003209077],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00000725368,0.0000472059,0.0001525409,0.00001128128,0.00001530654,0.0000100418,0.00002879918,0.07989791,0.00003475514,0.8779983,0.02448488,0.01731176],"study_design_scores_gemma":[0.0007662631,0.0002309856,0.01813621,0.00002979581,0.000007881375,0.00003266284,0.00001294385,0.5406697,0.0002752136,0.3693996,0.06991603,0.0005226455],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01770006,0.00007854349,0.9548146,0.008304976,0.001007608,0.0004357367,0.00009507935,0.0001453174,0.01741805],"genre_scores_gemma":[0.9264246,0.000001754293,0.06883907,0.001896874,0.0003540039,0.00006751647,0.0003525757,0.00001483804,0.002048808],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9087245,"threshold_uncertainty_score":0.9642274,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01531333210797006,"gpt":0.2375764296703209,"spread":0.2222630975623508,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006040669,0.0003160092,0.0002993062,0.001192807,0.0005117012,0.0005186544,0.0009423522,0.0001467934,0.0003657901],"category_scores_gemma":[0.0003168211,0.0003461473,0.0001137376,0.001450115,0.0000877151,0.000502536,0.0001068377,0.0003269336,0.0005854032],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000235545,"about_ca_system_score_gemma":0.001727428,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002031949,"about_ca_topic_score_gemma":0.005116633,"domain_scores_codex":[0.9973096,0.0001778886,0.0004474896,0.0007613517,0.0007370001,0.000566649],"domain_scores_gemma":[0.9974098,0.0005180996,0.0001693264,0.0004410766,0.0006485154,0.0008132325],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000005825003,0.000031459,0.0007798558,0.00001274567,0.00002924169,0.00001671802,0.0001626332,0.09475628,0.00009541457,0.8131275,0.001572767,0.08940953],"study_design_scores_gemma":[0.0006387271,0.0002484382,0.03674692,0.00006111389,0.000009550008,0.00005404104,0.00002997556,0.7949308,0.0001310344,0.1267135,0.03973969,0.0006961969],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05302281,0.00007097038,0.9205445,0.005569782,0.0009220311,0.0002201571,0.00001877514,0.0001871775,0.01944378],"genre_scores_gemma":[0.9402767,0.000004084627,0.0525176,0.006147094,0.0002652846,0.00001893403,0.000187985,0.00001819159,0.000564123],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8872539,"threshold_uncertainty_score":0.999899,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2397167913","doi":"","title":"A Data Structure Supporting Exclusion Persistence Range Search.","year":2012,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of New Brunswick","funders":"","keywords":"Computer science; Set (abstract data type); Data structure; Range (aeronautics); Block (permutation group theory); Space (punctuation); Persistence (discontinuity); Range query (database); Algorithm; Web search query; Mathematics; Combinatorics; Information retrieval; Sargable; Search engine","retraction":null,"screen_n_in":null,"score":{"opus":0.1086784657414278,"gpt":0.3023750248869566,"spread":0.1936965591455287,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005492818,0.0001807942,0.0001527076,0.0005523775,0.000341259,0.0004144161,0.002330969,0.00006353254,0.0005012168],"category_scores_gemma":[0.00009855638,0.0001815995,0.00003383975,0.0007818026,0.00006373295,0.001714155,0.0007170299,0.0002321509,0.0002501518],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001360424,"about_ca_system_score_gemma":0.0005639555,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001974101,"about_ca_topic_score_gemma":0.001980857,"domain_scores_codex":[0.997895,0.00006508967,0.0002217571,0.0005368147,0.0005705454,0.0007108196],"domain_scores_gemma":[0.9981235,0.000109133,0.00008221732,0.0008756465,0.0001518506,0.0006576331],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001040037,0.0001258371,0.01963172,0.00009553781,0.0001137988,0.000106409,0.001425173,0.003377087,0.00004688903,0.5603988,0.04273512,0.3719332],"study_design_scores_gemma":[0.0004782864,0.00007464834,0.04704701,0.00006828555,0.00001608057,0.00003091839,0.000396086,0.914767,0.00002279417,0.004986902,0.03145255,0.0006594199],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1068349,0.0003656059,0.8447862,0.01462594,0.002994446,0.0009121335,0.003716356,0.0003798911,0.02538447],"genre_scores_gemma":[0.9649974,0.0000046842,0.03185187,0.001533597,0.0002457398,0.000002412251,0.00103769,0.00001037327,0.0003162686],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9113899,"threshold_uncertainty_score":0.7405413,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.0278149769113654,"gpt":0.2411485933884939,"spread":0.2133336164771285,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000445247,0.0003306673,0.0003633215,0.001545384,0.0004931975,0.0001189969,0.0008842593,0.0001523529,0.00008388958],"category_scores_gemma":[0.0001329335,0.0003812877,0.000108458,0.00422971,0.000113792,0.000455039,0.0001185284,0.0002474058,0.0004227495],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003311849,"about_ca_system_score_gemma":0.001782695,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001370045,"about_ca_topic_score_gemma":0.001033954,"domain_scores_codex":[0.9967913,0.000114752,0.0007275211,0.0008131799,0.0009680473,0.000585203],"domain_scores_gemma":[0.9965782,0.0003302673,0.0002930693,0.0004852986,0.001631292,0.0006818405],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001050223,0.0001006316,0.002624173,0.000024148,0.00003200638,0.000005920175,0.0001813688,0.8067718,0.00002273884,0.1715875,0.003766614,0.01487256],"study_design_scores_gemma":[0.0007766943,0.0003043374,0.09999847,0.00009307703,0.000008872715,0.0001059667,0.00001952005,0.8427004,0.00005906496,0.04510209,0.01023083,0.0006006583],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04200441,0.00008611762,0.9519481,0.0024424,0.000489463,0.0006664839,0.00008714267,0.0001130676,0.002162792],"genre_scores_gemma":[0.9214062,0.000007320803,0.07499099,0.002416317,0.0002299096,0.00008154567,0.0006504246,0.00002213461,0.0001951624],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8794018,"threshold_uncertainty_score":0.9998639,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02632379849969603,"gpt":0.2428773898434252,"spread":0.2165535913437291,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0003811796,0.0002308019,0.0002017506,0.001011409,0.0003812909,0.0004096065,0.0007434255,0.00009847369,0.0002731281],"category_scores_gemma":[0.0001186295,0.0002563751,0.0000817192,0.001207416,0.00004876794,0.000588898,0.00006642255,0.0002445535,0.0008638952],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003408689,"about_ca_system_score_gemma":0.001250528,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006020359,"about_ca_topic_score_gemma":0.001739831,"domain_scores_codex":[0.9979504,0.00007295617,0.0003940757,0.0005612675,0.0005374911,0.0004838129],"domain_scores_gemma":[0.9984109,0.0002083525,0.0001244986,0.0003401634,0.0003590315,0.0005570136],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000002497796,0.00003450815,0.00009463611,0.000006739609,0.00001806189,0.00001079436,0.0001404857,0.1906071,0.00002385669,0.6464404,0.005960237,0.1566606],"study_design_scores_gemma":[0.0004345333,0.00008056372,0.003700577,0.00002999884,0.000004502249,0.00005807443,0.00002627814,0.9145275,0.0001518491,0.03982959,0.0407248,0.0004317685],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01464461,0.0001465156,0.9359847,0.01279225,0.0006054379,0.0002864358,0.00004830167,0.000227725,0.03526397],"genre_scores_gemma":[0.8436591,0.000003889569,0.1517665,0.003315281,0.0003308781,0.00002007855,0.0001429289,0.00001235668,0.0007489497],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8290145,"threshold_uncertainty_score":0.9999889,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.05597492171867002,"gpt":0.2464458404073397,"spread":0.1904709186886697,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002800346,0.0001926503,0.0001855337,0.001402812,0.0001398817,0.0001555336,0.0005736016,0.00009201605,0.0005392389],"category_scores_gemma":[0.00008450185,0.0002182021,0.00005239577,0.001386061,0.0000596976,0.0003608647,0.00005799311,0.000208977,0.0002795965],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000214758,"about_ca_system_score_gemma":0.001182504,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008000307,"about_ca_topic_score_gemma":0.0131778,"domain_scores_codex":[0.9983532,0.00008127113,0.0003360639,0.0004639439,0.0003565182,0.0004090295],"domain_scores_gemma":[0.9988538,0.0001460317,0.00007339252,0.0002632794,0.0002921491,0.0003713326],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001132046,0.00009311322,0.001575893,0.00001279274,0.00001544635,0.0001101342,0.0007909652,0.03400699,0.00001087249,0.9320822,0.001203253,0.03008697],"study_design_scores_gemma":[0.0007892773,0.0002675991,0.2122093,0.00007463246,0.000004515617,0.00006151238,0.0001263881,0.5803666,0.0001875467,0.203411,0.001904085,0.0005975232],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2299583,0.0002233899,0.6472912,0.004261881,0.001644782,0.0007531479,0.0001011648,0.0002470086,0.1155191],"genre_scores_gemma":[0.9601918,0.000006089912,0.03761746,0.001791148,0.00004558507,0.00002399813,0.00006354454,0.000009565462,0.0002507766],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7302336,"threshold_uncertainty_score":0.9986055,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2604600966","doi":"","title":"Progressive Alignment of Shapes.","year":2016,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Modular Robots and Swarm Intelligence","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.02415765520877342,"gpt":0.2314024520731452,"spread":0.2072447968643718,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00005264883,0.0001009845,0.0001132245,0.0002334758,0.00002956175,0.0000155747,0.0001485952,0.00004715822,0.001467373],"category_scores_gemma":[0.00002181718,0.00007882565,0.00003079983,0.0001522343,0.0000555982,0.0000460797,0.000007672948,0.00004772603,0.0001505581],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001222698,"about_ca_system_score_gemma":0.0001821645,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004049646,"about_ca_topic_score_gemma":0.0005306859,"domain_scores_codex":[0.9993064,0.000009175801,0.0001637211,0.0001345151,0.0001828541,0.0002032721],"domain_scores_gemma":[0.99949,0.0000599105,0.00002669452,0.0000910817,0.000119559,0.0002127589],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000009793241,0.00003888912,0.001538396,0.00007696854,0.0001422639,0.0000865855,0.0002036106,0.1763465,0.001186989,0.3314007,0.00556453,0.4834048],"study_design_scores_gemma":[0.002346281,0.000963069,0.1072027,0.002160155,0.00006697036,0.0001318208,0.0004025488,0.6930602,0.03125585,0.1240598,0.03523381,0.003116786],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4567472,0.0006792528,0.4890549,0.002577821,0.001014767,0.0006762252,0.0006050899,0.0002338241,0.04841094],"genre_scores_gemma":[0.9988113,0.00001088639,0.0008626201,0.00009809155,0.00003258814,0.000009649607,0.000009591194,0.00001187488,0.0001533886],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5420641,"threshold_uncertainty_score":0.9994454,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}