{"meta":{"query_hash":"d040838b2c79","filters":{"venue":"Canadian Conference on Computational Geometry"},"cohort_total":115,"direct_labels_cover":0,"predictions_cover":115,"exported":115,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/d040838b2c79","api":"https://metacan.xera.ac/api/v1/cohort?venue=Canadian+Conference+on+Computational+Geometry"},"results":[{"id":"W10199753","doi":"10.1210/jcem.84.4.5617","title":"The Steiner Ratio for Obstacle-Avoiding Rectilinear Steiner Trees","year":2008,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Steiner tree problem; Obstacle; Combinatorics; Mathematics; Set (abstract data type); Computer science; Discrete mathematics; Mathematical optimization; Geography","score_opus":0.04271413218695374,"score_gpt":0.23622477898947547,"score_spread":0.19351064680252172,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W10199753","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7744617,0.0015493854,0.18040012,0.0006552964,0.00014073419,0.00012698352,0.00066666084,0.00037896086,0.0416202],"genre_scores_gemma":[0.94183457,0.0006118335,0.055035956,0.00003849954,0.000030629064,0.000042963515,0.00040437948,0.0000696815,0.0019313442],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994911,0.00014131945,0.000046598972,0.00006379367,0.00018823118,0.000068883004],"domain_scores_gemma":[0.998659,0.00080791605,0.0002557471,0.000098820514,0.00010698628,0.0000714365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048900035,0.0003717735,0.00031304886,0.0013021309,0.0003429585,0.0007723818,0.00059309055,0.00038822577,0.0040520974],"category_scores_gemma":[0.004254074,0.00021342348,0.00034824104,0.0010489373,0.00050319236,0.001320457,0.00078929897,0.0003913797,0.0005791691],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013398852,0.000106119915,0.01836432,0.0005641496,0.00013237768,0.003222606,0.0006818341,0.25823966,0.025077978,0.44534484,0.009906891,0.23701923],"study_design_scores_gemma":[0.00016426295,0.0008938328,0.0127359275,0.00008843913,0.00008565539,0.012163229,0.0009117616,0.6102403,0.0129669495,0.32989022,0.019745938,0.00011352215],"about_ca_topic_score_codex":0.00033392347,"about_ca_topic_score_gemma":0.0005451896,"teacher_disagreement_score":0.0040520974,"about_ca_system_score_codex":0.0003221317,"about_ca_system_score_gemma":0.0002338556,"threshold_uncertainty_score":0.013555646},"labels":[],"label_agreement":null},{"id":"W105892904","doi":"","title":"Approximate Orthogonal Range Search using Patricia Tries","year":2005,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Rectangle; Range query (database); Combinatorics; Range (aeronautics); Mathematics; Boundary (topology); Set (abstract data type); Trie; Range tree; Binary logarithm; Computational geometry; Data structure; Discrete mathematics; Algorithm; Computer science; Tree structure; Geometry; Binary tree; Sargable; Search engine; Interval tree; Mathematical analysis","score_opus":0.05859047501254531,"score_gpt":0.2789679369922952,"score_spread":0.22037746197974992,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W105892904","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11629083,0.00069897703,0.868032,0.00039571148,0.000083893596,0.00033234656,0.0005470067,0.00583169,0.007787583],"genre_scores_gemma":[0.41957667,0.00027492552,0.57525563,0.00022052691,0.000055420318,0.00044986737,0.0015148501,0.00023847044,0.0024136305],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9963387,0.0011012655,0.0004244253,0.00067015545,0.0010605023,0.00040502573],"domain_scores_gemma":[0.99386966,0.0025040086,0.00064176164,0.0018784516,0.0009249789,0.00018114499],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022781424,0.00095164357,0.0017975672,0.0025313545,0.00090425153,0.0021349855,0.0024784128,0.0013003083,0.0033749135],"category_scores_gemma":[0.015855344,0.00058300636,0.001169679,0.004025708,0.0010192251,0.0038908676,0.0035006145,0.00096285454,0.0017133312],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019084358,0.00041506952,0.017208444,0.0005524839,0.00032457954,0.00068430783,0.0011282634,0.33401662,0.016478613,0.082705304,0.01658289,0.527995],"study_design_scores_gemma":[0.0001483863,0.00029561887,0.00072936254,0.000028446757,0.000046443394,0.00057863555,0.00020894317,0.9619691,0.008695387,0.021927176,0.0053298348,0.000042633124],"about_ca_topic_score_codex":0.0021530269,"about_ca_topic_score_gemma":0.0024966816,"teacher_disagreement_score":0.0033749135,"about_ca_system_score_codex":0.00062182354,"about_ca_system_score_gemma":0.0014380374,"threshold_uncertainty_score":0.012048125},"labels":[],"label_agreement":null},{"id":"W106774954","doi":"","title":"k-star-shaped polygons.","year":2010,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Star (game theory); Computer science; Astronomy; Physics; Astrophysics","score_opus":0.021260620510737852,"score_gpt":0.2466922709916981,"score_spread":0.22543165048096026,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W106774954","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.071988255,0.000864415,0.8315664,0.000379493,0.0004524168,0.00028093558,0.002943266,0.002653955,0.0888708],"genre_scores_gemma":[0.48974746,0.0011476316,0.4505206,0.00021577622,0.00005104158,0.00014148299,0.0047898083,0.0011582838,0.052227926],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995427,0.00006608614,0.00005536822,0.00010174009,0.00015399184,0.00008016016],"domain_scores_gemma":[0.99897814,0.00024861158,0.00009389739,0.0002623531,0.0003099428,0.00010715016],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029589335,0.00053494086,0.0007195227,0.000764213,0.0006439427,0.0017643605,0.0013195989,0.00066342286,0.01480384],"category_scores_gemma":[0.0029206143,0.00052702107,0.000873428,0.0011129403,0.00089114375,0.0018755409,0.0022445172,0.0008851185,0.008826618],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013439842,0.00017600475,0.0045961533,0.0011397888,0.00009520231,0.0016333534,0.0007062859,0.14114092,0.020953322,0.33593607,0.04745244,0.44482648],"study_design_scores_gemma":[0.00013204059,0.00027092578,0.001998739,0.00028675044,0.00007311331,0.003122183,0.0009877426,0.4524099,0.027720407,0.2993266,0.21357553,0.00009609785],"about_ca_topic_score_codex":0.0016350945,"about_ca_topic_score_gemma":0.002552335,"teacher_disagreement_score":0.01480384,"about_ca_system_score_codex":0.0003598178,"about_ca_system_score_gemma":0.0006282272,"threshold_uncertainty_score":0.04952371},"labels":[],"label_agreement":null},{"id":"W116145823","doi":"","title":"Generalizations of Interval Graphs","year":2009,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Interval graph; Interval (graph theory); Computer science; Context (archaeology); Graph theory; Constraint satisfaction; Constraint satisfaction problem; Theoretical computer science; Discrete mathematics; Indifference graph; Constraint (computer-aided design); Chordal graph; Graph; Mathematics; Combinatorics; Algorithm; Artificial intelligence; 1-planar graph; Probabilistic logic","score_opus":0.024376740920435104,"score_gpt":0.2516074585732732,"score_spread":0.22723071765283812,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W116145823","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07287687,0.0032333394,0.76377594,0.0029713833,0.0007279331,0.00015268502,0.0018837916,0.001509208,0.15286882],"genre_scores_gemma":[0.7412323,0.005533891,0.21298295,0.0021647234,0.001825075,0.00028455196,0.0031739725,0.0006100277,0.032192476],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984394,0.00025675868,0.00009050856,0.0006218357,0.00039530106,0.0001962558],"domain_scores_gemma":[0.99666756,0.0014251523,0.00041605666,0.00076076144,0.00043766882,0.00029270336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009886567,0.00058648246,0.0005235668,0.0021670857,0.0014459587,0.0027343677,0.0015562553,0.00092863565,0.01298982],"category_scores_gemma":[0.005829884,0.00046371482,0.0016160919,0.0028908013,0.002018089,0.005678902,0.0024094365,0.0037918575,0.0014022567],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027157468,0.000019057183,0.00032218063,0.00006371828,0.000010587081,0.000118222095,0.00023301845,0.005115391,0.0007528921,0.96965337,0.004655654,0.019028645],"study_design_scores_gemma":[0.000008306502,0.000014194124,0.0002624107,0.00002678379,0.000011193408,0.00016286506,0.00009964291,0.01225814,0.00031077844,0.9610297,0.025802499,0.000013529308],"about_ca_topic_score_codex":0.0025591466,"about_ca_topic_score_gemma":0.0017525444,"teacher_disagreement_score":0.01298982,"about_ca_system_score_codex":0.001531544,"about_ca_system_score_gemma":0.0005398839,"threshold_uncertainty_score":0.043455303},"labels":[],"label_agreement":null},{"id":"W121085945","doi":"","title":"The PKD-tree for Orthogonal d-Dimensional Range Search.","year":2006,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Range tree; Tree (set theory); Combinatorics; R-tree; Search engine indexing; K-ary tree; Mathematics; Pyramid (geometry); Tree structure; Interval tree; Computer science; Algorithm; Binary tree; Spatial database; Artificial intelligence; Statistics; Spatial analysis; Geometry","score_opus":0.02736035179704939,"score_gpt":0.24675582092588252,"score_spread":0.21939546912883312,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W121085945","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0075303195,0.0024552967,0.97576207,0.0005630026,0.00023512307,0.00026502716,0.0020025794,0.0061230497,0.0050636367],"genre_scores_gemma":[0.066345334,0.00097004254,0.92472965,0.0003889768,0.000119489734,0.00062464824,0.0044902116,0.00047066034,0.001861],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980902,0.00045374304,0.00028725518,0.0003158,0.0006977686,0.00015517803],"domain_scores_gemma":[0.99479276,0.001575019,0.0004191426,0.002090147,0.0008782434,0.00024466796],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017748247,0.00076262595,0.0012999356,0.0029398648,0.0011145746,0.002301913,0.0026817431,0.0013672762,0.0067775366],"category_scores_gemma":[0.013587013,0.0006551217,0.00096793036,0.006782678,0.0012147172,0.0058808546,0.0043611084,0.0017390688,0.0054333378],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00075793744,0.00023080553,0.004293916,0.001233404,0.00015265238,0.0003381052,0.0005363156,0.03833725,0.011882352,0.10362388,0.08084053,0.7577728],"study_design_scores_gemma":[0.00038433392,0.0005490672,0.0020104328,0.00036134524,0.00014467028,0.0025918,0.00045688034,0.5574421,0.020180127,0.2176916,0.19796614,0.00022146959],"about_ca_topic_score_codex":0.0025248888,"about_ca_topic_score_gemma":0.0029886202,"teacher_disagreement_score":0.0067775366,"about_ca_system_score_codex":0.0010296853,"about_ca_system_score_gemma":0.0021575524,"threshold_uncertainty_score":0.02267307},"labels":[],"label_agreement":null},{"id":"W121933743","doi":"","title":"Area-Proportional Drawings of Intersecting Families of Simple Closed Curves.","year":2005,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Jordan curve theorem; Mathematics; Combinatorics; Plane curve; Simple (philosophy); Graph; Plane (geometry); Geometry","score_opus":0.028939908460865162,"score_gpt":0.2564893939256543,"score_spread":0.22754948546478912,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W121933743","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.068245776,0.00029475184,0.8970157,0.00014432838,0.00007225754,0.00035288717,0.0008566719,0.0029454716,0.03007231],"genre_scores_gemma":[0.33217862,0.0004618647,0.65372425,0.00008180979,0.000031836884,0.00040360444,0.0019792977,0.00057024974,0.010568479],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993748,0.00011604507,0.000028267206,0.0001292271,0.00027464554,0.00007706633],"domain_scores_gemma":[0.99891293,0.0003356671,0.00012739278,0.00030330563,0.00021936871,0.00010135021],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037870483,0.00077699166,0.0004034746,0.0013678292,0.0005615162,0.0010328739,0.00126079,0.00065142184,0.01167737],"category_scores_gemma":[0.0031725967,0.0006687243,0.0006378693,0.0016865556,0.0006093947,0.0017278806,0.0012395249,0.0008230743,0.0013878867],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038198117,0.00023741196,0.0054884665,0.00042484447,0.00012070194,0.0011386427,0.0012465855,0.14263298,0.057589497,0.20343564,0.029370554,0.5579326],"study_design_scores_gemma":[0.00017538959,0.00032252408,0.004949689,0.00019201373,0.00010318778,0.002153788,0.0007497451,0.53362876,0.04540807,0.17490964,0.23729342,0.00011376784],"about_ca_topic_score_codex":0.0022263327,"about_ca_topic_score_gemma":0.0041109016,"teacher_disagreement_score":0.01167737,"about_ca_system_score_codex":0.0008705686,"about_ca_system_score_gemma":0.00038812475,"threshold_uncertainty_score":0.039064765},"labels":[],"label_agreement":null},{"id":"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Colored; Domino; Rectangle; Polygon (computer graphics); Mathematics; Combinatorics; Set (abstract data type); Simple (philosophy); Computer science; Frame (networking); Geometry","score_opus":0.020398733762552145,"score_gpt":0.25723889698568386,"score_spread":0.23684016322313173,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W129388523","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35912827,0.0007433611,0.60560066,0.00075687334,0.00022922989,0.00019731514,0.0010613797,0.0016036292,0.03067929],"genre_scores_gemma":[0.6007229,0.000325381,0.3887938,0.00013585492,0.00007292179,0.000223242,0.001357471,0.0004223496,0.007946052],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99934775,0.00010576787,0.00003748926,0.00017749937,0.00018348047,0.00014797144],"domain_scores_gemma":[0.995316,0.0032470722,0.0003226534,0.00046808273,0.00041888736,0.00022735211],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008249355,0.00074602297,0.0007337354,0.0014186888,0.0012174469,0.002123458,0.001485687,0.00072095485,0.008618155],"category_scores_gemma":[0.008624272,0.00049493526,0.0007090313,0.0018480382,0.0015750831,0.0034366257,0.0016591041,0.00096101145,0.0007712804],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001125246,0.00019009999,0.008274377,0.0003901082,0.00010888898,0.00023033799,0.0004777063,0.64692837,0.016201062,0.16172233,0.010578035,0.15377353],"study_design_scores_gemma":[0.00007654857,0.000051266863,0.00070396916,0.000030156893,0.000021295727,0.00005406181,0.00007766132,0.87306833,0.0041080588,0.11947667,0.0023077088,0.00002431791],"about_ca_topic_score_codex":0.008236293,"about_ca_topic_score_gemma":0.019564943,"teacher_disagreement_score":0.008618155,"about_ca_system_score_codex":0.002609774,"about_ca_system_score_gemma":0.0016579342,"threshold_uncertainty_score":0.028830588},"labels":[],"label_agreement":null},{"id":"W130561602","doi":"","title":"Morphing Planar Graph Drawings.","year":2007,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Morphing; Planar graph; Graph drawing; Mathematical proof; Outerplanar graph; Computer science; Lattice graph; Planar straight-line graph; Vertex (graph theory); Graph; Mathematics; Combinatorics; Line graph; Computer graphics (images); Pathwidth; Geometry; Voltage graph","score_opus":0.02609874843551627,"score_gpt":0.25238890273672476,"score_spread":0.2262901543012085,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W130561602","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008478205,0.0034070897,0.9237989,0.00087987096,0.0006691963,0.00019068873,0.0012815596,0.006000159,0.055294354],"genre_scores_gemma":[0.2131677,0.007725921,0.73135144,0.0009706194,0.0005692647,0.00038770607,0.0044051376,0.003499479,0.037922792],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99919707,0.0001408912,0.000040947867,0.00020227418,0.0003570891,0.00006167802],"domain_scores_gemma":[0.9990006,0.00038497674,0.00009111586,0.00034141983,0.00012000278,0.000061840095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005452764,0.0011665002,0.0005456164,0.0019491517,0.0006437181,0.0016816261,0.0011958224,0.0010746266,0.026527725],"category_scores_gemma":[0.00454315,0.0008071994,0.0011341842,0.0018172874,0.0013759446,0.0040560807,0.002872046,0.0020369426,0.0060556764],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008530281,0.000034418346,0.0005359303,0.0005481204,0.00003390488,0.00029983808,0.0005378937,0.018473078,0.007164338,0.5317729,0.04631355,0.39420074],"study_design_scores_gemma":[0.000037434824,0.000046035693,0.00043524723,0.00015849127,0.00003861886,0.0013413809,0.00021030026,0.05645799,0.00609773,0.6393802,0.29574537,0.000051213523],"about_ca_topic_score_codex":0.0008367455,"about_ca_topic_score_gemma":0.0012166887,"teacher_disagreement_score":0.026527725,"about_ca_system_score_codex":0.000702401,"about_ca_system_score_gemma":0.00036283938,"threshold_uncertainty_score":0.088744104},"labels":[],"label_agreement":null},{"id":"W1590814900","doi":"","title":"Space-Efficient Algorithms for Klee's Measure Problem.","year":2005,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Measure (data warehouse); Combinatorics; Mathematics; Plane (geometry); Space (punctuation); Binary logarithm; Set (abstract data type); Computational geometry; Degenerate energy levels; Time complexity; Algorithm; Discrete mathematics; Geometry; Computer science; Physics; Data mining","score_opus":0.03807973057664759,"score_gpt":0.2652294900331958,"score_spread":0.2271497594565482,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1590814900","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012259101,0.00090720895,0.97284,0.0011789214,0.00014506915,0.00022138152,0.00039993346,0.0034550626,0.008593182],"genre_scores_gemma":[0.100786544,0.00051214505,0.8920903,0.00027932654,0.00013574032,0.00040327053,0.0016868181,0.0005589443,0.0035468657],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964887,0.0006527763,0.00029825157,0.0007792881,0.0011987452,0.0005822205],"domain_scores_gemma":[0.9954928,0.0022452017,0.0003406756,0.0012647846,0.00045434025,0.00020205468],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021282425,0.002176172,0.0020051026,0.0030133934,0.001789752,0.0041866573,0.004302081,0.0030675072,0.014045682],"category_scores_gemma":[0.010589762,0.0009409501,0.0028409585,0.004469515,0.0016774876,0.009118775,0.0058782897,0.0034595698,0.004694309],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00065198814,0.0006186074,0.0017024786,0.0009342141,0.00019429375,0.0002709294,0.00066673197,0.09468513,0.009189081,0.2524244,0.04910506,0.58955705],"study_design_scores_gemma":[0.0003800989,0.00016829181,0.00063348335,0.000075175914,0.00007774606,0.00063006475,0.00038645076,0.4806746,0.00795311,0.48798066,0.020955479,0.000084841464],"about_ca_topic_score_codex":0.0028150172,"about_ca_topic_score_gemma":0.0042426144,"teacher_disagreement_score":0.014045682,"about_ca_system_score_codex":0.002432949,"about_ca_system_score_gemma":0.0025230595,"threshold_uncertainty_score":0.046987474},"labels":[],"label_agreement":null},{"id":"W159810765","doi":"","title":"Approximating Radio Maps.","year":2005,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Terrain; Algorithm; WiMAX; Approximation algorithm; Antenna (radio); Radar; Scale (ratio); Wireless; Point (geometry); Real-time computing; Mathematics; Telecommunications; Geography","score_opus":0.02632379849969603,"score_gpt":0.2428773898434252,"score_spread":0.21655359134372915,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W159810765","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031968674,0.00012466204,0.9950164,0.00004676641,0.00002553235,0.000021698637,0.00007329523,0.00026317735,0.0012316245],"genre_scores_gemma":[0.18896878,0.0005924212,0.8041097,0.00008986785,0.00008328977,0.00018165736,0.0008670613,0.0002532586,0.004853975],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99923277,0.0002812401,0.000037555903,0.00012506392,0.00025983134,0.000063652675],"domain_scores_gemma":[0.997514,0.0014921204,0.00019739909,0.0004050436,0.00032216296,0.000069358655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001119357,0.0010903095,0.0007987109,0.0012385761,0.00036449745,0.0012578239,0.0013737882,0.0012386758,0.0035388041],"category_scores_gemma":[0.009342178,0.0005560502,0.00092009833,0.001192204,0.00069427205,0.0019855797,0.0017371468,0.0012350196,0.001581031],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001877975,0.000045013752,0.0014237161,0.00020017973,0.0000552101,0.00010926774,0.0001796211,0.77651554,0.0027696383,0.08304026,0.005423935,0.1300498],"study_design_scores_gemma":[0.000014006971,0.000022393453,0.000119461765,0.000014699563,0.0000078249095,0.00009221092,0.000040496743,0.96752053,0.0010963113,0.027111268,0.003953083,0.000007799794],"about_ca_topic_score_codex":0.0023624203,"about_ca_topic_score_gemma":0.0018930321,"teacher_disagreement_score":0.0035388041,"about_ca_system_score_codex":0.0006405431,"about_ca_system_score_gemma":0.00050487154,"threshold_uncertainty_score":0.011838496},"labels":[],"label_agreement":null},{"id":"W163009970","doi":"","title":"The 2x2 simple packing problem","year":2011,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Simple (philosophy); Computer science; Packing problems; Algorithm","score_opus":0.053264506631380576,"score_gpt":0.24375607048789819,"score_spread":0.1904915638565176,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W163009970","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14543009,0.0012272453,0.6563752,0.002459553,0.0013378258,0.0006885903,0.0032542483,0.0018265763,0.18740064],"genre_scores_gemma":[0.46763876,0.0024062004,0.43199605,0.0010197,0.0010796364,0.00095390325,0.0071757645,0.0007729501,0.08695701],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999044,0.00015441724,0.000056298082,0.00024534683,0.00028500304,0.00021484558],"domain_scores_gemma":[0.9990256,0.0003204344,0.00010586161,0.00032124738,0.00010280146,0.00012411001],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004831702,0.0012039595,0.0012787672,0.00063347793,0.0012056028,0.0020015065,0.0014484753,0.0013280325,0.024719607],"category_scores_gemma":[0.0025270213,0.0006687798,0.0014922807,0.0017479097,0.0005520102,0.0038737585,0.0035601181,0.0019342335,0.006367669],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00064881245,0.00044683664,0.0022033332,0.00088526745,0.00009073606,0.0014756111,0.00037478865,0.08936064,0.01230222,0.30345532,0.11461055,0.47414595],"study_design_scores_gemma":[0.00018843244,0.00045451237,0.0022643693,0.00010204535,0.00006297915,0.002844449,0.00032466426,0.23688042,0.008757284,0.56819123,0.17986812,0.000061519364],"about_ca_topic_score_codex":0.00094073627,"about_ca_topic_score_gemma":0.0013471909,"teacher_disagreement_score":0.024719607,"about_ca_system_score_codex":0.00046468055,"about_ca_system_score_gemma":0.0007024689,"threshold_uncertainty_score":0.082695305},"labels":[],"label_agreement":null},{"id":"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.04234192041526704,"score_gpt":0.2690653430377264,"score_spread":0.22672342262245934,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W165396895","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006244716,0.0009355714,0.9884239,0.00007547032,0.00009808308,0.00014408086,0.0001679548,0.0012181547,0.002692143],"genre_scores_gemma":[0.09126136,0.0007484317,0.9045633,0.000103530794,0.00005018698,0.00014428461,0.00069468986,0.00007187712,0.0023624185],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986866,0.00017176746,0.00009272542,0.00023599049,0.00072229275,0.00009063568],"domain_scores_gemma":[0.9990482,0.00024187582,0.00008091386,0.00026100513,0.00033044178,0.000037614587],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006602325,0.00062172516,0.0014123122,0.0020603568,0.001032145,0.0011339692,0.0015084672,0.0009742359,0.003121241],"category_scores_gemma":[0.0035777637,0.00047118132,0.0009836471,0.0037996324,0.00044081925,0.0025871955,0.0016926982,0.0008369819,0.0022687423],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002850586,0.00026394668,0.002405299,0.0006171166,0.00039691426,0.0004275312,0.00030239465,0.08260993,0.022727525,0.021348111,0.018898856,0.8497174],"study_design_scores_gemma":[0.00013564591,0.00033376866,0.0021396384,0.000080027734,0.00017228651,0.002052462,0.00025479688,0.8985834,0.019608172,0.039785128,0.036725044,0.00012963264],"about_ca_topic_score_codex":0.008304523,"about_ca_topic_score_gemma":0.009829401,"teacher_disagreement_score":0.008304523,"about_ca_system_score_codex":0.0005232315,"about_ca_system_score_gemma":0.0014719127,"threshold_uncertainty_score":0.016512394},"labels":[],"label_agreement":null},{"id":"W170076","doi":"10.1289/ehp.7511129","title":"Farthest Neighbor Voronoi Diagram in the Presence of Rectangular Obstacles.","year":2005,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Voronoi diagram; Disjoint sets; Combinatorics; Geodesic; Mathematics; Plane (geometry); Computational geometry; Weighted Voronoi diagram; Metric (unit); Diagram; Power diagram; Set (abstract data type); Point (geometry); Representation (politics); Centroidal Voronoi tessellation; Algorithm; Computer science; Geometry","score_opus":0.024418599950654606,"score_gpt":0.24808481372084273,"score_spread":0.22366621377018814,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W170076","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16420315,0.0057956628,0.7841548,0.0013346204,0.00034779712,0.0002784944,0.0035972518,0.0005657841,0.039722476],"genre_scores_gemma":[0.8404847,0.0029561082,0.13050114,0.00039426674,0.00025330018,0.00035043375,0.0042560063,0.00028986833,0.020514162],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99919504,0.00026732622,0.000037380436,0.00016831266,0.00016015889,0.00017168258],"domain_scores_gemma":[0.9965881,0.0022002666,0.0003911102,0.00020852647,0.00030196292,0.00030999465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009510643,0.00068576576,0.0013168168,0.0015707308,0.0011173051,0.0022593732,0.0020194117,0.0016121806,0.00923845],"category_scores_gemma":[0.005318359,0.00060279603,0.001087563,0.0012699928,0.0012187219,0.0018961366,0.0017771418,0.00097550196,0.0015223033],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026116124,0.00009366017,0.0033446178,0.00041348184,0.00014771704,0.0004658541,0.00029574742,0.476453,0.0016407075,0.48027748,0.009324758,0.027281718],"study_design_scores_gemma":[0.00004095276,0.000031209012,0.0005859327,0.00003481557,0.000014807388,0.00022950115,0.00009252931,0.7450543,0.00032944887,0.2461073,0.0074528307,0.000026403442],"about_ca_topic_score_codex":0.007579784,"about_ca_topic_score_gemma":0.006377455,"teacher_disagreement_score":0.00923845,"about_ca_system_score_codex":0.0011721267,"about_ca_system_score_gemma":0.0011038397,"threshold_uncertainty_score":0.030905724},"labels":[],"label_agreement":null},{"id":"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.046233520706352484,"score_gpt":0.28765465180558203,"score_spread":0.24142113109922955,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W172707356","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5934158,0.00056923076,0.31950068,0.0016492929,0.0003045035,0.00012296409,0.0017733166,0.0011439974,0.08152019],"genre_scores_gemma":[0.89614594,0.00024143312,0.09406993,0.00010922825,0.000022500019,0.00009575598,0.0010509423,0.00008724312,0.008177047],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99976987,0.00003616984,0.000012159018,0.00003755986,0.00006421669,0.00007998812],"domain_scores_gemma":[0.99966526,0.00007586318,0.000049380888,0.00006611486,0.000045005225,0.000098445395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014382885,0.00033363767,0.00038362166,0.0002388651,0.0008391748,0.0010148953,0.00071256683,0.0008105237,0.010035092],"category_scores_gemma":[0.00089821615,0.0002666947,0.0004658274,0.0004605493,0.00047389654,0.0010089288,0.0011494878,0.00092967105,0.0020758526],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005589442,0.00021472067,0.0015461599,0.00032623037,0.000057164096,0.0012668532,0.0008211291,0.05729633,0.05548421,0.7967224,0.017566487,0.06813931],"study_design_scores_gemma":[0.00026064683,0.00029396062,0.0025047895,0.00009952324,0.000059142352,0.0013895129,0.0010569979,0.18593618,0.029268358,0.7095886,0.06946239,0.00007988997],"about_ca_topic_score_codex":0.0009924155,"about_ca_topic_score_gemma":0.0021549095,"teacher_disagreement_score":0.010035092,"about_ca_system_score_codex":0.00047543284,"about_ca_system_score_gemma":0.00041593565,"threshold_uncertainty_score":0.033570766},"labels":[],"label_agreement":null},{"id":"W188453315","doi":"","title":"Collection depot location problem in the plane.","year":2005,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; Queen's University","funders":"","keywords":"Facility location problem; Computer science; Depot; Service (business); Operations research; Data collection; Set (abstract data type); Mathematical optimization; Computer network; Mathematics; Geography; Business; Statistics; Marketing","score_opus":0.03465438420203517,"score_gpt":0.2315149242619012,"score_spread":0.19686054005986603,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W188453315","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09433088,0.0035725257,0.8524329,0.0033736224,0.0005425344,0.00034510755,0.004046984,0.0006195743,0.040735908],"genre_scores_gemma":[0.6726423,0.0054059015,0.28825852,0.0006358043,0.0005185935,0.0003227297,0.005445207,0.00022279192,0.026548192],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987717,0.00038178155,0.000065090426,0.00031195435,0.0002366965,0.00023263606],"domain_scores_gemma":[0.9985158,0.00082808,0.00020766482,0.00018251392,0.00015498725,0.00011091776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008503579,0.00093026593,0.0013137151,0.00060020445,0.0014059894,0.002060447,0.0017229813,0.0017897588,0.008770818],"category_scores_gemma":[0.0025938214,0.0004978661,0.0011644834,0.0023843518,0.0011433695,0.004330268,0.0016274041,0.001630496,0.0013835107],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00064746867,0.0002271612,0.002063212,0.0009854459,0.00023657335,0.0010199089,0.00029959055,0.528652,0.0036025736,0.3321718,0.04105441,0.08903987],"study_design_scores_gemma":[0.00016479584,0.00018164786,0.0017483496,0.0001246671,0.000130853,0.0014528882,0.0008643665,0.5749865,0.005662956,0.33199063,0.08262167,0.000070660484],"about_ca_topic_score_codex":0.006550098,"about_ca_topic_score_gemma":0.006109207,"teacher_disagreement_score":0.008770818,"about_ca_system_score_codex":0.001701163,"about_ca_system_score_gemma":0.0012555837,"threshold_uncertainty_score":0.02934134},"labels":[],"label_agreement":null},{"id":"W2096716375","doi":"","title":"On exact solution of a point-location problem in a system of d-dimensional hyperbolic surfaces.","year":2003,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Voronoi diagram; Point (geometry); SPHERES; Set (abstract data type); Mathematics; Computer science; Algorithm; Mathematical optimization; Geometry; Physics","score_opus":0.019854562947411242,"score_gpt":0.22959724654543012,"score_spread":0.20974268359801887,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096716375","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008545138,0.00027950894,0.9871701,0.00017534212,0.000065409804,0.00006382029,0.000056669694,0.00015878651,0.0034851695],"genre_scores_gemma":[0.14836949,0.00047057038,0.8439097,0.0001295131,0.000055477365,0.0003851175,0.00027313453,0.00014572259,0.0062613217],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99971,0.000084616804,0.000017936154,0.00004315029,0.00010201178,0.000042228203],"domain_scores_gemma":[0.9991732,0.00057295954,0.000050269755,0.0000669162,0.00009343938,0.000043277458],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008874967,0.00066539785,0.0009249755,0.00070843654,0.0007569708,0.00077672664,0.001281762,0.0018579689,0.006633442],"category_scores_gemma":[0.0037644333,0.0004519706,0.0005495454,0.0007915195,0.0009590521,0.0016561332,0.0026973537,0.0011472108,0.0012358839],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011931691,0.000069055,0.0009263543,0.00033839518,0.000056302975,0.00023174899,0.0003067307,0.7909823,0.0029787086,0.10777635,0.0046914066,0.09152329],"study_design_scores_gemma":[0.00003361575,0.000031199263,0.00007430576,0.000016324928,0.000005632905,0.000043182787,0.00005435216,0.96006894,0.00065012916,0.036151104,0.0028623734,0.00000889827],"about_ca_topic_score_codex":0.0038071263,"about_ca_topic_score_gemma":0.0038574245,"teacher_disagreement_score":0.006633442,"about_ca_system_score_codex":0.000595333,"about_ca_system_score_gemma":0.00089702697,"threshold_uncertainty_score":0.022191048},"labels":[],"label_agreement":null},{"id":"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.012545625704137281,"score_gpt":0.22107809702892994,"score_spread":0.20853247132479266,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102775149","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6901295,0.0005018058,0.27233532,0.0003408272,0.000084891086,0.00008469879,0.00025599537,0.00053881,0.035728097],"genre_scores_gemma":[0.95670855,0.00022488963,0.035839174,0.00008322814,0.000025739537,0.00004837051,0.00022209562,0.00022971875,0.0066182194],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99975413,0.00003693467,0.000008454297,0.00005835229,0.00008250444,0.000059704125],"domain_scores_gemma":[0.9995167,0.0001556395,0.00006655708,0.00013254114,0.000050399387,0.00007804267],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023590222,0.00028609726,0.00025280614,0.00042173426,0.00079499587,0.0006795203,0.00039468438,0.0004510343,0.006900857],"category_scores_gemma":[0.0016425843,0.00022944588,0.0003830642,0.0003127306,0.0011895446,0.0018687156,0.0010510685,0.0007660394,0.0006131226],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015885546,0.00008624097,0.002254194,0.00014398033,0.000027609256,0.0010701484,0.0012280118,0.10645785,0.04062592,0.79924345,0.0030124835,0.045691356],"study_design_scores_gemma":[0.000027406813,0.00014242115,0.0015570464,0.000043632164,0.000013140029,0.00056154287,0.00069319695,0.21838188,0.025159778,0.7319226,0.02145451,0.000042749212],"about_ca_topic_score_codex":0.00037006612,"about_ca_topic_score_gemma":0.00047312924,"teacher_disagreement_score":0.006900857,"about_ca_system_score_codex":0.00044168072,"about_ca_system_score_gemma":0.00015753898,"threshold_uncertainty_score":0.023085654},"labels":[],"label_agreement":null},{"id":"W2107966077","doi":"","title":"Efficient Snap Rounding with Integer Arithmetic.","year":2007,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Rounding; Combinatorics; Partition (number theory); Logarithm; Intersection (aeronautics); Integer (computer science); Mathematics; Time complexity; Line segment; Discrete mathematics; Computer science; Algorithm; Geometry","score_opus":0.022500775482839738,"score_gpt":0.2500785208696665,"score_spread":0.22757774538682674,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107966077","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010096116,0.00022825795,0.97716343,0.000074790136,0.000103533544,0.0001030365,0.00019390983,0.0027676525,0.009269246],"genre_scores_gemma":[0.17290421,0.0002878726,0.81951815,0.00015082805,0.00006420201,0.00025050598,0.0008527691,0.00059651455,0.0053749736],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987429,0.00017504308,0.00009981447,0.00025380042,0.00053977256,0.00018873208],"domain_scores_gemma":[0.99891734,0.00031398484,0.000087263055,0.00047829415,0.00015839288,0.000044682176],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007380044,0.001108934,0.00087780406,0.0010145163,0.000878509,0.0020273814,0.0014149676,0.0006385171,0.012067125],"category_scores_gemma":[0.004052721,0.0005029859,0.0009427435,0.0013665031,0.0010298642,0.002376346,0.0030997454,0.0014131208,0.0044186134],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008367618,0.000147456,0.0015668574,0.00057208113,0.00006815114,0.00041155505,0.00055410364,0.15078503,0.03170568,0.18606241,0.01891483,0.6083751],"study_design_scores_gemma":[0.00013528427,0.00031145415,0.0006314599,0.0001586407,0.000050879484,0.00049964694,0.00037614626,0.67774236,0.040322445,0.22504102,0.05464559,0.000085127496],"about_ca_topic_score_codex":0.0012751392,"about_ca_topic_score_gemma":0.0015090938,"teacher_disagreement_score":0.012067125,"about_ca_system_score_codex":0.00064648234,"about_ca_system_score_gemma":0.0007719131,"threshold_uncertainty_score":0.040368617},"labels":[],"label_agreement":null},{"id":"W2111009215","doi":"","title":"On a geometric approach to the segment sum problem and its generalization","year":2007,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Generalization; Combinatorics; Monotone polygon; Mathematics; Optimization problem; Sequence (biology); Subset sum problem; Discrete mathematics; Mathematical optimization; Computer science; Algorithm; Knapsack problem; Geometry","score_opus":0.030181404593928495,"score_gpt":0.24807000493480882,"score_spread":0.21788860034088034,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111009215","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006566284,0.0007577922,0.9816457,0.0010229277,0.000112881586,0.00005531628,0.00012134866,0.0002149973,0.009502819],"genre_scores_gemma":[0.18353349,0.005157281,0.78523827,0.0011991216,0.0017194389,0.0004955095,0.0012496437,0.00067828107,0.020728923],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979832,0.00074201263,0.000089128036,0.000495063,0.00052440463,0.00016615239],"domain_scores_gemma":[0.9962112,0.0025175826,0.00032349257,0.00049364934,0.0002988768,0.00015517419],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021587785,0.0020291428,0.001583366,0.0021122291,0.0011966047,0.002373421,0.0031063273,0.0021327678,0.011512479],"category_scores_gemma":[0.0079885805,0.00083101605,0.0016308399,0.0036424738,0.003872204,0.008624492,0.004098432,0.005450156,0.0021180313],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000114700895,0.00010057426,0.00038601767,0.00022607077,0.00003414734,0.00013276839,0.00018895656,0.16753067,0.0019143153,0.73152107,0.009025751,0.08882495],"study_design_scores_gemma":[0.000023758646,0.00008461955,0.00015877928,0.000032512427,0.0000141411165,0.0001278017,0.00005850117,0.31884724,0.00089531206,0.6677592,0.011972631,0.000025560825],"about_ca_topic_score_codex":0.0015335038,"about_ca_topic_score_gemma":0.0013051877,"teacher_disagreement_score":0.011512479,"about_ca_system_score_codex":0.0013486319,"about_ca_system_score_gemma":0.0009909086,"threshold_uncertainty_score":0.038513124},"labels":[],"label_agreement":null},{"id":"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.04657298695031612,"score_gpt":0.2724671985039716,"score_spread":0.2258942115536555,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2112429204","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.060823534,0.0019576694,0.92566985,0.0009705955,0.00009407482,0.00007647317,0.0008582442,0.0004203775,0.009129122],"genre_scores_gemma":[0.7980772,0.0032136617,0.19120982,0.00017390892,0.000167379,0.00020988945,0.0013225272,0.00015450042,0.00547116],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99859315,0.00031212595,0.00009645136,0.00022147527,0.00056297745,0.0002138498],"domain_scores_gemma":[0.99735177,0.0015763427,0.000457418,0.00025499615,0.000211975,0.00014753359],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009507055,0.00092000497,0.0011328091,0.0009792518,0.0011139113,0.001715208,0.0016169146,0.0011945827,0.0027666157],"category_scores_gemma":[0.006843198,0.00064081326,0.000704784,0.0019782956,0.0013918238,0.0046202065,0.0026458083,0.0013613462,0.00034956587],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011894539,0.000013346423,0.00054510817,0.00014537846,0.000030849453,0.00031133322,0.00021452171,0.84219384,0.001143342,0.13164265,0.0023428765,0.02129789],"study_design_scores_gemma":[0.000018636572,0.000029513294,0.0003055972,0.000026001313,0.000016693866,0.00016141003,0.0001719581,0.7422941,0.0007718028,0.24924834,0.0069307783,0.000025222229],"about_ca_topic_score_codex":0.003729565,"about_ca_topic_score_gemma":0.0036032673,"teacher_disagreement_score":0.003729565,"about_ca_system_score_codex":0.001476381,"about_ca_system_score_gemma":0.000772101,"threshold_uncertainty_score":0.010711908},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.08041085738545625,"score_gpt":0.2616961247978016,"score_spread":0.18128526741234532,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113703646","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25823528,0.0060860715,0.56346345,0.014506835,0.00073582644,0.0003168029,0.0014954788,0.0010040611,0.15415613],"genre_scores_gemma":[0.83219856,0.0031735457,0.13258827,0.0039728386,0.0007871447,0.00089931354,0.001966586,0.00072535087,0.02368843],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9938711,0.001977161,0.00035292265,0.0015010117,0.0016073018,0.00069045374],"domain_scores_gemma":[0.95811355,0.031902622,0.0019541308,0.0046280725,0.001979271,0.0014223534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005236193,0.0013870603,0.0017120611,0.0019524195,0.0024129131,0.003674647,0.0018938115,0.0022441393,0.007327553],"category_scores_gemma":[0.03556725,0.0011428681,0.001929988,0.0013469311,0.0070139877,0.011596159,0.0074776,0.007390956,0.0015613463],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017567695,0.000051893818,0.0010525765,0.00016401525,0.000052813073,0.00012337652,0.0002742179,0.009381831,0.0016691578,0.9660157,0.00805949,0.012979346],"study_design_scores_gemma":[0.000040042138,0.00010999114,0.0012800811,0.000061168685,0.000040302,0.00041776744,0.00011539115,0.054158993,0.0021979723,0.93073165,0.0107834,0.00006332448],"about_ca_topic_score_codex":0.0017280772,"about_ca_topic_score_gemma":0.0014629748,"teacher_disagreement_score":0.007327553,"about_ca_system_score_codex":0.0026181866,"about_ca_system_score_gemma":0.0012746267,"threshold_uncertainty_score":0.02769196},"labels":[],"label_agreement":null},{"id":"W2119288811","doi":"","title":"The Gaussian Centre of a Set of Mobile Points","year":2003,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Facility location problem; Position (finance); Bounded function; Euclidean geometry; Set (abstract data type); Computer science; Motion (physics); Function (biology); Gaussian; Mathematical optimization; Mathematics; Mathematical analysis; Geometry; Physics; Artificial intelligence","score_opus":0.020640345941570753,"score_gpt":0.2478583186047206,"score_spread":0.22721797266314986,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2119288811","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012460583,0.00026775495,0.98409545,0.00017533793,0.00006887463,0.000049334143,0.00022526187,0.00060018577,0.0020572012],"genre_scores_gemma":[0.46316853,0.0011568489,0.52335,0.00037447654,0.0002348643,0.00036235264,0.0014027017,0.00040710263,0.009543156],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983359,0.00035250944,0.000080600876,0.00036910904,0.00063666306,0.00022521734],"domain_scores_gemma":[0.99672985,0.0010361611,0.0003402675,0.00066613645,0.00094653736,0.00028100048],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017264189,0.00091782835,0.0013066336,0.0017244631,0.0007517067,0.0021127216,0.0030303667,0.0023375913,0.0038021274],"category_scores_gemma":[0.012007474,0.00071496767,0.0013622604,0.001926652,0.0021802306,0.002633651,0.0038427904,0.0017198725,0.002395443],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006788472,0.00008058841,0.004514776,0.0003216235,0.000091201764,0.00051258766,0.0004255491,0.65845037,0.010198131,0.21080403,0.011596994,0.10232526],"study_design_scores_gemma":[0.000032686472,0.000076833254,0.00044414512,0.00003246379,0.00001700831,0.0001822514,0.00005244357,0.9594291,0.002576857,0.030091189,0.007029082,0.000035877885],"about_ca_topic_score_codex":0.010501293,"about_ca_topic_score_gemma":0.006275321,"teacher_disagreement_score":0.010501293,"about_ca_system_score_codex":0.0015904867,"about_ca_system_score_gemma":0.002048898,"threshold_uncertainty_score":0.020880342},"labels":[],"label_agreement":null},{"id":"W2123411109","doi":"","title":"Flipping your lid","year":2001,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec; Carleton University","funders":"","keywords":"Combinatorics; Convex polygon; Regular polygon; Polygon (computer graphics); Midpoint; Sequence (biology); Mathematics; Star-shaped polygon; Polygon covering; Computer science; Convex set; Geometry; Convex optimization; Chemistry; Telecommunications","score_opus":0.05257903836359342,"score_gpt":0.2725959820000142,"score_spread":0.2200169436364208,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123411109","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29559347,0.0010504719,0.52368355,0.0028940856,0.0023502116,0.0005331143,0.0022956992,0.0061002187,0.16549912],"genre_scores_gemma":[0.7354436,0.000757698,0.1861821,0.00071728387,0.00015149973,0.000254441,0.0019935614,0.0015278885,0.072971955],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994498,0.00004891998,0.00002446581,0.00013226131,0.0001560254,0.00018848799],"domain_scores_gemma":[0.999204,0.000117191004,0.00007894198,0.000363543,0.0001021816,0.00013418356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039733012,0.0006766188,0.0007010291,0.0003797426,0.0015394607,0.0012706448,0.0010019104,0.001034015,0.03087728],"category_scores_gemma":[0.0024777493,0.00052601035,0.0011663046,0.00034546736,0.0016202119,0.002807418,0.0036155048,0.0012446726,0.00839514],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0023017658,0.0002442072,0.007956093,0.0006828018,0.00010641459,0.0035248818,0.001972648,0.026916264,0.09479748,0.31515932,0.086005814,0.46033236],"study_design_scores_gemma":[0.00018015226,0.0012239062,0.0052290037,0.00047657068,0.00013758444,0.0042622485,0.0036593245,0.11472383,0.12826298,0.25595006,0.4856161,0.00027816923],"about_ca_topic_score_codex":0.0011162907,"about_ca_topic_score_gemma":0.0014996657,"teacher_disagreement_score":0.03087728,"about_ca_system_score_codex":0.00048561548,"about_ca_system_score_gemma":0.00048945035,"threshold_uncertainty_score":0.10329485},"labels":[],"label_agreement":null},{"id":"W2123788968","doi":"","title":"Computing the Straight Skeleton of a Monotone Polygon in O(nlogn) Time","year":2010,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Monotone polygon; Simple polygon; Polygon (computer graphics); Combinatorics; Polygon covering; Skeleton (computer programming); Computational geometry; Simple (philosophy); Rectilinear polygon; Time complexity; Mathematics; Computer science; Algorithm; Geometry","score_opus":0.011715641864569531,"score_gpt":0.23644737920830203,"score_spread":0.2247317373437325,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123788968","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036854707,0.00010233552,0.94958264,0.00013107699,0.000048482907,0.0001922634,0.0003190403,0.0054490007,0.007320533],"genre_scores_gemma":[0.18949044,0.00016771107,0.80221176,0.00004976753,0.00002918019,0.00013984468,0.0016166491,0.00052800495,0.005766575],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99963737,0.000032720294,0.000023953386,0.000092848844,0.0001606561,0.000052471256],"domain_scores_gemma":[0.999428,0.00021539928,0.00007068557,0.00012593724,0.00011207971,0.000047858222],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018855621,0.0008794156,0.00070554344,0.0007563312,0.0005111429,0.0007997711,0.0012155327,0.0006182371,0.014057572],"category_scores_gemma":[0.0015995656,0.0003652523,0.0006451498,0.0008847838,0.00048631866,0.0014050438,0.0011337111,0.00052422343,0.0032310097],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040390284,0.00015648815,0.0024041783,0.00058327976,0.00007920396,0.0005397578,0.0003145592,0.06393049,0.07102049,0.014252038,0.013839188,0.8324764],"study_design_scores_gemma":[0.00022901448,0.00051575067,0.0028717087,0.00006211071,0.00007105351,0.0013989145,0.00054114754,0.8442459,0.05407025,0.057564028,0.038358428,0.00007167098],"about_ca_topic_score_codex":0.0018271045,"about_ca_topic_score_gemma":0.004670914,"teacher_disagreement_score":0.014057572,"about_ca_system_score_codex":0.00035327673,"about_ca_system_score_gemma":0.00070800725,"threshold_uncertainty_score":0.04702729},"labels":[],"label_agreement":null},{"id":"W2124089227","doi":"","title":"An Algorithm for the MaxMin Area Triangulation of a Convex Polygon","year":2003,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Minimum-weight triangulation; Polygon (computer graphics); Convex polygon; Triangulation; Point set triangulation; Mathematics; Pitteway triangulation; Star-shaped polygon; Polygon covering; Combinatorics; Regular polygon; Diagonal; Rectilinear polygon; Algorithm; Computer science; Delaunay triangulation; Simple polygon; Convex optimization; Convex set; Bowyer–Watson algorithm; Geometry","score_opus":0.0404761246826628,"score_gpt":0.27205617256618186,"score_spread":0.23158004788351907,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2124089227","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017022283,0.000060731207,0.9948447,0.00009044343,0.000029192723,0.00007147523,0.000081428625,0.00090390653,0.002215902],"genre_scores_gemma":[0.026597407,0.00009239968,0.9701522,0.000037682923,0.000020692243,0.00017982216,0.00035166732,0.0002920606,0.0022760362],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999201,0.00010447115,0.000047115525,0.00016865831,0.00037358401,0.00010516681],"domain_scores_gemma":[0.99929595,0.00023121019,0.000062750354,0.00013695145,0.00022209834,0.000051053736],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006591119,0.0011224584,0.001217999,0.0013512251,0.0013794767,0.001488094,0.0022487873,0.0011707776,0.013515592],"category_scores_gemma":[0.0023289078,0.0010687786,0.0011730817,0.0018409798,0.0008490943,0.002032833,0.0029570083,0.001873224,0.003442356],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030741846,0.00010673361,0.00076906447,0.0003251673,0.00005734611,0.00023406083,0.0003764354,0.16804291,0.01325194,0.068102404,0.026052158,0.7223743],"study_design_scores_gemma":[0.00014596681,0.0001162553,0.00033989153,0.00006115263,0.00003185599,0.00040955213,0.00020733093,0.8769741,0.010876136,0.06720507,0.043580852,0.000051839703],"about_ca_topic_score_codex":0.003029341,"about_ca_topic_score_gemma":0.00537107,"teacher_disagreement_score":0.013515592,"about_ca_system_score_codex":0.0010031817,"about_ca_system_score_gemma":0.00155633,"threshold_uncertainty_score":0.045214176},"labels":[],"label_agreement":null},{"id":"W2125573420","doi":"","title":"On computing shortest external watchman routes for convex polygons","year":2006,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Regular polygon; Computer science; Mathematics; Geometry","score_opus":0.02155396410099874,"score_gpt":0.25277989988577937,"score_spread":0.23122593578478062,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2125573420","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21446557,0.0009036675,0.77494,0.00025134502,0.00010256792,0.00015341907,0.0005298572,0.001522121,0.0071313772],"genre_scores_gemma":[0.5296366,0.00088492455,0.46179217,0.00006529363,0.0000970985,0.00016651035,0.0017962017,0.00076305965,0.0047980687],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99924845,0.00019924915,0.00005727659,0.00016277588,0.00019123941,0.00014099939],"domain_scores_gemma":[0.9947994,0.0035039533,0.0005701605,0.0004028197,0.00045424656,0.0002694712],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010395077,0.0013949702,0.0013116859,0.0019855457,0.00080561824,0.0019154842,0.0014790313,0.0008494419,0.004963637],"category_scores_gemma":[0.011305154,0.0007976841,0.00079551083,0.0025719125,0.0011091057,0.003251527,0.0020839334,0.0011335058,0.0008650487],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00064214,0.00011564402,0.0050207777,0.00030601278,0.00008019049,0.0001836976,0.00039739558,0.8127377,0.0034543897,0.035884026,0.004371385,0.13680659],"study_design_scores_gemma":[0.000032280852,0.00010545733,0.0004963408,0.000025200892,0.000016229387,0.00003943378,0.00013808376,0.9728018,0.0015331503,0.023209263,0.0015859453,0.00001684865],"about_ca_topic_score_codex":0.0058758436,"about_ca_topic_score_gemma":0.0100304745,"teacher_disagreement_score":0.0058758436,"about_ca_system_score_codex":0.00085561443,"about_ca_system_score_gemma":0.000889498,"threshold_uncertainty_score":0.01660502},"labels":[],"label_agreement":null},{"id":"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.019659232827445576,"score_gpt":0.2392991311069203,"score_spread":0.21963989827947472,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2127519911","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34135565,0.001837135,0.6235784,0.0019169693,0.00020153249,0.00037977338,0.0016366953,0.0013784012,0.027715445],"genre_scores_gemma":[0.7131847,0.0012492469,0.27136904,0.0003466034,0.0001595674,0.00043467674,0.0020932334,0.00035466082,0.010808203],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99802893,0.00047129538,0.00012940577,0.00058452744,0.00039322174,0.0003925589],"domain_scores_gemma":[0.99249953,0.005498384,0.00064305187,0.0007678929,0.00025116306,0.00033997334],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00091007905,0.0009938697,0.0013053139,0.0008024693,0.0014261941,0.0031639105,0.0018844042,0.0013639701,0.009637857],"category_scores_gemma":[0.008610165,0.0009374718,0.001617469,0.0015336447,0.0019762302,0.0059190653,0.0029790082,0.0021163195,0.0008428202],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038396296,0.00022999295,0.0026780048,0.0005298474,0.00011281241,0.00071409,0.000635518,0.681436,0.0073592514,0.24774477,0.005771282,0.052404407],"study_design_scores_gemma":[0.00011767793,0.000110502755,0.00045182984,0.000046315843,0.000042073883,0.00033905002,0.00024712528,0.6012409,0.0033762173,0.38433895,0.009655823,0.000033515124],"about_ca_topic_score_codex":0.0040974203,"about_ca_topic_score_gemma":0.003909732,"teacher_disagreement_score":0.009637857,"about_ca_system_score_codex":0.0024003773,"about_ca_system_score_gemma":0.00081163266,"threshold_uncertainty_score":0.03224188},"labels":[],"label_agreement":null},{"id":"W2136013120","doi":"","title":"I/O-efficient triangular range search and its application.","year":2010,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Combinatorics; Range (aeronautics); Range query (database); Binary logarithm; Data structure; Set (abstract data type); Mathematics; Computational geometry; Point (geometry); Discrete mathematics; Computer science; Algorithm; Search engine; Geometry; Web search query; Sargable; Information retrieval","score_opus":0.024349150862565387,"score_gpt":0.25993228784615396,"score_spread":0.23558313698358857,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136013120","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031862304,0.0015771862,0.94628936,0.0004244684,0.000095040516,0.00014535243,0.00025492487,0.0016626363,0.017688766],"genre_scores_gemma":[0.56124943,0.0013194386,0.4299423,0.00025454976,0.00012926357,0.00019637616,0.00079573167,0.00018274445,0.0059301425],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993376,0.00010397352,0.000039333296,0.00015187038,0.00025704483,0.00011017523],"domain_scores_gemma":[0.99916124,0.00027899237,0.00007645221,0.00031682823,0.00010564794,0.000060818253],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036513773,0.00039994274,0.000533833,0.00063360686,0.0003945403,0.00094779604,0.0017151689,0.0006736382,0.0059446525],"category_scores_gemma":[0.003113744,0.00021806921,0.00043535556,0.0022063062,0.0006382701,0.0022757028,0.0014832154,0.0004991179,0.0013096973],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009506944,0.00023749689,0.0027198358,0.00053066754,0.000062404724,0.00048182523,0.00047845193,0.18064839,0.027737701,0.17080328,0.020128911,0.5952203],"study_design_scores_gemma":[0.0000831564,0.00024375058,0.00045695042,0.000030636904,0.000033900316,0.0006677903,0.00018085714,0.9090177,0.010458158,0.059787426,0.019009955,0.000029690762],"about_ca_topic_score_codex":0.004154849,"about_ca_topic_score_gemma":0.0027432223,"teacher_disagreement_score":0.0059446525,"about_ca_system_score_codex":0.0005970203,"about_ca_system_score_gemma":0.0005875794,"threshold_uncertainty_score":0.019886792},"labels":[],"label_agreement":null},{"id":"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.06550581335891824,"score_gpt":0.28024586088074516,"score_spread":0.2147400475218269,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140740564","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015537799,0.0015320645,0.9757529,0.00017610745,0.0000938331,0.00017747396,0.00038849996,0.0024066987,0.0039345324],"genre_scores_gemma":[0.1704664,0.0007778404,0.8240158,0.0001726441,0.00007460216,0.00047514838,0.001276163,0.00017945607,0.0025618304],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968106,0.00088831905,0.0003262449,0.0004962297,0.0011897112,0.00028886745],"domain_scores_gemma":[0.995867,0.0016451403,0.0005558839,0.0011472938,0.0006275234,0.00015716822],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015863917,0.0011095675,0.0017436268,0.0026232318,0.0008560471,0.0024842764,0.0023978576,0.0012253894,0.0037046156],"category_scores_gemma":[0.009683107,0.0007771331,0.0012160676,0.0053470563,0.0009597913,0.006029231,0.00551206,0.0010424466,0.0032625704],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013620249,0.00031158558,0.0072084037,0.0010292528,0.00040871967,0.0004325236,0.00067388994,0.09917375,0.026173066,0.0862332,0.019664926,0.75732857],"study_design_scores_gemma":[0.00024193793,0.0005626256,0.000966527,0.00012707865,0.00014833412,0.0020608997,0.00045187803,0.8775091,0.033568,0.056498364,0.027737316,0.00012782532],"about_ca_topic_score_codex":0.0011856667,"about_ca_topic_score_gemma":0.0015241294,"teacher_disagreement_score":0.0037046156,"about_ca_system_score_codex":0.0004903652,"about_ca_system_score_gemma":0.0014001522,"threshold_uncertainty_score":0.012393117},"labels":[],"label_agreement":null},{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.04753680883092413,"score_gpt":0.27328650963995604,"score_spread":0.22574970080903192,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140984273","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13841553,0.001325476,0.838894,0.0012609554,0.00009424537,0.00010348924,0.00045250767,0.0003030151,0.019150782],"genre_scores_gemma":[0.5899149,0.0014286201,0.39288694,0.0003166822,0.0002831675,0.00033678705,0.0009709828,0.00018284009,0.013679054],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984023,0.00049712305,0.00005752417,0.00032696815,0.00045141613,0.00026470478],"domain_scores_gemma":[0.9966073,0.0022694867,0.0004659931,0.00027177896,0.00019783941,0.00018766786],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016235566,0.0006878744,0.0013708364,0.0009290024,0.000806781,0.0015087317,0.0014124459,0.0018273462,0.005556429],"category_scores_gemma":[0.011035636,0.0005838149,0.0009287626,0.0015664868,0.001969967,0.0037839618,0.0026545476,0.0017644337,0.000512795],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004105499,0.00010324191,0.0014176844,0.00032460393,0.000053098083,0.00041260294,0.00025579243,0.3231106,0.0024414985,0.6167657,0.0056422763,0.049062364],"study_design_scores_gemma":[0.00010051187,0.00009034011,0.0007250519,0.00006419167,0.0000244677,0.00057287066,0.00019237814,0.64668125,0.0022642224,0.33988044,0.009368129,0.00003618948],"about_ca_topic_score_codex":0.0016035716,"about_ca_topic_score_gemma":0.0009391861,"teacher_disagreement_score":0.005556429,"about_ca_system_score_codex":0.00078502495,"about_ca_system_score_gemma":0.0007163092,"threshold_uncertainty_score":0.018588126},"labels":[],"label_agreement":null},{"id":"W2141096989","doi":"","title":"Bounded-Curvature Path Normalization","year":2006,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Bounded function; Normalization (sociology); Curvature; Mathematics; Path (computing); Computer science; Mathematical analysis; Geometry","score_opus":0.012956058346223341,"score_gpt":0.2180384118051253,"score_spread":0.20508235345890194,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141096989","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11930378,0.00033145864,0.7330511,0.0011595454,0.0006457952,0.00021376288,0.00083977927,0.0013809988,0.14307377],"genre_scores_gemma":[0.71420485,0.0006397799,0.18987279,0.00057699584,0.00040707842,0.0002937581,0.0011897942,0.0012062566,0.09160866],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985954,0.00017190877,0.00007824993,0.00038750254,0.0005793428,0.00018757564],"domain_scores_gemma":[0.99812394,0.00031960921,0.00024373649,0.000370519,0.00058263785,0.00035958798],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008610352,0.00088355923,0.00057442114,0.0019488957,0.0016458428,0.0029318235,0.0014073491,0.0012599427,0.015807616],"category_scores_gemma":[0.0046203667,0.00047257752,0.0008950292,0.0011901724,0.0029389355,0.0071219616,0.0034560093,0.0033375572,0.0035643275],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014278074,0.000010157717,0.00011830523,0.000016886806,0.000002153415,0.00005857796,0.00008484942,0.0014078327,0.0013708455,0.9887961,0.0012292692,0.00689078],"study_design_scores_gemma":[0.00000902986,0.000025897656,0.00021178264,0.000015306641,0.0000050001154,0.00030752187,0.00007152428,0.018332975,0.0022804756,0.9609218,0.017793102,0.0000256006],"about_ca_topic_score_codex":0.001209766,"about_ca_topic_score_gemma":0.0013191289,"teacher_disagreement_score":0.015807616,"about_ca_system_score_codex":0.0016831966,"about_ca_system_score_gemma":0.0009871639,"threshold_uncertainty_score":0.052881777},"labels":[],"label_agreement":null},{"id":"W2141507454","doi":"","title":"Multi-guard covers for polygonal regions","year":2010,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Guard (computer science); Polygon (computer graphics); Boundary (topology); Simple polygon; Combinatorics; Cover (algebra); Regular polygon; Convex hull; Mathematics; Time complexity; Computer science; Geometry; Mathematical analysis; Engineering","score_opus":0.040816492942253306,"score_gpt":0.2785055720344605,"score_spread":0.2376890790922072,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141507454","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29636365,0.001927949,0.6912201,0.00030839874,0.00004975514,0.0001966102,0.0007095211,0.0009578996,0.008266148],"genre_scores_gemma":[0.76093733,0.001028059,0.23354271,0.00005457084,0.00005411426,0.00014201502,0.00084931805,0.0002171271,0.0031747657],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992424,0.00012132563,0.000036105663,0.00015693204,0.00024927166,0.00019396805],"domain_scores_gemma":[0.99848527,0.0007941728,0.0002815206,0.00021726337,0.00007527665,0.00014656429],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005669946,0.0010652777,0.0010149702,0.001023373,0.00072086,0.0011378863,0.0011782662,0.0009276002,0.0025812099],"category_scores_gemma":[0.0027966418,0.00078746857,0.00096756517,0.001407126,0.0011485383,0.0023035596,0.0019974208,0.00082823465,0.00042613476],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028992753,0.00008704314,0.002681651,0.0002876422,0.00007207774,0.00038261546,0.00037231424,0.8751177,0.010087399,0.030823594,0.002249188,0.077548906],"study_design_scores_gemma":[0.000031759864,0.00015159066,0.00086376857,0.000031173146,0.000029245055,0.0003036769,0.00013683223,0.95892143,0.006638726,0.027603483,0.005270143,0.000018172492],"about_ca_topic_score_codex":0.0034859674,"about_ca_topic_score_gemma":0.0032099993,"teacher_disagreement_score":0.0034859674,"about_ca_system_score_codex":0.001293033,"about_ca_system_score_gemma":0.000525978,"threshold_uncertainty_score":0.009381652},"labels":[],"label_agreement":null},{"id":"W2145677964","doi":"","title":"A Genetic Algorithm for the Minimum Tetrahedralization of a Convex Polyhedron.","year":2003,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Polyhedron; Regular polygon; Convex polytope; Tetrahedron; Partition (number theory); Combinatorics; Mathematics; Algorithm; Mathematical optimization; Computer science; Convex set; Convex optimization; Geometry","score_opus":0.025794518208532104,"score_gpt":0.24950504614207109,"score_spread":0.223710527933539,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145677964","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006773816,0.00022924933,0.98931795,0.00010957874,0.000053508516,0.00009545877,0.00005386733,0.00032222987,0.0030442271],"genre_scores_gemma":[0.089257,0.00035319934,0.90609944,0.00011032354,0.00002963086,0.00046809722,0.0002636327,0.00014775696,0.0032708244],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996319,0.00008009043,0.000015745974,0.00008454655,0.00014274588,0.000044971413],"domain_scores_gemma":[0.9994831,0.00028836832,0.000048761754,0.000049606977,0.000098621764,0.000031528685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068135327,0.001014772,0.0010594785,0.0011967642,0.00083759107,0.00076974835,0.0014804897,0.001609178,0.0030995598],"category_scores_gemma":[0.002775263,0.00061262323,0.001095989,0.0013082251,0.0009754239,0.00083923404,0.0011625533,0.0015796338,0.0007564613],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006080056,0.0000855028,0.0006160483,0.00011878871,0.00006586521,0.00012594949,0.00015480901,0.8163257,0.005417235,0.03252399,0.004544535,0.13996075],"study_design_scores_gemma":[0.000029703719,0.00004110293,0.00011096352,0.000022898988,0.000016910857,0.000055052387,0.000024389054,0.9827085,0.0010526124,0.012376574,0.0035496831,0.0000116337405],"about_ca_topic_score_codex":0.0058267755,"about_ca_topic_score_gemma":0.004779457,"teacher_disagreement_score":0.0058267755,"about_ca_system_score_codex":0.0010649611,"about_ca_system_score_gemma":0.0015740284,"threshold_uncertainty_score":0.011585712},"labels":[],"label_agreement":null},{"id":"W2147664710","doi":"","title":"Application of computational geometry to network p-center location problems","year":2008,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Ackermann function; Center (category theory); Combinatorics; Measure (data warehouse); Function (biology); Mathematics; Computational geometry; Tree (set theory); Inverse; Binary logarithm; Geometry; Algorithm; Discrete mathematics; Computer science; Data mining; Crystallography","score_opus":0.0278149769113654,"score_gpt":0.2411485933884939,"score_spread":0.2133336164771285,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147664710","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018024798,0.0006772968,0.9715835,0.001610275,0.00010865247,0.000040327483,0.00007582851,0.00011711923,0.0077622333],"genre_scores_gemma":[0.6212941,0.0017241567,0.3691458,0.0002699231,0.00057920656,0.00021807484,0.00026932784,0.00015998057,0.0063395347],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985941,0.0006380155,0.000055240336,0.00025469682,0.00032791722,0.00013002078],"domain_scores_gemma":[0.9967822,0.0023049728,0.00021338239,0.00030653106,0.0002637636,0.00012909113],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012444064,0.00086766755,0.001067166,0.0011140036,0.0011246514,0.0015979557,0.00165801,0.001501406,0.003037373],"category_scores_gemma":[0.0064476253,0.0005405729,0.0008737331,0.0015337821,0.002712634,0.0033610607,0.0035575274,0.00253905,0.00041849635],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000575513,0.00002754695,0.00040042735,0.00013239798,0.000038846167,0.00011780719,0.00013732658,0.48435736,0.0010665904,0.48560175,0.0028345243,0.025227893],"study_design_scores_gemma":[0.000016128392,0.000024898089,0.00011045579,0.000013872497,0.0000069125845,0.00005929788,0.00005389452,0.6386805,0.0008334341,0.35517374,0.0050155846,0.000011223464],"about_ca_topic_score_codex":0.0023687931,"about_ca_topic_score_gemma":0.0014630466,"teacher_disagreement_score":0.003037373,"about_ca_system_score_codex":0.0020374826,"about_ca_system_score_gemma":0.0009979659,"threshold_uncertainty_score":0.014783025},"labels":[],"label_agreement":null},{"id":"W2148022401","doi":"","title":"When can a graph form an orthogonal polyhedron","year":2004,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Polyhedron; Vertex (graph theory); Combinatorics; Mathematics; Regular polygon; Integer points in convex polyhedra; Convex polytope; Graph; Convex set; Algorithm; Geometry; Convex optimization; Linear programming","score_opus":0.02769961273247762,"score_gpt":0.24791843677306832,"score_spread":0.2202188240405907,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148022401","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.175022,0.0011996044,0.7200281,0.010695517,0.0009689428,0.0003855056,0.0025022463,0.0017918504,0.08740626],"genre_scores_gemma":[0.7503501,0.0016455533,0.22247916,0.0013000363,0.00050266983,0.00027528265,0.002619547,0.0008166887,0.02001096],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980021,0.00038219467,0.00011434294,0.000645364,0.00046362894,0.000392373],"domain_scores_gemma":[0.9958247,0.0015206864,0.0004094867,0.0013212608,0.0005774748,0.0003463959],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090863905,0.0005201644,0.0008326212,0.000992398,0.0010634961,0.0031835244,0.0008687737,0.0019974282,0.012044612],"category_scores_gemma":[0.010285126,0.0005198682,0.0007700928,0.0011245077,0.0028518494,0.009986276,0.0014604415,0.0018932563,0.0030244098],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002758536,0.00016764582,0.0024456577,0.0003695519,0.000063509804,0.0004398774,0.00095302507,0.018686937,0.0041039716,0.7910032,0.024113916,0.15737687],"study_design_scores_gemma":[0.000026478392,0.00005773812,0.0006760833,0.00008688988,0.000019453797,0.00033023706,0.00082041253,0.03219436,0.0023485834,0.92203003,0.041371953,0.000037901784],"about_ca_topic_score_codex":0.0022523252,"about_ca_topic_score_gemma":0.0021866716,"teacher_disagreement_score":0.012044612,"about_ca_system_score_codex":0.0009631536,"about_ca_system_score_gemma":0.00063595024,"threshold_uncertainty_score":0.040293217},"labels":[],"label_agreement":null},{"id":"W2149884111","doi":"","title":"Computing Nice Sweeps for Polyhedra and Polygons","year":2004,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Polyhedron; Monotone polygon; Combinatorics; Regular polygon; Polygon (computer graphics); Mathematics; Rectilinear polygon; Simple polygon; Convex polygon; Convex set; Polygon covering; Krein–Milman theorem; Convex polytope; Computer science; Geometry; Convex optimization","score_opus":0.02848420590755417,"score_gpt":0.2638921882300127,"score_spread":0.23540798232245852,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149884111","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28514275,0.0007128646,0.69152784,0.00057685626,0.00010797436,0.0002710843,0.0028266052,0.008261706,0.010572441],"genre_scores_gemma":[0.44961894,0.00024214938,0.5392552,0.00013413248,0.000079890786,0.0001460808,0.00646723,0.00091766217,0.0031386842],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.99866366,0.00019324788,0.00013699851,0.00036624962,0.00039113016,0.00024872724],"domain_scores_gemma":[0.997227,0.0015741177,0.00020743773,0.0005712394,0.00026173668,0.00015841633],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080414995,0.0013502918,0.0015591935,0.0015963536,0.0009885931,0.0022119756,0.0019782486,0.0016494634,0.008006228],"category_scores_gemma":[0.006333788,0.0010106156,0.0021195807,0.0019068886,0.0020312076,0.0052950666,0.0027416693,0.0016412962,0.0015785566],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001390157,0.00031793313,0.011404985,0.0009971915,0.00017806664,0.00085911236,0.0008271842,0.51457065,0.016234327,0.10493391,0.01401576,0.33427075],"study_design_scores_gemma":[0.00012205852,0.00020037677,0.00080281676,0.000048999467,0.000030050798,0.00018408294,0.0004190931,0.8467352,0.0067401337,0.1392852,0.0054000057,0.000031941596],"about_ca_topic_score_codex":0.003100108,"about_ca_topic_score_gemma":0.0054555372,"teacher_disagreement_score":0.008006228,"about_ca_system_score_codex":0.0009796768,"about_ca_system_score_gemma":0.0006737444,"threshold_uncertainty_score":0.026783466},"labels":[],"label_agreement":null},{"id":"W2151289047","doi":"","title":"The Bichromatic Rectangle Problem in High Dimensions.","year":2009,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Rectangle; Set (abstract data type); Point (geometry); Combinatorics; Space (punctuation); Algorithm; Mathematics; Computer science; Discrete mathematics; Geometry","score_opus":0.015620461884556005,"score_gpt":0.2340983481156226,"score_spread":0.2184778862310666,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2151289047","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051100463,0.0018691741,0.92948914,0.0009003273,0.00013804986,0.00023859767,0.0012681421,0.0010965434,0.013899526],"genre_scores_gemma":[0.17327559,0.0009537746,0.8128972,0.0003358129,0.000108793625,0.0003807649,0.002494982,0.0004193738,0.009133661],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997815,0.00079577055,0.00014791904,0.00045991782,0.0004910773,0.00029029968],"domain_scores_gemma":[0.9969079,0.0017957214,0.00033429425,0.0005633981,0.00023013711,0.00016849415],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016387634,0.0011254862,0.0017095325,0.0010674115,0.0011240467,0.0019626382,0.0021115728,0.0013799603,0.010844269],"category_scores_gemma":[0.006432194,0.000850652,0.001145748,0.0024700311,0.0011246015,0.0041601593,0.003674666,0.0017370088,0.0025474704],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011450405,0.00034083694,0.003878642,0.0017718142,0.00022562155,0.0008043262,0.00094537094,0.25498053,0.012419212,0.26802963,0.054452054,0.40100694],"study_design_scores_gemma":[0.00027175076,0.00021741033,0.0016053697,0.00015862587,0.00007292244,0.0011010473,0.0008102227,0.6134108,0.007158255,0.344516,0.030605225,0.00007245079],"about_ca_topic_score_codex":0.0025956293,"about_ca_topic_score_gemma":0.003579925,"teacher_disagreement_score":0.010844269,"about_ca_system_score_codex":0.00062302063,"about_ca_system_score_gemma":0.0008866789,"threshold_uncertainty_score":0.03627765},"labels":[],"label_agreement":null},{"id":"W2160650170","doi":"","title":"Cache-Oblivious Output-Sensitive Two-Dimensional Convex Hull","year":2007,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Convex hull; Cache; Cache-oblivious algorithm; Parallel computing; Combinatorics; Computer science; Cache algorithms; Block size; CPU cache; Algorithm; Mathematics; Regular polygon; Geometry; Key (lock)","score_opus":0.03535666633472642,"score_gpt":0.27830733210590486,"score_spread":0.24295066577117844,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2160650170","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08008767,0.00014066827,0.9168314,0.00024198793,0.00002188466,0.000046613022,0.000243264,0.00033865529,0.0020479574],"genre_scores_gemma":[0.82863945,0.00018324144,0.1666007,0.00008625216,0.000043586755,0.00011845172,0.00075850677,0.00020963665,0.0033601637],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989384,0.00027493146,0.00005169766,0.00017810376,0.00040506994,0.00015178973],"domain_scores_gemma":[0.99706227,0.0015299078,0.0003074766,0.00063301943,0.00033801148,0.00012931447],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011190397,0.0010227116,0.0015689363,0.00052146974,0.0005576568,0.0015738396,0.001698255,0.00096514873,0.0016037204],"category_scores_gemma":[0.005621097,0.00054467487,0.0011322761,0.0012846647,0.0014288116,0.0022240935,0.0021842895,0.001500252,0.00027885204],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000104160914,0.000024769852,0.00038861358,0.000050110633,0.000025925674,0.00009482196,0.00005162623,0.97904474,0.0017812153,0.0067463038,0.00061168463,0.0110761],"study_design_scores_gemma":[0.0000069879347,0.000028803566,0.00009822522,0.0000031994625,0.0000037937893,0.00002399867,0.000013414921,0.9907562,0.001495992,0.0074083568,0.00015579644,0.0000051543],"about_ca_topic_score_codex":0.0029198257,"about_ca_topic_score_gemma":0.001605226,"teacher_disagreement_score":0.0029198257,"about_ca_system_score_codex":0.0013328482,"about_ca_system_score_gemma":0.00077979284,"threshold_uncertainty_score":0.009670556},"labels":[],"label_agreement":null},{"id":"W2166438223","doi":"","title":"Decomposing Polygons Into Diameter Bounded Components","year":2003,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Simple polygon; Polygon (computer graphics); Polygon covering; Visibility polygon; Mathematics; Combinatorics; Bounded function; Rectilinear polygon; Heuristics; Bounding overwatch; Decomposition; Intersection (aeronautics); Point in polygon; Reduction (mathematics); Polygon mesh; Algorithm; Computer science; Monotone polygon; Mathematical optimization; Geometry; Artificial intelligence","score_opus":0.032631385377684945,"score_gpt":0.25722298217696493,"score_spread":0.22459159679927998,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2166438223","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17448969,0.0010006386,0.80117196,0.0005075769,0.00008845341,0.00026131186,0.0007393866,0.00086164975,0.020879202],"genre_scores_gemma":[0.47113115,0.0012522076,0.5132196,0.00027742397,0.00010599234,0.00027033204,0.0022357057,0.00028864443,0.0112189995],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99955255,0.000053552,0.000031148556,0.00014323115,0.00012293848,0.00009656604],"domain_scores_gemma":[0.9991652,0.00029025562,0.00014846511,0.00024070014,0.00006312806,0.00009233718],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027294847,0.0008981554,0.0006979007,0.0005392303,0.00051100383,0.0013676697,0.00096497784,0.0005886924,0.0035517006],"category_scores_gemma":[0.001714321,0.0006161923,0.00083239947,0.0008970696,0.00075399276,0.0020342227,0.0020742964,0.0011962423,0.0009303156],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00059723883,0.00022397279,0.0034626853,0.00081553584,0.00006950741,0.0013761058,0.00065135496,0.48868454,0.1010113,0.16629082,0.011703421,0.22511359],"study_design_scores_gemma":[0.000090031004,0.00029638948,0.002293366,0.00012711491,0.000075312804,0.001653644,0.00045216756,0.7036247,0.03453035,0.20864359,0.04817586,0.000037517126],"about_ca_topic_score_codex":0.0012841081,"about_ca_topic_score_gemma":0.0017488928,"teacher_disagreement_score":0.0035517006,"about_ca_system_score_codex":0.00069654424,"about_ca_system_score_gemma":0.000508296,"threshold_uncertainty_score":0.01188159},"labels":[],"label_agreement":null},{"id":"W2168122044","doi":"","title":"Towards a Dynamic Data Structure for Ecient Bounded Line Range Search","year":2010,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Intersection (aeronautics); Bounded function; Rectangle; Line (geometry); Data structure; Combinatorics; Line segment; Mathematics; Range (aeronautics); Binary logarithm; Plane (geometry); Algorithm; Discrete mathematics; Computer science; Geometry; Mathematical analysis","score_opus":0.05768482059480392,"score_gpt":0.3178930795238237,"score_spread":0.2602082589290198,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168122044","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0043628537,0.00058674754,0.9824623,0.0003921249,0.00007734833,0.00012342464,0.0009986663,0.009450639,0.0015459048],"genre_scores_gemma":[0.051171307,0.0004400236,0.93713707,0.00041533774,0.0000937136,0.0006595408,0.005708678,0.0013977481,0.0029765682],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99401844,0.0010111013,0.00094755634,0.0011248614,0.0023504305,0.0005476504],"domain_scores_gemma":[0.9895064,0.002632298,0.00083565305,0.0045984862,0.002035662,0.00039153727],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032584267,0.0017289692,0.0023669524,0.0040230667,0.0019362441,0.0046624397,0.008057919,0.0024752778,0.007909724],"category_scores_gemma":[0.015121692,0.0020301763,0.0018749473,0.007838644,0.0020664001,0.010575502,0.010263108,0.0043468704,0.0057558655],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020864594,0.0005646281,0.004167297,0.0010049116,0.00017944691,0.0003696539,0.0010624089,0.07666753,0.021475997,0.15481299,0.061936162,0.6756726],"study_design_scores_gemma":[0.00055204483,0.000449884,0.0007027129,0.00031475135,0.000106619744,0.00048163618,0.0004189908,0.7245357,0.039016273,0.1199252,0.11329537,0.00020079344],"about_ca_topic_score_codex":0.006018907,"about_ca_topic_score_gemma":0.007224028,"teacher_disagreement_score":0.008057919,"about_ca_system_score_codex":0.0026249615,"about_ca_system_score_gemma":0.0033199843,"threshold_uncertainty_score":0.026460648},"labels":[],"label_agreement":null},{"id":"W2171353987","doi":"","title":"On multi-level k-ranges for range search.","year":2004,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick; University of Victoria","funders":"","keywords":"Range (aeronautics); Combinatorics; Binary logarithm; Tree (set theory); Mathematics; Physics; Materials science","score_opus":0.1099219150007775,"score_gpt":0.29831106541324254,"score_spread":0.18838915041246504,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2171353987","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.109768644,0.001934527,0.8660103,0.0007410313,0.00006748193,0.00034914393,0.00060591655,0.008968096,0.011554904],"genre_scores_gemma":[0.3107322,0.0003321059,0.6847064,0.00021843209,0.000040456234,0.00034458475,0.0009677925,0.0003979781,0.0022600414],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963012,0.0009693485,0.00036014957,0.00052441796,0.0013838741,0.00046102243],"domain_scores_gemma":[0.9882464,0.0052594445,0.0008851197,0.0039954395,0.0012511566,0.0003624615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027521085,0.00069455925,0.001217517,0.0021254143,0.0010194363,0.002348041,0.004197444,0.0015282014,0.008235366],"category_scores_gemma":[0.015777828,0.0007744085,0.0011002294,0.0042079403,0.0014333602,0.0092640435,0.005532727,0.0013868555,0.0033901911],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017640615,0.00078769366,0.011688859,0.0008950773,0.00019399893,0.00037392063,0.0014579325,0.13033871,0.0220907,0.09942713,0.0144169275,0.71656513],"study_design_scores_gemma":[0.0004310485,0.0011432677,0.0027851202,0.00017910147,0.000097730044,0.001104892,0.00065226783,0.8599319,0.021050062,0.094208956,0.01822833,0.00018740266],"about_ca_topic_score_codex":0.0033079798,"about_ca_topic_score_gemma":0.0046289777,"teacher_disagreement_score":0.008235366,"about_ca_system_score_codex":0.0010051271,"about_ca_system_score_gemma":0.0014037357,"threshold_uncertainty_score":0.027550042},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.10202323723914943,"score_gpt":0.2829609674534197,"score_spread":0.1809377302142703,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2172037166","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016431704,0.00050301634,0.97800577,0.00033613126,0.000057847847,0.00007689452,0.00012708984,0.00074537576,0.0037161817],"genre_scores_gemma":[0.21056174,0.00067282334,0.7821863,0.00018824394,0.00012491066,0.00027898312,0.0008401719,0.00032857546,0.004818328],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981926,0.00037608173,0.0001018042,0.00037279562,0.0006263126,0.00033039597],"domain_scores_gemma":[0.9964025,0.0021917394,0.00023734992,0.0006778414,0.00033393397,0.0001567241],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020959247,0.0016382508,0.0017911402,0.0010321017,0.000953727,0.0021758717,0.0040021385,0.0018726207,0.0076762484],"category_scores_gemma":[0.009647629,0.00063603086,0.0013574789,0.0026683703,0.0012055931,0.0046564317,0.002605577,0.003260394,0.0017613968],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005791103,0.00027959514,0.0011621435,0.00037489572,0.00010071695,0.00012838122,0.00030065185,0.6639423,0.0034506384,0.12811522,0.01107078,0.19049554],"study_design_scores_gemma":[0.000051531293,0.00003744858,0.00007733366,0.0000115545,0.000010593564,0.000048750157,0.000046078225,0.94883406,0.00079178944,0.048389293,0.0016921109,0.00000953685],"about_ca_topic_score_codex":0.0045505785,"about_ca_topic_score_gemma":0.004303642,"teacher_disagreement_score":0.0076762484,"about_ca_system_score_codex":0.0024470948,"about_ca_system_score_gemma":0.0015649602,"threshold_uncertainty_score":0.025679588},"labels":[],"label_agreement":null},{"id":"W2182520915","doi":"","title":"Exact Algorithms and APX-Hardness Results for Geometric Set Cover","year":2011,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Cover (algebra); Mathematics; Vertex cover; Monotone polygon; Rectangle; Set cover problem; Unit square; Approximation algorithm; Time complexity; Algorithm; Line segment; Computational geometry; Square (algebra); Set (abstract data type); Computer science; Geometry","score_opus":0.0761986086665031,"score_gpt":0.2723684118473931,"score_spread":0.19616980318088997,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2182520915","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.085901886,0.0017516017,0.8788495,0.0036173107,0.00018378806,0.0003480507,0.0016263855,0.002228855,0.025492536],"genre_scores_gemma":[0.5019375,0.001767316,0.47932437,0.0006977416,0.0004949982,0.0008814289,0.003663249,0.000723376,0.010510074],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99749124,0.00048669128,0.00013548436,0.000595105,0.00076913263,0.0005224257],"domain_scores_gemma":[0.9926893,0.0050166687,0.0004907309,0.0012443579,0.00027755025,0.00028136693],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017073002,0.0016354619,0.0019040792,0.0013301154,0.0015252199,0.0038982003,0.0041836025,0.002492302,0.01085313],"category_scores_gemma":[0.010216313,0.000991828,0.0022469705,0.003547771,0.0019454391,0.00863725,0.0036704352,0.0040334817,0.0016967205],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00086343236,0.0005511714,0.0027875926,0.0010849074,0.00019891298,0.00029836252,0.0006783224,0.5176022,0.0058446527,0.28223246,0.020017864,0.16784011],"study_design_scores_gemma":[0.00014575082,0.000119452074,0.00057470053,0.00006807135,0.000048727426,0.00027519604,0.00015408824,0.62881196,0.002321183,0.36104602,0.006402327,0.000032571777],"about_ca_topic_score_codex":0.0022359428,"about_ca_topic_score_gemma":0.002266398,"teacher_disagreement_score":0.01085313,"about_ca_system_score_codex":0.0034290042,"about_ca_system_score_gemma":0.0016985647,"threshold_uncertainty_score":0.036307395},"labels":[],"label_agreement":null},{"id":"W2183482302","doi":"","title":"Computing a planar widest empty -siphon in o(n 3 ) time","year":2007,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge; Simon Fraser University","funders":"","keywords":"Combinatorics; Planar; Plane (geometry); Computational geometry; Euclidean geometry; Euclidean space; Time complexity; Mathematics; Set (abstract data type); Chain (unit); Binary logarithm; Property (philosophy); Algorithm; Geometry; Computer science; Physics; Computer graphics (images)","score_opus":0.02081391544154621,"score_gpt":0.254161815478128,"score_spread":0.2333479000365818,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2183482302","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27337453,0.00025135867,0.69800067,0.00031433592,0.000111151625,0.00024265294,0.0012410656,0.009512459,0.016951744],"genre_scores_gemma":[0.4661857,0.00014454477,0.5189266,0.00014325806,0.000032039818,0.00016565724,0.00399103,0.0007589841,0.009652076],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99962986,0.000033532546,0.000028121034,0.00012290121,0.00009988501,0.00008566037],"domain_scores_gemma":[0.9995276,0.00022868937,0.000037912927,0.000083645784,0.00004912295,0.00007311192],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003205943,0.0010465139,0.0015083316,0.0009636585,0.00074623944,0.0010183137,0.0013848783,0.001182084,0.023028376],"category_scores_gemma":[0.001642019,0.0006002935,0.00095323427,0.0009812621,0.00064785936,0.002287171,0.0022546153,0.00055526843,0.0020291575],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013890227,0.00026585572,0.004272664,0.0007955022,0.00014371784,0.00063619117,0.00038573222,0.3190153,0.023176722,0.01798514,0.018150508,0.61378366],"study_design_scores_gemma":[0.00016206085,0.00040378838,0.0012205493,0.0000447395,0.000045151668,0.0002445121,0.00064684707,0.9383372,0.009913944,0.041668687,0.007271966,0.0000405842],"about_ca_topic_score_codex":0.0023532822,"about_ca_topic_score_gemma":0.0062491633,"teacher_disagreement_score":0.023028376,"about_ca_system_score_codex":0.0005589227,"about_ca_system_score_gemma":0.001120349,"threshold_uncertainty_score":0.07703757},"labels":[],"label_agreement":null},{"id":"W2185134590","doi":"","title":"Turning Orthogonally Convex Polyhedra into Orthoballs","year":2014,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Polyhedron; Convex polytope; Regular polygon; Combinatorics; Mathematics; Planar graph; Face (sociological concept); Graph; Convex set; Computer science; Geometry; Convex optimization","score_opus":0.01531333210797006,"score_gpt":0.2375764296703209,"score_spread":0.22226309756235083,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2185134590","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14230584,0.00017535384,0.8314971,0.0002686894,0.00012824169,0.00009742372,0.00047299234,0.0004913433,0.024563052],"genre_scores_gemma":[0.55737156,0.0005562221,0.42571992,0.00030800048,0.00010099712,0.00014260545,0.0012985372,0.00082685566,0.0136753395],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99922943,0.00014680086,0.000035014415,0.0002134421,0.000261486,0.00011384902],"domain_scores_gemma":[0.99871004,0.0003499663,0.00023591366,0.00032249663,0.0002354776,0.00014608231],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035105637,0.0005782086,0.00039932688,0.00095112226,0.0006026918,0.0019896093,0.0007212572,0.0005992451,0.0055913567],"category_scores_gemma":[0.0026540463,0.0005983978,0.00071185146,0.00078176975,0.0024962137,0.003018918,0.002111984,0.0021948342,0.001072338],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017037356,0.00006368946,0.001204036,0.00011204988,0.000012925682,0.0002957354,0.00058347994,0.037283834,0.01554886,0.8977972,0.0023730975,0.04455469],"study_design_scores_gemma":[0.000025094389,0.00007172579,0.0008017406,0.000052702904,0.0000131799625,0.00030597855,0.00055337645,0.124879405,0.007309584,0.8424031,0.023544364,0.00003977807],"about_ca_topic_score_codex":0.0024332555,"about_ca_topic_score_gemma":0.0033412026,"teacher_disagreement_score":0.0055913567,"about_ca_system_score_codex":0.00048455637,"about_ca_system_score_gemma":0.00033476015,"threshold_uncertainty_score":0.01870495},"labels":[],"label_agreement":null},{"id":"W2185561909","doi":"","title":"The spanning ratio of the Delaunay triangulation is greater than = 2","year":2009,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Carleton University","funders":"","keywords":"Delaunay triangulation; Combinatorics; Euclidean minimum spanning tree; Mathematics; Spanning tree; Shortest path problem; Pitteway triangulation; Discrete mathematics; Graph; Kruskal's algorithm","score_opus":0.02716924511353718,"score_gpt":0.24636877119434886,"score_spread":0.21919952608081167,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2185561909","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4919333,0.0025233189,0.46159634,0.0027374334,0.00019613198,0.00014422266,0.00084438256,0.00068804785,0.03933675],"genre_scores_gemma":[0.93275976,0.0009020528,0.063157484,0.00026826366,0.00013774754,0.00015501541,0.00037667796,0.00014278988,0.002100275],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966667,0.0007940793,0.00021149371,0.0007217495,0.0010912912,0.0005146353],"domain_scores_gemma":[0.9883156,0.0076444326,0.0017800971,0.0010031475,0.00070881017,0.0005479426],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00226403,0.000640618,0.0012930551,0.0010338697,0.0011227754,0.0017379689,0.0011052133,0.0015094551,0.0048351837],"category_scores_gemma":[0.029229779,0.0006603883,0.00060534256,0.001418308,0.001553528,0.0028185651,0.0026811247,0.0009896882,0.0009866478],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019948857,0.00019628186,0.033298217,0.0011828807,0.00041267186,0.004255931,0.0016080451,0.23765476,0.06603311,0.4215195,0.0169576,0.21488611],"study_design_scores_gemma":[0.0002736811,0.0007285662,0.015446834,0.00030350903,0.00015125028,0.011952411,0.0010322742,0.49267396,0.032923557,0.4146675,0.029670348,0.00017611591],"about_ca_topic_score_codex":0.0004980139,"about_ca_topic_score_gemma":0.00031241294,"teacher_disagreement_score":0.0048351837,"about_ca_system_score_codex":0.0006145633,"about_ca_system_score_gemma":0.0004249221,"threshold_uncertainty_score":0.01617533},"labels":[],"label_agreement":null},{"id":"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.04062558458719696,"score_gpt":0.28570176632086003,"score_spread":0.24507618173366308,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2186560431","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045863867,0.0019300524,0.9353945,0.0016343326,0.0001335339,0.00017838606,0.00091985054,0.0010156588,0.012929726],"genre_scores_gemma":[0.61277455,0.0021195102,0.3732214,0.00033695073,0.00051777577,0.0004834059,0.0020614434,0.0004250748,0.008059882],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996849,0.0012942863,0.00011714336,0.0005665116,0.000778267,0.00039473595],"domain_scores_gemma":[0.9917823,0.0058832276,0.0005528178,0.0012504398,0.00023974785,0.00029142536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027553733,0.001371221,0.0019162793,0.0020298285,0.0012294012,0.0050318404,0.0043014297,0.002229429,0.009010656],"category_scores_gemma":[0.014114682,0.001287947,0.002948141,0.00386958,0.0019531955,0.013883795,0.003838443,0.0038228198,0.0014274463],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006081686,0.00028431756,0.0010724646,0.00051787193,0.00023681307,0.00020991442,0.0004254975,0.35937735,0.0038426293,0.5483079,0.0136054875,0.07151159],"study_design_scores_gemma":[0.000050160947,0.00005816469,0.0001956235,0.000039867955,0.000043637687,0.00011633587,0.00009342467,0.527191,0.0010674221,0.46736497,0.003760111,0.000019322268],"about_ca_topic_score_codex":0.0029873631,"about_ca_topic_score_gemma":0.0040919813,"teacher_disagreement_score":0.009010656,"about_ca_system_score_codex":0.0032812953,"about_ca_system_score_gemma":0.0019755512,"threshold_uncertainty_score":0.030143619},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Combinatorics; Mathematics; Upper and lower bounds; Discrete mathematics","score_opus":0.05157835567815482,"score_gpt":0.30788677617249155,"score_spread":0.2563084204943367,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2188440933","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35721105,0.034912672,0.46379736,0.018273208,0.00131118,0.0001111809,0.0019400929,0.0018389473,0.120604366],"genre_scores_gemma":[0.9020146,0.00646697,0.08231663,0.0025277846,0.00067150133,0.000103504964,0.0008767075,0.00063351414,0.004388781],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974324,0.0007565444,0.000096932934,0.0004797556,0.00057038985,0.0006640381],"domain_scores_gemma":[0.9885324,0.0069779716,0.0010804206,0.0018950735,0.00075154204,0.0007625469],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031101021,0.0017281948,0.0014149386,0.0016555547,0.0013015021,0.0031686919,0.0019432931,0.0015567627,0.013273388],"category_scores_gemma":[0.019773506,0.00080933044,0.0010661667,0.002234929,0.0018629486,0.011212025,0.0024424829,0.0031090924,0.0019506373],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008455239,0.00032397377,0.0048688897,0.0010403509,0.0002531179,0.00029907122,0.00039027745,0.13132286,0.014393512,0.6846283,0.034322336,0.12731184],"study_design_scores_gemma":[0.000067847,0.00020696521,0.0021864062,0.00023338309,0.00010795481,0.0007405174,0.0003691048,0.1370068,0.0050723944,0.8366683,0.017280715,0.0000594722],"about_ca_topic_score_codex":0.0009538734,"about_ca_topic_score_gemma":0.0014107912,"teacher_disagreement_score":0.013273388,"about_ca_system_score_codex":0.0016339149,"about_ca_system_score_gemma":0.00077443256,"threshold_uncertainty_score":0.04440391},"labels":[],"label_agreement":null},{"id":"W2188906995","doi":"","title":"An improved method for generating triangle-mesh models of images","year":2014,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Computer Graphics and Visualization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computation; Computer science; Margin (machine learning); Algorithm; Triangulation; Noise (video); Triangle mesh; Signal-to-noise ratio (imaging); Artificial intelligence; Image (mathematics); Mathematics; Computer graphics (images); Polygon mesh; Telecommunications; Geometry","score_opus":0.043397298308301954,"score_gpt":0.3264325494921041,"score_spread":0.28303525118380213,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2188906995","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019037925,0.000051991326,0.9964831,0.000050453564,0.00004751767,0.000041391057,0.000051758412,0.0004554899,0.0009145484],"genre_scores_gemma":[0.048593175,0.00014817555,0.94769526,0.000058192792,0.000023982495,0.000096883115,0.0002818361,0.00027374178,0.0028287405],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992724,0.000080218,0.000040328836,0.00011256269,0.00045995374,0.00003445563],"domain_scores_gemma":[0.9991779,0.0001930511,0.000038190836,0.00026149346,0.00029787864,0.000031377735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054931134,0.00065054273,0.0004810732,0.0009986568,0.0003080986,0.0007462796,0.0016333207,0.00095657463,0.005012153],"category_scores_gemma":[0.0031001817,0.00047954175,0.00095034693,0.00084411574,0.00039526098,0.0011345748,0.0010867749,0.0012356143,0.0013643703],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017952055,0.000078544836,0.00094334554,0.00049282535,0.00009463172,0.00035087898,0.00036757145,0.19849603,0.12465616,0.046485532,0.009070461,0.61878455],"study_design_scores_gemma":[0.000030178044,0.000056083456,0.00017985993,0.000019172146,0.000017765,0.00039484166,0.000028356355,0.93970156,0.0332079,0.004635971,0.021693999,0.000034225308],"about_ca_topic_score_codex":0.0019947563,"about_ca_topic_score_gemma":0.0025631823,"teacher_disagreement_score":0.005012153,"about_ca_system_score_codex":0.0003403667,"about_ca_system_score_gemma":0.0005437399,"threshold_uncertainty_score":0.016767323},"labels":[],"label_agreement":null},{"id":"W22225833","doi":"10.48550/arxiv.1311.4860","title":"Computing Covers of Plane Forests","year":2013,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Cover (algebra); Disjoint sets; Combinatorics; Convex hull; Bounding overwatch; Mathematics; Plane (geometry); Function (biology); Pairwise comparison; Set (abstract data type); Regular polygon; Discrete mathematics; Computer science; Geometry; Artificial intelligence","score_opus":0.021014756440552698,"score_gpt":0.23658945077304488,"score_spread":0.21557469433249218,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W22225833","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5498839,0.0018414217,0.42469564,0.00044177935,0.0000668128,0.00014307149,0.0050479188,0.0034461033,0.014433326],"genre_scores_gemma":[0.7957843,0.00074382225,0.18741946,0.00012397811,0.0000751323,0.00015169532,0.01024918,0.00052654557,0.004925977],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990669,0.00008428709,0.000050168816,0.00021735676,0.00033664843,0.00024464593],"domain_scores_gemma":[0.998591,0.00070092164,0.0001434634,0.00030702964,0.0001573826,0.00010025126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031425784,0.0007510447,0.0009254435,0.0016697334,0.0008563628,0.0021213768,0.0010805031,0.000986942,0.005673928],"category_scores_gemma":[0.0034842554,0.0007299025,0.0010211141,0.0019973048,0.0008706553,0.0039109467,0.001985232,0.0007788597,0.0013161472],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014330007,0.00018349396,0.023823466,0.00076846796,0.00028433482,0.0009632311,0.0013937483,0.40397546,0.034732502,0.14112161,0.021943046,0.36937758],"study_design_scores_gemma":[0.00006236854,0.00014659061,0.006145357,0.00009328082,0.00007931467,0.00084767153,0.0005975113,0.7886154,0.02124371,0.15900631,0.023110958,0.000051468203],"about_ca_topic_score_codex":0.006567459,"about_ca_topic_score_gemma":0.008187662,"teacher_disagreement_score":0.006567459,"about_ca_system_score_codex":0.0012633313,"about_ca_system_score_gemma":0.0006504687,"threshold_uncertainty_score":0.018981159},"labels":[],"label_agreement":null},{"id":"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.05831943655892484,"score_gpt":0.2812326171816245,"score_spread":0.22291318062269966,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2293145487","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042264998,0.00089295855,0.93115896,0.0008984048,0.0003746482,0.00023321336,0.0014935884,0.0038888487,0.018794363],"genre_scores_gemma":[0.32221434,0.00097561534,0.6501124,0.00061384705,0.00028636467,0.00024664303,0.0031681194,0.0006919396,0.021690791],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987985,0.00015008287,0.000119135795,0.00020865958,0.0004974939,0.00022608647],"domain_scores_gemma":[0.9978759,0.00045117253,0.00014246903,0.0005865596,0.000739438,0.00020445597],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00091016537,0.0004774197,0.0010573973,0.0012643026,0.0010658619,0.0023387568,0.001954769,0.0010359096,0.00843916],"category_scores_gemma":[0.0052764416,0.0004725541,0.00056384294,0.0025477007,0.00069867464,0.0047628293,0.0024192964,0.0012146119,0.0038624147],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001621863,0.00044090234,0.0035779173,0.0009116031,0.000091817084,0.0011355834,0.0010205274,0.023516305,0.05317983,0.301602,0.05981155,0.55309016],"study_design_scores_gemma":[0.00052084774,0.0013435844,0.0017376086,0.00020075252,0.00022343446,0.0033222178,0.0008375184,0.30064052,0.06563561,0.40557113,0.21974184,0.0002249071],"about_ca_topic_score_codex":0.0021682242,"about_ca_topic_score_gemma":0.0021460666,"teacher_disagreement_score":0.00843916,"about_ca_system_score_codex":0.000767231,"about_ca_system_score_gemma":0.0016851079,"threshold_uncertainty_score":0.0282318},"labels":[],"label_agreement":null},{"id":"W2293226065","doi":"","title":"Window Queries On Planar Subdivisions Arising From Overlapping Polygons","year":2014,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Regular polygon; Combinatorics; Point in polygon; Planar; Subdivision; Space (punctuation); Simple (philosophy); Computational geometry; Polygon (computer graphics); Polygon mesh; Mathematics; Computer science; Algorithm; Geometry; Computer graphics (images)","score_opus":0.025237448898434094,"score_gpt":0.23910004481009484,"score_spread":0.21386259591166074,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2293226065","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5353046,0.0021082256,0.44366047,0.0006553701,0.00008670763,0.00025826,0.0032764412,0.0045811567,0.010068807],"genre_scores_gemma":[0.78749377,0.0010452219,0.20182261,0.00009762913,0.00008928749,0.00022836572,0.0045995554,0.0003940513,0.004229511],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.998939,0.00013224779,0.00011557652,0.00020257324,0.00043118262,0.00017937634],"domain_scores_gemma":[0.997945,0.0012212874,0.00021919252,0.0004123328,0.00010193369,0.00010015926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066196744,0.0005677092,0.001372889,0.0013413873,0.000665395,0.0021731788,0.0012656461,0.0009417874,0.004711173],"category_scores_gemma":[0.005289745,0.00057110714,0.0007057381,0.0031182913,0.0006645157,0.005267692,0.0046608555,0.00071175786,0.00062946754],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0035788945,0.00025083753,0.0123927435,0.0009920656,0.00019985909,0.0033768273,0.0037558572,0.15637483,0.08030754,0.15999761,0.025973178,0.55279976],"study_design_scores_gemma":[0.00037895472,0.0003115661,0.0034048143,0.00012044246,0.00007137852,0.0013067817,0.0019242365,0.78399736,0.036195934,0.140105,0.032107096,0.00007648571],"about_ca_topic_score_codex":0.0021431993,"about_ca_topic_score_gemma":0.002655545,"teacher_disagreement_score":0.004711173,"about_ca_system_score_codex":0.0006745321,"about_ca_system_score_gemma":0.00026934815,"threshold_uncertainty_score":0.015760481},"labels":[],"label_agreement":null},{"id":"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.039339746340765196,"score_gpt":0.2710083307283992,"score_spread":0.231668584387634,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2294012348","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.058567844,0.0009944744,0.9218136,0.0005070148,0.00019629564,0.0001371103,0.0004429074,0.003234904,0.014105865],"genre_scores_gemma":[0.45273888,0.0007268763,0.5286656,0.0004892232,0.00022305184,0.0002053314,0.0014028329,0.0005500699,0.014998124],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986426,0.00026892545,0.000088903296,0.00031053595,0.00047379293,0.00021516457],"domain_scores_gemma":[0.99708587,0.0010209791,0.0002631986,0.001132475,0.0003116034,0.00018581066],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061100593,0.00091416144,0.0014399689,0.0004206151,0.00065450754,0.0014360647,0.002277441,0.0013596617,0.008988945],"category_scores_gemma":[0.0041801454,0.00047813088,0.0006245429,0.0017451606,0.00089270325,0.003613195,0.0021730163,0.0011576384,0.0025341685],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012493444,0.000496963,0.0021736135,0.00062027725,0.00008924649,0.00039120807,0.0002654962,0.2666479,0.023421949,0.08088178,0.025150979,0.59861124],"study_design_scores_gemma":[0.00008208506,0.00034681824,0.0005677747,0.000028765062,0.000025462765,0.00053968147,0.00008743986,0.8825554,0.011729511,0.08974824,0.014259628,0.000029187442],"about_ca_topic_score_codex":0.0012480891,"about_ca_topic_score_gemma":0.0014115564,"teacher_disagreement_score":0.008988945,"about_ca_system_score_codex":0.00072738813,"about_ca_system_score_gemma":0.00083660876,"threshold_uncertainty_score":0.03007102},"labels":[],"label_agreement":null},{"id":"W2294243368","doi":"","title":"Optimal Average Case Strategy for Looking around a Corner","year":2012,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Dalhousie University","funders":"","keywords":"Robot; Vertex (graph theory); Mathematics; Regular polygon; Path (computing); Function (biology); Motion planning; Computer science; Mathematical optimization; Artificial intelligence; Combinatorics; Geometry; Graph","score_opus":0.06612095846838448,"score_gpt":0.2950670190433908,"score_spread":0.2289460605750063,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2294243368","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37333038,0.0003140559,0.599976,0.00051993923,0.00004527275,0.0002036823,0.00022366917,0.0004902204,0.024896761],"genre_scores_gemma":[0.93740326,0.00010504806,0.059720106,0.00007777394,0.000016144617,0.000089248075,0.00011369457,0.000041406474,0.0024334032],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989355,0.00022914755,0.000068703564,0.0002443156,0.00025434885,0.00026795224],"domain_scores_gemma":[0.9978404,0.0010483298,0.0003419802,0.00022208298,0.00025452764,0.000292654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009868997,0.0008182591,0.00083084515,0.0009230777,0.0007217698,0.0012676676,0.0014777523,0.0019155589,0.0033215974],"category_scores_gemma":[0.0056583197,0.00039928977,0.000561509,0.00069264893,0.0011305657,0.001556047,0.0012033914,0.00048046024,0.00059230224],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00079617044,0.0003653824,0.003657328,0.00018549219,0.000121708166,0.0006134833,0.00028335507,0.86707526,0.014344228,0.06162519,0.0020923528,0.048840098],"study_design_scores_gemma":[0.00004769954,0.0002825742,0.00048844604,0.00001305261,0.000021637064,0.0002025782,0.00007508637,0.9763866,0.0019480846,0.02000509,0.00050470687,0.000024451341],"about_ca_topic_score_codex":0.005119319,"about_ca_topic_score_gemma":0.0036917988,"teacher_disagreement_score":0.005119319,"about_ca_system_score_codex":0.0014711006,"about_ca_system_score_gemma":0.0017375207,"threshold_uncertainty_score":0.011111796},"labels":[],"label_agreement":null},{"id":"W2294852551","doi":"","title":"Online Packing of Equilateral Triangles","year":2015,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Equilateral triangle; Competitive analysis; Online algorithm; Computer science; Sequence (biology); Packing problems; Unit (ring theory); Upper and lower bounds; Algorithm; Combinatorics; Mathematics; Geometry","score_opus":0.07778953216714346,"score_gpt":0.26259192413017024,"score_spread":0.18480239196302678,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2294852551","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2818844,0.0013308226,0.6812604,0.0010512178,0.0002943175,0.00022281453,0.0006598881,0.0017116799,0.031584445],"genre_scores_gemma":[0.7024815,0.00065225555,0.28569508,0.00028860738,0.00015864456,0.00016056115,0.0011304438,0.00029375567,0.009139256],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.99821585,0.00045177407,0.000096006705,0.00038752964,0.0004926175,0.00035612626],"domain_scores_gemma":[0.9952337,0.0026038801,0.00048107925,0.0010423071,0.0002821621,0.0003568323],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007132847,0.0007436416,0.0016752277,0.0006048071,0.0008100368,0.0015631819,0.0024361196,0.0017754466,0.009904262],"category_scores_gemma":[0.0068862233,0.00072408805,0.0007125299,0.0021274267,0.0008816377,0.0038756211,0.002157501,0.0014715475,0.0014767044],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013868102,0.0007499795,0.002472319,0.000429496,0.00008673831,0.00089906016,0.00029178304,0.70249206,0.016530473,0.055173,0.010949312,0.20853898],"study_design_scores_gemma":[0.00007217453,0.00013475108,0.00029746557,0.000014256004,0.000010785592,0.0002129551,0.000070685266,0.95651406,0.003723806,0.035461858,0.0034752083,0.000012055572],"about_ca_topic_score_codex":0.0018411664,"about_ca_topic_score_gemma":0.0018893534,"teacher_disagreement_score":0.009904262,"about_ca_system_score_codex":0.0008976335,"about_ca_system_score_gemma":0.00053980167,"threshold_uncertainty_score":0.03313309},"labels":[],"label_agreement":null},{"id":"W2295098206","doi":"","title":"Approximation Algorithms for a Triangle Enclosure Problem","year":2011,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Convex hull; Combinatorics; Approximation algorithm; Regular polygon; Mathematics; Triangle inequality; Enclosure; Set (abstract data type); Plane (geometry); Algorithm; Discrete mathematics; Computer science; Geometry","score_opus":0.08659723767557773,"score_gpt":0.26544009848704214,"score_spread":0.17884286081146442,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2295098206","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020913143,0.0008174566,0.9723165,0.0004345576,0.00006699382,0.000081156664,0.00019013188,0.0007332992,0.004446836],"genre_scores_gemma":[0.2511549,0.0010765645,0.74035716,0.00017030249,0.00015107892,0.00030087927,0.0014083387,0.0003542885,0.005026473],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99877554,0.00023561141,0.00008739041,0.00026152108,0.00040312458,0.00023673601],"domain_scores_gemma":[0.9974832,0.001602836,0.00020005491,0.00032379778,0.00025456102,0.00013562028],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012898768,0.001439631,0.0018526883,0.0012897581,0.0008271825,0.0018024619,0.0030768525,0.002130338,0.005944083],"category_scores_gemma":[0.0083288085,0.00079132937,0.0012940611,0.0028346505,0.0009305062,0.0033961136,0.0023900717,0.0021864832,0.0012087391],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045873667,0.0001859203,0.0014518654,0.00034242088,0.00009839889,0.00015535956,0.00038473686,0.73237824,0.002314,0.05742597,0.011885727,0.1929186],"study_design_scores_gemma":[0.000045236644,0.000024212553,0.00009625547,0.000014713918,0.0000119556025,0.00004721102,0.00003434629,0.9761496,0.00035378494,0.021647722,0.0015693124,0.0000056052945],"about_ca_topic_score_codex":0.0060635684,"about_ca_topic_score_gemma":0.00537371,"teacher_disagreement_score":0.0060635684,"about_ca_system_score_codex":0.0015728222,"about_ca_system_score_gemma":0.00096638495,"threshold_uncertainty_score":0.019884884},"labels":[],"label_agreement":null},{"id":"W2295337288","doi":"","title":"Weighted Region Problem in Arrangement of Lines","year":2013,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Shortest path problem; Hull; Bounded function; Combinatorics; Boundary (topology); Path (computing); Line segment; Mathematics; Line (geometry); Computer science; Geometry; Graph; Mathematical analysis","score_opus":0.027374131823302613,"score_gpt":0.2344320232530039,"score_spread":0.2070578914297013,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2295337288","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033777773,0.0003211203,0.9606655,0.00020382214,0.0000368877,0.0000926949,0.0003298307,0.00052788673,0.004044444],"genre_scores_gemma":[0.27294782,0.00070363877,0.7114088,0.00009378494,0.00006590551,0.00034898508,0.0016895463,0.00041909536,0.012322515],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99860114,0.00033550008,0.00009609223,0.00041986813,0.0003370428,0.00021036707],"domain_scores_gemma":[0.99846715,0.0006969918,0.00029545027,0.00023332376,0.0002010577,0.00010601101],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072544423,0.0009826898,0.0012679314,0.0010049643,0.0009576169,0.0014785265,0.0020415792,0.0015802092,0.009123257],"category_scores_gemma":[0.0042400425,0.00091976573,0.0009938973,0.0022063944,0.0009037606,0.005528641,0.0022918754,0.0014116847,0.0020967268],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00071145804,0.00017724917,0.0016422928,0.0006855252,0.00010547012,0.0010243335,0.0006050558,0.6401384,0.017713292,0.17184022,0.008081216,0.15727548],"study_design_scores_gemma":[0.00010652621,0.00033991158,0.0006315747,0.000076986915,0.000051826744,0.00082291407,0.00043021646,0.8073718,0.011605659,0.15074037,0.02775885,0.000063440624],"about_ca_topic_score_codex":0.0024341086,"about_ca_topic_score_gemma":0.0017907755,"teacher_disagreement_score":0.009123257,"about_ca_system_score_codex":0.00082984456,"about_ca_system_score_gemma":0.0006094054,"threshold_uncertainty_score":0.03052038},"labels":[],"label_agreement":null},{"id":"W2295704388","doi":"","title":"The Possible Hull of Imprecise Points","year":2011,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Convex hull; Hull; Polygon (computer graphics); Simple (philosophy); Simple polygon; Point (geometry); Mathematics; Regular polygon; Combinatorics; Set (abstract data type); Plane (geometry); Orthogonal convex hull; Mathematical optimization; Algorithm; Computer science; Geometry; Convex body; Engineering","score_opus":0.04666611281999775,"score_gpt":0.2427950566893644,"score_spread":0.19612894386936666,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2295704388","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051244076,0.00056937285,0.94087046,0.00041639907,0.000041314343,0.00006333401,0.0005097621,0.00020483538,0.0060804943],"genre_scores_gemma":[0.542295,0.0007838417,0.45161247,0.00007840963,0.000085674845,0.00018452,0.0014306662,0.00018051566,0.003348912],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9956151,0.0010369876,0.0002712936,0.0008354064,0.0019376649,0.00030343886],"domain_scores_gemma":[0.99544334,0.0026180218,0.00044547278,0.00084169774,0.00044226245,0.00020917135],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002546436,0.0010394095,0.0016229955,0.0021030027,0.0018719613,0.0050937417,0.0027048977,0.0018377029,0.0050052805],"category_scores_gemma":[0.014421687,0.0016686615,0.0023616585,0.0021796362,0.0037467375,0.008442233,0.0049054637,0.0025495794,0.00074648304],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00061975635,0.000073282754,0.004023694,0.0005142304,0.00016886108,0.0019808197,0.0014310759,0.69464296,0.004129633,0.20373744,0.0030377652,0.08564046],"study_design_scores_gemma":[0.000044034554,0.00011298094,0.0011738808,0.00024290227,0.000071585986,0.0006988586,0.0008949103,0.6836819,0.004553028,0.29906815,0.009371373,0.000086370266],"about_ca_topic_score_codex":0.0022803305,"about_ca_topic_score_gemma":0.0021826667,"teacher_disagreement_score":0.0050937417,"about_ca_system_score_codex":0.0009837272,"about_ca_system_score_gemma":0.00075979327,"threshold_uncertainty_score":0.016744316},"labels":[],"label_agreement":null},{"id":"W2296221246","doi":"","title":"The Approximability and Integrality Gap of Interval Stabbing and Independence Problems","year":2012,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Rectangle; Combinatorics; Interval (graph theory); Linear programming; Independence (probability theory); Approximation algorithm; Set (abstract data type); Discrete mathematics; Duality (order theory); Independent set; Upper and lower bounds; Plane (geometry); Duality gap; Mathematical optimization; Optimization problem; Graph; Computer science; Statistics; Mathematical analysis","score_opus":0.058811907638360375,"score_gpt":0.2680974723676161,"score_spread":0.20928556472925575,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2296221246","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33188218,0.0025731795,0.63639945,0.0024006253,0.000076409,0.00009339845,0.0004619312,0.00058244186,0.025530338],"genre_scores_gemma":[0.8829485,0.0015261677,0.10969681,0.00022554187,0.00019489448,0.00018824862,0.00069294916,0.00023669272,0.0042900937],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963812,0.0013160668,0.00014275017,0.0007011275,0.000809752,0.00064918626],"domain_scores_gemma":[0.96987593,0.02541185,0.0014364343,0.0016808056,0.00061388826,0.0009810945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0056626596,0.001446644,0.0020290203,0.0020005838,0.0013195983,0.0038333249,0.004294718,0.0018776354,0.0059107775],"category_scores_gemma":[0.0321937,0.0011277212,0.0019003177,0.003407538,0.0036658377,0.009562868,0.0036407004,0.0069489824,0.00047586384],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00088514644,0.00031532618,0.0033303401,0.00041011375,0.000106284904,0.00012703933,0.00073088025,0.3283249,0.0034308946,0.6130767,0.0027655251,0.046496816],"study_design_scores_gemma":[0.000051577805,0.00011226912,0.00090951775,0.0000631671,0.000048730726,0.00011743148,0.00018078211,0.6065101,0.0021084584,0.38843676,0.001435219,0.000025884916],"about_ca_topic_score_codex":0.0021589953,"about_ca_topic_score_gemma":0.0011768686,"teacher_disagreement_score":0.0059107775,"about_ca_system_score_codex":0.0036381085,"about_ca_system_score_gemma":0.0013449552,"threshold_uncertainty_score":0.0299474},"labels":[],"label_agreement":null},{"id":"W2395072164","doi":"","title":"Space-Efficient Algorithm for Computing a Centerpoint of a Point Set in R^2.","year":2014,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Set (abstract data type); Space (punctuation); Point (geometry); Algorithm; Mathematics; Geometry; Programming language","score_opus":0.023490783606116762,"score_gpt":0.26017690045934166,"score_spread":0.2366861168532249,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2395072164","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007732466,0.00021112718,0.9865144,0.0000946482,0.000055597895,0.00009995994,0.0002076578,0.0017146571,0.0033694955],"genre_scores_gemma":[0.08173862,0.00012403891,0.9123268,0.000056900226,0.000023434015,0.00025514682,0.00068755227,0.00026614068,0.004521281],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99951434,0.00006619957,0.00003085647,0.00007736238,0.00024873693,0.00006239869],"domain_scores_gemma":[0.9993718,0.0002111888,0.000031634314,0.000103094564,0.00024119669,0.000040997467],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005821907,0.0010208188,0.00096766656,0.0016656535,0.0007749951,0.0011364125,0.0019137694,0.0011521977,0.014119459],"category_scores_gemma":[0.0027343011,0.0004623353,0.00071498466,0.001653347,0.00064717274,0.0012535003,0.002893919,0.0012859005,0.005165817],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006083195,0.00025526065,0.0021956298,0.00038907502,0.00014311017,0.00029712566,0.0005365621,0.1268684,0.021251641,0.06662557,0.029921683,0.7509076],"study_design_scores_gemma":[0.00023363935,0.00017336577,0.0008513147,0.000043317516,0.000041926916,0.00029293456,0.000249325,0.91899836,0.0116217695,0.046782654,0.02066672,0.0000446661],"about_ca_topic_score_codex":0.0051932293,"about_ca_topic_score_gemma":0.010529131,"teacher_disagreement_score":0.014119459,"about_ca_system_score_codex":0.00064566464,"about_ca_system_score_gemma":0.0016890495,"threshold_uncertainty_score":0.047234237},"labels":[],"label_agreement":null},{"id":"W2395375684","doi":"","title":"Basis Enumeration of Hyperplane Arrangements Up to Symmetries.","year":2012,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Polyhedron; Hyperplane; Invariant (physics); Symmetry group; Enumeration; Homogeneous space; Symmetry (geometry); Basis (linear algebra); Speedup; Group (periodic table); Mathematics; Computer science; Algebra over a field; Combinatorics; Pure mathematics; Parallel computing; Physics; Geometry","score_opus":0.08859729421388006,"score_gpt":0.33250410585268897,"score_spread":0.2439068116388089,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2395375684","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10720871,0.00020463685,0.86335266,0.00015121157,0.00008895951,0.00032657833,0.0016581885,0.003991331,0.02301775],"genre_scores_gemma":[0.31732816,0.00014862692,0.6689087,0.000056101562,0.000028140073,0.00020301896,0.0053995927,0.0004569962,0.0074706245],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999474,0.00011160861,0.000031547585,0.00006714848,0.00018756582,0.0001281729],"domain_scores_gemma":[0.9992483,0.0002027015,0.000063687,0.0002605821,0.00017138044,0.000053230346],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004139387,0.00058300333,0.00072342454,0.0010311366,0.00064209994,0.0011399172,0.00078099984,0.00037120012,0.012531094],"category_scores_gemma":[0.0021730412,0.00031392486,0.0008563106,0.0011501581,0.0005476066,0.001695139,0.0017457944,0.00088743796,0.0035379333],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006605365,0.00030592253,0.0041239443,0.000941449,0.00006549712,0.00026365553,0.0005910402,0.057477992,0.034983642,0.11332444,0.020819195,0.7664427],"study_design_scores_gemma":[0.00016663756,0.0004959538,0.0020797462,0.00014832322,0.00005076743,0.00054521504,0.0011035104,0.53841394,0.07358138,0.35466337,0.028680716,0.00007039057],"about_ca_topic_score_codex":0.0011238846,"about_ca_topic_score_gemma":0.0030171762,"teacher_disagreement_score":0.012531094,"about_ca_system_score_codex":0.00036158506,"about_ca_system_score_gemma":0.000820855,"threshold_uncertainty_score":0.04192072},"labels":[],"label_agreement":null},{"id":"W2395902960","doi":"","title":"Minimum many-to-many matchings for computing the distance between two sequences","year":2011,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Combinatorics; Theoretical computer science; Mathematics","score_opus":0.03947693002219832,"score_gpt":0.2458477516972585,"score_spread":0.20637082167506018,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2395902960","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1092655,0.0009782006,0.8812673,0.00071555754,0.00014847555,0.00026140435,0.0017019064,0.0019490488,0.003712618],"genre_scores_gemma":[0.41071773,0.00046958323,0.5800552,0.00024125967,0.00014857356,0.0003978847,0.0038252014,0.00036285678,0.0037816912],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99678254,0.0006367867,0.00034506503,0.0010158418,0.0009052376,0.00031455958],"domain_scores_gemma":[0.99313545,0.004036583,0.0005709297,0.0012633211,0.0006400552,0.00035374638],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022537413,0.0014405127,0.0031814429,0.0053472873,0.001994052,0.0030325814,0.0041603176,0.0033816274,0.006842471],"category_scores_gemma":[0.020098343,0.00095566595,0.0017542145,0.005852415,0.0018708176,0.007867646,0.003845701,0.0027364541,0.0020967207],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0024841395,0.0007710834,0.006151683,0.0010742532,0.0003332758,0.0002306858,0.00081848423,0.28484935,0.014083231,0.18561374,0.014888278,0.48870182],"study_design_scores_gemma":[0.00012243881,0.00024202531,0.00081919687,0.00006885273,0.000068746434,0.00021758371,0.0002062695,0.7097119,0.0041124295,0.28184855,0.0025277731,0.000054212804],"about_ca_topic_score_codex":0.002754346,"about_ca_topic_score_gemma":0.0046337103,"teacher_disagreement_score":0.006842471,"about_ca_system_score_codex":0.0021287845,"about_ca_system_score_gemma":0.0018978168,"threshold_uncertainty_score":0.02289033},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Computer science; 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","score_opus":0.10867846574142782,"score_gpt":0.30237502488695656,"score_spread":0.19369655914552875,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397167913","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0238511,0.0011630518,0.9509312,0.0012444676,0.00018578045,0.00035869385,0.0039630234,0.012945118,0.005357539],"genre_scores_gemma":[0.30876285,0.0006900268,0.66779864,0.0009402459,0.00025230722,0.0007648477,0.0113315955,0.0010359014,0.008423554],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997912,0.00032268083,0.00032712563,0.00033593105,0.00086856785,0.00023376316],"domain_scores_gemma":[0.992516,0.0017434941,0.0006873271,0.0035991822,0.0010477974,0.0004062234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017133296,0.00056763156,0.00090894726,0.0015069384,0.0015090219,0.0023276971,0.0028228061,0.0014178386,0.008159563],"category_scores_gemma":[0.010236357,0.0006350151,0.0006720373,0.003248558,0.0012546417,0.006274075,0.006321663,0.0016471698,0.0035156305],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002506628,0.000519201,0.011358196,0.0009223023,0.0001618809,0.0007449227,0.0016618456,0.044542022,0.039539598,0.16397563,0.10673053,0.62733734],"study_design_scores_gemma":[0.00069691695,0.001315571,0.0033661886,0.00023716179,0.00014345272,0.0025814583,0.001015241,0.45546362,0.06185688,0.15062813,0.32240185,0.00029340308],"about_ca_topic_score_codex":0.0036138457,"about_ca_topic_score_gemma":0.0034596159,"teacher_disagreement_score":0.008159563,"about_ca_system_score_codex":0.0008334638,"about_ca_system_score_gemma":0.0016793495,"threshold_uncertainty_score":0.027296424},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.04467829215851175,"score_gpt":0.25425152611678137,"score_spread":0.20957323395826963,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398258650","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042016707,0.001428601,0.94708496,0.00031991498,0.00035436818,0.0002610978,0.0019357534,0.0030921572,0.003506432],"genre_scores_gemma":[0.3009835,0.00094353507,0.68552876,0.00020880952,0.00021248223,0.00036267054,0.003976847,0.00033978958,0.007443664],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982205,0.00020146726,0.00018797736,0.00060329726,0.00063577184,0.00015086756],"domain_scores_gemma":[0.9970407,0.00062966364,0.00036924414,0.0012521078,0.0005191394,0.00018907103],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080294313,0.0010466365,0.0019178286,0.002853713,0.0010292081,0.0015582629,0.0032585678,0.0011621868,0.008113219],"category_scores_gemma":[0.008794039,0.0007311281,0.0006798548,0.0050206855,0.0007330928,0.00491389,0.0041448404,0.0012444473,0.004478222],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0026158483,0.00047876648,0.0040161363,0.0006486384,0.00019163676,0.00057000614,0.0007223298,0.13836117,0.02632535,0.05249997,0.032189395,0.7413808],"study_design_scores_gemma":[0.00024468635,0.00077951467,0.0011223492,0.00010169876,0.0000753543,0.0013443563,0.00049002655,0.82145137,0.03791596,0.092809126,0.043538883,0.00012663133],"about_ca_topic_score_codex":0.0017417447,"about_ca_topic_score_gemma":0.0023989803,"teacher_disagreement_score":0.008113219,"about_ca_system_score_codex":0.0007244046,"about_ca_system_score_gemma":0.0011562967,"threshold_uncertainty_score":0.027141392},"labels":[],"label_agreement":null},{"id":"W2400087804","doi":"","title":"Range Counting with Distinct Constraints.","year":2015,"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Range (aeronautics); Range query (database); Computer science; Counting problem; Point (geometry); Data structure; Combinatorics; Mathematics; Algorithm; Sargable; Information retrieval; Search engine; Web search query; Geometry","score_opus":0.04844032645569903,"score_gpt":0.24745062627455283,"score_spread":0.1990102998188538,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400087804","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07177078,0.001855813,0.9096175,0.0016003533,0.00026773615,0.0004226182,0.0018832034,0.0026586181,0.009923419],"genre_scores_gemma":[0.47953933,0.001169214,0.50631666,0.0012853638,0.0005269925,0.00060649816,0.0036968288,0.0007025592,0.006156427],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98325896,0.003373885,0.0020555528,0.0034447396,0.0063859345,0.0014808782],"domain_scores_gemma":[0.9519247,0.02366216,0.003951311,0.016861193,0.0025700307,0.0010306269],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0056159366,0.001239257,0.002333629,0.0018114564,0.0016879241,0.005909192,0.00471154,0.0023646308,0.00618138],"category_scores_gemma":[0.038377948,0.0008106963,0.001517429,0.0062990705,0.0031782386,0.020171583,0.0074088504,0.0031510617,0.0016138424],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015365387,0.0005854495,0.01374869,0.0014956736,0.0002763211,0.001989273,0.0017550801,0.05253216,0.025321785,0.50074893,0.024341188,0.37566888],"study_design_scores_gemma":[0.00022355455,0.0007073936,0.0022257695,0.0002217757,0.00021064733,0.005461538,0.00184776,0.38881877,0.037047513,0.466068,0.09690422,0.00026303934],"about_ca_topic_score_codex":0.0022431486,"about_ca_topic_score_gemma":0.0017274858,"teacher_disagreement_score":0.00618138,"about_ca_system_score_codex":0.0010985385,"about_ca_system_score_gemma":0.0018578803,"threshold_uncertainty_score":0.02970028},"labels":[],"label_agreement":null},{"id":"W2400285273","doi":"","title":"Point Location in Well-Shaped Meshes Using Jump-and-Walk","year":2011,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Jump; Polygon mesh; Constant (computer programming); Point (geometry); Computer science; Nearest neighbour; Random walk; Algorithm; Statistical physics; Mathematics; Geometry; Physics; Artificial intelligence; Computer graphics (images); Statistics","score_opus":0.0670509323113462,"score_gpt":0.2543895345018169,"score_spread":0.1873386021904707,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400285273","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1589621,0.0004479261,0.8278606,0.0003153415,0.00006050855,0.00016533516,0.0002566766,0.0072406563,0.0046908823],"genre_scores_gemma":[0.67396796,0.00020981014,0.32230142,0.00008385298,0.000022916127,0.00012572826,0.000683152,0.00053231517,0.0020727494],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997189,0.00065954204,0.0001939207,0.00040030474,0.0012162876,0.00034099576],"domain_scores_gemma":[0.9918303,0.0049374197,0.00043018223,0.001780495,0.0006464116,0.0003753056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001579579,0.0011308915,0.0012598387,0.0006255693,0.0007244018,0.0016479172,0.0028363143,0.0019383186,0.0034510694],"category_scores_gemma":[0.0109786345,0.00048847345,0.000780073,0.0014334257,0.0016781641,0.005076941,0.0032374046,0.0011938564,0.0009831121],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0036215738,0.0004914441,0.006510216,0.0006136332,0.00023116493,0.00078540214,0.0011348054,0.63005686,0.06894685,0.055146486,0.0075894766,0.2248721],"study_design_scores_gemma":[0.00006553928,0.00011157488,0.00020656714,0.0000076658225,0.000015480397,0.0000618743,0.0000825953,0.9758251,0.009135896,0.013522687,0.00094645564,0.000018592567],"about_ca_topic_score_codex":0.0053731366,"about_ca_topic_score_gemma":0.0063867564,"teacher_disagreement_score":0.0053731366,"about_ca_system_score_codex":0.00092690624,"about_ca_system_score_gemma":0.00090630364,"threshold_uncertainty_score":0.011545002},"labels":[],"label_agreement":null},{"id":"W2400709422","doi":"","title":"On the Inverse Beacon Attraction Region of a Point.","year":2015,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Attraction; Polygon (computer graphics); Monotone polygon; Simple polygon; Inverse; Trajectory; Boundary (topology); Obstacle; Mathematics; Regular polygon; Simple (philosophy); Point (geometry); Set (abstract data type); Combinatorics; Computer science; Topology (electrical circuits); Mathematical analysis; Physics; Geometry; Geography; Telecommunications","score_opus":0.0822544231741283,"score_gpt":0.26077276814147504,"score_spread":0.17851834496734675,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400709422","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018871475,0.00059088576,0.976181,0.00006770117,0.000032206135,0.00006337136,0.000098357246,0.00037476083,0.0037203915],"genre_scores_gemma":[0.40393707,0.0009316807,0.5901391,0.00010430971,0.000093861956,0.00023219662,0.00048826847,0.0003015407,0.0037719146],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995629,0.00010676435,0.00001585558,0.000094299845,0.00017142507,0.000048636528],"domain_scores_gemma":[0.99858814,0.0009458391,0.000105109815,0.00013942235,0.0001659898,0.000055504253],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008386081,0.0006575258,0.00075697654,0.0015017027,0.00047650773,0.0009778612,0.0011383102,0.0005768962,0.0031192685],"category_scores_gemma":[0.0057431194,0.0004005299,0.00084540615,0.0010628985,0.0015527621,0.0020024688,0.0021263508,0.0012670296,0.0010631912],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00051273155,0.00006708349,0.002999021,0.00032928473,0.000052941996,0.0004366332,0.0005778652,0.57982564,0.013428872,0.24241123,0.005112845,0.15424584],"study_design_scores_gemma":[0.000037991784,0.00012747671,0.000740271,0.00006122317,0.000022458376,0.000306289,0.00006652509,0.9060227,0.0054961196,0.07491429,0.012173126,0.000031596028],"about_ca_topic_score_codex":0.002916876,"about_ca_topic_score_gemma":0.0017601531,"teacher_disagreement_score":0.0031192685,"about_ca_system_score_codex":0.00057601766,"about_ca_system_score_gemma":0.00049720635,"threshold_uncertainty_score":0.010434985},"labels":[],"label_agreement":null},{"id":"W2400822338","doi":"","title":"Reconfiguring a Chain of Cubes.","year":2015,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Modular Robots and Swarm Intelligence","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; University of Manitoba; University of Waterloo","funders":"","keywords":"Chain (unit); Computer science; Physics","score_opus":0.05981796194493664,"score_gpt":0.2391147477118028,"score_spread":0.17929678576686617,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400822338","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17902257,0.0009867446,0.7670627,0.0009355462,0.0006678034,0.00020409853,0.0005352149,0.0017780826,0.04880727],"genre_scores_gemma":[0.6976727,0.00058892433,0.28337604,0.00022243659,0.00005524837,0.0001644232,0.0006425864,0.0002488822,0.01702879],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99977595,0.0000471349,0.000013739845,0.00006449112,0.00005417625,0.00004447492],"domain_scores_gemma":[0.99948955,0.00010114293,0.000059396967,0.0001804724,0.000075333395,0.00009400623],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025498867,0.0005034891,0.0004439028,0.0005671705,0.00096653594,0.0007966229,0.0010069563,0.0006383108,0.009732546],"category_scores_gemma":[0.0013127113,0.0004811032,0.00052869023,0.00055265194,0.0009162364,0.0017831128,0.0026420911,0.0009014652,0.001966727],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00092495116,0.00022461315,0.0042569996,0.00033484213,0.00016923164,0.0012426167,0.00086062425,0.42310038,0.08597895,0.1402992,0.021724185,0.32088345],"study_design_scores_gemma":[0.00009705464,0.0005076916,0.0011094161,0.00009375243,0.00006477008,0.0005776027,0.0005920075,0.7901723,0.026834972,0.13319924,0.046688,0.0000632707],"about_ca_topic_score_codex":0.00208962,"about_ca_topic_score_gemma":0.0028195665,"teacher_disagreement_score":0.009732546,"about_ca_system_score_codex":0.00038917587,"about_ca_system_score_gemma":0.0005327701,"threshold_uncertainty_score":0.03255862},"labels":[],"label_agreement":null},{"id":"W2402228242","doi":"","title":"Drawing Plane Triangulations with Few Segments, pp. 40-45.","year":2014,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Mathematics Education and Teaching Techniques","field":"Social Sciences","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Computer science; Plane (geometry); Combinatorics; Geometry; Computer graphics (images); Artificial intelligence; Mathematics","score_opus":0.041766119435305275,"score_gpt":0.3143262654433295,"score_spread":0.2725601460080242,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402228242","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007937675,0.006233063,0.95775247,0.00078591163,0.0009679783,0.00016149705,0.0010345223,0.0036727218,0.02145423],"genre_scores_gemma":[0.061160825,0.0046375687,0.9068644,0.00021142812,0.0002844089,0.00017463602,0.0023761862,0.0025471807,0.021743333],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991279,0.00018981408,0.00010124604,0.00020507966,0.00032120003,0.0000547528],"domain_scores_gemma":[0.9986828,0.0005760899,0.0000488141,0.00030331992,0.0003308919,0.00005814851],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090368435,0.0012768899,0.0011463996,0.0021738529,0.0011939991,0.0021547363,0.0017244335,0.0010659649,0.034234997],"category_scores_gemma":[0.0050073424,0.0022660345,0.0013839812,0.0031657368,0.0017313788,0.0049482887,0.0016611494,0.0021068808,0.010581107],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00049676205,0.00016017929,0.0019157638,0.001074699,0.00017103847,0.00034743355,0.0008584519,0.04806441,0.025306335,0.06510394,0.14465462,0.71184635],"study_design_scores_gemma":[0.00014995062,0.00021208267,0.0036200394,0.0005919079,0.00020218763,0.0014521992,0.0013312163,0.3055303,0.026856972,0.24140356,0.41848797,0.00016157758],"about_ca_topic_score_codex":0.008944627,"about_ca_topic_score_gemma":0.030897168,"teacher_disagreement_score":0.034234997,"about_ca_system_score_codex":0.00093924336,"about_ca_system_score_gemma":0.00091994886,"threshold_uncertainty_score":0.114527464},"labels":[],"label_agreement":null},{"id":"W2402614570","doi":"","title":"Open Problems from CCCG 2014.","year":2015,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"University of Victoria","funders":"","keywords":"Combinatorics; Vertex (graph theory); Upper and lower bounds; Conjecture; Discrete geometry; Mathematics; Partition (number theory); Computer science; Discrete mathematics; Graph","score_opus":0.0928333167172997,"score_gpt":0.28590306801585375,"score_spread":0.19306975129855403,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402614570","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008076159,0.023833493,0.17827235,0.052456092,0.020233262,0.00072105235,0.032939274,0.008075943,0.6753923],"genre_scores_gemma":[0.12550162,0.032664943,0.15825768,0.021230549,0.018442914,0.0031114167,0.15279077,0.012298271,0.4757019],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9936964,0.0010722359,0.00031196003,0.0010268936,0.0032092007,0.00068325415],"domain_scores_gemma":[0.99497545,0.0019980303,0.00019552848,0.0009771009,0.0011905076,0.00066345447],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003737538,0.002131078,0.00256358,0.0029198313,0.0036774345,0.0073968004,0.0031927882,0.0038036448,0.15511069],"category_scores_gemma":[0.01313621,0.0010390423,0.0021674526,0.005676135,0.0019061937,0.006659083,0.0068768337,0.007964172,0.052011818],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013279334,0.000102044345,0.0003614651,0.00060688,0.000049127917,0.000114893366,0.00015954103,0.0036933455,0.0003178858,0.18640941,0.71631664,0.09173599],"study_design_scores_gemma":[0.00006618729,0.000034578887,0.00048667783,0.00033683216,0.00001902598,0.00017785202,0.0001300991,0.0046565426,0.00039451572,0.24820273,0.7454524,0.000042546184],"about_ca_topic_score_codex":0.009704736,"about_ca_topic_score_gemma":0.008718375,"teacher_disagreement_score":0.15511069,"about_ca_system_score_codex":0.006836266,"about_ca_system_score_gemma":0.0054280865,"threshold_uncertainty_score":0.51889694},"labels":[],"label_agreement":null},{"id":"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science","score_opus":0.11160446627365601,"score_gpt":0.28406016141787976,"score_spread":0.17245569514422376,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402872817","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09893411,0.004739914,0.34026712,0.08001639,0.004012772,0.0019749098,0.039804157,0.00800692,0.42224368],"genre_scores_gemma":[0.5107661,0.0045236065,0.23882277,0.010158813,0.002385837,0.0017236233,0.035868168,0.0036571706,0.19209388],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961927,0.00067307183,0.00028251158,0.0010949317,0.0009200354,0.00083678996],"domain_scores_gemma":[0.9809347,0.014695661,0.0006587344,0.00147885,0.0014864827,0.00074556837],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021556027,0.0018236248,0.003347379,0.0018058531,0.0058530453,0.009936414,0.0033822418,0.0051113935,0.06617689],"category_scores_gemma":[0.015269157,0.0017226983,0.0055606174,0.0037483328,0.0047070095,0.01813896,0.004145612,0.008532544,0.009520332],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007959447,0.0006255669,0.0017302562,0.002866534,0.00042181718,0.0013327176,0.0005909386,0.030550515,0.003123048,0.5319181,0.29463714,0.13140741],"study_design_scores_gemma":[0.00019496727,0.000044051572,0.00047439142,0.000139943,0.000110898465,0.0005413831,0.00043867508,0.024238698,0.0017450198,0.9238668,0.048155315,0.000049831546],"about_ca_topic_score_codex":0.0132041825,"about_ca_topic_score_gemma":0.022340972,"teacher_disagreement_score":0.06617689,"about_ca_system_score_codex":0.0038883882,"about_ca_system_score_gemma":0.005938622,"threshold_uncertainty_score":0.22138375},"labels":[],"label_agreement":null},{"id":"W2403354906","doi":"","title":"A Fault Tolerant Data Structure for Peer-to-Peer Range Query Processing","year":2015,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Computer science; Range query (database); Hash table; Hash function; Distributed hash table; Redundancy (engineering); Data structure; Fault tolerance; Query optimization; Theoretical computer science; Peer-to-peer; Distributed computing; Data mining; Web search query; Search engine; Sargable; Information retrieval","score_opus":0.11166072722308411,"score_gpt":0.3223953343659361,"score_spread":0.21073460714285197,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403354906","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010959884,0.0007951923,0.9805022,0.0004742205,0.00021035984,0.00031882626,0.0010665088,0.003941944,0.0017309546],"genre_scores_gemma":[0.22574948,0.0009660774,0.7610428,0.0003567396,0.00028080892,0.0006981476,0.0051356223,0.0003939175,0.005376469],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99743015,0.00032085276,0.00043429222,0.000353902,0.0012775946,0.0001832236],"domain_scores_gemma":[0.99433196,0.0009313441,0.000563208,0.0029520434,0.000914913,0.00030648962],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021595478,0.0005886066,0.0015356469,0.0022173505,0.0021388198,0.00263241,0.0043564714,0.0014934721,0.0033189561],"category_scores_gemma":[0.0070072687,0.0008923443,0.00079118385,0.0035512298,0.0014624638,0.005930108,0.004415195,0.0018145916,0.0020293032],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012047571,0.00043765898,0.0049068145,0.0013361764,0.00020283808,0.00077763794,0.001008423,0.09020073,0.044803128,0.17486195,0.038458854,0.6418011],"study_design_scores_gemma":[0.00045327554,0.0016574928,0.0026235878,0.00018845235,0.00023119609,0.0030352355,0.0006022492,0.50904495,0.074723914,0.17179346,0.23522699,0.00041925453],"about_ca_topic_score_codex":0.0013715494,"about_ca_topic_score_gemma":0.0011356074,"teacher_disagreement_score":0.0043564714,"about_ca_system_score_codex":0.0012947725,"about_ca_system_score_gemma":0.0014839711,"threshold_uncertainty_score":0.011420906},"labels":[],"label_agreement":null},{"id":"W2404357874","doi":"","title":"A Faster 4-Approximation Algorithm for the Unit Disk Cover Problem","year":2015,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; Carleton University","funders":"","keywords":"Approximation algorithm; Set cover problem; Cover (algebra); Plane (geometry); Simple (philosophy); Set (abstract data type); Unit (ring theory); Unit disk; Unit disk graph; Algorithm; Computer science; Computational geometry; Running time; Mathematics; Combinatorics; Mathematical optimization; Geometry","score_opus":0.0630496311394427,"score_gpt":0.27244246840386455,"score_spread":0.20939283726442184,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404357874","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.066678904,0.0021862658,0.90472543,0.0015065034,0.00042630054,0.00048775136,0.0008698256,0.0071648364,0.015954144],"genre_scores_gemma":[0.14960733,0.00054247666,0.8400101,0.0004753732,0.00018295173,0.00054350606,0.002549712,0.0005663045,0.0055222856],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99847275,0.00022840555,0.00010441593,0.00037596512,0.00048072755,0.0003377359],"domain_scores_gemma":[0.9982273,0.00078502565,0.00015174359,0.00047637965,0.0002255933,0.00013391364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010365556,0.0021420575,0.0023635174,0.0017682962,0.0011760993,0.0023967242,0.0034588792,0.0027310278,0.015537431],"category_scores_gemma":[0.004598196,0.00077636953,0.0017752816,0.0035497537,0.0007013692,0.004861485,0.002734842,0.0024939885,0.004199613],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001687987,0.00080854446,0.001929464,0.00062114303,0.00022266677,0.00035319387,0.00045734507,0.27411607,0.01622828,0.03357184,0.042911895,0.6270916],"study_design_scores_gemma":[0.0005065445,0.00019978595,0.00056326727,0.000043497344,0.000059747053,0.0003458213,0.00014290087,0.9379404,0.004239595,0.041819446,0.014093955,0.00004504202],"about_ca_topic_score_codex":0.0060312147,"about_ca_topic_score_gemma":0.0068429806,"teacher_disagreement_score":0.015537431,"about_ca_system_score_codex":0.002330148,"about_ca_system_score_gemma":0.0025172841,"threshold_uncertainty_score":0.051977932},"labels":[],"label_agreement":null},{"id":"W2404508046","doi":"","title":"xy-Monotone Path Existence Queries in a Rectilinear Environment.","year":2012,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Tree traversal; Monotone polygon; Disjoint sets; Path (computing); Tree (set theory); Combinatorics; Computer science; Time complexity; Range tree; Binary logarithm; Data structure; Preprocessor; Computational geometry; Binary tree; Mathematics; Discrete mathematics; Interval tree; Algorithm; Tree structure; Artificial intelligence","score_opus":0.03309736335871667,"score_gpt":0.24524503912596776,"score_spread":0.21214767576725108,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404508046","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2899553,0.0018937894,0.6595845,0.0031616527,0.00016477433,0.0008121,0.013209184,0.013550286,0.017668447],"genre_scores_gemma":[0.5033297,0.00080142333,0.47336832,0.00035617544,0.000072791736,0.00034202493,0.013430453,0.00058100943,0.0077182096],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99871767,0.00021099702,0.00010112478,0.00039459905,0.00027561514,0.00030002283],"domain_scores_gemma":[0.9970094,0.001992203,0.00028379515,0.00042519526,0.00016925363,0.00012007271],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069257733,0.0007254895,0.00111918,0.00068035105,0.0010421169,0.001247536,0.001321386,0.0016984167,0.010294018],"category_scores_gemma":[0.0044899574,0.0007118816,0.00084091263,0.0017839695,0.0007418642,0.0058570527,0.0026515976,0.0009432624,0.0019853702],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.006370632,0.0012419637,0.015675884,0.0026786535,0.00022047655,0.0032978526,0.002031877,0.16701955,0.11085604,0.12286417,0.08692378,0.4808192],"study_design_scores_gemma":[0.0010067067,0.0017042463,0.0057975,0.00018924371,0.00016376429,0.002958252,0.0030253076,0.66413325,0.07707133,0.17357478,0.07019096,0.00018466536],"about_ca_topic_score_codex":0.0027851611,"about_ca_topic_score_gemma":0.0055472176,"teacher_disagreement_score":0.010294018,"about_ca_system_score_codex":0.00052446907,"about_ca_system_score_gemma":0.0010622542,"threshold_uncertainty_score":0.03443694},"labels":[],"label_agreement":null},{"id":"W2406062735","doi":"","title":"Edge Guards for Polyhedra in 3-Space.","year":2012,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Polyhedron; Enhanced Data Rates for GSM Evolution; Computer science; Space (punctuation); Combinatorics; Mathematics; Artificial intelligence; Operating system","score_opus":0.040380205080123924,"score_gpt":0.27861341975674936,"score_spread":0.23823321467662545,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406062735","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02079854,0.0006282579,0.95962733,0.00019517636,0.0002968224,0.000109712906,0.001109249,0.004179357,0.013055478],"genre_scores_gemma":[0.28916073,0.0007366413,0.68892395,0.00022073669,0.000105512605,0.00022597086,0.0031596685,0.0019850857,0.015481784],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996045,0.000059367212,0.000034733435,0.000053543194,0.00017803228,0.00006991166],"domain_scores_gemma":[0.9992545,0.00025777682,0.000047466136,0.0002277549,0.00015251913,0.000060051134],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048172203,0.0005114636,0.0006546938,0.00070909545,0.0006825455,0.0011562598,0.0013240712,0.00065631873,0.014487517],"category_scores_gemma":[0.0025791312,0.00041858334,0.00062382844,0.0007723067,0.0010191746,0.0015783552,0.0025521175,0.0016665523,0.004316235],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00073521025,0.00013949018,0.0013650381,0.0004936724,0.000027557899,0.00026659656,0.00048981607,0.0463826,0.010502358,0.4631235,0.037504755,0.43896925],"study_design_scores_gemma":[0.00015231437,0.00021608264,0.0007697173,0.00031310247,0.000037570164,0.00043482083,0.00044553366,0.31064698,0.019702584,0.51485276,0.15237443,0.000054039676],"about_ca_topic_score_codex":0.0021552683,"about_ca_topic_score_gemma":0.00429889,"teacher_disagreement_score":0.014487517,"about_ca_system_score_codex":0.00034248814,"about_ca_system_score_gemma":0.00068873505,"threshold_uncertainty_score":0.04846555},"labels":[],"label_agreement":null},{"id":"W2406237833","doi":"","title":"Cuttings in 2D Revisited.","year":2014,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Subdivision; Cutting; Computer science; Construct (python library); Simple (philosophy); Plane (geometry); Combinatorics; Deterministic algorithm; Algorithm; Mathematics; Theoretical computer science; Programming language; Engineering; Geometry; Botany","score_opus":0.019307233064556575,"score_gpt":0.2428241013642129,"score_spread":0.22351686829965633,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406237833","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00915919,0.020049786,0.90104383,0.004065007,0.0020167357,0.00014084032,0.00079318194,0.0013022526,0.061429225],"genre_scores_gemma":[0.1511633,0.014233455,0.7854655,0.0022838472,0.0010861933,0.00038165846,0.0016216703,0.0008028829,0.04296154],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99871075,0.0002596047,0.000078964054,0.00033470595,0.0004832432,0.00013279065],"domain_scores_gemma":[0.99920326,0.0003974254,0.00006452152,0.00020861597,0.00008137824,0.000044748063],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009079882,0.0010841747,0.000868876,0.0012397517,0.0014279928,0.0033132634,0.0014822086,0.0019013145,0.014801782],"category_scores_gemma":[0.0034361815,0.0011121957,0.0014575322,0.0027549812,0.0023979978,0.0044604666,0.00281969,0.0039098584,0.004884207],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009588657,0.000030634357,0.00041991155,0.00046726593,0.000025439489,0.00014284236,0.00031171564,0.024931332,0.0023802544,0.75969017,0.028786112,0.18271853],"study_design_scores_gemma":[0.000045063098,0.000065580425,0.00048038893,0.00020403098,0.000022547252,0.00079232996,0.00018352257,0.05824029,0.0032443376,0.6805488,0.2561171,0.000056170145],"about_ca_topic_score_codex":0.003339339,"about_ca_topic_score_gemma":0.0056576035,"teacher_disagreement_score":0.014801782,"about_ca_system_score_codex":0.0021295222,"about_ca_system_score_gemma":0.0011286271,"threshold_uncertainty_score":0.049516857},"labels":[],"label_agreement":null},{"id":"W2406692538","doi":"","title":"One of Ferran Hurtado's favorite topics - Flips.","year":2015,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Point (geometry); World Wide Web; Information retrieval; Mathematics; Geometry","score_opus":0.10719563354728603,"score_gpt":0.3121231820828642,"score_spread":0.20492754853557818,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406692538","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046819866,0.06953243,0.45297307,0.08545094,0.019682493,0.0004153817,0.0008907585,0.0023258522,0.3219092],"genre_scores_gemma":[0.5155037,0.040993735,0.21247108,0.019733086,0.011352986,0.00043999584,0.0012739754,0.0018121006,0.19641936],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989581,0.00029577434,0.000024434614,0.00033128122,0.00027929313,0.0001111035],"domain_scores_gemma":[0.9975077,0.0014213892,0.00010011223,0.00031845228,0.00035704952,0.00029522632],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015297738,0.0010025139,0.000949926,0.001022622,0.0018208607,0.0020525788,0.0010395853,0.002261029,0.012490375],"category_scores_gemma":[0.006406968,0.0005242939,0.0009344514,0.0009677242,0.0022149454,0.0047248206,0.0021580698,0.0044017113,0.0041566896],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022420973,0.00011944737,0.0010885816,0.00047740559,0.00007346563,0.00022871506,0.00037897454,0.005050527,0.0054560704,0.6486766,0.13687804,0.20134793],"study_design_scores_gemma":[0.000056893405,0.00023277474,0.0010630309,0.00032858097,0.00005881337,0.0007627979,0.00039344977,0.009524594,0.009600397,0.47238398,0.5054601,0.0001346738],"about_ca_topic_score_codex":0.0029348931,"about_ca_topic_score_gemma":0.0032959918,"teacher_disagreement_score":0.012490375,"about_ca_system_score_codex":0.0023871094,"about_ca_system_score_gemma":0.0009060247,"threshold_uncertainty_score":0.041784406},"labels":[],"label_agreement":null},{"id":"W2407224220","doi":"","title":"An Algorithm for the Maximum Weight Independent Set Problem onOutersting Graphs.","year":2015,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Maximal independent set; Computer science; Independent set; Algorithm; Set (abstract data type); Theoretical computer science; Chordal graph; Graph; 1-planar graph","score_opus":0.055230565297083936,"score_gpt":0.2744272080274784,"score_spread":0.21919664273039446,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407224220","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01723709,0.0007955415,0.9572601,0.0011211697,0.0003367698,0.0008085914,0.0013608825,0.004693198,0.016386645],"genre_scores_gemma":[0.0730256,0.00046426314,0.9115185,0.00027484942,0.00017776508,0.0007381109,0.0035202592,0.00061483844,0.009665778],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99844307,0.00035055078,0.00012952765,0.00035946976,0.00044974752,0.0002676976],"domain_scores_gemma":[0.9966413,0.0015655212,0.00018302404,0.0008400066,0.00051045563,0.00025988114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016414236,0.002408419,0.0019118339,0.0026749198,0.001981714,0.002885225,0.0055019376,0.0026209336,0.020583445],"category_scores_gemma":[0.0076606893,0.0011494637,0.0020272532,0.004710974,0.0010246397,0.0060618785,0.00541803,0.0031710437,0.004762047],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008419414,0.0011173681,0.001775045,0.0010167579,0.00022700733,0.00034454884,0.00047271574,0.10447997,0.006741916,0.08442977,0.06359772,0.73495525],"study_design_scores_gemma":[0.00065862347,0.0002976094,0.0011200802,0.0001464148,0.00017359684,0.0004985436,0.00029038623,0.6683125,0.0062325294,0.29690942,0.025283864,0.00007648791],"about_ca_topic_score_codex":0.004909737,"about_ca_topic_score_gemma":0.0098418,"teacher_disagreement_score":0.020583445,"about_ca_system_score_codex":0.0021492601,"about_ca_system_score_gemma":0.0037931092,"threshold_uncertainty_score":0.068858504},"labels":[],"label_agreement":null},{"id":"W2407655771","doi":"","title":"Kinetic Data Structures on The Move.","year":2013,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Advanced Database Systems and Queries","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Kinetic energy; Computer science; Physics; Classical mechanics","score_opus":0.05671062729089524,"score_gpt":0.2630991015320934,"score_spread":0.2063884742411982,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407655771","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016714612,0.01134273,0.7675817,0.015935656,0.0053050104,0.000335098,0.021054277,0.026556214,0.13517472],"genre_scores_gemma":[0.35284325,0.012184786,0.36682168,0.0047672903,0.0024842345,0.0008255128,0.040076282,0.008955782,0.21104118],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99685365,0.00052656257,0.00046551393,0.0006063733,0.0012109645,0.0003370691],"domain_scores_gemma":[0.99292254,0.0015017,0.00042594242,0.0034947484,0.0012023158,0.00045258453],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024413385,0.0010069185,0.0015495584,0.0023699428,0.0028853389,0.009031907,0.0046230163,0.0025693865,0.050038874],"category_scores_gemma":[0.013284384,0.0013943943,0.0016033525,0.0052791922,0.002679275,0.027560007,0.006663138,0.0037579478,0.020332145],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002583632,0.000029524761,0.0003889158,0.0002497845,0.00003644424,0.0001266398,0.00027724457,0.0024469127,0.00084313133,0.8701762,0.0830829,0.042083893],"study_design_scores_gemma":[0.000080229525,0.000047127724,0.00022567052,0.00018280151,0.00006428954,0.00030813634,0.00030762103,0.013048147,0.0032407965,0.6172215,0.3652073,0.00006625008],"about_ca_topic_score_codex":0.008327978,"about_ca_topic_score_gemma":0.009337267,"teacher_disagreement_score":0.050038874,"about_ca_system_score_codex":0.0020402838,"about_ca_system_score_gemma":0.0031640474,"threshold_uncertainty_score":0.16739672},"labels":[],"label_agreement":null},{"id":"W2415869271","doi":"","title":"Drawing the Horton Set in an Integer Grid of Minimun Size.","year":2014,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Set (abstract data type); Integer (computer science); Grid; Mathematics; Geometry; Programming language","score_opus":0.017186325880671184,"score_gpt":0.22372259275893402,"score_spread":0.20653626687826285,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2415869271","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.115789354,0.0006320188,0.8050383,0.0013904686,0.00041494757,0.00018332117,0.001018803,0.0017664451,0.07376641],"genre_scores_gemma":[0.37608606,0.00035832322,0.597671,0.00026204227,0.000043500517,0.00018805194,0.0010098373,0.0005993884,0.023781806],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999708,0.00009873421,0.00001361852,0.00005808704,0.00007109667,0.000050402057],"domain_scores_gemma":[0.99956733,0.00022309239,0.000020435582,0.000095585245,0.00005622185,0.00003729873],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030335377,0.00042138124,0.00058475777,0.00055456185,0.0007392217,0.0011007368,0.00090014044,0.0008246023,0.01877761],"category_scores_gemma":[0.0021519403,0.0004036031,0.00047670188,0.0006591025,0.0006682223,0.0012802692,0.0016774933,0.0010156691,0.0021773672],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011701896,0.00018013088,0.0020801732,0.00043552386,0.000066093824,0.000689186,0.0009624666,0.2545494,0.016410591,0.4167942,0.044111397,0.26255062],"study_design_scores_gemma":[0.00014717867,0.00012539193,0.0006204194,0.00008053481,0.000021132946,0.00019892392,0.00053055596,0.6923085,0.0051553957,0.25766626,0.043109775,0.00003599257],"about_ca_topic_score_codex":0.0028886895,"about_ca_topic_score_gemma":0.006558863,"teacher_disagreement_score":0.01877761,"about_ca_system_score_codex":0.00054014206,"about_ca_system_score_gemma":0.00044576856,"threshold_uncertainty_score":0.062817335},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science","score_opus":0.024157655208773422,"score_gpt":0.23140245207314525,"score_spread":0.20724479686437183,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2604600966","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018329225,0.0006871266,0.9419761,0.00018190406,0.00027078256,0.00013562485,0.0005924664,0.003812873,0.03401387],"genre_scores_gemma":[0.29696834,0.0008623409,0.6608914,0.00016433958,0.0001058821,0.00019177802,0.002521561,0.0021446734,0.036149677],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99924016,0.00010302869,0.000044602002,0.00022683732,0.00030889706,0.00007653785],"domain_scores_gemma":[0.9988691,0.00016798855,0.00009470215,0.00055213046,0.00022801211,0.000088073735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056451734,0.00093903753,0.0009420495,0.001675688,0.0009234427,0.0018460477,0.0018155815,0.0008384802,0.020205757],"category_scores_gemma":[0.0030987526,0.000889776,0.0008405297,0.0016022155,0.0012174526,0.0021230127,0.0032876502,0.001882942,0.008332503],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003386768,0.0001031388,0.001585849,0.00042537187,0.00008392829,0.00024777767,0.00059423584,0.055492625,0.054578066,0.13935177,0.027260771,0.7199378],"study_design_scores_gemma":[0.00012358163,0.000341036,0.0031566569,0.00018309122,0.000106217914,0.0010439793,0.0006246365,0.4916953,0.074040115,0.21266136,0.21593021,0.00009379958],"about_ca_topic_score_codex":0.0019195279,"about_ca_topic_score_gemma":0.003958706,"teacher_disagreement_score":0.020205757,"about_ca_system_score_codex":0.0005225948,"about_ca_system_score_gemma":0.0006968015,"threshold_uncertainty_score":0.067595005},"labels":[],"label_agreement":null},{"id":"W2604739239","doi":"","title":"Rectangle-of-influence triangulations.","year":2016,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba; Carleton University; University of Waterloo","funders":"","keywords":"Rectangle; Computer science; Combinatorics; Parallel computing; Mathematics; Geometry","score_opus":0.025373454355276704,"score_gpt":0.24724990706608185,"score_spread":0.22187645271080514,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2604739239","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006140824,0.00057914254,0.962784,0.00015200053,0.00017374424,0.00014250696,0.0006535641,0.001623938,0.027750317],"genre_scores_gemma":[0.16850498,0.0008221098,0.8065715,0.00016014601,0.000103441525,0.00026417794,0.0021639455,0.0014029656,0.020006679],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988281,0.00030757615,0.000059337563,0.00021730855,0.00048125832,0.00010637346],"domain_scores_gemma":[0.99837166,0.0005825771,0.000106426596,0.00051443756,0.0003343974,0.00009049],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007478224,0.00080890756,0.0009856222,0.0012255791,0.00068796583,0.0013380903,0.0018872495,0.0011504638,0.018884413],"category_scores_gemma":[0.0069117313,0.00075081934,0.001051671,0.0012887261,0.0008839479,0.0013344105,0.003184914,0.0014038875,0.0073952223],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00055552914,0.0000909987,0.0018259161,0.00077322265,0.00015703279,0.00050328136,0.0006979801,0.15217893,0.01554028,0.29422024,0.057706863,0.4757497],"study_design_scores_gemma":[0.00012087816,0.00010791024,0.0007132285,0.00023186827,0.00006025006,0.00076891383,0.0002527778,0.71941334,0.013103395,0.13015904,0.1350047,0.0000635519],"about_ca_topic_score_codex":0.0034534186,"about_ca_topic_score_gemma":0.008198926,"teacher_disagreement_score":0.018884413,"about_ca_system_score_codex":0.00050972274,"about_ca_system_score_gemma":0.0009231494,"threshold_uncertainty_score":0.063174665},"labels":[],"label_agreement":null},{"id":"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Trajectory; Attraction; Computer science; Physics; Astronomy","score_opus":0.023765716120903176,"score_gpt":0.20962495383306856,"score_spread":0.1858592377121654,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2604824923","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14417276,0.006409502,0.78978586,0.002590267,0.0018514408,0.00019391048,0.007897292,0.0019801555,0.04511883],"genre_scores_gemma":[0.86246574,0.0038258375,0.09006469,0.00019921061,0.00024570577,0.00021232023,0.0040943446,0.00053989346,0.038352247],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99939156,0.00008318022,0.00003671034,0.00015735714,0.00024033808,0.000090855574],"domain_scores_gemma":[0.9978339,0.0007205767,0.00032954384,0.00013811336,0.0007039486,0.00027393195],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057145976,0.0004266642,0.00045312112,0.0014756963,0.0008252945,0.001078001,0.0009476257,0.0009504755,0.007856439],"category_scores_gemma":[0.008775226,0.0003806694,0.00033840293,0.00095908,0.00072920206,0.0016370728,0.0012796213,0.0013842019,0.0026662748],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010687057,0.000121500234,0.018817483,0.00082760956,0.00014490889,0.00066904875,0.00058898976,0.29887024,0.018447727,0.29522818,0.032529768,0.33268586],"study_design_scores_gemma":[0.00009136081,0.00040590056,0.023092022,0.0005539385,0.00007960239,0.0015929104,0.00080272026,0.6990063,0.019628748,0.17404151,0.08052123,0.00018364078],"about_ca_topic_score_codex":0.005744519,"about_ca_topic_score_gemma":0.0050316784,"teacher_disagreement_score":0.007856439,"about_ca_system_score_codex":0.00092856004,"about_ca_system_score_gemma":0.0013922309,"threshold_uncertainty_score":0.02628237},"labels":[],"label_agreement":null},{"id":"W2605132714","doi":"","title":"Geometric Unique Set Cover on Unit Disks and Unit Squares.","year":2016,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Unit (ring theory); Cover (algebra); Set cover problem; Set (abstract data type); Computer science; Mathematics; Engineering; Programming language","score_opus":0.0533389688352964,"score_gpt":0.273573053030554,"score_spread":0.2202340841952576,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2605132714","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3571832,0.006980934,0.49114862,0.0014494101,0.0008610904,0.00014753151,0.0016022917,0.00091977394,0.13970716],"genre_scores_gemma":[0.86222017,0.0020187374,0.10388479,0.00018694134,0.00028826256,0.00011669008,0.0015851244,0.00037578278,0.029323447],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994252,0.00010049512,0.000030256604,0.00010373493,0.00024348259,0.000096794356],"domain_scores_gemma":[0.998884,0.00056839397,0.00009195569,0.00020643715,0.00013264825,0.000116526586],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025769003,0.00046066608,0.00095331325,0.0015114135,0.0011064537,0.0018843963,0.0009910228,0.0008794256,0.010142573],"category_scores_gemma":[0.0039478475,0.0005516147,0.00058738707,0.001176854,0.0011957558,0.0020308527,0.0033923986,0.0014756185,0.0018065795],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003794414,0.00006286549,0.002123828,0.0003661087,0.00006058696,0.0007080952,0.0005903749,0.05111966,0.0066367607,0.7793043,0.027309738,0.13133815],"study_design_scores_gemma":[0.00005317874,0.00012099599,0.0028492517,0.000125291,0.00004382506,0.0018787753,0.0006452978,0.19605985,0.00648057,0.7471864,0.044511113,0.000045492343],"about_ca_topic_score_codex":0.0018755721,"about_ca_topic_score_gemma":0.0016288272,"teacher_disagreement_score":0.010142573,"about_ca_system_score_codex":0.00061733037,"about_ca_system_score_gemma":0.00035465084,"threshold_uncertainty_score":0.033930242},"labels":[],"label_agreement":null},{"id":"W2605171502","doi":"","title":"On the Biplanar Crossing Number of K n .","year":2016,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Crossing number (knot theory); Computer science; Physics; Materials science; Composite material","score_opus":0.03215945695421688,"score_gpt":0.26548581645001285,"score_spread":0.23332635949579597,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2605171502","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5592534,0.004925425,0.14798719,0.0027094139,0.0013368413,0.00009672545,0.0016180022,0.0008382977,0.28123474],"genre_scores_gemma":[0.96159947,0.0014289627,0.024641927,0.00027628386,0.00024158011,0.000061887775,0.0005344224,0.00021599248,0.010999638],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99935156,0.0001535429,0.00003884024,0.00015623133,0.00014999522,0.00014987998],"domain_scores_gemma":[0.9963085,0.0020333617,0.00046422624,0.00030403616,0.0004090524,0.00048073378],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009773974,0.00054805307,0.0005310124,0.002769834,0.0011308872,0.0017332416,0.000908443,0.00071786967,0.012426938],"category_scores_gemma":[0.00967155,0.00029634364,0.000256193,0.0014671903,0.001590274,0.0025986603,0.0014216128,0.0013754594,0.0022121063],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00085675035,0.0001467155,0.00757819,0.00035125925,0.00005188691,0.00045257265,0.00053065707,0.048562467,0.0067077214,0.7486753,0.04232779,0.14375858],"study_design_scores_gemma":[0.00004974284,0.00012738733,0.0055972687,0.00021588871,0.00004060361,0.00095750846,0.00054338534,0.1395175,0.0054397047,0.8246172,0.022812873,0.00008101271],"about_ca_topic_score_codex":0.0014117998,"about_ca_topic_score_gemma":0.0016568138,"teacher_disagreement_score":0.012426938,"about_ca_system_score_codex":0.0008149143,"about_ca_system_score_gemma":0.0004382154,"threshold_uncertainty_score":0.041572273},"labels":[],"label_agreement":null},{"id":"W2782677994","doi":"","title":"Minimum Enclosing Circle Problem with Base Point.","year":2017,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Base (topology); Point (geometry); Computer science; Mathematical optimization; Mathematics; Geometry; Mathematical analysis","score_opus":0.027865243042939393,"score_gpt":0.24974887250867842,"score_spread":0.22188362946573903,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2782677994","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052117385,0.0011271002,0.9175522,0.00075113325,0.00016486052,0.00012003217,0.0007327693,0.00058729626,0.026847264],"genre_scores_gemma":[0.53619003,0.0007977494,0.43881586,0.00013755383,0.00015135108,0.00024672193,0.0017174587,0.00046760714,0.021475725],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994543,0.00016063999,0.000029483264,0.000121648,0.00016919023,0.000064737025],"domain_scores_gemma":[0.9986443,0.0009125939,0.000081675964,0.00014227271,0.00012126816,0.00009784771],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005292088,0.0007806434,0.0016003135,0.0006341258,0.0005349959,0.0010659315,0.0017687272,0.0018536435,0.009511625],"category_scores_gemma":[0.0046986863,0.0005062693,0.0005225841,0.0006604745,0.0006472258,0.0018446188,0.0022790702,0.0014717382,0.0017436036],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009084704,0.00028975256,0.0011502705,0.0010136281,0.00009311848,0.0009059605,0.000515544,0.50298184,0.011675226,0.19923384,0.039309103,0.24192329],"study_design_scores_gemma":[0.00009162442,0.0001378053,0.00039163927,0.000057465244,0.000028537735,0.00034485463,0.00011303838,0.8884501,0.004385606,0.08965585,0.016321916,0.000021563344],"about_ca_topic_score_codex":0.001416618,"about_ca_topic_score_gemma":0.001273907,"teacher_disagreement_score":0.009511625,"about_ca_system_score_codex":0.00030290612,"about_ca_system_score_gemma":0.0005095646,"threshold_uncertainty_score":0.031819522},"labels":[],"label_agreement":null},{"id":"W2783071455","doi":"","title":"Interference Minimization in k-Connected Wireless Networks.","year":2017,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Interference (communication); Computer science; Minification; Wireless; Wireless network; Computer network; Telecommunications","score_opus":0.026078376337796652,"score_gpt":0.253558978571153,"score_spread":0.22748060223335637,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2783071455","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045332,0.0026370394,0.92878616,0.0015727985,0.00026705564,0.000098371595,0.0005709825,0.00028145593,0.020454183],"genre_scores_gemma":[0.8172823,0.004131043,0.15878578,0.0005236053,0.0004919206,0.00027637568,0.0007550998,0.0002760817,0.017477768],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990361,0.00043447694,0.000040839335,0.00016463119,0.00016748071,0.00015659245],"domain_scores_gemma":[0.9972288,0.0020783413,0.00018787445,0.00014706998,0.00022277646,0.00013518932],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010221647,0.0011457512,0.0011890943,0.00083261763,0.0007853579,0.0011816977,0.0021483074,0.0010935393,0.0031191586],"category_scores_gemma":[0.005120337,0.00050777814,0.0006229078,0.002099694,0.0011440351,0.0019540743,0.0016595118,0.0013208915,0.0009426366],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002903178,0.000121052246,0.00090320135,0.000593471,0.00016588192,0.0002661105,0.0003019136,0.7460646,0.002538922,0.14830919,0.019992907,0.08045242],"study_design_scores_gemma":[0.000028849967,0.00005856245,0.00035582625,0.000044977718,0.000035074645,0.00017063388,0.00012148223,0.8368182,0.0008273848,0.1585495,0.002972096,0.000017359615],"about_ca_topic_score_codex":0.0023638739,"about_ca_topic_score_gemma":0.0023200996,"teacher_disagreement_score":0.0031191586,"about_ca_system_score_codex":0.001152464,"about_ca_system_score_gemma":0.0007803756,"threshold_uncertainty_score":0.010434687},"labels":[],"label_agreement":null},{"id":"W2783114890","doi":"","title":"On the Planar Spherical Depth and Lens Depth.","year":2017,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Planar; Lens (geology); Optics; Depth of field; Computer science; Physics; Computer graphics (images)","score_opus":0.05594521687350084,"score_gpt":0.2681369403757105,"score_spread":0.21219172350220966,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2783114890","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04091479,0.016285451,0.87446356,0.0037354692,0.001057435,0.00010114595,0.0011319474,0.0005933206,0.061716914],"genre_scores_gemma":[0.75910133,0.012788113,0.19369628,0.0011227046,0.0021122382,0.00014040963,0.001231616,0.0011585453,0.028648784],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984125,0.0004944925,0.00007944701,0.00032484648,0.0004918305,0.00019681675],"domain_scores_gemma":[0.990489,0.0052263234,0.0009172645,0.00083484995,0.0018255643,0.00070705713],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021661052,0.0015287618,0.0011425784,0.0030547816,0.0009461625,0.0028723641,0.0023514882,0.0016814837,0.009996147],"category_scores_gemma":[0.029615603,0.0011887262,0.0010172413,0.0019713081,0.003810872,0.008188413,0.0059087826,0.0047946414,0.0021068368],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003447798,0.000046781843,0.0033523883,0.0002951354,0.00006256778,0.0001167366,0.0003264369,0.043319076,0.0022103272,0.7992696,0.01714908,0.13350715],"study_design_scores_gemma":[0.000044498298,0.000091992246,0.003531802,0.00021525449,0.00006456188,0.00042021074,0.00037587227,0.24458088,0.0024833633,0.71973324,0.028351808,0.00010648313],"about_ca_topic_score_codex":0.00720961,"about_ca_topic_score_gemma":0.0056872093,"teacher_disagreement_score":0.009996147,"about_ca_system_score_codex":0.001460502,"about_ca_system_score_gemma":0.0010648698,"threshold_uncertainty_score":0.03344041},"labels":[],"label_agreement":null},{"id":"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Binary number; Binary tree; Grid; Computer graphics (images); Algorithm; Mathematics; Geometry; Arithmetic","score_opus":0.05160737549822516,"score_gpt":0.31323921461039234,"score_spread":0.2616318391121672,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2783355325","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25640842,0.0007649839,0.5932435,0.0008858457,0.000402507,0.00038926728,0.004106096,0.0027969142,0.14100248],"genre_scores_gemma":[0.600454,0.00092239736,0.3392378,0.0002824687,0.00007835653,0.00024348061,0.0050343447,0.0009746649,0.052772462],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993449,0.00014051885,0.000042475265,0.000106210806,0.0002164315,0.00014942825],"domain_scores_gemma":[0.9985582,0.00032367164,0.00014927106,0.0004933441,0.00031965837,0.00015591313],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030938783,0.00047653678,0.00055828516,0.000886787,0.0010151786,0.0020649906,0.0011316162,0.00085267145,0.0151445335],"category_scores_gemma":[0.0025535477,0.00065504643,0.0005000691,0.0013412475,0.0006972326,0.0018906072,0.0015702067,0.0016904667,0.0044956794],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00049487577,0.00024666355,0.0022869776,0.00041823354,0.00005119576,0.00069884444,0.0012158505,0.028174391,0.030683646,0.67097294,0.03703597,0.22772038],"study_design_scores_gemma":[0.00015381954,0.00012963457,0.002666868,0.0001651726,0.00006868491,0.0010777938,0.00100046,0.08055376,0.023656473,0.7656163,0.12485544,0.000055665187],"about_ca_topic_score_codex":0.003018011,"about_ca_topic_score_gemma":0.005288927,"teacher_disagreement_score":0.0151445335,"about_ca_system_score_codex":0.0006204652,"about_ca_system_score_gemma":0.0005952808,"threshold_uncertainty_score":0.05066347},"labels":[],"label_agreement":null},{"id":"W2783721252","doi":"","title":"Packing Boundary-Anchored Rectangles.","year":2017,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba; Carleton University; University of Waterloo","funders":"","keywords":"Computer science; Boundary (topology); Mathematics","score_opus":0.032501644865725335,"score_gpt":0.2521070399376369,"score_spread":0.21960539507191157,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2783721252","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.063675,0.0018619107,0.86904114,0.00028727253,0.0005148907,0.0001773919,0.00085028907,0.002852488,0.06073963],"genre_scores_gemma":[0.35564798,0.0018895434,0.61197686,0.00022496186,0.000121442914,0.00018607623,0.002597603,0.0007630536,0.026592594],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993224,0.00016324375,0.000046325134,0.00012352827,0.00020991897,0.00013460963],"domain_scores_gemma":[0.9991134,0.00029314953,0.000080668564,0.00032696177,0.00011877918,0.00006716153],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043578589,0.0007328843,0.0009823472,0.0009956738,0.00070104207,0.0014013175,0.0014777868,0.0008365346,0.01751727],"category_scores_gemma":[0.0030961197,0.00071777427,0.00063495553,0.0017597543,0.00059144426,0.0019978648,0.003237977,0.0010965854,0.007398429],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012604835,0.00027371757,0.0016665176,0.0007194046,0.000097980206,0.0010041931,0.0005424913,0.07672241,0.036564577,0.19805902,0.04287908,0.64021015],"study_design_scores_gemma":[0.00034386595,0.0008041129,0.0020167504,0.0005131779,0.00013420919,0.0017894645,0.00055234175,0.4882935,0.07328362,0.28504133,0.14710823,0.000119447606],"about_ca_topic_score_codex":0.0010652331,"about_ca_topic_score_gemma":0.0015158375,"teacher_disagreement_score":0.01751727,"about_ca_system_score_codex":0.00028588867,"about_ca_system_score_gemma":0.00041069213,"threshold_uncertainty_score":0.05860108},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Spanner; Computer science; Graph; Theoretical computer science; Distributed computing","score_opus":0.033883652390772644,"score_gpt":0.26529704014268607,"score_spread":0.23141338775191342,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2908455634","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040323965,0.0011714279,0.88888675,0.00080045353,0.0007094595,0.00025736465,0.0034271528,0.0029110163,0.061512396],"genre_scores_gemma":[0.27066207,0.002559151,0.64477044,0.0008899511,0.00041763927,0.0004084474,0.010347891,0.002294713,0.067649774],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993698,0.00008245904,0.000056922818,0.00022087144,0.00019234054,0.00007770831],"domain_scores_gemma":[0.99905044,0.00016535312,0.00008282915,0.00030986272,0.00023728969,0.00015431504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004303601,0.00076439395,0.0006972944,0.0022011506,0.0009858232,0.0018058281,0.0016881035,0.0011004641,0.021934355],"category_scores_gemma":[0.002001275,0.0003868673,0.00097441644,0.0026807955,0.0009429941,0.0038476398,0.0028792568,0.0018971422,0.006844257],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037652222,0.00019521033,0.00091491017,0.00040515055,0.00006616838,0.0005253411,0.0004259851,0.025171245,0.014472913,0.5398483,0.04365803,0.3739402],"study_design_scores_gemma":[0.00004770476,0.00022054884,0.00087707763,0.00015273882,0.00007440042,0.0014583624,0.0003686964,0.10452121,0.011897338,0.70632565,0.17398739,0.000068967856],"about_ca_topic_score_codex":0.0012611407,"about_ca_topic_score_gemma":0.0016969936,"teacher_disagreement_score":0.021934355,"about_ca_system_score_codex":0.00055380387,"about_ca_system_score_gemma":0.00066973874,"threshold_uncertainty_score":0.07337773},"labels":[],"label_agreement":null},{"id":"W2943430289","doi":"","title":"Weighted Minimum Backward Frechet Distance.","year":2015,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Mathematics","score_opus":0.054461784248001716,"score_gpt":0.26468968030747553,"score_spread":0.2102278960594738,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2943430289","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014232269,0.0005790573,0.98017037,0.00032512203,0.0000790195,0.00012789975,0.00033914068,0.000441736,0.0037054315],"genre_scores_gemma":[0.1765177,0.0005081672,0.81084913,0.0002024776,0.00007125481,0.00037476904,0.0014412418,0.0004596864,0.009575568],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988232,0.00026094762,0.00008485733,0.00032873306,0.00033742667,0.00016473432],"domain_scores_gemma":[0.9986866,0.00064074085,0.00016500452,0.00018107102,0.00021680769,0.000109791516],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016725168,0.0019035728,0.0020586015,0.0018760605,0.0011682269,0.0016398912,0.0022288626,0.0024810408,0.008219051],"category_scores_gemma":[0.0048969034,0.0008320589,0.0014826363,0.0018613385,0.0013017853,0.004291027,0.0024842352,0.0019131327,0.001621976],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004391976,0.00024852192,0.0017314841,0.0007458211,0.00014489108,0.0002896179,0.00026413501,0.5476945,0.009450535,0.14150983,0.013833484,0.283648],"study_design_scores_gemma":[0.000057236808,0.00023217304,0.0004894517,0.000081674225,0.000041319807,0.00038809908,0.00010890514,0.8344922,0.004301104,0.14594692,0.013813115,0.000047732563],"about_ca_topic_score_codex":0.0033910463,"about_ca_topic_score_gemma":0.0037435598,"teacher_disagreement_score":0.008219051,"about_ca_system_score_codex":0.0019782062,"about_ca_system_score_gemma":0.001960436,"threshold_uncertainty_score":0.027495503},"labels":[],"label_agreement":null},{"id":"W2962742438","doi":"","title":"Square Formation by Asynchronous Oblivious Robots.","year":2016,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Robot; Computer science; Asynchronous communication; Correctness; Mobile robot; Square (algebra); Theoretical computer science; Degenerate energy levels; Algorithm; Mathematics; Artificial intelligence; Geometry; Physics","score_opus":0.02441196527484058,"score_gpt":0.24285998804405776,"score_spread":0.21844802276921718,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962742438","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04741784,0.00020421688,0.9424537,0.0002990276,0.00006494713,0.000102463564,0.000048665752,0.00023847634,0.009170639],"genre_scores_gemma":[0.75752765,0.00038598233,0.22938558,0.00016057915,0.00005438592,0.00024032147,0.00016406486,0.000085861626,0.011995643],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994815,0.00015455,0.000026446742,0.00012199298,0.00013926551,0.000076260345],"domain_scores_gemma":[0.9988048,0.00055329717,0.00021613947,0.0002316718,0.00008904384,0.00010511177],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005658781,0.0003826301,0.00038152226,0.00030198367,0.00061965233,0.0006054282,0.0009577665,0.0005481351,0.0022870372],"category_scores_gemma":[0.0029925513,0.0002640623,0.0005784809,0.00033719832,0.0017457247,0.001407459,0.0020959608,0.00074647844,0.00056976586],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019835471,0.00004078948,0.0010536513,0.00016326035,0.00004116405,0.00026448152,0.0004579608,0.34890673,0.012231578,0.58996964,0.0020807546,0.044591628],"study_design_scores_gemma":[0.000075186515,0.00012319555,0.00025532313,0.000014547298,0.00001786637,0.00018001648,0.00013269823,0.6879071,0.006811157,0.29701927,0.007444638,0.000018969271],"about_ca_topic_score_codex":0.0011948865,"about_ca_topic_score_gemma":0.0010981571,"teacher_disagreement_score":0.0022870372,"about_ca_system_score_codex":0.0005249825,"about_ca_system_score_gemma":0.0005980018,"threshold_uncertainty_score":0.007650852},"labels":[],"label_agreement":null},{"id":"W2962974790","doi":"","title":"Collinearities in Kinetic Point Sets","year":2011,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Collinearity; Combinatorics; Plane (geometry); Trajectory; Mathematics; Point (geometry); Constant (computer programming); Line (geometry); Set (abstract data type); Kinetic energy; Line segment; Geometry; Physics; Mathematical analysis; Computer science; Classical mechanics","score_opus":0.055974921718670016,"score_gpt":0.24644584040733972,"score_spread":0.1904709186886697,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962974790","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39548653,0.0009984733,0.5733354,0.00061953167,0.00011555467,0.00021838682,0.001102572,0.00045696087,0.02766652],"genre_scores_gemma":[0.914036,0.0006857178,0.069455154,0.00016917873,0.00009838077,0.00041319244,0.0024114465,0.00024567684,0.0124852],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99494535,0.0006641453,0.0005083044,0.00089906045,0.0019894312,0.000993765],"domain_scores_gemma":[0.98743165,0.005813078,0.002606225,0.0014075439,0.001588283,0.0011532123],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002420437,0.0011508781,0.0018513605,0.004061742,0.0033869848,0.0045184046,0.0030984285,0.0015868404,0.009737184],"category_scores_gemma":[0.015672423,0.0014335962,0.00182996,0.0038313405,0.0039510494,0.0069227237,0.009163403,0.0029468352,0.0017225993],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003692709,0.000066072964,0.004531047,0.00021765301,0.00008148976,0.0007233583,0.001183495,0.056089465,0.0024188387,0.91627014,0.0019388029,0.016110497],"study_design_scores_gemma":[0.00007173837,0.00010010098,0.0007937795,0.00009836267,0.00003191347,0.0005729313,0.00060696626,0.14363848,0.0023325013,0.8437931,0.00791042,0.000049615097],"about_ca_topic_score_codex":0.0024777115,"about_ca_topic_score_gemma":0.0015141814,"teacher_disagreement_score":0.009737184,"about_ca_system_score_codex":0.0020936423,"about_ca_system_score_gemma":0.00086543534,"threshold_uncertainty_score":0.032574177},"labels":[],"label_agreement":null},{"id":"W2963098896","doi":"","title":"Approximation Schemes for Covering and Packing in the Streaming Model.","year":2017,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Streaming data; Approximation algorithm; Packing problems; Context (archaeology); Streaming algorithm; Theoretical computer science; Cluster analysis; Cover (algebra); Mathematical optimization; Algorithm; Mathematics; Upper and lower bounds; Artificial intelligence; Data mining","score_opus":0.06221067361608096,"score_gpt":0.29343118656529077,"score_spread":0.2312205129492098,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963098896","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01879259,0.001306044,0.9693002,0.0005532222,0.00013608902,0.00015312621,0.00028480263,0.0005760633,0.008897856],"genre_scores_gemma":[0.4196739,0.0026857438,0.56484944,0.00053268566,0.00038640443,0.0004657246,0.0013435881,0.0003593499,0.0097032115],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99838245,0.00040001154,0.000092851835,0.00031470982,0.0005738673,0.0002360694],"domain_scores_gemma":[0.99494815,0.002418382,0.0003549625,0.001697506,0.0003283211,0.000252698],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023165506,0.0012407529,0.0012648985,0.0013848876,0.0010229109,0.002199595,0.003970414,0.001918726,0.0062901643],"category_scores_gemma":[0.011164484,0.00059289753,0.0017225337,0.0026938412,0.0014473984,0.007281021,0.0037161172,0.0030287348,0.0016534029],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000358402,0.00026385795,0.0014356151,0.00044210188,0.000085731896,0.00015958658,0.000426542,0.20626988,0.0052516223,0.57486695,0.016393926,0.1940457],"study_design_scores_gemma":[0.0000351694,0.00008936275,0.00023051673,0.00004496369,0.000031572345,0.00026486325,0.000095696305,0.7038025,0.0019617695,0.28455493,0.008869127,0.000019551231],"about_ca_topic_score_codex":0.0021183467,"about_ca_topic_score_gemma":0.0024655636,"teacher_disagreement_score":0.0062901643,"about_ca_system_score_codex":0.00267914,"about_ca_system_score_gemma":0.0013348827,"threshold_uncertainty_score":0.021042705},"labels":[],"label_agreement":null},{"id":"W2963302799","doi":"","title":"Sliding k-Transmitters: Hardness and Approximation","year":2016,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba; University of Waterloo","funders":"","keywords":"Monotone polygon; Simple polygon; Combinatorics; Polygon (computer graphics); Mathematics; Perpendicular; Guard (computer science); Line segment; Algorithm; Geometry; Mathematical analysis; Computer science; Telecommunications","score_opus":0.028130455835106392,"score_gpt":0.23365218653069406,"score_spread":0.20552173069558766,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963302799","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3178406,0.004344799,0.5992654,0.012836865,0.00059081655,0.0006686285,0.011177572,0.0065342328,0.04674117],"genre_scores_gemma":[0.7515506,0.0018288908,0.22282821,0.0012445218,0.00056519534,0.0006351651,0.006587128,0.0010509461,0.01370922],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967379,0.00045670354,0.00021808407,0.0010129323,0.00065440417,0.00091993867],"domain_scores_gemma":[0.9877221,0.008412977,0.0009964685,0.001730083,0.0004826298,0.00065570424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014596629,0.0022341786,0.003283147,0.0011750868,0.0023625798,0.0048127915,0.006257208,0.003024621,0.012154346],"category_scores_gemma":[0.012475,0.0015209262,0.0030271397,0.003151625,0.0025254572,0.011101259,0.004756094,0.00432187,0.002225006],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00342583,0.0009821703,0.00789295,0.002782451,0.0005176511,0.0012628931,0.0015109548,0.6414948,0.012142525,0.11311229,0.07614089,0.13873456],"study_design_scores_gemma":[0.00038342352,0.00020121795,0.0011272363,0.00011407576,0.00015973901,0.0008033833,0.0004995642,0.74728656,0.0036709679,0.23759241,0.008090588,0.0000707962],"about_ca_topic_score_codex":0.0050561037,"about_ca_topic_score_gemma":0.005280362,"teacher_disagreement_score":0.012154346,"about_ca_system_score_codex":0.002913573,"about_ca_system_score_gemma":0.002684752,"threshold_uncertainty_score":0.04066032},"labels":[],"label_agreement":null},{"id":"W2963433266","doi":"","title":"$1$-String $B_1$-VPG Representations of Planar Partial $3$-Trees and Some Subclasses","year":2015,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Planar; Planar graph; Vertex (graph theory); Mathematics; Graph; String (physics); Face (sociological concept); Computer science","score_opus":0.061165323226796596,"score_gpt":0.28277101308477515,"score_spread":0.22160568985797854,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963433266","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.58522195,0.0008359624,0.33075437,0.00093665766,0.00016332834,0.00019947025,0.0034508554,0.0018669777,0.07657049],"genre_scores_gemma":[0.8878634,0.0006706249,0.08981724,0.0003777107,0.000082193445,0.000255814,0.0050810687,0.00048371896,0.015368152],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99978346,0.000028070825,0.000014159834,0.000059401453,0.00006591736,0.00004901179],"domain_scores_gemma":[0.9995609,0.00008266584,0.000077242636,0.00013711427,0.00008089488,0.00006123452],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013026736,0.00036830967,0.0004230397,0.00082535035,0.00080590387,0.0011831624,0.0006317364,0.00082834077,0.006545835],"category_scores_gemma":[0.0010507391,0.00026966754,0.00061402295,0.0011353024,0.00078958116,0.0019638753,0.00080707314,0.0011503311,0.0011460121],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022581436,0.00009604068,0.00276556,0.00026444116,0.00002935132,0.0010904096,0.00085196696,0.015804665,0.019508593,0.8123537,0.014781359,0.13222808],"study_design_scores_gemma":[0.000038108737,0.000085742286,0.0035904485,0.00009472739,0.000051505092,0.0019213313,0.0007577237,0.08442729,0.008043432,0.82863945,0.07229218,0.000058028916],"about_ca_topic_score_codex":0.001840865,"about_ca_topic_score_gemma":0.0013526935,"teacher_disagreement_score":0.006545835,"about_ca_system_score_codex":0.0005730871,"about_ca_system_score_gemma":0.00032545073,"threshold_uncertainty_score":0.021898031},"labels":[],"label_agreement":null},{"id":"W2995839712","doi":"","title":"Approximating the minimum closest pair distance and nearest neighbor distances of linearly moving points","year":2015,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Constant (computer programming); Dimension (graph theory); Combinatorics; Linear space; k-nearest neighbors algorithm; Mathematics; Space (punctuation); Discrete mathematics; Computer science","score_opus":0.04014110122099491,"score_gpt":0.2516269006426904,"score_spread":0.2114857994216955,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2995839712","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11839612,0.0010777048,0.874312,0.00045221587,0.00011086223,0.0001290318,0.0011054946,0.0014249879,0.0029915438],"genre_scores_gemma":[0.3590778,0.0005049477,0.6347611,0.000073841715,0.000092387476,0.00023165409,0.002110272,0.00018779136,0.002960263],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99760747,0.00035829243,0.00017068424,0.0006167808,0.001037516,0.00020933761],"domain_scores_gemma":[0.99681723,0.0012291581,0.0004894564,0.0008749561,0.0004148405,0.00017432129],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010896339,0.0011124474,0.0017247235,0.0024675876,0.00086688006,0.0015485863,0.0039345063,0.0016395272,0.0027528165],"category_scores_gemma":[0.014121916,0.0008853496,0.0009218108,0.0039729397,0.0009603203,0.004175874,0.0031439534,0.0016807641,0.001608193],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015961934,0.00027915643,0.008284035,0.0004814622,0.00014713765,0.00033246962,0.0005005207,0.6311124,0.01010072,0.036815,0.010115328,0.30023554],"study_design_scores_gemma":[0.00006749385,0.0001288926,0.0010591437,0.000023737439,0.000019620056,0.00019017581,0.00011838447,0.9601342,0.004868598,0.030585717,0.0027737315,0.000030440842],"about_ca_topic_score_codex":0.0059207045,"about_ca_topic_score_gemma":0.0067754067,"teacher_disagreement_score":0.0059207045,"about_ca_system_score_codex":0.0014970824,"about_ca_system_score_gemma":0.0011120997,"threshold_uncertainty_score":0.011772513},"labels":[],"label_agreement":null},{"id":"W3020829986","doi":"","title":"Reconstructing a Polyhedron between Polygons in Parallel Slices.","year":2019,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Vertex (graph theory); Mathematics; Polyhedron; Regular polygon; Surface (topology); Disjoint sets; Planar; Triangulation; Time complexity; Geometry; Computer science; Graph","score_opus":0.027851291218023832,"score_gpt":0.2508997063316967,"score_spread":0.2230484151136729,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3020829986","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17574559,0.00037834427,0.81103736,0.00020245816,0.0000928163,0.000154025,0.00136639,0.0019943716,0.009028699],"genre_scores_gemma":[0.43243527,0.00024347629,0.56082875,0.000034740642,0.000013481468,0.00007903199,0.0023245623,0.00032570955,0.0037149037],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995666,0.000049207207,0.00002884148,0.00011741524,0.00017431217,0.00006353491],"domain_scores_gemma":[0.99939215,0.00023855889,0.000078492565,0.00018680788,0.000057900525,0.000046059726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025144726,0.0007557444,0.0006975549,0.00059121026,0.0005215175,0.0009910257,0.0010118503,0.00090254983,0.0036554188],"category_scores_gemma":[0.002053134,0.0010535964,0.0010091801,0.0008421623,0.0009652569,0.0016198964,0.0020091485,0.001441853,0.00076134177],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010412991,0.00018215223,0.0068747406,0.00072056695,0.00021391644,0.001651056,0.0010859114,0.5230379,0.037682775,0.115911506,0.010390871,0.3012073],"study_design_scores_gemma":[0.00006302923,0.00014145485,0.0012008799,0.00007197052,0.000029980525,0.0006191394,0.00056273886,0.9087401,0.011332199,0.065505125,0.011700405,0.000033025597],"about_ca_topic_score_codex":0.0056518926,"about_ca_topic_score_gemma":0.009090448,"teacher_disagreement_score":0.0056518926,"about_ca_system_score_codex":0.0005470098,"about_ca_system_score_gemma":0.0006790966,"threshold_uncertainty_score":0.0122285485},"labels":[],"label_agreement":null},{"id":"W3020899460","doi":"","title":"Watchtower for k-crossing Visibility.","year":2019,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Manitoba","funders":"","keywords":"Visibility; Computer science; Telecommunications; Environmental science; Physics; Optics","score_opus":0.027419268007542713,"score_gpt":0.26531223596246645,"score_spread":0.23789296795492373,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3020899460","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026789444,0.0015225122,0.83581173,0.0019072238,0.0015510715,0.0003725441,0.005176993,0.042731434,0.08413694],"genre_scores_gemma":[0.372569,0.0017991748,0.5013256,0.0008374931,0.0005720501,0.00061231764,0.0165141,0.009194695,0.09657555],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99931455,0.000074562915,0.000043652977,0.00019826827,0.00020632375,0.00016270064],"domain_scores_gemma":[0.99837554,0.0004993272,0.000081805185,0.0006337855,0.00023551391,0.00017400089],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007603068,0.000926587,0.0010753189,0.0012455033,0.0014899061,0.0024101313,0.0019690513,0.0012975043,0.08350827],"category_scores_gemma":[0.005916339,0.0006416222,0.0012840322,0.0013932149,0.00083217694,0.0051974906,0.0053467667,0.0024193781,0.018485593],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008544866,0.00022971827,0.001963343,0.0007149396,0.00010012847,0.0005203782,0.0007975725,0.015948573,0.0077402326,0.29836628,0.27996618,0.39279822],"study_design_scores_gemma":[0.00017447815,0.00015683942,0.0007670386,0.00022719125,0.00007473964,0.00048523734,0.00038876428,0.11656046,0.008483605,0.6045466,0.26806718,0.00006781391],"about_ca_topic_score_codex":0.0036584556,"about_ca_topic_score_gemma":0.007226634,"teacher_disagreement_score":0.08350827,"about_ca_system_score_codex":0.00069708214,"about_ca_system_score_gemma":0.0010143651,"threshold_uncertainty_score":0.27936298},"labels":[],"label_agreement":null},{"id":"W3021534272","doi":"","title":"Three-Coloring Three-Dimensional Uniform Hypergraphs.","year":2019,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Waterloo","funders":"","keywords":"Computer science","score_opus":0.014843588248475922,"score_gpt":0.1947268364063736,"score_spread":0.17988324815789766,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3021534272","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14484018,0.0010494803,0.7294734,0.0011572646,0.00055455114,0.00016150506,0.00199942,0.0017886675,0.11897553],"genre_scores_gemma":[0.746033,0.00095820794,0.21105672,0.00051587133,0.0001060718,0.00017572776,0.0016356512,0.0003527256,0.039165955],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99962294,0.00012579242,0.000017750312,0.000068384725,0.00007510127,0.00008998977],"domain_scores_gemma":[0.99905175,0.00029485996,0.000068999834,0.00022739815,0.00017407225,0.00018290801],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031499274,0.00049214717,0.00045648494,0.0008137077,0.0012966965,0.0017400368,0.0010433397,0.0006763097,0.013923753],"category_scores_gemma":[0.0017688214,0.0003941709,0.00047934474,0.0010332857,0.0009808489,0.0015177911,0.001752984,0.0010424803,0.0020665515],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043230216,0.00009620682,0.0015031149,0.00024296946,0.000058991096,0.0003877294,0.00043060898,0.040660992,0.012062662,0.8269949,0.02371421,0.09341529],"study_design_scores_gemma":[0.00009814374,0.00007735871,0.0015397364,0.00008182545,0.0000469084,0.0006260868,0.00063245767,0.2208797,0.012128094,0.7159509,0.04787388,0.00006492914],"about_ca_topic_score_codex":0.004224902,"about_ca_topic_score_gemma":0.00545708,"teacher_disagreement_score":0.013923753,"about_ca_system_score_codex":0.0008609745,"about_ca_system_score_gemma":0.00060244225,"threshold_uncertainty_score":0.04657966},"labels":[],"label_agreement":null},{"id":"W3023360435","doi":"","title":"Redundant Persistent Acyclic Formations for Vision-Based Control of Distributed Multi-Agent Formations.","year":2019,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Control (management); Distributed computing; Multi-agent system; Geology; Artificial intelligence","score_opus":0.026395066848468422,"score_gpt":0.26148191985535324,"score_spread":0.2350868530068848,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3023360435","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025892338,0.00022441268,0.9699799,0.00009429002,0.00007141018,0.000046399386,0.00005725637,0.00052984525,0.0031042087],"genre_scores_gemma":[0.9090097,0.00016026168,0.08772043,0.000048127273,0.00003114296,0.0001046499,0.00012435947,0.00005885564,0.0027424917],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997063,0.00007876503,0.000020404226,0.00006687902,0.00007769401,0.00004995745],"domain_scores_gemma":[0.9990792,0.00034683017,0.00015276355,0.00017109097,0.00016143882,0.00008864088],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060736237,0.00037846304,0.0004889787,0.00048042953,0.00060727407,0.0006253121,0.0014168087,0.0004271501,0.0020793602],"category_scores_gemma":[0.0023861988,0.0002867007,0.00034008597,0.00035209974,0.00068509753,0.0007888422,0.0015272516,0.0007210834,0.00023937605],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005200671,0.00010206759,0.0006570021,0.0001401442,0.000045846264,0.00016392973,0.00026205415,0.7678531,0.011971872,0.09066837,0.0032880462,0.12432752],"study_design_scores_gemma":[0.000021769776,0.00007279305,0.00009515769,0.0000059347653,0.000009104015,0.00001943859,0.000023984257,0.9825064,0.0015149631,0.014645039,0.0010795495,0.0000058694227],"about_ca_topic_score_codex":0.0042904112,"about_ca_topic_score_gemma":0.006609977,"teacher_disagreement_score":0.0042904112,"about_ca_system_score_codex":0.0005313149,"about_ca_system_score_gemma":0.0008174614,"threshold_uncertainty_score":0.008530855},"labels":[],"label_agreement":null},{"id":"W3023639838","doi":"","title":"Graph Drawing via Layered Partitions.","year":2019,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Graph; Theoretical computer science","score_opus":0.02048755667012055,"score_gpt":0.2358003441935206,"score_spread":0.21531278752340005,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3023639838","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006453216,0.0003652514,0.9807715,0.00018785133,0.00009457385,0.00007252474,0.0003755264,0.00234071,0.009338891],"genre_scores_gemma":[0.17420724,0.00094257505,0.80644685,0.00015298006,0.000071948416,0.0001494494,0.0015723757,0.0013095797,0.015146929],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99948287,0.00012794397,0.00002500411,0.00010406523,0.00020752328,0.00005257138],"domain_scores_gemma":[0.9989537,0.00043931388,0.000049177834,0.00030527453,0.00016889324,0.00008366189],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005263627,0.00086650474,0.00068061857,0.0016145887,0.0005864875,0.0020002096,0.0013569264,0.0009334161,0.015745332],"category_scores_gemma":[0.0034202943,0.0009206587,0.0010952674,0.0015235556,0.0007381935,0.0023890587,0.0025423297,0.0018202091,0.0037737745],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032384956,0.00010690105,0.0010301586,0.00049369346,0.00013736554,0.0003010237,0.000696971,0.16440986,0.019440738,0.23029402,0.043982886,0.53878254],"study_design_scores_gemma":[0.000060070368,0.00006430575,0.00039237647,0.000119441174,0.000055085093,0.0002711761,0.00021727069,0.6947689,0.009362461,0.24491742,0.04973752,0.000033899873],"about_ca_topic_score_codex":0.003199571,"about_ca_topic_score_gemma":0.0071427925,"teacher_disagreement_score":0.015745332,"about_ca_system_score_codex":0.0006121472,"about_ca_system_score_gemma":0.0005899393,"threshold_uncertainty_score":0.0526734},"labels":[],"label_agreement":null},{"id":"W3079396048","doi":"","title":"Distance-Two Coloring of Barnette Graphs.","year":2018,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science","score_opus":0.03704036719867936,"score_gpt":0.3021818451341628,"score_spread":0.2651414779354834,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3079396048","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33896524,0.0016334071,0.37136137,0.0046897037,0.0014987449,0.00029146217,0.002235901,0.0010078299,0.27831647],"genre_scores_gemma":[0.77972585,0.00081970444,0.15005189,0.0011902966,0.0002480344,0.00022645039,0.0027376898,0.00041697262,0.06458321],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99887794,0.0003553254,0.000051406492,0.00022937178,0.00025323467,0.00023266945],"domain_scores_gemma":[0.9954751,0.0020640288,0.0003476181,0.0005304576,0.0007851837,0.0007975903],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076110853,0.00057514646,0.00066370843,0.001484304,0.0026745535,0.0026582617,0.0014576453,0.0013325645,0.013147663],"category_scores_gemma":[0.006394744,0.0006427443,0.00062760303,0.0015226491,0.0018633566,0.0032883813,0.002510417,0.0026012894,0.0025384813],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029345305,0.00010694762,0.0009584762,0.00017927086,0.000028713277,0.00019809594,0.0004996112,0.0042535006,0.0034540226,0.9539065,0.012976398,0.023145095],"study_design_scores_gemma":[0.00008323621,0.0000417848,0.0009983545,0.000067225956,0.000031636377,0.00034977475,0.00048463038,0.019523228,0.0022568216,0.9540423,0.022087285,0.000033734832],"about_ca_topic_score_codex":0.003538816,"about_ca_topic_score_gemma":0.0054854234,"teacher_disagreement_score":0.013147663,"about_ca_system_score_codex":0.0015244016,"about_ca_system_score_gemma":0.00097241614,"threshold_uncertainty_score":0.04398328},"labels":[],"label_agreement":null},{"id":"W3164099491","doi":"","title":"Covering Points with Pairs of Concentric Disks.","year":2020,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Concentric; Computer science; Geometry; Mathematics","score_opus":0.03095064521175248,"score_gpt":0.224095522346871,"score_spread":0.19314487713511852,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3164099491","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10317883,0.0018237414,0.8396444,0.0003427521,0.00058674585,0.0002589013,0.00053238025,0.0012959469,0.05233629],"genre_scores_gemma":[0.57956004,0.0010664045,0.39718047,0.00011916307,0.00016547374,0.00024028735,0.0010069303,0.0003537595,0.02030751],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99887127,0.00026291612,0.00008699755,0.00025020752,0.0004004097,0.0001280359],"domain_scores_gemma":[0.99861944,0.0004312663,0.00015096975,0.00042463804,0.00024065678,0.00013301271],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056568126,0.00082140975,0.00096606737,0.001402336,0.001089416,0.0015470984,0.0014281212,0.001193895,0.0095799],"category_scores_gemma":[0.005544327,0.0007257423,0.0006722638,0.0014408105,0.0011350223,0.0021058826,0.0045662005,0.0010397607,0.0043951417],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013543833,0.00016420025,0.004207214,0.0007629942,0.00012702093,0.0016049539,0.0014655784,0.06196207,0.03240588,0.3569246,0.026226897,0.5127942],"study_design_scores_gemma":[0.00024013342,0.00073551637,0.00288828,0.0003433761,0.00013969652,0.0061333347,0.0012542019,0.31719342,0.05732161,0.43748322,0.1761446,0.00012253146],"about_ca_topic_score_codex":0.0007446344,"about_ca_topic_score_gemma":0.0005876357,"teacher_disagreement_score":0.0095799,"about_ca_system_score_codex":0.0004138667,"about_ca_system_score_gemma":0.0003876954,"threshold_uncertainty_score":0.032047927},"labels":[],"label_agreement":null},{"id":"W3164322801","doi":"","title":"External Exploration of a Convex Polygon.","year":2020,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Regular polygon; Polygon (computer graphics); Computer science; Mathematics; Geometry; Telecommunications","score_opus":0.07268516792617138,"score_gpt":0.2614421747228599,"score_spread":0.18875700679668853,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3164322801","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1583162,0.00087434053,0.7548927,0.0006714138,0.00019469073,0.00021834271,0.0007692535,0.002053811,0.0820092],"genre_scores_gemma":[0.82594013,0.00039340122,0.15204225,0.00012298797,0.000037888647,0.000099386336,0.0008124555,0.000701145,0.019850327],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997602,0.000049461134,0.00000767019,0.000048060956,0.000093391696,0.00004125804],"domain_scores_gemma":[0.99960417,0.00019031829,0.000024690005,0.00007542716,0.000046195106,0.00005916936],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023130303,0.0005181847,0.0005789511,0.0004498462,0.0006217764,0.0011506524,0.0007124171,0.0006601775,0.009681941],"category_scores_gemma":[0.0015333637,0.0003517505,0.0005582468,0.00039906605,0.0008946924,0.001020077,0.0033832737,0.0007283669,0.0013163439],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014631237,0.00023483501,0.004010137,0.0006635589,0.000117697724,0.0029107293,0.0014091552,0.5246444,0.047039587,0.1097332,0.025505459,0.28226817],"study_design_scores_gemma":[0.000039567993,0.00011120234,0.0005665457,0.0000892582,0.000021081023,0.00065593433,0.000289019,0.9365929,0.008949516,0.033146877,0.019516192,0.000021987753],"about_ca_topic_score_codex":0.0015487316,"about_ca_topic_score_gemma":0.0020528573,"teacher_disagreement_score":0.009681941,"about_ca_system_score_codex":0.0002609551,"about_ca_system_score_gemma":0.00041240302,"threshold_uncertainty_score":0.032389343},"labels":[],"label_agreement":null},{"id":"W3164360850","doi":"","title":"Minimum Ply Covering of Points with Convex Shapes.","year":2020,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Regular polygon; Computer science; Combinatorics; Mathematics; Geometry","score_opus":0.032863458709418585,"score_gpt":0.22728231669365648,"score_spread":0.19441885798423789,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3164360850","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29043296,0.001118459,0.67806584,0.00051206764,0.00011831475,0.00016002961,0.0014267814,0.0007750917,0.027390495],"genre_scores_gemma":[0.7695144,0.00062612846,0.21284671,0.00009496597,0.000073076386,0.0001769811,0.0022663248,0.0005124965,0.01388887],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99940467,0.00012434741,0.000031874235,0.000092925635,0.000245627,0.00010041603],"domain_scores_gemma":[0.9985844,0.00067619316,0.0001393575,0.00027750648,0.00017234514,0.0001501068],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003904851,0.0007904567,0.0011282337,0.00096923095,0.00071568583,0.0012834931,0.0010124597,0.0011125279,0.008240504],"category_scores_gemma":[0.0058541717,0.00065888424,0.00064587296,0.000768917,0.0007781123,0.0017905682,0.0029363197,0.0010826678,0.0014282207],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00168884,0.00024843749,0.006244971,0.00104947,0.00017545497,0.00091750186,0.00093682023,0.38769478,0.04370597,0.1584438,0.03148077,0.36741322],"study_design_scores_gemma":[0.000089221234,0.00041022277,0.0047720014,0.00013525183,0.000051985087,0.0012126381,0.00051666325,0.7985623,0.02075212,0.15400618,0.019454883,0.000036488942],"about_ca_topic_score_codex":0.0010818692,"about_ca_topic_score_gemma":0.001095405,"teacher_disagreement_score":0.008240504,"about_ca_system_score_codex":0.00047809872,"about_ca_system_score_gemma":0.00036045891,"threshold_uncertainty_score":0.027567208},"labels":[],"label_agreement":null},{"id":"W3174457827","doi":"","title":"Simultaneous Visibility Representations of Undirected Pairs of Graphs.","year":2020,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; University of British Columbia","funders":"","keywords":"Visibility; Combinatorics; Vertex (graph theory); Visibility graph; Representation (politics); Mathematics; Undirected graph; Enhanced Data Rates for GSM Evolution; Graph; Discrete mathematics; Computer science; Geometry; Artificial intelligence; Physics; Optics","score_opus":0.03468051167596801,"score_gpt":0.26695648007855466,"score_spread":0.23227596840258666,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3174457827","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26981306,0.00041931713,0.7177936,0.0006576251,0.000087846725,0.00030902002,0.0009496969,0.0009824712,0.008987431],"genre_scores_gemma":[0.8096429,0.00014196614,0.18672493,0.00010939641,0.000045021137,0.00013224475,0.0012418394,0.00014714691,0.001814654],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974606,0.0005951921,0.00017437195,0.00087419676,0.00052431924,0.00037133452],"domain_scores_gemma":[0.9925068,0.0039478582,0.0011433866,0.0015529295,0.00047632732,0.00037259678],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001294106,0.0008317604,0.0009560784,0.0010346974,0.0009041448,0.0023571867,0.0018861925,0.002030929,0.004376615],"category_scores_gemma":[0.010746896,0.0008887478,0.0020658318,0.0014555695,0.0016184973,0.0075386167,0.003232162,0.002317847,0.00055629323],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016834891,0.00054962124,0.005853339,0.0010306397,0.00022487123,0.0018391326,0.0022331956,0.2897806,0.047298525,0.37065476,0.007308583,0.27154326],"study_design_scores_gemma":[0.00013009134,0.000394197,0.0012578313,0.00013587844,0.000109867,0.0009990182,0.0008740995,0.4934426,0.022810252,0.4728343,0.006928634,0.00008320956],"about_ca_topic_score_codex":0.0014108529,"about_ca_topic_score_gemma":0.001469035,"teacher_disagreement_score":0.004376615,"about_ca_system_score_codex":0.0010458805,"about_ca_system_score_gemma":0.0008713947,"threshold_uncertainty_score":0.014641225},"labels":[],"label_agreement":null},{"id":"W3175012788","doi":"","title":"Massively winning configurations in the convex grabbing game on the plane","year":2021,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Convex hull; Combinatorics; Regular polygon; Convex body; Cutting-plane method; Mathematics; Point (geometry); Set (abstract data type); Hull; Plane (geometry); Convex combination; Discrete mathematics; Computer science; Mathematical optimization; Convex optimization; Geometry; Engineering; Integer programming","score_opus":0.05902740392706114,"score_gpt":0.28885181292854883,"score_spread":0.2298244090014877,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3175012788","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80823106,0.00025138087,0.13909961,0.0009454071,0.0000458736,0.00012771695,0.00036940956,0.000267158,0.05066243],"genre_scores_gemma":[0.9591816,0.00018204235,0.032519512,0.00010856435,0.000019264184,0.00013760358,0.00029534302,0.00009795782,0.0074581364],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987463,0.00041915855,0.00005437021,0.0001846893,0.00022297144,0.00037249638],"domain_scores_gemma":[0.9982653,0.00082636485,0.00017293077,0.0001312991,0.000105187726,0.0004989094],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008907851,0.0009010676,0.0012860947,0.0010259632,0.0025880544,0.0033197098,0.0015500955,0.0017013726,0.0076471153],"category_scores_gemma":[0.0042935046,0.00083488855,0.00057385175,0.0010449209,0.0031390644,0.0038046604,0.0034204228,0.0016612239,0.001062571],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00060984906,0.00009443955,0.0012975393,0.00007941951,0.000043947966,0.00059557706,0.0005635676,0.054517306,0.0056926943,0.92565614,0.002510355,0.00833912],"study_design_scores_gemma":[0.00015171843,0.00009277059,0.00065331644,0.000029382407,0.000021964473,0.00019282533,0.0005059056,0.15660396,0.002240796,0.83704466,0.002420988,0.00004176313],"about_ca_topic_score_codex":0.0021882267,"about_ca_topic_score_gemma":0.0029926253,"teacher_disagreement_score":0.0076471153,"about_ca_system_score_codex":0.0014452594,"about_ca_system_score_gemma":0.0006613211,"threshold_uncertainty_score":0.025582194},"labels":[],"label_agreement":null},{"id":"W3202043921","doi":"","title":"An Acrophobic Guard Watchtower Problem on Terrains.","year":2021,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Guard (computer science); Computer science; Computer security; Programming language","score_opus":0.029826325630256632,"score_gpt":0.27213839133728307,"score_spread":0.24231206570702643,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3202043921","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4339057,0.0017819303,0.47430745,0.003967986,0.00052847125,0.0004927815,0.0036351497,0.0010982516,0.0802823],"genre_scores_gemma":[0.8593422,0.0007506835,0.10660146,0.00028571373,0.00009294698,0.00010759882,0.0022748616,0.00021839241,0.030326203],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997335,0.00006330207,0.0000091852,0.00006665785,0.000047585272,0.00007979574],"domain_scores_gemma":[0.99941814,0.00033406928,0.000048270656,0.000049908005,0.00003902662,0.00011053373],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028805088,0.0007546976,0.0008712328,0.00037288162,0.0011281847,0.0010876552,0.0012508776,0.002169349,0.0115217455],"category_scores_gemma":[0.0018502834,0.00047226346,0.0005466979,0.000652735,0.0008762748,0.001961263,0.0018689024,0.0013112619,0.0007068346],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011664563,0.00043726325,0.0029057304,0.0005843748,0.00012175769,0.001818932,0.0005146283,0.70743364,0.0062894523,0.111956425,0.056500632,0.11027063],"study_design_scores_gemma":[0.00014729625,0.00017872105,0.0010975653,0.000081412385,0.00004289886,0.0003431511,0.0007494931,0.90789366,0.0015331489,0.07246744,0.015436912,0.000028210434],"about_ca_topic_score_codex":0.015081763,"about_ca_topic_score_gemma":0.016276216,"teacher_disagreement_score":0.015081763,"about_ca_system_score_codex":0.00060332107,"about_ca_system_score_gemma":0.0007586093,"threshold_uncertainty_score":0.03854412},"labels":[],"label_agreement":null},{"id":"W3202544316","doi":"","title":"Convex Bichromatic Quadrangulation of Point Sets with Minimum Color Flips.","year":2021,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Regular polygon; Mathematics; Point (geometry); Combinatorics; Geometry","score_opus":0.021661916448564238,"score_gpt":0.2412595239077216,"score_spread":0.21959760745915735,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3202544316","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16665931,0.0004734779,0.7953522,0.00027316264,0.00013915812,0.00022489598,0.0012343026,0.000507505,0.035135955],"genre_scores_gemma":[0.6802719,0.00036794334,0.30263764,0.00015773695,0.000039285558,0.00020579077,0.0019139553,0.00044817384,0.013957546],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999559,0.00011682984,0.000021673535,0.00008197538,0.00014267217,0.00007788165],"domain_scores_gemma":[0.9993636,0.00023139834,0.00006207822,0.00011309302,0.00015911131,0.000070694296],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038024396,0.0006874524,0.0009459051,0.0007183083,0.00052416895,0.0014040613,0.001379622,0.00064691965,0.011580136],"category_scores_gemma":[0.0025558844,0.00045694553,0.0005438513,0.0007849318,0.0008196372,0.0011483796,0.0020215858,0.0013235492,0.0017578639],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012198329,0.00021463163,0.0018388546,0.00051581004,0.000073227675,0.00029349246,0.00045052991,0.30716196,0.020594927,0.33780327,0.019871116,0.30996227],"study_design_scores_gemma":[0.000093802315,0.00019812817,0.00075013266,0.00007957711,0.000023717348,0.00028956067,0.0002670462,0.8337035,0.00672331,0.14736935,0.010460405,0.00004151701],"about_ca_topic_score_codex":0.0030646927,"about_ca_topic_score_gemma":0.003583037,"teacher_disagreement_score":0.011580136,"about_ca_system_score_codex":0.00058295584,"about_ca_system_score_gemma":0.00052534515,"threshold_uncertainty_score":0.038739443},"labels":[],"label_agreement":null},{"id":"W41445881","doi":"","title":"Tight Bounds for Point Recolouring.","year":2006,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Sequence (biology); Point (geometry); Set (abstract data type); Upper and lower bounds; Matching (statistics); Mathematics; Combinatorics; Iterative method; Computer science; Algorithm; Geometry; Mathematical analysis; Statistics","score_opus":0.020996723931934257,"score_gpt":0.23916707461103823,"score_spread":0.21817035067910398,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W41445881","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009655711,0.0062440075,0.9533096,0.0017596326,0.0004382046,0.0002489529,0.00040840876,0.002806239,0.025129149],"genre_scores_gemma":[0.18710785,0.004547721,0.7829901,0.0014880411,0.0008098183,0.0008551346,0.0016548681,0.0035175825,0.017028796],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98398054,0.0031054462,0.0007572129,0.0030530584,0.006520512,0.0025833054],"domain_scores_gemma":[0.88531506,0.078187935,0.004168612,0.023623815,0.0063919695,0.0023125808],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012296453,0.0046035354,0.003912316,0.005122628,0.0034946117,0.007012108,0.01091117,0.0049555115,0.032520782],"category_scores_gemma":[0.088683,0.0030789403,0.004063193,0.0061849975,0.005336104,0.02454897,0.01322447,0.016105073,0.012216766],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0022283746,0.00074431504,0.0037739067,0.0023557807,0.00030070377,0.0005055659,0.0014951285,0.17486252,0.01748117,0.3158958,0.042618,0.43773875],"study_design_scores_gemma":[0.0001811353,0.00048925425,0.0018748906,0.00070021575,0.0003208935,0.00093952,0.00039753903,0.54148984,0.017653823,0.37018698,0.06558567,0.000180275],"about_ca_topic_score_codex":0.004165635,"about_ca_topic_score_gemma":0.0056284717,"teacher_disagreement_score":0.032520782,"about_ca_system_score_codex":0.004306381,"about_ca_system_score_gemma":0.002441219,"threshold_uncertainty_score":0.10879284},"labels":[],"label_agreement":null},{"id":"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Polygon (computer graphics); Boundary (topology); Computer science; Schedule; Visibility polygon; Combinatorics; Simple polygon; Mathematics; Monotone polygon; Geometry; Computer network","score_opus":0.031280114097779504,"score_gpt":0.26983664738800195,"score_spread":0.23855653329022244,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4452397","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7809427,0.00035637678,0.1759182,0.00030939103,0.0000356784,0.00021405835,0.0012571589,0.00039539006,0.040571082],"genre_scores_gemma":[0.94369984,0.00024045893,0.04571828,0.000056106142,0.000026302989,0.00023109875,0.0017748714,0.000120151824,0.008132946],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99921083,0.00013009537,0.00008311538,0.00018728162,0.00018893852,0.00019975952],"domain_scores_gemma":[0.9942502,0.002215744,0.0017698023,0.00053538947,0.00035629372,0.00087258517],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037824194,0.00050346775,0.00057960564,0.0011339632,0.0009107761,0.0021437937,0.0014597352,0.0008271387,0.005946515],"category_scores_gemma":[0.005996424,0.000556646,0.0007571371,0.000992468,0.0021741684,0.0027097513,0.0014818755,0.0008090432,0.0006993475],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020136836,0.00032680543,0.02927495,0.00062127225,0.00013612633,0.0041138735,0.0041705715,0.10085156,0.032746892,0.76889026,0.0059566083,0.05089751],"study_design_scores_gemma":[0.00036894126,0.0008696392,0.013411826,0.0002355125,0.00015515441,0.0058843805,0.0030701233,0.32823116,0.018751984,0.5960042,0.032860104,0.00015702541],"about_ca_topic_score_codex":0.002281561,"about_ca_topic_score_gemma":0.0012758273,"teacher_disagreement_score":0.005946515,"about_ca_system_score_codex":0.00056605553,"about_ca_system_score_gemma":0.00053200027,"threshold_uncertainty_score":0.01989311},"labels":[],"label_agreement":null},{"id":"W6119617","doi":"","title":"Determining the robustness of sensor barriers","year":2010,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Robustness (evolution); Wireless sensor network; Computer science; Redundancy (engineering); Topology (electrical circuits); Distributed computing; Real-time computing; Computer network; Mathematics; Combinatorics","score_opus":0.015291326085902857,"score_gpt":0.22846644950841782,"score_spread":0.21317512342251496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6119617","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37860125,0.0011388593,0.6111173,0.0007108971,0.00007873488,0.00007397382,0.0005719043,0.00050391647,0.007203124],"genre_scores_gemma":[0.95810163,0.00047122987,0.03999307,0.000061367566,0.000044031553,0.00008349428,0.0003476849,0.000100280704,0.0007972298],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965025,0.0009737309,0.00023051944,0.0007430111,0.001124466,0.0004257038],"domain_scores_gemma":[0.963424,0.023737956,0.0053198496,0.004324064,0.0020011852,0.0011930292],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031137974,0.0009820468,0.0012654304,0.0017097539,0.0006902263,0.001682048,0.002019427,0.0014953905,0.0015300201],"category_scores_gemma":[0.04590238,0.0007662662,0.00090513256,0.00081290863,0.0020965133,0.003482736,0.0036274046,0.0012403635,0.00033375347],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006458767,0.00006832235,0.010332431,0.00032875518,0.00017255142,0.00054720696,0.0003816803,0.83837175,0.027802506,0.08098471,0.0014956975,0.038868517],"study_design_scores_gemma":[0.000030448766,0.00027116027,0.003908918,0.00006828318,0.00004934316,0.00046428913,0.00026762977,0.9075927,0.011836771,0.07301872,0.002432882,0.000058869457],"about_ca_topic_score_codex":0.0008767583,"about_ca_topic_score_gemma":0.00041072696,"teacher_disagreement_score":0.0031137974,"about_ca_system_score_codex":0.0008908393,"about_ca_system_score_gemma":0.00063223543,"threshold_uncertainty_score":0.016467512},"labels":[],"label_agreement":null},{"id":"W94935907","doi":"","title":"The spanning ratio of the Delaunay triangulation is greater than pi/2.","year":2009,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Carleton University","funders":"","keywords":"Delaunay triangulation; Combinatorics; Euclidean minimum spanning tree; Mathematics; Spanning tree; Position (finance); Discrete mathematics; Kruskal's algorithm","score_opus":0.02840429613742914,"score_gpt":0.2476286008519265,"score_spread":0.21922430471449736,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W94935907","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37769008,0.0028820494,0.5456024,0.0028009636,0.00023814615,0.00018839847,0.0010534582,0.0007709183,0.06877363],"genre_scores_gemma":[0.9199849,0.0012165138,0.07471527,0.00022939146,0.00011653076,0.00019054583,0.00047447687,0.00013306265,0.0029392408],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976598,0.0004193076,0.00013511909,0.00051281333,0.00087870064,0.00039435405],"domain_scores_gemma":[0.9940276,0.0034787953,0.0011414642,0.00058170856,0.0004458543,0.00032444388],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016293544,0.0005842962,0.0007644938,0.0009782289,0.0010183987,0.0014597226,0.0009553523,0.0012567976,0.0053893835],"category_scores_gemma":[0.023127688,0.00049191853,0.0005233305,0.0014346807,0.0012723628,0.0021475654,0.0019127205,0.0008810397,0.0014346848],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012261021,0.00016400887,0.028123569,0.0010968081,0.00032138109,0.0041566766,0.0015529426,0.14185145,0.07545332,0.4833893,0.017448891,0.24521558],"study_design_scores_gemma":[0.0001975543,0.0008558345,0.019183632,0.0003952814,0.00020589076,0.015617716,0.0016588839,0.4028867,0.060775876,0.4495111,0.048554126,0.00015745581],"about_ca_topic_score_codex":0.0005843961,"about_ca_topic_score_gemma":0.00036032475,"teacher_disagreement_score":0.0053893835,"about_ca_system_score_codex":0.0005418706,"about_ca_system_score_gemma":0.0004304666,"threshold_uncertainty_score":0.018029332},"labels":[],"label_agreement":null}]}