{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":115,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":115,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12","author_layer_release":"2026-06-26"},"query_hash":"d040838b2c79","filters":{"venue":"Canadian Conference on Computational Geometry"}},"results":[{"id":"W2140984273","doi":"","title":"Planar Case of the Maximum Box and Related Problems","year":2003,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Mathematical Approximation and Integration","field":"Mathematics","cited_by":26,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"","keywords":"Cardinality (data modeling); Planar; Combinatorics; Mathematics; Extension (predicate logic); Planar graph; Approximation algorithm; Discrete mathematics; Computer science; Graph","authors":[{"name":"Ying Liu","is_ca":false},{"name":"Mikhail Nediak","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04753680883092413,"gpt":0.273286509639956,"spread":0.2257497008090319,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001623557,0.0006878744,0.001370836,0.0009290024,0.000806781,0.001508732,0.001412446,0.001827346,0.005556429],"category_scores_gemma":[0.01103564,0.0005838149,0.0009287626,0.001566487,0.001969967,0.003783962,0.002654548,0.001764434,0.000512795],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000785025,"about_ca_system_score_gemma":0.0007163092,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001603572,"about_ca_topic_score_gemma":0.0009391861,"domain_scores_codex":[0.9984023,0.0004971231,0.00005752417,0.0003269681,0.0004514161,0.0002647048],"domain_scores_gemma":[0.9966073,0.002269487,0.0004659931,0.000271779,0.0001978394,0.0001876679],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0004105499,0.0001032419,0.001417684,0.0003246039,0.00005309808,0.0004126029,0.0002557924,0.3231106,0.002441498,0.6167657,0.005642276,0.04906236],"study_design_scores_gemma":[0.0001005119,0.00009034011,0.0007250519,0.00006419167,0.0000244677,0.0005728707,0.0001923781,0.6466812,0.002264222,0.3398804,0.009368129,0.00003618948],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1384155,0.001325476,0.838894,0.001260955,0.00009424537,0.0001034892,0.0004525077,0.0003030151,0.01915078],"genre_scores_gemma":[0.5899149,0.00142862,0.3928869,0.0003166822,0.0002831675,0.0003367871,0.0009709828,0.0001828401,0.01367905],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005556429,"threshold_uncertainty_score":0.01858813,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W94935907","doi":"","title":"The spanning ratio of the Delaunay triangulation is greater than pi/2.","year":2009,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University; Carleton University","funders":"","keywords":"Delaunay triangulation; Combinatorics; Euclidean minimum spanning tree; Mathematics; Spanning tree; Position (finance); Discrete mathematics; Kruskal's algorithm","authors":[{"name":"Prosenjit Bose","is_ca":true},{"name":"Luc Devroye","is_ca":true},{"name":"Maarten Löffler","is_ca":false},{"name":"Jack Snoeyink","is_ca":false},{"name":"Vishal Verma","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02840429613742914,"gpt":0.2476286008519265,"spread":0.2192243047144974,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001629354,0.0005842962,0.0007644938,0.0009782289,0.001018399,0.001459723,0.0009553523,0.001256798,0.005389384],"category_scores_gemma":[0.02312769,0.0004919185,0.0005233305,0.001434681,0.001272363,0.002147565,0.001912721,0.0008810397,0.001434685],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005418706,"about_ca_system_score_gemma":0.0004304666,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005843961,"about_ca_topic_score_gemma":0.0003603247,"domain_scores_codex":[0.9976598,0.0004193076,0.0001351191,0.0005128133,0.0008787006,0.0003943541],"domain_scores_gemma":[0.9940276,0.003478795,0.001141464,0.0005817086,0.0004458543,0.0003244439],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001226102,0.0001640089,0.02812357,0.001096808,0.0003213811,0.004156677,0.001552943,0.1418515,0.07545332,0.4833893,0.01744889,0.2452156],"study_design_scores_gemma":[0.0001975543,0.0008558345,0.01918363,0.0003952814,0.0002058908,0.01561772,0.001658884,0.4028867,0.06077588,0.4495111,0.04855413,0.0001574558],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3776901,0.002882049,0.5456024,0.002800964,0.0002381462,0.0001883985,0.001053458,0.0007709183,0.06877363],"genre_scores_gemma":[0.9199849,0.001216514,0.07471527,0.0002293915,0.0001165308,0.0001905458,0.0004744769,0.0001330627,0.002939241],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005389384,"threshold_uncertainty_score":0.01802933,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2102775149","doi":"","title":"Zipper Unfoldings of Polyhedral Complexes","year":2010,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Advanced Materials and Mechanics","field":"Engineering","cited_by":18,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Zipper; Polyhedron; Tetrahedron; Enhanced Data Rates for GSM Evolution; Combinatorics; Planar; Regular polygon; Hamiltonian (control theory); Mathematics; Topology (electrical circuits); Crystallography; Computer science; Geometry; Algorithm; Chemistry; Computer graphics (images); Artificial intelligence","authors":[{"name":"Erik D. DemaineMartin","is_ca":false},{"name":"L. Demaine","is_ca":false},{"name":"Anna Lubiw","is_ca":true},{"name":"Jonah L. Shallit","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01254562570413728,"gpt":0.2210780970289299,"spread":0.2085324713247927,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002359022,0.0002860973,0.0002528061,0.0004217343,0.0007949959,0.0006795203,0.0003946844,0.0004510343,0.006900857],"category_scores_gemma":[0.001642584,0.0002294459,0.0003830642,0.0003127306,0.001189545,0.001868716,0.001051069,0.0007660394,0.0006131226],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004416807,"about_ca_system_score_gemma":0.000157539,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003700661,"about_ca_topic_score_gemma":0.0004731292,"domain_scores_codex":[0.9997541,0.00003693467,0.000008454297,0.00005835229,0.00008250444,0.00005970413],"domain_scores_gemma":[0.9995167,0.0001556395,0.00006655708,0.0001325411,0.00005039939,0.00007804267],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001588555,0.00008624097,0.002254194,0.0001439803,0.00002760926,0.001070148,0.001228012,0.1064579,0.04062592,0.7992435,0.003012483,0.04569136],"study_design_scores_gemma":[0.00002740681,0.0001424212,0.001557046,0.00004363216,0.00001314003,0.0005615429,0.000693197,0.2183819,0.02515978,0.7319226,0.02145451,0.00004274921],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6901295,0.0005018058,0.2723353,0.0003408272,0.00008489109,0.00008469879,0.0002559954,0.00053881,0.0357281],"genre_scores_gemma":[0.9567086,0.0002248896,0.03583917,0.00008322814,0.00002573954,0.00004837051,0.0002220956,0.0002297187,0.006618219],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.006900857,"threshold_uncertainty_score":0.02308565,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2123788968","doi":"","title":"Computing the Straight Skeleton of a Monotone Polygon in O(nlogn) Time","year":2010,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Windsor","funders":"","keywords":"Monotone polygon; Simple polygon; Polygon (computer graphics); Combinatorics; Polygon covering; Skeleton (computer programming); Computational geometry; Simple (philosophy); Rectilinear polygon; Time complexity; Mathematics; Computer science; Algorithm; Geometry","authors":[{"name":"Gautam K. Das","is_ca":false},{"name":"Asish Mukhopadhyay","is_ca":true},{"name":"Subhas C. Nandy","is_ca":false},{"name":"Sangameswar Patil","is_ca":false},{"name":"S. Venugopal Rao","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01171564186456953,"gpt":0.236447379208302,"spread":0.2247317373437325,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001885562,0.0008794156,0.0007055434,0.0007563312,0.0005111429,0.0007997711,0.001215533,0.0006182371,0.01405757],"category_scores_gemma":[0.001599566,0.0003652523,0.0006451498,0.0008847838,0.0004863187,0.001405044,0.001133711,0.0005242234,0.00323101],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003532767,"about_ca_system_score_gemma":0.0007080073,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001827104,"about_ca_topic_score_gemma":0.004670914,"domain_scores_codex":[0.9996374,0.00003272029,0.00002395339,0.00009284884,0.0001606561,0.00005247126],"domain_scores_gemma":[0.999428,0.0002153993,0.00007068557,0.0001259372,0.0001120797,0.00004785822],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0004039028,0.0001564882,0.002404178,0.0005832798,0.00007920396,0.0005397578,0.0003145592,0.06393049,0.07102049,0.01425204,0.01383919,0.8324764],"study_design_scores_gemma":[0.0002290145,0.0005157507,0.002871709,0.00006211071,0.00007105351,0.001398914,0.0005411475,0.8442459,0.05407025,0.05756403,0.03835843,0.00007167098],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03685471,0.0001023355,0.9495826,0.000131077,0.00004848291,0.0001922634,0.0003190403,0.005449001,0.007320533],"genre_scores_gemma":[0.1894904,0.0001677111,0.8022118,0.00004976753,0.00002918019,0.0001398447,0.001616649,0.000528005,0.005766575],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01405757,"threshold_uncertainty_score":0.04702729,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2188440933","doi":"","title":"Optimal Bounds on Theta-Graphs: More is not Always Better.","year":2012,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Combinatorics; Mathematics; Upper and lower bounds; Discrete mathematics","authors":[{"name":"Prosenjit Bose","is_ca":true},{"name":"Jean-Lou De Carufel","is_ca":true},{"name":"Pat Morin","is_ca":true},{"name":"André van Renssen","is_ca":true},{"name":"Sander Verdonschot","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05157835567815482,"gpt":0.3078867761724915,"spread":0.2563084204943367,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003110102,0.001728195,0.001414939,0.001655555,0.001301502,0.003168692,0.001943293,0.001556763,0.01327339],"category_scores_gemma":[0.01977351,0.0008093304,0.001066167,0.002234929,0.001862949,0.01121202,0.002442483,0.003109092,0.001950637],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001633915,"about_ca_system_score_gemma":0.0007744326,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009538734,"about_ca_topic_score_gemma":0.001410791,"domain_scores_codex":[0.9974324,0.0007565444,0.00009693293,0.0004797556,0.0005703898,0.0006640381],"domain_scores_gemma":[0.9885324,0.006977972,0.001080421,0.001895073,0.000751542,0.0007625469],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0008455239,0.0003239738,0.00486889,0.001040351,0.0002531179,0.0002990712,0.0003902774,0.1313229,0.01439351,0.6846283,0.03432234,0.1273118],"study_design_scores_gemma":[0.000067847,0.0002069652,0.002186406,0.0002333831,0.0001079548,0.0007405174,0.0003691048,0.1370068,0.005072394,0.8366683,0.01728071,0.0000594722],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3572111,0.03491267,0.4637974,0.01827321,0.00131118,0.0001111809,0.001940093,0.001838947,0.1206044],"genre_scores_gemma":[0.9020146,0.00646697,0.08231663,0.002527785,0.0006715013,0.000103505,0.0008767075,0.0006335141,0.004388781],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01327339,"threshold_uncertainty_score":0.04440391,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2112429204","doi":"","title":"Optimistic Shortest Paths on Uncertain Terrains","year":2004,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"K shortest path routing; Shortest path problem; Euclidean shortest path; Yen's algorithm; Shortest Path Faster Algorithm; Constrained Shortest Path First; Terrain; Computer science; Geodesic; Longest path problem; Path (computing); Widest path problem; Pathfinding; Mathematical optimization; Algorithm; Mathematics; Dijkstra's algorithm; Theoretical computer science; Geography; Graph; Geometry","authors":[{"name":"Chris Gray","is_ca":true},{"name":"William Evans","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04657298695031612,"gpt":0.2724671985039716,"spread":0.2258942115536555,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009507055,0.000920005,0.001132809,0.0009792518,0.001113911,0.001715208,0.001616915,0.001194583,0.002766616],"category_scores_gemma":[0.006843198,0.0006408133,0.000704784,0.001978296,0.001391824,0.004620207,0.002645808,0.001361346,0.0003495659],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001476381,"about_ca_system_score_gemma":0.000772101,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003729565,"about_ca_topic_score_gemma":0.003603267,"domain_scores_codex":[0.9985932,0.000312126,0.00009645136,0.0002214753,0.0005629775,0.0002138498],"domain_scores_gemma":[0.9973518,0.001576343,0.000457418,0.0002549962,0.000211975,0.0001475336],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001189454,0.00001334642,0.0005451082,0.0001453785,0.00003084945,0.0003113332,0.0002145217,0.8421938,0.001143342,0.1316427,0.002342877,0.02129789],"study_design_scores_gemma":[0.00001863657,0.00002951329,0.0003055972,0.00002600131,0.00001669387,0.00016141,0.0001719581,0.7422941,0.0007718028,0.2492483,0.006930778,0.00002522223],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.06082353,0.001957669,0.9256698,0.0009705955,0.00009407482,0.00007647317,0.0008582442,0.0004203775,0.009129122],"genre_scores_gemma":[0.7980772,0.003213662,0.1912098,0.0001739089,0.000167379,0.0002098894,0.001322527,0.0001545004,0.00547116],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003729565,"threshold_uncertainty_score":0.01071191,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2151289047","doi":"","title":"The Bichromatic Rectangle Problem in High Dimensions.","year":2009,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Rectangle; Set (abstract data type); Point (geometry); Combinatorics; Space (punctuation); Algorithm; Mathematics; Computer science; Discrete mathematics; Geometry","authors":[{"name":"Jonathan Backer","is_ca":true},{"name":"Julian Keil","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01562046188455601,"gpt":0.2340983481156226,"spread":0.2184778862310666,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001638763,0.001125486,0.001709532,0.001067412,0.001124047,0.001962638,0.002111573,0.00137996,0.01084427],"category_scores_gemma":[0.006432194,0.000850652,0.001145748,0.002470031,0.001124601,0.004160159,0.003674666,0.001737009,0.00254747],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006230206,"about_ca_system_score_gemma":0.0008866789,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002595629,"about_ca_topic_score_gemma":0.003579925,"domain_scores_codex":[0.997815,0.0007957706,0.000147919,0.0004599178,0.0004910773,0.0002902997],"domain_scores_gemma":[0.9969079,0.001795721,0.0003342943,0.0005633981,0.0002301371,0.0001684942],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00114504,0.0003408369,0.003878642,0.001771814,0.0002256216,0.0008043262,0.0009453709,0.2549805,0.01241921,0.2680296,0.05445205,0.4010069],"study_design_scores_gemma":[0.0002717508,0.0002174103,0.00160537,0.0001586259,0.00007292244,0.001101047,0.0008102227,0.6134108,0.007158255,0.344516,0.03060522,0.00007245079],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05110046,0.001869174,0.9294891,0.0009003273,0.0001380499,0.0002385977,0.001268142,0.001096543,0.01389953],"genre_scores_gemma":[0.1732756,0.0009537746,0.8128972,0.0003358129,0.0001087936,0.0003807649,0.002494982,0.0004193738,0.009133661],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01084427,"threshold_uncertainty_score":0.03627765,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2127519911","doi":"","title":"Tiling Layouts with Dominoes","year":2004,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":9,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Colored; Domino; Tile; Mathematics; Hexagonal tiling; Set (abstract data type); Combinatorics; Square tiling; Tessellation (computer graphics); Plane (geometry); Unit square; Discrete mathematics; Computer science; Grid; Geometry","authors":[{"name":"Chris Worman","is_ca":true},{"name":"Mark D. Watson","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01965923282744558,"gpt":0.2392991311069203,"spread":0.2196398982794747,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000910079,0.0009938697,0.001305314,0.0008024693,0.001426194,0.00316391,0.001884404,0.00136397,0.009637857],"category_scores_gemma":[0.008610165,0.0009374718,0.001617469,0.001533645,0.00197623,0.005919065,0.002979008,0.002116319,0.0008428202],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002400377,"about_ca_system_score_gemma":0.0008116327,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00409742,"about_ca_topic_score_gemma":0.003909732,"domain_scores_codex":[0.9980289,0.0004712954,0.0001294058,0.0005845274,0.0003932217,0.0003925589],"domain_scores_gemma":[0.9924995,0.005498384,0.0006430519,0.0007678929,0.0002511631,0.0003399733],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000383963,0.0002299929,0.002678005,0.0005298474,0.0001128124,0.00071409,0.000635518,0.681436,0.007359251,0.2477448,0.005771282,0.05240441],"study_design_scores_gemma":[0.0001176779,0.0001105028,0.0004518298,0.00004631584,0.00004207388,0.00033905,0.0002471253,0.6012409,0.003376217,0.3843389,0.009655823,0.00003351512],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3413557,0.001837135,0.6235784,0.001916969,0.0002015325,0.0003797734,0.001636695,0.001378401,0.02771544],"genre_scores_gemma":[0.7131847,0.001249247,0.271369,0.0003466034,0.0001595674,0.0004346767,0.002093233,0.0003546608,0.0108082],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009637857,"threshold_uncertainty_score":0.03224188,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2172037166","doi":"","title":"Approximation Algorithms for the Discrete Piercing Set Problem for Unit Disks","year":2011,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Mechanical Behavior of Composites","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of New Brunswick","funders":"","keywords":"Approximation algorithm; Set (abstract data type); Unit (ring theory); RADIUS; Algorithm; Simple (philosophy); Mathematics; Time complexity; Combinatorics; Constant (computer programming); Running time; Polynomial; Factor (programming language); Computer science; Discrete mathematics; Mathematical analysis","authors":[{"name":"Minati De","is_ca":false},{"name":"Gautam K. Das","is_ca":true},{"name":"Subhas C. Nandy","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1020232372391494,"gpt":0.2829609674534197,"spread":0.1809377302142703,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002095925,0.001638251,0.00179114,0.001032102,0.000953727,0.002175872,0.004002139,0.001872621,0.007676248],"category_scores_gemma":[0.009647629,0.0006360309,0.001357479,0.00266837,0.001205593,0.004656432,0.002605577,0.003260394,0.001761397],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002447095,"about_ca_system_score_gemma":0.00156496,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004550579,"about_ca_topic_score_gemma":0.004303642,"domain_scores_codex":[0.9981926,0.0003760817,0.0001018042,0.0003727956,0.0006263126,0.000330396],"domain_scores_gemma":[0.9964025,0.002191739,0.0002373499,0.0006778414,0.000333934,0.0001567241],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0005791103,0.0002795951,0.001162144,0.0003748957,0.0001007169,0.0001283812,0.0003006519,0.6639423,0.003450638,0.1281152,0.01107078,0.1904955],"study_design_scores_gemma":[0.00005153129,0.00003744858,0.00007733366,0.0000115545,0.00001059356,0.00004875016,0.00004607822,0.9488341,0.0007917894,0.04838929,0.001692111,0.00000953685],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0164317,0.0005030163,0.9780058,0.0003361313,0.00005784785,0.00007689452,0.0001270898,0.0007453758,0.003716182],"genre_scores_gemma":[0.2105617,0.0006728233,0.7821863,0.0001882439,0.0001249107,0.0002789831,0.0008401719,0.0003285755,0.004818328],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007676248,"threshold_uncertainty_score":0.02567959,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2182520915","doi":"","title":"Exact Algorithms and APX-Hardness Results for Geometric Set Cover","year":2011,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Cover (algebra); Mathematics; Vertex cover; Monotone polygon; Rectangle; Set cover problem; Unit square; Approximation algorithm; Time complexity; Algorithm; Line segment; Computational geometry; Square (algebra); Set (abstract data type); Computer science; Geometry","authors":[{"name":"Timothy M. Chan","is_ca":true},{"name":"Elyot Grant","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0761986086665031,"gpt":0.2723684118473931,"spread":0.19616980318089,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017073,0.001635462,0.001904079,0.001330115,0.00152522,0.0038982,0.004183603,0.002492302,0.01085313],"category_scores_gemma":[0.01021631,0.000991828,0.002246971,0.003547771,0.001945439,0.00863725,0.003670435,0.004033482,0.00169672],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003429004,"about_ca_system_score_gemma":0.001698565,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002235943,"about_ca_topic_score_gemma":0.002266398,"domain_scores_codex":[0.9974912,0.0004866913,0.0001354844,0.000595105,0.0007691326,0.0005224257],"domain_scores_gemma":[0.9926893,0.005016669,0.0004907309,0.001244358,0.0002775503,0.0002813669],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0008634324,0.0005511714,0.002787593,0.001084907,0.000198913,0.0002983625,0.0006783224,0.5176022,0.005844653,0.2822325,0.02001786,0.1678401],"study_design_scores_gemma":[0.0001457508,0.0001194521,0.0005747005,0.00006807135,0.00004872743,0.000275196,0.0001540882,0.628812,0.002321183,0.361046,0.006402327,0.00003257178],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08590189,0.001751602,0.8788495,0.003617311,0.0001837881,0.0003480507,0.001626385,0.002228855,0.02549254],"genre_scores_gemma":[0.5019375,0.001767316,0.4793244,0.0006977416,0.0004949982,0.0008814289,0.003663249,0.000723376,0.01051007],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01085313,"threshold_uncertainty_score":0.03630739,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1590814900","doi":"","title":"Space-Efficient Algorithms for Klee's Measure Problem.","year":2005,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Measure (data warehouse); Combinatorics; Mathematics; Plane (geometry); Space (punctuation); Binary logarithm; Set (abstract data type); Computational geometry; Degenerate energy levels; Time complexity; Algorithm; Discrete mathematics; Geometry; Computer science; Physics; Data mining","authors":[{"name":"Eric Chen","is_ca":true},{"name":"Timothy M. Chan","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03807973057664759,"gpt":0.2652294900331958,"spread":0.2271497594565482,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002128243,0.002176172,0.002005103,0.003013393,0.001789752,0.004186657,0.004302081,0.003067507,0.01404568],"category_scores_gemma":[0.01058976,0.0009409501,0.002840959,0.004469515,0.001677488,0.009118775,0.00587829,0.00345957,0.004694309],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002432949,"about_ca_system_score_gemma":0.002523059,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002815017,"about_ca_topic_score_gemma":0.004242614,"domain_scores_codex":[0.9964887,0.0006527763,0.0002982516,0.0007792881,0.001198745,0.0005822205],"domain_scores_gemma":[0.9954928,0.002245202,0.0003406756,0.001264785,0.0004543402,0.0002020547],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0006519881,0.0006186074,0.001702479,0.0009342141,0.0001942938,0.0002709294,0.000666732,0.09468513,0.009189081,0.2524244,0.04910506,0.5895571],"study_design_scores_gemma":[0.0003800989,0.0001682918,0.0006334833,0.00007517591,0.00007774606,0.0006300648,0.0003864508,0.4806746,0.00795311,0.4879807,0.02095548,0.00008484146],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0122591,0.0009072089,0.97284,0.001178921,0.0001450691,0.0002213815,0.0003999335,0.003455063,0.008593182],"genre_scores_gemma":[0.1007865,0.0005121451,0.8920903,0.0002793265,0.0001357403,0.0004032705,0.001686818,0.0005589443,0.003546866],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01404568,"threshold_uncertainty_score":0.04698747,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2145677964","doi":"","title":"A Genetic Algorithm for the Minimum Tetrahedralization of a Convex Polyhedron.","year":2003,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Polyhedron; Regular polygon; Convex polytope; Tetrahedron; Partition (number theory); Combinatorics; Mathematics; Algorithm; Mathematical optimization; Computer science; Convex set; Convex optimization; Geometry","authors":[{"name":"Ian Hsieh","is_ca":true},{"name":"Kiat-Choong Chen","is_ca":true},{"name":"Cao An Wang","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0257945182085321,"gpt":0.2495050461420711,"spread":0.223710527933539,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006813533,0.001014772,0.001059478,0.001196764,0.0008375911,0.0007697484,0.00148049,0.001609178,0.00309956],"category_scores_gemma":[0.002775263,0.0006126232,0.001095989,0.001308225,0.0009754239,0.000839234,0.001162553,0.001579634,0.0007564613],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001064961,"about_ca_system_score_gemma":0.001574028,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005826775,"about_ca_topic_score_gemma":0.004779457,"domain_scores_codex":[0.9996319,0.00008009043,0.00001574597,0.00008454655,0.0001427459,0.00004497141],"domain_scores_gemma":[0.9994831,0.0002883683,0.00004876175,0.00004960698,0.00009862176,0.00003152869],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00006080056,0.0000855028,0.0006160483,0.0001187887,0.00006586521,0.0001259495,0.000154809,0.8163257,0.005417235,0.03252399,0.004544535,0.1399608],"study_design_scores_gemma":[0.00002970372,0.00004110293,0.0001109635,0.00002289899,0.00001691086,0.00005505239,0.00002438905,0.9827085,0.001052612,0.01237657,0.003549683,0.00001163374],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006773816,0.0002292493,0.989318,0.0001095787,0.00005350852,0.00009545877,0.00005386733,0.0003222299,0.003044227],"genre_scores_gemma":[0.089257,0.0003531993,0.9060994,0.0001103235,0.00002963086,0.0004680972,0.0002636327,0.000147757,0.003270824],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005826775,"threshold_uncertainty_score":0.01158571,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2185561909","doi":"","title":"The spanning ratio of the Delaunay triangulation is greater than = 2","year":2009,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University; Carleton University","funders":"","keywords":"Delaunay triangulation; Combinatorics; Euclidean minimum spanning tree; Mathematics; Spanning tree; Shortest path problem; Pitteway triangulation; Discrete mathematics; Graph; Kruskal's algorithm","authors":[{"name":"Prosenjit Bose","is_ca":true},{"name":"Luc Devroye","is_ca":true},{"name":"Maarten Löpffler","is_ca":false},{"name":"Jack Snoeyink","is_ca":false},{"name":"Vishal Verma","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02716924511353718,"gpt":0.2463687711943489,"spread":0.2191995260808117,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00226403,0.000640618,0.001293055,0.00103387,0.001122775,0.001737969,0.001105213,0.001509455,0.004835184],"category_scores_gemma":[0.02922978,0.0006603883,0.0006053426,0.001418308,0.001553528,0.002818565,0.002681125,0.0009896882,0.0009866478],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006145633,"about_ca_system_score_gemma":0.0004249221,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004980139,"about_ca_topic_score_gemma":0.0003124129,"domain_scores_codex":[0.9966667,0.0007940793,0.0002114937,0.0007217495,0.001091291,0.0005146353],"domain_scores_gemma":[0.9883156,0.007644433,0.001780097,0.001003147,0.0007088102,0.0005479426],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001994886,0.0001962819,0.03329822,0.001182881,0.0004126719,0.004255931,0.001608045,0.2376548,0.06603311,0.4215195,0.0169576,0.2148861],"study_design_scores_gemma":[0.0002736811,0.0007285662,0.01544683,0.000303509,0.0001512503,0.01195241,0.001032274,0.492674,0.03292356,0.4146675,0.02967035,0.0001761159],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4919333,0.002523319,0.4615963,0.002737433,0.000196132,0.0001442227,0.0008443826,0.0006880478,0.03933675],"genre_scores_gemma":[0.9327598,0.0009020528,0.06315748,0.0002682637,0.0001377475,0.0001550154,0.000376678,0.0001427899,0.002100275],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004835184,"threshold_uncertainty_score":0.01617533,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4452397","doi":"","title":"Characterization of Polygons Searchable by a Boundary 1-Searcher.","year":2006,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Lethbridge","funders":"","keywords":"Polygon (computer graphics); Boundary (topology); Computer science; Schedule; Visibility polygon; Combinatorics; Simple polygon; Mathematics; Monotone polygon; Geometry; Computer network","authors":[{"name":"Tsunehiko Kameda","is_ca":false},{"name":"John Z. Zhang","is_ca":true},{"name":"Masafumi Yamashita","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0312801140977795,"gpt":0.2698366473880019,"spread":0.2385565332902224,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003782419,0.0005034677,0.0005796056,0.001133963,0.0009107761,0.002143794,0.001459735,0.0008271387,0.005946515],"category_scores_gemma":[0.005996424,0.000556646,0.0007571371,0.000992468,0.002174168,0.002709751,0.001481876,0.0008090432,0.0006993475],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005660555,"about_ca_system_score_gemma":0.0005320003,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002281561,"about_ca_topic_score_gemma":0.001275827,"domain_scores_codex":[0.9992108,0.0001300954,0.00008311538,0.0001872816,0.0001889385,0.0001997595],"domain_scores_gemma":[0.9942502,0.002215744,0.001769802,0.0005353895,0.0003562937,0.0008725852],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.002013684,0.0003268054,0.02927495,0.0006212723,0.0001361263,0.004113873,0.004170571,0.1008516,0.03274689,0.7688903,0.005956608,0.05089751],"study_design_scores_gemma":[0.0003689413,0.0008696392,0.01341183,0.0002355125,0.0001551544,0.005884381,0.003070123,0.3282312,0.01875198,0.5960042,0.0328601,0.0001570254],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7809427,0.0003563768,0.1759182,0.000309391,0.0000356784,0.0002140584,0.001257159,0.0003953901,0.04057108],"genre_scores_gemma":[0.9436998,0.0002404589,0.04571828,0.00005610614,0.00002630299,0.0002310987,0.001774871,0.0001201518,0.008132946],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005946515,"threshold_uncertainty_score":0.01989311,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2124089227","doi":"","title":"An Algorithm for the MaxMin Area Triangulation of a Convex Polygon","year":2003,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Minimum-weight triangulation; Polygon (computer graphics); Convex polygon; Triangulation; Point set triangulation; Mathematics; Pitteway triangulation; Star-shaped polygon; Polygon covering; Combinatorics; Regular polygon; Diagonal; Rectilinear polygon; Algorithm; Computer science; Delaunay triangulation; Simple polygon; Convex optimization; Convex set; Bowyer–Watson algorithm; Geometry","authors":[{"name":"Julian Keil","is_ca":true},{"name":"Tzvetalin S. Vassilev","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0404761246826628,"gpt":0.2720561725661819,"spread":0.2315800478835191,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006591119,0.001122458,0.001217999,0.001351225,0.001379477,0.001488094,0.002248787,0.001170778,0.01351559],"category_scores_gemma":[0.002328908,0.001068779,0.001173082,0.00184098,0.0008490943,0.002032833,0.002957008,0.001873224,0.003442356],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001003182,"about_ca_system_score_gemma":0.00155633,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003029341,"about_ca_topic_score_gemma":0.00537107,"domain_scores_codex":[0.999201,0.0001044712,0.00004711553,0.0001686583,0.000373584,0.0001051668],"domain_scores_gemma":[0.9992959,0.0002312102,0.00006275035,0.0001369515,0.0002220983,0.00005105374],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003074185,0.0001067336,0.0007690645,0.0003251673,0.00005734611,0.0002340608,0.0003764354,0.1680429,0.01325194,0.0681024,0.02605216,0.7223743],"study_design_scores_gemma":[0.0001459668,0.0001162553,0.0003398915,0.00006115263,0.00003185599,0.0004095521,0.0002073309,0.8769741,0.01087614,0.06720507,0.04358085,0.0000518397],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001702228,0.00006073121,0.9948447,0.00009044343,0.00002919272,0.00007147523,0.00008142862,0.0009039065,0.002215902],"genre_scores_gemma":[0.02659741,0.00009239968,0.9701522,0.00003768292,0.00002069224,0.0001798222,0.0003516673,0.0002920606,0.002276036],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01351559,"threshold_uncertainty_score":0.04521418,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W172707356","doi":"","title":"Realization of Degree 10 Minimum Spanning Trees in 3-Space.","year":2006,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Realization (probability); Spanning tree; Minimum spanning tree; Degree (music); Minimum degree spanning tree; Computer science; Space (punctuation); Mathematics; Combinatorics; Physics; Statistics","authors":[{"name":"James King","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04623352070635248,"gpt":0.287654651805582,"spread":0.2414211310992296,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001438288,0.0003336377,0.0003836217,0.0002388651,0.0008391748,0.001014895,0.0007125668,0.0008105237,0.01003509],"category_scores_gemma":[0.0008982162,0.0002666947,0.0004658274,0.0004605493,0.0004738965,0.001008929,0.001149488,0.000929671,0.002075853],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004754328,"about_ca_system_score_gemma":0.0004159356,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009924155,"about_ca_topic_score_gemma":0.00215491,"domain_scores_codex":[0.9997699,0.00003616984,0.00001215902,0.00003755986,0.00006421669,0.00007998812],"domain_scores_gemma":[0.9996653,0.00007586318,0.00004938089,0.00006611486,0.00004500522,0.00009844539],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0005589442,0.0002147207,0.00154616,0.0003262304,0.0000571641,0.001266853,0.0008211291,0.05729633,0.05548421,0.7967224,0.01756649,0.06813931],"study_design_scores_gemma":[0.0002606468,0.0002939606,0.00250479,0.00009952324,0.00005914235,0.001389513,0.001056998,0.1859362,0.02926836,0.7095886,0.06946239,0.00007988997],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5934158,0.0005692308,0.3195007,0.001649293,0.0003045035,0.0001229641,0.001773317,0.001143997,0.08152019],"genre_scores_gemma":[0.8961459,0.0002414331,0.09406993,0.0001092282,0.00002250002,0.00009575598,0.001050942,0.00008724312,0.008177047],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01003509,"threshold_uncertainty_score":0.03357077,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2783355325","doi":"","title":"Upward Order-Preserving 8-Grid-Drawings of Binary Trees.","year":2017,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Binary number; Binary tree; Grid; Computer graphics (images); Algorithm; Mathematics; Geometry; Arithmetic","authors":[{"name":"Thérèse Biedl","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05160737549822516,"gpt":0.3132392146103923,"spread":0.2616318391121672,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003093878,0.0004765368,0.0005582852,0.000886787,0.001015179,0.002064991,0.001131616,0.0008526715,0.01514453],"category_scores_gemma":[0.002553548,0.0006550464,0.0005000691,0.001341247,0.0006972326,0.001890607,0.001570207,0.001690467,0.004495679],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006204652,"about_ca_system_score_gemma":0.0005952808,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003018011,"about_ca_topic_score_gemma":0.005288927,"domain_scores_codex":[0.9993449,0.0001405189,0.00004247527,0.0001062108,0.0002164315,0.0001494282],"domain_scores_gemma":[0.9985582,0.0003236716,0.0001492711,0.0004933441,0.0003196584,0.0001559131],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0004948758,0.0002466635,0.002286978,0.0004182335,0.00005119576,0.0006988444,0.00121585,0.02817439,0.03068365,0.6709729,0.03703597,0.2277204],"study_design_scores_gemma":[0.0001538195,0.0001296346,0.002666868,0.0001651726,0.00006868491,0.001077794,0.00100046,0.08055376,0.02365647,0.7656163,0.1248554,0.00005566519],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2564084,0.0007649839,0.5932435,0.0008858457,0.000402507,0.0003892673,0.004106096,0.002796914,0.1410025],"genre_scores_gemma":[0.600454,0.0009223974,0.3392378,0.0002824687,0.00007835653,0.0002434806,0.005034345,0.0009746649,0.05277246],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01514453,"threshold_uncertainty_score":0.05066347,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2148022401","doi":"","title":"When can a graph form an orthogonal polyhedron","year":2004,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Polyhedron; Vertex (graph theory); Combinatorics; Mathematics; Regular polygon; Integer points in convex polyhedra; Convex polytope; Graph; Convex set; Algorithm; Geometry; Convex optimization; Linear programming","authors":[{"name":"Thérèse Biedl","is_ca":true},{"name":"Burkay Genç","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02769961273247762,"gpt":0.2479184367730683,"spread":0.2202188240405907,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000908639,0.0005201644,0.0008326212,0.000992398,0.001063496,0.003183524,0.0008687737,0.001997428,0.01204461],"category_scores_gemma":[0.01028513,0.0005198682,0.0007700928,0.001124508,0.002851849,0.009986276,0.001460442,0.001893256,0.00302441],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009631536,"about_ca_system_score_gemma":0.0006359502,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002252325,"about_ca_topic_score_gemma":0.002186672,"domain_scores_codex":[0.9980021,0.0003821947,0.0001143429,0.000645364,0.0004636289,0.000392373],"domain_scores_gemma":[0.9958247,0.001520686,0.0004094867,0.001321261,0.0005774748,0.0003463959],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002758536,0.0001676458,0.002445658,0.0003695519,0.0000635098,0.0004398774,0.0009530251,0.01868694,0.004103972,0.7910032,0.02411392,0.1573769],"study_design_scores_gemma":[0.00002647839,0.00005773812,0.0006760833,0.00008688988,0.0000194538,0.0003302371,0.0008204125,0.03219436,0.002348583,0.92203,0.04137195,0.00003790178],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.175022,0.001199604,0.7200281,0.01069552,0.0009689428,0.0003855056,0.002502246,0.00179185,0.08740626],"genre_scores_gemma":[0.7503501,0.001645553,0.2224792,0.001300036,0.0005026698,0.0002752827,0.002619547,0.0008166887,0.02001096],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01204461,"threshold_uncertainty_score":0.04029322,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2400709422","doi":"","title":"On the Inverse Beacon Attraction Region of a Point.","year":2015,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Queen's University","funders":"","keywords":"Attraction; Polygon (computer graphics); Monotone polygon; Simple polygon; Inverse; Trajectory; Boundary (topology); Obstacle; Mathematics; Regular polygon; Simple (philosophy); Point (geometry); Set (abstract data type); Combinatorics; Computer science; Topology (electrical circuits); Mathematical analysis; Physics; Geometry; Geography; Telecommunications","authors":[{"name":"Bahram Kouhestani","is_ca":true},{"name":"David Rappaport","is_ca":true},{"name":"Kai Salomaa","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0822544231741283,"gpt":0.260772768141475,"spread":0.1785183449673468,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008386081,0.0006575258,0.0007569765,0.001501703,0.0004765077,0.0009778612,0.00113831,0.0005768962,0.003119268],"category_scores_gemma":[0.005743119,0.0004005299,0.0008454061,0.001062899,0.001552762,0.002002469,0.002126351,0.00126703,0.001063191],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005760177,"about_ca_system_score_gemma":0.0004972063,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002916876,"about_ca_topic_score_gemma":0.001760153,"domain_scores_codex":[0.9995629,0.0001067644,0.00001585558,0.00009429984,0.0001714251,0.00004863653],"domain_scores_gemma":[0.9985881,0.0009458391,0.0001051098,0.0001394224,0.0001659898,0.00005550425],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0005127316,0.00006708349,0.002999021,0.0003292847,0.000052942,0.0004366332,0.0005778652,0.5798256,0.01342887,0.2424112,0.005112845,0.1542458],"study_design_scores_gemma":[0.00003799178,0.0001274767,0.000740271,0.00006122317,0.00002245838,0.000306289,0.00006652509,0.9060227,0.00549612,0.07491429,0.01217313,0.00003159603],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01887148,0.0005908858,0.976181,0.00006770117,0.00003220614,0.00006337136,0.00009835725,0.0003747608,0.003720392],"genre_scores_gemma":[0.4039371,0.0009316807,0.5901391,0.0001043097,0.00009386196,0.0002321966,0.0004882685,0.0003015407,0.003771915],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003119268,"threshold_uncertainty_score":0.01043499,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2398258650","doi":"","title":"Time-Windowed Closest Pair","year":2015,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Quadtree; Dimension (graph theory); Point (geometry); Interval (graph theory); Set (abstract data type); Computer science; Binary logarithm; Computational geometry; Data structure; Algorithm; Word (group theory); Combinatorics; Constant (computer programming); Mathematics; Theoretical computer science; Geometry","authors":[{"name":"Timothy M. Chan","is_ca":true},{"name":"Simon Pratt","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04467829215851175,"gpt":0.2542515261167814,"spread":0.2095732339582696,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008029431,0.001046636,0.001917829,0.002853713,0.001029208,0.001558263,0.003258568,0.001162187,0.008113219],"category_scores_gemma":[0.008794039,0.0007311281,0.0006798548,0.005020685,0.0007330928,0.00491389,0.00414484,0.001244447,0.004478222],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007244046,"about_ca_system_score_gemma":0.001156297,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001741745,"about_ca_topic_score_gemma":0.00239898,"domain_scores_codex":[0.9982205,0.0002014673,0.0001879774,0.0006032973,0.0006357718,0.0001508676],"domain_scores_gemma":[0.9970407,0.0006296636,0.0003692441,0.001252108,0.0005191394,0.000189071],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.002615848,0.0004787665,0.004016136,0.0006486384,0.0001916368,0.0005700061,0.0007223298,0.1383612,0.02632535,0.05249997,0.0321894,0.7413808],"study_design_scores_gemma":[0.0002446864,0.0007795147,0.001122349,0.0001016988,0.0000753543,0.001344356,0.0004900265,0.8214514,0.03791596,0.09280913,0.04353888,0.0001266313],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04201671,0.001428601,0.947085,0.000319915,0.0003543682,0.0002610978,0.001935753,0.003092157,0.003506432],"genre_scores_gemma":[0.3009835,0.0009435351,0.6855288,0.0002088095,0.0002124822,0.0003626705,0.003976847,0.0003397896,0.007443664],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008113219,"threshold_uncertainty_score":0.02714139,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2294012348","doi":"","title":"Almost Online Square Packing","year":2014,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Competitive analysis; Logarithm; Square (algebra); Online algorithm; Advice (programming); Oracle; Packing problems; Computer science; Algorithm; Sequence (biology); Mathematics; Mathematical optimization; Upper and lower bounds","authors":[{"name":"Shahin Kamali","is_ca":true},{"name":"Alejandro López-Ortíz","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0393397463407652,"gpt":0.2710083307283992,"spread":0.231668584387634,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006110059,0.0009141614,0.001439969,0.0004206151,0.0006545075,0.001436065,0.002277441,0.001359662,0.008988945],"category_scores_gemma":[0.004180145,0.0004781309,0.0006245429,0.001745161,0.0008927032,0.003613195,0.002173016,0.001157638,0.002534169],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007273881,"about_ca_system_score_gemma":0.0008366088,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001248089,"about_ca_topic_score_gemma":0.001411556,"domain_scores_codex":[0.9986426,0.0002689254,0.0000889033,0.000310536,0.0004737929,0.0002151646],"domain_scores_gemma":[0.9970859,0.001020979,0.0002631986,0.001132475,0.0003116034,0.0001858107],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001249344,0.000496963,0.002173614,0.0006202772,0.00008924649,0.0003912081,0.0002654962,0.2666479,0.02342195,0.08088178,0.02515098,0.5986112],"study_design_scores_gemma":[0.00008208506,0.0003468182,0.0005677747,0.00002876506,0.00002546276,0.0005396815,0.00008743986,0.8825554,0.01172951,0.08974824,0.01425963,0.00002918744],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05856784,0.0009944744,0.9218136,0.0005070148,0.0001962956,0.0001371103,0.0004429074,0.003234904,0.01410586],"genre_scores_gemma":[0.4527389,0.0007268763,0.5286656,0.0004892232,0.0002230518,0.0002053314,0.001402833,0.0005500699,0.01499812],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008988945,"threshold_uncertainty_score":0.03007102,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W130561602","doi":"","title":"Morphing Planar Graph Drawings.","year":2007,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Morphing; Planar graph; Graph drawing; Mathematical proof; Outerplanar graph; Computer science; Lattice graph; Planar straight-line graph; Vertex (graph theory); Graph; Mathematics; Combinatorics; Line graph; Computer graphics (images); Pathwidth; Geometry; Voltage graph","authors":[{"name":"Anna Lubiw","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02609874843551627,"gpt":0.2523889027367248,"spread":0.2262901543012085,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005452764,0.0011665,0.0005456164,0.001949152,0.0006437181,0.001681626,0.001195822,0.001074627,0.02652773],"category_scores_gemma":[0.00454315,0.0008071994,0.001134184,0.001817287,0.001375945,0.004056081,0.002872046,0.002036943,0.006055676],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000702401,"about_ca_system_score_gemma":0.0003628394,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008367455,"about_ca_topic_score_gemma":0.001216689,"domain_scores_codex":[0.9991971,0.0001408912,0.00004094787,0.0002022742,0.0003570891,0.00006167802],"domain_scores_gemma":[0.9990006,0.0003849767,0.00009111586,0.0003414198,0.0001200028,0.0000618401],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00008530281,0.00003441835,0.0005359303,0.0005481204,0.00003390488,0.0002998381,0.0005378937,0.01847308,0.007164338,0.5317729,0.04631355,0.3942007],"study_design_scores_gemma":[0.00003743482,0.00004603569,0.0004352472,0.0001584913,0.00003861886,0.001341381,0.0002103003,0.05645799,0.00609773,0.6393802,0.2957454,0.00005121352],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008478205,0.00340709,0.9237989,0.000879871,0.0006691963,0.0001906887,0.00128156,0.006000159,0.05529435],"genre_scores_gemma":[0.2131677,0.007725921,0.7313514,0.0009706194,0.0005692647,0.0003877061,0.004405138,0.003499479,0.03792279],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02652773,"threshold_uncertainty_score":0.0887441,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2295704388","doi":"","title":"The Possible Hull of Imprecise Points","year":2011,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Convex hull; Hull; Polygon (computer graphics); Simple (philosophy); Simple polygon; Point (geometry); Mathematics; Regular polygon; Combinatorics; Set (abstract data type); Plane (geometry); Orthogonal convex hull; Mathematical optimization; Algorithm; Computer science; Geometry; Convex body; Engineering","authors":[{"name":"Jeff Sember","is_ca":true},{"name":"William Evans","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04666611281999775,"gpt":0.2427950566893644,"spread":0.1961289438693667,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002546436,0.00103941,0.001622995,0.002103003,0.001871961,0.005093742,0.002704898,0.001837703,0.00500528],"category_scores_gemma":[0.01442169,0.001668661,0.002361658,0.002179636,0.003746737,0.008442233,0.004905464,0.002549579,0.000746483],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009837272,"about_ca_system_score_gemma":0.0007597933,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002280331,"about_ca_topic_score_gemma":0.002182667,"domain_scores_codex":[0.9956151,0.001036988,0.0002712936,0.0008354064,0.001937665,0.0003034389],"domain_scores_gemma":[0.9954433,0.002618022,0.0004454728,0.0008416977,0.0004422624,0.0002091714],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0006197563,0.00007328275,0.004023694,0.0005142304,0.0001688611,0.00198082,0.001431076,0.694643,0.004129633,0.2037374,0.003037765,0.08564046],"study_design_scores_gemma":[0.00004403455,0.0001129809,0.001173881,0.0002429023,0.00007158599,0.0006988586,0.0008949103,0.6836819,0.004553028,0.2990682,0.009371373,0.00008637027],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05124408,0.0005693728,0.9408705,0.0004163991,0.00004131434,0.00006333401,0.0005097621,0.0002048354,0.006080494],"genre_scores_gemma":[0.542295,0.0007838417,0.4516125,0.00007840963,0.00008567484,0.00018452,0.001430666,0.0001805157,0.003348912],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005093742,"threshold_uncertainty_score":0.01674432,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2400285273","doi":"","title":"Point Location in Well-Shaped Meshes Using Jump-and-Walk","year":2011,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Jump; Polygon mesh; Constant (computer programming); Point (geometry); Computer science; Nearest neighbour; Random walk; Algorithm; Statistical physics; Mathematics; Geometry; Physics; Artificial intelligence; Computer graphics (images); Statistics","authors":[{"name":"Jean-Lou De Carufel","is_ca":true},{"name":"Craig Dillabaugh","is_ca":true},{"name":"Anil Maheshwari","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0670509323113462,"gpt":0.2543895345018169,"spread":0.1873386021904707,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001579579,0.001130891,0.001259839,0.0006255693,0.0007244018,0.001647917,0.002836314,0.001938319,0.003451069],"category_scores_gemma":[0.01097863,0.0004884735,0.000780073,0.001433426,0.001678164,0.005076941,0.003237405,0.001193856,0.0009831121],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009269062,"about_ca_system_score_gemma":0.0009063036,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005373137,"about_ca_topic_score_gemma":0.006386756,"domain_scores_codex":[0.997189,0.000659542,0.0001939207,0.0004003047,0.001216288,0.0003409958],"domain_scores_gemma":[0.9918303,0.00493742,0.0004301822,0.001780495,0.0006464116,0.0003753056],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.003621574,0.0004914441,0.006510216,0.0006136332,0.0002311649,0.0007854021,0.001134805,0.6300569,0.06894685,0.05514649,0.007589477,0.2248721],"study_design_scores_gemma":[0.00006553928,0.0001115749,0.0002065671,0.000007665823,0.0000154804,0.0000618743,0.0000825953,0.9758251,0.009135896,0.01352269,0.0009464556,0.00001859257],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1589621,0.0004479261,0.8278606,0.0003153415,0.00006050855,0.0001653352,0.0002566766,0.007240656,0.004690882],"genre_scores_gemma":[0.673968,0.0002098101,0.3223014,0.00008385298,0.00002291613,0.0001257283,0.000683152,0.0005323152,0.002072749],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005373137,"threshold_uncertainty_score":0.011545,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2406062735","doi":"","title":"Edge Guards for Polyhedra in 3-Space.","year":2012,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"","keywords":"Polyhedron; Enhanced Data Rates for GSM Evolution; Computer science; Space (punctuation); Combinatorics; Mathematics; Artificial intelligence; Operating system","authors":[{"name":"Javier Cano","is_ca":false},{"name":"Csaba D. Tóth","is_ca":true},{"name":"Jorge Urrutia","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04038020508012392,"gpt":0.2786134197567494,"spread":0.2382332146766254,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000481722,0.0005114636,0.0006546938,0.0007090954,0.0006825455,0.00115626,0.001324071,0.0006563187,0.01448752],"category_scores_gemma":[0.002579131,0.0004185833,0.0006238284,0.0007723067,0.001019175,0.001578355,0.002552117,0.001666552,0.004316235],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003424881,"about_ca_system_score_gemma":0.000688735,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002155268,"about_ca_topic_score_gemma":0.00429889,"domain_scores_codex":[0.9996045,0.00005936721,0.00003473344,0.00005354319,0.0001780323,0.00006991166],"domain_scores_gemma":[0.9992545,0.0002577768,0.00004746614,0.0002277549,0.0001525191,0.00006005113],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0007352103,0.0001394902,0.001365038,0.0004936724,0.0000275579,0.0002665966,0.0004898161,0.0463826,0.01050236,0.4631235,0.03750475,0.4389693],"study_design_scores_gemma":[0.0001523144,0.0002160826,0.0007697173,0.0003131025,0.00003757016,0.0004348208,0.0004455337,0.310647,0.01970258,0.5148528,0.1523744,0.00005403968],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02079854,0.0006282579,0.9596273,0.0001951764,0.0002968224,0.0001097129,0.001109249,0.004179357,0.01305548],"genre_scores_gemma":[0.2891607,0.0007366413,0.688924,0.0002207367,0.0001055126,0.0002259709,0.003159669,0.001985086,0.01548178],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01448752,"threshold_uncertainty_score":0.04846555,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2295337288","doi":"","title":"Weighted Region Problem in Arrangement of Lines","year":2013,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Shortest path problem; Hull; Bounded function; Combinatorics; Boundary (topology); Path (computing); Line segment; Mathematics; Line (geometry); Computer science; Geometry; Graph; Mathematical analysis","authors":[{"name":"Amin Gheibi","is_ca":true},{"name":"Anil Maheshwari","is_ca":true},{"name":"Jörg-Rüdiger Sack","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02737413182330261,"gpt":0.2344320232530039,"spread":0.2070578914297013,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007254442,0.0009826898,0.001267931,0.001004964,0.0009576169,0.001478527,0.002041579,0.001580209,0.009123257],"category_scores_gemma":[0.004240043,0.0009197657,0.0009938973,0.002206394,0.0009037606,0.005528641,0.002291875,0.001411685,0.002096727],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008298446,"about_ca_system_score_gemma":0.0006094054,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002434109,"about_ca_topic_score_gemma":0.001790775,"domain_scores_codex":[0.9986011,0.0003355001,0.00009609223,0.0004198681,0.0003370428,0.0002103671],"domain_scores_gemma":[0.9984671,0.0006969918,0.0002954503,0.0002333238,0.0002010577,0.000106011],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000711458,0.0001772492,0.001642293,0.0006855252,0.0001054701,0.001024334,0.0006050558,0.6401384,0.01771329,0.1718402,0.008081216,0.1572755],"study_design_scores_gemma":[0.0001065262,0.0003399116,0.0006315747,0.00007698691,0.00005182674,0.0008229141,0.0004302165,0.8073718,0.01160566,0.1507404,0.02775885,0.00006344062],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03377777,0.0003211203,0.9606655,0.0002038221,0.0000368877,0.0000926949,0.0003298307,0.0005278867,0.004044444],"genre_scores_gemma":[0.2729478,0.0007036388,0.7114088,0.00009378494,0.00006590551,0.0003489851,0.001689546,0.0004190954,0.01232252],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009123257,"threshold_uncertainty_score":0.03052038,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2605132714","doi":"","title":"Geometric Unique Set Cover on Unit Disks and Unit Squares.","year":2016,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Manitoba","funders":"","keywords":"Unit (ring theory); Cover (algebra); Set cover problem; Set (abstract data type); Computer science; Mathematics; Engineering; Programming language","authors":[{"name":"Saeed Mehrabi","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0533389688352964,"gpt":0.273573053030554,"spread":0.2202340841952576,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025769,0.0004606661,0.0009533133,0.001511413,0.001106454,0.001884396,0.0009910228,0.0008794256,0.01014257],"category_scores_gemma":[0.003947848,0.0005516147,0.0005873871,0.001176854,0.001195756,0.002030853,0.003392399,0.001475618,0.00180658],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006173304,"about_ca_system_score_gemma":0.0003546508,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001875572,"about_ca_topic_score_gemma":0.001628827,"domain_scores_codex":[0.9994252,0.0001004951,0.0000302566,0.0001037349,0.0002434826,0.00009679436],"domain_scores_gemma":[0.998884,0.000568394,0.00009195569,0.0002064372,0.0001326482,0.0001165266],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003794414,0.00006286549,0.002123828,0.0003661087,0.00006058696,0.0007080952,0.0005903749,0.05111966,0.006636761,0.7793043,0.02730974,0.1313381],"study_design_scores_gemma":[0.00005317874,0.000120996,0.002849252,0.000125291,0.00004382506,0.001878775,0.0006452978,0.1960599,0.00648057,0.7471864,0.04451111,0.00004549234],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3571832,0.006980934,0.4911486,0.00144941,0.0008610904,0.0001475315,0.001602292,0.0009197739,0.1397072],"genre_scores_gemma":[0.8622202,0.002018737,0.1038848,0.0001869413,0.0002882626,0.0001166901,0.001585124,0.0003757828,0.02932345],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01014257,"threshold_uncertainty_score":0.03393024,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2166438223","doi":"","title":"Decomposing Polygons Into Diameter Bounded Components","year":2003,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Simple polygon; Polygon (computer graphics); Polygon covering; Visibility polygon; Mathematics; Combinatorics; Bounded function; Rectilinear polygon; Heuristics; Bounding overwatch; Decomposition; Intersection (aeronautics); Point in polygon; Reduction (mathematics); Polygon mesh; Algorithm; Computer science; Monotone polygon; Mathematical optimization; Geometry; Artificial intelligence","authors":[{"name":"Chris Worman","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03263138537768494,"gpt":0.2572229821769649,"spread":0.22459159679928,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002729485,0.0008981554,0.0006979007,0.0005392303,0.0005110038,0.00136767,0.0009649778,0.0005886924,0.003551701],"category_scores_gemma":[0.001714321,0.0006161923,0.0008323995,0.0008970696,0.0007539928,0.002034223,0.002074296,0.001196242,0.0009303156],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006965442,"about_ca_system_score_gemma":0.000508296,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001284108,"about_ca_topic_score_gemma":0.001748893,"domain_scores_codex":[0.9995525,0.000053552,0.00003114856,0.0001432312,0.0001229385,0.00009656604],"domain_scores_gemma":[0.9991652,0.0002902556,0.0001484651,0.0002407001,0.00006312806,0.00009233718],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0005972388,0.0002239728,0.003462685,0.0008155358,0.00006950741,0.001376106,0.000651355,0.4886845,0.1010113,0.1662908,0.01170342,0.2251136],"study_design_scores_gemma":[0.000090031,0.0002963895,0.002293366,0.0001271149,0.0000753128,0.001653644,0.0004521676,0.7036247,0.03453035,0.2086436,0.04817586,0.00003751713],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1744897,0.001000639,0.801172,0.0005075769,0.00008845341,0.0002613119,0.0007393866,0.0008616498,0.0208792],"genre_scores_gemma":[0.4711311,0.001252208,0.5132196,0.000277424,0.0001059923,0.000270332,0.002235706,0.0002886444,0.011219],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003551701,"threshold_uncertainty_score":0.01188159,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2404508046","doi":"","title":"xy-Monotone Path Existence Queries in a Rectilinear Environment.","year":2012,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Tree traversal; Monotone polygon; Disjoint sets; Path (computing); Tree (set theory); Combinatorics; Computer science; Time complexity; Range tree; Binary logarithm; Data structure; Preprocessor; Computational geometry; Binary tree; Mathematics; Discrete mathematics; Interval tree; Algorithm; Tree structure; Artificial intelligence","authors":[{"name":"Gregory Bint","is_ca":true},{"name":"Anil Maheshwari","is_ca":true},{"name":"Michiel H. M. Smid","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03309736335871667,"gpt":0.2452450391259678,"spread":0.2121476757672511,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006925773,0.0007254895,0.00111918,0.000680351,0.001042117,0.001247536,0.001321386,0.001698417,0.01029402],"category_scores_gemma":[0.004489957,0.0007118816,0.0008409126,0.001783969,0.0007418642,0.005857053,0.002651598,0.0009432624,0.00198537],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005244691,"about_ca_system_score_gemma":0.001062254,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002785161,"about_ca_topic_score_gemma":0.005547218,"domain_scores_codex":[0.9987177,0.000210997,0.0001011248,0.000394599,0.0002756151,0.0003000228],"domain_scores_gemma":[0.9970094,0.001992203,0.0002837951,0.0004251953,0.0001692536,0.0001200727],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.006370632,0.001241964,0.01567588,0.002678653,0.0002204765,0.003297853,0.002031877,0.1670195,0.110856,0.1228642,0.08692378,0.4808192],"study_design_scores_gemma":[0.001006707,0.001704246,0.0057975,0.0001892437,0.0001637643,0.002958252,0.003025308,0.6641333,0.07707133,0.1735748,0.07019096,0.0001846654],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2899553,0.001893789,0.6595845,0.003161653,0.0001647743,0.0008121,0.01320918,0.01355029,0.01766845],"genre_scores_gemma":[0.5033297,0.0008014233,0.4733683,0.0003561754,0.00007279174,0.0003420249,0.01343045,0.0005810094,0.00771821],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01029402,"threshold_uncertainty_score":0.03443694,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2604824923","doi":"","title":"The Length of the Beacon Attraction Trajectory.","year":2016,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Underwater Vehicles and Communication Systems","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Queen's University","funders":"","keywords":"Trajectory; Attraction; Computer science; Physics; Astronomy","authors":[{"name":"Bahram Kouhestani","is_ca":true},{"name":"David Rappaport","is_ca":true},{"name":"Kai Salomaa","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02376571612090318,"gpt":0.2096249538330686,"spread":0.1858592377121654,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005714598,0.0004266642,0.0004531211,0.001475696,0.0008252945,0.001078001,0.0009476257,0.0009504755,0.007856439],"category_scores_gemma":[0.008775226,0.0003806694,0.0003384029,0.00095908,0.0007292021,0.001637073,0.001279621,0.001384202,0.002666275],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00092856,"about_ca_system_score_gemma":0.001392231,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005744519,"about_ca_topic_score_gemma":0.005031678,"domain_scores_codex":[0.9993916,0.00008318022,0.00003671034,0.0001573571,0.0002403381,0.00009085557],"domain_scores_gemma":[0.9978339,0.0007205767,0.0003295438,0.0001381134,0.0007039486,0.0002739319],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001068706,0.0001215002,0.01881748,0.0008276096,0.0001449089,0.0006690487,0.0005889898,0.2988702,0.01844773,0.2952282,0.03252977,0.3326859],"study_design_scores_gemma":[0.00009136081,0.0004059006,0.02309202,0.0005539385,0.00007960239,0.00159291,0.0008027203,0.6990063,0.01962875,0.1740415,0.08052123,0.0001836408],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1441728,0.006409502,0.7897859,0.002590267,0.001851441,0.0001939105,0.007897292,0.001980155,0.04511883],"genre_scores_gemma":[0.8624657,0.003825838,0.09006469,0.0001992106,0.0002457058,0.0002123202,0.004094345,0.0005398935,0.03835225],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007856439,"threshold_uncertainty_score":0.02628237,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2186560431","doi":"","title":"Maximum Independent Set for Interval Graphs and Trees in Space Efficient Models.","year":2014,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Interval (graph theory); Maximal independent set; Set (abstract data type); Interval graph; Combinatorics; Space (punctuation); Independent set; Mathematics; Upper and lower bounds; Discrete mathematics; Product (mathematics); Algorithm; Computer science; Pathwidth; Graph; Line graph","authors":[{"name":"Binay Bhattacharya","is_ca":true},{"name":"Minati De","is_ca":false},{"name":"Subhas C. Nandy","is_ca":false},{"name":"Sasanka Roy","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04062558458719696,"gpt":0.28570176632086,"spread":0.2450761817336631,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002755373,0.001371221,0.001916279,0.002029828,0.001229401,0.00503184,0.00430143,0.002229429,0.009010656],"category_scores_gemma":[0.01411468,0.001287947,0.002948141,0.00386958,0.001953196,0.01388379,0.003838443,0.00382282,0.001427446],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003281295,"about_ca_system_score_gemma":0.001975551,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002987363,"about_ca_topic_score_gemma":0.004091981,"domain_scores_codex":[0.996849,0.001294286,0.0001171434,0.0005665116,0.000778267,0.000394736],"domain_scores_gemma":[0.9917823,0.005883228,0.0005528178,0.00125044,0.0002397479,0.0002914254],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0006081686,0.0002843176,0.001072465,0.0005178719,0.0002368131,0.0002099144,0.0004254975,0.3593774,0.003842629,0.5483079,0.01360549,0.07151159],"study_design_scores_gemma":[0.00005016095,0.00005816469,0.0001956235,0.00003986795,0.00004363769,0.0001163359,0.00009342467,0.527191,0.001067422,0.467365,0.003760111,0.00001932227],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04586387,0.001930052,0.9353945,0.001634333,0.0001335339,0.0001783861,0.0009198505,0.001015659,0.01292973],"genre_scores_gemma":[0.6127746,0.00211951,0.3732214,0.0003369507,0.0005177758,0.0004834059,0.002061443,0.0004250748,0.008059882],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009010656,"threshold_uncertainty_score":0.03014362,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2402872817","doi":"","title":"Buttons & Scissors is NP-Complete.","year":2015,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Semantic Web and Ontologies","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Computer science","authors":[{"name":"Harrison Gregg","is_ca":false},{"name":"Jody Leonard","is_ca":false},{"name":"Aaron Santiago","is_ca":false},{"name":"Aaron Williams","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.111604466273656,"gpt":0.2840601614178798,"spread":0.1724556951442238,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002155603,0.001823625,0.003347379,0.001805853,0.005853045,0.009936414,0.003382242,0.005111394,0.06617689],"category_scores_gemma":[0.01526916,0.001722698,0.005560617,0.003748333,0.00470701,0.01813896,0.004145612,0.008532544,0.009520332],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003888388,"about_ca_system_score_gemma":0.005938622,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01320418,"about_ca_topic_score_gemma":0.02234097,"domain_scores_codex":[0.9961927,0.0006730718,0.0002825116,0.001094932,0.0009200354,0.00083679],"domain_scores_gemma":[0.9809347,0.01469566,0.0006587344,0.00147885,0.001486483,0.0007455684],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0007959447,0.0006255669,0.001730256,0.002866534,0.0004218172,0.001332718,0.0005909386,0.03055052,0.003123048,0.5319181,0.2946371,0.1314074],"study_design_scores_gemma":[0.0001949673,0.00004405157,0.0004743914,0.000139943,0.0001108985,0.0005413831,0.0004386751,0.0242387,0.00174502,0.9238668,0.04815532,0.00004983155],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.09893411,0.004739914,0.3402671,0.08001639,0.004012772,0.00197491,0.03980416,0.00800692,0.4222437],"genre_scores_gemma":[0.5107661,0.004523607,0.2388228,0.01015881,0.002385837,0.001723623,0.03586817,0.003657171,0.1920939],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.06617689,"threshold_uncertainty_score":0.2213838,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2908455634","doi":"","title":"Emanation Graph: A New t-Spanner.","year":2018,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Spanner; Computer science; Graph; Theoretical computer science; Distributed computing","authors":[{"name":"Bardia Hamedmohseni","is_ca":false},{"name":"Zahed Rahmati","is_ca":false},{"name":"Debajyoti Mondal","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03388365239077264,"gpt":0.2652970401426861,"spread":0.2314133877519134,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004303601,0.0007643939,0.0006972944,0.002201151,0.0009858232,0.001805828,0.001688104,0.001100464,0.02193435],"category_scores_gemma":[0.002001275,0.0003868673,0.0009744164,0.002680796,0.0009429941,0.00384764,0.002879257,0.001897142,0.006844257],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005538039,"about_ca_system_score_gemma":0.0006697387,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001261141,"about_ca_topic_score_gemma":0.001696994,"domain_scores_codex":[0.9993698,0.00008245904,0.00005692282,0.0002208714,0.0001923405,0.00007770831],"domain_scores_gemma":[0.9990504,0.0001653531,0.00008282915,0.0003098627,0.0002372897,0.000154315],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003765222,0.0001952103,0.0009149102,0.0004051506,0.00006616838,0.0005253411,0.0004259851,0.02517124,0.01447291,0.5398483,0.04365803,0.3739402],"study_design_scores_gemma":[0.00004770476,0.0002205488,0.0008770776,0.0001527388,0.00007440042,0.001458362,0.0003686964,0.1045212,0.01189734,0.7063257,0.1739874,0.00006896786],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04032397,0.001171428,0.8888867,0.0008004535,0.0007094595,0.0002573646,0.003427153,0.002911016,0.0615124],"genre_scores_gemma":[0.2706621,0.002559151,0.6447704,0.0008899511,0.0004176393,0.0004084474,0.01034789,0.002294713,0.06764977],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02193435,"threshold_uncertainty_score":0.07337773,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2404357874","doi":"","title":"A Faster 4-Approximation Algorithm for the Unit Disk Cover Problem","year":2015,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia; Carleton University","funders":"","keywords":"Approximation algorithm; Set cover problem; Cover (algebra); Plane (geometry); Simple (philosophy); Set (abstract data type); Unit (ring theory); Unit disk; Unit disk graph; Algorithm; Computer science; Computational geometry; Running time; Mathematics; Combinatorics; Mathematical optimization; Geometry","authors":[{"name":"Ahmad Biniaz","is_ca":true},{"name":"Anil Maheshwari","is_ca":true},{"name":"Michiel H. M. Smid","is_ca":true},{"name":"Paul Liu","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0630496311394427,"gpt":0.2724424684038645,"spread":0.2093928372644218,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001036556,0.002142058,0.002363517,0.001768296,0.001176099,0.002396724,0.003458879,0.002731028,0.01553743],"category_scores_gemma":[0.004598196,0.0007763695,0.001775282,0.003549754,0.0007013692,0.004861485,0.002734842,0.002493988,0.004199613],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002330148,"about_ca_system_score_gemma":0.002517284,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006031215,"about_ca_topic_score_gemma":0.006842981,"domain_scores_codex":[0.9984728,0.0002284056,0.0001044159,0.0003759651,0.0004807276,0.0003377359],"domain_scores_gemma":[0.9982273,0.0007850257,0.0001517436,0.0004763796,0.0002255933,0.0001339136],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001687987,0.0008085445,0.001929464,0.000621143,0.0002226668,0.0003531939,0.0004573451,0.2741161,0.01622828,0.03357184,0.04291189,0.6270916],"study_design_scores_gemma":[0.0005065445,0.000199786,0.0005632673,0.00004349734,0.00005974705,0.0003458213,0.0001429009,0.9379404,0.004239595,0.04181945,0.01409396,0.00004504202],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0666789,0.002186266,0.9047254,0.001506503,0.0004263005,0.0004877514,0.0008698256,0.007164836,0.01595414],"genre_scores_gemma":[0.1496073,0.0005424767,0.8400101,0.0004753732,0.0001829517,0.0005435061,0.002549712,0.0005663045,0.005522286],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01553743,"threshold_uncertainty_score":0.05197793,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2149884111","doi":"","title":"Computing Nice Sweeps for Polyhedra and Polygons","year":2004,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Polyhedron; Monotone polygon; Combinatorics; Regular polygon; Polygon (computer graphics); Mathematics; Rectilinear polygon; Simple polygon; Convex polygon; Convex set; Polygon covering; Krein–Milman theorem; Convex polytope; Computer science; Geometry; Convex optimization","authors":[{"name":"Prosenjit Bose","is_ca":true},{"name":"Marc van Kreveld","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02848420590755417,"gpt":0.2638921882300127,"spread":0.2354079823224585,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080415,0.001350292,0.001559193,0.001596354,0.0009885931,0.002211976,0.001978249,0.001649463,0.008006228],"category_scores_gemma":[0.006333788,0.001010616,0.002119581,0.001906889,0.002031208,0.005295067,0.002741669,0.001641296,0.001578557],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009796768,"about_ca_system_score_gemma":0.0006737444,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003100108,"about_ca_topic_score_gemma":0.005455537,"domain_scores_codex":[0.9986637,0.0001932479,0.0001369985,0.0003662496,0.0003911302,0.0002487272],"domain_scores_gemma":[0.997227,0.001574118,0.0002074377,0.0005712394,0.0002617367,0.0001584163],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","study_design_scores_codex":[0.001390157,0.0003179331,0.01140498,0.0009971915,0.0001780666,0.0008591124,0.0008271842,0.5145707,0.01623433,0.1049339,0.01401576,0.3342707],"study_design_scores_gemma":[0.0001220585,0.0002003768,0.0008028168,0.00004899947,0.0000300508,0.0001840829,0.0004190931,0.8467352,0.006740134,0.1392852,0.005400006,0.0000319416],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.2851427,0.0007128646,0.6915278,0.0005768563,0.0001079744,0.0002710843,0.002826605,0.008261706,0.01057244],"genre_scores_gemma":[0.4496189,0.0002421494,0.5392552,0.0001341325,0.00007989079,0.0001460808,0.00646723,0.0009176622,0.003138684],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.008006228,"threshold_uncertainty_score":0.02678347,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2123411109","doi":"","title":"Flipping your lid","year":2001,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université du Québec; Carleton University","funders":"","keywords":"Combinatorics; Convex polygon; Regular polygon; Polygon (computer graphics); Midpoint; Sequence (biology); Mathematics; Star-shaped polygon; Polygon covering; Computer science; Convex set; Geometry; Convex optimization; Chemistry; Telecommunications","authors":[{"name":"Hee-Kap Ahn","is_ca":false},{"name":"Prosenjit Bose","is_ca":true},{"name":"Jurek Czyzowicz","is_ca":true},{"name":"Nicolas Hanusse","is_ca":true},{"name":"Evangelos Kranakis","is_ca":false},{"name":"Pat Morin","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05257903836359342,"gpt":0.2725959820000142,"spread":0.2200169436364208,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003973301,0.0006766188,0.0007010291,0.0003797426,0.001539461,0.001270645,0.00100191,0.001034015,0.03087728],"category_scores_gemma":[0.002477749,0.0005260103,0.001166305,0.0003454674,0.001620212,0.002807418,0.003615505,0.001244673,0.00839514],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004856155,"about_ca_system_score_gemma":0.0004894504,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001116291,"about_ca_topic_score_gemma":0.001499666,"domain_scores_codex":[0.9994498,0.00004891998,0.00002446581,0.0001322613,0.0001560254,0.000188488],"domain_scores_gemma":[0.999204,0.000117191,0.00007894198,0.000363543,0.0001021816,0.0001341836],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.002301766,0.0002442072,0.007956093,0.0006828018,0.0001064146,0.003524882,0.001972648,0.02691626,0.09479748,0.3151593,0.08600581,0.4603324],"study_design_scores_gemma":[0.0001801523,0.001223906,0.005229004,0.0004765707,0.0001375844,0.004262249,0.003659324,0.1147238,0.128263,0.2559501,0.4856161,0.0002781692],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2955935,0.001050472,0.5236835,0.002894086,0.002350212,0.0005331143,0.002295699,0.006100219,0.1654991],"genre_scores_gemma":[0.7354436,0.000757698,0.1861821,0.0007172839,0.0001514997,0.000254441,0.001993561,0.001527888,0.07297195],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.03087728,"threshold_uncertainty_score":0.1032948,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2107966077","doi":"","title":"Efficient Snap Rounding with Integer Arithmetic.","year":2007,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Rounding; Combinatorics; Partition (number theory); Logarithm; Intersection (aeronautics); Integer (computer science); Mathematics; Time complexity; Line segment; Discrete mathematics; Computer science; Algorithm; Geometry","authors":[{"name":"Binay Bhattacharya","is_ca":true},{"name":"Jeff Sember","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02250077548283974,"gpt":0.2500785208696665,"spread":0.2275777453868267,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007380044,0.001108934,0.0008778041,0.001014516,0.000878509,0.002027381,0.001414968,0.0006385171,0.01206713],"category_scores_gemma":[0.004052721,0.0005029859,0.0009427435,0.001366503,0.001029864,0.002376346,0.003099745,0.001413121,0.004418613],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006464823,"about_ca_system_score_gemma":0.0007719131,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001275139,"about_ca_topic_score_gemma":0.001509094,"domain_scores_codex":[0.9987429,0.0001750431,0.00009981447,0.0002538004,0.0005397726,0.0001887321],"domain_scores_gemma":[0.9989173,0.0003139848,0.00008726306,0.0004782942,0.0001583929,0.00004468218],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0008367618,0.000147456,0.001566857,0.0005720811,0.00006815114,0.0004115551,0.0005541036,0.150785,0.03170568,0.1860624,0.01891483,0.6083751],"study_design_scores_gemma":[0.0001352843,0.0003114541,0.0006314599,0.0001586407,0.00005087948,0.0004996469,0.0003761463,0.6777424,0.04032245,0.225041,0.05464559,0.0000851275],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01009612,0.000228258,0.9771634,0.00007479014,0.0001035335,0.0001030365,0.0001939098,0.002767653,0.009269246],"genre_scores_gemma":[0.1729042,0.0002878726,0.8195181,0.0001508281,0.00006420201,0.000250506,0.0008527691,0.0005965146,0.005374974],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01206713,"threshold_uncertainty_score":0.04036862,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2140740564","doi":"","title":"Multidimensional Orthogonal Range Search Using Tries.","year":2003,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of New Brunswick","funders":"","keywords":"Rectangle; Range (aeronautics); Competitive analysis; Set (abstract data type); Algorithm; Space (punctuation); Computer science; Range query (database); Online algorithm; Combinatorics; Search algorithm; Mathematics; Theoretical computer science; Search engine; Information retrieval; Upper and lower bounds; Web search query; Engineering; Geometry; Sargable","authors":[{"name":"Lingke Bu","is_ca":false},{"name":"Bradford G. Nickerson","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06550581335891824,"gpt":0.2802458608807452,"spread":0.2147400475218269,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001586392,0.001109567,0.001743627,0.002623232,0.0008560471,0.002484276,0.002397858,0.001225389,0.003704616],"category_scores_gemma":[0.009683107,0.0007771331,0.001216068,0.005347056,0.0009597913,0.006029231,0.00551206,0.001042447,0.00326257],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004903652,"about_ca_system_score_gemma":0.001400152,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001185667,"about_ca_topic_score_gemma":0.001524129,"domain_scores_codex":[0.9968106,0.000888319,0.0003262449,0.0004962297,0.001189711,0.0002888674],"domain_scores_gemma":[0.995867,0.00164514,0.0005558839,0.001147294,0.0006275234,0.0001571682],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001362025,0.0003115856,0.007208404,0.001029253,0.0004087197,0.0004325236,0.0006738899,0.09917375,0.02617307,0.0862332,0.01966493,0.7573286],"study_design_scores_gemma":[0.0002419379,0.0005626256,0.000966527,0.0001270786,0.0001483341,0.0020609,0.000451878,0.8775091,0.033568,0.05649836,0.02773732,0.0001278253],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0155378,0.001532065,0.9757529,0.0001761075,0.0000938331,0.000177474,0.0003885,0.002406699,0.003934532],"genre_scores_gemma":[0.1704664,0.0007778404,0.8240158,0.0001726441,0.00007460216,0.0004751484,0.001276163,0.0001794561,0.00256183],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003704616,"threshold_uncertainty_score":0.01239312,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2141096989","doi":"","title":"Bounded-Curvature Path Normalization","year":2006,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Bounded function; Normalization (sociology); Curvature; Mathematics; Path (computing); Computer science; Mathematical analysis; Geometry","authors":[{"name":"Jonathan Backer","is_ca":true},{"name":"David Kirkpatrick","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01295605834622334,"gpt":0.2180384118051253,"spread":0.2050823534589019,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008610352,0.0008835592,0.0005744211,0.001948896,0.001645843,0.002931823,0.001407349,0.001259943,0.01580762],"category_scores_gemma":[0.004620367,0.0004725775,0.0008950292,0.001190172,0.002938936,0.007121962,0.003456009,0.003337557,0.003564327],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001683197,"about_ca_system_score_gemma":0.0009871639,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001209766,"about_ca_topic_score_gemma":0.001319129,"domain_scores_codex":[0.9985954,0.0001719088,0.00007824993,0.0003875025,0.0005793428,0.0001875756],"domain_scores_gemma":[0.9981239,0.0003196092,0.0002437365,0.000370519,0.0005826378,0.000359588],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001427807,0.00001015772,0.0001183052,0.00001688681,0.000002153415,0.00005857796,0.00008484942,0.001407833,0.001370845,0.9887961,0.001229269,0.00689078],"study_design_scores_gemma":[0.00000902986,0.00002589766,0.0002117826,0.00001530664,0.000005000115,0.0003075219,0.00007152428,0.01833297,0.002280476,0.9609218,0.0177931,0.0000256006],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1193038,0.0003314586,0.7330511,0.001159545,0.0006457952,0.0002137629,0.0008397793,0.001380999,0.1430738],"genre_scores_gemma":[0.7142048,0.0006397799,0.1898728,0.0005769958,0.0004070784,0.0002937581,0.001189794,0.001206257,0.09160866],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01580762,"threshold_uncertainty_score":0.05288178,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W165396895","doi":"","title":"K-Nearest Neighbor Search using the Pyramid Technique.","year":2006,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of New Brunswick","funders":"","keywords":"Pyramid (geometry); k-nearest neighbors algorithm; RADIUS; Best bin first; Nearest neighbor graph; Nearest neighbor search; Nearest-neighbor chain algorithm; Range (aeronautics); Point (geometry); Range query (database); Mathematics; Computer science; Pattern recognition (psychology); Algorithm; Artificial intelligence; Combinatorics; Geometry; Search engine; Information retrieval; Cluster analysis; Web search query","authors":[{"name":"Bradford G. Nickerson","is_ca":true},{"name":"Qingxiu Shi","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04234192041526704,"gpt":0.2690653430377264,"spread":0.2267234226224593,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006602325,0.0006217252,0.001412312,0.002060357,0.001032145,0.001133969,0.001508467,0.0009742359,0.003121241],"category_scores_gemma":[0.003577764,0.0004711813,0.0009836471,0.003799632,0.0004408192,0.002587195,0.001692698,0.0008369819,0.002268742],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005232315,"about_ca_system_score_gemma":0.001471913,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008304523,"about_ca_topic_score_gemma":0.009829401,"domain_scores_codex":[0.9986866,0.0001717675,0.00009272542,0.0002359905,0.0007222928,0.00009063568],"domain_scores_gemma":[0.9990482,0.0002418758,0.00008091386,0.0002610051,0.0003304418,0.00003761459],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002850586,0.0002639467,0.002405299,0.0006171166,0.0003969143,0.0004275312,0.0003023946,0.08260993,0.02272752,0.02134811,0.01889886,0.8497174],"study_design_scores_gemma":[0.0001356459,0.0003337687,0.002139638,0.00008002773,0.0001722865,0.002052462,0.0002547969,0.8985834,0.01960817,0.03978513,0.03672504,0.0001296326],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006244716,0.0009355714,0.9884239,0.00007547032,0.00009808308,0.0001440809,0.0001679548,0.001218155,0.002692143],"genre_scores_gemma":[0.09126136,0.0007484317,0.9045633,0.0001035308,0.00005018698,0.0001442846,0.0006946899,0.00007187712,0.002362418],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008304523,"threshold_uncertainty_score":0.01651239,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W129388523","doi":"","title":"On the Computation and Chromatic Number of Colored Domino Tilings.","year":2005,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Regina","funders":"","keywords":"Colored; Domino; Rectangle; Polygon (computer graphics); Mathematics; Combinatorics; Set (abstract data type); Simple (philosophy); Computer science; Frame (networking); Geometry","authors":[{"name":"Chris Worman","is_ca":false},{"name":"Boting Yang","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02039873376255215,"gpt":0.2572388969856839,"spread":0.2368401632231317,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008249355,0.000746023,0.0007337354,0.001418689,0.001217447,0.002123458,0.001485687,0.0007209548,0.008618155],"category_scores_gemma":[0.008624272,0.0004949353,0.0007090313,0.001848038,0.001575083,0.003436626,0.001659104,0.0009610115,0.0007712804],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002609774,"about_ca_system_score_gemma":0.001657934,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008236293,"about_ca_topic_score_gemma":0.01956494,"domain_scores_codex":[0.9993477,0.0001057679,0.00003748926,0.0001774994,0.0001834805,0.0001479714],"domain_scores_gemma":[0.995316,0.003247072,0.0003226534,0.0004680827,0.0004188874,0.0002273521],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001125246,0.0001901,0.008274377,0.0003901082,0.000108889,0.000230338,0.0004777063,0.6469284,0.01620106,0.1617223,0.01057804,0.1537735],"study_design_scores_gemma":[0.00007654857,0.00005126686,0.0007039692,0.00003015689,0.00002129573,0.00005406181,0.00007766132,0.8730683,0.004108059,0.1194767,0.002307709,0.00002431791],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3591283,0.0007433611,0.6056007,0.0007568733,0.0002292299,0.0001973151,0.00106138,0.001603629,0.03067929],"genre_scores_gemma":[0.6007229,0.000325381,0.3887938,0.0001358549,0.00007292179,0.000223242,0.001357471,0.0004223496,0.007946052],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008618155,"threshold_uncertainty_score":0.02883059,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2293145487","doi":"","title":"An In-Place Priority Search Tree","year":2011,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Tree (set theory); Search tree; Data structure; Set (abstract data type); Point (geometry); Range tree; Segment tree; K-ary tree; Tree structure; Interval tree; Space (punctuation); Theoretical computer science; Data mining; Algorithm; Search algorithm; Mathematics; Combinatorics","authors":[{"name":"Minati De","is_ca":false},{"name":"Anil Maheshwari","is_ca":true},{"name":"Subhas C. Nandy","is_ca":false},{"name":"Michiel H. M. Smid","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05831943655892484,"gpt":0.2812326171816245,"spread":0.2229131806226997,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009101654,0.0004774197,0.001057397,0.001264303,0.001065862,0.002338757,0.001954769,0.00103591,0.00843916],"category_scores_gemma":[0.005276442,0.0004725541,0.0005638429,0.002547701,0.0006986746,0.004762829,0.002419296,0.001214612,0.003862415],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000767231,"about_ca_system_score_gemma":0.001685108,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002168224,"about_ca_topic_score_gemma":0.002146067,"domain_scores_codex":[0.9987985,0.0001500829,0.0001191358,0.0002086596,0.0004974939,0.0002260865],"domain_scores_gemma":[0.9978759,0.0004511725,0.000142469,0.0005865596,0.000739438,0.000204456],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001621863,0.0004409023,0.003577917,0.0009116031,0.00009181708,0.001135583,0.001020527,0.0235163,0.05317983,0.301602,0.05981155,0.5530902],"study_design_scores_gemma":[0.0005208477,0.001343584,0.001737609,0.0002007525,0.0002234345,0.003322218,0.0008375184,0.3006405,0.06563561,0.4055711,0.2197418,0.0002249071],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.042265,0.0008929585,0.931159,0.0008984048,0.0003746482,0.0002332134,0.001493588,0.003888849,0.01879436],"genre_scores_gemma":[0.3222143,0.0009756153,0.6501124,0.000613847,0.0002863647,0.000246643,0.003168119,0.0006919396,0.02169079],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.00843916,"threshold_uncertainty_score":0.0282318,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2113703646","doi":"","title":"On the nonexistence of dimension reduction for $\\ell2_2$ metrics.","year":2008,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Dimension (graph theory); Metric (unit); Dimensionality reduction; Combinatorics; Dimension function; Metric dimension; Reduction (mathematics); Embedding; Lemma (botany); Discrete mathematics; Effective dimension; Metric space; Euclidean distance; Hausdorff dimension; Computer science; Graph","authors":[{"name":"Mohammad Moharrami","is_ca":false},{"name":"Avner Magen","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.08041085738545625,"gpt":0.2616961247978016,"spread":0.1812852674123453,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005236193,0.00138706,0.001712061,0.00195242,0.002412913,0.003674647,0.001893812,0.002244139,0.007327553],"category_scores_gemma":[0.03556725,0.001142868,0.001929988,0.001346931,0.007013988,0.01159616,0.0074776,0.007390956,0.001561346],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002618187,"about_ca_system_score_gemma":0.001274627,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001728077,"about_ca_topic_score_gemma":0.001462975,"domain_scores_codex":[0.9938711,0.001977161,0.0003529227,0.001501012,0.001607302,0.0006904537],"domain_scores_gemma":[0.9581136,0.03190262,0.001954131,0.004628072,0.001979271,0.001422353],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001756769,0.00005189382,0.001052576,0.0001640152,0.00005281307,0.0001233765,0.0002742179,0.009381831,0.001669158,0.9660157,0.00805949,0.01297935],"study_design_scores_gemma":[0.00004004214,0.0001099911,0.001280081,0.00006116868,0.000040302,0.0004177674,0.0001153912,0.05415899,0.002197972,0.9307317,0.0107834,0.00006332448],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.2582353,0.006086071,0.5634634,0.01450683,0.0007358264,0.0003168029,0.001495479,0.001004061,0.1541561],"genre_scores_gemma":[0.8321986,0.003173546,0.1325883,0.003972839,0.0007871447,0.0008993135,0.001966586,0.0007253509,0.02368843],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.007327553,"threshold_uncertainty_score":0.02769196,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W41445881","doi":"","title":"Tight Bounds for Point Recolouring.","year":2006,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Queen's University","funders":"","keywords":"Sequence (biology); Point (geometry); Set (abstract data type); Upper and lower bounds; Matching (statistics); Mathematics; Combinatorics; Iterative method; Computer science; Algorithm; Geometry; Mathematical analysis; Statistics","authors":[{"name":"Yurai Núñez Rodríguez","is_ca":true},{"name":"David Rappaport","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02099672393193426,"gpt":0.2391670746110382,"spread":0.218170350679104,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01229645,0.004603535,0.003912316,0.005122628,0.003494612,0.007012108,0.01091117,0.004955512,0.03252078],"category_scores_gemma":[0.088683,0.00307894,0.004063193,0.006184998,0.005336104,0.02454897,0.01322447,0.01610507,0.01221677],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004306381,"about_ca_system_score_gemma":0.002441219,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004165635,"about_ca_topic_score_gemma":0.005628472,"domain_scores_codex":[0.9839805,0.003105446,0.0007572129,0.003053058,0.006520512,0.002583305],"domain_scores_gemma":[0.8853151,0.07818794,0.004168612,0.02362381,0.00639197,0.002312581],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.002228375,0.000744315,0.003773907,0.002355781,0.0003007038,0.0005055659,0.001495128,0.1748625,0.01748117,0.3158958,0.042618,0.4377387],"study_design_scores_gemma":[0.0001811353,0.0004892542,0.001874891,0.0007002158,0.0003208935,0.00093952,0.000397539,0.5414898,0.01765382,0.370187,0.06558567,0.000180275],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009655711,0.006244007,0.9533096,0.001759633,0.0004382046,0.0002489529,0.0004084088,0.002806239,0.02512915],"genre_scores_gemma":[0.1871078,0.004547721,0.7829901,0.001488041,0.0008098183,0.0008551346,0.001654868,0.003517583,0.0170288],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.03252078,"threshold_uncertainty_score":0.1087928,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2185134590","doi":"","title":"Turning Orthogonally Convex Polyhedra into Orthoballs","year":2014,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Polyhedron; Convex polytope; Regular polygon; Combinatorics; Mathematics; Planar graph; Face (sociological concept); Graph; Convex set; Computer science; Geometry; Convex optimization","authors":[{"name":"Fidel Barrera-Cruz","is_ca":true},{"name":"Thérèse Biedl","is_ca":true},{"name":"Martin Derka","is_ca":true},{"name":"Stephen Kiazyk","is_ca":true},{"name":"Anna Lubiw","is_ca":true},{"name":"Hamideh Vosoughpour","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01531333210797006,"gpt":0.2375764296703209,"spread":0.2222630975623508,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003510564,0.0005782086,0.0003993269,0.0009511223,0.0006026918,0.001989609,0.0007212572,0.0005992451,0.005591357],"category_scores_gemma":[0.002654046,0.0005983978,0.0007118515,0.0007817697,0.002496214,0.003018918,0.002111984,0.002194834,0.001072338],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004845564,"about_ca_system_score_gemma":0.0003347601,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002433256,"about_ca_topic_score_gemma":0.003341203,"domain_scores_codex":[0.9992294,0.0001468009,0.00003501441,0.0002134421,0.000261486,0.000113849],"domain_scores_gemma":[0.99871,0.0003499663,0.0002359137,0.0003224966,0.0002354776,0.0001460823],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001703736,0.00006368946,0.001204036,0.0001120499,0.00001292568,0.0002957354,0.0005834799,0.03728383,0.01554886,0.8977972,0.002373097,0.04455469],"study_design_scores_gemma":[0.00002509439,0.00007172579,0.0008017406,0.0000527029,0.00001317996,0.0003059786,0.0005533764,0.1248794,0.007309584,0.8424031,0.02354436,0.00003977807],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1423058,0.0001753538,0.8314971,0.0002686894,0.0001282417,0.00009742372,0.0004729923,0.0004913433,0.02456305],"genre_scores_gemma":[0.5573716,0.0005562221,0.4257199,0.0003080005,0.0001009971,0.0001426055,0.001298537,0.0008268557,0.01367534],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005591357,"threshold_uncertainty_score":0.01870495,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2397167913","doi":"","title":"A Data Structure Supporting Exclusion Persistence Range Search.","year":2012,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of New Brunswick","funders":"","keywords":"Computer science; Set (abstract data type); Data structure; Range (aeronautics); Block (permutation group theory); Space (punctuation); Persistence (discontinuity); Range query (database); Algorithm; Web search query; Mathematics; Combinatorics; Information retrieval; Sargable; Search engine","authors":[{"name":"Stuart A. Macgillivray","is_ca":true},{"name":"Bradford G. Nickerson","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1086784657414278,"gpt":0.3023750248869566,"spread":0.1936965591455287,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00171333,0.0005676316,0.0009089473,0.001506938,0.001509022,0.002327697,0.002822806,0.001417839,0.008159563],"category_scores_gemma":[0.01023636,0.0006350151,0.0006720373,0.003248558,0.001254642,0.006274075,0.006321663,0.00164717,0.00351563],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008334638,"about_ca_system_score_gemma":0.001679349,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003613846,"about_ca_topic_score_gemma":0.003459616,"domain_scores_codex":[0.997912,0.0003226808,0.0003271256,0.0003359311,0.0008685678,0.0002337632],"domain_scores_gemma":[0.992516,0.001743494,0.0006873271,0.003599182,0.001047797,0.0004062234],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.002506628,0.000519201,0.0113582,0.0009223023,0.0001618809,0.0007449227,0.001661846,0.04454202,0.0395396,0.1639756,0.1067305,0.6273373],"study_design_scores_gemma":[0.0006969169,0.001315571,0.003366189,0.0002371618,0.0001434527,0.002581458,0.001015241,0.4554636,0.06185688,0.1506281,0.3224019,0.0002934031],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0238511,0.001163052,0.9509312,0.001244468,0.0001857804,0.0003586939,0.003963023,0.01294512,0.005357539],"genre_scores_gemma":[0.3087628,0.0006900268,0.6677986,0.0009402459,0.0002523072,0.0007648477,0.0113316,0.001035901,0.008423554],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008159563,"threshold_uncertainty_score":0.02729642,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2147664710","doi":"","title":"Application of computational geometry to network p-center location problems","year":2008,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Ackermann function; Center (category theory); Combinatorics; Measure (data warehouse); Function (biology); Mathematics; Computational geometry; Tree (set theory); Inverse; Binary logarithm; Geometry; Algorithm; Discrete mathematics; Computer science; Data mining; Crystallography","authors":[{"name":"Qiaosheng Shi","is_ca":true},{"name":"Binay Bhattacharya","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0278149769113654,"gpt":0.2411485933884939,"spread":0.2133336164771285,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001244406,0.0008676675,0.001067166,0.001114004,0.001124651,0.001597956,0.00165801,0.001501406,0.003037373],"category_scores_gemma":[0.006447625,0.0005405729,0.0008737331,0.001533782,0.002712634,0.003361061,0.003557527,0.00253905,0.0004184963],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002037483,"about_ca_system_score_gemma":0.0009979659,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002368793,"about_ca_topic_score_gemma":0.001463047,"domain_scores_codex":[0.9985941,0.0006380155,0.00005524034,0.0002546968,0.0003279172,0.0001300208],"domain_scores_gemma":[0.9967822,0.002304973,0.0002133824,0.0003065311,0.0002637636,0.0001290911],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0000575513,0.00002754695,0.0004004274,0.000132398,0.00003884617,0.0001178072,0.0001373266,0.4843574,0.00106659,0.4856018,0.002834524,0.02522789],"study_design_scores_gemma":[0.00001612839,0.00002489809,0.0001104558,0.0000138725,0.000006912584,0.00005929788,0.00005389452,0.6386805,0.0008334341,0.3551737,0.005015585,0.00001122346],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0180248,0.0006772968,0.9715835,0.001610275,0.0001086525,0.00004032748,0.00007582851,0.0001171192,0.007762233],"genre_scores_gemma":[0.6212941,0.001724157,0.3691458,0.0002699231,0.0005792066,0.0002180748,0.0002693278,0.0001599806,0.006339535],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003037373,"threshold_uncertainty_score":0.01478302,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W159810765","doi":"","title":"Approximating Radio Maps.","year":2005,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Terrain; Algorithm; WiMAX; Approximation algorithm; Antenna (radio); Radar; Scale (ratio); Wireless; Point (geometry); Real-time computing; Mathematics; Telecommunications; Geography","authors":[{"name":"Iris Ashkenazi","is_ca":false},{"name":"Boaz Ben‐Moshe","is_ca":false},{"name":"Jihad El‐Sana","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02632379849969603,"gpt":0.2428773898434252,"spread":0.2165535913437291,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001119357,0.001090309,0.0007987109,0.001238576,0.0003644974,0.001257824,0.001373788,0.001238676,0.003538804],"category_scores_gemma":[0.009342178,0.0005560502,0.0009200983,0.001192204,0.0006942721,0.00198558,0.001737147,0.00123502,0.001581031],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006405431,"about_ca_system_score_gemma":0.0005048715,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00236242,"about_ca_topic_score_gemma":0.001893032,"domain_scores_codex":[0.9992328,0.0002812401,0.0000375559,0.0001250639,0.0002598313,0.00006365267],"domain_scores_gemma":[0.997514,0.00149212,0.0001973991,0.0004050436,0.000322163,0.00006935866],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001877975,0.00004501375,0.001423716,0.0002001797,0.0000552101,0.0001092677,0.0001796211,0.7765155,0.002769638,0.08304026,0.005423935,0.1300498],"study_design_scores_gemma":[0.00001400697,0.00002239345,0.0001194618,0.00001469956,0.00000782491,0.00009221092,0.00004049674,0.9675205,0.001096311,0.02711127,0.003953083,0.000007799794],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003196867,0.000124662,0.9950164,0.00004676641,0.00002553235,0.00002169864,0.00007329523,0.0002631774,0.001231625],"genre_scores_gemma":[0.1889688,0.0005924212,0.8041097,0.00008986785,0.00008328977,0.0001816574,0.0008670613,0.0002532586,0.004853975],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003538804,"threshold_uncertainty_score":0.0118385,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2962974790","doi":"","title":"Collinearities in Kinetic Point Sets","year":2011,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"","keywords":"Collinearity; Combinatorics; Plane (geometry); Trajectory; Mathematics; Point (geometry); Constant (computer programming); Line (geometry); Set (abstract data type); Kinetic energy; Line segment; Geometry; Physics; Mathematical analysis; Computer science; Classical mechanics","authors":[{"name":"Benjamin Lund","is_ca":false},{"name":"George Purdy","is_ca":false},{"name":"Justin W. Smith","is_ca":false},{"name":"Csaba D. Tóth","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05597492171867002,"gpt":0.2464458404073397,"spread":0.1904709186886697,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002420437,0.001150878,0.001851361,0.004061742,0.003386985,0.004518405,0.003098428,0.00158684,0.009737184],"category_scores_gemma":[0.01567242,0.001433596,0.00182996,0.00383134,0.003951049,0.006922724,0.009163403,0.002946835,0.001722599],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002093642,"about_ca_system_score_gemma":0.0008654353,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002477712,"about_ca_topic_score_gemma":0.001514181,"domain_scores_codex":[0.9949453,0.0006641453,0.0005083044,0.0008990605,0.001989431,0.000993765],"domain_scores_gemma":[0.9874316,0.005813078,0.002606225,0.001407544,0.001588283,0.001153212],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003692709,0.00006607296,0.004531047,0.000217653,0.00008148976,0.0007233583,0.001183495,0.05608946,0.002418839,0.9162701,0.001938803,0.0161105],"study_design_scores_gemma":[0.00007173837,0.000100101,0.0007937795,0.00009836267,0.00003191347,0.0005729313,0.0006069663,0.1436385,0.002332501,0.8437931,0.00791042,0.0000496151],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3954865,0.0009984733,0.5733354,0.0006195317,0.0001155547,0.0002183868,0.001102572,0.0004569609,0.02766652],"genre_scores_gemma":[0.914036,0.0006857178,0.06945515,0.0001691787,0.00009838077,0.0004131924,0.002411447,0.0002456768,0.0124852],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009737184,"threshold_uncertainty_score":0.03257418,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2604600966","doi":"","title":"Progressive Alignment of Shapes.","year":2016,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Modular Robots and Swarm Intelligence","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science","authors":[{"name":"Ashwin Gopinath","is_ca":false},{"name":"David Kirkpatrick","is_ca":true},{"name":"Paul W. K. Rothemund","is_ca":false},{"name":"Chris Thachuk","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02415765520877342,"gpt":0.2314024520731452,"spread":0.2072447968643718,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005645173,0.0009390375,0.0009420495,0.001675688,0.0009234427,0.001846048,0.001815581,0.0008384802,0.02020576],"category_scores_gemma":[0.003098753,0.000889776,0.0008405297,0.001602215,0.001217453,0.002123013,0.00328765,0.001882942,0.008332503],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005225948,"about_ca_system_score_gemma":0.0006968015,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001919528,"about_ca_topic_score_gemma":0.003958706,"domain_scores_codex":[0.9992402,0.0001030287,0.000044602,0.0002268373,0.0003088971,0.00007653785],"domain_scores_gemma":[0.9988691,0.0001679885,0.00009470215,0.0005521305,0.0002280121,0.00008807374],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003386768,0.0001031388,0.001585849,0.0004253719,0.00008392829,0.0002477777,0.0005942358,0.05549262,0.05457807,0.1393518,0.02726077,0.7199378],"study_design_scores_gemma":[0.0001235816,0.000341036,0.003156657,0.0001830912,0.0001062179,0.001043979,0.0006246365,0.4916953,0.07404011,0.2126614,0.2159302,0.00009379958],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01832923,0.0006871266,0.9419761,0.0001819041,0.0002707826,0.0001356249,0.0005924664,0.003812873,0.03401387],"genre_scores_gemma":[0.2969683,0.0008623409,0.6608914,0.0001643396,0.0001058821,0.000191778,0.002521561,0.002144673,0.03614968],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.02020576,"threshold_uncertainty_score":0.06759501,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}