{"meta":{"query_hash":"e398ba414c6d","filters":{"venue":"Computational Geometry"},"cohort_total":236,"direct_labels_cover":1,"predictions_cover":236,"exported":236,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/e398ba414c6d","api":"https://metacan.xera.ac/api/v1/cohort?venue=Computational+Geometry"},"results":[{"id":"W1497963486","doi":"10.1016/j.comgeo.2008.04.005","title":"The distance geometry of music","year":2008,"lang":"en","type":"book-chapter","venue":"Computational Geometry","topic":"Music Technology and Sound Studies","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Centre for Interdisciplinary Research in Music Media and Technology; McGill University; Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada; Ministerio de Economía y Competitividad; Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Mathematics; Euclidean geometry; Euclidean distance; Rhythm; Property (philosophy); Non-Euclidean geometry; Combinatorics; Geometry","score_opus":0.022290202225696918,"score_gpt":0.22846883403935542,"score_spread":0.2061786318136585,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1497963486","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005248568,0.018584205,0.058718823,0.003467073,0.0010312084,0.000018667039,0.00016286396,0.00015808454,0.9126106],"genre_scores_gemma":[0.4171221,0.022740865,0.051085543,0.0015193986,0.0035435152,0.0001048111,0.0004993479,0.00037330194,0.5030111],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99974114,0.00007033855,0.000008418514,0.00004412282,0.00011427803,0.000021587517],"domain_scores_gemma":[0.9998036,0.000082511826,0.000010560234,0.000037653084,0.00004642942,0.000019204703],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021613337,0.0004995991,0.00037979908,0.0009219403,0.00091322215,0.0030200046,0.000639975,0.00084236584,0.011478018],"category_scores_gemma":[0.00093386933,0.00025742434,0.00028817257,0.0010898219,0.0042088735,0.0027902632,0.0009004977,0.0019818782,0.0029440317],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020076639,0.0000011383581,0.000013048484,0.00000990883,0.0000011786833,0.0000062780223,0.000070052665,0.00015971893,0.00007400278,0.9889654,0.0049251374,0.0057720835],"study_design_scores_gemma":[0.0000026254775,0.0000063243992,0.00009906224,0.000015411537,0.0000022268373,0.00006644505,0.00008041193,0.00055945944,0.00014347846,0.8333943,0.16562551,0.000004656951],"about_ca_topic_score_codex":0.0019076666,"about_ca_topic_score_gemma":0.0019542277,"teacher_disagreement_score":0.011478018,"about_ca_system_score_codex":0.00148705,"about_ca_system_score_gemma":0.00073518744,"threshold_uncertainty_score":0.03839773},"labels":[],"label_agreement":null},{"id":"W1503791796","doi":"10.1016/s0925-7721(01)00059-1","title":"A decomposition-based approach to layered manufacturing☆☆A preliminary version of this paper appears in the Proceedings of the Seventh International Workshop on Algorithms and Data Structures, Providence, RI, 8–10 August 2001, LNCS 2125, pp. 389–400.","year":2002,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Polyhedron; Regular polygon; Algorithm; Computer science; Vertex (graph theory); Plane (geometry); Volume (thermodynamics); Cutting-plane method; Process (computing); Theoretical computer science; Geometry; Mathematics","score_opus":0.0306365213956014,"score_gpt":0.2740248191432383,"score_spread":0.24338829774763687,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1503791796","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009826464,0.00007327322,0.99683726,0.00004763162,0.000035074827,0.000025762442,0.000052086147,0.00043931475,0.0015070132],"genre_scores_gemma":[0.036500778,0.00027774906,0.95821893,0.00008437449,0.000036610974,0.00011962929,0.00048647652,0.00041824227,0.003857183],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990497,0.00018037339,0.000076759345,0.0001288639,0.00043161266,0.00013261662],"domain_scores_gemma":[0.9986181,0.00024048211,0.0000747491,0.00049039634,0.0004475623,0.00012856879],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010156812,0.0009575042,0.0010310463,0.0019806297,0.0009521741,0.0025151179,0.0026699672,0.0009834316,0.009775472],"category_scores_gemma":[0.0035360039,0.00081594964,0.0019892135,0.002163948,0.00084966206,0.0025866614,0.0043529607,0.0024998672,0.0039124126],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023417342,0.00020288683,0.0015026978,0.0005035059,0.00019841883,0.00032670397,0.0006795162,0.1613937,0.027336935,0.26007736,0.020356921,0.5271871],"study_design_scores_gemma":[0.000028840692,0.00007800142,0.00027547198,0.00010184575,0.000073544536,0.00029466642,0.0001569179,0.84247226,0.008582592,0.11637527,0.031521276,0.00003940522],"about_ca_topic_score_codex":0.0033180853,"about_ca_topic_score_gemma":0.0058434834,"teacher_disagreement_score":0.009775472,"about_ca_system_score_codex":0.00075567485,"about_ca_system_score_gemma":0.0011011992,"threshold_uncertainty_score":0.032702148},"labels":[],"label_agreement":null},{"id":"W1522976700","doi":"10.1016/s0925-7721(02)00134-7","title":"Long proteins with unique optimal foldings in the H-P model","year":2003,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Protein Structure and Dynamics","field":"Biochemistry, Genetics and Molecular Biology","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University; University of New Brunswick","funders":"Departament d'Universitats, Recerca i Societat de la Informació; Natural Sciences and Engineering Research Council of Canada; Ministerio de Economía y Competitividad","keywords":"Protein folding; Monomer; Folding (DSP implementation); Amino acid; Property (philosophy); Simple (philosophy); Amino acid residue; Combinatorics; Sequence (biology); Chemistry; State (computer science); Peptide sequence; Computer science; Mathematics; Biochemistry; Algorithm; Engineering","score_opus":0.006786635602184702,"score_gpt":0.2324253513832061,"score_spread":0.2256387157810214,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1522976700","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8026819,0.0006337252,0.17709267,0.0014382215,0.00010034201,0.000038210244,0.0002277717,0.00036869803,0.017418383],"genre_scores_gemma":[0.9796433,0.00023169749,0.017439136,0.00013408776,0.000040716655,0.000052927266,0.00013879282,0.000112548456,0.0022068294],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997532,0.00009387817,0.000009400873,0.000047344845,0.00004652641,0.000049676823],"domain_scores_gemma":[0.999537,0.00015601731,0.0000675342,0.000088287416,0.00004200106,0.00010916929],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056756876,0.00046166417,0.0011507893,0.00056702027,0.0013314157,0.0014215837,0.0009489521,0.001800644,0.0024614143],"category_scores_gemma":[0.0016444651,0.00056699186,0.00071931566,0.00055100356,0.0019062698,0.0022339448,0.0013949549,0.0008242823,0.0003597848],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017660776,0.00006110809,0.00093427906,0.00006320036,0.000034266017,0.00042307397,0.00011832135,0.54927033,0.0039471234,0.43810317,0.0016423292,0.00522609],"study_design_scores_gemma":[0.000042196676,0.000039288294,0.00020765475,0.000005301153,0.000008360207,0.000068532085,0.000051090028,0.7258036,0.00050944585,0.27273706,0.00050908234,0.000018278646],"about_ca_topic_score_codex":0.0013570169,"about_ca_topic_score_gemma":0.0014228554,"teacher_disagreement_score":0.0024614143,"about_ca_system_score_codex":0.0008417997,"about_ca_system_score_gemma":0.000826399,"threshold_uncertainty_score":0.008234203},"labels":[],"label_agreement":null},{"id":"W1528651684","doi":"10.1016/j.comgeo.2017.10.002","title":"Continuous Yao graphs","year":2017,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; Carleton University","funders":"Exploratory Research for Advanced Technology; Natural Sciences and Engineering Research Council of Canada; Natur og Univers, Det Frie Forskningsråd; National Science Foundation","keywords":"Spanner; Combinatorics; Vertex (graph theory); Mathematics; Regular polygon; Algebraic number; Apex (geometry); Plane (geometry); Enhanced Data Rates for GSM Evolution; Graph; Discrete mathematics; Computer science; Geometry; Artificial intelligence","score_opus":0.02671546909029007,"score_gpt":0.32140128542788193,"score_spread":0.2946858163375919,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1528651684","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30710995,0.0015925108,0.4511239,0.0076757516,0.0003359334,0.00018003285,0.0013085913,0.00080627284,0.22986707],"genre_scores_gemma":[0.8644224,0.0011464464,0.045732822,0.0008369842,0.0003430226,0.00029527946,0.0012043949,0.00042492984,0.085593626],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985851,0.0003531451,0.00005002087,0.00038358115,0.00038310495,0.00024510836],"domain_scores_gemma":[0.9960504,0.0018479374,0.0004373867,0.00045019173,0.00057535636,0.0006385756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092247414,0.00085217156,0.0011852342,0.002349565,0.0023071987,0.004343526,0.0015575042,0.0019867897,0.0208624],"category_scores_gemma":[0.0065030647,0.0007582996,0.0008954351,0.002522918,0.003209145,0.010506324,0.0036892283,0.004750817,0.0017282285],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016174332,0.000010595576,0.000080729944,0.000015281847,0.000003715175,0.0000190837,0.000055431676,0.0006047308,0.0002283899,0.9964657,0.0007398753,0.0017602815],"study_design_scores_gemma":[0.000011538332,0.000007893395,0.00012292105,0.000008070432,0.0000063736825,0.00005088514,0.000055993194,0.0039275903,0.00027525777,0.99223787,0.0032886956,0.0000069198936],"about_ca_topic_score_codex":0.0010292861,"about_ca_topic_score_gemma":0.0011366295,"teacher_disagreement_score":0.0208624,"about_ca_system_score_codex":0.001938325,"about_ca_system_score_gemma":0.0009919788,"threshold_uncertainty_score":0.069791675},"labels":[],"label_agreement":null},{"id":"W1535557537","doi":"10.1016/s0925-7721(00)00015-8","title":"Approximation algorithms for lawn mowing and milling☆☆A preliminary version of this paper was entitled “The lawnmower problem” and appears in the Proc. 5th Canad. Conf. Comput. Geom., Waterloo, Canada, 1993, pp. 461–466.","year":2000,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":267,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Approximation algorithm; Simple (philosophy); Algorithm; Position (finance); Point (geometry); Path (computing); Shortest path problem; Mathematics; Grid; Lawn; Plane (geometry); Computer science; Combinatorics; Geometry","score_opus":0.010731073691518758,"score_gpt":0.22291545189570933,"score_spread":0.21218437820419056,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1535557537","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0110217845,0.000665251,0.98213583,0.0005231028,0.00016744349,0.00012546657,0.00022110026,0.0009484818,0.004191536],"genre_scores_gemma":[0.15474865,0.0006035796,0.8312834,0.00027701145,0.00019482477,0.00033922435,0.0015813106,0.0006622384,0.010309769],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99855715,0.000319191,0.00008902379,0.00035219584,0.0004395604,0.00024276982],"domain_scores_gemma":[0.99631006,0.0020622266,0.00022106271,0.0008645922,0.0003527038,0.00018928884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020671908,0.0014476749,0.0023691682,0.002154156,0.0015008294,0.0023522268,0.0038437997,0.0023287958,0.014419621],"category_scores_gemma":[0.012379842,0.0010557481,0.0018056682,0.0038927863,0.0015439953,0.0052015083,0.003847603,0.0038922578,0.0032244406],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006218466,0.00038445398,0.0021484932,0.000431437,0.00013535922,0.00015238149,0.00049989944,0.30305082,0.0019373927,0.19377528,0.042480733,0.4543819],"study_design_scores_gemma":[0.000057357032,0.000040252355,0.00012797248,0.000028822504,0.00001644225,0.00005753728,0.000063148655,0.89182323,0.0005558235,0.10195065,0.005266295,0.000012512006],"about_ca_topic_score_codex":0.009453599,"about_ca_topic_score_gemma":0.016410366,"teacher_disagreement_score":0.014419621,"about_ca_system_score_codex":0.0021216886,"about_ca_system_score_gemma":0.0018460689,"threshold_uncertainty_score":0.048238397},"labels":[],"label_agreement":null},{"id":"W1536704310","doi":"10.1016/s0925-7721(01)00008-6","title":"A lower bound for β-skeleton belonging to minimum weight triangulations☆☆This work is partially supported by NSERC grant OPG0041629.","year":2001,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Skeleton (computer programming); Combinatorics; Mathematics; Euclidean geometry; Conjecture; Enhanced Data Rates for GSM Evolution; Triangulation; Set (abstract data type); Upper and lower bounds; Value (mathematics); Geometry; Computer science; Mathematical analysis; Artificial intelligence","score_opus":0.01871303024442876,"score_gpt":0.2697210495268319,"score_spread":0.2510080192824031,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1536704310","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21010539,0.003931437,0.62034804,0.0067327213,0.0007710396,0.00021810814,0.003328076,0.0017943046,0.15277089],"genre_scores_gemma":[0.6673085,0.004486247,0.26554966,0.0019627085,0.0014559941,0.0006753956,0.008576961,0.0020169013,0.04796753],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975079,0.00035947608,0.00012890871,0.0006211447,0.00079033815,0.000592277],"domain_scores_gemma":[0.9789274,0.012731154,0.0013713554,0.0021171535,0.0021549426,0.0026980436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029032102,0.00180777,0.0020427715,0.0053971903,0.0027046571,0.0040504658,0.0044144364,0.003485363,0.028345274],"category_scores_gemma":[0.024572859,0.00089700974,0.0017844773,0.0036800802,0.0027280333,0.008257196,0.005921785,0.006373247,0.005453515],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012114185,0.0003660711,0.008754188,0.0011268555,0.000192751,0.00058870873,0.0007480146,0.026293773,0.018432114,0.7813452,0.041316226,0.11962472],"study_design_scores_gemma":[0.00006226128,0.00029429968,0.0047643124,0.00025962671,0.00015533238,0.001227736,0.00030826993,0.10672253,0.007960173,0.85531676,0.022859737,0.000069097274],"about_ca_topic_score_codex":0.00083957426,"about_ca_topic_score_gemma":0.0014018227,"teacher_disagreement_score":0.028345274,"about_ca_system_score_codex":0.0013994637,"about_ca_system_score_gemma":0.00076770666,"threshold_uncertainty_score":0.09482443},"labels":[],"label_agreement":null},{"id":"W1557286819","doi":"10.1016/j.comgeo.2008.09.008","title":"Dynamic ham-sandwich cuts in the plane","year":2009,"lang":"en","type":"book-chapter","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds De La Recherche Scientifique - FNRS; National Science Foundation","keywords":"Combinatorics; Mathematics; Regular polygon; Cardinality (data modeling); General position; Convex polygon; Polygon (computer graphics); Time complexity; Partition (number theory); Point (geometry); Plane (geometry); Convex set; Line (geometry); Discrete mathematics; Convex optimization; Geometry; Computer science","score_opus":0.01446148464721942,"score_gpt":0.24617614672384475,"score_spread":0.23171466207662533,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1557286819","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010963515,0.0018709549,0.8789281,0.00027007077,0.00055580377,0.00006145832,0.00023192183,0.0007291946,0.106389],"genre_scores_gemma":[0.22368519,0.003432931,0.6260672,0.00031743015,0.00028365388,0.0001734919,0.0007730266,0.0009890962,0.14427799],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99980575,0.000025869782,0.000006212906,0.000042839703,0.000098769015,0.000020574993],"domain_scores_gemma":[0.9998252,0.000059720158,0.000011119362,0.000045583034,0.00004302983,0.000015462358],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031564868,0.00073160336,0.0006553412,0.0007201775,0.0004665591,0.0013418001,0.00088556524,0.00085353275,0.016908666],"category_scores_gemma":[0.0006083562,0.00063563633,0.00053341594,0.0006041684,0.00086488714,0.0010951437,0.0013651625,0.001789274,0.0040761284],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014637534,0.000033183405,0.00026418426,0.00029495318,0.000037925383,0.00019385424,0.00018783139,0.075841255,0.017925572,0.5546095,0.025512861,0.32495248],"study_design_scores_gemma":[0.00003671272,0.00010698433,0.0006250991,0.00024131927,0.000041143438,0.0011739766,0.00017979021,0.30850515,0.015952649,0.48904645,0.1840371,0.000053590997],"about_ca_topic_score_codex":0.0004844959,"about_ca_topic_score_gemma":0.0009261139,"teacher_disagreement_score":0.016908666,"about_ca_system_score_codex":0.00044204443,"about_ca_system_score_gemma":0.00033649086,"threshold_uncertainty_score":0.056565166},"labels":[],"label_agreement":null},{"id":"W1561451935","doi":"10.1016/j.comgeo.2011.05.006","title":"A survey of geodesic paths on 3D surfaces","year":2011,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":76,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"National Research Council Canada; Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Geodesic; Mathematics; Geometry; Computer science","score_opus":0.06421114022435775,"score_gpt":0.26575912089879966,"score_spread":0.2015479806744419,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1561451935","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007404855,0.066916876,0.90185183,0.0010824723,0.00048909365,0.00010185032,0.0004873258,0.00079183775,0.020873917],"genre_scores_gemma":[0.070792995,0.1679996,0.74127835,0.00048576973,0.0009842069,0.00027704958,0.0020262983,0.0011577889,0.014998021],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99920505,0.00015914312,0.00007495569,0.00016671125,0.00035753427,0.0000366614],"domain_scores_gemma":[0.99916327,0.00038843736,0.000051216404,0.00014294399,0.00020091908,0.000053186846],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008846742,0.0011866139,0.0016601977,0.0040501733,0.0010155205,0.002849762,0.0020968735,0.0017490275,0.0071635484],"category_scores_gemma":[0.0031617123,0.0013586896,0.00126462,0.007559545,0.001276702,0.00463613,0.0024984134,0.0021355962,0.0030751051],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000435903,0.000053550604,0.00075981265,0.0018962458,0.000050307815,0.00009432698,0.00026698987,0.051069934,0.0019979803,0.37255612,0.015124264,0.55608684],"study_design_scores_gemma":[0.000026328946,0.00009509,0.0005961762,0.0007049594,0.000040172734,0.0005125552,0.00012666418,0.174295,0.002234041,0.53553724,0.28577447,0.000057312023],"about_ca_topic_score_codex":0.0019817557,"about_ca_topic_score_gemma":0.002174009,"teacher_disagreement_score":0.0071635484,"about_ca_system_score_codex":0.0012565108,"about_ca_system_score_gemma":0.0011689367,"threshold_uncertainty_score":0.023964465},"labels":[],"label_agreement":null},{"id":"W1562300282","doi":"10.1016/j.comgeo.2016.02.002","title":"Discrete Voronoi games and ϵ-nets, in two and three dimensions","year":2016,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Auction Theory and Applications","field":"Decision Sciences","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Voronoi diagram; Stochastic game; Disjoint sets; Cardinality (data modeling); Mathematics; Combinatorics; Polynomial; Point (geometry); Set (abstract data type); Discrete mathematics; Mathematical optimization; Computer science; Mathematical economics; Geometry; Mathematical analysis","score_opus":0.04909594309911264,"score_gpt":0.3784666469523827,"score_spread":0.32937070385327005,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1562300282","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28507382,0.0052501056,0.64079934,0.003871554,0.0004297702,0.00011733995,0.0007022393,0.00011290544,0.06364299],"genre_scores_gemma":[0.90983266,0.0021229573,0.073945664,0.00021696746,0.00024279258,0.00011835947,0.00023599033,0.000030889903,0.013253629],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986222,0.0007081962,0.000060977276,0.00013984593,0.00029946075,0.000169262],"domain_scores_gemma":[0.9956475,0.002933049,0.0005458271,0.00013221869,0.0002648545,0.00047658576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014988818,0.0007043855,0.0012515421,0.0012454778,0.0012530169,0.0052348278,0.0016143756,0.0015800588,0.0040227477],"category_scores_gemma":[0.0070991237,0.0005211736,0.0007799823,0.0017579435,0.0037833487,0.0041671684,0.0019200295,0.0012905877,0.00024398377],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053909116,0.000013615093,0.000268905,0.000034224784,0.000012505285,0.000028882947,0.000051400373,0.037007663,0.00009801877,0.95866233,0.0005383891,0.0032300772],"study_design_scores_gemma":[0.00003251953,0.000013089025,0.00023866845,0.000018987837,0.000007813161,0.000043786607,0.00012721507,0.13555892,0.00009001392,0.8618598,0.0019934517,0.00001586239],"about_ca_topic_score_codex":0.00601822,"about_ca_topic_score_gemma":0.005826138,"teacher_disagreement_score":0.00601822,"about_ca_system_score_codex":0.002385318,"about_ca_system_score_gemma":0.0013219084,"threshold_uncertainty_score":0.017306805},"labels":[],"label_agreement":null},{"id":"W1582516383","doi":"10.1016/s0925-7721(01)00009-8","title":"Efficient randomized algorithms for robust estimation of circular arcs and aligned ellipses☆☆A preliminary version of this report was presented at the Fifth Canadian Conference on Computational Geometry [32].","year":2001,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Image and Object Detection Techniques","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Ellipse; Estimator; Mathematics; Geometry; Conic section; Robustness (evolution); Algorithm; Arc (geometry); Statistics","score_opus":0.019067213175143528,"score_gpt":0.263155399745561,"score_spread":0.24408818657041748,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1582516383","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025982184,0.00013708034,0.9956311,0.00010099392,0.000044924735,0.000051214334,0.000097725955,0.0008854797,0.00045326137],"genre_scores_gemma":[0.089822344,0.00018043316,0.90638083,0.00012685376,0.00015354957,0.0003048114,0.0009066734,0.00037315555,0.0017513316],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954705,0.0014625037,0.00029074005,0.0013418321,0.00097339286,0.00046097886],"domain_scores_gemma":[0.985844,0.00867683,0.0013002718,0.0026523937,0.0011663407,0.00036022722],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040088077,0.002243517,0.0032391439,0.002272974,0.0013709827,0.0023107752,0.0047248183,0.0027972015,0.008515948],"category_scores_gemma":[0.024255414,0.0019351626,0.0017042697,0.0033266766,0.0020636448,0.0034451345,0.0044422112,0.003838505,0.0031135487],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013401299,0.0002869442,0.00095125375,0.0003378765,0.00022494177,0.0001485391,0.00019101067,0.52569693,0.009140841,0.08241817,0.012531255,0.36673215],"study_design_scores_gemma":[0.00014325551,0.00007561529,0.00018453585,0.000015784179,0.000021349882,0.000054879714,0.00002474977,0.9608169,0.0028575598,0.034331936,0.0014423615,0.000031110885],"about_ca_topic_score_codex":0.008025155,"about_ca_topic_score_gemma":0.0133781135,"teacher_disagreement_score":0.008515948,"about_ca_system_score_codex":0.002104238,"about_ca_system_score_gemma":0.004169551,"threshold_uncertainty_score":0.028488696},"labels":[],"label_agreement":null},{"id":"W1584311686","doi":"10.1016/s0925-7721(01)00006-2","title":"The DFS-heuristic for orthogonal graph drawing☆☆Some of these result were published in the author's PhD thesis at Rutgers University; the author would like to thank her advisor, Prof. Endre Boros, for much helpful input. The results in Section 5 have been presented at the 8th Canadian Conference on Computational Geometry, Ottawa, 1996, see [1].","year":2001,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Graph; Heuristic; Enhanced Data Rates for GSM Evolution; Computer science; Mathematics; Discrete mathematics; Theoretical computer science; Artificial intelligence","score_opus":0.03544733803028847,"score_gpt":0.27145615317288,"score_spread":0.23600881514259156,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1584311686","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09443804,0.0017475936,0.8208023,0.0022218288,0.0011221854,0.0010643201,0.0024119208,0.004052963,0.07213891],"genre_scores_gemma":[0.22651942,0.00062163913,0.7270826,0.00036812224,0.00015572914,0.00037587676,0.003284915,0.0012087766,0.04038296],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99933076,0.00013895635,0.00002471399,0.00011928435,0.0001933329,0.00019307256],"domain_scores_gemma":[0.9986099,0.0006088074,0.00006765695,0.00037442526,0.00022237086,0.000116844196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072059315,0.00092912326,0.000757464,0.0011847848,0.0013303757,0.0010248882,0.0015894179,0.00064805325,0.03908171],"category_scores_gemma":[0.0033696732,0.0003450301,0.0009789268,0.0015842845,0.0006960038,0.0020846028,0.0012397971,0.001384318,0.0031004103],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005906872,0.0005054312,0.0011734185,0.00068708125,0.00008424246,0.00016287372,0.00019749752,0.102421306,0.0068821614,0.10161981,0.07256764,0.7131079],"study_design_scores_gemma":[0.00037918938,0.00044567097,0.0013610803,0.00015383847,0.00015597433,0.00044707596,0.00044020955,0.69295496,0.017222987,0.20668101,0.079686314,0.00007166322],"about_ca_topic_score_codex":0.006820614,"about_ca_topic_score_gemma":0.018319864,"teacher_disagreement_score":0.03908171,"about_ca_system_score_codex":0.0017309933,"about_ca_system_score_gemma":0.0023294883,"threshold_uncertainty_score":0.13074136},"labels":[],"label_agreement":null},{"id":"W1658042064","doi":"10.1016/j.comgeo.2016.05.005","title":"Analysis of farthest point sampling for approximating geodesics in a graph","year":2016,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":36,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Combinatorics; Geodesic; Vertex (graph theory); Mathematics; Distance; Shortest path problem; Path graph; Bounded function; Computation; Graph; Discrete mathematics; Graph power; Algorithm; Geometry; Line graph; Mathematical analysis","score_opus":0.03545272358260807,"score_gpt":0.28902768903354975,"score_spread":0.25357496545094166,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1658042064","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052797113,0.00049432827,0.94397324,0.00024963598,0.000048244885,0.0000746255,0.00010322764,0.00024623988,0.002013324],"genre_scores_gemma":[0.68355346,0.0007771405,0.30966324,0.00021352316,0.00016723189,0.0002073858,0.00088718126,0.0004850842,0.0040456676],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986889,0.0005118826,0.000050197203,0.00015696451,0.00048785747,0.00010418476],"domain_scores_gemma":[0.98691213,0.010404397,0.00049046124,0.0005869468,0.0011062127,0.0004997829],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034789613,0.001261049,0.0014921238,0.0025614665,0.00074529776,0.0015102121,0.0023119575,0.0019424241,0.0030647658],"category_scores_gemma":[0.023944141,0.0007997913,0.0011283805,0.0015396586,0.0016252114,0.0019568251,0.002124287,0.0016559551,0.0003803986],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028284697,0.000103545666,0.002588453,0.00019385635,0.0000621391,0.00011548159,0.0001740942,0.87599283,0.003948049,0.08078224,0.0014373815,0.034319144],"study_design_scores_gemma":[0.0000038298126,0.000012504938,0.00008008463,0.0000053917006,0.000003275485,0.000012527128,0.000008085692,0.99477226,0.00021923099,0.0047557713,0.00012410259,0.000002943221],"about_ca_topic_score_codex":0.00860944,"about_ca_topic_score_gemma":0.0073704673,"teacher_disagreement_score":0.00860944,"about_ca_system_score_codex":0.002285183,"about_ca_system_score_gemma":0.0013989215,"threshold_uncertainty_score":0.018398702},"labels":[],"label_agreement":null},{"id":"W1710148940","doi":"10.1016/j.comgeo.2015.06.005","title":"Approximating the bottleneck plane perfect matching of a point set","year":2015,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; Israel Science Foundation","keywords":"Bottleneck; Matching (statistics); Plane (geometry); Combinatorics; Enhanced Data Rates for GSM Evolution; Mathematics; Set (abstract data type); Point (geometry); Algorithm; Computer science; Geometry; Artificial intelligence; Statistics","score_opus":0.03667188324158616,"score_gpt":0.26998025246331553,"score_spread":0.23330836922172937,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1710148940","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09076804,0.00017749718,0.9010318,0.00012965429,0.000054003125,0.000070691895,0.0001729851,0.0005901588,0.0070052263],"genre_scores_gemma":[0.6195539,0.00021103947,0.37491181,0.00006283316,0.000025708765,0.00008143011,0.00040460768,0.00024994023,0.0044987076],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991628,0.00013032605,0.000039206734,0.00013560428,0.00042552114,0.000106493564],"domain_scores_gemma":[0.99877065,0.00053501746,0.00011875927,0.00025328642,0.00023782556,0.00008450191],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010781253,0.00068846927,0.0010960115,0.0016074743,0.0003735614,0.0017670828,0.0016018089,0.0016229323,0.004557091],"category_scores_gemma":[0.006920856,0.0008333657,0.00063336204,0.0014441842,0.00084937795,0.0021669876,0.0027959915,0.0012095625,0.0010270668],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007598851,0.00017642543,0.0028949392,0.0002387901,0.000075402015,0.0003153599,0.00021408967,0.73406965,0.012649126,0.10899803,0.004036649,0.13557167],"study_design_scores_gemma":[0.000017365055,0.000040907657,0.00014881526,0.000009742214,0.000006598692,0.00007303122,0.000027242215,0.98245126,0.0022340554,0.013994294,0.0009909599,0.0000058496307],"about_ca_topic_score_codex":0.0033189214,"about_ca_topic_score_gemma":0.002803932,"teacher_disagreement_score":0.004557091,"about_ca_system_score_codex":0.001151314,"about_ca_system_score_gemma":0.0010043374,"threshold_uncertainty_score":0.01524502},"labels":[],"label_agreement":null},{"id":"W1822031247","doi":"10.1016/j.comgeo.2017.06.009","title":"Strong matching of points with geometric shapes","year":2017,"lang":"en","type":"preprint","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Equilateral triangle; Combinatorics; Mathematics; Matching (statistics); Disjoint sets; Incircle and excircles of a triangle; Regular polygon; Upper and lower bounds; General position; Geometry; Mathematical analysis","score_opus":0.029531536936662967,"score_gpt":0.2833987703164079,"score_spread":0.2538672333797449,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1822031247","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03443387,0.00015856199,0.9611497,0.00019809442,0.00010021078,0.00007680467,0.00011871578,0.0004423078,0.0033217391],"genre_scores_gemma":[0.5954807,0.0004781181,0.38460752,0.00035729245,0.0002876615,0.00024013687,0.0011092416,0.00071232935,0.016727146],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9960039,0.00097345514,0.00021187234,0.0010309395,0.001469484,0.00031039823],"domain_scores_gemma":[0.99279356,0.002496726,0.0008041408,0.0023732178,0.0010953035,0.00043699867],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002748678,0.0011953203,0.0018975387,0.002835211,0.0010044125,0.0034823385,0.0034629395,0.0035294455,0.007269444],"category_scores_gemma":[0.02114738,0.0015631373,0.001744614,0.003020059,0.0025270935,0.0063644596,0.009785271,0.0033685444,0.0027944762],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00084784365,0.00029963543,0.0036493428,0.00058625446,0.00021063548,0.00062842923,0.0006526191,0.1607947,0.03560574,0.56088537,0.008575687,0.22726376],"study_design_scores_gemma":[0.000052404328,0.00017986172,0.00058488996,0.000048280348,0.000041409003,0.0003060581,0.00015810465,0.4651278,0.013576857,0.51398784,0.00590572,0.000030860254],"about_ca_topic_score_codex":0.0006632651,"about_ca_topic_score_gemma":0.0005653659,"teacher_disagreement_score":0.007269444,"about_ca_system_score_codex":0.0010405554,"about_ca_system_score_gemma":0.0007881036,"threshold_uncertainty_score":0.024318695},"labels":[],"label_agreement":null},{"id":"W1867622403","doi":"10.1016/j.comgeo.2015.11.001","title":"Kinetic k-Semi-Yao graph and its applications","year":2015,"lang":"en","type":"preprint","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Combinatorics; Graph; k-nearest neighbors algorithm; Bounded function; Mathematics; Epigraph; Degree (music); Kinetic energy; Discrete mathematics; Physics; Computer science; Mathematical analysis","score_opus":0.030142382045293074,"score_gpt":0.2807996737333427,"score_spread":0.2506572916880496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1867622403","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13625135,0.0020529116,0.7970045,0.0032002523,0.0004083545,0.00008891616,0.0005602812,0.00050593645,0.05992755],"genre_scores_gemma":[0.80479467,0.0028303477,0.1371085,0.0006655328,0.00046386936,0.000192052,0.0006948274,0.00055166875,0.052698515],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99965024,0.000107872,0.000016669193,0.00007524434,0.000111573274,0.000038427523],"domain_scores_gemma":[0.9983575,0.00071038684,0.00021991349,0.00019853267,0.00030023142,0.00021336711],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007384556,0.00065217604,0.00081939274,0.0024707443,0.0013684442,0.0014980428,0.0015112378,0.0016112508,0.007806572],"category_scores_gemma":[0.0045287823,0.0005119289,0.00075852004,0.002195086,0.0025701786,0.003813106,0.0024125746,0.0023201208,0.0009175888],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019578732,0.000013064542,0.00016609863,0.00003701728,0.000005280194,0.00002105166,0.00004869441,0.010217613,0.00048346102,0.9824562,0.0011528082,0.005379035],"study_design_scores_gemma":[0.0000072122516,0.000009004411,0.00009776737,0.000010569776,0.000004338229,0.000043713513,0.000029614142,0.05789206,0.00029434997,0.93879336,0.002808146,0.000009805266],"about_ca_topic_score_codex":0.0016697119,"about_ca_topic_score_gemma":0.0015248815,"teacher_disagreement_score":0.007806572,"about_ca_system_score_codex":0.001164098,"about_ca_system_score_gemma":0.00079086993,"threshold_uncertainty_score":0.026115596},"labels":[],"label_agreement":null},{"id":"W1964672542","doi":"10.1016/j.comgeo.2009.06.005","title":"Homogeneous 2-hop broadcast in 2D","year":2009,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Homogeneous; Hop (telecommunications); Range (aeronautics); Computer science; Power consumption; Mathematics; Set (abstract data type); Mathematical optimization; Combinatorics; Discrete mathematics; Algorithm; Power (physics); Computer network; Physics; Engineering","score_opus":0.010821408733593264,"score_gpt":0.24448745983221187,"score_spread":0.2336660510986186,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1964672542","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11153211,0.00092530716,0.87212086,0.00050158706,0.000156407,0.000105266976,0.000624975,0.0004950427,0.013538486],"genre_scores_gemma":[0.8847884,0.0012108075,0.09797324,0.00023425814,0.0002348126,0.00017422454,0.00065457233,0.0001522477,0.014577541],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99918646,0.00029381554,0.000033445827,0.00013946346,0.00018931572,0.00015750183],"domain_scores_gemma":[0.99792385,0.0013971662,0.00018171225,0.00022252984,0.00015038165,0.0001244554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006670859,0.00060158415,0.0013302288,0.0011635802,0.00087646424,0.0015451235,0.001278962,0.0010948286,0.003032916],"category_scores_gemma":[0.0031377994,0.0007087343,0.00043221496,0.0018253408,0.001087389,0.0016764746,0.0020854978,0.0006937248,0.0006962715],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008349746,0.00010851628,0.0011816702,0.00030684748,0.00007178475,0.00049264607,0.000454425,0.7516382,0.008906884,0.18750226,0.007190576,0.04131122],"study_design_scores_gemma":[0.00005649428,0.00004854012,0.0003360856,0.000010890081,0.000019350786,0.000103348924,0.000103225495,0.94677377,0.0014355174,0.049133115,0.0019605502,0.000019081599],"about_ca_topic_score_codex":0.0031782538,"about_ca_topic_score_gemma":0.002886235,"teacher_disagreement_score":0.0031782538,"about_ca_system_score_codex":0.00093381817,"about_ca_system_score_gemma":0.0005344842,"threshold_uncertainty_score":0.010146141},"labels":[],"label_agreement":null},{"id":"W1965013906","doi":"10.1016/j.comgeo.2010.06.002","title":"A note on the perimeter of fat objects","year":2010,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Perimeter; Constant (computer programming); Generalization; Object (grammar); Boundary (topology); Mathematics; Point (geometry); Function (biology); Fraction (chemistry); Combinatorics; Geometry; Mathematical analysis; Computer science; Artificial intelligence; Chemistry","score_opus":0.015173752263658311,"score_gpt":0.2597205595318366,"score_spread":0.2445468072681783,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1965013906","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012270183,0.021565128,0.85792464,0.012171166,0.01237391,0.000056502104,0.00027616575,0.0006979631,0.08266446],"genre_scores_gemma":[0.23371927,0.028718866,0.65899307,0.0036789603,0.014941903,0.00015360581,0.0004153904,0.0022946002,0.05708432],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989737,0.00025760956,0.0000739439,0.00025183315,0.00038167016,0.00006120234],"domain_scores_gemma":[0.9952453,0.0031524196,0.00012991093,0.00086582056,0.00042554253,0.00018097513],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016580794,0.00093945366,0.0010321784,0.001728607,0.0016052718,0.002797179,0.0021907862,0.0017491666,0.0063337726],"category_scores_gemma":[0.008388922,0.0006125724,0.0012515796,0.0015237893,0.0062544513,0.006480792,0.0038742665,0.006402811,0.0022496637],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000094699935,0.00001825512,0.0003881407,0.00034563898,0.000018572822,0.00053156464,0.0004380961,0.010700068,0.004875535,0.83381516,0.026879538,0.12189475],"study_design_scores_gemma":[0.000013133448,0.00007406368,0.000440976,0.00014101565,0.00002697467,0.0009199051,0.00017596238,0.023528783,0.0038572277,0.7570504,0.21372312,0.000048382273],"about_ca_topic_score_codex":0.0007364215,"about_ca_topic_score_gemma":0.0009452776,"teacher_disagreement_score":0.0063337726,"about_ca_system_score_codex":0.0006304423,"about_ca_system_score_gemma":0.0004827402,"threshold_uncertainty_score":0.021188557},"labels":[],"label_agreement":null},{"id":"W1965735113","doi":"10.1016/j.comgeo.2006.03.004","title":"Algorithms for optimal area triangulations of a convex polygon","year":2006,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Polygon (computer graphics); Regular polygon; Convex polygon; Rectilinear polygon; Polygon covering; Star-shaped polygon; Combinatorics; Computer science; Mathematics; Mathematical optimization; Algorithm; Geometry; Convex set; Convex optimization; Simple polygon","score_opus":0.026488356608938498,"score_gpt":0.2731884271811129,"score_spread":0.2467000705721744,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1965735113","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0063372757,0.00015996558,0.9902783,0.000088424415,0.000043014796,0.000076187214,0.00007883312,0.0005698045,0.0023681526],"genre_scores_gemma":[0.09470711,0.00028822158,0.9013457,0.000058420334,0.00006048924,0.00025964878,0.00033153602,0.00056723214,0.0023815285],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99904436,0.00018829513,0.00005538956,0.00016452174,0.0004497725,0.00009759664],"domain_scores_gemma":[0.9977729,0.0014096483,0.00014011422,0.00024018051,0.00034796406,0.00008921886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011694852,0.0012756585,0.0015446527,0.002026392,0.0009380329,0.0016571522,0.0021401064,0.0015131306,0.011612841],"category_scores_gemma":[0.0076161805,0.0014268762,0.0013890589,0.0022292328,0.0010933799,0.0023387845,0.0040624696,0.0022069686,0.0020525],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029627714,0.00010325267,0.0008311121,0.00042257574,0.000076697215,0.0001375893,0.0005274669,0.46563783,0.0070328284,0.093403704,0.0101355165,0.42139506],"study_design_scores_gemma":[0.000070007016,0.000045933622,0.00013090562,0.000032011256,0.000019985631,0.00006490455,0.0000938928,0.9289917,0.0018283273,0.06477725,0.003931445,0.000013776867],"about_ca_topic_score_codex":0.0024446563,"about_ca_topic_score_gemma":0.003974793,"teacher_disagreement_score":0.011612841,"about_ca_system_score_codex":0.0009239963,"about_ca_system_score_gemma":0.0008221862,"threshold_uncertainty_score":0.038848817},"labels":[],"label_agreement":null},{"id":"W1965954846","doi":"10.1016/j.comgeo.2013.11.005","title":"Reprint of: Approximating majority depth","year":2013,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Vertex (graph theory); Set (abstract data type); Combinatorics; Mathematics; Point (geometry); Monte Carlo method; Algorithm; Discrete mathematics; Computer science; Statistics; Geometry; Graph","score_opus":0.01596087859365865,"score_gpt":0.2432439789978515,"score_spread":0.22728310040419283,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1965954846","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011622781,0.0038310485,0.7872698,0.0077604195,0.0554948,0.00010853871,0.005207114,0.004756865,0.12394873],"genre_scores_gemma":[0.2678884,0.0033385123,0.4337688,0.003181564,0.011740712,0.00018554172,0.006109934,0.0056731356,0.2681134],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99947006,0.000087096865,0.000034680837,0.00011834819,0.0002468706,0.00004303322],"domain_scores_gemma":[0.9983126,0.0004366541,0.000057688914,0.00069099036,0.0004285165,0.00007352696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049880537,0.00089705427,0.0008671142,0.0010295048,0.00049026235,0.0013517496,0.0013500835,0.0010916631,0.084061995],"category_scores_gemma":[0.007051999,0.00037278072,0.00060893426,0.0017551165,0.0008265415,0.0019430973,0.0012732678,0.0020994702,0.019294046],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034504576,0.000059296057,0.0005498131,0.00045832962,0.00005401414,0.00037654905,0.00007676269,0.029276771,0.006599642,0.1294556,0.44121194,0.39153633],"study_design_scores_gemma":[0.0000876129,0.00013688629,0.0014801989,0.00014852463,0.000060127266,0.001404342,0.000104658604,0.26630232,0.013494193,0.2260294,0.49069118,0.000060538314],"about_ca_topic_score_codex":0.0011916182,"about_ca_topic_score_gemma":0.003121385,"teacher_disagreement_score":0.084061995,"about_ca_system_score_codex":0.0005359792,"about_ca_system_score_gemma":0.00039186823,"threshold_uncertainty_score":0.28121537},"labels":[],"label_agreement":null},{"id":"W1966285206","doi":"10.1016/j.comgeo.2004.12.005","title":"The Erdős–Nagy theorem and its ramifications","year":2005,"lang":"en","type":"article","venue":"Computational Geometry","topic":"semigroups and automata theory","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Mathematical economics; Law and economics; Mathematics; Economics","score_opus":0.011067270117584294,"score_gpt":0.2451078317531823,"score_spread":0.234040561635598,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1966285206","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16786367,0.039958365,0.39826936,0.058539104,0.003344675,0.00008520242,0.0010750323,0.00040158763,0.33046302],"genre_scores_gemma":[0.87860864,0.019367399,0.05275516,0.0048219175,0.006509291,0.00028697954,0.00045458187,0.00019520758,0.037000794],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99836177,0.00044427367,0.00010080349,0.00050993485,0.00042899436,0.0001541972],"domain_scores_gemma":[0.99607,0.002481174,0.0003633943,0.0005059644,0.0003575394,0.00022191403],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024078474,0.0010106199,0.002249176,0.0025966638,0.0031928713,0.0044389777,0.0017183529,0.0031056462,0.008054647],"category_scores_gemma":[0.007604116,0.0007896519,0.0013485638,0.003550631,0.013125736,0.017176483,0.0059140595,0.0076442137,0.0013952398],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000882119,0.0000047087865,0.000034559023,0.000016007149,0.0000031938696,0.000017661208,0.000061474246,0.00018457187,0.00004870165,0.99717027,0.0007440928,0.0017058626],"study_design_scores_gemma":[0.0000057627217,0.0000021182184,0.000030862764,0.0000037663933,0.0000017169912,0.000022605967,0.000015475338,0.00030308563,0.000022738099,0.99781716,0.0017711422,0.000003444752],"about_ca_topic_score_codex":0.0011270182,"about_ca_topic_score_gemma":0.0005373804,"teacher_disagreement_score":0.008054647,"about_ca_system_score_codex":0.002111825,"about_ca_system_score_gemma":0.0008574341,"threshold_uncertainty_score":0.026945472},"labels":[],"label_agreement":null},{"id":"W1968440069","doi":"10.1016/j.comgeo.2015.02.003","title":"Fast algorithms for approximate Fréchet matching queries in geometric trees","year":2015,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Australian Research Council; Natural Sciences and Engineering Research Council of Canada","keywords":"Path (computing); Combinatorics; Matching (statistics); Mathematics; Tree (set theory); Data structure; Algorithm; Line segment; Line (geometry); Computer science; Geometry","score_opus":0.046766080692973964,"score_gpt":0.29378868331542923,"score_spread":0.24702260262245526,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1968440069","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033478294,0.0013877385,0.94944227,0.00087334344,0.00022116702,0.00028635393,0.0012883757,0.008170976,0.004851589],"genre_scores_gemma":[0.2588568,0.0006708289,0.7259616,0.0003828649,0.00023472437,0.000439275,0.004969203,0.0015086901,0.00697587],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99477357,0.00071127294,0.00042573936,0.0011563617,0.0022924102,0.0006407332],"domain_scores_gemma":[0.9893707,0.0055714017,0.00053052703,0.002916466,0.0012477371,0.00036318006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002436647,0.0021025934,0.0038801336,0.0037082888,0.0020145588,0.0058496697,0.006129287,0.0039826934,0.01852621],"category_scores_gemma":[0.020355508,0.0014119396,0.0022143754,0.008616387,0.0016467269,0.012802411,0.007588462,0.0036042042,0.0059731514],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016488926,0.000524363,0.0030007144,0.0009199167,0.00021271971,0.00024447034,0.0008119924,0.130671,0.010913202,0.11757132,0.050222512,0.68325883],"study_design_scores_gemma":[0.00020240499,0.0001410965,0.0004664508,0.000049291477,0.00006845663,0.00026387713,0.00039220997,0.78010434,0.005246453,0.20473619,0.008279704,0.000049601666],"about_ca_topic_score_codex":0.006019135,"about_ca_topic_score_gemma":0.010068715,"teacher_disagreement_score":0.01852621,"about_ca_system_score_codex":0.003306388,"about_ca_system_score_gemma":0.0026152334,"threshold_uncertainty_score":0.061976314},"labels":[],"label_agreement":null},{"id":"W1968580189","doi":"10.1016/j.comgeo.2009.07.003","title":"Improved algorithms to network p -center location problems","year":2013,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Center (category theory); Computer science; Algorithm; Chemistry","score_opus":0.01901714682374311,"score_gpt":0.2252630909014266,"score_spread":0.20624594407768349,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1968580189","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005750177,0.0003046997,0.988755,0.00032786417,0.00016881702,0.000058152727,0.00012071977,0.00050336594,0.0040111914],"genre_scores_gemma":[0.15911901,0.00053567946,0.83125,0.00022237847,0.0003637855,0.00034462957,0.00060513336,0.0004365093,0.007122813],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985765,0.0005897236,0.00006623921,0.00026760422,0.00035748185,0.00014245557],"domain_scores_gemma":[0.99519414,0.0029003464,0.0002242702,0.00068097137,0.0008091228,0.00019114293],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002079745,0.0017981816,0.0022087872,0.0020472568,0.0011838964,0.0020349808,0.004495818,0.0024626448,0.009809104],"category_scores_gemma":[0.012566486,0.0009919466,0.0014645025,0.003090231,0.0014389087,0.0032068214,0.0037629765,0.0031355463,0.0019915372],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000096245974,0.000101364516,0.00035023762,0.00010224666,0.000038753056,0.00004394782,0.00005934594,0.899643,0.00047232004,0.034963056,0.00644169,0.057687644],"study_design_scores_gemma":[0.000023595974,0.000010413976,0.000040703213,0.000004902513,0.000005866611,0.000008321738,0.000008405095,0.98456013,0.00013284483,0.014129517,0.0010714253,0.0000038877797],"about_ca_topic_score_codex":0.012658327,"about_ca_topic_score_gemma":0.012961276,"teacher_disagreement_score":0.012658327,"about_ca_system_score_codex":0.001943727,"about_ca_system_score_gemma":0.0022459978,"threshold_uncertainty_score":0.03281474},"labels":[],"label_agreement":null},{"id":"W1969149193","doi":"10.1016/j.comgeo.2014.09.001","title":"Guest editorial: Special issue on the 25th Canadian Conference on Computational Geometry (CCCG)","year":2014,"lang":"en","type":"editorial","venue":"Computational Geometry","topic":"3D Modeling in Geospatial Applications","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Geometry; Computer science; Mathematics","score_opus":0.012673999205275304,"score_gpt":0.24178915166898413,"score_spread":0.2291151524637088,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1969149193","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000021887601,0.002780658,0.000095681375,0.02039192,0.9749405,0.000018345543,0.000059355836,0.000042483385,0.0016492145],"genre_scores_gemma":[0.0003947731,0.0034233124,0.0001286537,0.012002234,0.9642366,0.000031016603,0.00007840188,0.00008142847,0.01962348],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9936977,0.0006536368,0.00042962647,0.00074596115,0.0039018884,0.0005711328],"domain_scores_gemma":[0.977391,0.0042576487,0.0012853141,0.00052577927,0.011756166,0.004784137],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005909831,0.004047968,0.004861679,0.005653673,0.0038057484,0.01012991,0.0037513769,0.014904102,0.042598423],"category_scores_gemma":[0.024536522,0.0012412564,0.0030243422,0.0019429715,0.0024173672,0.0035545824,0.0024760985,0.013803164,0.022985486],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020025198,0.0000051404836,0.000011595633,0.000049852955,0.0000072756943,0.000035629117,0.0000033984334,0.000012734449,0.000026336915,0.00008586655,0.99809307,0.0016490859],"study_design_scores_gemma":[0.00007279472,0.000020271835,0.00025251682,0.00022638419,0.000044112243,0.000113436705,0.000026759308,0.00016720023,0.00009261207,0.0005630824,0.9984041,0.000016758375],"about_ca_topic_score_codex":0.0056466428,"about_ca_topic_score_gemma":0.01921319,"teacher_disagreement_score":0.99435335,"about_ca_system_score_codex":0.0045535713,"about_ca_system_score_gemma":0.004966346,"threshold_uncertainty_score":0.14250594},"labels":[],"label_agreement":null},{"id":"W1973989497","doi":"10.1016/j.comgeo.2012.10.005","title":"Families of polytopal digraphs that do not satisfy the shelling property","year":2012,"lang":"en","type":"article","venue":"Computational Geometry","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Property (philosophy); Mathematics; Combinatorics; Philosophy","score_opus":0.017847801814345886,"score_gpt":0.20855456157778607,"score_spread":0.19070675976344018,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1973989497","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.74603117,0.0005327859,0.17081885,0.0006815495,0.00009241308,0.00011092744,0.001564112,0.0005587026,0.079609476],"genre_scores_gemma":[0.97329783,0.00031217575,0.017509285,0.00017352015,0.00002611578,0.00008059323,0.0017366079,0.0000914489,0.00677249],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993192,0.00011483042,0.000038695016,0.00020469486,0.0001664167,0.00015620526],"domain_scores_gemma":[0.99516416,0.0027255535,0.00055146735,0.00070428825,0.00035068608,0.0005037365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005809197,0.00046631193,0.00090126775,0.0012431104,0.0022145999,0.0024709795,0.0011525111,0.0009351773,0.006750666],"category_scores_gemma":[0.003965156,0.00072231615,0.00084872264,0.001263161,0.0014867958,0.002878441,0.0016050036,0.0012404203,0.00057965313],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022691413,0.00010529216,0.0045385985,0.00017111789,0.00007836171,0.00085990404,0.00044776208,0.017881466,0.0037080746,0.9509716,0.005157639,0.015853312],"study_design_scores_gemma":[0.00008793671,0.00007527322,0.004084304,0.00008232521,0.000071070834,0.0017250709,0.00076009997,0.0707417,0.004188384,0.90392953,0.014201223,0.000052992757],"about_ca_topic_score_codex":0.0010802118,"about_ca_topic_score_gemma":0.0014777882,"teacher_disagreement_score":0.006750666,"about_ca_system_score_codex":0.0008806629,"about_ca_system_score_gemma":0.000695962,"threshold_uncertainty_score":0.022583246},"labels":[],"label_agreement":null},{"id":"W1974889018","doi":"10.1016/j.comgeo.2013.06.005","title":"Approximating majority depth","year":2013,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Geology; History; Computer science; Geography","score_opus":0.01508989316017984,"score_gpt":0.23910777834078173,"score_spread":0.2240178851806019,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1974889018","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048998,0.0010624521,0.9250552,0.0007946395,0.00020293563,0.00007473769,0.00042117987,0.001333679,0.022057254],"genre_scores_gemma":[0.5952639,0.0007396656,0.3755717,0.0004977711,0.0002724156,0.00015525238,0.0008760151,0.0009316733,0.025691656],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986051,0.00027093038,0.0000444347,0.00029067256,0.0005909811,0.0001980072],"domain_scores_gemma":[0.9979323,0.0010152241,0.00012013642,0.00046239505,0.00031042253,0.00015959765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011697214,0.0012283952,0.001690532,0.0015762157,0.0008428294,0.0019619958,0.0021532727,0.001942108,0.012481945],"category_scores_gemma":[0.0083901,0.00078537886,0.00095313066,0.001077727,0.0014228257,0.003737971,0.0045381347,0.0028639403,0.0023705156],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007610337,0.00013737204,0.0023038806,0.00029258826,0.00008685704,0.00019993709,0.00027415322,0.26022598,0.008284854,0.38495272,0.021334406,0.32114622],"study_design_scores_gemma":[0.000026377655,0.000057248933,0.00023854087,0.00003821228,0.000020283884,0.00011537515,0.00005689586,0.84416157,0.0028267915,0.14641395,0.006030965,0.000013793414],"about_ca_topic_score_codex":0.002900513,"about_ca_topic_score_gemma":0.0053717224,"teacher_disagreement_score":0.012481945,"about_ca_system_score_codex":0.0017169873,"about_ca_system_score_gemma":0.00100539,"threshold_uncertainty_score":0.041756332},"labels":[],"label_agreement":null},{"id":"W1976756638","doi":"10.1016/j.comgeo.2006.05.005","title":"On the stabbing number of a random Delaunay triangulation","year":2006,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Carleton University","funders":"","keywords":"Delaunay triangulation; Constrained Delaunay triangulation; Bowyer–Watson algorithm; Point set triangulation; Computer science; Triangulation; Combinatorics; Mathematics; Geometry","score_opus":0.01239512327578408,"score_gpt":0.24906029571117505,"score_spread":0.23666517243539098,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1976756638","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20607354,0.0020192675,0.7450256,0.002547263,0.0005814586,0.00022369006,0.00033357865,0.0008093382,0.042386305],"genre_scores_gemma":[0.78591216,0.0011210941,0.19669911,0.00047007942,0.00026219035,0.0004078788,0.0004714159,0.00063210115,0.014023953],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969099,0.001304822,0.00013913748,0.00039267316,0.0009493063,0.00030415037],"domain_scores_gemma":[0.963805,0.027625347,0.0017839738,0.0024575233,0.0023211818,0.0020069773],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00536351,0.00081207213,0.0017407152,0.0034133578,0.0022889616,0.0026423917,0.0026402439,0.002598249,0.008973887],"category_scores_gemma":[0.05394539,0.0010764279,0.00082006765,0.0021386042,0.0043533617,0.005033689,0.0033867757,0.0030516784,0.0011844452],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00064720085,0.00008078943,0.0020783707,0.00021013038,0.000037265152,0.00010829983,0.0003244629,0.261442,0.0039639734,0.6796364,0.0061973813,0.045273747],"study_design_scores_gemma":[0.000045417128,0.00008898349,0.0004726394,0.00006316365,0.00001860193,0.000075856835,0.00008352404,0.77337795,0.0012365268,0.22217816,0.0023251993,0.000033884662],"about_ca_topic_score_codex":0.0031654148,"about_ca_topic_score_gemma":0.0028247812,"teacher_disagreement_score":0.008973887,"about_ca_system_score_codex":0.002129597,"about_ca_system_score_gemma":0.00150699,"threshold_uncertainty_score":0.030020654},"labels":[],"label_agreement":null},{"id":"W1977007991","doi":"10.1016/s0925-7721(01)00030-x","title":"Editorial","year":2001,"lang":"en","type":"editorial","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Computer science","score_opus":0.008356688911675096,"score_gpt":0.26065084619139417,"score_spread":0.2522941572797191,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1977007991","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000050841907,0.0045298934,0.00013501725,0.020898603,0.965076,0.000032599324,0.00007183081,0.000071611656,0.009133556],"genre_scores_gemma":[0.0009917013,0.0048774886,0.00019759197,0.021589177,0.89270204,0.000052739826,0.00014574883,0.00008881283,0.079354726],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99754614,0.000397658,0.00025845616,0.00033357457,0.001218816,0.00024545137],"domain_scores_gemma":[0.9886736,0.0026546419,0.0009953047,0.00062381406,0.0049886378,0.0020639768],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032714147,0.002122555,0.0024050074,0.0035847093,0.0023372697,0.0055348733,0.0021542287,0.008447895,0.06608459],"category_scores_gemma":[0.016866146,0.0007848129,0.0015615186,0.0014031122,0.0012217078,0.0025052738,0.0016798452,0.008839455,0.040464483],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016866321,0.000004969241,0.000010073117,0.000066679284,0.000004731303,0.00006903955,0.0000031592563,0.000008722563,0.000026576434,0.00010347206,0.9945738,0.0051119425],"study_design_scores_gemma":[0.000026450356,0.000009451973,0.0001087444,0.00013265801,0.000015013863,0.0001574258,0.000011779313,0.00003625119,0.000051331812,0.00028406156,0.9991615,0.0000053854847],"about_ca_topic_score_codex":0.0010272162,"about_ca_topic_score_gemma":0.0026296035,"teacher_disagreement_score":0.06608459,"about_ca_system_score_codex":0.0016893663,"about_ca_system_score_gemma":0.001992831,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W1977842117","doi":"10.1016/j.comgeo.2014.09.007","title":"A fractional Helly theorem for boxes","year":2014,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Mathematics and Applications","field":"Mathematics","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Magyar Tudományos Akadémia; Consejo Nacional de Ciencia y Tecnología","keywords":"Combinatorics; Statement (logic); Mathematics; Point (geometry); Simple (philosophy); Real number; Discrete mathematics; Geometry; Philosophy","score_opus":0.04263429997949208,"score_gpt":0.33764381381362046,"score_spread":0.2950095138341284,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1977842117","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17711623,0.0033621124,0.5797441,0.012574662,0.0014865136,0.0001129042,0.00084732566,0.0006817803,0.22407445],"genre_scores_gemma":[0.8544368,0.0017117914,0.082822464,0.0026200826,0.0015282901,0.0002399185,0.0005713603,0.0004466906,0.055622537],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984914,0.00030794495,0.000075704906,0.00040979305,0.0004105731,0.00030461108],"domain_scores_gemma":[0.9969476,0.0017262074,0.0001584644,0.0006262708,0.00030166248,0.00023985784],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019826847,0.00085159484,0.0014880359,0.0023030238,0.004201767,0.004535333,0.0014956055,0.0019238603,0.010494592],"category_scores_gemma":[0.0068956926,0.0006982287,0.0018059725,0.0018467773,0.007860019,0.014970996,0.00572777,0.0060350467,0.0012558409],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015337275,0.0000038501666,0.000051416442,0.000013399535,0.000002726664,0.000014006468,0.000071841634,0.00019306275,0.00011166116,0.99731404,0.0007080925,0.001500546],"study_design_scores_gemma":[0.000007768461,0.0000041485796,0.000046134122,0.0000070309616,0.000005302715,0.000021294509,0.00002551048,0.0007571471,0.00016475117,0.9957098,0.0032457989,0.0000052840373],"about_ca_topic_score_codex":0.0015644387,"about_ca_topic_score_gemma":0.00082250306,"teacher_disagreement_score":0.010494592,"about_ca_system_score_codex":0.0022632063,"about_ca_system_score_gemma":0.0009975638,"threshold_uncertainty_score":0.03510791},"labels":[],"label_agreement":null},{"id":"W1978331593","doi":"10.1016/j.comgeo.2014.04.001","title":"Computing a visibility polygon using few variables","year":2014,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Ministerio de Ciencia e Innovación; Fundação para a Ciência e a Tecnologia; Ministerio de Economía y Competitividad; Generalitat de Catalunya; European Commission","keywords":"Simple polygon; Polygon (computer graphics); Visibility; Combinatorics; Constant (computer programming); Point in polygon; Mathematics; Randomized algorithm; Variable (mathematics); Computer science; Algorithm; Discrete mathematics; Monotone polygon; Physics; Mathematical analysis; Geometry","score_opus":0.020645412515549497,"score_gpt":0.27438129249126686,"score_spread":0.25373587997571734,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1978331593","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024569761,0.000054723765,0.9723254,0.00008043811,0.00004162672,0.000029125586,0.0000747548,0.00071979215,0.0021043937],"genre_scores_gemma":[0.3195161,0.00009016927,0.6776154,0.00004074897,0.00003480183,0.00005704716,0.00024825265,0.0005889116,0.0018086454],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995944,0.00007514354,0.000022291499,0.000093081835,0.00015947015,0.000055712833],"domain_scores_gemma":[0.99869424,0.0007598591,0.00008430557,0.00026154544,0.00012349137,0.00007657501],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041239124,0.0005607121,0.0010658705,0.0008070159,0.00068248896,0.0014245124,0.0011160526,0.00080054,0.0049117873],"category_scores_gemma":[0.003745006,0.00066301617,0.00077564485,0.0007835799,0.0009314438,0.001988724,0.0019303884,0.0015095501,0.0007851469],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005421436,0.00016986488,0.0027055684,0.00037107457,0.00011198164,0.00039598957,0.0004600701,0.47513974,0.022198167,0.122465625,0.006724459,0.36871544],"study_design_scores_gemma":[0.000032712553,0.000048788996,0.00018137203,0.000013636009,0.000012977577,0.000053516,0.000058615347,0.9498138,0.005158042,0.041749705,0.0028663883,0.000010464377],"about_ca_topic_score_codex":0.0025718415,"about_ca_topic_score_gemma":0.004055314,"teacher_disagreement_score":0.0049117873,"about_ca_system_score_codex":0.00041805799,"about_ca_system_score_gemma":0.0006541079,"threshold_uncertainty_score":0.01643157},"labels":[],"label_agreement":null},{"id":"W1982408165","doi":"10.1016/s0925-7721(01)00037-2","title":"Reconfiguring convex polygons","year":2001,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Geometric and Algebraic Topology","field":"Mathematics","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; University of Waterloo","funders":"","keywords":"Polygon (computer graphics); Monotone polygon; Rectilinear polygon; Regular polygon; Combinatorics; Star-shaped polygon; Mathematics; Polygon covering; Vertex (graph theory); Point in polygon; Bounded function; Convex polygon; Motion (physics); Simple polygon; Convex set; Geometry; Computer science; Mathematical analysis; Computer vision; Convex optimization; Graph","score_opus":0.057008716175654804,"score_gpt":0.3203182687844139,"score_spread":0.2633095526087591,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1982408165","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3279751,0.0006969922,0.56883085,0.0006036117,0.00047146596,0.000111586625,0.00037109476,0.003941908,0.09699734],"genre_scores_gemma":[0.8488812,0.0004634216,0.13308574,0.00015277293,0.000054501656,0.000059320533,0.00042491072,0.00079772493,0.016080424],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996811,0.000048972248,0.000021014006,0.00008774209,0.000110027424,0.00005124925],"domain_scores_gemma":[0.99914837,0.00015431044,0.00007007723,0.00048333,0.00006308812,0.00008082957],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016211967,0.0005516042,0.0005239837,0.0007498093,0.00059253006,0.0013944927,0.0010290105,0.0005271889,0.008605925],"category_scores_gemma":[0.0013643008,0.0004456619,0.00044461683,0.00072242494,0.0011399225,0.0022707495,0.0021700913,0.0009973134,0.0017542295],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005108086,0.00010097207,0.0016040943,0.00022117319,0.00005098875,0.0010201389,0.0010792934,0.14619221,0.10777435,0.30183122,0.008875664,0.43073907],"study_design_scores_gemma":[0.00006709021,0.000281234,0.0014970744,0.00008318205,0.00006203274,0.0013159731,0.0011625834,0.44841707,0.06507018,0.3606367,0.12132197,0.000084875595],"about_ca_topic_score_codex":0.00070332136,"about_ca_topic_score_gemma":0.00091128255,"teacher_disagreement_score":0.008605925,"about_ca_system_score_codex":0.00038187375,"about_ca_system_score_gemma":0.00022674073,"threshold_uncertainty_score":0.0287897},"labels":[],"label_agreement":null},{"id":"W1983682886","doi":"10.1016/j.comgeo.2008.06.005","title":"A vertex-face assignment for plane graphs","year":2008,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Vertex (graph theory); Combinatorics; Planar graph; Mathematics; Computer science; Graph","score_opus":0.02779556220493067,"score_gpt":0.25260025763125526,"score_spread":0.22480469542632459,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1983682886","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018271053,0.00007735447,0.9699743,0.0002280134,0.00010828978,0.00018014704,0.00029106898,0.00088863604,0.009981199],"genre_scores_gemma":[0.1370415,0.00018665502,0.85279757,0.00013797655,0.000067458604,0.00023760382,0.00063566194,0.0003713902,0.008524088],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99936336,0.00013754658,0.00003515741,0.00015497183,0.00022381524,0.00008508406],"domain_scores_gemma":[0.9991411,0.00022655044,0.000057091675,0.00024253334,0.00024090885,0.000091839465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006151147,0.0007910965,0.00088358496,0.0016046758,0.001535861,0.0014403565,0.0024279463,0.0013734846,0.015627488],"category_scores_gemma":[0.0034333854,0.0005637551,0.000858577,0.0019341736,0.0008353931,0.0018744486,0.0027261064,0.0017167071,0.003124927],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038882878,0.00033374128,0.001048011,0.00037328908,0.00003537172,0.00017840728,0.00036900066,0.12072556,0.012366914,0.1739746,0.025783645,0.66442275],"study_design_scores_gemma":[0.000102593884,0.00019296401,0.00064097403,0.00009181787,0.000049165126,0.00024980522,0.0002615831,0.6729781,0.009506087,0.29065728,0.025227016,0.000042537955],"about_ca_topic_score_codex":0.0024202506,"about_ca_topic_score_gemma":0.0026481596,"teacher_disagreement_score":0.015627488,"about_ca_system_score_codex":0.0007230606,"about_ca_system_score_gemma":0.0009155436,"threshold_uncertainty_score":0.052279115},"labels":[],"label_agreement":null},{"id":"W1983952331","doi":"10.1016/s0925-7721(02)00113-x","title":"The visibility graph of congruent discs is Hamiltonian","year":2003,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Visibility graph; Disjoint sets; Constructive; Hamiltonian (control theory); Hamiltonian path; Graph; Combinatorics; Visibility; Mathematics; Computer science; Discrete mathematics; Physics; Geometry; Optics; Mathematical optimization","score_opus":0.012161830883547059,"score_gpt":0.25341629767480617,"score_spread":0.24125446679125911,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1983952331","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6759723,0.0006492022,0.2538225,0.0012063563,0.00023866627,0.00010660936,0.00058882916,0.00030016515,0.06711536],"genre_scores_gemma":[0.95818007,0.0004990901,0.031129975,0.00020496883,0.00009508719,0.000051168463,0.00051840174,0.00014314371,0.009178088],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99963546,0.00006998246,0.000016512688,0.00008118936,0.00011497372,0.000081778395],"domain_scores_gemma":[0.9983846,0.00078919117,0.00027659658,0.00019476483,0.000164656,0.00019023316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027064554,0.00037006612,0.0006310564,0.0011052934,0.00090379635,0.0019797657,0.0008586535,0.00079003605,0.0070808353],"category_scores_gemma":[0.0029572716,0.00048469013,0.00043346098,0.0009958213,0.001834727,0.002450629,0.0013899932,0.0010605272,0.0005759979],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014718244,0.000049071597,0.0010055634,0.00017577168,0.000029622774,0.00032306433,0.0006278361,0.01133836,0.005846788,0.94078624,0.004150547,0.03551985],"study_design_scores_gemma":[0.000048092377,0.00003179761,0.0008013428,0.000025411342,0.000019243398,0.00022475029,0.00029508685,0.0256917,0.0019721352,0.9649186,0.0059574456,0.000014412433],"about_ca_topic_score_codex":0.0010600424,"about_ca_topic_score_gemma":0.0010111227,"teacher_disagreement_score":0.0070808353,"about_ca_system_score_codex":0.00059250573,"about_ca_system_score_gemma":0.00045408192,"threshold_uncertainty_score":0.02368772},"labels":[],"label_agreement":null},{"id":"W1986633486","doi":"10.1016/j.comgeo.2007.05.009","title":"Edge-unfolding nested polyhedral bands","year":2007,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; McGill University","funders":"","keywords":"Polyhedron; Intersection (aeronautics); Regular polygon; Enhanced Data Rates for GSM Evolution; Combinatorics; Geometry; Mathematics; Plane (geometry); Projection (relational algebra); Convex polytope; Space (punctuation); Surface (topology); Convex set; Computer science; Algorithm; Geography; Computer vision","score_opus":0.014532883271346124,"score_gpt":0.2663244123923025,"score_spread":0.25179152912095637,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1986633486","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06260448,0.000055516604,0.9292585,0.000052542666,0.00006083169,0.000057559802,0.000081381455,0.00067722035,0.0071519385],"genre_scores_gemma":[0.39895332,0.000072798095,0.5944596,0.000060855084,0.000017276312,0.000077531164,0.00023038335,0.00041567377,0.0057125473],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996586,0.000047520894,0.000015953554,0.000070526316,0.00014200437,0.00006540813],"domain_scores_gemma":[0.9995055,0.00009833133,0.000031403175,0.00020098234,0.00011685646,0.00004685083],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004149195,0.0004579611,0.0006502709,0.00064791925,0.00051601033,0.00073440844,0.0010495275,0.0006415567,0.007963935],"category_scores_gemma":[0.0013968213,0.00047073598,0.0004904428,0.00053215347,0.000683521,0.001064919,0.0019875292,0.0011247221,0.0013411726],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00068380847,0.0005158655,0.0026414995,0.00026440236,0.000053362914,0.00031284304,0.00053328497,0.23786919,0.08978898,0.20829609,0.0068736165,0.45216712],"study_design_scores_gemma":[0.000050068036,0.00020126374,0.0007438984,0.00004368703,0.000027021737,0.0002705525,0.00018751241,0.8704261,0.033350598,0.08257673,0.012096902,0.000025675863],"about_ca_topic_score_codex":0.0005527044,"about_ca_topic_score_gemma":0.00101374,"teacher_disagreement_score":0.007963935,"about_ca_system_score_codex":0.00023438242,"about_ca_system_score_gemma":0.0003356836,"threshold_uncertainty_score":0.026641965},"labels":[],"label_agreement":null},{"id":"W1987886060","doi":"10.1016/j.comgeo.2006.09.002","title":"Drawings of planar graphs with few slopes and segments","year":2006,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":57,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Planar graph; Outerplanar graph; Planar; Plane (geometry); 1-planar graph; Graph; Graph drawing","score_opus":0.0054767086491053244,"score_gpt":0.2015230887419834,"score_spread":0.1960463800928781,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1987886060","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11216059,0.0005662036,0.82837564,0.00055619224,0.00017549089,0.00029801403,0.0018476403,0.0016410418,0.05437927],"genre_scores_gemma":[0.47895828,0.0016752336,0.48147932,0.00022823612,0.00008553461,0.00028002716,0.0042934758,0.000850107,0.032149777],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996531,0.000095531665,0.000015302363,0.00007637898,0.00012005173,0.000039674807],"domain_scores_gemma":[0.9992779,0.00023648424,0.000098336786,0.00015664588,0.00013930858,0.000091369075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016028564,0.0010977685,0.00052212976,0.0011092172,0.00066433457,0.0013566583,0.0011892744,0.001031533,0.0138339335],"category_scores_gemma":[0.0020445911,0.0008767992,0.00053808664,0.0015542278,0.0006426625,0.0012139896,0.0009909548,0.001669816,0.0026420837],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027016312,0.00015851035,0.0018921958,0.00064437534,0.00008018271,0.0013459356,0.00083134,0.14904091,0.039315928,0.52560955,0.033762593,0.24704832],"study_design_scores_gemma":[0.0001425889,0.0001720733,0.0024843968,0.00018225088,0.00009968113,0.0013932503,0.0006045479,0.25607243,0.01752048,0.6164549,0.10478305,0.00009032456],"about_ca_topic_score_codex":0.001488573,"about_ca_topic_score_gemma":0.003468679,"teacher_disagreement_score":0.0138339335,"about_ca_system_score_codex":0.0004627776,"about_ca_system_score_gemma":0.00033665853,"threshold_uncertainty_score":0.046279132},"labels":[],"label_agreement":null},{"id":"W1991522034","doi":"10.1016/j.comgeo.2013.01.001","title":"Approximate proximity drawings","year":2013,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Ministero dell’Istruzione, dell’Università e della Ricerca","keywords":"Combinatorics; Graph drawing; Mathematics; Generalization; Multiplicative function; Planar graph; Delaunay triangulation; Graph","score_opus":0.012304752746413565,"score_gpt":0.23016845296723318,"score_spread":0.2178637002208196,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991522034","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02362939,0.00050598086,0.93820477,0.0003236588,0.00015029946,0.00018618467,0.000514754,0.0011328219,0.035352178],"genre_scores_gemma":[0.36821207,0.001039523,0.5902662,0.00024126188,0.00016019991,0.00036333918,0.0022988154,0.0008531989,0.03656532],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981173,0.0003658653,0.00007522014,0.00041206094,0.0008967925,0.00013281316],"domain_scores_gemma":[0.9980939,0.00059198326,0.000114944865,0.00073273893,0.00037271663,0.000093700364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059236406,0.0011381768,0.0013175406,0.0022851904,0.0009576689,0.0031705075,0.0016609068,0.0021015622,0.031604353],"category_scores_gemma":[0.008100076,0.0009655751,0.0010311464,0.002665789,0.0008447805,0.0038244363,0.0034533923,0.0025351958,0.0070211347],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004956056,0.00019511505,0.0011968889,0.00038079676,0.00006966748,0.00043445366,0.00038214936,0.13472402,0.011204676,0.3400855,0.02424207,0.486589],"study_design_scores_gemma":[0.000086723914,0.0001930476,0.0006109845,0.00010039217,0.000051301526,0.00090877595,0.00030167817,0.62397027,0.012720599,0.2930015,0.06801589,0.00003891501],"about_ca_topic_score_codex":0.0010105844,"about_ca_topic_score_gemma":0.0016184733,"teacher_disagreement_score":0.031604353,"about_ca_system_score_codex":0.00088692864,"about_ca_system_score_gemma":0.0005626297,"threshold_uncertainty_score":0.10572708},"labels":[],"label_agreement":null},{"id":"W1991758355","doi":"10.1016/j.comgeo.2011.04.001","title":"Efficient view point selection for silhouettes of convex polyhedra","year":2011,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Silhouette; Polyhedron; Regular polygon; Combinatorics; Point (geometry); Set (abstract data type); Convex polytope; Computer science; Mathematics; Artificial intelligence; Computer vision; Algorithm; Convex set; Convex optimization; Geometry","score_opus":0.02936026092224879,"score_gpt":0.2542745731987156,"score_spread":0.2249143122764668,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991758355","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014302247,0.00014952639,0.9830434,0.00005910599,0.00003419644,0.0000969825,0.00015416168,0.0010953516,0.0010649661],"genre_scores_gemma":[0.20648429,0.000327324,0.7884975,0.00007090763,0.00006144315,0.00014233563,0.0010715583,0.00092081,0.002423865],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99870133,0.00020047429,0.000043170436,0.00020351927,0.00070870575,0.00014272782],"domain_scores_gemma":[0.9982942,0.00066291663,0.00011034037,0.0002941885,0.00049191806,0.00014645269],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078511884,0.0013549603,0.0023009793,0.002084225,0.0005440045,0.0018113633,0.001828251,0.0015402114,0.007183524],"category_scores_gemma":[0.0044846493,0.0011635261,0.0013062386,0.0017191545,0.0005600727,0.0012552064,0.0023125305,0.0020316744,0.0033504567],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000823548,0.00016547478,0.0018738164,0.00046363252,0.00012962167,0.00056713255,0.00042978808,0.12872933,0.10326858,0.014896083,0.014694192,0.73395884],"study_design_scores_gemma":[0.00003743382,0.000079727855,0.00039919512,0.000026755783,0.000014252315,0.00019894485,0.00008953168,0.9697409,0.020897696,0.005610877,0.0028834927,0.000021077782],"about_ca_topic_score_codex":0.0018138316,"about_ca_topic_score_gemma":0.0032388065,"teacher_disagreement_score":0.007183524,"about_ca_system_score_codex":0.00047835786,"about_ca_system_score_gemma":0.00063504477,"threshold_uncertainty_score":0.024031281},"labels":[],"label_agreement":null},{"id":"W1992151444","doi":"10.1016/j.comgeo.2013.07.002","title":"Minimum-area enclosing triangle with a fixed angle","year":2013,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Combinatorics; Regular polygon; Mathematics; Plane (geometry); Computation; Tree (set theory); Set (abstract data type); Algebraic number; Geometry; Computer science; Mathematical analysis; Algorithm","score_opus":0.016229417830585194,"score_gpt":0.2245372966945672,"score_spread":0.208307878863982,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1992151444","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028452033,0.00013958766,0.9520887,0.00016946126,0.00009250955,0.0001526335,0.00036341752,0.00042091165,0.018120795],"genre_scores_gemma":[0.30709153,0.00026080463,0.679221,0.000100455014,0.000052411087,0.00031802943,0.0009808083,0.00047325122,0.011501759],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99944776,0.000096298325,0.00003481952,0.00012556149,0.0002398737,0.000055700784],"domain_scores_gemma":[0.99943095,0.00018709686,0.00005637846,0.00014750878,0.00013666046,0.00004140667],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000375464,0.0008531518,0.0010051673,0.0006863464,0.00043923163,0.0007325571,0.0017538345,0.0012221995,0.010075989],"category_scores_gemma":[0.0029886346,0.00054349634,0.0005538424,0.0008252465,0.00049586693,0.001110204,0.0019138942,0.0012176196,0.0024773073],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010518917,0.00025954333,0.0023908706,0.0009582526,0.00009178587,0.00074548443,0.000533829,0.326926,0.07901501,0.15576656,0.017639281,0.41462144],"study_design_scores_gemma":[0.0002082614,0.00041135872,0.0007555863,0.00010215895,0.00004724946,0.000807514,0.00022853175,0.8708653,0.026477536,0.06690214,0.033153255,0.000041160733],"about_ca_topic_score_codex":0.00072655367,"about_ca_topic_score_gemma":0.0010307692,"teacher_disagreement_score":0.010075989,"about_ca_system_score_codex":0.00031892527,"about_ca_system_score_gemma":0.00047452733,"threshold_uncertainty_score":0.03370756},"labels":[],"label_agreement":null},{"id":"W1993585122","doi":"10.1016/j.comgeo.2010.09.009","title":"Almost all Delaunay triangulations have stretch factor greater than <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" overflow=\"scroll\"><mml:mi>π</mml:mi><mml:mo stretchy=\"false\">/</mml:mo><mml:mn>2</mml:mn></mml:math>","year":2010,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Carleton University","funders":"","keywords":"Mathematics; Delaunay triangulation; Combinatorics; Euclidean geometry; General position; Position (finance); Regular polygon; Geometry","score_opus":0.022762528276962974,"score_gpt":0.25401791077051894,"score_spread":0.23125538249355596,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1993585122","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035475463,0.0016145591,0.8950151,0.00074401405,0.00038049146,0.00021815076,0.0032199589,0.007975995,0.055356298],"genre_scores_gemma":[0.32932273,0.0019936478,0.61792916,0.00035404688,0.00019028617,0.0004562304,0.010621184,0.0036087525,0.035524085],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984409,0.00021725206,0.00012198795,0.00026166422,0.0007627411,0.00019549712],"domain_scores_gemma":[0.99673456,0.0010489576,0.0002612048,0.0011490075,0.000710224,0.00009604185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009100452,0.000969788,0.0012217276,0.0011113585,0.0009335998,0.0015912979,0.00097149797,0.0011750102,0.03156899],"category_scores_gemma":[0.007968951,0.0007178105,0.0008632458,0.0018024002,0.0007689338,0.0022438157,0.0024896825,0.00085675664,0.014699531],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036763903,0.00007848476,0.0042341575,0.0013014423,0.00010529912,0.0004952203,0.0009253565,0.034185566,0.033070363,0.061827634,0.06215197,0.80125695],"study_design_scores_gemma":[0.00012059207,0.00023185748,0.0071089845,0.000514573,0.00008672785,0.0031278564,0.0014409043,0.14007686,0.08047251,0.1420641,0.6245839,0.00017106],"about_ca_topic_score_codex":0.0012033703,"about_ca_topic_score_gemma":0.00198771,"teacher_disagreement_score":0.03156899,"about_ca_system_score_codex":0.000379794,"about_ca_system_score_gemma":0.00049458677,"threshold_uncertainty_score":0.10560876},"labels":[],"label_agreement":null},{"id":"W1993674183","doi":"10.1016/j.comgeo.2014.12.002","title":"A simple, faster method for kinetic proximity problems","year":2014,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Combinatorics; Mathematics; Delaunay triangulation; Graph; Complement graph; Equilateral triangle; Line graph; Dense graph; Discrete mathematics; Time complexity; Butterfly graph; Geometric graph theory; Graph power; Voltage graph; Pathwidth; Geometry","score_opus":0.022489723397228482,"score_gpt":0.2877400102182937,"score_spread":0.2652502868210652,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1993674183","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017183876,0.00010408591,0.9932376,0.00013225451,0.0002651077,0.00007781421,0.000066621215,0.0008368869,0.0035612273],"genre_scores_gemma":[0.03496271,0.00018368795,0.94796365,0.0001883191,0.00014552174,0.00029801368,0.00021293001,0.0012093907,0.014835836],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992932,0.00009870238,0.000038799768,0.00007551941,0.0004546822,0.000039019404],"domain_scores_gemma":[0.9989126,0.00033613452,0.00005220713,0.00026847096,0.00032736556,0.000103289814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007006691,0.0008996041,0.0011409916,0.001179301,0.0010629654,0.0013876661,0.0021677362,0.0016793029,0.022204904],"category_scores_gemma":[0.0033161493,0.00056829554,0.0010689971,0.0010057976,0.0006577289,0.0018711184,0.0025565934,0.0024990777,0.006642544],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002832975,0.00031833714,0.0006763026,0.00070278684,0.00011695131,0.00039485304,0.0003379161,0.09320386,0.042681888,0.1690874,0.030989563,0.6612069],"study_design_scores_gemma":[0.00018866082,0.000107792475,0.00032941054,0.00006328815,0.000042722393,0.0005171454,0.00008761185,0.82606953,0.0111762015,0.08966512,0.071664914,0.00008753593],"about_ca_topic_score_codex":0.0018801687,"about_ca_topic_score_gemma":0.0033800595,"teacher_disagreement_score":0.022204904,"about_ca_system_score_codex":0.00042241527,"about_ca_system_score_gemma":0.0011804051,"threshold_uncertainty_score":0.074282825},"labels":[],"label_agreement":null},{"id":"W1995909989","doi":"10.1016/j.comgeo.2006.12.004","title":"On local transformations in plane geometric graphs embedded on small grids","year":2007,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Grid; Vertex (graph theory); Embedding; Combinatorics; Mathematics; Plane (geometry); Enhanced Data Rates for GSM Evolution; Point (geometry); Transformation (genetics); Line segment; Line (geometry); Discrete mathematics; Geometry; Computer science; Graph; Telecommunications","score_opus":0.016452451601187305,"score_gpt":0.25234425271371724,"score_spread":0.23589180111252994,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1995909989","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46797904,0.0005135871,0.5019941,0.00070308975,0.00014121692,0.00011386959,0.00021544132,0.000440935,0.02789873],"genre_scores_gemma":[0.92972815,0.0007261491,0.050549436,0.00013864563,0.00011946758,0.00006762231,0.00033779428,0.0004287182,0.017904047],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997379,0.000074152624,0.000009213067,0.00005463017,0.00008468771,0.000039329465],"domain_scores_gemma":[0.99889165,0.0005392764,0.00018419618,0.00016055201,0.000098122226,0.00012626112],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032474188,0.00055190234,0.0007545592,0.001298789,0.00070357,0.0010605014,0.0009886515,0.0007934629,0.004813077],"category_scores_gemma":[0.002517915,0.00042803906,0.00045043213,0.0010601782,0.001927295,0.0017905001,0.0020886213,0.0013517117,0.0005943403],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016553872,0.00010554221,0.0010222523,0.000110065994,0.000022215325,0.00026025655,0.0005243384,0.24040857,0.008554983,0.7092422,0.0035830336,0.036001027],"study_design_scores_gemma":[0.000024659625,0.000060904254,0.0005952181,0.000015847934,0.0000097584525,0.00009957116,0.00022614987,0.44577488,0.0018143073,0.5486763,0.0026860586,0.000016451482],"about_ca_topic_score_codex":0.0018819333,"about_ca_topic_score_gemma":0.0019220655,"teacher_disagreement_score":0.004813077,"about_ca_system_score_codex":0.0005922458,"about_ca_system_score_gemma":0.00025369713,"threshold_uncertainty_score":0.01610136},"labels":[],"label_agreement":null},{"id":"W1997248658","doi":"10.1016/j.comgeo.2008.09.006","title":"Morphing polyhedra with parallel faces: Counterexamples","year":2008,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Advanced Materials and Mechanics","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Polyhedron; Combinatorics; Dual polyhedron; Vertex (graph theory); Morphing; Counterexample; Regular polygon; Mathematics; Face (sociological concept); Simple (philosophy); Graph; Computer science; Geometry","score_opus":0.017545550516045373,"score_gpt":0.20056657782476497,"score_spread":0.1830210273087196,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1997248658","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37067896,0.0007694376,0.51127845,0.007648764,0.000700749,0.00019849576,0.00047328763,0.00093569636,0.107316285],"genre_scores_gemma":[0.800239,0.00068335974,0.1790255,0.0009961209,0.00043720548,0.00016594623,0.0007178996,0.000607973,0.017127026],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99883515,0.0003322364,0.00007896042,0.0002537547,0.00037679175,0.00012314031],"domain_scores_gemma":[0.9944003,0.0040409616,0.0003272125,0.0007502852,0.00027701497,0.00020422805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016077124,0.0010583608,0.0009608379,0.00096055004,0.0027960713,0.0025928149,0.0019456093,0.0035113117,0.0064657405],"category_scores_gemma":[0.012259935,0.0010321833,0.0017427206,0.0010613828,0.005005406,0.006084935,0.006286085,0.0053628203,0.0005593984],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013172902,0.00006906917,0.0003107219,0.00009108318,0.000016067863,0.00027959785,0.000278263,0.012612406,0.0009577629,0.96817946,0.0044532237,0.012620583],"study_design_scores_gemma":[0.00008700186,0.000047830836,0.00024000094,0.000030619383,0.000021005195,0.0004758184,0.000171042,0.08210609,0.0013971449,0.9098592,0.0055425563,0.000021681564],"about_ca_topic_score_codex":0.0009824772,"about_ca_topic_score_gemma":0.0011247231,"teacher_disagreement_score":0.0064657405,"about_ca_system_score_codex":0.00069049967,"about_ca_system_score_gemma":0.0004297159,"threshold_uncertainty_score":0.021630049},"labels":[],"label_agreement":null},{"id":"W1998148652","doi":"10.1016/j.comgeo.2006.08.002","title":"Graph drawings with few slopes","year":2006,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Combinatorics; Mathematics; Planar graph; 1-planar graph; Discrete mathematics; Upper and lower bounds; Bipartite graph; Pathwidth; Bounded function; Outerplanar graph; Graph; Line graph","score_opus":0.005608382165783317,"score_gpt":0.20257442143106222,"score_spread":0.1969660392652789,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1998148652","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.085062064,0.0005198298,0.80022186,0.0009940679,0.0003066257,0.00021453881,0.0011469957,0.0023237055,0.10921029],"genre_scores_gemma":[0.49132374,0.0010203392,0.41893026,0.00042912227,0.00015954253,0.00029906977,0.0024048968,0.0015573343,0.08387576],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994591,0.00013109966,0.000022799117,0.00012821855,0.00020138337,0.00005748722],"domain_scores_gemma":[0.99881303,0.00031393796,0.00010712254,0.0004234133,0.00020942674,0.00013302697],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025013715,0.00092941546,0.0006681188,0.001207215,0.0009801936,0.0018123232,0.0010520112,0.0014032987,0.027633226],"category_scores_gemma":[0.0030550081,0.00089371816,0.00058197405,0.0012349365,0.0008282477,0.002244625,0.0014662567,0.0025056647,0.008849568],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002575258,0.00012318407,0.0009214783,0.00034354362,0.000043333734,0.00070238457,0.00043148274,0.035582475,0.025183856,0.7090645,0.031551894,0.19579433],"study_design_scores_gemma":[0.00008182496,0.00010184873,0.0008065581,0.00008317251,0.000044585784,0.00082619564,0.00027051236,0.10973955,0.010375908,0.8017564,0.0758711,0.000042375403],"about_ca_topic_score_codex":0.0006194247,"about_ca_topic_score_gemma":0.0015956834,"teacher_disagreement_score":0.027633226,"about_ca_system_score_codex":0.00043945128,"about_ca_system_score_gemma":0.00039078284,"threshold_uncertainty_score":0.09244233},"labels":[],"label_agreement":null},{"id":"W2004207893","doi":"10.1016/j.comgeo.2008.04.003","title":"Geometric spanners with small chromatic number","year":2008,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University; Carleton University","funders":"","keywords":"Combinatorics; Chromatic scale; Mathematics; Integer (computer science); Upper and lower bounds; Spanner; Point (geometry); Plane (geometry); Line (geometry); Set (abstract data type); Discrete mathematics; Geometry; Computer science; Mathematical analysis","score_opus":0.026532671956699474,"score_gpt":0.23014453556167422,"score_spread":0.20361186360497474,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2004207893","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38264036,0.00033409445,0.51578873,0.0005963235,0.0002967816,0.00013682069,0.00031667712,0.00089633797,0.09899392],"genre_scores_gemma":[0.83910835,0.00034537294,0.1042847,0.00021477237,0.00016694186,0.00018893066,0.00044857524,0.0005962609,0.05464612],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99959904,0.000074926415,0.000015825997,0.00010308526,0.00013921893,0.00006799692],"domain_scores_gemma":[0.9985033,0.0006421234,0.00016409584,0.00032511962,0.00015773316,0.00020754502],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036888212,0.00066880556,0.0005697031,0.0011641879,0.00090442784,0.0013044011,0.0010263778,0.00072650553,0.016440896],"category_scores_gemma":[0.002580185,0.00046886608,0.00041892685,0.0010760854,0.0014144637,0.0024372914,0.0024570287,0.0013974527,0.0018394862],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016032706,0.00007558061,0.00075516454,0.00009809873,0.000018666115,0.00014332808,0.00022585236,0.030723205,0.010483958,0.9108039,0.004926072,0.041585807],"study_design_scores_gemma":[0.000036461683,0.0001055244,0.00054359,0.000020443556,0.000017677463,0.0001817387,0.00011922614,0.073404625,0.007277338,0.90915525,0.009117534,0.00002052909],"about_ca_topic_score_codex":0.0004082618,"about_ca_topic_score_gemma":0.0009238833,"teacher_disagreement_score":0.016440896,"about_ca_system_score_codex":0.0005303253,"about_ca_system_score_gemma":0.0003900461,"threshold_uncertainty_score":0.055000305},"labels":[],"label_agreement":null},{"id":"W2004826883","doi":"10.1016/s0925-7721(01)00070-0","title":"Efficient visibility queries in simple polygons","year":2002,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":81,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Carleton University","funders":"","keywords":"Visibility polygon; Simple polygon; Visibility; Polygon (computer graphics); Rectilinear polygon; Point in polygon; Combinatorics; Star-shaped polygon; Polygon covering; Vertex (graph theory); Representation (politics); Mathematics; Line segment; Point (geometry); Preprocessor; Computer science; Regular polygon; Artificial intelligence; Geometry; Graph; Physics","score_opus":0.020824319767382065,"score_gpt":0.2527533371724667,"score_spread":0.23192901740508462,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2004826883","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2494609,0.0014355489,0.7248862,0.00089080783,0.00018789081,0.00034508778,0.0017311566,0.005979586,0.015082978],"genre_scores_gemma":[0.7140118,0.00069865765,0.27437693,0.00016381309,0.00010169212,0.00012107399,0.003647594,0.0012001778,0.005678205],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99780387,0.0003220762,0.00018021908,0.0003661551,0.00097029394,0.00035743442],"domain_scores_gemma":[0.99451643,0.003148444,0.00036045606,0.0013961617,0.0003555391,0.00022296947],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008533758,0.0008977499,0.0021246164,0.0011408553,0.0011659159,0.0035585219,0.0021240755,0.0015128916,0.0057413364],"category_scores_gemma":[0.009026458,0.0010054101,0.0011600372,0.003010455,0.0012852987,0.0073862704,0.004648083,0.0014688475,0.0012185948],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0031094295,0.00055944244,0.0060409475,0.0014083077,0.00021381036,0.0015598622,0.002162348,0.14483863,0.058967154,0.20285566,0.041849457,0.53643495],"study_design_scores_gemma":[0.0003615465,0.00025618347,0.0012892352,0.000085826585,0.00009150939,0.00061476324,0.00084378856,0.578571,0.028672807,0.36674055,0.02241361,0.00005917888],"about_ca_topic_score_codex":0.0023386166,"about_ca_topic_score_gemma":0.0035593065,"teacher_disagreement_score":0.0057413364,"about_ca_system_score_codex":0.00076223974,"about_ca_system_score_gemma":0.0007698261,"threshold_uncertainty_score":0.019206643},"labels":[],"label_agreement":null},{"id":"W2005165224","doi":"10.1016/j.comgeo.2013.05.002","title":"Refold rigidity of convex polyhedra","year":2013,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Advanced Materials and Mechanics","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Polyhedron; Dodecahedron; Tetrahedron; Regular polygon; Convex polytope; Combinatorics; Enhanced Data Rates for GSM Evolution; Rigidity (electromagnetism); Planar; Mathematics; Geometry; Computer science; Convex set; Materials science; Artificial intelligence; Convex optimization","score_opus":0.006325705806073779,"score_gpt":0.1950663615003747,"score_spread":0.18874065569430093,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2005165224","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39743516,0.0006187515,0.5213858,0.0005841206,0.00035409417,0.00008828158,0.00059957267,0.00070262526,0.07823164],"genre_scores_gemma":[0.91462344,0.00038386555,0.06385847,0.00019083759,0.00008700645,0.000045187928,0.0006446637,0.0006157402,0.019550733],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994616,0.000105795254,0.000019276911,0.00008663231,0.00023185444,0.000094787334],"domain_scores_gemma":[0.998865,0.00033635515,0.00010184452,0.00040559756,0.00017915433,0.000112012094],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004901778,0.0005515734,0.00068623095,0.0011727386,0.00082793913,0.0011520288,0.0012637164,0.00075046986,0.010938613],"category_scores_gemma":[0.0029530537,0.00038687393,0.00061804446,0.00050495815,0.0017298597,0.0017356534,0.0024960188,0.0018119472,0.001713545],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014874803,0.00006686803,0.00069330685,0.00012796508,0.000021475995,0.00024373477,0.00023432815,0.13145128,0.00871365,0.806491,0.0030593108,0.04874831],"study_design_scores_gemma":[0.000016555288,0.00007855456,0.00061755494,0.000050896997,0.000007536245,0.00015454856,0.0001689725,0.33223283,0.0076775774,0.6492999,0.009659545,0.000035523055],"about_ca_topic_score_codex":0.0010820255,"about_ca_topic_score_gemma":0.0016864424,"teacher_disagreement_score":0.010938613,"about_ca_system_score_codex":0.00051033427,"about_ca_system_score_gemma":0.00042045774,"threshold_uncertainty_score":0.036593318},"labels":[],"label_agreement":null},{"id":"W2005353392","doi":"10.1016/j.comgeo.2008.11.004","title":"Not being (super)thin or solid is hard: A study of grid Hamiltonicity","year":2008,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":44,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Shahrekord University of Medical Sciences; Academy of Finland; National Science Foundation","keywords":"Hamiltonian path; Combinatorics; Bipartite graph; Mathematics; Planar graph; Hamiltonian (control theory); Hamiltonian path problem; Grid; Discrete mathematics; Regular polygon; Square tiling; Graph; Mathematical optimization; Geometry","score_opus":0.060117465416775547,"score_gpt":0.336238186652695,"score_spread":0.27612072123591946,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2005353392","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8567235,0.00041496524,0.090031594,0.0028110938,0.00011541277,0.000067397465,0.00021241912,0.00016186896,0.049461745],"genre_scores_gemma":[0.9831526,0.00021240447,0.010883347,0.00015534864,0.00003810967,0.00003740997,0.00010119252,0.00007578058,0.0053437985],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99966705,0.00010722733,0.000011455221,0.000051220293,0.000065573004,0.00009747045],"domain_scores_gemma":[0.99425876,0.0037214395,0.00055917853,0.00059082906,0.00028885127,0.00058094756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056547264,0.0002638655,0.0007132302,0.00066557736,0.0017070206,0.0014324022,0.0015220462,0.0011623275,0.007391803],"category_scores_gemma":[0.007298572,0.00048598897,0.00062300224,0.0009036724,0.0030530554,0.00250713,0.0018318815,0.001549118,0.00025424172],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011187025,0.000040993848,0.0016837302,0.00006747048,0.000025715217,0.00027149406,0.0004902077,0.03732656,0.0006824497,0.950672,0.0029412115,0.0056862133],"study_design_scores_gemma":[0.00006268042,0.000034094257,0.0009407436,0.000021529428,0.000017282826,0.00014156348,0.0006245627,0.12486422,0.00031643332,0.8709207,0.0020419874,0.000014169753],"about_ca_topic_score_codex":0.006638553,"about_ca_topic_score_gemma":0.0063208095,"teacher_disagreement_score":0.007391803,"about_ca_system_score_codex":0.0008768331,"about_ca_system_score_gemma":0.0010638377,"threshold_uncertainty_score":0.02472806},"labels":[],"label_agreement":null},{"id":"W2005387480","doi":"10.1016/j.comgeo.2004.04.002","title":"Curve-constrained drawings of planar graphs","year":2004,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":54,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"Natural Sciences and Engineering Research Council of Canada; Ministero dell’Istruzione, dell’Università e della Ricerca","keywords":"Embedding; Book embedding; Planar graph; Combinatorics; Planar; Planar straight-line graph; Mathematics; Bent molecular geometry; Graph; Graph embedding; Jordan curve theorem; Point (geometry); Discrete mathematics; Computer science; Geometry; 1-planar graph; Computer graphics (images); Line graph; Artificial intelligence","score_opus":0.012685559034463188,"score_gpt":0.2415623381176972,"score_spread":0.228876779083234,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2005387480","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04837444,0.00033830322,0.92560387,0.00023625931,0.000066684115,0.00016065026,0.0007142334,0.0007580701,0.023747576],"genre_scores_gemma":[0.41189283,0.0017158225,0.559305,0.00011836668,0.0000693123,0.00026756382,0.00267965,0.00079956325,0.023151813],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994143,0.000111389505,0.000023801002,0.00008832913,0.00030932855,0.00005280554],"domain_scores_gemma":[0.99902904,0.00031289476,0.000117686526,0.00021649891,0.00024165146,0.000082245926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028155933,0.00090082386,0.00068525266,0.0016031624,0.00059439323,0.0015567065,0.001507282,0.001206341,0.014455275],"category_scores_gemma":[0.003180607,0.0007906755,0.0004738968,0.0027813625,0.00081056997,0.001842918,0.0016531331,0.001449081,0.0019220436],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012769196,0.00008646402,0.00082038675,0.0003168064,0.00003425007,0.00037333276,0.00039463886,0.29583007,0.019081304,0.3928304,0.017153433,0.27295136],"study_design_scores_gemma":[0.000053279786,0.00006034328,0.00052466843,0.00008786748,0.000024888352,0.00030030633,0.00019692411,0.609946,0.009621862,0.33210188,0.047043122,0.000038924714],"about_ca_topic_score_codex":0.002901898,"about_ca_topic_score_gemma":0.0056592887,"teacher_disagreement_score":0.014455275,"about_ca_system_score_codex":0.000651665,"about_ca_system_score_gemma":0.0005668054,"threshold_uncertainty_score":0.048357785},"labels":[],"label_agreement":null},{"id":"W2005968133","doi":"10.1016/s0925-7721(01)00066-9","title":"Optimizing area and aspect ratio in straight-line orthogonal tree drawings","year":2002,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Advanced Image and Video Retrieval Techniques","field":"Computer Science","cited_by":47,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Constant (computer programming); Line (geometry); Aspect ratio (aeronautics); Grid; Tree (set theory); Binary tree; Line drawings; Computer science; Mathematics; Combinatorics; Integer (computer science); Line segment; Binary number; Algorithm; Geometry; Engineering drawing; Arithmetic","score_opus":0.031197710417445887,"score_gpt":0.27095102060035486,"score_spread":0.23975331018290896,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2005968133","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15434982,0.00045522169,0.8343974,0.0001315596,0.000030249217,0.000080871934,0.00013957261,0.0012856689,0.009129657],"genre_scores_gemma":[0.563124,0.00037531194,0.4323631,0.00004785975,0.00003541877,0.00009415794,0.00020602488,0.00073220424,0.0030219161],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99938834,0.00019182423,0.000027206566,0.00007820638,0.00023346822,0.00008090753],"domain_scores_gemma":[0.99869376,0.00080956076,0.0001474423,0.00011600261,0.0001711715,0.0000620884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006321492,0.0008232237,0.0009761517,0.0010431152,0.00028545805,0.0011028344,0.0008726997,0.00064078,0.0033042105],"category_scores_gemma":[0.0041716723,0.0006314387,0.00044776336,0.0014117829,0.00038455572,0.0016265614,0.00081785914,0.0005464835,0.0006767175],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003804407,0.00017908822,0.0016983608,0.00017712133,0.000033993445,0.000097867756,0.00014320992,0.58422077,0.029179627,0.02454301,0.0037236928,0.3556228],"study_design_scores_gemma":[0.000032571286,0.0001276859,0.00040941243,0.000006653289,0.000014763234,0.000077355355,0.000033235054,0.98208976,0.008024305,0.008027156,0.001147358,0.000009757967],"about_ca_topic_score_codex":0.0014925794,"about_ca_topic_score_gemma":0.0029062845,"teacher_disagreement_score":0.0033042105,"about_ca_system_score_codex":0.00067260634,"about_ca_system_score_gemma":0.0005088392,"threshold_uncertainty_score":0.011053681},"labels":[],"label_agreement":null},{"id":"W2006095056","doi":"10.1016/j.comgeo.2013.04.002","title":"On plane geometric spanners: A survey and open problems","year":2013,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":83,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Combinatorics; Spanner; Enhanced Data Rates for GSM Evolution; Graph; Mathematics; Plane (geometry); Path (computing); Discrete mathematics; Computer science; Geometry; Artificial intelligence","score_opus":0.03540804549230224,"score_gpt":0.2662650854645597,"score_spread":0.23085703997225743,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2006095056","genre_codex":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024755422,0.11885369,0.7986555,0.0028361073,0.0009445161,0.00013608459,0.00054142845,0.0006402479,0.052636985],"genre_scores_gemma":[0.18908922,0.28875542,0.48430297,0.0018691513,0.005326555,0.0002797632,0.0028896248,0.000932511,0.026554735],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984763,0.00033391235,0.0001130686,0.0004625739,0.00047693294,0.00013721234],"domain_scores_gemma":[0.99682945,0.0019741692,0.0001846165,0.00054369704,0.00033551705,0.00013252068],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016870751,0.0016907235,0.0029861305,0.0033000815,0.001264033,0.0044840146,0.0034897034,0.002495346,0.011013348],"category_scores_gemma":[0.005097008,0.0013854754,0.0014971587,0.00808763,0.0027549735,0.0115146,0.004107024,0.0034322306,0.0043838327],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009499455,0.00023641087,0.0017678643,0.0024122235,0.0000870546,0.00015172648,0.00036186058,0.04015447,0.0012986786,0.4413831,0.017602962,0.49444857],"study_design_scores_gemma":[0.000025578807,0.00014207854,0.00077473075,0.00075420586,0.000057457226,0.0006799022,0.00043407342,0.089862734,0.001480306,0.79866475,0.10706936,0.000054895863],"about_ca_topic_score_codex":0.0009387231,"about_ca_topic_score_gemma":0.0010926089,"teacher_disagreement_score":0.011013348,"about_ca_system_score_codex":0.0008671803,"about_ca_system_score_gemma":0.0008939613,"threshold_uncertainty_score":0.03684336},"labels":[],"label_agreement":null},{"id":"W2006707333","doi":"10.1016/s0925-7721(02)00102-5","title":"Fast approximations for sums of distances, clustering and the Fermat–Weber problem","year":2002,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":90,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Fermat's Last Theorem; Mathematics; Cluster analysis; Dimension (graph theory); Combinatorics; Randomized algorithm; Euclidean geometry; Preprocessor; Constant (computer programming); Set (abstract data type); Point (geometry); Approximation algorithm; Discrete mathematics; Algorithm; Computer science; Geometry; Statistics; Artificial intelligence","score_opus":0.01932622633743269,"score_gpt":0.22757928364946964,"score_spread":0.20825305731203694,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2006707333","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023434578,0.0012308438,0.97049004,0.0006486406,0.00022591154,0.000042537205,0.00013173874,0.00044256359,0.003353079],"genre_scores_gemma":[0.22043274,0.0011426419,0.7671581,0.00022867967,0.00028438753,0.00018834801,0.0007160047,0.000544909,0.009304246],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980763,0.0006129551,0.00011806847,0.00031850286,0.00070648396,0.00016765331],"domain_scores_gemma":[0.993288,0.0046142354,0.0004265078,0.00079531444,0.0005520589,0.00032388815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003812445,0.0014790742,0.0023288215,0.0028921117,0.001678145,0.0031461124,0.0038325272,0.0026296861,0.005599998],"category_scores_gemma":[0.02762563,0.0011554587,0.0012977485,0.0041204174,0.0025128913,0.008760001,0.004670608,0.0036135865,0.0015638906],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045669093,0.000103336,0.0009899592,0.00040935774,0.00010713605,0.00013810252,0.00039525927,0.3209707,0.0020263111,0.5017212,0.011531632,0.16115026],"study_design_scores_gemma":[0.000022289307,0.000021959273,0.00014878517,0.000025049641,0.00001291413,0.00007934944,0.000056687724,0.6866023,0.0006340368,0.30977187,0.0026050939,0.00001965093],"about_ca_topic_score_codex":0.0039249444,"about_ca_topic_score_gemma":0.0047795367,"teacher_disagreement_score":0.005599998,"about_ca_system_score_codex":0.0026076671,"about_ca_system_score_gemma":0.0015273053,"threshold_uncertainty_score":0.020162404},"labels":[],"label_agreement":null},{"id":"W2007853611","doi":"10.1016/j.comgeo.2006.03.003","title":"Computing homotopic shortest paths efficiently","year":2006,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":48,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Disjoint sets; Randomized algorithm; Mathematics; Deterministic algorithm; Combinatorics; Floyd–Warshall algorithm; Point (geometry); Plane (geometry); Running time; Shortest path problem; Algorithm; Discrete mathematics; Computer science; K shortest path routing; Geometry; Graph","score_opus":0.008324284205473856,"score_gpt":0.22607426931660687,"score_spread":0.21774998511113303,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2007853611","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17345369,0.00038809804,0.80257016,0.00043581575,0.00013362263,0.00020708,0.0013777602,0.0037466013,0.017687105],"genre_scores_gemma":[0.4353046,0.00041403147,0.5495431,0.00008912803,0.000052981348,0.00014378,0.0031893724,0.0006463335,0.010616627],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99935347,0.00006979225,0.000044175882,0.00018628598,0.00024224202,0.00010407091],"domain_scores_gemma":[0.9989881,0.00042526377,0.000065263914,0.00031920086,0.00013450699,0.00006766798],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041204368,0.0009151502,0.0013720863,0.0018284075,0.00095761276,0.0018107546,0.0015256418,0.0007406708,0.015906317],"category_scores_gemma":[0.0030303346,0.0005464934,0.00074150873,0.0030148863,0.0005882333,0.0036328563,0.0024404167,0.001181318,0.0023473261],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00078900985,0.00030365287,0.0023184374,0.0004979083,0.00014186015,0.00041522164,0.00045588953,0.28536892,0.017520437,0.104681805,0.020905608,0.56660116],"study_design_scores_gemma":[0.00010791279,0.00013050463,0.0009773792,0.00003715684,0.00005627723,0.00024578188,0.0004165431,0.76645803,0.010729846,0.21021563,0.0106000565,0.00002485317],"about_ca_topic_score_codex":0.0035929198,"about_ca_topic_score_gemma":0.007664877,"teacher_disagreement_score":0.015906317,"about_ca_system_score_codex":0.0009719942,"about_ca_system_score_gemma":0.0013020012,"threshold_uncertainty_score":0.053211868},"labels":[],"label_agreement":null},{"id":"W2008735761","doi":"10.1016/j.comgeo.2010.09.008","title":"Fréchet distance with speed limits","year":2010,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Traverse; Tree traversal; Range (aeronautics); Generalization; Mathematics; Speedup; Point (geometry); Algorithm; Geometry; Computational geometry; Computer science; Combinatorics; Mathematical analysis; Geodesy","score_opus":0.011035953684044022,"score_gpt":0.23848588067294868,"score_spread":0.22744992698890465,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2008735761","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03988159,0.0037591353,0.89880085,0.003054768,0.0008562245,0.00005998871,0.0001814137,0.00052027544,0.052885707],"genre_scores_gemma":[0.7059444,0.0036678698,0.19470158,0.0009980825,0.0014253261,0.0003381682,0.00041435054,0.0014466131,0.091063626],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977435,0.0006002867,0.00011771165,0.00038663394,0.00089597073,0.00025584915],"domain_scores_gemma":[0.9901626,0.0055254195,0.0005731547,0.0012953728,0.0017338254,0.00070954993],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030037416,0.0019034722,0.0015291788,0.0035965675,0.0016191409,0.0030931276,0.002673648,0.002931737,0.009667505],"category_scores_gemma":[0.022942323,0.0009499232,0.0010199264,0.001991535,0.0038409468,0.010214293,0.0068761534,0.005407141,0.0018170798],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059670252,0.00002217466,0.00017365986,0.00007805033,0.000014167616,0.000048853555,0.00008687064,0.01353538,0.00084276125,0.96501833,0.0026481065,0.017471863],"study_design_scores_gemma":[0.000010997079,0.000043017426,0.00012939234,0.000026668917,0.00001417708,0.00015450978,0.000029727333,0.10468711,0.0011210283,0.88538605,0.00837212,0.00002513392],"about_ca_topic_score_codex":0.0015653364,"about_ca_topic_score_gemma":0.0009450264,"teacher_disagreement_score":0.009667505,"about_ca_system_score_codex":0.0018801867,"about_ca_system_score_gemma":0.0010801969,"threshold_uncertainty_score":0.032341063},"labels":[],"label_agreement":null},{"id":"W2010416098","doi":"10.1016/j.comgeo.2005.11.002","title":"Three problems about simple polygons","year":2006,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Disjoint sets; Combinatorics; Simple (philosophy); Triangulation; Regular polygon; Simple polygon; Mathematics; Polygon (computer graphics); Convex hull; Series (stratigraphy); Convex polygon; Subroutine; SIMPLE algorithm; Monotone polygon; Discrete mathematics; Computer science; Geometry","score_opus":0.014010556096416268,"score_gpt":0.2378212923940115,"score_spread":0.22381073629759524,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2010416098","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07599007,0.0041477615,0.5693093,0.026897727,0.001954326,0.00016751577,0.0006769133,0.000511752,0.32034472],"genre_scores_gemma":[0.692959,0.004218674,0.19179632,0.0025269291,0.0023235723,0.00026219172,0.0008976106,0.00062240986,0.10439329],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990056,0.00019848884,0.000041043775,0.00016497506,0.00048647,0.000103386155],"domain_scores_gemma":[0.99698395,0.0017719482,0.00020129718,0.0005127549,0.0003608662,0.00016921412],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009100561,0.00057877396,0.00070376555,0.0011985229,0.0025339818,0.0036272837,0.001681795,0.002513268,0.01197959],"category_scores_gemma":[0.009255788,0.0005685228,0.0011420073,0.0017842649,0.00467271,0.00722568,0.0030226505,0.0041666045,0.0013459534],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002637103,0.000012071418,0.00010589606,0.00007075266,0.000003993138,0.000104157705,0.00027996406,0.0026566763,0.00033519889,0.9748871,0.005390634,0.016127184],"study_design_scores_gemma":[0.000008984346,0.0000075126895,0.0001190199,0.000015909765,0.0000044747176,0.00019959855,0.0001739504,0.005433115,0.00045455658,0.97529435,0.018279666,0.000008819863],"about_ca_topic_score_codex":0.0015442873,"about_ca_topic_score_gemma":0.0010544739,"teacher_disagreement_score":0.01197959,"about_ca_system_score_codex":0.0011473551,"about_ca_system_score_gemma":0.00059627567,"threshold_uncertainty_score":0.04007566},"labels":[],"label_agreement":null},{"id":"W2010585683","doi":"10.1016/j.comgeo.2006.05.009","title":"Flexible isosurfaces: Simplifying and displaying scalar topology using the contour tree","year":2009,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":100,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"National Science Foundation","keywords":"Contour line; Scalar field; Scalar (mathematics); Tree (set theory); Visualization; Computational topology; Computer science; Topology (electrical circuits); Computer vision; Artificial intelligence; Computer graphics (images); Geometry; Mathematics; Geography; Cartography; Mathematical analysis; Combinatorics","score_opus":0.032246098413128386,"score_gpt":0.29592415510146086,"score_spread":0.2636780566883325,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2010585683","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021974677,0.00015360054,0.97176784,0.00019249167,0.00006067316,0.00004456984,0.00022959539,0.0031914294,0.0023851204],"genre_scores_gemma":[0.3703381,0.00076879177,0.6227004,0.00012628052,0.00006929877,0.00010024808,0.0007619787,0.0025829046,0.002551995],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99948394,0.000110943816,0.000038976676,0.000057158675,0.0002632249,0.000045754157],"domain_scores_gemma":[0.99819607,0.0006931979,0.00009561583,0.0006294009,0.00027049292,0.00011522082],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094992144,0.00087434484,0.0011195382,0.0020142116,0.00064993266,0.0040614973,0.0013392027,0.0008258231,0.006217632],"category_scores_gemma":[0.005513053,0.0006302122,0.0008327489,0.0022205524,0.0009742086,0.0037887478,0.0030599877,0.0016842938,0.0014660228],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00059106335,0.00014709015,0.0019101618,0.00042425861,0.000069246955,0.0006829637,0.0016384581,0.11895994,0.053087004,0.2143753,0.0154403215,0.5926742],"study_design_scores_gemma":[0.000054204625,0.00008579629,0.00052446395,0.00006261965,0.000033739652,0.00038939924,0.00026050123,0.7982465,0.026643408,0.14706582,0.026555007,0.00007851313],"about_ca_topic_score_codex":0.0012852001,"about_ca_topic_score_gemma":0.0014235121,"teacher_disagreement_score":0.006217632,"about_ca_system_score_codex":0.00044264275,"about_ca_system_score_gemma":0.00068581384,"threshold_uncertainty_score":0.020800054},"labels":[],"label_agreement":null},{"id":"W2011903683","doi":"10.1016/s0925-7721(99)00055-3","title":"Queries with segments in Voronoi diagrams","year":2000,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Killam Trusts; Natural Sciences and Engineering Research Council of Canada; Institut national de recherche en informatique et en automatique (INRIA)","keywords":"Disjoint sets; Voronoi diagram; Line segment; Convex hull; Computational geometry; Combinatorics; Plane (geometry); Point (geometry); Hausdorff distance; Regular polygon; Computer science; Set (abstract data type); Line (geometry); Hausdorff space; Mathematics; Algorithm; Artificial intelligence; Geometry","score_opus":0.00620114208630814,"score_gpt":0.21263248440813912,"score_spread":0.20643134232183097,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2011903683","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08690856,0.0017595838,0.88258976,0.0022367924,0.0002622969,0.00052273483,0.005565465,0.0058007995,0.014353995],"genre_scores_gemma":[0.63405436,0.0011550642,0.34471357,0.00045703436,0.00022821141,0.00036563203,0.010721299,0.0014024632,0.006902455],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9942345,0.0015071325,0.00056283124,0.00078755827,0.0024379543,0.00046996583],"domain_scores_gemma":[0.9886875,0.0076336223,0.00040506382,0.0021360707,0.00075340096,0.00038432685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021571994,0.00086653937,0.002610951,0.0025936512,0.0015298963,0.0049763895,0.0022838002,0.0027645994,0.009419074],"category_scores_gemma":[0.028033454,0.00089230185,0.0012523696,0.0053775236,0.0015727661,0.012538076,0.0062090848,0.0019118168,0.0021568318],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0021626528,0.00037349027,0.005924363,0.0012150764,0.00022702325,0.000906805,0.0018212663,0.16428457,0.0064574736,0.4594012,0.060456045,0.29677007],"study_design_scores_gemma":[0.00018476273,0.00009341147,0.00037846479,0.00008395795,0.000058620484,0.00039634033,0.00054655387,0.395637,0.0066718236,0.5631127,0.032802336,0.00003404345],"about_ca_topic_score_codex":0.0029592335,"about_ca_topic_score_gemma":0.003294443,"teacher_disagreement_score":0.009419074,"about_ca_system_score_codex":0.0017540284,"about_ca_system_score_gemma":0.001035726,"threshold_uncertainty_score":0.031509995},"labels":[],"label_agreement":null},{"id":"W2012691739","doi":"10.1016/j.comgeo.2014.02.004","title":"A note on the unsolvability of the weighted region shortest path problem","year":2014,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Mathematics; Shortest path problem; Combinatorics; Subdivision; Euclidean shortest path; Euclidean geometry; Integer (computer science); Path (computing); Algebraic number; Rational number; Computation; Discrete mathematics; K shortest path routing; Algorithm; Computer science; Geometry; Mathematical analysis","score_opus":0.01533708331655553,"score_gpt":0.23211046436807528,"score_spread":0.21677338105151975,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2012691739","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014792796,0.0039568082,0.9348606,0.00878236,0.0017354339,0.00011495525,0.00045741658,0.00033099868,0.03496858],"genre_scores_gemma":[0.31083307,0.015527997,0.62267905,0.004164635,0.005808912,0.0008580853,0.0016530944,0.002031235,0.03644394],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9943125,0.0022716308,0.0003242541,0.0012840157,0.0014325274,0.00037494977],"domain_scores_gemma":[0.9504348,0.042353317,0.00097130344,0.0036262556,0.001914859,0.00069941377],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0069260886,0.0018477426,0.002571652,0.0021142582,0.0027761976,0.003915034,0.006257327,0.0033371972,0.013276804],"category_scores_gemma":[0.058478795,0.0013907606,0.0038651277,0.0037431153,0.007807569,0.014761781,0.0083297575,0.017214794,0.002025852],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003402289,0.000101058344,0.000537367,0.0007623757,0.000110004534,0.00040559535,0.0004944986,0.09888848,0.0023849076,0.8098644,0.021036157,0.065074906],"study_design_scores_gemma":[0.000038810165,0.000050699793,0.00013212048,0.000099770856,0.000033557433,0.00010159913,0.00006130534,0.116830826,0.00088069343,0.8684462,0.01328362,0.000040907587],"about_ca_topic_score_codex":0.0042118765,"about_ca_topic_score_gemma":0.0022281394,"teacher_disagreement_score":0.013276804,"about_ca_system_score_codex":0.0016614754,"about_ca_system_score_gemma":0.0019699447,"threshold_uncertainty_score":0.044415355},"labels":[],"label_agreement":null},{"id":"W2013115769","doi":"10.1016/j.comgeo.2007.05.006","title":"Encompassing colored planar straight line graphs","year":2007,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Combinatorics; Planar graph; Vertex (graph theory); Connected component; Colored; Mathematics; Planar; Graph; Enhanced Data Rates for GSM Evolution; Spanning tree; Matching (statistics); Computer science; Artificial intelligence; Computer graphics (images)","score_opus":0.01876496356272188,"score_gpt":0.2701962851754623,"score_spread":0.2514313216127404,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2013115769","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09001806,0.0001246646,0.88951844,0.00013598503,0.00005260379,0.00009823765,0.00029108132,0.0010472729,0.018713607],"genre_scores_gemma":[0.60317653,0.0002813069,0.36936775,0.00016975148,0.000031010568,0.00014197531,0.0012323689,0.0007050973,0.024894131],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993331,0.000121581164,0.000027692284,0.00018912027,0.00022292783,0.00010570471],"domain_scores_gemma":[0.9985164,0.00046359317,0.00015599495,0.00035632422,0.0003674059,0.00014018147],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038940037,0.00091147446,0.0006277598,0.0013917324,0.000773449,0.0018051751,0.0018679012,0.0011410568,0.008480137],"category_scores_gemma":[0.0026574237,0.00081825745,0.00071590894,0.0016193559,0.00085570704,0.0026358312,0.0028410894,0.0012662346,0.0018817694],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033655186,0.00016360103,0.0025354568,0.00029425262,0.00007111722,0.0009827762,0.0007215811,0.27266514,0.039374363,0.52193886,0.0077671995,0.15314914],"study_design_scores_gemma":[0.00004086007,0.00012041118,0.0008961168,0.000063645566,0.000050914703,0.00052675867,0.00038470776,0.5954083,0.02125302,0.36009338,0.021125318,0.000036581216],"about_ca_topic_score_codex":0.0021471484,"about_ca_topic_score_gemma":0.0025785055,"teacher_disagreement_score":0.008480137,"about_ca_system_score_codex":0.0007936523,"about_ca_system_score_gemma":0.00043215312,"threshold_uncertainty_score":0.02836889},"labels":[],"label_agreement":null},{"id":"W2016064056","doi":"10.1016/j.comgeo.2007.07.007","title":"I/O-efficient algorithms for computing planar geometric spanners","year":2007,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Bioethics Society; Carleton University","funders":"","keywords":"Planar; Planar graph; Point (geometry); Plane (geometry); Computer science; Algorithm; Combinatorics; Mathematics; Theoretical computer science; Geometry; Computer graphics (images); Graph","score_opus":0.028308479776054888,"score_gpt":0.29417224396095326,"score_spread":0.2658637641848984,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2016064056","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026696954,0.00032654803,0.9578785,0.00011334186,0.00006815318,0.00008916121,0.00024269185,0.0037189533,0.0108657265],"genre_scores_gemma":[0.201722,0.00032992393,0.78922266,0.00010371769,0.000056018664,0.00021148866,0.0010866687,0.00079330645,0.006474266],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994709,0.00005483379,0.000035060937,0.00011085268,0.00022711486,0.000101295765],"domain_scores_gemma":[0.99914575,0.0003289095,0.0000819047,0.00024170666,0.00015254879,0.000049119175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003566133,0.0015359634,0.00084743055,0.0014131712,0.0006760877,0.0012864849,0.0022280249,0.00085579586,0.012530044],"category_scores_gemma":[0.0027057235,0.00048657603,0.00084047805,0.002397415,0.0006954806,0.002940547,0.0029481703,0.0012527723,0.0030032236],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038499187,0.00024101231,0.0012940153,0.00044533057,0.00006529883,0.00013540906,0.00029775468,0.16743201,0.018633267,0.0648122,0.014784509,0.73147416],"study_design_scores_gemma":[0.00012394774,0.00013395312,0.0003819993,0.000037607642,0.00004211069,0.00011117482,0.00020210065,0.865157,0.018179804,0.10703235,0.008571619,0.000026337873],"about_ca_topic_score_codex":0.001919561,"about_ca_topic_score_gemma":0.0049260645,"teacher_disagreement_score":0.012530044,"about_ca_system_score_codex":0.00070938305,"about_ca_system_score_gemma":0.00083899335,"threshold_uncertainty_score":0.041917205},"labels":[],"label_agreement":null},{"id":"W2016199536","doi":"10.1016/j.comgeo.2004.06.001","title":"Grid drawings of k-colourable graphs","year":2004,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Grid; Graph; Combinatorics; Upper and lower bounds; Computer science; Mathematics; Geometry","score_opus":0.010242047303097624,"score_gpt":0.233897297309779,"score_spread":0.22365525000668138,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2016199536","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10766142,0.00043377717,0.84311306,0.0004130828,0.00015668049,0.00017696022,0.0011976304,0.001255149,0.045592263],"genre_scores_gemma":[0.55545443,0.0011888705,0.41458338,0.00013877919,0.000041629348,0.00022715818,0.0020912788,0.00055696745,0.025717357],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99963415,0.00010552742,0.000020986963,0.00006461734,0.00011779398,0.000056928533],"domain_scores_gemma":[0.9991259,0.00035349018,0.00009754319,0.00019424902,0.00014654954,0.00008236049],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020424169,0.0005431217,0.00053781795,0.00090820197,0.0005357517,0.0014785053,0.0011225974,0.0007633432,0.012951842],"category_scores_gemma":[0.0019321007,0.0005697455,0.0004801292,0.0014953293,0.0006625187,0.0010566576,0.0010772239,0.0010694931,0.001985714],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002697178,0.000082416096,0.0014445877,0.00039937886,0.000042124022,0.0006260344,0.0006309863,0.26153535,0.014958266,0.5358246,0.016371265,0.16781533],"study_design_scores_gemma":[0.000107413296,0.000060235066,0.0010737506,0.000084670966,0.000029609477,0.00044082015,0.00030509703,0.3948344,0.007144202,0.5423575,0.0535241,0.000038126473],"about_ca_topic_score_codex":0.0027892392,"about_ca_topic_score_gemma":0.0047929035,"teacher_disagreement_score":0.012951842,"about_ca_system_score_codex":0.0006179505,"about_ca_system_score_gemma":0.0003518038,"threshold_uncertainty_score":0.043328285},"labels":[],"label_agreement":null},{"id":"W2016887255","doi":"10.1016/j.comgeo.2010.03.005","title":"Matched drawability of graph pairs and of graph triples","year":2010,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Planarity testing; Planar graph; Combinatorics; Planar; Graph; Graph drawing; Mathematics; Computer science","score_opus":0.010929146220656228,"score_gpt":0.24201357825907532,"score_spread":0.2310844320384191,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2016887255","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16974276,0.00019392703,0.8030771,0.00027175827,0.00010739441,0.0003430362,0.0017024276,0.0018171077,0.022744518],"genre_scores_gemma":[0.79441947,0.00020860495,0.1899374,0.0001200864,0.00006120978,0.00026924998,0.003730559,0.0007284181,0.010525024],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968886,0.00044384916,0.00016592361,0.0010265281,0.0012038888,0.00027136458],"domain_scores_gemma":[0.9907554,0.003939094,0.0008041754,0.0024771374,0.0013413095,0.00068286713],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012404136,0.0006679237,0.0009641052,0.0037144755,0.0013750219,0.0036704317,0.0023612306,0.0019356672,0.017968917],"category_scores_gemma":[0.021665957,0.0008237008,0.001183486,0.0026374615,0.0014329037,0.0068350234,0.003858995,0.0015245932,0.0023258517],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011353216,0.0005138443,0.016348576,0.00062058534,0.00019067568,0.002237748,0.0021429036,0.058472987,0.029818306,0.5876153,0.008149594,0.2927543],"study_design_scores_gemma":[0.0000686439,0.00019865081,0.004067395,0.00011332922,0.00012675444,0.0009507632,0.0011465433,0.22404307,0.03462746,0.7168584,0.01774846,0.00005042804],"about_ca_topic_score_codex":0.0018604172,"about_ca_topic_score_gemma":0.002083972,"teacher_disagreement_score":0.017968917,"about_ca_system_score_codex":0.00077231514,"about_ca_system_score_gemma":0.0005997639,"threshold_uncertainty_score":0.06011206},"labels":[],"label_agreement":null},{"id":"W2022056727","doi":"10.1016/j.comgeo.2012.01.006","title":"The union of colorful simplices spanned by a colored point set","year":2012,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Combinatorics; Colored; Mathematics; Simplex; Hyperplane; Upper and lower bounds; Ackermann function; Point (geometry); Euclidean space; Inverse; Geometry","score_opus":0.01367412419404745,"score_gpt":0.25875668846029914,"score_spread":0.2450825642662517,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2022056727","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22019672,0.00028025132,0.7506237,0.00022064304,0.00018704009,0.00006800832,0.0005679586,0.000671019,0.027184606],"genre_scores_gemma":[0.71322876,0.00037042997,0.26467606,0.0002199347,0.000066870954,0.0001821941,0.0010881658,0.00060266803,0.019564927],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999012,0.00014468418,0.000039395472,0.00018546678,0.00046732472,0.00015112548],"domain_scores_gemma":[0.99870276,0.0003096164,0.000110928384,0.00021223036,0.00035210163,0.00031237787],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060214463,0.00079120765,0.00070687965,0.0018758613,0.0012862497,0.002659765,0.0015864877,0.0009084849,0.006894371],"category_scores_gemma":[0.0023220864,0.00075804634,0.0006269514,0.0012017911,0.0013164192,0.002058332,0.0031711406,0.0015595506,0.0012820282],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034830294,0.00015615966,0.002536142,0.00017214462,0.00008271421,0.00050217053,0.0006623877,0.043719485,0.033408847,0.8447329,0.0048668925,0.06881186],"study_design_scores_gemma":[0.00004891061,0.00013803024,0.0019721517,0.00011456726,0.000055498404,0.0008119171,0.00074778876,0.2759393,0.024578197,0.6717224,0.023778047,0.00009316171],"about_ca_topic_score_codex":0.0012821546,"about_ca_topic_score_gemma":0.0013037111,"teacher_disagreement_score":0.006894371,"about_ca_system_score_codex":0.0005543869,"about_ca_system_score_gemma":0.0005221788,"threshold_uncertainty_score":0.023064017},"labels":[],"label_agreement":null},{"id":"W2022093184","doi":"10.1016/j.comgeo.2009.01.007","title":"A (slightly) faster algorithm for Klee's measure problem","year":2009,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":44,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Measure (data warehouse); Computer science; Algorithm; Mathematics; Data mining","score_opus":0.01586173538029706,"score_gpt":0.2540035963032679,"score_spread":0.23814186092297085,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2022093184","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036846402,0.00027441117,0.980145,0.001027447,0.00078611454,0.00017123121,0.0002290291,0.0022876835,0.011394443],"genre_scores_gemma":[0.048029184,0.00017824749,0.92886186,0.0006584433,0.00030204465,0.00036609775,0.00076820387,0.0013210282,0.01951487],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99767286,0.00036294854,0.00015434258,0.00056577066,0.0010186961,0.00022542197],"domain_scores_gemma":[0.99775606,0.00069870544,0.00007283869,0.00080389564,0.00051107194,0.00015745134],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001680872,0.0019345925,0.0017397585,0.0024794352,0.0013215275,0.003070209,0.0035869703,0.0028361091,0.04770912],"category_scores_gemma":[0.0072352295,0.0007370924,0.0024211959,0.002454961,0.0013527155,0.004841452,0.0048534777,0.0052106157,0.017025372],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004028265,0.00039438996,0.0005590468,0.00058611634,0.00019488335,0.00019619394,0.00029988113,0.023473471,0.018440478,0.22142306,0.048380587,0.6856491],"study_design_scores_gemma":[0.00067352987,0.00028194173,0.0011575468,0.00012655059,0.00017536203,0.000727353,0.00023883171,0.35816854,0.018134547,0.49962056,0.12053704,0.00015823124],"about_ca_topic_score_codex":0.0034430544,"about_ca_topic_score_gemma":0.005088255,"teacher_disagreement_score":0.04770912,"about_ca_system_score_codex":0.0012852681,"about_ca_system_score_gemma":0.0020762684,"threshold_uncertainty_score":0.15960288},"labels":[],"label_agreement":null},{"id":"W2022832678","doi":"10.1016/s0925-7721(01)00058-x","title":"Optimally computing a shortest weakly visible line segment inside a simple polygon","year":2002,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor; Simon Fraser University","funders":"","keywords":"Simple polygon; Polygon covering; Polygon (computer graphics); Visibility polygon; Star-shaped polygon; Point in polygon; Rectilinear polygon; Algorithm; Line segment; Mathematics; Line (geometry); Combinatorics; Vertex (graph theory); Simple (philosophy); Computer science; Monotone polygon; Regular polygon; Geometry; Graph","score_opus":0.02784048829496428,"score_gpt":0.26236245067230884,"score_spread":0.23452196237734457,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2022832678","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29928723,0.0001170999,0.6913754,0.00034034383,0.000054575306,0.00014793612,0.00035493582,0.0019467836,0.00637568],"genre_scores_gemma":[0.5327167,0.00007009148,0.46248278,0.00004865506,0.00002423235,0.00006745648,0.0007195255,0.00050686585,0.003363687],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997094,0.000049027516,0.000013477939,0.000089569185,0.00008006671,0.000058433878],"domain_scores_gemma":[0.9990356,0.0005786626,0.00008698937,0.000102190395,0.00009981936,0.0000968531],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033081818,0.00096491206,0.0014648484,0.00078649214,0.00080071704,0.001271031,0.001382779,0.0017519206,0.0059049777],"category_scores_gemma":[0.0021851885,0.00087019167,0.00087075727,0.0010287993,0.0008350461,0.001385476,0.0013211513,0.0012805583,0.00090279366],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013731106,0.0002703409,0.0024585554,0.00039835114,0.000083257444,0.00041537077,0.00044509373,0.76214606,0.040985797,0.014555784,0.0051373225,0.171731],"study_design_scores_gemma":[0.000044161436,0.00011188576,0.0001818945,0.000007682499,0.000012346716,0.000029204688,0.00009119492,0.9881196,0.0053751385,0.0054344577,0.0005846494,0.00000776667],"about_ca_topic_score_codex":0.004568132,"about_ca_topic_score_gemma":0.0072448635,"teacher_disagreement_score":0.0059049777,"about_ca_system_score_codex":0.000772525,"about_ca_system_score_gemma":0.0011206601,"threshold_uncertainty_score":0.019754112},"labels":[],"label_agreement":null},{"id":"W2023271676","doi":"10.1016/j.comgeo.2012.09.004","title":"Drawing planar 3-trees with given face areas","year":2012,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Planar graph; Combinatorics; Outerplanar graph; Vertex (graph theory); Planar; Planar straight-line graph; Mathematics; Book embedding; Face (sociological concept); Graph; Geometry; Computer science; 1-planar graph; Line graph; Pathwidth; Computer graphics (images); Sociology","score_opus":0.01695545357795257,"score_gpt":0.24508462542624443,"score_spread":0.22812917184829185,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2023271676","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04947751,0.00028235346,0.92738634,0.00032724536,0.00013298783,0.00027036716,0.00073384255,0.0021917112,0.019197667],"genre_scores_gemma":[0.24313752,0.00059611385,0.7458204,0.00013814885,0.000055993332,0.00023171217,0.0010628379,0.00087989087,0.008077468],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99964464,0.00005209206,0.000023553874,0.00007356927,0.00015586634,0.000050221293],"domain_scores_gemma":[0.99944276,0.00026094817,0.000041308595,0.00009574694,0.00010783552,0.000051388637],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032287702,0.0009871518,0.00091778114,0.0011075563,0.0005780815,0.0016699473,0.0013730243,0.0012990655,0.012318143],"category_scores_gemma":[0.0023155017,0.00085816317,0.0009499015,0.0012791101,0.00066434126,0.0016864062,0.0017891856,0.0018083147,0.0021123386],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046403764,0.00022825434,0.0014730976,0.0008120529,0.000113579335,0.00061602873,0.00080527185,0.2580882,0.040193774,0.17478304,0.024371779,0.49805087],"study_design_scores_gemma":[0.00011288078,0.00016864673,0.00058770715,0.00012468075,0.00006695405,0.0005024239,0.00032481135,0.77854663,0.022037087,0.15904133,0.03844038,0.000046556393],"about_ca_topic_score_codex":0.0014991396,"about_ca_topic_score_gemma":0.00475785,"teacher_disagreement_score":0.012318143,"about_ca_system_score_codex":0.00066215167,"about_ca_system_score_gemma":0.00051508745,"threshold_uncertainty_score":0.041208267},"labels":[],"label_agreement":null},{"id":"W2023414931","doi":"10.1016/j.comgeo.2005.06.003","title":"Equitable subdivisions within polygonal regions","year":2005,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; Carleton University","funders":"","keywords":"Combinatorics; Geodesic; Regular polygon; Partition (number theory); Mathematics; Generalization; Simple (philosophy); Geometry; Mathematical analysis","score_opus":0.023731384641348472,"score_gpt":0.27273030432527884,"score_spread":0.24899891968393037,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2023414931","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.078551,0.0002168759,0.90790105,0.00013760147,0.0000409606,0.00009929984,0.0000928871,0.00036406956,0.012596208],"genre_scores_gemma":[0.6666157,0.00026334738,0.3219462,0.000094486386,0.000043223514,0.00016484802,0.00029073076,0.00050893653,0.010072519],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990324,0.00023121202,0.00006231539,0.00015113663,0.00042940784,0.000093522394],"domain_scores_gemma":[0.9978612,0.001003984,0.00012695268,0.0006333207,0.0003061896,0.0000683942],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089576194,0.00036030397,0.00078101247,0.0012087903,0.0006711339,0.0013166392,0.0012425464,0.0007330264,0.006464387],"category_scores_gemma":[0.0065803234,0.00047958628,0.00039035614,0.0011294015,0.0011355306,0.0018467586,0.0027331377,0.0011692457,0.00068566547],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042326585,0.00014617092,0.0018062522,0.0002235397,0.000032063257,0.0002970273,0.0008938834,0.32687384,0.019294353,0.33089894,0.0027625628,0.3163481],"study_design_scores_gemma":[0.0000484299,0.00011030759,0.00045634276,0.000043344353,0.000024425768,0.0002671386,0.00024993555,0.75197655,0.013342976,0.21959694,0.013868932,0.000014647294],"about_ca_topic_score_codex":0.00079545134,"about_ca_topic_score_gemma":0.0015081313,"teacher_disagreement_score":0.006464387,"about_ca_system_score_codex":0.00051656883,"about_ca_system_score_gemma":0.00028665396,"threshold_uncertainty_score":0.021625519},"labels":[],"label_agreement":null},{"id":"W2024874686","doi":"10.1016/j.comgeo.2012.02.001","title":"Watchman tours for polygons with holes","year":2012,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Polygon (computer graphics); Combinatorics; Mathematics; Multiplicative function; Point (geometry); Domain (mathematical analysis); Rectilinear polygon; Star-shaped polygon; Perimeter; Point in polygon; Simple polygon; Upper and lower bounds; Geometry; Monotone polygon; Regular polygon; Computer science; Mathematical analysis","score_opus":0.01853593308062232,"score_gpt":0.25912884925260504,"score_spread":0.24059291617198272,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2024874686","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11830736,0.00034296454,0.8328355,0.0004212522,0.00024295009,0.00033500107,0.000962395,0.0025173083,0.044035263],"genre_scores_gemma":[0.3918137,0.00053782633,0.54357666,0.00017346375,0.00006363714,0.00033640233,0.0028514627,0.0018686997,0.058778204],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997857,0.0000398905,0.000010429167,0.00005222128,0.000059443297,0.000052169315],"domain_scores_gemma":[0.99936,0.00024558904,0.000055890054,0.00013377376,0.00008995409,0.00011481825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028435848,0.0005738567,0.0006680205,0.00091694423,0.0011448921,0.0012312745,0.0011938217,0.0007747274,0.020193912],"category_scores_gemma":[0.0026423063,0.00055505626,0.00080829766,0.0007581645,0.00080479536,0.0015549243,0.00230811,0.0011769689,0.0023204784],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00062656123,0.00013859376,0.002151462,0.0004089522,0.000049478476,0.0007114937,0.0012415221,0.16754769,0.00949707,0.580005,0.03771477,0.19990747],"study_design_scores_gemma":[0.000077329634,0.00014568638,0.0006011762,0.00011965517,0.000029831943,0.00029359598,0.00070860836,0.6579238,0.0047925697,0.27704358,0.05822456,0.00003962367],"about_ca_topic_score_codex":0.004066811,"about_ca_topic_score_gemma":0.007142745,"teacher_disagreement_score":0.020193912,"about_ca_system_score_codex":0.0006931194,"about_ca_system_score_gemma":0.00065288594,"threshold_uncertainty_score":0.06755537},"labels":[],"label_agreement":null},{"id":"W2030723399","doi":"10.1016/j.comgeo.2008.06.004","title":"A linear-space algorithm for distance preserving graph embedding","year":2008,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Face and Expression Recognition","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"National Research Council Canada; Carleton University","funders":"National Research Council Canada; Ontario Ministry of Research and Innovation; Natural Sciences and Engineering Research Council of Canada; Mitacs; Ministry of Education, Culture, Sports, Science and Technology","keywords":"Mathematics; Scaling; Embedding; Combinatorics; Euclidean distance; Algorithm; Diagonal; Multidimensional scaling; Discrete mathematics; Computer science; Statistics; Geometry","score_opus":0.026321080000358724,"score_gpt":0.28478862768333224,"score_spread":0.25846754768297353,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2030723399","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037408818,0.00015896161,0.9917671,0.00015027265,0.000072549665,0.00007703401,0.000160154,0.0025619627,0.0013110553],"genre_scores_gemma":[0.052335974,0.00018332056,0.9399146,0.00012056477,0.000061029255,0.00019881409,0.0009841697,0.00045864008,0.0057428507],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99848443,0.00027099508,0.00009619597,0.00045579797,0.0005658692,0.00012680708],"domain_scores_gemma":[0.9985991,0.00042685642,0.00007085038,0.000481495,0.000330586,0.000091116686],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077836146,0.0014961881,0.0013753906,0.002078543,0.0009933629,0.0021453276,0.003095334,0.0014769279,0.013247309],"category_scores_gemma":[0.0036376195,0.0007229153,0.0012072915,0.0027499343,0.0012148612,0.0036119972,0.0041758283,0.003172054,0.007079656],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026682965,0.0002358067,0.00032873562,0.00018296902,0.00007277929,0.00007065563,0.00013824234,0.03886687,0.010106601,0.040266965,0.016013017,0.89345056],"study_design_scores_gemma":[0.00014564609,0.0002779597,0.0004943221,0.000035591936,0.00005879608,0.0003195546,0.00018483715,0.8485026,0.018082699,0.11046219,0.02136383,0.00007198263],"about_ca_topic_score_codex":0.0049124914,"about_ca_topic_score_gemma":0.006486004,"teacher_disagreement_score":0.013247309,"about_ca_system_score_codex":0.0010618014,"about_ca_system_score_gemma":0.0013875319,"threshold_uncertainty_score":0.04431665},"labels":[],"label_agreement":null},{"id":"W2030839304","doi":"10.1016/j.comgeo.2012.09.009","title":"Localized geometric query problems","year":2012,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Ministerio de Economía y Competitividad","keywords":"Query optimization; Computer science; Query expansion; Sargable; Information retrieval; Web search query; Search engine","score_opus":0.023343211738097377,"score_gpt":0.2562217752583361,"score_spread":0.23287856352023872,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2030839304","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022740662,0.0017648782,0.9561255,0.0023425887,0.00018094236,0.00018471076,0.00096379855,0.0015734081,0.014123577],"genre_scores_gemma":[0.57796025,0.0029787773,0.3681215,0.0013524038,0.0012078456,0.000766718,0.0062220804,0.0012588892,0.04013157],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970066,0.0007577512,0.00014727689,0.0008607722,0.00090941327,0.00031812204],"domain_scores_gemma":[0.9939121,0.0035802727,0.00031687954,0.0014121225,0.000576689,0.00020204845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017734676,0.001323642,0.003067061,0.0014718188,0.0012721714,0.003804328,0.0037608533,0.0034628755,0.025011027],"category_scores_gemma":[0.01225807,0.000925948,0.0011904547,0.0029996291,0.002219792,0.007189246,0.0053353524,0.0032821952,0.0045418926],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00079673604,0.00031965278,0.0010504406,0.001127557,0.00015527342,0.0006358725,0.00051791035,0.18426247,0.008143317,0.5145055,0.07147648,0.21700883],"study_design_scores_gemma":[0.00015247522,0.00014070768,0.00028550415,0.00005472773,0.000066208115,0.000530598,0.00030639445,0.5360088,0.0046741436,0.43729007,0.02045515,0.000035259745],"about_ca_topic_score_codex":0.001529508,"about_ca_topic_score_gemma":0.0015795609,"teacher_disagreement_score":0.025011027,"about_ca_system_score_codex":0.0016838216,"about_ca_system_score_gemma":0.001082111,"threshold_uncertainty_score":0.08367026},"labels":[],"label_agreement":null},{"id":"W2030923360","doi":"10.1016/j.comgeo.2005.11.001","title":"Progress on maximum weight triangulation","year":2006,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland; University of Waterloo","funders":"","keywords":"Minimum-weight triangulation; Triangulation; Pitteway triangulation; Point set triangulation; Mathematics; Combinatorics; Polygon (computer graphics); Point (geometry); Regular polygon; Set (abstract data type); Delaunay triangulation; Plane (geometry); Constant (computer programming); Bounded function; Geometry; Bowyer–Watson algorithm; Mathematical analysis; Computer science","score_opus":0.010383288233911473,"score_gpt":0.24154325011322852,"score_spread":0.23115996187931706,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2030923360","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0076708714,0.013940735,0.93358517,0.0027065738,0.0017524587,0.000056506167,0.00021121286,0.0006303391,0.03944616],"genre_scores_gemma":[0.14922804,0.028334964,0.7804791,0.0017419673,0.004095793,0.0003465333,0.0009736933,0.0019788004,0.03282114],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99771714,0.00058547664,0.00012323262,0.0004908308,0.00092550594,0.00015791722],"domain_scores_gemma":[0.99420786,0.0030988415,0.00020451163,0.0016335822,0.0006699823,0.00018519147],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033628007,0.0021829002,0.0020843777,0.003499916,0.0012099941,0.0022174772,0.0038797266,0.0022787102,0.013695068],"category_scores_gemma":[0.014122581,0.0014364442,0.00164193,0.005679061,0.0027487604,0.008882946,0.007939575,0.006308452,0.003821658],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026403225,0.00008695739,0.00028951705,0.0012415245,0.00008788958,0.000081095495,0.0001971693,0.044633422,0.0039692465,0.5561491,0.021920612,0.3710794],"study_design_scores_gemma":[0.00007220115,0.00007350227,0.0003378951,0.0003650917,0.000096802294,0.00016032523,0.00006694513,0.16118875,0.0045092506,0.7414662,0.09162652,0.000036379042],"about_ca_topic_score_codex":0.0011259667,"about_ca_topic_score_gemma":0.0012187185,"teacher_disagreement_score":0.013695068,"about_ca_system_score_codex":0.0013283822,"about_ca_system_score_gemma":0.0009110529,"threshold_uncertainty_score":0.045814514},"labels":[],"label_agreement":null},{"id":"W2031858761","doi":"10.1016/s0925-7721(02)00173-6","title":"Algorithms for bivariate medians and a Fermat–Torricelli problem for lines","year":2003,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Advanced Statistical Methods and Models","field":"Mathematics","cited_by":48,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"McGill University","keywords":"Bivariate analysis; Combinatorics; Fermat's Last Theorem; Mathematics; Point (geometry); Median; Algorithm; Set (abstract data type); Statistics; Computer science; Geometry","score_opus":0.14887541764238982,"score_gpt":0.43265042127336056,"score_spread":0.28377500363097075,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2031858761","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010542489,0.00027229392,0.9854408,0.00037476464,0.00006114167,0.000043360564,0.00011484493,0.00044905455,0.0027011633],"genre_scores_gemma":[0.10854831,0.0005928616,0.8817778,0.00018015112,0.00024941904,0.00023074556,0.000935132,0.00061671727,0.0068688965],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99865365,0.0004365164,0.000095630116,0.00036456037,0.0003057789,0.00014386604],"domain_scores_gemma":[0.9926791,0.0048030065,0.00065484794,0.0008781578,0.00061509386,0.00036971664],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00312879,0.0017565707,0.002251149,0.0029856453,0.0018151859,0.0040110038,0.0040222374,0.0030018631,0.012220282],"category_scores_gemma":[0.019076644,0.0013427269,0.0026774653,0.0033119363,0.0028334658,0.008705469,0.004984336,0.0053404234,0.0026310459],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029519325,0.000142188,0.0016364435,0.0004145587,0.00010002629,0.000091808375,0.0005332693,0.18536015,0.0018478282,0.5309744,0.01783766,0.2607666],"study_design_scores_gemma":[0.00005292118,0.00005050988,0.00024763195,0.000048369446,0.000029306317,0.00007812633,0.00014384782,0.436369,0.00095329917,0.55666107,0.0053293593,0.000036549005],"about_ca_topic_score_codex":0.0026156786,"about_ca_topic_score_gemma":0.0034866284,"teacher_disagreement_score":0.012220282,"about_ca_system_score_codex":0.0018774585,"about_ca_system_score_gemma":0.0017848628,"threshold_uncertainty_score":0.040880978},"labels":[],"label_agreement":null},{"id":"W2032620872","doi":"10.1016/j.comgeo.2007.05.007","title":"Algorithms for bivariate zonoid depth","year":2007,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Advanced Statistical Methods and Models","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Bivariate analysis; Computational statistics; Computation; Point (geometry); Algorithm; Computer science; Bivariate data; Depth map; Mathematics; Artificial intelligence; Geometry; Image (mathematics); Machine learning","score_opus":0.17155065013434237,"score_gpt":0.4674411748070844,"score_spread":0.295890524672742,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2032620872","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0039540143,0.00020927985,0.9934109,0.00012832943,0.00003761726,0.000027596754,0.00010619997,0.00055515737,0.0015708765],"genre_scores_gemma":[0.16459732,0.00078635814,0.82546157,0.0001657793,0.00019123855,0.00025434972,0.0007110787,0.0009693347,0.006863047],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99906737,0.0002504935,0.000056836383,0.00020862876,0.000299488,0.000117200005],"domain_scores_gemma":[0.99656385,0.00188028,0.0001979225,0.0006026508,0.00051528,0.00024007737],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016669973,0.0010803821,0.0014862693,0.002743438,0.0011808662,0.0031535611,0.0030641071,0.0013884023,0.011565931],"category_scores_gemma":[0.014781269,0.001017315,0.0016069524,0.002365819,0.0017621777,0.0059840614,0.0061556636,0.0034936338,0.00247848],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015050336,0.000045762597,0.0010989645,0.00022995018,0.00006108267,0.000044067714,0.00027438792,0.14395736,0.0017979858,0.6073868,0.008187949,0.23676516],"study_design_scores_gemma":[0.000028979082,0.00002399897,0.00020236905,0.000029988647,0.000018104993,0.000039887836,0.00006390425,0.58756495,0.00095049344,0.40492752,0.006129919,0.000019865227],"about_ca_topic_score_codex":0.004817485,"about_ca_topic_score_gemma":0.005411423,"teacher_disagreement_score":0.011565931,"about_ca_system_score_codex":0.0018354694,"about_ca_system_score_gemma":0.001728157,"threshold_uncertainty_score":0.03869188},"labels":[],"label_agreement":null},{"id":"W2038474686","doi":"10.1016/j.comgeo.2008.06.006","title":"The projection median of a set of points","year":2008,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; University of Manitoba","funders":"","keywords":"Multiset; Mathematics; Projection (relational algebra); Euclidean geometry; Combinatorics; Euclidean distance; Point (geometry); Position (finance); Set (abstract data type); Euclidean distance matrix; Stability (learning theory); Degree (music); Euclidean space; Geometry; Algorithm; Computer science; Physics","score_opus":0.027997817368769874,"score_gpt":0.2614873178029804,"score_spread":0.23348950043421052,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2038474686","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02933404,0.0003013567,0.96559906,0.00025869985,0.00012954652,0.000091961374,0.00037778073,0.0007595458,0.0031480377],"genre_scores_gemma":[0.305233,0.0008231144,0.68266326,0.00017794165,0.00022416837,0.00048091737,0.0021055788,0.00038824393,0.007903763],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998171,0.0002793865,0.00009735364,0.0004951198,0.00084052363,0.00011664491],"domain_scores_gemma":[0.9981964,0.0005373589,0.00015943858,0.00031629868,0.0006179589,0.00017255379],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014566504,0.0007938902,0.0017264747,0.002267705,0.00078535,0.0028021752,0.0010865146,0.001564423,0.005546497],"category_scores_gemma":[0.0073726624,0.0005483075,0.0011976412,0.0020490412,0.0013459981,0.0027129876,0.0028806867,0.0016981864,0.0019990697],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011295931,0.0001969372,0.005845343,0.0005416685,0.0002833392,0.00038971705,0.00048640496,0.16070612,0.050230946,0.111002885,0.009439981,0.65974706],"study_design_scores_gemma":[0.00009522163,0.0008404518,0.0041580014,0.00018784069,0.00009380599,0.0008409505,0.0004442573,0.778788,0.03545653,0.15197764,0.027007733,0.000109600056],"about_ca_topic_score_codex":0.00091164774,"about_ca_topic_score_gemma":0.0008531506,"teacher_disagreement_score":0.005546497,"about_ca_system_score_codex":0.0006173992,"about_ca_system_score_gemma":0.0013384535,"threshold_uncertainty_score":0.018554926},"labels":[],"label_agreement":null},{"id":"W2042670297","doi":"10.1016/j.comgeo.2014.01.002","title":"Similarity of polygonal curves in the presence of outliers","year":2014,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Advanced Numerical Analysis Techniques","field":"Engineering","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Outlier; Similarity (geometry); Mathematics; Measure (data warehouse); Time complexity; Degree (music); Polygonal chain; Polynomial; Combinatorics; Algorithm; Geometry; Computer science; Mathematical analysis; Image (mathematics); Artificial intelligence; Statistics; Data mining; Regular polygon","score_opus":0.008529345386340686,"score_gpt":0.24711355288605213,"score_spread":0.23858420749971146,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2042670297","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.68174475,0.00042542737,0.31397846,0.00023899568,0.00008616712,0.00009467144,0.00015770519,0.00039852277,0.0028753534],"genre_scores_gemma":[0.9793407,0.00013952647,0.01961209,0.000015676533,0.00004724526,0.000018042443,0.00021793485,0.000056648805,0.00055225746],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99718237,0.00056753855,0.00014360738,0.00037659972,0.0015281903,0.00020162584],"domain_scores_gemma":[0.98528385,0.00624085,0.0027494316,0.0017466077,0.0032888222,0.00069047726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021110526,0.000407356,0.0011637632,0.004635624,0.00062124035,0.0023129587,0.0013892654,0.0019387023,0.0009799425],"category_scores_gemma":[0.024939807,0.0003914101,0.0004478103,0.0031928942,0.0015849159,0.002216142,0.0018408983,0.00097641035,0.00037276294],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002726256,0.00040371242,0.06506971,0.00045961144,0.00021395626,0.0042530326,0.0021850353,0.52122897,0.060233917,0.039792717,0.0030042976,0.30042872],"study_design_scores_gemma":[0.000016431706,0.00016551133,0.008844461,0.00002060418,0.000019003377,0.0009032816,0.00040193793,0.9686988,0.0059312177,0.013505267,0.0014591635,0.000034347322],"about_ca_topic_score_codex":0.0012168097,"about_ca_topic_score_gemma":0.0007922118,"teacher_disagreement_score":0.004635624,"about_ca_system_score_codex":0.0005078304,"about_ca_system_score_gemma":0.0005179753,"threshold_uncertainty_score":0.011164427},"labels":[],"label_agreement":null},{"id":"W2044633855","doi":"10.1016/j.comgeo.2010.04.005","title":"Optimal in-place and cache-oblivious algorithms for 3-d convex hulls and 2-d segment intersection","year":2010,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Intersection (aeronautics); Combinatorics; Convex hull; Voronoi diagram; Output-sensitive algorithm; Regular polygon; Mathematics; Randomized algorithm; Line segment; Point (geometry); Computational geometry; Algorithm; Computer science; Convex combination; Convex optimization; Geometry","score_opus":0.012891150938118528,"score_gpt":0.2642578783970998,"score_spread":0.25136672745898125,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2044633855","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.101154335,0.00062301895,0.8787775,0.0005694835,0.00012131765,0.0002441763,0.0005628166,0.0058345543,0.012112673],"genre_scores_gemma":[0.44129026,0.00022018664,0.54795,0.00015422751,0.00006511399,0.00026020795,0.0014143653,0.0010394396,0.007606117],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99786156,0.0003557647,0.00014208596,0.00039894017,0.00077108934,0.00047062148],"domain_scores_gemma":[0.99600536,0.0018879734,0.00029929192,0.0011800695,0.0004215355,0.00020576548],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011173711,0.0018214805,0.0025472424,0.0016462589,0.0020930097,0.002999615,0.005408439,0.0019855346,0.013525347],"category_scores_gemma":[0.0062528066,0.0014216447,0.0016371921,0.0039128014,0.0015970158,0.005252517,0.0057945405,0.0021638556,0.002038627],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0025975222,0.0006061159,0.0026503243,0.00038547834,0.00018430858,0.00016409473,0.0006512042,0.54221606,0.007749288,0.038742445,0.017089013,0.3869641],"study_design_scores_gemma":[0.00010452985,0.00008949494,0.00029277397,0.00001079739,0.000030676318,0.00004069424,0.00011456701,0.9723846,0.0038153257,0.021855634,0.0012423537,0.000018594528],"about_ca_topic_score_codex":0.0120638115,"about_ca_topic_score_gemma":0.026095243,"teacher_disagreement_score":0.013525347,"about_ca_system_score_codex":0.0031569428,"about_ca_system_score_gemma":0.00371178,"threshold_uncertainty_score":0.04524678},"labels":[],"label_agreement":null},{"id":"W2044936698","doi":"10.1016/j.comgeo.2012.09.007","title":"An in-place min–max priority search tree","year":2012,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Optimal binary search tree; Heap (data structure); Range tree; Binary search tree; Interval tree; Self-balancing binary search tree; K-ary tree; Binary tree; Tree (set theory); Combinatorics; Search tree; Segment tree; Mathematics; Tree traversal; Data structure; Ternary search tree; Set (abstract data type); Point (geometry); Computer science; Depth-first search; Algorithm; Search algorithm; Tree structure","score_opus":0.02506329569885934,"score_gpt":0.302463652275976,"score_spread":0.27740035657711665,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2044936698","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01591218,0.0005106406,0.96319914,0.00052957505,0.0002948949,0.0002722779,0.0007220686,0.0032178238,0.015341368],"genre_scores_gemma":[0.121651925,0.00022824279,0.8649433,0.00027471848,0.00009980683,0.00015948204,0.0012533581,0.0005496889,0.010839433],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99904245,0.0002069292,0.00008490591,0.00016780921,0.0003297514,0.00016810297],"domain_scores_gemma":[0.998195,0.00066456967,0.000102735685,0.00033603722,0.0005174896,0.00018419028],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012979296,0.0007791088,0.0013011334,0.0015005792,0.0012024736,0.0018066501,0.0031914315,0.0015407394,0.02068657],"category_scores_gemma":[0.005333984,0.00082326453,0.0007951974,0.001777426,0.0004829105,0.0023004736,0.0021994256,0.0017364302,0.004608279],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016224163,0.0007668245,0.0021151905,0.00081460027,0.0001097214,0.00029417034,0.00031477257,0.11794032,0.012110041,0.059849966,0.042902153,0.7611598],"study_design_scores_gemma":[0.00034483217,0.0005959029,0.0005804756,0.00009389986,0.00012036795,0.0004137595,0.00017680206,0.8711601,0.012405241,0.08217034,0.031879477,0.0000587696],"about_ca_topic_score_codex":0.0020788112,"about_ca_topic_score_gemma":0.0049074474,"teacher_disagreement_score":0.02068657,"about_ca_system_score_codex":0.0007765201,"about_ca_system_score_gemma":0.0025983169,"threshold_uncertainty_score":0.06920344},"labels":[],"label_agreement":null},{"id":"W2048246906","doi":"10.1016/s0925-7721(00)00012-2","title":"Reporting curve segment intersections using restricted predicates","year":2000,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Intersection (aeronautics); Monotone polygon; Combinatorics; Logarithm; Mathematics; Tree (set theory); Point (geometry); Plane (geometry); Colored; Binary logarithm; Algorithm; Computer science; Geometry; Mathematical analysis; Cartography","score_opus":0.0383713826338252,"score_gpt":0.29601546139881735,"score_spread":0.2576440787649921,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2048246906","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20471872,0.0011269776,0.7415626,0.0010628811,0.0002781749,0.0003794579,0.01143348,0.02905409,0.010383629],"genre_scores_gemma":[0.81641,0.00049815385,0.1645337,0.00021492864,0.00017907715,0.00024354096,0.0151192555,0.0008448294,0.0019564822],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9898837,0.0011610336,0.001268371,0.0016229082,0.0051454003,0.0009185084],"domain_scores_gemma":[0.9679249,0.014152102,0.0029199626,0.010609295,0.0035755492,0.00081826095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027916753,0.001429256,0.0026213538,0.005065208,0.001521003,0.004760142,0.003958121,0.0027014525,0.007772272],"category_scores_gemma":[0.028168615,0.00092616596,0.0012825778,0.006486198,0.0014334128,0.012798951,0.0066590137,0.0022289697,0.0022746269],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004969657,0.0008902014,0.06812987,0.0018855468,0.0005312965,0.0019308027,0.0016899403,0.08317793,0.051700894,0.09214378,0.05216327,0.6407868],"study_design_scores_gemma":[0.00021108087,0.0007331085,0.0075770146,0.00021781455,0.00034323096,0.0023271414,0.001355358,0.7167558,0.121830225,0.11506658,0.033374507,0.00020811698],"about_ca_topic_score_codex":0.0020051694,"about_ca_topic_score_gemma":0.0017972003,"teacher_disagreement_score":0.007772272,"about_ca_system_score_codex":0.0010476022,"about_ca_system_score_gemma":0.0017200452,"threshold_uncertainty_score":0.026000798},"labels":[],"label_agreement":null},{"id":"W2048913517","doi":"10.1016/j.comgeo.2009.01.001","title":"Point-set embeddings of trees with given partial drawings","year":2009,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Set (abstract data type); Point (geometry); Mathematics; Combinatorics; Computer science; Geometry; Programming language","score_opus":0.01201913034766168,"score_gpt":0.25304297422726724,"score_spread":0.24102384387960557,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2048913517","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14442721,0.00029328436,0.83744675,0.00023043765,0.00008624083,0.00013729127,0.00097385794,0.0009282388,0.015476702],"genre_scores_gemma":[0.5016366,0.0006685777,0.4826136,0.00006115163,0.000050038278,0.00019789665,0.0024122337,0.00074674835,0.011613078],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99928635,0.000122144,0.00005218445,0.0001326784,0.00033333214,0.00007331614],"domain_scores_gemma":[0.9984218,0.0006715995,0.00014672613,0.00037390678,0.0002572338,0.00012877345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042535228,0.0007466919,0.0008653414,0.0013674372,0.00052001566,0.0023769452,0.0016203645,0.0011893043,0.0075266967],"category_scores_gemma":[0.0047348836,0.0008637202,0.000808387,0.0016725536,0.00084824965,0.002981991,0.002341763,0.0019070457,0.0016939653],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033942828,0.00016697806,0.0018964199,0.00049688667,0.00006002526,0.0005640043,0.0012596122,0.1806724,0.013107373,0.5888612,0.009144419,0.2034311],"study_design_scores_gemma":[0.000051081246,0.000119385324,0.00076675386,0.0001168178,0.000046620447,0.00058593013,0.00052681204,0.48356232,0.0090360325,0.4845528,0.020593539,0.000041862735],"about_ca_topic_score_codex":0.0007198245,"about_ca_topic_score_gemma":0.0012919878,"teacher_disagreement_score":0.0075266967,"about_ca_system_score_codex":0.0007204287,"about_ca_system_score_gemma":0.00031425396,"threshold_uncertainty_score":0.025179327},"labels":[],"label_agreement":null},{"id":"W2049284557","doi":"10.1016/s0925-7721(01)00069-4","title":"On embedding an outer-planar graph in a point set","year":2002,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":108,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Combinatorics; Embedding; Mathematics; Time complexity; Planar graph; Disjoint sets; Vertex (graph theory); Line segment; Regular polygon; General position; Graph; Discrete mathematics; Algorithm; Computer science; Geometry","score_opus":0.0317632476759565,"score_gpt":0.27932713611558885,"score_spread":0.24756388843963234,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2049284557","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03931862,0.00021112636,0.95141983,0.00039824483,0.00009634989,0.00007663258,0.00017323838,0.00035838704,0.007947642],"genre_scores_gemma":[0.3019404,0.001426982,0.67348653,0.0003035964,0.00013507476,0.00017588898,0.001287468,0.0008150417,0.020429004],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99958104,0.00011778143,0.000020004241,0.000093838906,0.00014385703,0.00004351065],"domain_scores_gemma":[0.9986607,0.00068031164,0.000109800705,0.00030221773,0.00017513269,0.00007187842],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054611586,0.0013741873,0.00096973486,0.0014061715,0.00082076545,0.0012935657,0.0015377179,0.0014072325,0.005501724],"category_scores_gemma":[0.004742305,0.0007210311,0.0006492538,0.0018200558,0.0019308516,0.00457029,0.004559307,0.0019040104,0.0011360386],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027453018,0.000110603636,0.0011284703,0.00037628986,0.000040675845,0.00022898524,0.0008885062,0.27719325,0.011808363,0.47567323,0.009095644,0.22318132],"study_design_scores_gemma":[0.000026073529,0.00010450918,0.00040259978,0.00006980533,0.000032957578,0.00014678598,0.0003104028,0.5290332,0.004283497,0.45328498,0.012275806,0.000029539966],"about_ca_topic_score_codex":0.0024226937,"about_ca_topic_score_gemma":0.0031483532,"teacher_disagreement_score":0.005501724,"about_ca_system_score_codex":0.0005546792,"about_ca_system_score_gemma":0.00028219973,"threshold_uncertainty_score":0.01840508},"labels":[],"label_agreement":null},{"id":"W2049364904","doi":"10.1016/s0925-7721(01)00044-x","title":"Packing two disks in a polygon","year":2002,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Polygon (computer graphics); Computer science; Combinatorics; Mathematics; Computer network","score_opus":0.028570814928890326,"score_gpt":0.26355514852086215,"score_spread":0.23498433359197182,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2049364904","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2936568,0.0006958255,0.6629476,0.0008485185,0.0005505048,0.00030694573,0.00052544614,0.0011810053,0.03928731],"genre_scores_gemma":[0.6802107,0.0005309915,0.30398077,0.000106352665,0.000084210384,0.00016591238,0.000723176,0.00028367757,0.013914188],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994134,0.000092083246,0.0000508149,0.00012931801,0.00018750796,0.00012689421],"domain_scores_gemma":[0.9993106,0.00025537566,0.000071913404,0.00023850439,0.000050335726,0.000073128824],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025312716,0.00070637866,0.0014014302,0.0008946783,0.0011117042,0.0017955464,0.001401282,0.0017518955,0.009696774],"category_scores_gemma":[0.0020845057,0.0008486074,0.00065841747,0.0022581867,0.00086878485,0.002057355,0.003502989,0.000994883,0.0020786251],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0027360308,0.0006666837,0.0035213106,0.0009935284,0.00017314755,0.006410744,0.0013677761,0.41981554,0.0549642,0.15226279,0.016245991,0.34084228],"study_design_scores_gemma":[0.0003317627,0.00060730457,0.0010403007,0.00010465963,0.000080097445,0.0015862751,0.0008792233,0.8012497,0.031396423,0.12383735,0.038827125,0.00005979658],"about_ca_topic_score_codex":0.0007034484,"about_ca_topic_score_gemma":0.00048605408,"teacher_disagreement_score":0.009696774,"about_ca_system_score_codex":0.00035734178,"about_ca_system_score_gemma":0.00036133075,"threshold_uncertainty_score":0.032438993},"labels":[],"label_agreement":null},{"id":"W2049799129","doi":"10.1016/j.comgeo.2007.11.002","title":"On the degree of standard geometric predicates for line transversals in 3D","year":2008,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Transversal (combinatorics); Line (geometry); Point (geometry); Degree (music); Computer science; Line segment; Algorithm; Mathematics; Geometry; Artificial intelligence; Mathematical analysis","score_opus":0.06713992550154395,"score_gpt":0.27276929928670535,"score_spread":0.20562937378516138,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2049799129","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38247162,0.00088510715,0.58217645,0.0024095573,0.0002933295,0.00018599429,0.0015746059,0.0014371339,0.028566113],"genre_scores_gemma":[0.9392098,0.00058210286,0.052695833,0.0004070961,0.00024384417,0.00010273897,0.0010715345,0.00044900863,0.0052381014],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99446976,0.00089650904,0.0005134353,0.0012364058,0.0018028645,0.0010809571],"domain_scores_gemma":[0.9773103,0.013015085,0.0019769005,0.0036360926,0.0022977304,0.0017639571],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042457823,0.0010323024,0.0016941443,0.0035117604,0.0024300548,0.0069725593,0.0030126614,0.001890439,0.0072547337],"category_scores_gemma":[0.020845212,0.0012780476,0.0017812406,0.0034701796,0.0065215104,0.021440882,0.0074181203,0.0050438824,0.001001304],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00064689235,0.00013836919,0.005775269,0.00023256495,0.00004324483,0.00012586337,0.0012726755,0.02269879,0.0033209415,0.9230044,0.0035603705,0.03918069],"study_design_scores_gemma":[0.000070354865,0.00015699872,0.0015195078,0.000083365805,0.0000713292,0.00020389992,0.0006525762,0.061079595,0.004583436,0.9238137,0.0077050123,0.000060260172],"about_ca_topic_score_codex":0.0025188087,"about_ca_topic_score_gemma":0.0031113708,"teacher_disagreement_score":0.0072547337,"about_ca_system_score_codex":0.0022537047,"about_ca_system_score_gemma":0.001477146,"threshold_uncertainty_score":0.024269462},"labels":[],"label_agreement":null},{"id":"W2050004894","doi":"10.1016/s0925-7721(00)00009-2","title":"Planar segment visibility graphs","year":2000,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"","keywords":"Combinatorics; Visibility graph; Planar graph; Line segment; Mathematics; Visibility; Disjoint sets; Discrete mathematics; Computer science; Graph; Regular polygon; Geometry; Physics; Optics","score_opus":0.012774974049465955,"score_gpt":0.24702420002455105,"score_spread":0.2342492259750851,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2050004894","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.086764656,0.0003874123,0.85174817,0.00065378664,0.00008644559,0.00018414257,0.0014618438,0.0018534538,0.056860153],"genre_scores_gemma":[0.6762447,0.0010529258,0.27357027,0.00027194966,0.00011334658,0.0001673024,0.0056728823,0.0009899222,0.041916724],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99961543,0.00004589063,0.000014189219,0.00013230252,0.00012807068,0.000064084306],"domain_scores_gemma":[0.9990693,0.00023884326,0.00012158037,0.0003004615,0.00015841637,0.000111499925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018803071,0.0006186347,0.0006554405,0.00106071,0.00079797034,0.0016261139,0.0011641302,0.0009741093,0.017239084],"category_scores_gemma":[0.0018036161,0.0006376356,0.0005788104,0.0015119236,0.00091008417,0.0028500601,0.0020234913,0.0017858241,0.002480347],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046678667,0.00019955073,0.0017373492,0.00030446955,0.000071954615,0.00046967802,0.00048943935,0.06937627,0.031425707,0.5923553,0.023707267,0.2793963],"study_design_scores_gemma":[0.00009225992,0.00016872585,0.0023484866,0.00007339682,0.000079788064,0.00061369076,0.00035766442,0.24453148,0.02613979,0.6525218,0.0730312,0.00004179836],"about_ca_topic_score_codex":0.0018352048,"about_ca_topic_score_gemma":0.0021437267,"teacher_disagreement_score":0.017239084,"about_ca_system_score_codex":0.0005684954,"about_ca_system_score_gemma":0.00062438904,"threshold_uncertainty_score":0.057670534},"labels":[],"label_agreement":null},{"id":"W2053814689","doi":"10.1016/s0925-7721(01)00036-0","title":"Polygons cuttable by a circular saw","year":2001,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Circular saw; Polygon (computer graphics); Regular polygon; Mathematics; Geometry; Rest (music); Projection (relational algebra); Combinatorics; Computer science; Algorithm; Physics; Acoustics; Telecommunications","score_opus":0.011290610468569318,"score_gpt":0.2387709060715044,"score_spread":0.22748029560293506,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2053814689","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2517566,0.00018856276,0.70174164,0.00020124519,0.00021019172,0.0001412565,0.00035086242,0.0008728098,0.044536885],"genre_scores_gemma":[0.6977044,0.0002808358,0.28429905,0.00006249714,0.000047126847,0.00009467977,0.00057769904,0.00030074912,0.01663295],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99969995,0.000032252654,0.000016936929,0.000075329925,0.000112741945,0.00006289353],"domain_scores_gemma":[0.99953353,0.0001936735,0.00004424671,0.00013291943,0.000042165062,0.000053534288],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020918963,0.00045695034,0.00068868056,0.00062847306,0.0007331134,0.0011904355,0.0008341852,0.0008171051,0.008020442],"category_scores_gemma":[0.00086595217,0.0006753712,0.00072518026,0.00071844633,0.00092025445,0.0008872612,0.0017807209,0.0008648711,0.001102877],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020944856,0.00027429376,0.0024524655,0.0004439793,0.00012253935,0.003790501,0.00095975475,0.29848045,0.17006409,0.29220694,0.008589693,0.22052076],"study_design_scores_gemma":[0.00025654997,0.0006287367,0.0016400098,0.000083588224,0.00008211012,0.0014304331,0.0006009838,0.77620304,0.05706353,0.12677523,0.035165302,0.000070352435],"about_ca_topic_score_codex":0.0009253417,"about_ca_topic_score_gemma":0.0008841753,"teacher_disagreement_score":0.008020442,"about_ca_system_score_codex":0.00034510676,"about_ca_system_score_gemma":0.00038901228,"threshold_uncertainty_score":0.02683103},"labels":[],"label_agreement":null},{"id":"W2054389590","doi":"10.1016/j.comgeo.2006.12.002","title":"An optimal randomized algorithm for d-variate zonoid depth","year":2007,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Advanced Statistical Methods and Models","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Random variate; Algorithm; Multivariate statistics; Computation; Mathematics; Randomized algorithm; Lift (data mining); Computer science; Statistics; Random variable; Data mining","score_opus":0.07423469883466306,"score_gpt":0.43871450110572796,"score_spread":0.3644798022710649,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2054389590","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010330078,0.00028901486,0.9852519,0.0003703213,0.00009980222,0.00013631074,0.00024694597,0.0017895175,0.0014860231],"genre_scores_gemma":[0.09975893,0.00017512449,0.8960537,0.00023923765,0.00011169617,0.00034664533,0.00047068507,0.00038317632,0.0024608409],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99808,0.00055611297,0.00012593805,0.00047549338,0.0004979406,0.00026459893],"domain_scores_gemma":[0.9957208,0.0024792233,0.0002644837,0.00068603235,0.00048300505,0.00036657474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002309974,0.0013844906,0.0025423937,0.002200605,0.0013229834,0.0022877795,0.0042232294,0.0027003593,0.013398345],"category_scores_gemma":[0.012223967,0.0012851445,0.0016639846,0.0019871509,0.0019345602,0.004381151,0.0063368645,0.0031247993,0.0021918933],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013286249,0.00030593056,0.0020566767,0.00042352703,0.00017847902,0.0000897235,0.00029074406,0.3054302,0.008453759,0.15158463,0.018474434,0.5113833],"study_design_scores_gemma":[0.00023360098,0.00010355112,0.00024783076,0.00002744792,0.000029488518,0.00005980273,0.000044737066,0.92400736,0.001992421,0.070510685,0.0027096188,0.00003343846],"about_ca_topic_score_codex":0.007977489,"about_ca_topic_score_gemma":0.010893369,"teacher_disagreement_score":0.013398345,"about_ca_system_score_codex":0.0030031134,"about_ca_system_score_gemma":0.0047572018,"threshold_uncertainty_score":0.044821918},"labels":[],"label_agreement":null},{"id":"W2054701324","doi":"10.1016/j.comgeo.2008.12.004","title":"Editorial CCCG 2006","year":2008,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Diverse Scientific and Economic Studies","field":"Economics, Econometrics and Finance","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science","score_opus":0.0349643125316501,"score_gpt":0.20588758683607455,"score_spread":0.17092327430442444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2054701324","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009609888,0.0047726347,0.00031153142,0.050036013,0.93002087,0.00006060828,0.00032738617,0.00018403438,0.014190769],"genre_scores_gemma":[0.0016377373,0.0041039307,0.00041068692,0.026298204,0.84349066,0.00010384257,0.00037011396,0.00015440215,0.123430476],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9982515,0.0002576655,0.00015383854,0.00030796812,0.0008513668,0.00017762384],"domain_scores_gemma":[0.98985785,0.002470883,0.0006367609,0.00065874786,0.004451901,0.0019237989],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002922249,0.0019989735,0.0023587786,0.0039680516,0.002247149,0.006406485,0.0020857777,0.008140283,0.07633291],"category_scores_gemma":[0.014247056,0.0008123825,0.0016911486,0.0017389512,0.0017177034,0.0023399899,0.001861986,0.008311348,0.037067715],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021280828,0.0000032763685,0.000010420781,0.000055687244,0.0000036760448,0.000022294416,0.0000027316275,0.00001735397,0.000023372215,0.0002947696,0.9949809,0.0045643267],"study_design_scores_gemma":[0.000033238524,0.000008399808,0.0001492588,0.000085879605,0.00000994709,0.00003876479,0.000006520382,0.00008126452,0.000051303166,0.0008146636,0.9987143,0.0000063218326],"about_ca_topic_score_codex":0.00206867,"about_ca_topic_score_gemma":0.0065081497,"teacher_disagreement_score":0.07633291,"about_ca_system_score_codex":0.0025657353,"about_ca_system_score_gemma":0.0021841999,"threshold_uncertainty_score":0.25535905},"labels":[],"label_agreement":null},{"id":"W2054932997","doi":"10.1016/j.comgeo.2004.11.003","title":"Computing straight-line 3D grid drawings of graphs in linear volume","year":2005,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Grid; Volume (thermodynamics); Computer science; Constant (computer programming); Line (geometry); Queue; Focus (optics); Relevance (law); Graph drawing; Line segment; Mathematics; Theoretical computer science; Geometry; Graph; Artificial intelligence","score_opus":0.014323910653175915,"score_gpt":0.2790448373949305,"score_spread":0.2647209267417546,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2054932997","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17591573,0.00038864504,0.8033105,0.0004546521,0.000083495695,0.0002229246,0.0025762464,0.0077996035,0.009248062],"genre_scores_gemma":[0.44914392,0.00041834405,0.5403194,0.00011667857,0.00003173176,0.00015338075,0.004319406,0.0010909457,0.004406256],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999419,0.0001246938,0.00003730006,0.00013654443,0.00019312183,0.00008944492],"domain_scores_gemma":[0.99818474,0.001000313,0.00014643636,0.00028001532,0.00026934332,0.000119037155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003713973,0.0013480661,0.0014086061,0.0016059146,0.00062097394,0.0023297453,0.001824288,0.0012239476,0.014411633],"category_scores_gemma":[0.0046700872,0.0010241688,0.0010355563,0.0024730125,0.000660388,0.0023782505,0.0015908297,0.0012643671,0.0033582076],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00068674434,0.00022458877,0.0046376847,0.0006492163,0.00014789247,0.00050584576,0.0005497068,0.61379147,0.01032483,0.030453298,0.020671733,0.31735706],"study_design_scores_gemma":[0.00007277176,0.000073380725,0.0005082379,0.000023374103,0.000019648123,0.000086655135,0.00019836049,0.95863366,0.0034506675,0.033929262,0.0029870288,0.000016960952],"about_ca_topic_score_codex":0.007641212,"about_ca_topic_score_gemma":0.018141136,"teacher_disagreement_score":0.014411633,"about_ca_system_score_codex":0.0008662546,"about_ca_system_score_gemma":0.00082163245,"threshold_uncertainty_score":0.048211694},"labels":[],"label_agreement":null},{"id":"W2055614976","doi":"10.1016/j.comgeo.2013.11.001","title":"Reprint of: Refold rigidity of convex polyhedra","year":2013,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Advanced Materials and Mechanics","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Polyhedron; Dodecahedron; Tetrahedron; Regular polygon; Convex polytope; Combinatorics; Enhanced Data Rates for GSM Evolution; Rigidity (electromagnetism); Mathematics; Geometry; Computer science; Materials science; Convex set; Artificial intelligence; Convex optimization","score_opus":0.006906742510965632,"score_gpt":0.19990528573536054,"score_spread":0.19299854322439491,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2055614976","genre_codex":"editorial","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008006505,0.016535038,0.0711515,0.03191429,0.47733837,0.00015272218,0.02016851,0.0031298564,0.37160313],"genre_scores_gemma":[0.09433278,0.011117499,0.03836205,0.007911287,0.0517208,0.00017827151,0.015268955,0.0034672844,0.77764106],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994734,0.000076286204,0.00005243379,0.00009075329,0.0002558322,0.000051388008],"domain_scores_gemma":[0.99858165,0.0005555887,0.00006377867,0.00027407552,0.00043327306,0.000091529655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004371579,0.0010839021,0.0007604546,0.0017026074,0.0008658704,0.0011685509,0.0013903612,0.0009251447,0.16079065],"category_scores_gemma":[0.0045062983,0.0003592188,0.0007415338,0.0020842806,0.0011521956,0.0015555301,0.00083442894,0.002161538,0.03326908],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010409111,0.00002297766,0.00008994213,0.00040255117,0.000019812325,0.00020090393,0.000052747782,0.0013637776,0.0011890735,0.043612216,0.90921247,0.04372938],"study_design_scores_gemma":[0.00002410848,0.000044088603,0.00073678186,0.00013879706,0.000013126805,0.0005285451,0.000048969003,0.0029186318,0.00378932,0.037117552,0.95460546,0.000034674686],"about_ca_topic_score_codex":0.0016523487,"about_ca_topic_score_gemma":0.0049015456,"teacher_disagreement_score":0.16079065,"about_ca_system_score_codex":0.0007506186,"about_ca_system_score_gemma":0.0005587552,"threshold_uncertainty_score":0.5378983},"labels":[],"label_agreement":null},{"id":"W2055900608","doi":"10.1016/j.comgeo.2013.05.007","title":"Streaming and dynamic algorithms for minimum enclosing balls in high dimensions","year":2013,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Ball (mathematics); Combinatorics; Mathematics; Euclidean space; Upper and lower bounds; Amortized analysis; Space (punctuation); Algorithm; Computer science; Discrete mathematics; Data structure; Geometry; Mathematical analysis","score_opus":0.01305817402274844,"score_gpt":0.26005150553927714,"score_spread":0.2469933315165287,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2055900608","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0140523305,0.0005143195,0.9819549,0.00033485005,0.00009841879,0.000055338925,0.00012668414,0.00061024184,0.0022529585],"genre_scores_gemma":[0.28505898,0.0007269566,0.70600545,0.00017976318,0.00025738718,0.00035972052,0.00083469704,0.0005838537,0.0059931013],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99913424,0.0001990152,0.000053934873,0.00017119866,0.0003418947,0.000099643534],"domain_scores_gemma":[0.99569327,0.0027229215,0.0002221663,0.00060447876,0.0005002996,0.0002568829],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017494373,0.0012343763,0.0017479056,0.0014185571,0.0011101125,0.0013211947,0.0039501446,0.0016633937,0.008205175],"category_scores_gemma":[0.01020758,0.0010306721,0.0009214757,0.0021176906,0.0015747539,0.003722345,0.00392078,0.0024585824,0.0009809415],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00065310905,0.00018989689,0.00092956,0.00033210198,0.000054919066,0.000090628826,0.00030020787,0.6781006,0.0039070956,0.1309403,0.011122114,0.1733795],"study_design_scores_gemma":[0.00003935705,0.000021159958,0.00006752048,0.000008751931,0.0000049467185,0.000019558047,0.000019421064,0.9591885,0.00053204276,0.038871627,0.0012213025,0.0000057943075],"about_ca_topic_score_codex":0.0048869774,"about_ca_topic_score_gemma":0.005045378,"teacher_disagreement_score":0.008205175,"about_ca_system_score_codex":0.0013499414,"about_ca_system_score_gemma":0.0010495491,"threshold_uncertainty_score":0.027449071},"labels":[],"label_agreement":null},{"id":"W2056371677","doi":"10.1016/j.comgeo.2012.04.004","title":"Oja centers and centers of gravity","year":2012,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Advanced Statistical Methods and Models","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Center of gravity; Geodesy; Geology; Economics; Management","score_opus":0.09178950654666629,"score_gpt":0.40664649508715517,"score_spread":0.3148569885404889,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2056371677","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09759995,0.0063557522,0.74952376,0.0060866904,0.0015291944,0.00015670742,0.0012420346,0.0008394114,0.13666645],"genre_scores_gemma":[0.81429946,0.0044032927,0.14136536,0.0011893528,0.0024001186,0.00036877795,0.0009730884,0.0008366801,0.03416381],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984713,0.000534913,0.00006188236,0.00031914588,0.0003992944,0.00021332063],"domain_scores_gemma":[0.99314874,0.0027899733,0.0009284469,0.0008675818,0.0014822799,0.000782985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002018089,0.00089403964,0.0015661243,0.004641965,0.0021893273,0.0043366007,0.0023110393,0.002277141,0.010172572],"category_scores_gemma":[0.01653379,0.00061932375,0.0010489144,0.0024662192,0.0049514147,0.0051982524,0.0034917486,0.0033834472,0.0015743185],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000070423052,0.000003674241,0.00007358785,0.000013699234,0.0000033646738,0.000004921585,0.000041747746,0.0007423446,0.00005460861,0.9949214,0.0013374079,0.0027962618],"study_design_scores_gemma":[0.000005729389,0.0000040865575,0.00019287708,0.000010860718,0.0000055269093,0.000031339347,0.000040803254,0.0067848368,0.000090088375,0.9879773,0.0048449016,0.000011621498],"about_ca_topic_score_codex":0.0026437163,"about_ca_topic_score_gemma":0.0016595814,"teacher_disagreement_score":0.010172572,"about_ca_system_score_codex":0.0015354465,"about_ca_system_score_gemma":0.0015747517,"threshold_uncertainty_score":0.034030676},"labels":[],"label_agreement":null},{"id":"W2058031318","doi":"10.1016/j.comgeo.2015.01.004","title":"Reprint of: Weighted straight skeletons in the plane","year":2015,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Skeleton (computer programming); Polygon (computer graphics); Regular polygon; Combinatorics; Mathematics; Convex polygon; Point (geometry); Ambiguity; Computer science; Geometry","score_opus":0.03373641393220492,"score_gpt":0.27276727658897404,"score_spread":0.23903086265676912,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2058031318","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012958098,0.011957333,0.17572677,0.02073045,0.09709767,0.00022377876,0.0076344837,0.0031175113,0.67055386],"genre_scores_gemma":[0.16405691,0.013880274,0.08790831,0.0068600113,0.030429568,0.00031232584,0.0078118327,0.0026936485,0.6860471],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99963725,0.00007151909,0.000043793025,0.00007409123,0.00014783557,0.00002555426],"domain_scores_gemma":[0.9987281,0.00050442247,0.00011180337,0.00030197622,0.00027032444,0.00008335196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037231794,0.0006624549,0.00037666247,0.0017379423,0.00091302895,0.0017955106,0.000817602,0.0009400169,0.107484125],"category_scores_gemma":[0.0033485165,0.00029139727,0.00041372233,0.002575439,0.0017212091,0.002090563,0.0008353326,0.0016505271,0.026325343],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012559716,0.000021372673,0.00033482004,0.00043490305,0.000018499786,0.00048783628,0.00023731883,0.002353371,0.00221752,0.29811537,0.60263395,0.09301953],"study_design_scores_gemma":[0.00001442469,0.0000279636,0.00060857175,0.00010748719,0.0000059856648,0.00072884414,0.00011284937,0.002679034,0.0012527457,0.06030983,0.93413585,0.000016486083],"about_ca_topic_score_codex":0.001475249,"about_ca_topic_score_gemma":0.0022128662,"teacher_disagreement_score":0.107484125,"about_ca_system_score_codex":0.00072814967,"about_ca_system_score_gemma":0.00040743363,"threshold_uncertainty_score":0.35957026},"labels":[],"label_agreement":null},{"id":"W2059932006","doi":"10.1016/j.comgeo.2009.03.004","title":"On the dilation spectrum of paths, cycles, and trees","year":2009,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; Deutsche Forschungsgemeinschaft","keywords":"Combinatorics; Dilation (metric space); Mathematics; Vertex (graph theory); Euclidean space; Shortest path problem; Distance; Graph; Discrete mathematics","score_opus":0.013089864428806676,"score_gpt":0.2360567726727568,"score_spread":0.22296690824395013,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2059932006","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45996746,0.0061465558,0.41707885,0.00351129,0.0004648156,0.000058936403,0.00026998357,0.00031044125,0.11219174],"genre_scores_gemma":[0.9421191,0.0027979612,0.041810323,0.0003591184,0.00050573266,0.000054834472,0.00017668236,0.00022678156,0.0119495345],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995745,0.0001306886,0.000018104309,0.00007743155,0.0001299096,0.00006935797],"domain_scores_gemma":[0.99766904,0.0014860439,0.00019242056,0.00018053323,0.00020004716,0.00027194506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085908227,0.000519592,0.000883835,0.0021577629,0.0011817265,0.0017412764,0.0007177719,0.0010620422,0.0069332686],"category_scores_gemma":[0.0060112746,0.00042351274,0.00041408394,0.0012739131,0.0024468445,0.0036056,0.0020482186,0.0014931771,0.0004360215],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031194304,0.000013261157,0.0002753204,0.000021622916,0.0000038206194,0.000048139034,0.0001481875,0.0046922434,0.0008455028,0.9807552,0.0015470418,0.011618531],"study_design_scores_gemma":[0.000011064465,0.000016607339,0.00031594414,0.000019744586,0.0000049717783,0.0000788759,0.00008997857,0.042540014,0.00028330178,0.95383906,0.002792865,0.000007531169],"about_ca_topic_score_codex":0.0010292389,"about_ca_topic_score_gemma":0.0007531597,"teacher_disagreement_score":0.0069332686,"about_ca_system_score_codex":0.00092754577,"about_ca_system_score_gemma":0.0003451359,"threshold_uncertainty_score":0.023194134},"labels":[],"label_agreement":null},{"id":"W2061541114","doi":"10.1016/s0925-7721(03)00027-0","title":"Worst-case-optimal algorithms for guarding planar graphs and polyhedral surfaces","year":2003,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":36,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; Carleton University","funders":"","keywords":"Combinatorics; Quadrilateral; Planar graph; Vertex (graph theory); Mathematics; Diagonal; Monochromatic color; Graph; Vertex cover; Plane (geometry); Time complexity; Algorithm; Geometry; Physics","score_opus":0.02691526093557751,"score_gpt":0.27247619229613457,"score_spread":0.24556093136055707,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2061541114","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040349334,0.00060116226,0.9474444,0.00058673986,0.000131546,0.0001504661,0.00028070292,0.0033677462,0.007087947],"genre_scores_gemma":[0.25211972,0.00036249738,0.74002,0.0001873789,0.00008625658,0.0001815574,0.0011646494,0.0010153875,0.0048626014],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99813014,0.00037557114,0.00011854533,0.0004288075,0.0004884353,0.00045854508],"domain_scores_gemma":[0.99470997,0.003114584,0.00032300784,0.0012361519,0.00039490804,0.00022138773],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018764257,0.0021913627,0.0018241405,0.0016663572,0.0016649836,0.0025239824,0.0038949116,0.002212022,0.012011005],"category_scores_gemma":[0.00880221,0.0014605812,0.001956813,0.002261864,0.0022829499,0.0060256035,0.004030083,0.0028425462,0.0019106824],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008309725,0.00032142684,0.0011715384,0.0004256734,0.00008525159,0.00012624626,0.00030410974,0.6563628,0.004817795,0.060207423,0.015166791,0.26017997],"study_design_scores_gemma":[0.00007572306,0.000054644202,0.000113348375,0.00002030564,0.000030670693,0.000052725212,0.00012431503,0.8959647,0.002814214,0.09885154,0.0018839462,0.000013919455],"about_ca_topic_score_codex":0.0056895744,"about_ca_topic_score_gemma":0.01167654,"teacher_disagreement_score":0.012011005,"about_ca_system_score_codex":0.00232126,"about_ca_system_score_gemma":0.0026700993,"threshold_uncertainty_score":0.040180743},"labels":[],"label_agreement":null},{"id":"W2063175732","doi":"10.1016/j.comgeo.2007.02.004","title":"Rotationally monotone polygons","year":2007,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Monotone polygon; Polygon (computer graphics); Combinatorics; Regular polygon; Mathematics; Rotation (mathematics); Monotonic function; Polygon covering; Vertex (graph theory); Boundary (topology); Simple polygon; Plane (geometry); Geometry; Point (geometry); Rectilinear polygon; Mathematical analysis; Computer science","score_opus":0.011147498080292442,"score_gpt":0.2599381773873148,"score_spread":0.24879067930702234,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2063175732","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17626746,0.0006641466,0.57062,0.00097641576,0.0004619904,0.00020755672,0.0009209435,0.00096698455,0.24891448],"genre_scores_gemma":[0.6899117,0.00078175555,0.23526591,0.00033100156,0.00018299092,0.0001590538,0.001452037,0.0008159767,0.07109956],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99947137,0.00008745813,0.000024825194,0.000110922425,0.00021857892,0.000086833905],"domain_scores_gemma":[0.9992999,0.00018311893,0.00008925517,0.00017571084,0.00017415053,0.00007793338],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029794595,0.0006226609,0.00054577243,0.0007624483,0.0007426858,0.0015018007,0.0008616766,0.0005605561,0.017041856],"category_scores_gemma":[0.0021949552,0.00047376964,0.0005028136,0.0005384204,0.0010115544,0.0017050747,0.0017053247,0.0018563891,0.002840325],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024856738,0.000069100744,0.00045660193,0.0001360885,0.000009931654,0.000287347,0.00019915795,0.009794067,0.02312873,0.86320525,0.00855794,0.09390719],"study_design_scores_gemma":[0.0001024204,0.0003543143,0.0013323908,0.000074639094,0.000033074306,0.0023324308,0.0004228542,0.09871303,0.030041464,0.7446861,0.12186154,0.000045744033],"about_ca_topic_score_codex":0.00045648406,"about_ca_topic_score_gemma":0.0005539287,"teacher_disagreement_score":0.017041856,"about_ca_system_score_codex":0.00043985216,"about_ca_system_score_gemma":0.00032557826,"threshold_uncertainty_score":0.05701071},"labels":[],"label_agreement":null},{"id":"W2064761790","doi":"10.1016/j.comgeo.2013.03.004","title":"Efficient reconfiguration of lattice-based modular robots","year":2013,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Modular Robots and Swarm Intelligence","field":"Engineering","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Control reconfiguration; Self-reconfiguring modular robot; Modular design; Robot; Lattice (music); Computer science; Class (philosophy); Topology (electrical circuits); Algorithm; Mathematics; Mobile robot; Combinatorics; Embedded system; Artificial intelligence; Robot control; Programming language; Physics","score_opus":0.012773948867572308,"score_gpt":0.212029483056795,"score_spread":0.1992555341892227,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2064761790","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3404473,0.00026986073,0.64145255,0.00028930744,0.00011304888,0.00005325973,0.00011336758,0.0012454907,0.016015751],"genre_scores_gemma":[0.9093542,0.00008835483,0.08797194,0.000031140327,0.000016940037,0.000045947647,0.00010522467,0.00006708469,0.002319219],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998129,0.00005256868,0.000009478335,0.0000325404,0.000060896236,0.00003161166],"domain_scores_gemma":[0.9996244,0.00011955791,0.000060463106,0.000093153,0.000047945025,0.0000545909],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002226249,0.00033635247,0.0004735308,0.0004247684,0.00034170737,0.0005243956,0.0006552359,0.00032568412,0.0020819036],"category_scores_gemma":[0.00090313435,0.00024268917,0.00030117115,0.0003768735,0.00049509096,0.0006708455,0.0009087754,0.0003992968,0.0004932713],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027290103,0.00010982291,0.0009220532,0.00010054406,0.00003653894,0.00022841892,0.00011352732,0.7810639,0.06445397,0.037751414,0.002577508,0.11236938],"study_design_scores_gemma":[0.00003202126,0.000087105174,0.00025231676,0.000004517692,0.000006141091,0.000071438364,0.000027171687,0.9759758,0.0060300217,0.016003398,0.0015012167,0.0000088631805],"about_ca_topic_score_codex":0.00057012355,"about_ca_topic_score_gemma":0.0010553383,"teacher_disagreement_score":0.0020819036,"about_ca_system_score_codex":0.00033470878,"about_ca_system_score_gemma":0.0002872112,"threshold_uncertainty_score":0.006964624},"labels":[],"label_agreement":null},{"id":"W2065425028","doi":"10.1016/j.comgeo.2008.11.002","title":"Guarding curvilinear art galleries with vertex or point guards","year":2008,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Polygon (computer graphics); Regular polygon; Vertex (graph theory); Curvilinear coordinates; Point in polygon; Piecewise; Mathematics; Combinatorics; Rectilinear polygon; Convex polygon; Upper and lower bounds; Point (geometry); Piecewise linear function; Simple polygon; Geometry; Computer science; Graph; Mathematical analysis","score_opus":0.024139722392521393,"score_gpt":0.24335944716401192,"score_spread":0.21921972477149054,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2065425028","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07389891,0.00012632435,0.9068474,0.0000909769,0.00013184763,0.00017305081,0.00038481693,0.0027166347,0.015629962],"genre_scores_gemma":[0.55959606,0.0001888821,0.41942775,0.00006612512,0.000026066971,0.000096758136,0.00079210114,0.0008331736,0.018973034],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996427,0.00002940881,0.000020276882,0.0001071644,0.00013719796,0.00006322355],"domain_scores_gemma":[0.99951506,0.00009199185,0.000037304468,0.00024304906,0.00006316198,0.00004945174],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030598423,0.0008533148,0.000916529,0.00083424844,0.00062949845,0.0011971821,0.0012428819,0.0009287069,0.011809342],"category_scores_gemma":[0.0013870047,0.0005633563,0.0011263598,0.00068882597,0.0011459554,0.0012388397,0.0035083832,0.001077167,0.0022424455],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00067655207,0.00016387964,0.002711922,0.00035517913,0.00007755343,0.00084466324,0.0006104531,0.37175786,0.059391115,0.089478016,0.011918139,0.46201468],"study_design_scores_gemma":[0.000032266198,0.00015053416,0.0008199474,0.000056666002,0.000031874297,0.0003802343,0.00021044882,0.91962415,0.02487348,0.03561688,0.018164588,0.00003891401],"about_ca_topic_score_codex":0.0025194508,"about_ca_topic_score_gemma":0.003874213,"teacher_disagreement_score":0.011809342,"about_ca_system_score_codex":0.00026572793,"about_ca_system_score_gemma":0.00044088165,"threshold_uncertainty_score":0.039506197},"labels":[],"label_agreement":null},{"id":"W2065822517","doi":"10.1016/j.comgeo.2005.11.005","title":"Space-efficient algorithms for computing the convex hull of a simple polygonal line in linear time","year":2006,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Partition (number theory); Convex hull; Simple (philosophy); Extreme point; Regular polygon; Combinatorics; SIMPLE algorithm; Mathematics; Algorithm; Line segment; Space (punctuation); Time complexity; Convex combination; Line (geometry); Computer science; Convex optimization; Geometry; Physics","score_opus":0.01676834318866831,"score_gpt":0.2747161326910761,"score_spread":0.25794778950240776,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2065822517","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0115041025,0.00020866639,0.98156273,0.00014715578,0.000043628123,0.00012625926,0.00019151391,0.0024523344,0.0037635053],"genre_scores_gemma":[0.13569352,0.00024921232,0.8578155,0.00007016665,0.00005145245,0.00028139507,0.001159822,0.000547509,0.004131398],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99895096,0.00012321028,0.00006384681,0.00016889228,0.00054591725,0.00014715265],"domain_scores_gemma":[0.9977957,0.0012060438,0.0001576403,0.0003715103,0.00036985832,0.00009937936],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055279606,0.0018918802,0.0014030059,0.0018440043,0.0011178188,0.002408716,0.0021858965,0.0012821608,0.014211379],"category_scores_gemma":[0.0046012113,0.00078794826,0.0012293983,0.0027743832,0.0010608167,0.0029279443,0.0028864737,0.0023224342,0.00400124],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005726293,0.00029428062,0.001420054,0.0004829671,0.00012380752,0.00022231374,0.0004810482,0.25934914,0.014555683,0.05405701,0.019609328,0.6488317],"study_design_scores_gemma":[0.000118451775,0.00007018016,0.00028172391,0.000019299121,0.000026950116,0.00007531896,0.00017039692,0.95039743,0.005695506,0.0386729,0.0044539087,0.000017889002],"about_ca_topic_score_codex":0.007122805,"about_ca_topic_score_gemma":0.0130620105,"teacher_disagreement_score":0.014211379,"about_ca_system_score_codex":0.001342828,"about_ca_system_score_gemma":0.0016056532,"threshold_uncertainty_score":0.047541797},"labels":[],"label_agreement":null},{"id":"W2066852991","doi":"10.1016/s0925-7721(02)00129-3","title":"Optimal and suboptimal robust algorithms for proximity graphs","year":2003,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Algorithm; Computer science","score_opus":0.03161828217742704,"score_gpt":0.263764278235717,"score_spread":0.23214599605828998,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2066852991","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0044120145,0.0002357215,0.99329823,0.00017214549,0.00004527674,0.00003288708,0.000049646835,0.0003660196,0.0013880968],"genre_scores_gemma":[0.16965142,0.00040598967,0.82405394,0.00015509425,0.00011839335,0.00018937509,0.00038105424,0.00046768755,0.0045770663],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968233,0.0009788979,0.00016301606,0.0009008119,0.0008856751,0.00024828714],"domain_scores_gemma":[0.9910353,0.0054614455,0.0006891794,0.0016670874,0.00087553554,0.00027148833],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028668274,0.0015328198,0.0021202343,0.001983822,0.0012403298,0.0024253193,0.0031007256,0.0029645576,0.006926735],"category_scores_gemma":[0.023683693,0.0015242309,0.0014236139,0.0024066314,0.0024873577,0.004439399,0.0044965586,0.0027487813,0.0017047526],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002720962,0.0001008027,0.00036739904,0.00023380425,0.00006556568,0.00007750748,0.00018039392,0.72743815,0.0025510686,0.09290715,0.005949541,0.16985652],"study_design_scores_gemma":[0.000030081934,0.000045653233,0.00008392383,0.000017844284,0.000015889513,0.000048625847,0.000040420568,0.91848963,0.0014017565,0.07801058,0.0018008515,0.00001478948],"about_ca_topic_score_codex":0.003975384,"about_ca_topic_score_gemma":0.0043553584,"teacher_disagreement_score":0.006926735,"about_ca_system_score_codex":0.00164841,"about_ca_system_score_gemma":0.0022108876,"threshold_uncertainty_score":0.02317226},"labels":[],"label_agreement":null},{"id":"W2068598660","doi":"10.1016/j.comgeo.2013.10.001","title":"An optimal algorithm for the Euclidean bottleneck full Steiner tree problem","year":2013,"lang":"en","type":"article","venue":"Computational Geometry","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Steiner tree problem; Combinatorics; k-minimum spanning tree; Mathematics; Disjoint sets; Logarithm; K-ary tree; Gomory–Hu tree; Matching (statistics); Tree (set theory); Discrete mathematics; Euclidean minimum spanning tree; Upper and lower bounds; Spanning tree; Tree structure; Minimum degree spanning tree; Binary tree","score_opus":0.01036784220015194,"score_gpt":0.23104368802641279,"score_spread":0.22067584582626085,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2068598660","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03344138,0.0007103642,0.9457813,0.00051019434,0.00014514838,0.00017489096,0.0003824203,0.0020305505,0.016823728],"genre_scores_gemma":[0.1493171,0.00040061172,0.8431135,0.00015795084,0.000058622954,0.00019428859,0.00093054405,0.00025405074,0.0055733565],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99944705,0.00011055695,0.00003651871,0.00013483304,0.00017028116,0.000100780446],"domain_scores_gemma":[0.9994054,0.00027453218,0.00005191228,0.00011057365,0.00011048058,0.000047100002],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005739404,0.000920496,0.0011819375,0.0012090172,0.0007232739,0.0014098503,0.0020072476,0.0011310158,0.011733803],"category_scores_gemma":[0.0024791122,0.0005945125,0.00064597576,0.0019028292,0.00048423893,0.0027368614,0.0016042121,0.0010904319,0.0018346136],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000570179,0.000347079,0.00065800105,0.00046165654,0.000089849236,0.00015957588,0.000159526,0.27639285,0.009311185,0.053216934,0.024151472,0.63448167],"study_design_scores_gemma":[0.00023152465,0.00017385387,0.0003979513,0.00003764927,0.00004062867,0.00019396207,0.000108922555,0.94257,0.0029476748,0.044278536,0.008994565,0.000024687604],"about_ca_topic_score_codex":0.0031176081,"about_ca_topic_score_gemma":0.0058246437,"teacher_disagreement_score":0.011733803,"about_ca_system_score_codex":0.0012664667,"about_ca_system_score_gemma":0.0021783507,"threshold_uncertainty_score":0.039253473},"labels":[],"label_agreement":null},{"id":"W2075729213","doi":"10.1016/j.comgeo.2015.01.002","title":"Reprint of: Theta-3 is connected","year":2015,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; Ministerio de Economía y Competitividad; Austrian Science Fund","keywords":"Reprint; Graph; Computer science; Combinatorics; Connectivity; Mathematics; Physics","score_opus":0.0636802617194288,"score_gpt":0.3320432321922343,"score_spread":0.2683629704728055,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2075729213","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009532383,0.002065129,0.008848214,0.023568934,0.051986534,0.000039159375,0.0059787505,0.0009921388,0.8969889],"genre_scores_gemma":[0.26009905,0.003688185,0.0064518643,0.0074870205,0.02269215,0.00011272571,0.007924735,0.0022067055,0.68933755],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996542,0.00006255764,0.000024771007,0.00008625383,0.00011485193,0.000057408255],"domain_scores_gemma":[0.9986307,0.0005232195,0.00009938999,0.0002764933,0.00032420893,0.0001460246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023569562,0.0007661453,0.00075105904,0.0016538209,0.0016585294,0.0029663187,0.0008470623,0.001315436,0.2657263],"category_scores_gemma":[0.0032135944,0.00029753946,0.0006165906,0.0032699753,0.0014054284,0.0029250388,0.0010280071,0.0032809991,0.061383095],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018198956,0.000023441655,0.0001502599,0.0002344453,0.000020880441,0.00024067117,0.00021906111,0.0002652532,0.0007221004,0.41227606,0.55199844,0.033667333],"study_design_scores_gemma":[0.000033849155,0.00002340043,0.000672788,0.000077017736,0.000017981884,0.00057060836,0.00020502579,0.00034130405,0.00076317537,0.2836006,0.71367735,0.000016783895],"about_ca_topic_score_codex":0.0008648125,"about_ca_topic_score_gemma":0.0012246975,"teacher_disagreement_score":0.2657263,"about_ca_system_score_codex":0.0011116925,"about_ca_system_score_gemma":0.0005783778,"threshold_uncertainty_score":0.888943},"labels":[],"label_agreement":null},{"id":"W2077123238","doi":"10.1016/j.comgeo.2007.07.008","title":"Local overlaps in special unfoldings of convex polyhedra","year":2009,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Structural Analysis and Optimization","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Polyhedron; Regular polygon; Enhanced Data Rates for GSM Evolution; Convex polytope; Combinatorics; Construct (python library); Path (computing); Mathematics; Class (philosophy); Computer science; Convex set; Geometry; Convex optimization; Artificial intelligence","score_opus":0.004075308654719689,"score_gpt":0.19678165630970307,"score_spread":0.19270634765498337,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2077123238","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7418414,0.0001897667,0.23507378,0.00017228548,0.00006273987,0.000034327735,0.00010206857,0.00023631829,0.022287449],"genre_scores_gemma":[0.9713354,0.00008337893,0.02248901,0.00003976396,0.000042642037,0.000033144788,0.00015508369,0.00015769665,0.0056638494],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992248,0.00014641987,0.000026043495,0.00014217292,0.00025803503,0.00020250099],"domain_scores_gemma":[0.9984732,0.00059773703,0.00021200946,0.00025084498,0.00016822427,0.0002979915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006501113,0.00037754126,0.00075875066,0.0012497605,0.001388309,0.001529203,0.000778132,0.0006259955,0.0058640153],"category_scores_gemma":[0.003111106,0.00057865406,0.0005719144,0.0006776988,0.0021844867,0.0016203499,0.002315535,0.0013288176,0.00047000338],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019511656,0.00009883293,0.0025087988,0.00006135512,0.00003170171,0.0006740817,0.0009172036,0.046413757,0.0085872,0.9198119,0.0017003411,0.018999735],"study_design_scores_gemma":[0.000020301606,0.00009204465,0.0025791088,0.0000216727,0.000018475763,0.000361227,0.00076370745,0.19195536,0.0037420492,0.79635996,0.0040627443,0.000023341125],"about_ca_topic_score_codex":0.00076771877,"about_ca_topic_score_gemma":0.0014429677,"teacher_disagreement_score":0.0058640153,"about_ca_system_score_codex":0.0006356921,"about_ca_system_score_gemma":0.00033665387,"threshold_uncertainty_score":0.01961714},"labels":[],"label_agreement":null},{"id":"W2078707782","doi":"10.1016/j.comgeo.2004.02.002","title":"Expected time analysis for Delaunay point location","year":2004,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":47,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Delaunay triangulation; Simple (philosophy); Tree (set theory); Point (geometry); Jump; Mathematics; Point location; Combinatorics; k-d tree; Random walk; Computer science; Algorithm; Statistics; Geometry; Tree traversal","score_opus":0.01292080864408373,"score_gpt":0.25074940548757013,"score_spread":0.2378285968434864,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2078707782","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025375731,0.0006997694,0.9670358,0.0005152054,0.00007736395,0.00008511951,0.00022454529,0.000423621,0.005562855],"genre_scores_gemma":[0.75087374,0.0014279842,0.22995532,0.0003771739,0.00048014795,0.00040735464,0.001066684,0.0010628989,0.014348685],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99531376,0.0012214525,0.00017210373,0.00060620875,0.0018405798,0.00084573095],"domain_scores_gemma":[0.96419793,0.02844241,0.001626395,0.0015129987,0.003126622,0.0010936179],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005395015,0.0018240685,0.0015919995,0.0025757244,0.0011075933,0.0027843148,0.004002148,0.0012780745,0.011512479],"category_scores_gemma":[0.0373389,0.0009717275,0.0014692387,0.002384118,0.0019942988,0.004085188,0.0035274925,0.0023068388,0.0011181756],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007105108,0.000096679185,0.0026076436,0.00036702896,0.000088592846,0.00018672226,0.00026767602,0.83710545,0.0028079175,0.107010596,0.0043800133,0.04437114],"study_design_scores_gemma":[0.0000110504225,0.000047913083,0.00020984793,0.000017272085,0.0000267259,0.000058534333,0.000039892515,0.9772882,0.000895706,0.02078614,0.0006096463,0.000009061562],"about_ca_topic_score_codex":0.0051875054,"about_ca_topic_score_gemma":0.004534086,"teacher_disagreement_score":0.011512479,"about_ca_system_score_codex":0.0037560381,"about_ca_system_score_gemma":0.00268477,"threshold_uncertainty_score":0.038513124},"labels":[],"label_agreement":null},{"id":"W2079124625","doi":"10.1016/j.comgeo.2007.10.011","title":"Shortest descending paths through given faces","year":2008,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Shortest path problem; Path (computing); Yen's algorithm; K shortest path routing; Face (sociological concept); Terrain; Combinatorics; Sequence (biology); Regular polygon; Point (geometry); Mathematics; Constrained Shortest Path First; Algorithm; Computer science; Euclidean shortest path; Dijkstra's algorithm; Geography; Geometry; Cartography","score_opus":0.04140129129438375,"score_gpt":0.2666796259368927,"score_spread":0.22527833464250896,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2079124625","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30859423,0.00049774913,0.6289422,0.00062618713,0.00014623313,0.0005949462,0.0040915855,0.0013351865,0.055171803],"genre_scores_gemma":[0.43497127,0.00073759677,0.51977384,0.000086754,0.000026148804,0.00042211005,0.0057837414,0.0005766477,0.037621886],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99974066,0.000027433645,0.000016932387,0.00006302904,0.000096427655,0.00005553324],"domain_scores_gemma":[0.99926275,0.0002522801,0.00006339583,0.000089233545,0.0002476864,0.00008471901],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025621083,0.0005280773,0.0005340292,0.0011730917,0.0010167428,0.0013288119,0.001129649,0.00070516864,0.014828422],"category_scores_gemma":[0.002856988,0.0003794685,0.00040217457,0.0010593099,0.00043280475,0.0012616575,0.0013219916,0.0011357702,0.0017953508],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00085049827,0.000399533,0.0054324693,0.0011065466,0.00008400779,0.00046327786,0.001549742,0.1542003,0.032694355,0.28602177,0.028302776,0.48889482],"study_design_scores_gemma":[0.00015581133,0.00043098273,0.0036702647,0.00042237097,0.00008708946,0.000630529,0.0022717041,0.5137971,0.04095543,0.3276769,0.10984352,0.000058245707],"about_ca_topic_score_codex":0.0031255586,"about_ca_topic_score_gemma":0.0072327224,"teacher_disagreement_score":0.014828422,"about_ca_system_score_codex":0.00083253987,"about_ca_system_score_gemma":0.0009721057,"threshold_uncertainty_score":0.049605966},"labels":[],"label_agreement":null},{"id":"W2079518702","doi":"10.1016/j.comgeo.2012.07.001","title":"Stable Roommates Spanner","year":2012,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Spanner; Generalization; Combinatorics; Set (abstract data type); Mathematics; Computer science","score_opus":0.01894526290248786,"score_gpt":0.2530591957806455,"score_spread":0.23411393287815765,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2079518702","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.084057204,0.00015932832,0.8609625,0.00023036373,0.0002857925,0.0001050973,0.000398722,0.0011805723,0.052620415],"genre_scores_gemma":[0.69903713,0.00030022959,0.19297935,0.0001828708,0.00015820746,0.00021617221,0.0014267217,0.0008451894,0.104854025],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99959916,0.00005266542,0.000018802895,0.00013230846,0.00013926953,0.000057764744],"domain_scores_gemma":[0.9995758,0.0000808293,0.00003240443,0.00012996429,0.00009159274,0.00008937454],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003520776,0.0007635673,0.00088240206,0.0007970834,0.00081861624,0.0010278411,0.0015253382,0.0009820159,0.02607548],"category_scores_gemma":[0.0011269695,0.00038019445,0.0006068433,0.00042887556,0.0009425284,0.0018699497,0.0041436693,0.0017601958,0.0058457996],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032889025,0.00013255372,0.0005097631,0.00014238918,0.00004169743,0.00032505702,0.0002473288,0.053588286,0.012949775,0.82373357,0.009282706,0.09871801],"study_design_scores_gemma":[0.00005821122,0.00019597466,0.00027972285,0.000027531878,0.000023761959,0.000344127,0.00019613377,0.27942967,0.01092926,0.6846843,0.023797762,0.000033543656],"about_ca_topic_score_codex":0.00039614123,"about_ca_topic_score_gemma":0.0005937192,"teacher_disagreement_score":0.02607548,"about_ca_system_score_codex":0.0003341712,"about_ca_system_score_gemma":0.00033187482,"threshold_uncertainty_score":0.08723116},"labels":[],"label_agreement":null},{"id":"W2083101719","doi":"10.1016/j.comgeo.2013.08.007","title":"Space efficient data structures for dynamic orthogonal range counting","year":2013,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Dalhousie University","funders":"Canada Research Chairs","keywords":"Range (aeronautics); Space (punctuation); Computer science; Dynamic range; Data structure; Mathematics; Algorithm; Computer vision; Engineering; Aerospace engineering","score_opus":0.021831948257065168,"score_gpt":0.2821673451106919,"score_spread":0.2603353968536267,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083101719","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031482086,0.0013037326,0.94960594,0.0006396667,0.00023776203,0.00016362243,0.001165023,0.003963865,0.011438233],"genre_scores_gemma":[0.3269632,0.0010729529,0.65660244,0.00047166614,0.00032210635,0.0006615827,0.0036617012,0.00091488025,0.009329509],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997191,0.0003884665,0.00032295857,0.0003988134,0.0013410149,0.0003576742],"domain_scores_gemma":[0.9952803,0.001144583,0.00033845496,0.002320561,0.0007830687,0.00013293282],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001057482,0.00091455836,0.0014359643,0.00283323,0.0013179139,0.0036505992,0.0023477348,0.00085788395,0.008733211],"category_scores_gemma":[0.008308632,0.00056669745,0.00080576533,0.0071049645,0.0013796096,0.0071743075,0.004967142,0.0020955508,0.0028862734],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000577987,0.0002676158,0.0011547802,0.00027865602,0.00004768034,0.00011652659,0.00032530705,0.027408792,0.011234527,0.3946849,0.02546993,0.53843325],"study_design_scores_gemma":[0.00013873808,0.00026213977,0.00048247518,0.00014209466,0.00006459449,0.00044805082,0.00033000845,0.27506694,0.030632315,0.65144473,0.040884364,0.0001035129],"about_ca_topic_score_codex":0.0012826396,"about_ca_topic_score_gemma":0.0021049578,"teacher_disagreement_score":0.008733211,"about_ca_system_score_codex":0.0011726527,"about_ca_system_score_gemma":0.0018447338,"threshold_uncertainty_score":0.029215515},"labels":[],"label_agreement":null},{"id":"W2083123226","doi":"10.1016/j.comgeo.2004.01.006","title":"Constructing convex 3-polytopes from two triangulations of a polygon","year":2004,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; University of Toronto","funders":"","keywords":"Combinatorics; Mathematics; Convexity; Polytope; Convex polytope; Triangulation; Convex polygon; Polygon (computer graphics); Regular polygon; Convex set; Linear inequality; Discrete mathematics; Convex optimization; Geometry; Computer science; Inequality; Mathematical analysis","score_opus":0.01620979012889884,"score_gpt":0.26497187066690653,"score_spread":0.2487620805380077,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083123226","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046772335,0.000112976,0.9445894,0.00015477018,0.00007829829,0.0002742586,0.00037474805,0.00073582964,0.0069074184],"genre_scores_gemma":[0.18197925,0.00021743562,0.81355375,0.000049516297,0.000016536227,0.00026701254,0.00078226824,0.0004382611,0.002695939],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991738,0.0001454997,0.000054444456,0.00012391341,0.00040092808,0.000101401434],"domain_scores_gemma":[0.99873215,0.0006402002,0.00011208011,0.00025061422,0.00015655093,0.00010838114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068258937,0.0012788415,0.001691754,0.0014933193,0.00085912156,0.0018775755,0.0017869226,0.001753322,0.007721631],"category_scores_gemma":[0.0040577166,0.0015094467,0.002049574,0.0015498608,0.0013517136,0.0014286988,0.004482602,0.0028753115,0.00173706],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00073884893,0.0003702106,0.0023155492,0.0010615849,0.00018899601,0.0018234529,0.0012763207,0.575363,0.033461478,0.11201336,0.008234504,0.26315272],"study_design_scores_gemma":[0.00010845337,0.00015647445,0.00050803786,0.00010602595,0.000040841853,0.00035695417,0.0004892756,0.9261121,0.010594152,0.051242072,0.010230108,0.000055539935],"about_ca_topic_score_codex":0.0026262403,"about_ca_topic_score_gemma":0.0037284351,"teacher_disagreement_score":0.007721631,"about_ca_system_score_codex":0.00073838595,"about_ca_system_score_gemma":0.00088838255,"threshold_uncertainty_score":0.025831461},"labels":[],"label_agreement":null},{"id":"W2083269131","doi":"10.1016/j.comgeo.2011.04.002","title":"Reconstructing orthogonal polyhedra from putative vertex sets","year":2011,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Polyhedron; Vertex (graph theory); Combinatorics; Regular polygon; Set (abstract data type); Convex polytope; Dual polyhedron; Mathematics; Focus (optics); Convex set; Computer science; Geometry; Convex optimization; Physics; Graph","score_opus":0.041778665691416215,"score_gpt":0.2480936186266364,"score_spread":0.20631495293522017,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083269131","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042048924,0.000096820346,0.9548972,0.00010828938,0.00004311132,0.00009457363,0.0003143034,0.00066266244,0.0017340485],"genre_scores_gemma":[0.31836444,0.00020673704,0.6783488,0.000061838495,0.000026283962,0.00014142664,0.0010749875,0.00035714585,0.001418309],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99914324,0.00015416065,0.000043116073,0.00015501086,0.00041930957,0.000085139654],"domain_scores_gemma":[0.9978028,0.00094816147,0.0001991682,0.0005051337,0.00042636518,0.00011847538],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008760814,0.001048684,0.0014860429,0.0021468562,0.00075169554,0.0022007087,0.0021682458,0.002194852,0.003175305],"category_scores_gemma":[0.00680846,0.0016028382,0.0012588317,0.0018948817,0.001432686,0.0016834915,0.0026128318,0.0025461353,0.0013577336],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006044883,0.00021485129,0.004426592,0.00050560525,0.0000958078,0.0005802788,0.00047244772,0.581605,0.032361668,0.10397109,0.005467934,0.26969415],"study_design_scores_gemma":[0.00002176399,0.00002917759,0.00021306014,0.000025753308,0.000009981638,0.00010475957,0.000098323384,0.96974325,0.003575186,0.025004454,0.0011587455,0.000015461603],"about_ca_topic_score_codex":0.0024780699,"about_ca_topic_score_gemma":0.0042651654,"teacher_disagreement_score":0.003175305,"about_ca_system_score_codex":0.00058142236,"about_ca_system_score_gemma":0.0014156894,"threshold_uncertainty_score":0.010622501},"labels":[],"label_agreement":null},{"id":"W2083594480","doi":"10.1016/j.comgeo.2015.01.003","title":"Reprint of: Face-guarding polyhedra","year":2015,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Polyhedron; Combinatorics; Face (sociological concept); Regular polygon; Mathematics; Geometry","score_opus":0.045283510249131305,"score_gpt":0.28275017162805144,"score_spread":0.23746666137892014,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083594480","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00450217,0.009092261,0.23043397,0.014982607,0.31311616,0.00025467612,0.01768603,0.004348583,0.4055835],"genre_scores_gemma":[0.07656703,0.009883151,0.15295456,0.0066669136,0.031924494,0.0003049759,0.019593842,0.0055419337,0.696563],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994838,0.000071728864,0.000053793396,0.00009454892,0.00025810042,0.000038094113],"domain_scores_gemma":[0.9987947,0.0002762735,0.000052522304,0.00030727094,0.0004912639,0.000077936034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037723783,0.0010799695,0.00089511956,0.001340339,0.00087740814,0.0016188772,0.0014987056,0.0011838621,0.19360878],"category_scores_gemma":[0.0038939756,0.0004001569,0.0006036961,0.0026987751,0.000868472,0.0015393097,0.000901479,0.0026354063,0.06103508],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010477475,0.00002312081,0.00007447634,0.00035545076,0.000012854735,0.00016935279,0.000029230732,0.0024567125,0.0012334957,0.049145937,0.83871555,0.107679054],"study_design_scores_gemma":[0.00001918133,0.000029702987,0.00023912646,0.00008266961,0.000007212652,0.00041865924,0.000026921616,0.0037055074,0.0013643842,0.02461641,0.9694756,0.0000145484355],"about_ca_topic_score_codex":0.0012135942,"about_ca_topic_score_gemma":0.002859472,"teacher_disagreement_score":0.19360878,"about_ca_system_score_codex":0.00051295856,"about_ca_system_score_gemma":0.00068042526,"threshold_uncertainty_score":0.6476859},"labels":[],"label_agreement":null},{"id":"W2084142581","doi":"10.1016/j.comgeo.2012.09.008","title":"Establishing strong connectivity using optimal radius half-disk antennas","year":2012,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Antenna Design and Analysis","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Fields Institute for Research in Mathematical Sciences","keywords":"RADIUS; Euclidean geometry; Combinatorics; Wireless network; Minimum spanning tree; Wireless; Directional antenna; Point (geometry); Graph; Mathematics; Enhanced Data Rates for GSM Evolution; Computer science; Antenna (radio); Topology (electrical circuits); Geometry; Telecommunications; Computer network","score_opus":0.02632251882082546,"score_gpt":0.25086610465936793,"score_spread":0.22454358583854248,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2084142581","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0749693,0.00026759363,0.9120267,0.00037077614,0.00007178472,0.00005420363,0.00006069164,0.0002447574,0.011934253],"genre_scores_gemma":[0.88641536,0.00044542158,0.10902558,0.00018256372,0.00008568772,0.00012622072,0.00010918014,0.00007205165,0.0035378784],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.99863005,0.00067998393,0.000047302216,0.00016018868,0.0003306514,0.00015185868],"domain_scores_gemma":[0.9906212,0.006698912,0.00055235997,0.0011650609,0.00059574743,0.00036678504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010958392,0.00084893947,0.0010241396,0.00064143323,0.00058091,0.0014795363,0.0015882605,0.0011338849,0.0030541455],"category_scores_gemma":[0.011518118,0.0005804603,0.0004295779,0.0006178996,0.0013097342,0.002117344,0.0035142992,0.0012608994,0.000847372],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00085214374,0.00018057464,0.0017707553,0.00027182294,0.00008740809,0.0005294448,0.0003308107,0.6026385,0.026561165,0.27898264,0.006834358,0.08096033],"study_design_scores_gemma":[0.00004317028,0.00014077016,0.00019563882,0.000015306498,0.000012000707,0.00016204493,0.00009725818,0.9411882,0.004096837,0.05256365,0.0014711387,0.000014077413],"about_ca_topic_score_codex":0.00031037873,"about_ca_topic_score_gemma":0.0004933809,"teacher_disagreement_score":0.0030541455,"about_ca_system_score_codex":0.00045353253,"about_ca_system_score_gemma":0.00041113928,"threshold_uncertainty_score":0.01021713},"labels":[],"label_agreement":null},{"id":"W2084143237","doi":"10.1016/j.comgeo.2008.05.004","title":"Improved upper bounds on the reflexivity of point sets","year":2008,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Combinatorics; Upper and lower bounds; Point (geometry); Set (abstract data type); Extension (predicate logic); Plane (geometry); Order type; Reflexivity; Simple (philosophy); Order (exchange); Type (biology); Discrete mathematics; Geometry; Mathematical analysis; Computer science","score_opus":0.037868623467320624,"score_gpt":0.2876858346914462,"score_spread":0.2498172112241256,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2084143237","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034206584,0.004144482,0.8970897,0.0016655832,0.00045115486,0.0001832504,0.000738434,0.0016071802,0.05991357],"genre_scores_gemma":[0.5380781,0.0059906105,0.42369533,0.0014789796,0.0016975532,0.00075354765,0.0022367125,0.0026623385,0.023406724],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.98303586,0.004768284,0.0011081634,0.0028350968,0.0065049715,0.0017476414],"domain_scores_gemma":[0.87146646,0.09899094,0.0033516637,0.016643774,0.0059895515,0.0035574785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0147820525,0.0035810634,0.0041412516,0.0060445964,0.0019046565,0.008532463,0.009532975,0.0031554112,0.017581495],"category_scores_gemma":[0.07058668,0.002941126,0.0045528794,0.0044825017,0.008764684,0.017824713,0.017392337,0.017809978,0.005479147],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00089779636,0.0003069037,0.002031074,0.0007467344,0.00015873712,0.00032333384,0.00073109765,0.061139002,0.009426576,0.85642564,0.0068914136,0.0609217],"study_design_scores_gemma":[0.00009509504,0.00027502916,0.00079196686,0.0002736437,0.00015363721,0.00029393527,0.00016254476,0.21326976,0.007847182,0.7685391,0.00819063,0.00010753506],"about_ca_topic_score_codex":0.0009259158,"about_ca_topic_score_gemma":0.0010998222,"teacher_disagreement_score":0.017581495,"about_ca_system_score_codex":0.0029946608,"about_ca_system_score_gemma":0.0017311226,"threshold_uncertainty_score":0.0781759},"labels":[],"label_agreement":null},{"id":"W2085756291","doi":"10.1016/j.comgeo.2012.03.001","title":"Absolute approximation of Tukey depth: Theory and experiments","year":2012,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Advanced Statistical Methods and Models","field":"Mathematics","cited_by":32,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Monte Carlo method; Generalization; Algorithm; Mathematics; Applied mathematics; Mathematical analysis; Statistics","score_opus":0.1291732036448525,"score_gpt":0.4355757829917782,"score_spread":0.3064025793469257,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2085756291","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23587702,0.001464636,0.7534589,0.00047641544,0.0003835619,0.0002889435,0.00033184607,0.0010699473,0.0066485656],"genre_scores_gemma":[0.65808475,0.00050275173,0.336769,0.00023817012,0.000117111376,0.0002938841,0.00049256143,0.0005761208,0.0029256057],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.987651,0.007939589,0.0003525746,0.0016153476,0.0019813797,0.00046004355],"domain_scores_gemma":[0.85533,0.117473066,0.0037909378,0.016121177,0.005319557,0.0019652783],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.016858572,0.0011146484,0.0014846355,0.001021076,0.0012605626,0.002770058,0.002626535,0.0014674705,0.0109699825],"category_scores_gemma":[0.13860291,0.00075384334,0.0010223766,0.0015413124,0.0028714929,0.008688614,0.0035024963,0.0033020081,0.0012168058],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.032643512,0.0023501595,0.01673548,0.001367044,0.00068238156,0.00007358431,0.0027325826,0.10467937,0.01869867,0.22161043,0.0102359485,0.5881909],"study_design_scores_gemma":[0.0014110645,0.0061705755,0.009126083,0.00023083431,0.00041143736,0.00032810235,0.0011453939,0.7302149,0.022706103,0.21987586,0.008179719,0.00019986476],"about_ca_topic_score_codex":0.0034282906,"about_ca_topic_score_gemma":0.0023932538,"teacher_disagreement_score":0.016858572,"about_ca_system_score_codex":0.0019108524,"about_ca_system_score_gemma":0.0028833093,"threshold_uncertainty_score":0.08915776},"labels":[],"label_agreement":null},{"id":"W2086070368","doi":"10.1016/j.comgeo.2015.02.004","title":"On full Steiner trees in unit disk graphs","year":2015,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Steiner tree problem; Combinatorics; Mathematics; Gomory–Hu tree; k-minimum spanning tree; K-ary tree; Tree (set theory); Unit disk; Graph; Approximation algorithm; Discrete mathematics; Tree structure; Binary tree","score_opus":0.04795850184395449,"score_gpt":0.28200055814693564,"score_spread":0.23404205630298114,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2086070368","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50627875,0.008703259,0.3823641,0.009594758,0.0004165939,0.00022629143,0.0029520218,0.0007340742,0.08873016],"genre_scores_gemma":[0.87829274,0.008438298,0.08388801,0.0010833759,0.0010661683,0.00030018776,0.003237591,0.000565097,0.023128575],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981415,0.0006167051,0.00008149902,0.00029009156,0.00052765576,0.00034245063],"domain_scores_gemma":[0.986472,0.010267966,0.0010594794,0.0010077665,0.0005642033,0.0006286248],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012844439,0.0014812922,0.0025462734,0.0030142546,0.0020974092,0.005067657,0.0040136217,0.00212719,0.0136920465],"category_scores_gemma":[0.014484073,0.0012657961,0.0013611568,0.006700781,0.0031227905,0.014519304,0.004033445,0.0034714413,0.0012675299],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003702182,0.00015910788,0.0014925912,0.0005647528,0.000072484254,0.00019752182,0.0006437223,0.13156006,0.0015526843,0.8047739,0.018511612,0.040101267],"study_design_scores_gemma":[0.00003524417,0.00002408193,0.00053910806,0.00004926587,0.000024812678,0.00009920633,0.00016985455,0.10915034,0.00036773775,0.88692373,0.002599439,0.00001718688],"about_ca_topic_score_codex":0.003427385,"about_ca_topic_score_gemma":0.0041388413,"teacher_disagreement_score":0.0136920465,"about_ca_system_score_codex":0.0032262956,"about_ca_system_score_gemma":0.0013157136,"threshold_uncertainty_score":0.0458045},"labels":[],"label_agreement":null},{"id":"W2086607663","doi":"10.1016/j.comgeo.2013.03.005","title":"Triangulating and guarding realistic polygons","year":2013,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Boundary (topology); Constant (computer programming); Simple (philosophy); Computer science; Regular polygon; Object (grammar); Algorithm; Combinatorics; Polygon (computer graphics); Mathematics; Theoretical computer science; Geometry; Artificial intelligence; Mathematical analysis; Programming language","score_opus":0.011846774291486974,"score_gpt":0.2333190862042003,"score_spread":0.22147231191271333,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2086607663","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038682647,0.00008587056,0.95489085,0.000075820986,0.000048204176,0.0000791685,0.00014305994,0.0006725806,0.0053218678],"genre_scores_gemma":[0.42048433,0.00026027745,0.5729208,0.00005010608,0.000022062166,0.00009906303,0.0007780868,0.0006025338,0.004782772],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99918205,0.00014708887,0.000047017315,0.00014919745,0.00038630917,0.000088309105],"domain_scores_gemma":[0.9989249,0.00045876973,0.00008341379,0.0003726584,0.00011129727,0.000048920876],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064893026,0.00072441867,0.00092456304,0.0009240932,0.0006762974,0.0014497614,0.001614218,0.0012337944,0.0037070713],"category_scores_gemma":[0.0036445148,0.0009114336,0.00093491934,0.0010247125,0.0014024288,0.00158038,0.0030776423,0.001409506,0.00077172153],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001348461,0.000049529954,0.0008074331,0.00019212671,0.000031009866,0.0004719466,0.0004259756,0.79693085,0.011544451,0.09330302,0.0021662896,0.0939425],"study_design_scores_gemma":[0.000009829166,0.000039753228,0.00009702233,0.000026874815,0.00000947715,0.00015137246,0.000107309155,0.9581485,0.005992815,0.0305481,0.0048566735,0.00001244316],"about_ca_topic_score_codex":0.002166468,"about_ca_topic_score_gemma":0.0026609886,"teacher_disagreement_score":0.0037070713,"about_ca_system_score_codex":0.00052798796,"about_ca_system_score_gemma":0.0006739175,"threshold_uncertainty_score":0.012401402},"labels":[],"label_agreement":null},{"id":"W2087832808","doi":"10.1016/j.comgeo.2008.12.001","title":"Editorial CCCG 2005","year":2008,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Diverse Scientific and Economic Studies","field":"Economics, Econometrics and Finance","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor; Carleton University","funders":"","keywords":"History","score_opus":0.03659711870412601,"score_gpt":0.208185652841079,"score_spread":0.171588534136953,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2087832808","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008835657,0.004345734,0.0002719146,0.054028455,0.9265089,0.00006100556,0.00029897087,0.00018392522,0.014212749],"genre_scores_gemma":[0.001775665,0.0036849312,0.0003731649,0.03509402,0.8326524,0.00011411634,0.00036829212,0.00014131672,0.12579612],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99793327,0.0002977105,0.00017323038,0.0003412327,0.0010349639,0.00021964716],"domain_scores_gemma":[0.98920804,0.0026825515,0.0006728743,0.0006794043,0.0046295817,0.0021276332],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003300381,0.001987532,0.0024191455,0.0043145344,0.0025026083,0.0073737474,0.0023054213,0.010171343,0.077435896],"category_scores_gemma":[0.015936963,0.0008282141,0.0018070852,0.0018547658,0.0019418751,0.0025025022,0.0019849713,0.009173344,0.035663098],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018342243,0.0000030727747,0.000009314173,0.0000467104,0.0000035552398,0.000021432948,0.0000026963012,0.000015357602,0.000017698962,0.00030197657,0.9958513,0.0037085195],"study_design_scores_gemma":[0.00003400509,0.000008148125,0.0001514215,0.00009207496,0.000010649276,0.00003221177,0.000008057852,0.00008343871,0.000045436715,0.0008569372,0.9986708,0.000006731804],"about_ca_topic_score_codex":0.002799055,"about_ca_topic_score_gemma":0.008279718,"teacher_disagreement_score":0.077435896,"about_ca_system_score_codex":0.003273684,"about_ca_system_score_gemma":0.0027101187,"threshold_uncertainty_score":0.25904888},"labels":[],"label_agreement":null},{"id":"W2088133390","doi":"10.1016/j.comgeo.2013.08.005","title":"Orthogonal cartograms with at most 12 corners per face","year":2013,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Face (sociological concept); Enhanced Data Rates for GSM Evolution; Geometry; Combinatorics; Graph; Mathematics; Plane (geometry); Computer science; Artificial intelligence; Computer vision; Sociology","score_opus":0.010952583299292612,"score_gpt":0.2141261595870823,"score_spread":0.2031735762877897,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2088133390","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09200083,0.0002724856,0.8400152,0.00035633746,0.00041418202,0.0005372498,0.0014197279,0.002131868,0.06285211],"genre_scores_gemma":[0.31869072,0.00039153534,0.649658,0.0001799393,0.00008165097,0.00041123162,0.0023374662,0.0007227621,0.027526658],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99932754,0.00010565917,0.000039297203,0.00010394354,0.00030466152,0.00011891131],"domain_scores_gemma":[0.9993111,0.00012353442,0.000052673546,0.00021955873,0.0002264395,0.00006665523],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030126708,0.00097488123,0.0009669974,0.0012268294,0.0006635971,0.0011065945,0.0010045856,0.00085713336,0.025560452],"category_scores_gemma":[0.001987969,0.0009346869,0.00074117386,0.0011578166,0.00065202534,0.00094084884,0.0022911788,0.0011247027,0.0055696927],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017233117,0.00036830024,0.003195042,0.0006173874,0.00012861911,0.00085495366,0.0003402198,0.072363,0.0945927,0.09972959,0.051056422,0.6750305],"study_design_scores_gemma":[0.0005886761,0.00070864067,0.006287403,0.00023871628,0.00014004674,0.0022847445,0.00077322905,0.6417841,0.113234565,0.10038748,0.13339446,0.00017801323],"about_ca_topic_score_codex":0.0012824343,"about_ca_topic_score_gemma":0.0025243089,"teacher_disagreement_score":0.025560452,"about_ca_system_score_codex":0.000289988,"about_ca_system_score_gemma":0.0007776735,"threshold_uncertainty_score":0.08550817},"labels":[],"label_agreement":null},{"id":"W2088816968","doi":"10.1016/j.comgeo.2005.05.001","title":"A linear time algorithm to remove winding of a simple polygon","year":2005,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Simple polygon; Simple (philosophy); Polygon (computer graphics); Stack (abstract data type); Algorithm; Sequence (biology); SIMPLE algorithm; Point (geometry); Time complexity; Polygon covering; Point in polygon; Mathematics; Computer science; Monotone polygon; Combinatorics; Geometry; Physics","score_opus":0.010627487721599764,"score_gpt":0.26261754626947964,"score_spread":0.25199005854787987,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2088816968","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012505712,0.000063503554,0.9799437,0.00008424519,0.00010415579,0.00013542437,0.000058348203,0.0032410352,0.0038639659],"genre_scores_gemma":[0.08287455,0.000061162806,0.90993905,0.00007562819,0.0000397516,0.00010917641,0.00041004148,0.0007814912,0.005709102],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99940395,0.000049190334,0.000032433265,0.00013102056,0.0002927673,0.00009072483],"domain_scores_gemma":[0.99895585,0.00036973928,0.000080620244,0.00031239743,0.00020426209,0.0000771212],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045926168,0.0013959934,0.0012992722,0.0012681892,0.0009879086,0.0009657471,0.001469089,0.00096351013,0.014470968],"category_scores_gemma":[0.0017816739,0.00074490474,0.0010594795,0.0010208518,0.00089026196,0.0012469431,0.0023202323,0.0013022306,0.0038265716],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004419888,0.00024628293,0.0006548531,0.0002767027,0.00006708119,0.0002689922,0.00020956888,0.034372065,0.05302154,0.013918835,0.013640426,0.88288164],"study_design_scores_gemma":[0.00039977278,0.0004657283,0.0009416157,0.000038835886,0.00014212786,0.0007749132,0.0002420805,0.84688145,0.074422345,0.046956755,0.028668704,0.00006571127],"about_ca_topic_score_codex":0.0015106335,"about_ca_topic_score_gemma":0.003180962,"teacher_disagreement_score":0.014470968,"about_ca_system_score_codex":0.00039904608,"about_ca_system_score_gemma":0.000936757,"threshold_uncertainty_score":0.048410177},"labels":[],"label_agreement":null},{"id":"W2089645963","doi":"10.1016/j.comgeo.2008.04.001","title":"Flips in planar graphs","year":2008,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":91,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Planar graph; Book embedding; Embedding; Combinatorics; Planar straight-line graph; 1-planar graph; Pathwidth; Outerplanar graph; Perspective (graphical); Computer science; Line graph; Mathematics; Graph; Discrete mathematics; Artificial intelligence","score_opus":0.023790178785209063,"score_gpt":0.24061003229846303,"score_spread":0.21681985351325397,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2089645963","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39568752,0.0019430186,0.5126998,0.0013663473,0.00048252477,0.00022102825,0.00066034065,0.00095930585,0.08598005],"genre_scores_gemma":[0.8853454,0.001291276,0.06749813,0.00033311592,0.00016650611,0.00013578782,0.0006797749,0.00038236903,0.044167496],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99973816,0.000056275607,0.000012710072,0.00005300881,0.00009093729,0.00004886797],"domain_scores_gemma":[0.99911803,0.00039595697,0.00012032586,0.00012757553,0.00013402764,0.000104203886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000350659,0.00043908219,0.0005820259,0.0017658359,0.0010346215,0.001251278,0.0008767028,0.0010831084,0.01144161],"category_scores_gemma":[0.0030982785,0.0005217283,0.000512602,0.0011367623,0.0014903693,0.002064741,0.0018215914,0.0014631609,0.0011601427],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008818522,0.000041318654,0.0007792451,0.00012652228,0.000015647774,0.00020041014,0.00029538025,0.035725933,0.0022277,0.8853899,0.006259599,0.06885019],"study_design_scores_gemma":[0.00001972171,0.000023069377,0.00029949305,0.000028607861,0.000013228009,0.00012672944,0.00016085841,0.056703735,0.00097438024,0.93544316,0.0061957566,0.000011327461],"about_ca_topic_score_codex":0.0015259294,"about_ca_topic_score_gemma":0.0017914565,"teacher_disagreement_score":0.01144161,"about_ca_system_score_codex":0.00055774715,"about_ca_system_score_gemma":0.00033810092,"threshold_uncertainty_score":0.038276017},"labels":[],"label_agreement":null},{"id":"W2089984367","doi":"10.1016/j.comgeo.2012.10.010","title":"Closest pair and the post office problem for stochastic points","year":2012,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Euclidean space; Mathematics; Point (geometry); Stochastic geometry; Set (abstract data type); Combinatorics; Euclidean geometry; Space (punctuation); Discrete mathematics; Stochastic process; Computational geometry; Algorithm; Computer science; Geometry; Statistics","score_opus":0.014340819491794474,"score_gpt":0.24804920726053245,"score_spread":0.23370838776873798,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2089984367","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06747739,0.00059647363,0.9199116,0.0015993457,0.00017335016,0.00013553517,0.00043464708,0.00019066043,0.009480872],"genre_scores_gemma":[0.6456839,0.0010603563,0.31476858,0.00026324345,0.00039891058,0.00046072362,0.0014431775,0.00047101284,0.035450112],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976927,0.0009500318,0.00011469667,0.0004741148,0.0005337425,0.00023469611],"domain_scores_gemma":[0.99016577,0.0074280202,0.0007343613,0.000560575,0.0005057778,0.0006055714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003549074,0.0010600641,0.0027261325,0.0019503698,0.0019770665,0.0029073127,0.003735152,0.0057713306,0.011724406],"category_scores_gemma":[0.02360287,0.0012941782,0.0019408901,0.0022270542,0.0027274226,0.0065923976,0.0054749288,0.0038583975,0.0011387527],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036258993,0.00013798369,0.0011676428,0.00018011696,0.00006606276,0.00032168414,0.00026520801,0.50755566,0.0005131549,0.45330033,0.0066404366,0.029489135],"study_design_scores_gemma":[0.000047918544,0.00005713431,0.00016581421,0.00002598968,0.000015654772,0.000099970115,0.00010673149,0.71110314,0.0003576672,0.28574708,0.0022480604,0.000024825387],"about_ca_topic_score_codex":0.0050811237,"about_ca_topic_score_gemma":0.0040895375,"teacher_disagreement_score":0.011724406,"about_ca_system_score_codex":0.0017865382,"about_ca_system_score_gemma":0.0017909867,"threshold_uncertainty_score":0.03922206},"labels":[],"label_agreement":null},{"id":"W2090529709","doi":"10.1016/s0925-7721(02)00111-6","title":"An efficient algorithm for enumeration of triangulations","year":2002,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Enumeration; Triangulation; Combinatorics; Position (finance); Mathematics; Tree (set theory); Plane (geometry); Point set triangulation; Algorithm; General position; Discrete mathematics; Computer science; Delaunay triangulation; Geometry","score_opus":0.025775814371855645,"score_gpt":0.27469945162803916,"score_spread":0.24892363725618352,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2090529709","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022341614,0.00016252467,0.99194664,0.00012980044,0.00007118605,0.00009351404,0.00021369617,0.0017982628,0.0033502216],"genre_scores_gemma":[0.025453389,0.00021407231,0.9681415,0.00007551536,0.00003691298,0.0002472122,0.0012679531,0.0005883731,0.003975162],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99811065,0.0003721521,0.00016598497,0.00028919513,0.0008086407,0.00025341666],"domain_scores_gemma":[0.9962773,0.0016071126,0.00015375232,0.00090610597,0.0009066834,0.00014901278],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011503169,0.0019139698,0.0021332074,0.0033009676,0.0019764598,0.002987572,0.0033835424,0.0017790528,0.01816083],"category_scores_gemma":[0.009587322,0.001327858,0.0019421598,0.0052708457,0.0012376839,0.0039950246,0.0052153934,0.0031125217,0.0078971535],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003080179,0.0001438571,0.0006088276,0.00049596373,0.00006775947,0.00017831638,0.00029384263,0.047895722,0.008375629,0.10627055,0.031542145,0.80381936],"study_design_scores_gemma":[0.0002476415,0.00014512453,0.0005235838,0.00017553807,0.00009813699,0.0005962306,0.00025665446,0.5774638,0.009743664,0.35802314,0.052642066,0.00008449585],"about_ca_topic_score_codex":0.0028271663,"about_ca_topic_score_gemma":0.0049342797,"teacher_disagreement_score":0.01816083,"about_ca_system_score_codex":0.0011414858,"about_ca_system_score_gemma":0.0022136897,"threshold_uncertainty_score":0.060754},"labels":[],"label_agreement":null},{"id":"W2096616111","doi":"10.1016/j.comgeo.2004.12.004","title":"When can a net fold to a polyhedron?","year":2005,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Polyhedron; Dihedral angle; Net (polyhedron); Fold (higher-order function); Folding (DSP implementation); Combinatorics; Time complexity; Mathematics; Computer science; Geometry; Algorithm; Physics; Structural engineering; Engineering","score_opus":0.01190106065325264,"score_gpt":0.2493156393802527,"score_spread":0.23741457872700006,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096616111","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5060579,0.00068183464,0.26474753,0.01508455,0.0023527122,0.00016465533,0.0005780114,0.0013972697,0.20893548],"genre_scores_gemma":[0.92940843,0.0004018179,0.034793984,0.0005937761,0.00017556969,0.0000985008,0.00028232703,0.00033489423,0.033910606],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994837,0.00007302802,0.000023860337,0.00014137692,0.00011354702,0.00016453429],"domain_scores_gemma":[0.9981781,0.0006154008,0.00012323372,0.00033644936,0.0003157745,0.00043096495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005937908,0.00035959025,0.00058973633,0.000571007,0.0020867675,0.003611031,0.00086911273,0.0022595474,0.016030231],"category_scores_gemma":[0.0063409763,0.0004879708,0.0006984726,0.00039848365,0.0032781262,0.0106013585,0.0019010223,0.0018600401,0.0032751486],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005204427,0.00008876654,0.0047665397,0.00014828528,0.00003636442,0.0015834906,0.0012528766,0.015422776,0.006857728,0.8792588,0.016678816,0.07338523],"study_design_scores_gemma":[0.000021829857,0.00006983783,0.00070221577,0.00009269345,0.000016559203,0.00062682363,0.0038779576,0.032210644,0.004414183,0.93474036,0.023186734,0.000040108236],"about_ca_topic_score_codex":0.0017426783,"about_ca_topic_score_gemma":0.002016714,"teacher_disagreement_score":0.016030231,"about_ca_system_score_codex":0.00083239947,"about_ca_system_score_gemma":0.0006785305,"threshold_uncertainty_score":0.053626418},"labels":[],"label_agreement":null},{"id":"W2097923493","doi":"10.1016/s0925-7721(02)00126-8","title":"Tight degree bounds for pseudo-triangulations of points","year":2003,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Degree (music); Triangulation; Combinatorics; Point set triangulation; Vertex (graph theory); Mathematics; Pitteway triangulation; General position; Face (sociological concept); Position (finance); Set (abstract data type); Point (geometry); Minimum-weight triangulation; Delaunay triangulation; Computer science; Geometry; Bowyer–Watson algorithm; Physics; Graph","score_opus":0.0390161392047745,"score_gpt":0.2814012461207045,"score_spread":0.24238510691593,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2097923493","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07025102,0.0015988249,0.90742505,0.0011277647,0.00021746597,0.00012826663,0.0005847068,0.00078909076,0.017877862],"genre_scores_gemma":[0.71866345,0.0021042756,0.26131082,0.0006384671,0.000357505,0.00031588573,0.0015887672,0.0014560055,0.013564748],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99238443,0.0018397714,0.00043387868,0.0010340776,0.0030967854,0.0012109424],"domain_scores_gemma":[0.9674758,0.019093003,0.001692371,0.006975294,0.0030903188,0.0016731734],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044631246,0.002345674,0.002149212,0.0032282774,0.0021248802,0.005623329,0.0055279173,0.0026303164,0.011710088],"category_scores_gemma":[0.042122096,0.001873538,0.0016936798,0.0032104754,0.004484251,0.012558489,0.013846104,0.0057882704,0.0027451538],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016087552,0.00019059518,0.0035106188,0.00077970047,0.00011056638,0.00024903452,0.0011232962,0.29199114,0.009597778,0.58283406,0.009278641,0.09872579],"study_design_scores_gemma":[0.00007507679,0.0001548351,0.00075842877,0.000118961565,0.000053891577,0.00021165267,0.00027590315,0.42796466,0.006865452,0.5571174,0.0063532265,0.00005050079],"about_ca_topic_score_codex":0.0019203685,"about_ca_topic_score_gemma":0.0040268917,"teacher_disagreement_score":0.011710088,"about_ca_system_score_codex":0.0020747858,"about_ca_system_score_gemma":0.0011475283,"threshold_uncertainty_score":0.03917414},"labels":[],"label_agreement":null},{"id":"W2099217816","doi":"10.1016/j.comgeo.2003.07.005","title":"On simplifying dot maps","year":2003,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":44,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Heuristics; Mathematics; Set (abstract data type); Combinatorics; Distribution (mathematics); Point (geometry); Approximation algorithm; Simple (philosophy); Unit (ring theory); Algorithm; Discrete mathematics; Mathematical optimization; Computer science; Geometry; Mathematical analysis","score_opus":0.020312816278730432,"score_gpt":0.2606426524941045,"score_spread":0.24032983621537407,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099217816","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04387821,0.0008263972,0.86729884,0.00090285466,0.0004062641,0.00008068546,0.00028083383,0.0010837828,0.0852422],"genre_scores_gemma":[0.52412057,0.0022086108,0.33696827,0.00082018063,0.0005611258,0.00023692854,0.0011044203,0.0029181603,0.1310617],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992525,0.00019924728,0.00003457601,0.00014211668,0.00028717972,0.000084377796],"domain_scores_gemma":[0.9985083,0.0006451182,0.0000710671,0.00045033547,0.00023265567,0.000092496826],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000704595,0.0010063646,0.001191932,0.001980873,0.0015757752,0.0018459414,0.0010426289,0.0009103353,0.017141165],"category_scores_gemma":[0.0057529733,0.00061353826,0.0009931201,0.0018618434,0.001794511,0.0045283413,0.004739283,0.0027774044,0.00447072],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000065856504,0.000030246514,0.00021406745,0.00006555047,0.000016402942,0.00009131993,0.00031316534,0.010688556,0.0018973638,0.9134173,0.008714204,0.06448587],"study_design_scores_gemma":[0.000012825345,0.000024909596,0.00013999782,0.0000201848,0.000017643144,0.00010453262,0.000068691465,0.046600346,0.0018849198,0.9231081,0.028006703,0.000011207661],"about_ca_topic_score_codex":0.0020652844,"about_ca_topic_score_gemma":0.0019743117,"teacher_disagreement_score":0.017141165,"about_ca_system_score_codex":0.00080950896,"about_ca_system_score_gemma":0.00043588105,"threshold_uncertainty_score":0.057342887},"labels":[],"label_agreement":null},{"id":"W2099361645","doi":"10.1016/j.comgeo.2008.11.003","title":"Linear reconfiguration of cube-style modular robots","year":2008,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Modular Robots and Swarm Intelligence","field":"Engineering","cited_by":39,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Ministerio de Economía y Competitividad; Fonds De La Recherche Scientifique - FNRS; Departament d'Universitats, Recerca i Societat de la Informació; McGill University; National Science Foundation","keywords":"Self-reconfiguring modular robot; Control reconfiguration; Robot; Modular design; Robotics; Computer science; Automation; Cube (algebra); Bounding overwatch; Algorithm; Artificial intelligence; Mobile robot; Embedded system; Engineering; Robot control; Mathematics; Combinatorics; Programming language","score_opus":0.024819053864394515,"score_gpt":0.22681311362628667,"score_spread":0.20199405976189216,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099361645","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5253129,0.00041567313,0.43444115,0.00030736477,0.00011558474,0.000056821853,0.00016214231,0.001018377,0.03816997],"genre_scores_gemma":[0.9450956,0.00016706913,0.04988447,0.00006014615,0.000020182742,0.000038971877,0.0001221734,0.000071995055,0.0045393775],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9999006,0.000023630291,0.0000041309722,0.000020970427,0.000029860379,0.000020765247],"domain_scores_gemma":[0.99984777,0.00003249914,0.000033232605,0.000033962508,0.000026303174,0.000026203003],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012661672,0.00032354996,0.00026376187,0.00028038147,0.00025095674,0.00040637274,0.00041520654,0.00022189699,0.0022164055],"category_scores_gemma":[0.00041536783,0.00017930045,0.00029967603,0.00029803687,0.00042787305,0.0005314,0.00065198925,0.00027331174,0.00044749113],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031788924,0.00008240619,0.0014081042,0.00012887553,0.000049046055,0.00046315597,0.00026842067,0.6714808,0.09980378,0.0686343,0.004343394,0.15301982],"study_design_scores_gemma":[0.000041553674,0.00024093693,0.0014105078,0.000012378838,0.000017211378,0.00027883626,0.00012401056,0.918058,0.020032424,0.05299684,0.006758613,0.000028652776],"about_ca_topic_score_codex":0.000605301,"about_ca_topic_score_gemma":0.0009864127,"teacher_disagreement_score":0.0022164055,"about_ca_system_score_codex":0.00024496228,"about_ca_system_score_gemma":0.00019865434,"threshold_uncertainty_score":0.0074145794},"labels":[],"label_agreement":null},{"id":"W2102958968","doi":"10.1016/j.comgeo.2013.02.003","title":"On the power of the semi-separated pair decomposition","year":2013,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Combinatorics; Mathematics; Disjoint sets; Rectangle; Time complexity; Context (archaeology); Linear space; Computational geometry; Data structure; Line segment; Plane (geometry); Binary logarithm; Discrete mathematics; Algorithm; Geometry; Computer science","score_opus":0.010882962751342998,"score_gpt":0.24527482463467473,"score_spread":0.23439186188333172,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102958968","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018083807,0.0011478851,0.95510674,0.00056097534,0.0003171461,0.000031553795,0.00007235614,0.00022060989,0.02445902],"genre_scores_gemma":[0.47798753,0.002291797,0.49622738,0.00080164743,0.0007367964,0.00013741657,0.00038830572,0.00082004763,0.020608993],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991967,0.00039459032,0.000026865733,0.00008262958,0.0002447561,0.000054345168],"domain_scores_gemma":[0.9980983,0.0010466035,0.000086642605,0.00038095383,0.00024745773,0.00014006291],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016630469,0.00081317057,0.0010298967,0.00130619,0.0007263591,0.0017067061,0.0011918996,0.00092209276,0.007140155],"category_scores_gemma":[0.0060165366,0.00057070394,0.00075637555,0.0011193654,0.0021207267,0.0033119754,0.0032237144,0.0031587277,0.001890108],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016622177,0.00005052994,0.00029614492,0.00009183035,0.000031830714,0.00008790527,0.0001660527,0.030028056,0.0021465325,0.8874763,0.006548284,0.07291023],"study_design_scores_gemma":[0.000021455766,0.000027521284,0.00009276572,0.00002830482,0.000011504242,0.000064724234,0.00003837363,0.19931251,0.0007126806,0.7938057,0.0058728647,0.0000115755665],"about_ca_topic_score_codex":0.0007157302,"about_ca_topic_score_gemma":0.0008422049,"teacher_disagreement_score":0.007140155,"about_ca_system_score_codex":0.00037555638,"about_ca_system_score_gemma":0.00040434903,"threshold_uncertainty_score":0.023886204},"labels":[],"label_agreement":null},{"id":"W2110762325","doi":"10.1016/j.comgeo.2014.11.001","title":"Flip distance between two triangulations of a point set is NP-complete","year":2014,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":50,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Polygon (computer graphics); Combinatorics; Regular polygon; Mathematics; Convex polygon; Set (abstract data type); Plane (geometry); Point (geometry); Polygon covering; Discrete mathematics; Computer science; Geometry","score_opus":0.03363412871043522,"score_gpt":0.2903187787358435,"score_spread":0.2566846500254083,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2110762325","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35088173,0.0023846142,0.59537387,0.008418076,0.00047718672,0.001245421,0.008142972,0.002515629,0.030560462],"genre_scores_gemma":[0.68158096,0.0007577014,0.29217476,0.0008202998,0.00017507758,0.000776495,0.0076767476,0.0005430708,0.015494825],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981055,0.0003586977,0.00014229525,0.00057577837,0.0005797389,0.00023802898],"domain_scores_gemma":[0.98671234,0.010892019,0.00068817195,0.000608476,0.0006104246,0.00048847264],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015407086,0.0010770157,0.0026041747,0.0012232547,0.0019415509,0.0026348599,0.0038329042,0.0036834734,0.017432109],"category_scores_gemma":[0.013344208,0.0012695676,0.0020816172,0.0022134273,0.0022862258,0.0064839153,0.0037454043,0.0031469963,0.0013820095],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014821006,0.0006853427,0.00616865,0.0022193315,0.00042667563,0.0009979004,0.0008295579,0.631151,0.0058907997,0.06858162,0.032742508,0.24882446],"study_design_scores_gemma":[0.00047109314,0.00035737373,0.0015611221,0.00016835512,0.00013947216,0.00060269417,0.0009231898,0.77508354,0.004009473,0.20704438,0.009584288,0.000054979675],"about_ca_topic_score_codex":0.006053128,"about_ca_topic_score_gemma":0.0080983555,"teacher_disagreement_score":0.017432109,"about_ca_system_score_codex":0.0026664422,"about_ca_system_score_gemma":0.0018699293,"threshold_uncertainty_score":0.05831629},"labels":[],"label_agreement":null},{"id":"W2111097990","doi":"10.1016/j.comgeo.2012.01.002","title":"Fast local searches and updates in bounded universes","year":2012,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Advanced Image and Video Retrieval Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Bounded function; Binary logarithm; Universe; Hash function; Range (aeronautics); Computer science; Data structure; Range query (database); Combinatorics; Discrete mathematics; Element (criminal law); Amortized analysis; Theoretical computer science; Mathematics; Information retrieval; Search engine; Physics; Astrophysics","score_opus":0.021308189288534653,"score_gpt":0.28789648519996724,"score_spread":0.26658829591143257,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111097990","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051546715,0.0014170395,0.94251144,0.00046544784,0.000074603864,0.0000616895,0.00025819847,0.0011892016,0.002475672],"genre_scores_gemma":[0.49038106,0.00076987373,0.502483,0.00020404671,0.00017804137,0.00022925939,0.00079435343,0.0004052541,0.0045550843],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99803597,0.0007947506,0.00012219563,0.00033288042,0.0005288695,0.00018541054],"domain_scores_gemma":[0.9879963,0.009340222,0.0004664525,0.0011942725,0.0006479526,0.00035494563],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021186934,0.0007868898,0.0024984847,0.0023626788,0.0011155056,0.0021875603,0.0031041515,0.0018857474,0.0035258755],"category_scores_gemma":[0.024396984,0.0011801341,0.0008124413,0.0027797644,0.0018206536,0.00689729,0.0050779865,0.0018210444,0.00068009074],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012592458,0.00018389727,0.0016842,0.00063862687,0.0001856318,0.0003424505,0.0007771303,0.5596604,0.0071540247,0.18511002,0.01167814,0.23132624],"study_design_scores_gemma":[0.000041475814,0.000027985312,0.00013406904,0.000013318838,0.00001698109,0.000042744676,0.00004977648,0.929029,0.0013172154,0.068291016,0.0010241235,0.000012243542],"about_ca_topic_score_codex":0.0053198547,"about_ca_topic_score_gemma":0.006501679,"teacher_disagreement_score":0.0053198547,"about_ca_system_score_codex":0.0011168619,"about_ca_system_score_gemma":0.0008320866,"threshold_uncertainty_score":0.011795282},"labels":[],"label_agreement":null},{"id":"W2112198514","doi":"10.1016/j.comgeo.2009.01.004","title":"Bounds for point recolouring in geometric graphs","year":2009,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Combinatorics; Graph; Mathematics; Point (geometry); Sequence (biology); Discrete mathematics; Geometry","score_opus":0.01728302891155168,"score_gpt":0.26761283168904354,"score_spread":0.25032980277749184,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2112198514","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09831044,0.008526066,0.81402564,0.0043748645,0.000792183,0.00028156635,0.0015014666,0.004266057,0.06792176],"genre_scores_gemma":[0.63538235,0.008865153,0.3106061,0.0017312682,0.0015201635,0.0006169514,0.0035641815,0.004779296,0.03293445],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99480706,0.0009251266,0.0002558773,0.00081931584,0.0019602056,0.0012324409],"domain_scores_gemma":[0.93852806,0.04513089,0.0023622778,0.00772259,0.0033986138,0.0028576052],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006045654,0.0038009824,0.003815286,0.006938326,0.0030018387,0.008179561,0.010743831,0.0036408994,0.022920506],"category_scores_gemma":[0.04330976,0.0019703722,0.003410989,0.006918104,0.0067895334,0.0216042,0.0111446865,0.011902846,0.0043335464],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013802402,0.00034046464,0.0029811596,0.0016922932,0.00019241987,0.0003259096,0.0016671628,0.20158392,0.0068763555,0.604335,0.02878483,0.1498402],"study_design_scores_gemma":[0.00006942735,0.00016630505,0.0009062192,0.00031910508,0.00024484735,0.00022681702,0.00029924116,0.3455288,0.004521362,0.6380219,0.009613242,0.000082640516],"about_ca_topic_score_codex":0.0040355893,"about_ca_topic_score_gemma":0.005699032,"teacher_disagreement_score":0.022920506,"about_ca_system_score_codex":0.0042093433,"about_ca_system_score_gemma":0.0015867619,"threshold_uncertainty_score":0.076676786},"labels":[],"label_agreement":null},{"id":"W2114400222","doi":"10.1016/j.comgeo.2006.03.006","title":"Space-efficient geometric divide-and-conquer algorithms","year":2006,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":36,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Divide and conquer algorithms; Space (punctuation); Computer science; Algorithm; Theoretical computer science","score_opus":0.010695216191917826,"score_gpt":0.23222283243992714,"score_spread":0.22152761624800932,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114400222","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012892184,0.0007297622,0.97241896,0.00056201324,0.000113400965,0.000114096314,0.00018775278,0.0030167426,0.009965058],"genre_scores_gemma":[0.12216357,0.00043816134,0.86728215,0.00020633069,0.00011097382,0.00021939838,0.0008385356,0.0005372311,0.008203567],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988674,0.00017301478,0.000057570283,0.0002155256,0.0005043482,0.0001821427],"domain_scores_gemma":[0.9984378,0.00066501345,0.00009059806,0.00040622253,0.00032476426,0.00007556754],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064486056,0.0017241752,0.0016930881,0.0016261046,0.0013859253,0.0020063892,0.0028443767,0.0016597094,0.014354102],"category_scores_gemma":[0.004083869,0.0006785001,0.00091177586,0.0030728811,0.0011760348,0.003294794,0.0029507943,0.0019986245,0.003383944],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005496498,0.0003160149,0.00063522696,0.00026873307,0.000063832005,0.00007857321,0.00018758408,0.17511673,0.00866678,0.0585765,0.027195122,0.7283453],"study_design_scores_gemma":[0.00019418105,0.00009119363,0.00019707538,0.000017441896,0.00003636455,0.00009324732,0.000114409064,0.91530144,0.0063944845,0.06777414,0.009768704,0.000017201906],"about_ca_topic_score_codex":0.003399293,"about_ca_topic_score_gemma":0.008226421,"teacher_disagreement_score":0.014354102,"about_ca_system_score_codex":0.0011370226,"about_ca_system_score_gemma":0.0016687091,"threshold_uncertainty_score":0.04801929},"labels":[],"label_agreement":null},{"id":"W2115964316","doi":"10.1016/j.comgeo.2007.05.008","title":"Approximate range searching in higher dimension","year":2007,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Curse of dimensionality; Range (aeronautics); Dimension (graph theory); Dimensionality reduction; Polytope; Mathematics; Ball (mathematics); Range query (database); Unit sphere; Boundary (topology); Exponential function; Combinatorics; Applied mathematics; Mathematical optimization; Computer science; Mathematical analysis; Search engine; Statistics; Web search query; Sargable; Artificial intelligence; Information retrieval","score_opus":0.033773508413437056,"score_gpt":0.2848348428959546,"score_spread":0.25106133448251755,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2115964316","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030834222,0.000962093,0.96271956,0.00017902984,0.000057708294,0.000026420932,0.00008948423,0.0004932605,0.004638155],"genre_scores_gemma":[0.44258362,0.00062062574,0.55191267,0.00015657807,0.00008191725,0.000100964535,0.00025885896,0.0002481348,0.0040366272],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99920017,0.00023434994,0.000052761607,0.000107906446,0.00032728777,0.000077465906],"domain_scores_gemma":[0.9972084,0.0019333618,0.000113101676,0.0004376132,0.00024752397,0.000060022547],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087924465,0.0004539499,0.0014266777,0.00123314,0.00044149382,0.0014359629,0.0012513698,0.0009942974,0.004598764],"category_scores_gemma":[0.007485812,0.00048759187,0.00054868683,0.0016876888,0.000899233,0.002830739,0.0023834433,0.0011369181,0.0005760245],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00053325196,0.0001284576,0.0019656965,0.0005298154,0.00009681454,0.00028733717,0.0003755798,0.53829896,0.007984934,0.15219712,0.0065612975,0.29104072],"study_design_scores_gemma":[0.000023212137,0.000039200284,0.0001455834,0.000014944863,0.000011964252,0.000115662355,0.0000378627,0.944451,0.002166654,0.051019456,0.0019640187,0.000010482124],"about_ca_topic_score_codex":0.001098222,"about_ca_topic_score_gemma":0.0013285537,"teacher_disagreement_score":0.004598764,"about_ca_system_score_codex":0.000424177,"about_ca_system_score_gemma":0.000346844,"threshold_uncertainty_score":0.015384436},"labels":[],"label_agreement":null},{"id":"W2116417064","doi":"10.1016/j.comgeo.2007.01.003","title":"Computational geometric aspects of rhythm, melody, and voice-leading","year":2009,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Music Technology and Sound Studies","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Centre for Interdisciplinary Research in Music Media and Technology","funders":"","keywords":"Rhythm; Music theory; Computer science; Musicology; Field (mathematics); Perception; Computer music; Computational model; Music perception; Mathematics; Algorithm; Psychology; Musical; Visual arts; Pure mathematics; Aesthetics; Art","score_opus":0.015255898013499422,"score_gpt":0.25595322470666765,"score_spread":0.24069732669316823,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116417064","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5008013,0.001388344,0.40542018,0.0015845672,0.00014032667,0.000031768144,0.00029384025,0.00021247406,0.09012708],"genre_scores_gemma":[0.9745106,0.00033194694,0.0193406,0.0000413883,0.000103899256,0.000013486587,0.00016748982,0.00005094165,0.005439695],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997209,0.00010289969,0.000010431733,0.000055747474,0.000060556373,0.00004938844],"domain_scores_gemma":[0.9989673,0.00057829096,0.0001239132,0.00011667708,0.000114131326,0.00009966566],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039321368,0.0004024927,0.00047894855,0.000987943,0.0009808391,0.0024173062,0.0009932918,0.0005472205,0.010043442],"category_scores_gemma":[0.003699645,0.00031678163,0.00067537953,0.00081195217,0.0029533936,0.0028967368,0.001636296,0.0009796092,0.000541622],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006402562,0.000011770179,0.0010739841,0.000030741925,0.000010553317,0.000053243875,0.0003665182,0.018913949,0.00073340413,0.9659058,0.0006918474,0.012144263],"study_design_scores_gemma":[0.000009106556,0.000022544427,0.00068465376,0.000009827248,0.000009007701,0.000055429857,0.00032644384,0.05697164,0.00039751251,0.93881756,0.0026863937,0.000009972223],"about_ca_topic_score_codex":0.0023894054,"about_ca_topic_score_gemma":0.0030407696,"teacher_disagreement_score":0.010043442,"about_ca_system_score_codex":0.00056851085,"about_ca_system_score_gemma":0.0004573238,"threshold_uncertainty_score":0.03359866},"labels":[],"label_agreement":null},{"id":"W2122684646","doi":"10.1016/j.comgeo.2011.12.005","title":"Memoryless routing in convex subdivisions: Random walks are optimal","year":2011,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Carleton University","funders":"","keywords":"Combinatorics; Neighbourhood (mathematics); Vertex (graph theory); Subdivision; Regular polygon; Mathematics; Routing (electronic design automation); Discrete mathematics; Computer science; Graph","score_opus":0.04721833308990548,"score_gpt":0.26880988363864333,"score_spread":0.22159155054873786,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2122684646","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1909632,0.0033720841,0.77305955,0.0037931374,0.00031456276,0.0001252389,0.00041063098,0.00050141924,0.027460217],"genre_scores_gemma":[0.8747149,0.003048517,0.099898376,0.00089955877,0.00030162078,0.00022892524,0.0004710026,0.0006591278,0.01977788],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992312,0.00027882945,0.00004346698,0.00017211783,0.00014546422,0.00012893083],"domain_scores_gemma":[0.9916317,0.0056542754,0.000868331,0.00079634745,0.00050521165,0.0005441302],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014175349,0.0010948688,0.0019773515,0.0013841755,0.0012219168,0.002944705,0.0020261335,0.003376115,0.006784403],"category_scores_gemma":[0.017104123,0.00141923,0.0010756719,0.0015547475,0.0027385382,0.0065388745,0.0020494363,0.002798347,0.00073799136],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002119694,0.00010366142,0.0007235529,0.0001949055,0.000052250794,0.0000527295,0.00013803692,0.32754436,0.0011356259,0.636316,0.0063555627,0.027171345],"study_design_scores_gemma":[0.000026819482,0.00003497456,0.00015662092,0.00003433645,0.000017878921,0.00003109646,0.000039364568,0.46116307,0.00034271757,0.53716964,0.00096993026,0.000013558349],"about_ca_topic_score_codex":0.002575977,"about_ca_topic_score_gemma":0.00339496,"teacher_disagreement_score":0.006784403,"about_ca_system_score_codex":0.0014191186,"about_ca_system_score_gemma":0.0012905797,"threshold_uncertainty_score":0.022696137},"labels":[],"label_agreement":null},{"id":"W2124120807","doi":"10.1016/j.comgeo.2009.08.001","title":"Data structures for range-aggregate extent queries","year":2013,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Rectangle; Aggregate (composite); Range (aeronautics); Set (abstract data type); Point (geometry); Partition (number theory); Computational geometry; Mathematics; Function (biology); Plane (geometry); Data structure; Set function; Computer science; Line segment; Combinatorics; Algorithm; Discrete mathematics; Geometry","score_opus":0.04191183951615511,"score_gpt":0.290789303862651,"score_spread":0.24887746434649588,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2124120807","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043389317,0.002152508,0.84662014,0.0023178868,0.00053043925,0.0007555696,0.027290372,0.05419301,0.022750668],"genre_scores_gemma":[0.41311145,0.0019709868,0.48031136,0.0017276602,0.0005451442,0.0021231745,0.06629173,0.012809024,0.02110955],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958662,0.00041351336,0.0007353703,0.0005015412,0.0019900575,0.0004933588],"domain_scores_gemma":[0.9878434,0.0031318802,0.00063168415,0.0065771826,0.0013999564,0.0004159947],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028139385,0.0016523036,0.0024187877,0.003417851,0.0019173613,0.0054504303,0.0034468246,0.0021973052,0.02373577],"category_scores_gemma":[0.01647961,0.0014539431,0.0016480506,0.0069516385,0.0016852515,0.012493958,0.009253812,0.002934225,0.0074664964],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.003183522,0.0005297922,0.010198217,0.0017739173,0.00031512798,0.0006171233,0.002264478,0.028349271,0.025640521,0.32032248,0.20804508,0.39876056],"study_design_scores_gemma":[0.00077694486,0.0003621992,0.0032992503,0.0005063174,0.00029068766,0.000932952,0.0018320133,0.19185865,0.05917903,0.44733894,0.29332626,0.00029671003],"about_ca_topic_score_codex":0.0030348876,"about_ca_topic_score_gemma":0.0036265014,"teacher_disagreement_score":0.02373577,"about_ca_system_score_codex":0.002117055,"about_ca_system_score_gemma":0.0018371432,"threshold_uncertainty_score":0.079404056},"labels":[],"label_agreement":null},{"id":"W2124937241","doi":"10.1016/j.comgeo.2012.04.001","title":"Exact algorithms and APX-hardness results for geometric packing and covering problems","year":2012,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":72,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Packing problems; Mathematics; Combinatorics; Set packing; Monotone polygon; Cover (algebra); Unit square; Rectangle; Set (abstract data type); Polygon (computer graphics); Vertex cover; Algorithm; Plane (geometry); Set cover problem; Approximation algorithm; Square (algebra); Polyhedron; Vertex (graph theory); Geometry; Computer science; Graph","score_opus":0.03282671474468887,"score_gpt":0.27425363355803745,"score_spread":0.24142691881334857,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2124937241","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06663244,0.005786419,0.8558244,0.007021353,0.00069897814,0.00045478393,0.0022397935,0.002640861,0.058700945],"genre_scores_gemma":[0.427354,0.0057512266,0.5120028,0.0020910976,0.0021337834,0.0019945689,0.00656476,0.002095065,0.04001281],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9948224,0.0011439653,0.00030896591,0.0011303391,0.0017170398,0.0008772558],"domain_scores_gemma":[0.9802342,0.013266223,0.0009883839,0.0038863202,0.00087362557,0.00075134967],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037874072,0.0034623425,0.0040930775,0.002938705,0.0031581016,0.007834707,0.00900288,0.004495923,0.025394296],"category_scores_gemma":[0.025649833,0.0023663864,0.0042896923,0.0069427495,0.004556903,0.02042637,0.008745343,0.012605498,0.0040311664],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017340524,0.0011505949,0.0031392102,0.0020732733,0.0002850914,0.00027259512,0.0011140961,0.23322843,0.0034649558,0.4493818,0.04993907,0.25421682],"study_design_scores_gemma":[0.00018317724,0.0001042139,0.0006714684,0.0000901823,0.00009050746,0.00019750331,0.00022936954,0.22646472,0.0014312641,0.7621647,0.008333746,0.0000390826],"about_ca_topic_score_codex":0.0039837076,"about_ca_topic_score_gemma":0.0038357982,"teacher_disagreement_score":0.025394296,"about_ca_system_score_codex":0.004495404,"about_ca_system_score_gemma":0.00339525,"threshold_uncertainty_score":0.084952354},"labels":[],"label_agreement":null},{"id":"W2126473895","doi":"10.1016/j.comgeo.2014.05.001","title":"Theta-3 is connected","year":2014,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; Ministerio de Economía y Competitividad; Austrian Science Fund","keywords":"Graph; Graph theory; Context (archaeology); Path (computing); Set (abstract data type)","score_opus":0.011925380737211073,"score_gpt":0.22918335958953945,"score_spread":0.21725797885232837,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2126473895","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38597468,0.00061247725,0.1037096,0.0045363065,0.0014658696,0.00023838964,0.0020491008,0.0012973188,0.5001162],"genre_scores_gemma":[0.85973895,0.000645753,0.015408807,0.0011086308,0.00039895275,0.00022354243,0.0027457476,0.00048549564,0.11924405],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995559,0.000059348702,0.000020436284,0.00012215597,0.00011174653,0.00013036291],"domain_scores_gemma":[0.99913305,0.00024846214,0.00012637368,0.000093692426,0.00018629589,0.00021222261],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029726158,0.0012726954,0.0011186779,0.001839763,0.002368678,0.003463175,0.0011758445,0.001083453,0.027695362],"category_scores_gemma":[0.0010738883,0.0005722294,0.0009836105,0.001422485,0.0024969024,0.0030169985,0.002771274,0.0034954967,0.0057859165],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018388327,0.000048405334,0.0004176637,0.000074364376,0.00003530636,0.00030497625,0.00030593725,0.0007064434,0.0021548565,0.9814098,0.006187737,0.008170536],"study_design_scores_gemma":[0.000059395825,0.000038815047,0.00046427513,0.00002079249,0.000027062764,0.0002836885,0.00027918274,0.0014146264,0.0017209222,0.9761603,0.019514902,0.00001597794],"about_ca_topic_score_codex":0.00097318203,"about_ca_topic_score_gemma":0.0008986947,"teacher_disagreement_score":0.027695362,"about_ca_system_score_codex":0.0011443294,"about_ca_system_score_gemma":0.00057744415,"threshold_uncertainty_score":0.092650175},"labels":[],"label_agreement":null},{"id":"W2127927089","doi":"10.1016/s0925-7721(02)00128-1","title":"Translating a regular grid over a point set","year":2003,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Combinatorics; Cover (algebra); Order (exchange); Mathematics; Function (biology); Value (mathematics); Grid; Square (algebra); Finite set; Interval (graph theory); Set (abstract data type); Plane (geometry); Discrete mathematics; Geometry; Computer science; Mathematical analysis; Statistics","score_opus":0.01862488068393825,"score_gpt":0.25799336989335125,"score_spread":0.239368489209413,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2127927089","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04014591,0.0000758488,0.9493344,0.0001720321,0.00024196919,0.00013487638,0.00021252045,0.001063203,0.008619278],"genre_scores_gemma":[0.32264292,0.00023763614,0.6682151,0.000095737276,0.00007034815,0.00021780281,0.0005989324,0.000779881,0.0071416423],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99945027,0.000073270996,0.000039646864,0.0001322359,0.00025757294,0.000046924208],"domain_scores_gemma":[0.9993216,0.00021393316,0.000056648005,0.00025513017,0.00011498565,0.00003769779],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004599215,0.00062322017,0.0008641433,0.00087488606,0.0005103496,0.0010384336,0.0011344862,0.0008250004,0.0062669176],"category_scores_gemma":[0.002670983,0.0005106058,0.000827201,0.0009689683,0.0009980486,0.001028297,0.002311179,0.0011020808,0.0019129234],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005777633,0.00022879131,0.0016101641,0.00052230223,0.00008100255,0.00097409874,0.0008588778,0.48062238,0.07181882,0.16732655,0.011207678,0.26417154],"study_design_scores_gemma":[0.00009341211,0.00029683672,0.0004386082,0.000039107766,0.00002605273,0.00031776036,0.00018343229,0.900693,0.021033335,0.05440981,0.02242984,0.000038818307],"about_ca_topic_score_codex":0.0013955422,"about_ca_topic_score_gemma":0.001330936,"teacher_disagreement_score":0.0062669176,"about_ca_system_score_codex":0.00040990845,"about_ca_system_score_gemma":0.0004169424,"threshold_uncertainty_score":0.02096492},"labels":[],"label_agreement":null},{"id":"W2131625432","doi":"10.1016/j.comgeo.2010.12.003","title":"Modelling gateway placement in wireless networks: Geometric k-centres of unit disc graphs","year":2010,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University; University of Waterloo; University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada; McGill University","keywords":"Combinatorics; Vertex (graph theory); Unit disk graph; Approximation algorithm; Mathematics; Graph; Plane (geometry); Dimension (graph theory); Discrete mathematics; Wireless network; Geometry; Computer science; Wireless; Telecommunications","score_opus":0.017453222491086783,"score_gpt":0.24480263431444432,"score_spread":0.22734941182335755,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2131625432","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08086904,0.00061667006,0.90337634,0.00047105976,0.00013322518,0.00012522213,0.0002794274,0.00026954274,0.013859465],"genre_scores_gemma":[0.87027884,0.0010008849,0.1189545,0.000104234234,0.000097126605,0.00020253968,0.00026677398,0.00022326925,0.008871739],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99909234,0.0004212043,0.000041267733,0.00018336099,0.00013317805,0.00012872851],"domain_scores_gemma":[0.99743193,0.001420393,0.0003901974,0.00023760376,0.000332645,0.00018719654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010080588,0.001276702,0.0016298456,0.0015421052,0.0010512538,0.002917432,0.004188566,0.003323693,0.0033104587],"category_scores_gemma":[0.0068322974,0.0014538461,0.0014613805,0.0021392452,0.0030810223,0.0026190672,0.0025983748,0.0013982767,0.0009650619],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002433249,0.000008951645,0.00017333742,0.00002209329,0.000005335473,0.000038979146,0.000033238342,0.9785276,0.00012990089,0.019014753,0.00034007328,0.0016814263],"study_design_scores_gemma":[0.000005378267,0.0000061575047,0.00003631482,0.000004545094,0.0000030865294,0.0000123154505,0.000018204544,0.9892286,0.000080464124,0.01027304,0.00032730686,0.000004588467],"about_ca_topic_score_codex":0.011929841,"about_ca_topic_score_gemma":0.0076910527,"teacher_disagreement_score":0.011929841,"about_ca_system_score_codex":0.0024308607,"about_ca_system_score_gemma":0.0011907434,"threshold_uncertainty_score":0.0237208},"labels":[],"label_agreement":null},{"id":"W2138168865","doi":"10.1016/j.comgeo.2014.08.006","title":"Weighted straight skeletons in the plane","year":2014,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":46,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Polygon (computer graphics); Skeleton (computer programming); Regular polygon; Combinatorics; Mathematics; Ambiguity; Convex polygon; Point (geometry); Planar; Computer science; Topology (electrical circuits); Geometry; Computer graphics (images)","score_opus":0.010443610985783884,"score_gpt":0.23664905553857915,"score_spread":0.22620544455279526,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2138168865","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.105116256,0.00016482483,0.87940305,0.00006991394,0.000026235335,0.00007272784,0.0001708507,0.00035723174,0.014618891],"genre_scores_gemma":[0.5229553,0.00076805503,0.4594285,0.00005480795,0.00004354848,0.00012602024,0.00068711047,0.00039474337,0.015541918],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997222,0.000038846716,0.000017631035,0.00007075285,0.000108489716,0.000042120362],"domain_scores_gemma":[0.999527,0.00011531999,0.00011323757,0.00010813008,0.000091774054,0.00004463072],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023333644,0.0005610013,0.0003246639,0.0013195104,0.00072593905,0.0010098943,0.00073598267,0.00056989375,0.005926264],"category_scores_gemma":[0.0011398987,0.00044600407,0.0006092202,0.0012461061,0.0013421662,0.0019015109,0.0013362544,0.0007189939,0.0013170638],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007333309,0.000051546747,0.0011250103,0.00012960321,0.000025989777,0.0006214227,0.0004029591,0.094418205,0.022025557,0.7973378,0.0017443937,0.08204422],"study_design_scores_gemma":[0.000024121991,0.00013310616,0.0013738218,0.00006824564,0.000033571836,0.001064793,0.000406596,0.2539932,0.01739721,0.6872032,0.038261704,0.000040387105],"about_ca_topic_score_codex":0.0009477442,"about_ca_topic_score_gemma":0.0013447015,"teacher_disagreement_score":0.005926264,"about_ca_system_score_codex":0.0004109022,"about_ca_system_score_gemma":0.00024826158,"threshold_uncertainty_score":0.01982528},"labels":[],"label_agreement":null},{"id":"W2138849026","doi":"10.1016/j.comgeo.2008.12.005","title":"Compatible geometric matchings","year":2009,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":51,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Combinatorics; Mathematics; Disjoint sets; Conjecture; Perfect power; Matching (statistics); Disjoint union (topology); Sequence (biology); Trivially perfect graph; Vertex (graph theory); Perfect graph theorem; Discrete mathematics; Graph; Chordal graph; Line graph","score_opus":0.012942487928348389,"score_gpt":0.25176984118123863,"score_spread":0.23882735325289023,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2138849026","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051729493,0.0004355785,0.8265084,0.000498338,0.0005983108,0.00037902695,0.0010145318,0.0020209,0.11681545],"genre_scores_gemma":[0.5667262,0.0007824338,0.3342124,0.00056354253,0.0002695133,0.00042832986,0.0033490937,0.0016291387,0.09203947],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982315,0.00023268523,0.000099068304,0.0005092011,0.00070467585,0.00022279275],"domain_scores_gemma":[0.9985923,0.0002190477,0.00010837826,0.00064737845,0.00031865723,0.00011422065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000846978,0.00086367986,0.00095300714,0.0024202724,0.0012516702,0.0023663717,0.0017260597,0.0016347776,0.032562017],"category_scores_gemma":[0.005486529,0.0005638578,0.0011178108,0.00209486,0.0011157597,0.003673207,0.0040963367,0.0018652369,0.00914796],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027578507,0.00014819742,0.0007386482,0.00015925636,0.00004282241,0.00033752745,0.00022789936,0.008722265,0.016182665,0.7089222,0.016288267,0.24795434],"study_design_scores_gemma":[0.000066385495,0.00017059232,0.00065692817,0.000063360225,0.000059228674,0.00085810997,0.00027098518,0.05718276,0.025474634,0.82974684,0.08540216,0.00004798067],"about_ca_topic_score_codex":0.00046402414,"about_ca_topic_score_gemma":0.00048534473,"teacher_disagreement_score":0.032562017,"about_ca_system_score_codex":0.00061776885,"about_ca_system_score_gemma":0.00072080403,"threshold_uncertainty_score":0.108930826},"labels":[],"label_agreement":null},{"id":"W2141906371","doi":"10.1016/j.comgeo.2008.02.005","title":"Small weak epsilon-nets","year":2009,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Combinatorics; Mathematics; Set (abstract data type); Plane (geometry); Regular polygon; Point (geometry); Net (polyhedron); Discrete mathematics; Geometry; Computer science","score_opus":0.026139969051359662,"score_gpt":0.25126125309546166,"score_spread":0.225121284044102,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141906371","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24203703,0.00087519566,0.65468985,0.0009951548,0.00057046965,0.00009164068,0.0002484838,0.0005559314,0.09993622],"genre_scores_gemma":[0.83085847,0.000743691,0.09015503,0.0004678178,0.00017169105,0.00018093247,0.0003579301,0.00043587454,0.0766287],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996877,0.00007569028,0.000014947259,0.000048838057,0.000119006916,0.00005393156],"domain_scores_gemma":[0.9985274,0.000704835,0.00008415798,0.00018110295,0.00025748045,0.000245036],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008258192,0.00097241614,0.00070633256,0.0013227327,0.00091797963,0.0013197649,0.0011192817,0.00093695434,0.009851386],"category_scores_gemma":[0.0036013643,0.00047618328,0.00059721246,0.0004327303,0.0015513721,0.0024426058,0.0028208082,0.002035991,0.00085866044],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022472058,0.00004609602,0.00051593315,0.00011396868,0.00002492653,0.00013461104,0.00007899644,0.020095164,0.00531325,0.9489135,0.0021770291,0.022361869],"study_design_scores_gemma":[0.000029454575,0.00007572749,0.00032083882,0.00003665562,0.000020232328,0.00012688768,0.000049334703,0.08982085,0.003976182,0.8999453,0.005584656,0.0000138479745],"about_ca_topic_score_codex":0.00043031375,"about_ca_topic_score_gemma":0.00077205134,"teacher_disagreement_score":0.009851386,"about_ca_system_score_codex":0.0007590913,"about_ca_system_score_gemma":0.00042998084,"threshold_uncertainty_score":0.032956183},"labels":[],"label_agreement":null},{"id":"W2144232842","doi":"10.1016/j.comgeo.2004.05.005","title":"The one-round Voronoi game replayed","year":2004,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":47,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Voronoi diagram; Computer science; Computer graphics (images); Mathematics; Geometry","score_opus":0.034548568441611374,"score_gpt":0.2907720741755746,"score_spread":0.25622350573396324,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144232842","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32065415,0.00032945842,0.62066096,0.0012943863,0.00054708053,0.00031596565,0.000791129,0.0011278378,0.054279055],"genre_scores_gemma":[0.92596644,0.000081948805,0.05985608,0.00012332712,0.000027840464,0.000114505034,0.0003263298,0.00013034976,0.01337317],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99832696,0.00064040447,0.00007395101,0.00028881262,0.00037904084,0.00029084858],"domain_scores_gemma":[0.9965121,0.0017122104,0.00017872447,0.00079157646,0.00041303562,0.00039242834],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011927503,0.00063552096,0.0014485002,0.00048095462,0.0012402211,0.001603125,0.002453412,0.0021709402,0.0108011635],"category_scores_gemma":[0.01117947,0.0003756169,0.00078036863,0.00046993548,0.0014888544,0.0025676738,0.0030657111,0.0014679709,0.0012882444],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004094829,0.00022578686,0.0017526497,0.00034709316,0.00023393678,0.0012046325,0.0009595731,0.4432998,0.0107934605,0.45450526,0.011405582,0.07117741],"study_design_scores_gemma":[0.00014656628,0.0002139904,0.00024727106,0.00002590841,0.000028890132,0.00023883735,0.00021554287,0.83659077,0.0028276474,0.15473346,0.004685907,0.00004523987],"about_ca_topic_score_codex":0.004681276,"about_ca_topic_score_gemma":0.0036416848,"teacher_disagreement_score":0.0108011635,"about_ca_system_score_codex":0.000947364,"about_ca_system_score_gemma":0.0015300317,"threshold_uncertainty_score":0.036133528},"labels":[],"label_agreement":null},{"id":"W2144614313","doi":"10.1016/j.comgeo.2014.12.005","title":"Geometric red–blue set cover for unit squares and related problems","year":2014,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":47,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Cover (algebra); Set cover problem; Set (abstract data type); Mathematics; Square (algebra); Point (geometry); Combinatorics; Algorithm; Unit (ring theory); Computer science; Geometry","score_opus":0.02210877508890676,"score_gpt":0.2567454458011689,"score_spread":0.23463667071226216,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144614313","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11569175,0.0024671634,0.82956874,0.0022999696,0.00039009732,0.00013991076,0.0006248731,0.0005464058,0.04827117],"genre_scores_gemma":[0.6503979,0.0019395961,0.29842407,0.0006710894,0.0005143478,0.00031880348,0.0014682577,0.0007585397,0.04550736],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99910754,0.00029402698,0.000026111387,0.00014391851,0.00031727075,0.0001111727],"domain_scores_gemma":[0.99803287,0.0013464526,0.00012270357,0.00024317748,0.00012426404,0.00013061566],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076756405,0.00092900114,0.0014369902,0.0011501599,0.0012748276,0.0017458892,0.0020652628,0.001980595,0.009623294],"category_scores_gemma":[0.005239985,0.00071983406,0.00084219244,0.0015438616,0.0018372622,0.002365534,0.0030279977,0.0024326202,0.00102408],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002925574,0.000120447105,0.0007947743,0.00040835777,0.00006543551,0.00021581913,0.00028393467,0.26817772,0.003232704,0.5996701,0.024431905,0.102306135],"study_design_scores_gemma":[0.00002934452,0.00004712935,0.0003487266,0.00004262308,0.000015242404,0.00017507038,0.00009932815,0.49977165,0.0013216739,0.4893131,0.008815963,0.000020235006],"about_ca_topic_score_codex":0.0031783038,"about_ca_topic_score_gemma":0.0022052682,"teacher_disagreement_score":0.009623294,"about_ca_system_score_codex":0.0012250714,"about_ca_system_score_gemma":0.00056188536,"threshold_uncertainty_score":0.032193124},"labels":[],"label_agreement":null},{"id":"W2148125855","doi":"10.1016/s0925-7721(02)00091-3","title":"Ununfoldable polyhedra with convex faces","year":2002,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":70,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; University of Waterloo","funders":"","keywords":"Polyhedron; Regular polygon; Convex polytope; Combinatorics; Polygon (computer graphics); Mathematics; Integer points in convex polyhedra; Convex set; Geometry; Computer science; Algorithm; Convex optimization; Linear programming","score_opus":0.016896247971182672,"score_gpt":0.20738663426013443,"score_spread":0.19049038628895176,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148125855","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.089224786,0.00032105824,0.88595355,0.00026476587,0.00022525548,0.00010318476,0.00035106446,0.000482363,0.023073928],"genre_scores_gemma":[0.50182724,0.00058231706,0.46999764,0.00013984834,0.000088064,0.00016209067,0.0009312263,0.0006819211,0.025589714],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995509,0.00008010304,0.000028372719,0.00007496305,0.00020771699,0.000057955247],"domain_scores_gemma":[0.9994205,0.00019334971,0.000057199544,0.00015665182,0.00011424737,0.000058017467],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036220468,0.00087245647,0.0008123213,0.00070872286,0.000682916,0.0013914924,0.0014063529,0.0008044051,0.007092398],"category_scores_gemma":[0.0018505052,0.00067261624,0.0005365366,0.00062892423,0.0010913439,0.002076136,0.0026487994,0.0016364005,0.0013581022],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003043133,0.00013243087,0.0014421426,0.00034430507,0.000041367875,0.000928982,0.00051930785,0.2771722,0.021292793,0.44019932,0.010201572,0.24742126],"study_design_scores_gemma":[0.000035998448,0.00011081071,0.000711655,0.00007421975,0.00001938416,0.00055046956,0.00032037107,0.68977726,0.01534866,0.2724037,0.020617377,0.000030147468],"about_ca_topic_score_codex":0.0010135889,"about_ca_topic_score_gemma":0.0015151903,"teacher_disagreement_score":0.007092398,"about_ca_system_score_codex":0.00039714703,"about_ca_system_score_gemma":0.00041295655,"threshold_uncertainty_score":0.023726404},"labels":[],"label_agreement":null},{"id":"W2152588767","doi":"10.1016/j.comgeo.2006.05.002","title":"Distance-preserving approximations of polygonal paths","year":2006,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Combinatorics; Path (computing); Mathematics; Line (geometry); Line segment; Enhanced Data Rates for GSM Evolution; Approximation algorithm; Discrete mathematics; Geometry; Computer science; Artificial intelligence","score_opus":0.009945846924860217,"score_gpt":0.22954590258253937,"score_spread":0.21960005565767915,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152588767","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044779878,0.0001670995,0.94919515,0.0000674531,0.000043775603,0.000041969506,0.00012033741,0.0002886857,0.0052957046],"genre_scores_gemma":[0.49234706,0.0005663212,0.49928778,0.00004638825,0.000036888756,0.000082038205,0.00045715625,0.0003104577,0.006865835],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99964166,0.00006867834,0.00001612495,0.000048892056,0.00019639227,0.000028270657],"domain_scores_gemma":[0.9988532,0.00058688695,0.00009718541,0.0002204953,0.00017657703,0.00006563802],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043103902,0.00053439784,0.0005475648,0.0010255822,0.00034909364,0.0012700362,0.0011682743,0.0006360272,0.0025715576],"category_scores_gemma":[0.0045204833,0.00046703345,0.00041569187,0.0009957659,0.00078247336,0.0011423271,0.0013264739,0.0013043717,0.0005626284],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002216178,0.0000769233,0.0008715143,0.00016931124,0.000025748686,0.0001401518,0.0003124671,0.6981041,0.0075038723,0.15936603,0.0020155173,0.13119274],"study_design_scores_gemma":[0.000010518601,0.000033126587,0.000098466604,0.000014661207,0.0000056954764,0.00006343202,0.00004547467,0.95979846,0.002262284,0.034140576,0.0035204806,0.0000068742174],"about_ca_topic_score_codex":0.0018371886,"about_ca_topic_score_gemma":0.002618671,"teacher_disagreement_score":0.0025715576,"about_ca_system_score_codex":0.00061241916,"about_ca_system_score_gemma":0.00046651464,"threshold_uncertainty_score":0.008602679},"labels":[],"label_agreement":null},{"id":"W2155081398","doi":"10.1016/j.comgeo.2004.08.003","title":"Geometric permutations of disjoint unit spheres","year":2004,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Institut national de recherche en informatique et en automatique (INRIA); McGill University","keywords":"Disjoint sets; Unit (ring theory); Combinatorics; SPHERES; Mathematics; Computer science; Physics; Mathematics education","score_opus":0.022113234651374533,"score_gpt":0.2633978648622475,"score_spread":0.24128463021087293,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155081398","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27348387,0.0005430999,0.57977307,0.00069840293,0.0010255045,0.00028137575,0.00056869333,0.0009343712,0.14269175],"genre_scores_gemma":[0.7292396,0.0006736838,0.20892695,0.00034526965,0.0002256573,0.00044707218,0.0015704092,0.0009014267,0.05766988],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986608,0.00033306185,0.000102303165,0.00021454475,0.00045255062,0.0002368558],"domain_scores_gemma":[0.9988042,0.0003489939,0.00014289153,0.0002871853,0.00024172453,0.00017508105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049331476,0.0007247125,0.0009478235,0.0018953057,0.0019132103,0.0025484154,0.0016501601,0.0010404538,0.014265],"category_scores_gemma":[0.0036726175,0.0007001991,0.00084224856,0.0017437547,0.00201238,0.0021165453,0.0034266638,0.0018523044,0.0031415364],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012299686,0.000039224717,0.00030322006,0.00004988264,0.000011904684,0.0001731511,0.00019565262,0.0056470935,0.0029786502,0.94880444,0.0037283562,0.037945267],"study_design_scores_gemma":[0.000053806412,0.00007948547,0.0004795622,0.000030887906,0.000020139285,0.0004029751,0.00032419479,0.028968085,0.0059700496,0.92546415,0.0381721,0.000034552526],"about_ca_topic_score_codex":0.0009914964,"about_ca_topic_score_gemma":0.0010952319,"teacher_disagreement_score":0.014265,"about_ca_system_score_codex":0.00077804003,"about_ca_system_score_gemma":0.00076779525,"threshold_uncertainty_score":0.047721207},"labels":[],"label_agreement":null},{"id":"W2161217328","doi":"10.1016/j.comgeo.2012.10.012","title":"Making triangulations 4-connected using flips","year":2012,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Triangulation; Upper and lower bounds; Mathematics; Matching (statistics); Enhanced Data Rates for GSM Evolution; Graph; Connectivity; Discrete mathematics; Computer science; Geometry; Artificial intelligence; Mathematical analysis","score_opus":0.12301935982546466,"score_gpt":0.3872212644220547,"score_spread":0.26420190459659,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2161217328","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13470285,0.00029963616,0.8211379,0.0006151184,0.0005835316,0.0002304693,0.00037033486,0.001597507,0.04046271],"genre_scores_gemma":[0.516205,0.0006108627,0.45313272,0.00040484424,0.00019517409,0.00031102356,0.0007062377,0.0014317894,0.027002398],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992186,0.00014299172,0.000048675032,0.00021656168,0.0002354616,0.00013758331],"domain_scores_gemma":[0.99819607,0.0006129655,0.00015641288,0.0006026342,0.00024569937,0.00018628506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005577288,0.0012210923,0.00096486736,0.0018600523,0.0013588443,0.0016174559,0.0015458569,0.0013666385,0.02076982],"category_scores_gemma":[0.0038687163,0.0010815808,0.0012951449,0.0013111333,0.0024704237,0.0036231931,0.005196805,0.0025599648,0.0032620819],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044325538,0.00015932652,0.0011136682,0.0005186729,0.00010296668,0.00048754,0.0013350962,0.053523347,0.0344138,0.63046277,0.011167957,0.2662715],"study_design_scores_gemma":[0.00011296829,0.0001863012,0.00052164996,0.00013288773,0.000086113876,0.00031388883,0.0009603981,0.09286757,0.019855581,0.84216833,0.042729683,0.00006450763],"about_ca_topic_score_codex":0.0010409128,"about_ca_topic_score_gemma":0.0019948331,"teacher_disagreement_score":0.02076982,"about_ca_system_score_codex":0.00062038715,"about_ca_system_score_gemma":0.00039052436,"threshold_uncertainty_score":0.06948191},"labels":[],"label_agreement":null},{"id":"W2164869170","doi":"10.1016/j.comgeo.2012.02.008","title":"Bounded-degree polyhedronization of point sets","year":2012,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; University of Waterloo; Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Combinatorics; Bounded function; Polyhedron; Mathematics; Degree (music); Tetrahedron; Point (geometry); Set (abstract data type); Discrete mathematics; Computer science; Geometry; Physics","score_opus":0.03113578831950992,"score_gpt":0.27255014424967516,"score_spread":0.24141435593016525,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2164869170","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01975313,0.0000893886,0.9725184,0.00010326834,0.00003800983,0.00005373901,0.0001875962,0.00023893382,0.0070175873],"genre_scores_gemma":[0.5180176,0.00047112958,0.4654809,0.0001519963,0.00007599477,0.0002066974,0.0012937451,0.00060977973,0.013692122],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99904794,0.0001807738,0.00005256655,0.00015364592,0.00045636584,0.000108773944],"domain_scores_gemma":[0.99850416,0.00045231095,0.00008546719,0.0004596795,0.0003814782,0.000116898584],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000570988,0.0006210243,0.0010464934,0.0010229796,0.0006721603,0.0021153823,0.002217726,0.000800413,0.007695425],"category_scores_gemma":[0.0036117516,0.00051550125,0.0009065303,0.0010036258,0.0011911149,0.001989241,0.003267328,0.0027656092,0.0016010168],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023354814,0.0001340736,0.0010912823,0.00028227115,0.000037195652,0.00013139765,0.00038226627,0.29460466,0.012612888,0.50085753,0.007951519,0.18168132],"study_design_scores_gemma":[0.000018771349,0.000052395015,0.00030603816,0.000034154356,0.000010277634,0.000099679666,0.00010253448,0.8028998,0.0044391905,0.18314481,0.00887503,0.000017243918],"about_ca_topic_score_codex":0.0019799995,"about_ca_topic_score_gemma":0.0032242844,"teacher_disagreement_score":0.007695425,"about_ca_system_score_codex":0.0007576492,"about_ca_system_score_gemma":0.00052980916,"threshold_uncertainty_score":0.025743783},"labels":[],"label_agreement":null},{"id":"W2165136719","doi":"10.1016/j.comgeo.2014.08.005","title":"The <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" overflow=\"scroll\"><mml:msub><mml:mrow><mml:mi>θ</mml:mi></mml:mrow><mml:mrow><mml:mn>5</mml:mn></mml:mrow></mml:msub></mml:math>-graph is a spanner","year":2014,"lang":"lv","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Spanner; Upper and lower bounds; Constant (computer programming); Path (computing); Constructive; Euclidean geometry","score_opus":0.017426892930790052,"score_gpt":0.24076703444921374,"score_spread":0.22334014151842368,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2165136719","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016400053,0.0003737787,0.2529199,0.0030987654,0.0021039906,0.0004319736,0.17984287,0.14507824,0.41451046],"genre_scores_gemma":[0.023368936,0.0013895446,0.16911875,0.0020465052,0.00076708966,0.0008658526,0.28400448,0.16775644,0.3506824],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99927837,0.000113757895,0.00008437459,0.000117789,0.00033396934,0.00007176721],"domain_scores_gemma":[0.997696,0.000553529,0.00009014496,0.000674779,0.00080073474,0.0001846977],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00085423654,0.0014674957,0.0009848155,0.0023228796,0.0010698533,0.0044974186,0.0028485805,0.0018319241,0.51017416],"category_scores_gemma":[0.0048798174,0.0011553201,0.0011098001,0.0036927373,0.00068382226,0.0046340222,0.0027960474,0.0023302021,0.441121],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006557321,0.000028622728,0.00014930093,0.00022673003,0.000009023683,0.00005629598,0.00008633503,0.0006158171,0.002207814,0.025379224,0.9283198,0.04285542],"study_design_scores_gemma":[0.00002797199,0.000011251547,0.0002782304,0.000057569723,0.0000052682212,0.00010216255,0.000051233757,0.00241553,0.004166936,0.013735077,0.9791205,0.000028174525],"about_ca_topic_score_codex":0.0070834644,"about_ca_topic_score_gemma":0.007876606,"teacher_disagreement_score":0.51017416,"about_ca_system_score_codex":0.0014122751,"about_ca_system_score_gemma":0.0014927399,"threshold_uncertainty_score":0.69867706},"labels":[],"label_agreement":null},{"id":"W2166510145","doi":"10.1016/j.comgeo.2011.10.003","title":"The ordinary line problem revisited","year":2011,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Windsor","funders":"","keywords":"Line (geometry); Combinatorics; Plane (geometry); Mathematics; Set (abstract data type); Line segment; Geometry; Computer science","score_opus":0.03206935846472095,"score_gpt":0.2505453540429038,"score_spread":0.21847599557818284,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2166510145","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046337347,0.0138389,0.6774366,0.040542275,0.0025738324,0.000049411192,0.00031565837,0.00032311457,0.21858284],"genre_scores_gemma":[0.69226336,0.012846792,0.1553658,0.0067018303,0.005653705,0.00017190029,0.00055858947,0.00048194267,0.12595597],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99933356,0.00027243877,0.000025393856,0.00012599936,0.00018571962,0.000056822475],"domain_scores_gemma":[0.9990004,0.000512989,0.00009160733,0.00011333463,0.00017273064,0.000109097775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010077573,0.0005094398,0.00083137886,0.0010941885,0.0008585889,0.0022365213,0.0017247307,0.0025338274,0.012444748],"category_scores_gemma":[0.0041808086,0.00033667663,0.000578439,0.0010088149,0.0031924313,0.0057022264,0.0025441842,0.003225299,0.0014056286],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010635312,0.00000913489,0.00006493401,0.000040135525,0.000006315207,0.00004309512,0.000046662928,0.0021774971,0.00014583161,0.98502374,0.0049368837,0.0074951365],"study_design_scores_gemma":[0.000015553429,0.000009004647,0.00007101452,0.000020011814,0.0000036704391,0.00009959079,0.000076685916,0.016210482,0.00012890095,0.97035,0.01300813,0.000006926036],"about_ca_topic_score_codex":0.0009812266,"about_ca_topic_score_gemma":0.0007817523,"teacher_disagreement_score":0.012444748,"about_ca_system_score_codex":0.00072745397,"about_ca_system_score_gemma":0.0005847653,"threshold_uncertainty_score":0.04163176},"labels":[],"label_agreement":null},{"id":"W2168580558","doi":"10.1016/j.comgeo.2012.03.003","title":"On point-sets that support planar graphs","year":2012,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge; Queen's University; University of British Columbia; Carleton University","funders":"","keywords":"Combinatorics; Planar; Planar graph; Mathematics; Point (geometry); Graph; Enhanced Data Rates for GSM Evolution; Discrete mathematics; Geometry; Computer science","score_opus":0.026485703198645155,"score_gpt":0.2677572371555159,"score_spread":0.24127153395687076,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168580558","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19084653,0.00066945306,0.7880248,0.00064611697,0.00010198204,0.00014702833,0.0005981889,0.0004354989,0.018530427],"genre_scores_gemma":[0.7598435,0.0013050907,0.22054987,0.00020782762,0.00015954311,0.00018740883,0.0017436825,0.00037810535,0.015624935],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990846,0.00018643081,0.00004643454,0.00012763965,0.0004380792,0.000116810144],"domain_scores_gemma":[0.99668187,0.0020819386,0.0003033095,0.00032187704,0.00038289913,0.00022797348],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066032604,0.001214502,0.0014482113,0.002934818,0.0010220016,0.001997782,0.002579752,0.002138145,0.005963615],"category_scores_gemma":[0.0073219747,0.0010862822,0.0009872608,0.0028139225,0.0018173687,0.002848678,0.004266257,0.0021250136,0.0013107868],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024247417,0.0001213887,0.0017867972,0.0003103548,0.000060666833,0.0005624973,0.0005558065,0.3294354,0.0071367957,0.58112174,0.004999283,0.07366673],"study_design_scores_gemma":[0.00002914523,0.0000421847,0.000379864,0.000049053502,0.000013374988,0.00018897324,0.00015432728,0.4695341,0.001464315,0.5251163,0.0030095247,0.000018791481],"about_ca_topic_score_codex":0.0020386328,"about_ca_topic_score_gemma":0.0018724317,"teacher_disagreement_score":0.005963615,"about_ca_system_score_codex":0.00074937294,"about_ca_system_score_gemma":0.00031792134,"threshold_uncertainty_score":0.01995033},"labels":[],"label_agreement":null},{"id":"W2171133375","doi":"10.1016/j.comgeo.2012.04.006","title":"Some properties of k-Delaunay and k-Gabriel graphs","year":2012,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Universitatea \"Lucian Blaga\" din Sibiu","keywords":"Combinatorics; Mathematics; Delaunay triangulation; Chordal graph; Partition (number theory); 1-planar graph; Chromatic scale; Discrete mathematics; Graph","score_opus":0.023881423688665235,"score_gpt":0.23435551287742218,"score_spread":0.21047408918875693,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2171133375","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49301437,0.0035174885,0.3653982,0.0035265977,0.00026828647,0.00015100616,0.0010317212,0.00057308015,0.13251929],"genre_scores_gemma":[0.9070565,0.0027608126,0.06632296,0.0005290273,0.0003318425,0.00019067162,0.0009453827,0.0003865487,0.02147628],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992518,0.00015110035,0.00005271323,0.00018104585,0.00026535356,0.00009791191],"domain_scores_gemma":[0.99313086,0.003789077,0.0010448471,0.000539677,0.0009202853,0.00057527574],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010715087,0.0007404608,0.0007838166,0.0031173325,0.0020797974,0.004007995,0.002014112,0.0014744399,0.008225775],"category_scores_gemma":[0.009079514,0.00096852944,0.0008796293,0.0029965504,0.0032803458,0.0059285876,0.00217294,0.0022479338,0.0010817224],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006845424,0.00003281596,0.0009923885,0.00011377427,0.000016901005,0.00015999988,0.00061025657,0.009592584,0.0015000247,0.96828806,0.0023197094,0.016305147],"study_design_scores_gemma":[0.000023855959,0.000038530347,0.00095207174,0.000039991734,0.00002394097,0.0004175704,0.00044320463,0.03512521,0.0013944617,0.9534517,0.008056236,0.000033259927],"about_ca_topic_score_codex":0.0032409069,"about_ca_topic_score_gemma":0.0029266665,"teacher_disagreement_score":0.008225775,"about_ca_system_score_codex":0.0015942923,"about_ca_system_score_gemma":0.00069813954,"threshold_uncertainty_score":0.027517915},"labels":[],"label_agreement":null},{"id":"W2172263801","doi":"10.1016/j.comgeo.2016.06.001","title":"Probing convex polygons with a wedge","year":2016,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Omega; Wedge (geometry); Regular polygon; Combinatorics; Polygon (computer graphics); Orientation (vector space); Physics; Geometry; Convex polygon; Mathematics; Computer science","score_opus":0.01447344354937682,"score_gpt":0.24694983642336288,"score_spread":0.23247639287398605,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2172263801","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0931353,0.00013134087,0.895908,0.00029878234,0.000072211,0.00007272768,0.00015683715,0.00040672993,0.009817984],"genre_scores_gemma":[0.56067574,0.0001946614,0.43337646,0.00017115343,0.00003081892,0.00011447735,0.00027067342,0.00020915913,0.0049569616],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992536,0.00019144166,0.00004203202,0.00015887289,0.00026944175,0.00008453987],"domain_scores_gemma":[0.9985746,0.00078086165,0.000090345755,0.0003596814,0.0000914749,0.00010311455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006737627,0.00061486824,0.00087767944,0.0006968138,0.00044375917,0.001123451,0.0009552404,0.0010694162,0.0048564123],"category_scores_gemma":[0.0042589162,0.00086929614,0.0006725323,0.00064975454,0.001032208,0.002124407,0.0035993184,0.0016926902,0.0007395769],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013132626,0.00044482952,0.0049947537,0.00047783362,0.000100488396,0.0014425225,0.0009221452,0.24690305,0.11046621,0.3907431,0.007280227,0.23491165],"study_design_scores_gemma":[0.000058985606,0.00019408722,0.00044873642,0.00004274172,0.00001699808,0.00049136695,0.00025825476,0.856753,0.019564977,0.11585456,0.006287464,0.000028842329],"about_ca_topic_score_codex":0.00041094844,"about_ca_topic_score_gemma":0.00034494148,"teacher_disagreement_score":0.0048564123,"about_ca_system_score_codex":0.00036646237,"about_ca_system_score_gemma":0.00031322442,"threshold_uncertainty_score":0.016246319},"labels":[],"label_agreement":null},{"id":"W2172997417","doi":"10.1016/s0925-7721(00)00021-3","title":"Chromatic nearest neighbor searching: A query sensitive approach☆☆A preliminary version of this paper appeared in the Proceedings of the 7th Canadian Conference on Computational Geometry, 1995, pp. 261–266.","year":2000,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"k-nearest neighbors algorithm; Nearest neighbor graph; Preprocessor; Nearest-neighbor chain algorithm; Nearest neighbor search; Best bin first; Computer science; Context (archaeology); Point (geometry); Fixed-radius near neighbors; Chromatic scale; Pattern recognition (psychology); Set (abstract data type); Algorithm; Mathematics; Artificial intelligence; Data mining; Combinatorics; Cluster analysis; Geography; Geometry","score_opus":0.015749243285038423,"score_gpt":0.22757780571054984,"score_spread":0.2118285624255114,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2172997417","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026230544,0.0011060802,0.955012,0.001122033,0.0009618969,0.00059799635,0.001032103,0.0043367213,0.009600553],"genre_scores_gemma":[0.29896277,0.0011506472,0.67249775,0.00066737836,0.0006720293,0.000294231,0.0033362815,0.0009890586,0.021429887],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966433,0.00064218027,0.00015819758,0.0007468425,0.0014852099,0.0003242436],"domain_scores_gemma":[0.99472225,0.0014452405,0.00014073911,0.0021518818,0.0013147342,0.00022519364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018661079,0.00095870916,0.0018400494,0.0014985244,0.0016628467,0.002027399,0.004430367,0.0013792305,0.019091094],"category_scores_gemma":[0.008576974,0.0006066814,0.00079335325,0.0041506346,0.0015367036,0.0043643126,0.004288715,0.0015263,0.0033805477],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0025302828,0.00072071457,0.0029703362,0.0006554694,0.00024879415,0.0005242905,0.0007225527,0.08321907,0.04604144,0.07888974,0.115301915,0.6681754],"study_design_scores_gemma":[0.00018536895,0.00033804507,0.0009865068,0.000033290682,0.0000834851,0.00051841856,0.0002396767,0.9069695,0.020749463,0.031211212,0.038564462,0.0001205922],"about_ca_topic_score_codex":0.014122872,"about_ca_topic_score_gemma":0.026135538,"teacher_disagreement_score":0.019091094,"about_ca_system_score_codex":0.001577736,"about_ca_system_score_gemma":0.0021650551,"threshold_uncertainty_score":0.06386608},"labels":[],"label_agreement":null},{"id":"W2184436935","doi":"10.1016/j.comgeo.2022.101859","title":"Edge guards for polyhedra in three-space","year":2022,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada; Universidad Nacional Autónoma de México; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Polyhedron; Dual polyhedron; Guard (computer science); Combinatorics; Enhanced Data Rates for GSM Evolution; Mathematics; Computer science; Artificial intelligence","score_opus":0.0211046398829006,"score_gpt":0.26661800213189873,"score_spread":0.24551336224899814,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2184436935","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029315656,0.00015732819,0.96210986,0.00010012576,0.00013331353,0.00009814019,0.00035787368,0.0014896409,0.006237992],"genre_scores_gemma":[0.30629838,0.00030652218,0.6828487,0.00013913633,0.000048066624,0.00019880281,0.0012165328,0.0012490116,0.0076947575],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99961436,0.000056694276,0.00002818732,0.000058738566,0.00017462151,0.000067358415],"domain_scores_gemma":[0.99929416,0.00022773506,0.000053204367,0.00021992467,0.00013673352,0.00006820457],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053612026,0.00048894744,0.00064029195,0.00075921824,0.00073550764,0.0011718543,0.0013467143,0.0006375943,0.009070561],"category_scores_gemma":[0.0023529867,0.0003807093,0.0005360582,0.0007707495,0.0012779094,0.0011826786,0.0021750934,0.0019785904,0.0019354001],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006773713,0.00016004099,0.0013796929,0.00033457164,0.000021669337,0.00024490835,0.00048444315,0.069617756,0.013796748,0.55357087,0.012321216,0.3473908],"study_design_scores_gemma":[0.0001252322,0.00020317463,0.00059467537,0.00017283346,0.000027552582,0.00020235359,0.00031359732,0.51679486,0.021849817,0.4060442,0.0536306,0.000041177565],"about_ca_topic_score_codex":0.0018528628,"about_ca_topic_score_gemma":0.003151974,"teacher_disagreement_score":0.009070561,"about_ca_system_score_codex":0.00042958322,"about_ca_system_score_gemma":0.00067313924,"threshold_uncertainty_score":0.030344069},"labels":[],"label_agreement":null},{"id":"W2196668152","doi":"10.1016/s0925-7721(99)00056-5","title":"Folding flat silhouettes and wrapping polyhedral packages: New results in computational origami","year":2000,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Advanced Materials and Mechanics","field":"Engineering","cited_by":100,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"STRIPS; Polyhedron; Silhouette; Folding (DSP implementation); Geometry; Computer science; Planar; Constructive; Topology (electrical circuits); Algorithm; Mathematics; Computer graphics (images); Combinatorics; Computer vision; Structural engineering; Engineering; Process (computing)","score_opus":0.010353722151738014,"score_gpt":0.2256887576563461,"score_spread":0.21533503550460809,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2196668152","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051273182,0.0008806785,0.941425,0.00020156124,0.00009651426,0.000030959036,0.00006642741,0.0006453799,0.0053802542],"genre_scores_gemma":[0.4326014,0.0021511551,0.55637294,0.00025803916,0.00018479044,0.00021647263,0.00044896928,0.0015458422,0.0062203724],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995697,0.0001364549,0.00002267567,0.00006415916,0.00017709135,0.000029972874],"domain_scores_gemma":[0.998403,0.0010233453,0.000073522395,0.00032044886,0.00012021739,0.00005940464],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071175816,0.0009536412,0.0011916079,0.00090784195,0.00059062935,0.0015238624,0.0013620185,0.0011932998,0.0022983633],"category_scores_gemma":[0.0045161247,0.0007879362,0.0009693164,0.0013694853,0.0020212394,0.0025687169,0.0028203428,0.0024808224,0.0008831948],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016038449,0.00015738388,0.000810396,0.00028344966,0.00007688088,0.00011637365,0.0006166008,0.4767311,0.007504138,0.30404955,0.0041426336,0.20535116],"study_design_scores_gemma":[0.000018931318,0.00003778096,0.00012369671,0.000018863646,0.000014055366,0.000022490633,0.00003583735,0.8821747,0.0023040876,0.11226956,0.0029619834,0.000018083487],"about_ca_topic_score_codex":0.0008721926,"about_ca_topic_score_gemma":0.00086162495,"teacher_disagreement_score":0.0022983633,"about_ca_system_score_codex":0.00032703448,"about_ca_system_score_gemma":0.00032637134,"threshold_uncertainty_score":0.0076887608},"labels":[],"label_agreement":null},{"id":"W2202662702","doi":"10.1016/j.comgeo.2012.11.007","title":"Dynamic well-spaced point sets","year":2012,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Autodesk (Canada)","funders":"","keywords":"Voronoi diagram; Bounded function; Point (geometry); Mathematics; Constant (computer programming); Upper and lower bounds; Set (abstract data type); Computation; Measure (data warehouse); Computational geometry; Polygon mesh; Combinatorics; Amortized analysis; Dynamic programming; Algorithm; Discrete mathematics; Computer science; Data structure; Geometry; Mathematical analysis; Data mining","score_opus":0.01212228442157507,"score_gpt":0.26535760411197173,"score_spread":0.25323531969039664,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2202662702","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02756682,0.00020649085,0.9652574,0.00019232238,0.000082827966,0.000043916247,0.00011801374,0.00020330888,0.006328911],"genre_scores_gemma":[0.55326355,0.00060604635,0.42738962,0.0001747217,0.000085379754,0.00021360222,0.000630284,0.00034618363,0.017290534],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99922836,0.00012997747,0.00004092268,0.0001598566,0.000375269,0.000065663604],"domain_scores_gemma":[0.9987098,0.00045445186,0.0001024651,0.0003455254,0.00027894852,0.00010880269],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010445844,0.0006665911,0.0010750429,0.0012869653,0.00073725753,0.0016791862,0.0018495612,0.0017332218,0.0089172395],"category_scores_gemma":[0.005097603,0.00089668774,0.0005720276,0.0011649377,0.0010714628,0.0030200505,0.003170607,0.0019502058,0.001803167],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023222518,0.00012312703,0.0009981644,0.00010625273,0.00003811992,0.00018609488,0.00017879819,0.6897455,0.009476957,0.21397232,0.003010606,0.08193191],"study_design_scores_gemma":[0.00002056719,0.0000413512,0.00012531324,0.000016347505,0.000007145756,0.000088456494,0.00004951385,0.9157139,0.002504572,0.07798827,0.0034315188,0.0000130553235],"about_ca_topic_score_codex":0.00061391963,"about_ca_topic_score_gemma":0.00094268733,"teacher_disagreement_score":0.0089172395,"about_ca_system_score_codex":0.0007163757,"about_ca_system_score_gemma":0.00049961935,"threshold_uncertainty_score":0.029831171},"labels":[],"label_agreement":null},{"id":"W2207300025","doi":"10.1016/j.comgeo.2010.04.003","title":"A general approach for cache-oblivious range reporting and approximate range counting","year":2010,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Range (aeronautics); Range query (database); Cache; Upper and lower bounds; Computer science; Mathematics; Linear space; Corollary; Data structure; Block (permutation group theory); Combinatorics; Web search query; Parallel computing; Sargable; Search engine; Information retrieval","score_opus":0.03599642114052546,"score_gpt":0.29118629184087824,"score_spread":0.25518987070035276,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2207300025","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017332417,0.00047792896,0.9907506,0.0006874682,0.00014747687,0.00012093355,0.0002025967,0.0005451339,0.005334681],"genre_scores_gemma":[0.16217595,0.0018752973,0.81357664,0.001215013,0.0010438706,0.0010710331,0.0008232243,0.00091404543,0.017304989],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.990854,0.0022713002,0.00059405604,0.0018378804,0.0034797837,0.00096296804],"domain_scores_gemma":[0.9863929,0.0047942325,0.0005579686,0.006498261,0.0014336355,0.0003229597],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048296894,0.0024204738,0.0039602234,0.0035351017,0.0026996918,0.007298486,0.010538022,0.0041841688,0.011527764],"category_scores_gemma":[0.025619164,0.0016087336,0.0037246908,0.00880075,0.0039893496,0.018729974,0.010476978,0.008456079,0.0031024683],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001299552,0.00011910413,0.0002693276,0.00026987348,0.00008343517,0.000075438445,0.00017896743,0.055467412,0.0020279184,0.8584455,0.013056428,0.0698766],"study_design_scores_gemma":[0.00003217019,0.00004656079,0.00009862494,0.000046491037,0.00006964929,0.00017974363,0.000051297622,0.29143965,0.0019519046,0.69497365,0.011061684,0.00004853678],"about_ca_topic_score_codex":0.002989659,"about_ca_topic_score_gemma":0.003674965,"teacher_disagreement_score":0.011527764,"about_ca_system_score_codex":0.0038507732,"about_ca_system_score_gemma":0.0045901695,"threshold_uncertainty_score":0.038564265},"labels":[],"label_agreement":null},{"id":"W2209009633","doi":"10.1016/j.comgeo.2014.08.009","title":"Bichromatic compatible matchings","year":2014,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"National Science Foundation","keywords":"Combinatorics; Matching (statistics); Graph; Mathematics; Set (abstract data type); Sequence (biology); Discrete mathematics; Computer science; Chemistry","score_opus":0.008411945056672835,"score_gpt":0.22723710643036282,"score_spread":0.21882516137368999,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2209009633","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034139257,0.0002555948,0.9188339,0.00019108744,0.0003100653,0.00026033906,0.00059658964,0.0014656347,0.043947488],"genre_scores_gemma":[0.33330214,0.00036465924,0.62780184,0.0004084426,0.00009926159,0.0002625961,0.0017403807,0.0014670311,0.03455362],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987956,0.00016588342,0.000076408716,0.0002533022,0.00054682785,0.00016190001],"domain_scores_gemma":[0.9990652,0.00013823804,0.000061067774,0.00043320536,0.00024800023,0.000054337394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061197364,0.0006869494,0.0008092441,0.0016530306,0.0008246672,0.0015856827,0.0013937165,0.0010868836,0.023901908],"category_scores_gemma":[0.0032558383,0.0005429928,0.0006834949,0.0017062293,0.00061785866,0.0018093255,0.0028667527,0.0013274022,0.0064364523],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00059527025,0.00022241322,0.00089589285,0.0003401347,0.000060424376,0.0004282015,0.00030762036,0.018188743,0.060947582,0.3158142,0.021274498,0.580925],"study_design_scores_gemma":[0.00018048687,0.0003976731,0.0014272085,0.00018316573,0.000106355634,0.0021704878,0.0005451693,0.26262555,0.10349254,0.48974082,0.13902894,0.00010155689],"about_ca_topic_score_codex":0.00073414564,"about_ca_topic_score_gemma":0.0010968257,"teacher_disagreement_score":0.023901908,"about_ca_system_score_codex":0.00034520417,"about_ca_system_score_gemma":0.0006372826,"threshold_uncertainty_score":0.07995987},"labels":[],"label_agreement":null},{"id":"W2218835040","doi":"10.1016/j.comgeo.2005.10.002","title":"Faster core-set constructions and data-stream algorithms in fixed dimensions","year":2005,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":95,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Dimension (graph theory); Cylinder; RADIUS; Constant (computer programming); Annulus (botany); Set (abstract data type); Core (optical fiber); Algorithm; Fixed point; Space (punctuation); Geometry; Combinatorics; Discrete mathematics; Mathematical analysis; Computer science","score_opus":0.05293009317713095,"score_gpt":0.3119878267126572,"score_spread":0.25905773353552625,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2218835040","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016659621,0.00036593905,0.96998066,0.0004116165,0.00030178475,0.00015863992,0.0003002804,0.0054122144,0.0064093517],"genre_scores_gemma":[0.114318185,0.00030488835,0.87450767,0.0002697323,0.00017763623,0.00051287294,0.0014103543,0.0021471458,0.0063514835],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978231,0.00035797502,0.0001475331,0.00029209966,0.001080624,0.00029871849],"domain_scores_gemma":[0.99269,0.0024803143,0.00024913796,0.0030434418,0.0012229143,0.00031416712],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002075091,0.001907161,0.0025317266,0.0021576951,0.0018235573,0.0034102304,0.0043061683,0.0016317966,0.019618358],"category_scores_gemma":[0.013901196,0.0012844274,0.0021717811,0.0036585217,0.0014854607,0.0066091726,0.0058288723,0.0042460402,0.0063418807],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016018321,0.00046270568,0.0021077706,0.0007180512,0.00016507697,0.00020209803,0.000669554,0.104035184,0.014689975,0.18174264,0.051171154,0.64243394],"study_design_scores_gemma":[0.00029916354,0.00012815832,0.00040293843,0.000059396873,0.000067474626,0.00013927104,0.00016995633,0.7546143,0.015963076,0.21619055,0.011918018,0.000047754915],"about_ca_topic_score_codex":0.0028994349,"about_ca_topic_score_gemma":0.005631504,"teacher_disagreement_score":0.019618358,"about_ca_system_score_codex":0.0015240721,"about_ca_system_score_gemma":0.0024940595,"threshold_uncertainty_score":0.06562996},"labels":[],"label_agreement":null},{"id":"W2230440109","doi":"10.1016/j.comgeo.2017.07.001","title":"Visibility graphs, dismantlability, and the cops and robbers game","year":2017,"lang":"en","type":"preprint","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Visibility; Visibility graph; Polygon (computer graphics); Mathematics; Euclidean geometry; Combinatorics; Planar graph; Graph; Computer science; Regular polygon; Geometry; Geography; Telecommunications","score_opus":0.018402030543946356,"score_gpt":0.2750719726672118,"score_spread":0.25666994212326544,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2230440109","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32293603,0.0010839676,0.6137972,0.0037543804,0.00017412365,0.00014432274,0.0003789203,0.00024272256,0.057488296],"genre_scores_gemma":[0.9490884,0.0006595883,0.03275834,0.00024123654,0.000096171825,0.00010922188,0.0003414924,0.00012886296,0.016576698],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988875,0.00041548882,0.000035093413,0.00021377436,0.00022480753,0.0002233075],"domain_scores_gemma":[0.99653876,0.0021268716,0.00041608815,0.00028040478,0.00017014306,0.00046770406],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011567165,0.0011097372,0.0010078346,0.0009908429,0.0015042946,0.0026876698,0.0018542839,0.0021463875,0.007939132],"category_scores_gemma":[0.0076411753,0.00074200565,0.0007767151,0.0010396354,0.0038961787,0.0047740326,0.002858061,0.0025742133,0.00039725058],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012081456,0.00005569888,0.0006077769,0.00007694051,0.000023168119,0.0001473943,0.00027746797,0.053699702,0.00077028095,0.92836934,0.0040443544,0.011807106],"study_design_scores_gemma":[0.000028037593,0.000021335572,0.00022411377,0.000017452458,0.000012485157,0.000049885268,0.00013416614,0.092286,0.00028197962,0.90472996,0.0022025586,0.000012035404],"about_ca_topic_score_codex":0.006344496,"about_ca_topic_score_gemma":0.004344411,"teacher_disagreement_score":0.007939132,"about_ca_system_score_codex":0.0015771046,"about_ca_system_score_gemma":0.0012990643,"threshold_uncertainty_score":0.026559055},"labels":[],"label_agreement":null},{"id":"W2263302607","doi":"10.1016/j.comgeo.2016.08.001","title":"Flips in edge-labelled pseudo-triangulations","year":2016,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; Ontario Ministry of Research, Innovation and Science","keywords":"Enhanced Data Rates for GSM Evolution; Computer science; Geometry; Mathematics; Artificial intelligence","score_opus":0.016934603221633298,"score_gpt":0.25284887389228683,"score_spread":0.23591427067065354,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2263302607","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09025737,0.00026851048,0.8977026,0.00019606313,0.00018019514,0.0001164222,0.00023736902,0.00051018805,0.010531285],"genre_scores_gemma":[0.62541664,0.000384111,0.3567964,0.00019032815,0.00006440103,0.00021313423,0.0006476074,0.00070070015,0.01558675],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992592,0.00021842375,0.000046598376,0.000100798025,0.00028834384,0.00008663996],"domain_scores_gemma":[0.99775416,0.0010453665,0.00018084006,0.0004662821,0.00040663173,0.00014681047],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009564347,0.00040843658,0.00048137957,0.0013704371,0.0008726399,0.0013757134,0.0014554067,0.0015762352,0.009180933],"category_scores_gemma":[0.00734388,0.00070730253,0.0005901502,0.0009859232,0.00177274,0.0018846114,0.0029458352,0.0013321171,0.001385928],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044617138,0.00008254332,0.0014389808,0.00029586046,0.000029579569,0.00044897955,0.0005595277,0.22516988,0.0133585315,0.61472535,0.0050721243,0.1383725],"study_design_scores_gemma":[0.00004866663,0.000080202044,0.0004179968,0.000087903296,0.00001560242,0.00022378408,0.00018659775,0.5575721,0.0070781442,0.42657107,0.0076820883,0.000035811292],"about_ca_topic_score_codex":0.00097345747,"about_ca_topic_score_gemma":0.0016948937,"teacher_disagreement_score":0.009180933,"about_ca_system_score_codex":0.0006176243,"about_ca_system_score_gemma":0.0004261985,"threshold_uncertainty_score":0.03071326},"labels":[],"label_agreement":null},{"id":"W2280312297","doi":"10.1016/j.comgeo.2013.03.006","title":"Guest Editorʼs Introduction","year":2013,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Global Security and Public Health","field":"Social Sciences","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Environmental science","score_opus":0.013683358873875132,"score_gpt":0.29993973664904616,"score_spread":0.28625637777517104,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2280312297","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000988867,0.0023333526,0.00047996058,0.058849815,0.9327944,0.000013824623,0.00017894701,0.00008462109,0.0051660794],"genre_scores_gemma":[0.0030096592,0.0029615355,0.0006159641,0.043487083,0.88618064,0.000044087123,0.00017902208,0.00019807227,0.063324004],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9982039,0.00028528474,0.00018370565,0.00036986923,0.00075597735,0.000201198],"domain_scores_gemma":[0.98443097,0.0036219882,0.000987554,0.0008496686,0.007769403,0.0023404637],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027413198,0.0011028427,0.001026744,0.0019556577,0.0014436211,0.0040893494,0.0015977116,0.00428135,0.08124799],"category_scores_gemma":[0.02933278,0.00040223112,0.0011106262,0.00073358754,0.0010061484,0.0015427889,0.0018262167,0.0069484888,0.031598713],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000147378205,0.0000035436472,0.00004574095,0.00006163117,0.000004402731,0.000082551815,0.0000077807645,0.000023198942,0.000039822105,0.0006867277,0.9934034,0.005626464],"study_design_scores_gemma":[0.000020262245,0.000015223788,0.00025617264,0.00022320368,0.00001540543,0.00033647125,0.000039687897,0.00014163883,0.0001434788,0.0019601225,0.99683607,0.0000122079855],"about_ca_topic_score_codex":0.0012579958,"about_ca_topic_score_gemma":0.0026208926,"teacher_disagreement_score":0.08124799,"about_ca_system_score_codex":0.0012833995,"about_ca_system_score_gemma":0.0021389816,"threshold_uncertainty_score":0.2718016},"labels":[],"label_agreement":null},{"id":"W2292472667","doi":"10.1016/j.comgeo.2020.101626","title":"Shortest paths and convex hulls in 2D complexes with non-positive curvature","year":2020,"lang":"en","type":"preprint","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Fields Institute for Research in Mathematical Sciences","keywords":"Convex hull; Shortest path problem; Polyhedron; Mathematics; Euclidean shortest path; Combinatorics; Convex polytope; Convex set; Regular polygon; Vertex (graph theory); Subderivative; K shortest path routing; Convex optimization; Geometry; Graph","score_opus":0.016153870670597283,"score_gpt":0.2523741191691435,"score_spread":0.2362202484985462,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2292472667","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21647216,0.00063631893,0.7688744,0.0006844893,0.000107856875,0.00009936317,0.0006638273,0.00031554778,0.012145987],"genre_scores_gemma":[0.78854233,0.00083317753,0.18719806,0.00016319554,0.00013833091,0.00020200775,0.0011045064,0.00062629144,0.021192048],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992901,0.00017862464,0.000040246792,0.00017163425,0.00024416394,0.00007512031],"domain_scores_gemma":[0.99713767,0.0015483926,0.00045121124,0.00018502456,0.00035787327,0.00031980814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006234822,0.0010660788,0.00091037474,0.0032744003,0.0011748687,0.003106225,0.0016609163,0.0018051114,0.006861776],"category_scores_gemma":[0.006697884,0.0010120368,0.0008069232,0.0017471986,0.002160523,0.0035837523,0.003139903,0.0021049788,0.00092164124],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000108509244,0.000051564133,0.0011721725,0.00018435859,0.000024604598,0.00023039243,0.0006514455,0.09903225,0.0034061633,0.8626644,0.0035909517,0.02888325],"study_design_scores_gemma":[0.000015608855,0.000024311275,0.00052008516,0.0000314813,0.000007331648,0.00013439535,0.00018732101,0.27555817,0.0011246026,0.7181541,0.0042208172,0.000021846321],"about_ca_topic_score_codex":0.0023001924,"about_ca_topic_score_gemma":0.002091826,"teacher_disagreement_score":0.006861776,"about_ca_system_score_codex":0.0015140019,"about_ca_system_score_gemma":0.00049884367,"threshold_uncertainty_score":0.02295494},"labels":[],"label_agreement":null},{"id":"W2293771546","doi":"10.1016/j.comgeo.2017.05.005","title":"Routing in a polygonal terrain with the shortest beacon watchtower","year":2017,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Simple polygon; Monotone polygon; Kernel (algebra); Polygon (computer graphics); Shortest path problem; Computer science; Algorithm; Mathematics; Combinatorics; Computer network; Graph","score_opus":0.015077597366991638,"score_gpt":0.2597317922029669,"score_spread":0.24465419483597525,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2293771546","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06913286,0.00015965628,0.92535675,0.00032682405,0.00005810787,0.000064488086,0.0001877719,0.00040302117,0.0043105944],"genre_scores_gemma":[0.60390216,0.00036904545,0.38692904,0.000057767356,0.000040661045,0.00008939234,0.00037183228,0.00017101021,0.008069058],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99976724,0.000055219432,0.000013131987,0.000054118096,0.000068699024,0.000041687697],"domain_scores_gemma":[0.9996296,0.00016735216,0.000056007,0.00006608137,0.00004485053,0.000036121164],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032526837,0.00032386693,0.00054957054,0.0006658943,0.0007062646,0.0010148609,0.0009391838,0.00073927775,0.0023293986],"category_scores_gemma":[0.0016769423,0.00038239287,0.0004720242,0.00093247206,0.0006107436,0.0009741121,0.0012403451,0.0005534946,0.0003361763],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000249768,0.000054669214,0.0013168014,0.000086662876,0.000033669003,0.00025809964,0.00019972905,0.87253183,0.0057678274,0.052924704,0.0027403345,0.063836046],"study_design_scores_gemma":[0.00002271202,0.00003188946,0.00015027192,0.000006624979,0.00000872488,0.000042371266,0.000052737825,0.9799499,0.000999095,0.017149797,0.0015786526,0.0000072942917],"about_ca_topic_score_codex":0.0049460214,"about_ca_topic_score_gemma":0.006232895,"teacher_disagreement_score":0.0049460214,"about_ca_system_score_codex":0.00056617137,"about_ca_system_score_gemma":0.0006391801,"threshold_uncertainty_score":0.009834468},"labels":[],"label_agreement":null},{"id":"W2294705153","doi":"10.1016/j.comgeo.2014.04.009","title":"Face-guarding polyhedra","year":2014,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Polyhedron; Face (sociological concept); Combinatorics; Regular polygon; Mathematics; Guard (computer science); Computer science; Geometry","score_opus":0.012009306876004204,"score_gpt":0.24129800752443378,"score_spread":0.22928870064842957,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2294705153","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023514288,0.00012816362,0.95100456,0.00010525816,0.00014972246,0.000116197465,0.00042324883,0.00082545186,0.023733117],"genre_scores_gemma":[0.31272963,0.00037613523,0.6647704,0.00013308707,0.000063379186,0.00018804369,0.0015667072,0.0006118643,0.019560631],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995977,0.00004414414,0.000020194262,0.000064865526,0.00021550183,0.000057691825],"domain_scores_gemma":[0.99960047,0.000092742055,0.000024890562,0.00012992154,0.00010705251,0.00004492328],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031093613,0.0006226087,0.00075144705,0.00066315994,0.0006647991,0.001182344,0.0013151692,0.00067688647,0.012809173],"category_scores_gemma":[0.0015398265,0.00036939414,0.0005717144,0.00062788604,0.0007779755,0.0009035889,0.001896643,0.0017754523,0.003057516],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029978596,0.00012481348,0.0010151886,0.0002716274,0.000026195907,0.00028717026,0.00018942115,0.15800716,0.019688247,0.4093123,0.01389115,0.39688697],"study_design_scores_gemma":[0.00006607288,0.00015101649,0.00044804488,0.00009077235,0.00002326534,0.0004132289,0.00014363157,0.66925865,0.02250564,0.24693468,0.05993485,0.000030103307],"about_ca_topic_score_codex":0.0012437435,"about_ca_topic_score_gemma":0.0014911757,"teacher_disagreement_score":0.012809173,"about_ca_system_score_codex":0.00032320037,"about_ca_system_score_gemma":0.00074855814,"threshold_uncertainty_score":0.04285097},"labels":[],"label_agreement":null},{"id":"W2299848644","doi":"10.1016/j.comgeo.2016.03.002","title":"Connectivity with directional antennas in the symmetric communication model","year":2016,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; Carleton University; Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Computer science; Directional antenna; Telecommunications; Antenna (radio)","score_opus":0.01741006633043694,"score_gpt":0.2419086116873564,"score_spread":0.22449854535691946,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2299848644","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13800262,0.0008591356,0.8101344,0.0025760357,0.00018645378,0.000075179545,0.0005611746,0.00022933047,0.047375623],"genre_scores_gemma":[0.9609858,0.0015022627,0.022780096,0.0003399233,0.00032516295,0.000114741684,0.00033329104,0.000060157705,0.013558689],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99861753,0.000669752,0.000043271502,0.00018299947,0.00028245503,0.00020402843],"domain_scores_gemma":[0.9971245,0.0016296635,0.00044540584,0.00037524317,0.0002656643,0.00015955883],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009390572,0.0005725555,0.0010171172,0.00093138084,0.00074386696,0.0017936776,0.0016195432,0.001581661,0.0047755665],"category_scores_gemma":[0.005045907,0.0004564323,0.0006089389,0.0015130097,0.0014444139,0.0033355483,0.001553358,0.0011851783,0.00092343264],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013282537,0.00005054186,0.00068511505,0.00007029722,0.00003151616,0.00031199114,0.00012659535,0.23983924,0.001048484,0.74090165,0.0048616854,0.01194007],"study_design_scores_gemma":[0.00004327089,0.00004553441,0.00023865733,0.000010771305,0.000022132352,0.00025702946,0.00006638911,0.6218294,0.0002431692,0.3750499,0.002177001,0.000016706774],"about_ca_topic_score_codex":0.0015181921,"about_ca_topic_score_gemma":0.0012421736,"teacher_disagreement_score":0.0047755665,"about_ca_system_score_codex":0.00082381815,"about_ca_system_score_gemma":0.0006351574,"threshold_uncertainty_score":0.015975833},"labels":[],"label_agreement":null},{"id":"W2302259827","doi":"10.1016/j.comgeo.2016.03.003","title":"Thickness and colorability of geometric graphs","year":2016,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada; Simons Foundation","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Partition (number theory); Graph; Planar graph; Geometric graph theory; Line graph; Graph power","score_opus":0.014367720495956228,"score_gpt":0.2422522013164673,"score_spread":0.22788448082051108,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2302259827","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.75316167,0.0005816926,0.22337456,0.00061230024,0.00010146134,0.000044671542,0.0004621065,0.00041581073,0.021245725],"genre_scores_gemma":[0.96578383,0.00046934825,0.026262013,0.00009800163,0.00010615772,0.000046430374,0.00038712518,0.00044766755,0.006399395],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99917823,0.00020375806,0.000037765032,0.00019125296,0.00023533784,0.00015362771],"domain_scores_gemma":[0.9871156,0.0068994425,0.0019826847,0.0014630466,0.0010787285,0.0014605089],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011707447,0.0008773191,0.0006562724,0.0025751805,0.00093421363,0.0031810377,0.0019011861,0.00096997654,0.007028801],"category_scores_gemma":[0.013661249,0.0012068317,0.0006910356,0.0013237365,0.0033189608,0.0053744516,0.00251812,0.00199495,0.00058556977],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00086415553,0.00017958778,0.01638056,0.00037045314,0.00008764395,0.00056342175,0.0016963371,0.121031426,0.03336151,0.7533194,0.0035649887,0.06858052],"study_design_scores_gemma":[0.000061533916,0.00011469111,0.008613236,0.00009144339,0.00008486152,0.0006731559,0.00062733836,0.21102446,0.015571483,0.75911254,0.0039559114,0.000069342714],"about_ca_topic_score_codex":0.0018639696,"about_ca_topic_score_gemma":0.00164246,"teacher_disagreement_score":0.007028801,"about_ca_system_score_codex":0.0010499371,"about_ca_system_score_gemma":0.000492222,"threshold_uncertainty_score":0.023513615},"labels":[],"label_agreement":null},{"id":"W2339879713","doi":"10.1016/j.comgeo.2016.04.001","title":"Approximating the minimum closest pair distance and nearest neighbor distances of linearly moving points","year":2016,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"k-nearest neighbors algorithm; Mathematics; Nearest-neighbor chain algorithm; Combinatorics; Computer science; Artificial intelligence; Statistics","score_opus":0.012163030968006422,"score_gpt":0.23291681465981093,"score_spread":0.2207537836918045,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2339879713","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04994265,0.0005125762,0.9469523,0.00014437782,0.00009791681,0.000054361564,0.00016436841,0.00027158525,0.0018598996],"genre_scores_gemma":[0.39507318,0.0003855605,0.6007016,0.000042332398,0.00005956381,0.00015159321,0.0005789133,0.00017759234,0.0028296679],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986883,0.00032692333,0.00008418366,0.00026349214,0.0005566464,0.00008040273],"domain_scores_gemma":[0.9969613,0.0017792629,0.0002249847,0.00034870746,0.0005856025,0.0001001606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015438676,0.00081615226,0.0013099487,0.0021272313,0.0006389353,0.0014111021,0.0025738643,0.0018461006,0.002157918],"category_scores_gemma":[0.014906091,0.0007911669,0.00079310196,0.0022652647,0.00084524706,0.0022033302,0.0018683858,0.001525002,0.00085328793],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032571726,0.00009873162,0.0020805676,0.00016880111,0.00004640769,0.000108368266,0.00016153572,0.8381531,0.0026512744,0.026049444,0.0025397786,0.12761621],"study_design_scores_gemma":[0.000008029876,0.000021645154,0.00015246685,0.00000866493,0.000004802107,0.000032564603,0.00002786198,0.9912952,0.0010156308,0.006856031,0.0005687065,0.000008325466],"about_ca_topic_score_codex":0.004933035,"about_ca_topic_score_gemma":0.0052191573,"teacher_disagreement_score":0.004933035,"about_ca_system_score_codex":0.0010744664,"about_ca_system_score_gemma":0.00091079733,"threshold_uncertainty_score":0.00980866},"labels":[],"label_agreement":null},{"id":"W2341114440","doi":"10.1016/j.comgeo.2016.04.002","title":"Approximation algorithms for the unit disk cover problem in 2D and 3D","year":2016,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":46,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Cover (algebra); Unit disk; Simple (philosophy); Set cover problem; Unit (ring theory); Plane (geometry); Set (abstract data type); Unit disk graph; Approximation algorithm; Combinatorics; Algorithm; Mathematics; Computer science; Geometry","score_opus":0.027193469274430324,"score_gpt":0.2694651527910792,"score_spread":0.24227168351664885,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2341114440","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019230332,0.00095202087,0.9738816,0.00041367763,0.00011162326,0.00006367992,0.00016857455,0.0005956565,0.0045828014],"genre_scores_gemma":[0.2730391,0.0010792573,0.7169905,0.00023633653,0.00020395294,0.00029357002,0.0010563578,0.000621123,0.006479834],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991523,0.00021973623,0.00004923994,0.00012300802,0.00032614078,0.0001296518],"domain_scores_gemma":[0.9966107,0.0023329176,0.00018605113,0.00037436924,0.0003109379,0.00018499063],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011977172,0.0011883389,0.001835923,0.0016712156,0.0008219449,0.0021142764,0.0030191937,0.002297374,0.006599981],"category_scores_gemma":[0.008220984,0.00082024705,0.0012073445,0.0026366438,0.0009888413,0.0034280138,0.0031239353,0.002355102,0.0012726106],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033405196,0.0001880116,0.0011664397,0.0003067812,0.00007339379,0.00009830284,0.00027080398,0.73458517,0.0014660041,0.07509034,0.012092587,0.1743281],"study_design_scores_gemma":[0.000015702082,0.00001116677,0.00005646319,0.000009223949,0.0000053597096,0.000021379057,0.000028323217,0.9795243,0.00019983243,0.019236865,0.00088761625,0.0000039039487],"about_ca_topic_score_codex":0.007162412,"about_ca_topic_score_gemma":0.008259832,"teacher_disagreement_score":0.007162412,"about_ca_system_score_codex":0.0016807297,"about_ca_system_score_gemma":0.0012033535,"threshold_uncertainty_score":0.02207917},"labels":[],"label_agreement":null},{"id":"W2362274435","doi":"10.1016/j.comgeo.2016.05.004","title":"Plane geodesic spanning trees, Hamiltonian cycles, and perfect matchings in a simple polygon","year":2016,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Simple polygon; Geodesic; Mathematics; Hamiltonian path; Spanning tree; Vertex (graph theory); Graph; Geometry; Monotone polygon","score_opus":0.011699851910867549,"score_gpt":0.23998151874138365,"score_spread":0.2282816668305161,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2362274435","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7294265,0.0006783157,0.24046092,0.0006621458,0.000082204235,0.000110924244,0.0004169933,0.0002266176,0.027935391],"genre_scores_gemma":[0.928091,0.00054030796,0.061068606,0.00008042657,0.000043593005,0.000051907686,0.00036092498,0.00008310304,0.009680063],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998042,0.00003797891,0.000012468924,0.00004301018,0.00006740971,0.00003488589],"domain_scores_gemma":[0.9995683,0.00015189254,0.00012213676,0.00004608169,0.00004177694,0.00006980826],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002177644,0.00028550514,0.0005270595,0.0010915555,0.0009990081,0.0013332729,0.000760692,0.0010637069,0.0030986376],"category_scores_gemma":[0.0021412922,0.00046533262,0.00037652263,0.0014928003,0.0011676652,0.0018301088,0.0012945178,0.0008337025,0.00035208953],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016647471,0.000060380265,0.0013287776,0.00011385354,0.00002546293,0.00048796064,0.00046750274,0.08208791,0.0036886898,0.8740035,0.0024478019,0.03512166],"study_design_scores_gemma":[0.000037197944,0.000042900076,0.0005715588,0.000020412204,0.000017025654,0.0002397667,0.00022415355,0.1344451,0.0010397703,0.8585489,0.0047991406,0.000014026922],"about_ca_topic_score_codex":0.0018614924,"about_ca_topic_score_gemma":0.0017443707,"teacher_disagreement_score":0.0030986376,"about_ca_system_score_codex":0.000560285,"about_ca_system_score_gemma":0.00033366057,"threshold_uncertainty_score":0.010365963},"labels":[],"label_agreement":null},{"id":"W2382079786","doi":"10.1016/j.comgeo.2016.05.001","title":"An algorithm for the maximum weight independent set problem on outerstring graphs","year":2016,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Combinatorics; Mathematics; Intersection graph; Independent set; Indifference graph; Chordal graph; Split graph; Block graph; Maximal independent set; Circle graph; Discrete mathematics; Time complexity; 1-planar graph; Pathwidth; Cograph; Graph; Line graph","score_opus":0.020954567187221936,"score_gpt":0.26717333492641593,"score_spread":0.246218767739194,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2382079786","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009690318,0.00012519679,0.98131096,0.00028613236,0.00008855771,0.00016553613,0.00021535999,0.0013590197,0.006758848],"genre_scores_gemma":[0.061032,0.0001465996,0.93049943,0.00013668808,0.000067574634,0.00035031277,0.00096236897,0.00050511234,0.006299887],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992304,0.0001652065,0.00004155872,0.00016247004,0.0002701642,0.00013024242],"domain_scores_gemma":[0.99834895,0.0007939039,0.00009665767,0.00034407902,0.00029573464,0.00012067861],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096725824,0.0015922262,0.0016515771,0.0020634886,0.0012865767,0.0018853802,0.0036727688,0.0017788411,0.013510448],"category_scores_gemma":[0.0043439823,0.0009447982,0.0016310929,0.0028947748,0.00085877744,0.0031600762,0.0047013164,0.0025774206,0.003521574],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047854354,0.00042645406,0.00090511236,0.00047884916,0.000118505166,0.0001958454,0.00029683294,0.26257834,0.0074208947,0.0928735,0.02248214,0.61174506],"study_design_scores_gemma":[0.00016248779,0.000092241775,0.00025101524,0.00004309043,0.0000412528,0.00008739557,0.000073067924,0.8742419,0.002966073,0.11484532,0.0071745063,0.00002168999],"about_ca_topic_score_codex":0.0026877285,"about_ca_topic_score_gemma":0.004715045,"teacher_disagreement_score":0.013510448,"about_ca_system_score_codex":0.0011890002,"about_ca_system_score_gemma":0.0017673182,"threshold_uncertainty_score":0.04519689},"labels":[],"label_agreement":null},{"id":"W2399075275","doi":"10.1016/j.comgeo.2017.10.006","title":"A note on interference in random networks","year":2017,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; McGill University","funders":"","keywords":"Combinatorics; Unit cube; Vertex (graph theory); Interference (communication); Mathematics; Graph; Unit disk graph; Binary logarithm; Discrete mathematics; Connectivity; Cube (algebra); Topology (electrical circuits); Computer science; Telecommunications","score_opus":0.01828418869697818,"score_gpt":0.2794516056992861,"score_spread":0.26116741700230794,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399075275","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0078107608,0.04887723,0.7720158,0.057718266,0.020254426,0.00008317791,0.00045196657,0.00031111296,0.09247728],"genre_scores_gemma":[0.52649283,0.09549724,0.19144545,0.0235395,0.10165062,0.00051893835,0.0005304164,0.00080156967,0.059523396],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9945015,0.0023312506,0.0002748298,0.0008369339,0.0017328587,0.0003226849],"domain_scores_gemma":[0.9558905,0.038129557,0.0008461824,0.0026899562,0.0018395884,0.0006042458],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0052414616,0.0016684477,0.0028867922,0.002744115,0.0020672923,0.004181172,0.0037309527,0.0037484537,0.0063455086],"category_scores_gemma":[0.028736224,0.00085392076,0.0022887068,0.0043959282,0.009500245,0.010835812,0.004408238,0.010306651,0.0013634384],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038602586,0.000016330125,0.00018113517,0.00019631251,0.000045428347,0.0001480178,0.00011404414,0.012390318,0.00027513076,0.9575442,0.01754712,0.011503279],"study_design_scores_gemma":[0.000017210366,0.000030171192,0.00012789726,0.00008127954,0.000033633816,0.00013017192,0.000049455815,0.019814175,0.00022269353,0.9464594,0.033004884,0.00002910223],"about_ca_topic_score_codex":0.0021235896,"about_ca_topic_score_gemma":0.001241714,"teacher_disagreement_score":0.0063455086,"about_ca_system_score_codex":0.002319878,"about_ca_system_score_gemma":0.0009867925,"threshold_uncertainty_score":0.027719855},"labels":[],"label_agreement":null},{"id":"W2479238111","doi":"10.1016/j.comgeo.2016.07.005","title":"Alternating paths and cycles of minimum length","year":2016,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Ministero dell’Istruzione, dell’Università e della Ricerca","keywords":"Combinatorics; Mathematics; Integer (computer science); Plane (geometry); Point (geometry); Euclidean geometry; Constant (computer programming); Set (abstract data type); Planar; Enhanced Data Rates for GSM Evolution; Discrete mathematics; Geometry; Computer science","score_opus":0.014885976568507105,"score_gpt":0.2510746711408361,"score_spread":0.236188694572329,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2479238111","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13891475,0.0011384061,0.8166431,0.00063097547,0.00021142428,0.00017162056,0.0004904362,0.000526293,0.041272987],"genre_scores_gemma":[0.5361087,0.0012170884,0.41414526,0.00034447652,0.00014294087,0.00050406443,0.0011152548,0.00087409554,0.04554811],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994711,0.00013093343,0.000030101797,0.00012902354,0.00016508547,0.000073648305],"domain_scores_gemma":[0.9978388,0.0010733614,0.00027028885,0.00023663083,0.00035410677,0.00022689128],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005325051,0.0007764672,0.00056718534,0.0021054638,0.00095943414,0.0013738575,0.001295277,0.0013672241,0.012681214],"category_scores_gemma":[0.0070104613,0.00069662486,0.00063324673,0.0016224207,0.001233319,0.0025387844,0.0019047646,0.0018612549,0.0011877408],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016121357,0.0000529319,0.0006710544,0.00018097022,0.000023644181,0.00011784517,0.00026140953,0.035603285,0.0038431368,0.8785233,0.004825787,0.075735524],"study_design_scores_gemma":[0.000026098654,0.0000657426,0.0002656663,0.00005630802,0.000016851971,0.00015072747,0.00009312913,0.087637834,0.0018408083,0.8956288,0.014199969,0.00001806436],"about_ca_topic_score_codex":0.00122532,"about_ca_topic_score_gemma":0.0019080071,"teacher_disagreement_score":0.012681214,"about_ca_system_score_codex":0.0007519044,"about_ca_system_score_gemma":0.00066190434,"threshold_uncertainty_score":0.04242289},"labels":[],"label_agreement":null},{"id":"W2508006611","doi":"10.1016/j.comgeo.2016.08.002","title":"Dynamic data structures for approximate Hausdorff distance in the word RAM","year":2016,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Word (group theory); Hausdorff distance; Computer science; Arithmetic; Mathematics; Artificial intelligence; Geometry","score_opus":0.03126099954488066,"score_gpt":0.2988654522923044,"score_spread":0.2676044527474237,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2508006611","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0330805,0.0010006594,0.95819616,0.0008257311,0.0001847186,0.000054250435,0.0007453224,0.0006304355,0.0052822297],"genre_scores_gemma":[0.4967828,0.0016466323,0.4859884,0.00041628044,0.00050174614,0.00049108046,0.0031640765,0.0007736419,0.010235362],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99762326,0.0004950124,0.00032768125,0.0006011077,0.00077394163,0.0001790166],"domain_scores_gemma":[0.9934104,0.002743719,0.00052534434,0.0020908357,0.00097163365,0.0002579882],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024938781,0.00075266825,0.001671506,0.0035104575,0.0014770215,0.0054154433,0.0029507563,0.001622601,0.007600354],"category_scores_gemma":[0.017152648,0.0007337365,0.001283935,0.004316182,0.002919222,0.015075694,0.005120932,0.0036185756,0.0020509602],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059722413,0.000022050666,0.000320094,0.00007340646,0.000011392963,0.00003624255,0.00024671108,0.01157555,0.00042061004,0.9570741,0.0019590503,0.028201042],"study_design_scores_gemma":[0.000010459643,0.000035458324,0.0001253807,0.00004206919,0.000011038633,0.00007182623,0.000107493746,0.08616935,0.0007935455,0.9059327,0.0066777277,0.000022918717],"about_ca_topic_score_codex":0.0016657716,"about_ca_topic_score_gemma":0.0014252478,"teacher_disagreement_score":0.007600354,"about_ca_system_score_codex":0.0020991396,"about_ca_system_score_gemma":0.0009813191,"threshold_uncertainty_score":0.025425732},"labels":[],"label_agreement":null},{"id":"W2528068670","doi":"10.1016/j.comgeo.2020.101630","title":"Fast and compact planar embeddings","year":2020,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Comisión Nacional de Investigación Científica y Tecnológica; Horizon 2020 Framework Programme; H2020 Marie Skłodowska-Curie Actions; Universidade da Coruña; Fondo Nacional de Desarrollo Científico y Tecnológico; Helsingin Yliopisto; Núcleo Milenio Información y Coordinación en Redes, ICR; Corporación de Fomento de la Producción; Academy of Finland; Natural Sciences and Engineering Research Council of Canada; European Commission","keywords":"Sublinear function; Embedding; Simplicity; Computer science; Planar; Speedup; Representation (politics); Book embedding; Planar graph; Simple (philosophy); Enhanced Data Rates for GSM Evolution; Theoretical computer science; Graph embedding; Graph; Encoding (memory); Algorithm; Parallel computing; Topology (electrical circuits); Mathematics; Discrete mathematics; Combinatorics; Line graph; Computer graphics (images); 1-planar graph; Artificial intelligence; Physics","score_opus":0.019587141123473296,"score_gpt":0.25156464930427624,"score_spread":0.23197750818080295,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2528068670","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04847092,0.0022220532,0.92319125,0.001154977,0.0004256073,0.00012214418,0.0013708251,0.0046440535,0.01839814],"genre_scores_gemma":[0.388777,0.0025785284,0.5783879,0.00042904465,0.0003945545,0.00033398642,0.0045128777,0.0016185553,0.02296763],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983113,0.0002446797,0.00009708434,0.0003343134,0.000845182,0.00016736526],"domain_scores_gemma":[0.9969542,0.00096407277,0.00019526189,0.0012896495,0.00048086967,0.00011599729],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060197164,0.0019238639,0.0015029316,0.002202693,0.00066153,0.0026346906,0.0018451946,0.001454547,0.011925255],"category_scores_gemma":[0.008534895,0.0008920638,0.0008248487,0.0034253416,0.0012869794,0.006921616,0.00597408,0.0031057363,0.0055986787],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00076423655,0.0001569928,0.0007851115,0.0004443809,0.000079154124,0.0002750833,0.00037873443,0.07869635,0.013987863,0.2130841,0.042030867,0.64931715],"study_design_scores_gemma":[0.00013507917,0.00020594131,0.00062217127,0.00011501616,0.00005525018,0.000696628,0.0004425662,0.4205123,0.019541897,0.5116898,0.045917604,0.00006578803],"about_ca_topic_score_codex":0.00080423645,"about_ca_topic_score_gemma":0.00129379,"teacher_disagreement_score":0.011925255,"about_ca_system_score_codex":0.00075544015,"about_ca_system_score_gemma":0.0006762832,"threshold_uncertainty_score":0.039893925},"labels":[],"label_agreement":null},{"id":"W2551288033","doi":"10.1016/j.comgeo.2011.01.002","title":"On a family of strong geometric spanners that admit local routing strategies","year":2011,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Combinatorics; Spanner; Euclidean geometry; Mathematics; Graph; Unit disk graph; Path (computing); Euclidean distance; Discrete mathematics; Computer science; Geometry","score_opus":0.054577399380405456,"score_gpt":0.26155586164725364,"score_spread":0.20697846226684818,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2551288033","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22748676,0.0007252786,0.71915394,0.0004896254,0.000105231695,0.00009628114,0.00021908022,0.00044845467,0.05127538],"genre_scores_gemma":[0.8248349,0.0013881532,0.14102395,0.0004797411,0.00019016364,0.00024873196,0.00051748514,0.0003209093,0.030995945],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995345,0.000102369035,0.000022348017,0.00012965972,0.0001242955,0.00008683392],"domain_scores_gemma":[0.9981351,0.00093624427,0.0002712886,0.00022326362,0.0001830606,0.00025109574],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006832409,0.0011756832,0.0009406225,0.001087084,0.0012107262,0.0016582406,0.0013712817,0.0012700394,0.0063936864],"category_scores_gemma":[0.0035537381,0.0005667002,0.00073991733,0.0012723518,0.0015868149,0.0027253053,0.0026467724,0.001863959,0.0010185814],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006573917,0.00005586575,0.00040944546,0.00006703404,0.000021117812,0.00012524133,0.00015758869,0.030787535,0.0032401343,0.9428287,0.002115353,0.0201263],"study_design_scores_gemma":[0.000023929435,0.00010764986,0.00026275718,0.000033127624,0.000017767097,0.00024054969,0.00009990491,0.11432658,0.0011737602,0.8797245,0.00397195,0.000017498036],"about_ca_topic_score_codex":0.0004139326,"about_ca_topic_score_gemma":0.0005719136,"teacher_disagreement_score":0.0063936864,"about_ca_system_score_codex":0.00056036294,"about_ca_system_score_gemma":0.000487255,"threshold_uncertainty_score":0.021389067},"labels":[],"label_agreement":null},{"id":"W2564729024","doi":"10.1016/j.comgeo.2004.04.003","title":"Approximating geometric bottleneck shortest paths","year":2004,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University; Carleton University","funders":"","keywords":"Delaunay triangulation; Shortest path problem; Bottleneck; Computer science; Combinatorics; Point set triangulation; Path (computing); Graph; Discrete mathematics; Mathematics","score_opus":0.01591962100472446,"score_gpt":0.24352237571317073,"score_spread":0.22760275470844626,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2564729024","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06752964,0.00047373548,0.9219762,0.0002502985,0.000114050315,0.00010976096,0.0003071882,0.0011644087,0.008074639],"genre_scores_gemma":[0.4633123,0.0004962659,0.5245091,0.00010264726,0.000099139455,0.00025005164,0.0013570032,0.00071959704,0.0091539305],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987815,0.00026011208,0.000049081278,0.00025480826,0.0004936665,0.00016089033],"domain_scores_gemma":[0.9953956,0.0029643863,0.0002601558,0.0005019517,0.00066208234,0.00021584526],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014442537,0.0016972512,0.0019280014,0.0030768143,0.00077701674,0.0019098396,0.003098623,0.0019950592,0.009173319],"category_scores_gemma":[0.013049421,0.0013127557,0.0009010539,0.0025756778,0.0011152442,0.0028548639,0.0031870098,0.0018933456,0.0013482133],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00050834153,0.00015896244,0.0011211375,0.00024048943,0.00005638339,0.00013125593,0.00014947573,0.82068044,0.0030561113,0.061626825,0.006807463,0.10546307],"study_design_scores_gemma":[0.000014794054,0.000025078036,0.000066925044,0.000007806623,0.0000067557285,0.000024239544,0.000022939714,0.9786582,0.0006742489,0.019559689,0.0009356784,0.0000035981448],"about_ca_topic_score_codex":0.0044372054,"about_ca_topic_score_gemma":0.0059635187,"teacher_disagreement_score":0.009173319,"about_ca_system_score_codex":0.0019184904,"about_ca_system_score_gemma":0.0014091268,"threshold_uncertainty_score":0.03068775},"labels":[],"label_agreement":null},{"id":"W2568903863","doi":"10.1016/j.comgeo.2010.05.001","title":"Distance k-sectors exist","year":2010,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Disjoint sets; Combinatorics; Metric space; Dimension (graph theory); Integer (computer science); Euclidean space; Uniqueness; Euclidean distance; Geodesic; Discrete mathematics; Fixed point; Mathematical analysis; Geometry","score_opus":0.009670648628013008,"score_gpt":0.24645513223049748,"score_spread":0.23678448360248447,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2568903863","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20546019,0.0033981304,0.31093574,0.0040144604,0.0026007947,0.00021406931,0.0019211086,0.0018062572,0.4696492],"genre_scores_gemma":[0.8034885,0.0012801383,0.05978546,0.0010148204,0.00025853325,0.00020147863,0.0019550647,0.0009132513,0.13110273],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987754,0.0001390989,0.000099740646,0.0003597968,0.00027625606,0.00034970097],"domain_scores_gemma":[0.99757236,0.00059762417,0.00022763315,0.00067860074,0.0005844807,0.00033928757],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006444633,0.0015669103,0.0014229314,0.0023702765,0.002426337,0.0047309506,0.0019089888,0.0027596438,0.041725732],"category_scores_gemma":[0.0044078045,0.0008503704,0.0010088235,0.0017671662,0.0024680605,0.0064179446,0.0059511904,0.003925871,0.020714507],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003863659,0.00010639146,0.00086898886,0.00021273534,0.000024864938,0.00023547049,0.00029133182,0.00095301,0.0038907274,0.94203174,0.0074579697,0.043540463],"study_design_scores_gemma":[0.000050888873,0.000045735458,0.00042968438,0.000064751934,0.000020927559,0.00061240036,0.0004032479,0.0040138536,0.004697049,0.9521287,0.037506156,0.000026644988],"about_ca_topic_score_codex":0.0002935449,"about_ca_topic_score_gemma":0.00042880667,"teacher_disagreement_score":0.041725732,"about_ca_system_score_codex":0.0009092124,"about_ca_system_score_gemma":0.0005522049,"threshold_uncertainty_score":0.13958645},"labels":[],"label_agreement":null},{"id":"W2585554627","doi":"10.1016/j.comgeo.2017.07.002","title":"On the existence of ordinary triangles","year":2017,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Magyar Tudományos Akadémia; École Polytechnique Fédérale de Lausanne; Fédération Wallonie-Bruxelles; Natural Sciences and Engineering Research Council of Canada; Nemzeti Kutatási Fejlesztési és Innovációs Hivatal; European Commission; Seventh Framework Programme; Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung; National Research, Development and Innovation Office; European Research Council; National Science Foundation","keywords":"Mathematics; Combinatorics; Plane (geometry); Point (geometry); Constant (computer programming); Set (abstract data type); Geometry; Computer science","score_opus":0.04400786237647168,"score_gpt":0.28849129949318436,"score_spread":0.24448343711671267,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2585554627","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0999496,0.0021451605,0.82628465,0.0021205347,0.00041652354,0.000061815655,0.00015773052,0.0002044087,0.06865959],"genre_scores_gemma":[0.7644221,0.003120701,0.20156242,0.0008645121,0.00049778406,0.000109218054,0.00057838066,0.0003730656,0.028471746],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998689,0.00038789268,0.000080101316,0.00024121515,0.00045813242,0.00014371055],"domain_scores_gemma":[0.9896255,0.007119142,0.000378416,0.0008625292,0.001525599,0.0004887192],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022030952,0.0006131968,0.00085902546,0.002139003,0.0011283751,0.0018975178,0.0015143667,0.0015076968,0.0062228846],"category_scores_gemma":[0.017609,0.0008074055,0.0008609573,0.001151987,0.00509955,0.006442722,0.0064677317,0.0035141474,0.00071793434],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000749631,0.000012904591,0.0004636067,0.00007955261,0.000007845631,0.00009299151,0.0003610435,0.005211352,0.0011714225,0.9757547,0.0013324778,0.015437155],"study_design_scores_gemma":[0.000011808401,0.000028838454,0.00022385092,0.000046070094,0.000011080098,0.00014615002,0.00016009259,0.039858155,0.00070332707,0.954016,0.0047833105,0.000011338421],"about_ca_topic_score_codex":0.0009126276,"about_ca_topic_score_gemma":0.0008496447,"teacher_disagreement_score":0.0062228846,"about_ca_system_score_codex":0.00053587503,"about_ca_system_score_gemma":0.00040182297,"threshold_uncertainty_score":0.020817578},"labels":[],"label_agreement":null},{"id":"W2590962680","doi":"10.1016/j.comgeo.2017.02.004","title":"An optimal algorithm for plane matchings in multipartite geometric graphs","year":2017,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Multipartite; Algorithm; Plane (geometry); Combinatorics; Computer science; Mathematics; Geometry; Physics; Quantum entanglement","score_opus":0.021304111577191753,"score_gpt":0.298856879699042,"score_spread":0.27755276812185026,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2590962680","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020530688,0.00024701864,0.9689012,0.00038550037,0.00011590787,0.00026413472,0.00029114622,0.002392404,0.006872012],"genre_scores_gemma":[0.08721767,0.00017537012,0.90721434,0.0001543634,0.000048646256,0.00023608579,0.0008392284,0.00053082133,0.0035835041],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99875295,0.00021708611,0.00008134048,0.00039914539,0.00033981126,0.00020963694],"domain_scores_gemma":[0.9979664,0.0009820572,0.00014022535,0.00048138088,0.0002808791,0.00014906086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009973799,0.001546647,0.002008273,0.0022482674,0.0014927761,0.002697818,0.0035264986,0.002676788,0.016370982],"category_scores_gemma":[0.005723513,0.0013018226,0.0018964767,0.0032228965,0.0012101008,0.004361063,0.0043991692,0.0025182096,0.0034569667],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00058187364,0.00050963124,0.0009926817,0.0005453596,0.00012505765,0.00012246048,0.00035739766,0.22164868,0.011609256,0.072343595,0.021998001,0.66916597],"study_design_scores_gemma":[0.00017895222,0.00012357722,0.0003195483,0.00004452027,0.000060038004,0.00010610166,0.00016743151,0.8972783,0.0038858238,0.09101308,0.006791354,0.000031302003],"about_ca_topic_score_codex":0.0048696026,"about_ca_topic_score_gemma":0.006141089,"teacher_disagreement_score":0.016370982,"about_ca_system_score_codex":0.0021806757,"about_ca_system_score_gemma":0.0023860375,"threshold_uncertainty_score":0.054766417},"labels":[],"label_agreement":null},{"id":"W2594681883","doi":"10.1016/j.comgeo.2017.02.005","title":"Orthogonal layout with optimal face complexity","year":2017,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Rectangle; Combinatorics; Mathematics; Embedding; Planar graph; Face (sociological concept); Graph; Discrete mathematics; Geometry; Computer science; Artificial intelligence","score_opus":0.042101302020788135,"score_gpt":0.28781533972991136,"score_spread":0.24571403770912323,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2594681883","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04390492,0.00030375714,0.93287826,0.0005044705,0.00021071508,0.0000924274,0.0003025412,0.0011142979,0.020688625],"genre_scores_gemma":[0.40401116,0.0004711472,0.572358,0.00030836315,0.0002139499,0.00023732898,0.00058836647,0.00094966276,0.020862088],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99921954,0.00020443997,0.00003066171,0.00011457766,0.0003178015,0.00011299694],"domain_scores_gemma":[0.9979838,0.0010299984,0.00013215185,0.00046960195,0.00026170735,0.00012261275],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005734294,0.00083222456,0.0010685577,0.00084834103,0.0005524413,0.0013778395,0.0013319656,0.0011388584,0.015147997],"category_scores_gemma":[0.005966083,0.00074731227,0.00050224934,0.001113708,0.0007223757,0.0022062485,0.0022732087,0.0013168148,0.002271948],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046841506,0.00031411884,0.000905982,0.0003128186,0.000039756487,0.00016596795,0.00012404527,0.3643779,0.0140919415,0.25535992,0.02914845,0.33469072],"study_design_scores_gemma":[0.00008591549,0.00012030696,0.00026414162,0.000019876097,0.00001876949,0.0001753455,0.00004666941,0.8190863,0.0039207493,0.17042446,0.005818911,0.000018536351],"about_ca_topic_score_codex":0.0010670592,"about_ca_topic_score_gemma":0.0021821961,"teacher_disagreement_score":0.015147997,"about_ca_system_score_codex":0.00058382965,"about_ca_system_score_gemma":0.00094941654,"threshold_uncertainty_score":0.050675035},"labels":[],"label_agreement":null},{"id":"W2607258329","doi":"10.1016/j.comgeo.2017.04.001","title":"Guarding orthogonal art galleries with sliding cameras","year":2017,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada; Nederlandse Organisatie voor Wetenschappelijk Onderzoek; Massachusetts Life Sciences Center","keywords":"Computer science; Computer vision; Artificial intelligence; Computer graphics (images); Art","score_opus":0.018310067170356867,"score_gpt":0.2589105703895724,"score_spread":0.2406005032192155,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2607258329","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050670087,0.00015049714,0.9394702,0.00007861628,0.00014104178,0.0001302366,0.00021875268,0.0011980161,0.007942646],"genre_scores_gemma":[0.47102898,0.00020345834,0.51399744,0.000088672234,0.00004981857,0.00011344586,0.0007004644,0.00053173816,0.013286051],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990138,0.00010200229,0.000046814785,0.00033135185,0.00035311095,0.0001528847],"domain_scores_gemma":[0.99922717,0.00018201051,0.0000579504,0.0003211125,0.000117768024,0.00009405579],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006528072,0.0012133394,0.0013898298,0.00098619,0.0006917346,0.0014608629,0.001631622,0.001428973,0.007890312],"category_scores_gemma":[0.0022036121,0.0010720857,0.0015110817,0.00069305766,0.0012340348,0.0016869074,0.0052483175,0.001892369,0.0016554625],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009850168,0.00022996402,0.0025674838,0.00030250318,0.00015328158,0.00057035364,0.0007092908,0.38341317,0.047272872,0.03833263,0.010172751,0.5152906],"study_design_scores_gemma":[0.000027622877,0.0001570594,0.0006341403,0.00004021992,0.00002215931,0.00019218947,0.00024079352,0.96833706,0.00962889,0.015525353,0.005166311,0.000028270384],"about_ca_topic_score_codex":0.003854177,"about_ca_topic_score_gemma":0.006241356,"teacher_disagreement_score":0.007890312,"about_ca_system_score_codex":0.00036024197,"about_ca_system_score_gemma":0.0007688976,"threshold_uncertainty_score":0.026395738},"labels":[],"label_agreement":null},{"id":"W2623275761","doi":"10.1016/j.comgeo.2017.06.002","title":"Connecting a set of circles with minimum sum of radii","year":2017,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Sandia National Laboratories; University of Victoria; McGill University; United States-Israel Binational Science Foundation; National Science Foundation","keywords":"Mathematics; Combinatorics; Bounded function; Constant (computer programming); Upper and lower bounds; Plane (geometry); Steiner tree problem; Set (abstract data type); Planar; Tree (set theory); Planar graph; Point (geometry); Approximation algorithm; Discrete mathematics; Mathematical analysis; Geometry; Graph; Computer science","score_opus":0.02824305924596995,"score_gpt":0.28004641244014455,"score_spread":0.25180335319417463,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2623275761","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08853167,0.0002828506,0.88955396,0.00056241284,0.0002403452,0.00074959715,0.00071588135,0.002167706,0.017195545],"genre_scores_gemma":[0.23709989,0.0002252316,0.7513398,0.0001293004,0.00006365369,0.00072516437,0.0012232796,0.0006455046,0.008548118],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963483,0.0010027525,0.00024136945,0.00089501915,0.0011681936,0.0003444389],"domain_scores_gemma":[0.98998463,0.0033739367,0.0014568942,0.0019909302,0.0023189466,0.0008746248],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015537995,0.002113519,0.0020476708,0.0047089914,0.002854108,0.0032612279,0.004337161,0.0048324843,0.014988916],"category_scores_gemma":[0.022848187,0.0014203537,0.0014922183,0.0036315052,0.0016773095,0.003308631,0.0057854224,0.0017620719,0.0064004757],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002900043,0.0006984199,0.0065358276,0.0019182835,0.00041113477,0.0019738625,0.0023309526,0.2840731,0.05247993,0.20082612,0.025596073,0.4202563],"study_design_scores_gemma":[0.00047361496,0.0011463936,0.0018276653,0.0004632072,0.00022604171,0.002071725,0.0013631553,0.676959,0.08898517,0.1629898,0.06324039,0.0002539161],"about_ca_topic_score_codex":0.0012446388,"about_ca_topic_score_gemma":0.0012314891,"teacher_disagreement_score":0.014988916,"about_ca_system_score_codex":0.0010374661,"about_ca_system_score_gemma":0.0015273177,"threshold_uncertainty_score":0.050142944},"labels":[],"label_agreement":null},{"id":"W2693333471","doi":"10.1016/j.comgeo.2020.101607","title":"Optimal Art Gallery Localization is NP-hard","year":2020,"lang":"en","type":"preprint","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Simple polygon; Combinatorics; Reduction (mathematics); Polygon (computer graphics); Visibility polygon; Mathematics; Point (geometry); Simple (philosophy); Boolean satisfiability problem; Time complexity; Euclidean geometry; Computational complexity theory; Visibility; Euclidean distance; Discrete mathematics; Algorithm; Computer science; Monotone polygon; Geometry; Physics; Frame (networking)","score_opus":0.03378414310431869,"score_gpt":0.2723554559817247,"score_spread":0.23857131287740604,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2693333471","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0649896,0.0022931513,0.8721142,0.0070748236,0.0004643277,0.0004300969,0.00470865,0.0061544497,0.04177071],"genre_scores_gemma":[0.5830588,0.0012375818,0.36543214,0.0014964043,0.00051708013,0.0006840223,0.006846212,0.0018604546,0.03886729],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998264,0.0003407217,0.00009081844,0.00062102237,0.00036535872,0.00031811828],"domain_scores_gemma":[0.9926681,0.005506857,0.00030195437,0.00087406405,0.00041852865,0.00023050325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013817358,0.0017153143,0.003620089,0.0013000334,0.0014366151,0.004283784,0.003723643,0.005212893,0.025493547],"category_scores_gemma":[0.0110015115,0.001492511,0.0017898345,0.0022316393,0.0017793144,0.005977482,0.0041527916,0.0034059177,0.0041027046],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007532916,0.0004075945,0.0014471745,0.0013357896,0.00017479937,0.0003805301,0.00033481317,0.57383895,0.004476095,0.060823873,0.11380215,0.2422249],"study_design_scores_gemma":[0.0001336595,0.000057024732,0.00036246396,0.00006442857,0.000043378608,0.00022957135,0.00017751406,0.8410239,0.0018935339,0.15017809,0.0058131088,0.000023301282],"about_ca_topic_score_codex":0.0047693793,"about_ca_topic_score_gemma":0.0058457577,"teacher_disagreement_score":0.025493547,"about_ca_system_score_codex":0.0020995762,"about_ca_system_score_gemma":0.0019981766,"threshold_uncertainty_score":0.08528435},"labels":[],"label_agreement":null},{"id":"W2757769355","doi":"10.1016/j.comgeo.2015.07.003","title":"Higher-order triangular-distance Delaunay graphs: Graph-theoretical properties","year":2015,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Delaunay triangulation; Mathematics; Combinatorics; Equilateral triangle; Dual graph; Boundary (topology); Discrete mathematics; Graph; Geometry; Line graph; Mathematical analysis","score_opus":0.03251423969451171,"score_gpt":0.25445439621640353,"score_spread":0.2219401565218918,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2757769355","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15035245,0.00045629014,0.812034,0.0009485452,0.00011401277,0.0000917828,0.00040776623,0.0004121033,0.035183016],"genre_scores_gemma":[0.79035604,0.0010017201,0.18686019,0.00048930116,0.00020278215,0.00014177931,0.0008843592,0.0004423258,0.019621557],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99937576,0.00009702292,0.00002789957,0.000136933,0.00028117382,0.00008133099],"domain_scores_gemma":[0.99367344,0.0033313213,0.0007107249,0.00085753377,0.00096856925,0.00045843187],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006033013,0.00045336652,0.0006338179,0.00171673,0.0011510475,0.0024464908,0.0017830728,0.0012368296,0.010160393],"category_scores_gemma":[0.008183369,0.0005180207,0.00064499764,0.001670588,0.001661962,0.003569147,0.0016164513,0.0019574603,0.0010992708],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059884518,0.000070116876,0.0011672361,0.000108107364,0.000012989676,0.000118518336,0.00039810952,0.039133254,0.0022061402,0.9246536,0.0033651204,0.02870693],"study_design_scores_gemma":[0.00001388188,0.00003190858,0.00051499164,0.00002071278,0.000011989912,0.00026085993,0.0001998822,0.17458686,0.0015134506,0.81716293,0.005665603,0.000016827058],"about_ca_topic_score_codex":0.0022772017,"about_ca_topic_score_gemma":0.0035229714,"teacher_disagreement_score":0.010160393,"about_ca_system_score_codex":0.0012457555,"about_ca_system_score_gemma":0.0005622161,"threshold_uncertainty_score":0.033989906},"labels":[],"label_agreement":null},{"id":"W2761681115","doi":"10.1016/j.comgeo.2011.11.008","title":"Graphs that admit right angle crossing drawings","year":2011,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Combinatorics; Enhanced Data Rates for GSM Evolution; Mathematics; Graph; Geometry; Crossing number (knot theory); Graph drawing; Computer science; Materials science; Artificial intelligence; Knot (papermaking)","score_opus":0.037013744547223906,"score_gpt":0.25032301231445936,"score_spread":0.21330926776723547,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2761681115","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23808536,0.00072454015,0.6216379,0.0012335203,0.00039845475,0.00027391323,0.0013800497,0.0018793535,0.13438688],"genre_scores_gemma":[0.74900293,0.00090733595,0.19665977,0.0004784175,0.00012977276,0.00017331647,0.0029306628,0.0009335044,0.048784338],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99922943,0.00011653598,0.00003491498,0.0001927193,0.0002940404,0.00013244708],"domain_scores_gemma":[0.99791056,0.00081427343,0.000275585,0.00042960522,0.00032396743,0.00024601055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003955056,0.00090856885,0.00074253225,0.0014223543,0.0012076268,0.0027470512,0.0011041305,0.0014611927,0.014857598],"category_scores_gemma":[0.0037508744,0.0010084963,0.00069408317,0.0020865619,0.0009961032,0.0037755049,0.0017725849,0.0026013153,0.0024003033],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015659489,0.00010486017,0.001106298,0.0001927824,0.00002833476,0.00076404586,0.00050800265,0.018175602,0.008544215,0.9015184,0.012104524,0.056796305],"study_design_scores_gemma":[0.00005352943,0.00004826333,0.0008444003,0.000077068114,0.000043189713,0.0010019349,0.00040351838,0.04485242,0.006273244,0.9129594,0.033410266,0.000032745356],"about_ca_topic_score_codex":0.00075536675,"about_ca_topic_score_gemma":0.001286863,"teacher_disagreement_score":0.014857598,"about_ca_system_score_codex":0.0006243509,"about_ca_system_score_gemma":0.00033531847,"threshold_uncertainty_score":0.049703598},"labels":[],"label_agreement":null},{"id":"W2765198212","doi":"10.1016/j.comgeo.2020.101631","title":"Minimizing the continuous diameter when augmenting a geometric tree with a shortcut","year":2020,"lang":"en","type":"preprint","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Combinatorics; Mathematics; Intersection (aeronautics); Tree (set theory); Point (geometry); Line (geometry); Line segment; Plane (geometry); Euclidean geometry; Euclidean distance; Geometry","score_opus":0.030317217067687027,"score_gpt":0.24530900022898663,"score_spread":0.2149917831612996,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2765198212","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054486137,0.00020391829,0.94026744,0.00015725504,0.00010013236,0.00008064752,0.00013350797,0.00048489776,0.0040861215],"genre_scores_gemma":[0.24454238,0.00024892783,0.74875826,0.000075186785,0.00007073701,0.0001577743,0.0003098917,0.0006864209,0.0051504425],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99948055,0.00009105094,0.000028659822,0.000114888724,0.0002144182,0.000070419665],"domain_scores_gemma":[0.99868065,0.00067081396,0.000108922846,0.00023868706,0.0001624282,0.00013854717],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080153346,0.00095364306,0.0012526995,0.00082371966,0.00047486578,0.0010237074,0.0017623856,0.0015709761,0.005308951],"category_scores_gemma":[0.004434944,0.00069830456,0.00070478034,0.00074400095,0.00075900956,0.0019463245,0.0021416824,0.0016224078,0.0008520823],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005485484,0.0002382673,0.0013965297,0.0005825547,0.00007097992,0.0003910066,0.00033494903,0.5783321,0.061462402,0.08716233,0.010753457,0.2587268],"study_design_scores_gemma":[0.00002998885,0.0002319197,0.00027201028,0.000042480267,0.000025235688,0.0002283888,0.000077025776,0.94146186,0.0077416725,0.04423075,0.0056445994,0.000014102053],"about_ca_topic_score_codex":0.00064859324,"about_ca_topic_score_gemma":0.0012778991,"teacher_disagreement_score":0.005308951,"about_ca_system_score_codex":0.000515485,"about_ca_system_score_gemma":0.00055693305,"threshold_uncertainty_score":0.017760217},"labels":[],"label_agreement":null},{"id":"W2767104781","doi":"10.1016/j.comgeo.2017.10.001","title":"Editorial: Special issue in memory of Dr. Ferran Hurtado","year":2017,"lang":"en","type":"editorial","venue":"Computational Geometry","topic":"Cell Adhesion Molecules Research","field":"Medicine","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Psychology; Psychoanalysis; Art","score_opus":0.02183707640225067,"score_gpt":0.3503287817273439,"score_spread":0.3284917053250932,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2767104781","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000024788991,0.0017584811,0.00009655716,0.025139727,0.9719234,0.0000144723845,0.000055784225,0.00004823111,0.00093853293],"genre_scores_gemma":[0.0003759226,0.0026009728,0.000084919346,0.014699428,0.9732646,0.000021647358,0.000053106312,0.00004794805,0.0088514285],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9964474,0.0005915897,0.0004505662,0.00050442043,0.0017219428,0.00028416637],"domain_scores_gemma":[0.9824571,0.005610214,0.0013853066,0.0004673003,0.007202232,0.002877835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0050508482,0.003434492,0.0035647831,0.0029237862,0.0025910619,0.007422511,0.003566538,0.010128706,0.027879657],"category_scores_gemma":[0.026126763,0.0010338584,0.002370501,0.000978495,0.0020079806,0.0040889513,0.0016009193,0.015025577,0.024487957],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030913478,0.0000053073313,0.000014630036,0.000091762784,0.000010016678,0.00008449755,0.0000052430287,0.000015991469,0.00002920486,0.00017719092,0.99746084,0.0020743741],"study_design_scores_gemma":[0.00007365629,0.000030136427,0.00018940734,0.0002968507,0.000045107357,0.00034007625,0.000041071344,0.00018310988,0.00017010487,0.0010465379,0.9975643,0.000019610818],"about_ca_topic_score_codex":0.00092717784,"about_ca_topic_score_gemma":0.0025006558,"teacher_disagreement_score":0.027879657,"about_ca_system_score_codex":0.0022200826,"about_ca_system_score_gemma":0.0026354718,"threshold_uncertainty_score":0.093266726},"labels":[],"label_agreement":null},{"id":"W2789259282","doi":"10.1016/j.comgeo.2018.01.006","title":"Thread-parallel mesh improvement using face and edge swapping and vertex insertion","year":2018,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"U.S. Department of Energy","keywords":"Parallel computing; Computer science; Thread (computing); Shared memory; Threading (protein sequence); Control reconfiguration; Polygon mesh; Embedded system; Operating system","score_opus":0.02640856824943029,"score_gpt":0.27314769270706885,"score_spread":0.24673912445763857,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2789259282","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06703552,0.00023251605,0.91424763,0.00022490024,0.00046598853,0.00017251498,0.000176362,0.008708969,0.008735658],"genre_scores_gemma":[0.35635483,0.000104882376,0.6331371,0.000180929,0.00009053695,0.00017641313,0.0005917706,0.0017936435,0.0075698174],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993549,0.00008910324,0.000039494855,0.00012757524,0.00027385465,0.00011504214],"domain_scores_gemma":[0.9984547,0.0003055116,0.00008035288,0.0006647891,0.00039253914,0.00010210857],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007843665,0.0009314252,0.0013150558,0.00093056605,0.0008603586,0.00092598464,0.0024110808,0.0008313274,0.012489294],"category_scores_gemma":[0.0030790942,0.00052187126,0.0010000422,0.0012004355,0.0006342285,0.0012250306,0.00220067,0.0013575067,0.001935041],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015251667,0.0008211356,0.003931986,0.00044220503,0.00021092388,0.00027270886,0.0004487483,0.20118459,0.07280394,0.027551373,0.022338929,0.6684683],"study_design_scores_gemma":[0.00019876169,0.00016907405,0.00052037166,0.000011738805,0.000057140936,0.000120412806,0.000069573645,0.95638156,0.022947002,0.013403581,0.006100953,0.00001980645],"about_ca_topic_score_codex":0.0026684096,"about_ca_topic_score_gemma":0.0059477785,"teacher_disagreement_score":0.012489294,"about_ca_system_score_codex":0.00053715246,"about_ca_system_score_gemma":0.0013309029,"threshold_uncertainty_score":0.04178083},"labels":[],"label_agreement":null},{"id":"W2892927166","doi":"10.1016/j.comgeo.2019.05.003","title":"Closest-pair queries in fat rectangles","year":2019,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; National Research Foundation of Korea","keywords":"Rectangle; Combinatorics; Set (abstract data type); Data structure; Range (aeronautics); Range query (database); Mathematics; Binary logarithm; Plane (geometry); Time complexity; Discrete mathematics; Computer science; Sargable; Geometry; Search engine; Information retrieval","score_opus":0.008811272025600598,"score_gpt":0.23295800508528483,"score_spread":0.22414673305968424,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2892927166","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10399904,0.0023670143,0.86110944,0.0023897141,0.000399284,0.00061137544,0.0049387915,0.0074919215,0.016693331],"genre_scores_gemma":[0.46471822,0.00089789106,0.5145494,0.0006266073,0.00019661491,0.00036159102,0.009334218,0.0014156504,0.007899818],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99475443,0.001205601,0.0005643336,0.0010677689,0.0017746803,0.00063311314],"domain_scores_gemma":[0.9924935,0.004283987,0.00032607655,0.0021036637,0.0005074217,0.00028528238],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002821114,0.0010413418,0.0027830957,0.0022122988,0.0017424711,0.003680376,0.0030446737,0.0030919856,0.012383237],"category_scores_gemma":[0.018035665,0.0010428464,0.0016085437,0.004858625,0.0014004955,0.010353758,0.008157876,0.0021428913,0.0030491524],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0037231843,0.0007167272,0.0048458907,0.001451089,0.00030853465,0.0015713575,0.0016170038,0.24098912,0.014928676,0.26781446,0.07583465,0.38619933],"study_design_scores_gemma":[0.00036938465,0.0001874304,0.0005172558,0.00011581617,0.00007249167,0.0007284438,0.0008880035,0.65303797,0.011132931,0.3126356,0.020265121,0.000049564744],"about_ca_topic_score_codex":0.0030160474,"about_ca_topic_score_gemma":0.0030690941,"teacher_disagreement_score":0.012383237,"about_ca_system_score_codex":0.00127334,"about_ca_system_score_gemma":0.0011011275,"threshold_uncertainty_score":0.041426003},"labels":[],"label_agreement":null},{"id":"W2900946146","doi":"10.1016/j.comgeo.2018.08.001","title":"Editorial: Special issue on the 26th Canadian Conference on Computational Geometry (CCCG)","year":2018,"lang":"en","type":"editorial","venue":"Computational Geometry","topic":"3D Modeling in Geospatial Applications","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Dalhousie University","funders":"","keywords":"Geometry; Computer science; Mathematics","score_opus":0.013810860746611772,"score_gpt":0.24794937544599496,"score_spread":0.23413851469938318,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2900946146","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000017826937,0.0025221095,0.00008172644,0.017216442,0.97883,0.000015743652,0.00005945492,0.00004038786,0.0012163583],"genre_scores_gemma":[0.0003398079,0.0028897047,0.00010846029,0.010360443,0.973128,0.000029397645,0.000082682614,0.00007059086,0.012990744],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9922275,0.0007618318,0.0006001785,0.00082810334,0.0049006846,0.0006816966],"domain_scores_gemma":[0.97128594,0.0058369115,0.0017847234,0.0007503582,0.015157277,0.0051848413],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006777964,0.0049557933,0.0055948943,0.0070294403,0.0048106587,0.011808251,0.0043972437,0.018094793,0.040376116],"category_scores_gemma":[0.028658338,0.0013680559,0.003549076,0.0024762093,0.0028245742,0.0043274504,0.0029384186,0.015124313,0.022562938],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018222861,0.000005502237,0.000012583028,0.00005361562,0.000008059345,0.000037959606,0.000004212605,0.000014286982,0.00002376997,0.0000864623,0.9981122,0.00162314],"study_design_scores_gemma":[0.000076036114,0.000017405444,0.00026654187,0.0002805964,0.000045839006,0.00010140715,0.000031768897,0.0001725012,0.00007380082,0.00066403387,0.9982529,0.000017112376],"about_ca_topic_score_codex":0.006479386,"about_ca_topic_score_gemma":0.021960437,"teacher_disagreement_score":0.040376116,"about_ca_system_score_codex":0.0051138,"about_ca_system_score_gemma":0.0054512806,"threshold_uncertainty_score":0.13507158},"labels":[],"label_agreement":null},{"id":"W2911638885","doi":"10.1016/j.comgeo.2013.10.004","title":"α -Visibility","year":2013,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Visibility; Visibility graph; Vertex (graph theory); Visibility polygon; Graph; Line segment; Combinatorics; Point (geometry); Computer science; Mathematics; Artificial intelligence; Geometry; Physics; Optics; Simple polygon; Regular polygon","score_opus":0.011395331659290377,"score_gpt":0.23543737956601193,"score_spread":0.22404204790672155,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2911638885","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06242288,0.0007480189,0.69913733,0.0009376887,0.00093551097,0.00022530233,0.0010563898,0.002354096,0.23218282],"genre_scores_gemma":[0.6754331,0.0010867439,0.21592085,0.0007259878,0.00042719915,0.0001622192,0.002645765,0.0017367129,0.101861514],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990926,0.000081614184,0.000049520724,0.00030213944,0.0002649156,0.00020919288],"domain_scores_gemma":[0.99837804,0.00028768656,0.00014558432,0.00054090074,0.00042251672,0.00022525973],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043371192,0.0007572915,0.00074005517,0.0011153155,0.0011436745,0.0027457753,0.00090530893,0.000872804,0.021861646],"category_scores_gemma":[0.0032056358,0.00048580833,0.00080614624,0.0007770519,0.0013990165,0.0033953101,0.003588063,0.002444633,0.0048573622],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035448547,0.000100184305,0.0016713191,0.00025806983,0.000045564193,0.0003472621,0.00041042457,0.0042356555,0.017654222,0.7740804,0.01904681,0.1817956],"study_design_scores_gemma":[0.00005653351,0.00012660617,0.0013718804,0.0000964018,0.000054987482,0.0009841596,0.0004110199,0.027045647,0.024881247,0.8241047,0.12082895,0.000037915008],"about_ca_topic_score_codex":0.0011725231,"about_ca_topic_score_gemma":0.0010178753,"teacher_disagreement_score":0.021861646,"about_ca_system_score_codex":0.00053202285,"about_ca_system_score_gemma":0.0008515656,"threshold_uncertainty_score":0.07313448},"labels":[],"label_agreement":null},{"id":"W2914419451","doi":"10.1016/j.comgeo.2007.05.002","title":"Equiprojective polyhedra","year":2007,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Polyhedron; Regular polygon; Combinatorics; Shadow (psychology); Projection (relational algebra); Mathematics; Computer science; Geometry; Algorithm","score_opus":0.049860324983418865,"score_gpt":0.3743435844501364,"score_spread":0.3244832594667175,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2914419451","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17745724,0.0011296681,0.36795333,0.0017448693,0.00068962557,0.00010298539,0.0009766994,0.000521911,0.44942364],"genre_scores_gemma":[0.8506056,0.0013536073,0.055241667,0.0005426684,0.00055573764,0.00015104578,0.0015336451,0.00037600187,0.08963991],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986443,0.00022679589,0.000072552575,0.000340949,0.00049837533,0.00021715112],"domain_scores_gemma":[0.99852824,0.000460765,0.00010740282,0.00030858692,0.0003317797,0.0002632955],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005553055,0.0009969239,0.00079850585,0.0020050872,0.0025931292,0.004241273,0.0011773681,0.00084162166,0.015410011],"category_scores_gemma":[0.0018223086,0.00065711985,0.0007199761,0.0018587558,0.003182629,0.00657072,0.004685879,0.0047782413,0.0022486045],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009750894,0.000009009997,0.000048595903,0.000015932377,0.0000039191445,0.00003171667,0.00010694469,0.00018877967,0.00023716355,0.9948836,0.0007325725,0.0037320799],"study_design_scores_gemma":[0.0000062199492,0.000015590762,0.00023017527,0.000011624519,0.000010661247,0.00018314859,0.00021395663,0.0012844342,0.00093034253,0.97596574,0.02113739,0.000010682712],"about_ca_topic_score_codex":0.0006359978,"about_ca_topic_score_gemma":0.0007195823,"teacher_disagreement_score":0.015410011,"about_ca_system_score_codex":0.00077616755,"about_ca_system_score_gemma":0.00035972154,"threshold_uncertainty_score":0.05155158},"labels":[],"label_agreement":null},{"id":"W2914514102","doi":"10.1016/j.comgeo.2005.06.005","title":"Moving coins","year":2005,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Departament d'Universitats, Recerca i Societat de la Informació; Natural Sciences and Engineering Research Council of Canada","keywords":"Euclidean geometry; Plane (geometry); Computer science; Combinatorics; Combinatorial explosion; Computational complexity theory; Mathematics; Algorithm; Geometry","score_opus":0.014242192469091754,"score_gpt":0.25314328414030113,"score_spread":0.23890109167120938,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2914514102","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02657094,0.0034220181,0.17789347,0.0135252215,0.009678668,0.00020270795,0.000693268,0.001703811,0.7663098],"genre_scores_gemma":[0.29979894,0.0023726057,0.047964275,0.0031353598,0.001699768,0.0002817434,0.0009130824,0.0013394193,0.6424948],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99817085,0.0003974796,0.000067964174,0.00051432237,0.0005442792,0.00030510628],"domain_scores_gemma":[0.9975314,0.00054659497,0.00012153501,0.00077632564,0.0006520413,0.0003721336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001243741,0.00085405784,0.0010000445,0.0026803175,0.004681005,0.005433023,0.001641715,0.003199956,0.13076887],"category_scores_gemma":[0.010354124,0.00053698174,0.00092679623,0.002148937,0.004128079,0.008173394,0.0058229454,0.0028576346,0.03342302],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014699939,0.000020313415,0.0004035929,0.00009555358,0.000019427778,0.000262111,0.00065508316,0.0015581803,0.0011769156,0.8718735,0.044885244,0.078903034],"study_design_scores_gemma":[0.00002985701,0.00006393431,0.00043776986,0.00019628175,0.000034691002,0.00041513218,0.000977049,0.006344373,0.0016477542,0.4477267,0.542076,0.0000504433],"about_ca_topic_score_codex":0.0023556566,"about_ca_topic_score_gemma":0.0019605714,"teacher_disagreement_score":0.13076887,"about_ca_system_score_codex":0.0013817318,"about_ca_system_score_gemma":0.0012578233,"threshold_uncertainty_score":0.43746543},"labels":[],"label_agreement":null},{"id":"W2916619961","doi":"10.1016/j.comgeo.2020.101622","title":"Plane hop spanners for unit disk graphs: Simpler and better","year":2020,"lang":"en","type":"preprint","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Spanner; Hop (telecommunications); Planarity testing; Unit disk graph; Euclidean geometry; Plane (geometry); Enhanced Data Rates for GSM Evolution; Euclidean distance; Mathematics; Computer science; Topology (electrical circuits); Unit disk; Combinatorics; Planar graph; Graph; Wireless; Geometry; Wireless network; Computer network; Telecommunications; Distributed computing","score_opus":0.04307309791878231,"score_gpt":0.28686293028230964,"score_spread":0.24378983236352733,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2916619961","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17082562,0.0010441485,0.78884757,0.00088422705,0.0004179423,0.00028016535,0.00083299464,0.0017472778,0.03512013],"genre_scores_gemma":[0.47671458,0.0011755093,0.4856338,0.0005779541,0.00034168042,0.00028200386,0.0022068373,0.0022562742,0.030811286],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99920267,0.00019193535,0.000051875824,0.00022352864,0.00025024184,0.000079652884],"domain_scores_gemma":[0.9970722,0.0009783107,0.00025015234,0.0011710789,0.000269277,0.00025894234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008205922,0.001086126,0.0014911459,0.0012487313,0.0008394808,0.0025992498,0.0021530513,0.0014649405,0.01779742],"category_scores_gemma":[0.005363973,0.00054952345,0.000862093,0.0015927469,0.0013500891,0.0053570066,0.0026266836,0.002554116,0.0029574148],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006035625,0.0006932373,0.001796464,0.00078545423,0.00010308411,0.00030455104,0.0007062255,0.20997846,0.012199353,0.48190498,0.024971945,0.26595262],"study_design_scores_gemma":[0.00011744012,0.00016679849,0.00047616355,0.000093322094,0.00006118427,0.00021841934,0.00030715234,0.3392701,0.0056989286,0.63838863,0.015160107,0.000041749674],"about_ca_topic_score_codex":0.0010626601,"about_ca_topic_score_gemma":0.0022665414,"teacher_disagreement_score":0.01779742,"about_ca_system_score_codex":0.00064034236,"about_ca_system_score_gemma":0.0005962708,"threshold_uncertainty_score":0.059538245},"labels":[],"label_agreement":null},{"id":"W2921666111","doi":"10.1016/j.comgeo.2019.01.008","title":"Flip distance to some plane configurations","year":2019,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Flip; Plane (geometry); Computer science; Materials science; Geometry; Mathematics; Chemistry","score_opus":0.010150010652917029,"score_gpt":0.24189803784275696,"score_spread":0.23174802718983992,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2921666111","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47166106,0.00040978205,0.4532545,0.0009787858,0.00025276633,0.0001682156,0.00073219714,0.0006199982,0.071922764],"genre_scores_gemma":[0.89609003,0.00027030372,0.08215757,0.00018926708,0.00004133104,0.00012957878,0.0007207584,0.00020922442,0.020191843],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99979573,0.000028960889,0.000008691822,0.00004546729,0.00006868781,0.000052477666],"domain_scores_gemma":[0.9995351,0.00012360571,0.00005389392,0.0000807254,0.000122799,0.00008387976],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002705359,0.0004449874,0.0004909945,0.0011127176,0.0008701821,0.000789134,0.0005891729,0.0007203927,0.011908456],"category_scores_gemma":[0.0026150045,0.00021289059,0.00033536053,0.0006696529,0.0007970664,0.00090244145,0.0015317352,0.0013721948,0.0012799694],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015165294,0.0002941055,0.0049965354,0.0002833486,0.000069905065,0.00079695304,0.0005225713,0.15572509,0.04375528,0.56058675,0.0123283025,0.21912464],"study_design_scores_gemma":[0.0001346974,0.0005008237,0.0027585225,0.00008158302,0.000054149266,0.00076780515,0.0006592649,0.3738786,0.034467526,0.559068,0.027570529,0.000058473484],"about_ca_topic_score_codex":0.0010011967,"about_ca_topic_score_gemma":0.00095346494,"teacher_disagreement_score":0.011908456,"about_ca_system_score_codex":0.0005861385,"about_ca_system_score_gemma":0.0003840839,"threshold_uncertainty_score":0.039837718},"labels":[],"label_agreement":null},{"id":"W2943003255","doi":"10.1016/j.comgeo.2020.101712","title":"Minimum ply covering of points with disks and squares","year":2020,"lang":"en","type":"preprint","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Disjoint sets; Mathematics; Bounded function; Dimension (graph theory); Constant (computer programming); Approximation algorithm; Plane (geometry); Time complexity; Point (geometry); Set (abstract data type); Polynomial; Algorithm; Discrete mathematics; Computer science; Geometry; Mathematical analysis","score_opus":0.022729152282311243,"score_gpt":0.2543234763478237,"score_spread":0.23159432406551247,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2943003255","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35765356,0.00066068134,0.6264122,0.00035832895,0.00008136728,0.000097188495,0.000683043,0.0006534408,0.013400167],"genre_scores_gemma":[0.7385189,0.00033960846,0.25147638,0.00007063082,0.000050455576,0.00012834983,0.0010097657,0.00039094134,0.008014994],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99927694,0.00021651546,0.000044554585,0.000116048206,0.00023723012,0.00010880127],"domain_scores_gemma":[0.9981267,0.0009488632,0.00014950609,0.0004357879,0.00018812505,0.00015101906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004839741,0.00080402876,0.0014792341,0.0011204915,0.0007719951,0.0014076768,0.0012976725,0.0011720189,0.0051811505],"category_scores_gemma":[0.006123016,0.00071593584,0.00066899334,0.0010910201,0.00086524733,0.0017669483,0.0028781963,0.00101714,0.00073937385],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015401979,0.00018657645,0.0057325037,0.00072373124,0.00011719392,0.0004936404,0.00077223656,0.5177103,0.030889431,0.17604347,0.012476049,0.25331458],"study_design_scores_gemma":[0.00006950438,0.0002299202,0.0016944623,0.000046746463,0.000026227266,0.0003925393,0.00020059085,0.8354889,0.010680746,0.14408194,0.0070667625,0.000021590733],"about_ca_topic_score_codex":0.0013099088,"about_ca_topic_score_gemma":0.0010250391,"teacher_disagreement_score":0.0051811505,"about_ca_system_score_codex":0.0005582918,"about_ca_system_score_gemma":0.0003676318,"threshold_uncertainty_score":0.017332733},"labels":[],"label_agreement":null},{"id":"W2949103311","doi":"10.1016/j.comgeo.2020.101633","title":"Universal hinge patterns for folding strips efficiently into any grid polyhedron","year":2020,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Modular Robots and Swarm Intelligence","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Polyhedron; STRIPS; Surface (topology); Grid; Unit cube; Stack (abstract data type); Hinge; Folding (DSP implementation); Square (algebra); Geometry; Point (geometry); Cube (algebra); Grid pattern; Computer science; Combinatorics; Mathematics; Topology (electrical circuits); Algorithm; Physics; Structural engineering; Engineering; Classical mechanics","score_opus":0.02030029153345301,"score_gpt":0.22871452974379544,"score_spread":0.20841423821034244,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949103311","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07908906,0.00006750101,0.9046238,0.00008012786,0.000055845885,0.000058390688,0.00015311402,0.0013611626,0.014510956],"genre_scores_gemma":[0.6305395,0.0001252672,0.36193237,0.00006721236,0.000011748023,0.00013935173,0.0003815198,0.00045033186,0.0063527203],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998479,0.00001954824,0.000012873688,0.000035322195,0.00005114135,0.0000331702],"domain_scores_gemma":[0.99975175,0.0000438084,0.000028554474,0.00012303957,0.00002790118,0.0000249264],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015476321,0.0004896356,0.00042465664,0.00033024498,0.00031626018,0.00049643207,0.0007517755,0.00030300432,0.005779597],"category_scores_gemma":[0.0006932446,0.00029304603,0.000350659,0.00046613437,0.00059527,0.00084502716,0.0015608743,0.00083982915,0.0011212907],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035267195,0.00020980244,0.001803781,0.00036859806,0.000040713,0.0004003518,0.00042166497,0.20089383,0.08089996,0.28988007,0.010852535,0.41387603],"study_design_scores_gemma":[0.00009883311,0.0004432482,0.0010518207,0.00007930535,0.000029571487,0.00041393202,0.00031609138,0.66220105,0.041399874,0.27237833,0.021546852,0.00004113417],"about_ca_topic_score_codex":0.00030376675,"about_ca_topic_score_gemma":0.00075915497,"teacher_disagreement_score":0.005779597,"about_ca_system_score_codex":0.00020734308,"about_ca_system_score_gemma":0.00023541937,"threshold_uncertainty_score":0.019334674},"labels":[],"label_agreement":null},{"id":"W2951594256","doi":"10.1016/j.comgeo.2019.101595","title":"Self-approaching paths in simple polygons","year":2019,"lang":"en","type":"preprint","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek; Fonds De La Recherche Scientifique - FNRS","keywords":"Polygon (computer graphics); Simple polygon; Mathematics; Shortest path problem; Path (computing); Point in polygon; Point (geometry); Polygon covering; Rectilinear polygon; Simple (philosophy); Position (finance); Equiangular polygon; Combinatorics; Monotone polygon; Computer science; Geometry","score_opus":0.020201440422095165,"score_gpt":0.26626515626049124,"score_spread":0.2460637158383961,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951594256","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51438564,0.00040668223,0.4404887,0.00028947697,0.00017091917,0.00013124538,0.0004068568,0.0004955502,0.043224968],"genre_scores_gemma":[0.8355811,0.0005885307,0.13039297,0.000077344004,0.000048725386,0.0000983972,0.00066775974,0.000353991,0.032191176],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99976975,0.000047027297,0.000010313831,0.000043316308,0.00009652082,0.000032986827],"domain_scores_gemma":[0.99949443,0.00022365042,0.00007605216,0.000049768365,0.0000802643,0.00007579165],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022451032,0.00039840615,0.00030255486,0.0012443418,0.0007541979,0.001351043,0.0006462427,0.0007109518,0.005458156],"category_scores_gemma":[0.002472289,0.00042151904,0.00040111414,0.00080799154,0.0009225673,0.0012756147,0.0013960247,0.00091758976,0.00068365195],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016683439,0.000088365094,0.0018790488,0.00017129838,0.000020446387,0.00047165118,0.00060936826,0.13668442,0.005331921,0.8055777,0.0027882704,0.046210766],"study_design_scores_gemma":[0.00003327505,0.000077452445,0.0006470894,0.000050630693,0.000012441118,0.00031663294,0.00032331556,0.3662847,0.0030469396,0.6161013,0.013087052,0.00001910683],"about_ca_topic_score_codex":0.001335855,"about_ca_topic_score_gemma":0.0012379109,"teacher_disagreement_score":0.005458156,"about_ca_system_score_codex":0.0005367678,"about_ca_system_score_gemma":0.00038573085,"threshold_uncertainty_score":0.018259346},"labels":[],"label_agreement":null},{"id":"W2952609385","doi":"10.1016/j.comgeo.2018.06.006","title":"Constrained generalized Delaunay graphs are plane spanners","year":2018,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds Québécois de la Recherche sur la Nature et les Technologies; Exploratory Research for Advanced Technology; Carleton University","keywords":"Combinatorics; Delaunay triangulation; Mathematics; Rectangle; Regular polygon; Planar graph; Graph; Discrete mathematics; Geometry","score_opus":0.017701356106718167,"score_gpt":0.25561959239396986,"score_spread":0.2379182362872517,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952609385","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16046824,0.0005769875,0.8002415,0.00033401392,0.00015435473,0.00015892494,0.00051553594,0.00055198855,0.03699852],"genre_scores_gemma":[0.7081151,0.00087099004,0.2542778,0.00026994947,0.00009588691,0.00020867528,0.0008347462,0.00048920774,0.034837585],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99963975,0.000054602413,0.0000166245,0.00011525175,0.0001354787,0.00003821009],"domain_scores_gemma":[0.9994722,0.00013450829,0.00011815717,0.000098449855,0.000108940796,0.000067711684],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018010594,0.0006695265,0.00054828345,0.0011764505,0.00056195044,0.001356013,0.0009789505,0.00085509976,0.009845913],"category_scores_gemma":[0.0011954267,0.0005052225,0.00043052426,0.0013430562,0.0009488988,0.0018335982,0.0019739799,0.0011296953,0.0014752812],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010253902,0.000055226414,0.0010644352,0.00022226656,0.000039472718,0.0004915362,0.00036754427,0.09208482,0.015227105,0.76317346,0.0051152715,0.12205636],"study_design_scores_gemma":[0.000023662407,0.00008333824,0.0010998147,0.00008192868,0.000028654846,0.00066813105,0.00046879082,0.20875639,0.009290104,0.7399912,0.0394673,0.000040754683],"about_ca_topic_score_codex":0.0009014738,"about_ca_topic_score_gemma":0.0015716277,"teacher_disagreement_score":0.009845913,"about_ca_system_score_codex":0.0004071219,"about_ca_system_score_gemma":0.00031793345,"threshold_uncertainty_score":0.032937884},"labels":[],"label_agreement":null},{"id":"W2953201848","doi":"10.1016/j.comgeo.2021.101820","title":"Minimum rectilinear polygons for given angle sequences","year":2021,"lang":"en","type":"preprint","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"H2020 European Research Council; European Research Council; Natural Sciences and Engineering Research Council of Canada; Ministry of Science and ICT, South Korea; Comisión Nacional de Investigación Científica y Tecnológica; National Research Foundation of Korea","keywords":"Monotone polygon; Rectilinear polygon; Polygon (computer graphics); Polygon covering; Minimum bounding box; Equiangular polygon; Bounding overwatch; Combinatorics; Star-shaped polygon; Mathematics; Sequence (biology); Point in polygon; Boundary (topology); Planar; Perimeter; Simple polygon; Regular polygon; Geometry; Computer science; Mathematical analysis; Computer graphics (images)","score_opus":0.0352975961796297,"score_gpt":0.29712759337391725,"score_spread":0.26182999719428757,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2953201848","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11432308,0.00035178216,0.85280174,0.00031614793,0.00012560717,0.00021579472,0.0022792388,0.0007755481,0.02881112],"genre_scores_gemma":[0.3582523,0.00058980996,0.61908877,0.0001060252,0.000052224048,0.00030306893,0.0045222775,0.0012615353,0.015823973],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99942505,0.00011344532,0.00004341268,0.00013909703,0.00019594081,0.000083051025],"domain_scores_gemma":[0.99866474,0.0006506942,0.00019231836,0.00020959323,0.00020846614,0.000074308286],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045727188,0.00094920665,0.00102527,0.001328104,0.0005328252,0.0017076731,0.0011629803,0.0009729262,0.011144802],"category_scores_gemma":[0.005378228,0.0007711484,0.0007388784,0.0014502358,0.00066371914,0.0022951958,0.0012154347,0.0014653514,0.0017119552],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007788041,0.00022516768,0.0023681112,0.00090909534,0.00004635837,0.00040751218,0.00054755993,0.33583942,0.018982753,0.37381893,0.015887748,0.25018853],"study_design_scores_gemma":[0.000101124206,0.0001693058,0.0012180838,0.00015147337,0.00003061059,0.00048552768,0.00036249647,0.5758457,0.017306507,0.3834349,0.020852659,0.000041708805],"about_ca_topic_score_codex":0.0011472404,"about_ca_topic_score_gemma":0.0016930262,"teacher_disagreement_score":0.011144802,"about_ca_system_score_codex":0.00063948723,"about_ca_system_score_gemma":0.0005270625,"threshold_uncertainty_score":0.037283003},"labels":[],"label_agreement":null},{"id":"W2953304270","doi":"10.1016/j.comgeo.2004.07.003","title":"Planar minimally rigid graphs and pseudo-triangulations","year":2004,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Structural Analysis and Optimization","field":"Engineering","cited_by":94,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"Natural Sciences and Engineering Research Council of Canada; Deutsche Forschungsgemeinschaft; Ministerio de Ciencia y Tecnología; McGill University; National Institutes of Health; National Science Foundation","keywords":"Planar graph; Embedding; Combinatorics; Mathematical proof; Planar; Generalization; Rigidity (electromagnetism); Mathematics; Statement (logic); Plane (geometry); Book embedding; Discrete mathematics; Computer science; Graph; Chordal graph; 1-planar graph; Geometry; Physics; Artificial intelligence; Computer graphics (images); Mathematical analysis","score_opus":0.006361768937535068,"score_gpt":0.20212057447444132,"score_spread":0.19575880553690625,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2953304270","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07981372,0.0013396945,0.88405603,0.0010106007,0.00018706772,0.00005879766,0.00038014955,0.0002983313,0.03285568],"genre_scores_gemma":[0.7217486,0.0028077695,0.24325296,0.00063789,0.00037767758,0.00022542047,0.0010427468,0.00039482058,0.029512132],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99954635,0.00017680405,0.000016280148,0.00009685208,0.00012717072,0.000036549936],"domain_scores_gemma":[0.99894863,0.00045762505,0.00019041088,0.00018177401,0.00014751058,0.000074009055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036636423,0.000730511,0.00053927297,0.0016472068,0.0008941959,0.0014020123,0.0013547466,0.0011847487,0.007033595],"category_scores_gemma":[0.003278114,0.00063681515,0.0006841727,0.0013779321,0.0020765432,0.0023997608,0.0017606632,0.0017522575,0.0010335846],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030213047,0.000012081076,0.0001565785,0.000057884074,0.000010598518,0.000058989554,0.00012029381,0.021041546,0.0011421413,0.957203,0.0017217445,0.018445017],"study_design_scores_gemma":[0.0000058013893,0.000009545173,0.00014640427,0.000009343028,0.000004820592,0.00007673022,0.00005998423,0.026241742,0.00030288234,0.9697483,0.00338641,0.000007887963],"about_ca_topic_score_codex":0.0008376565,"about_ca_topic_score_gemma":0.0012485303,"teacher_disagreement_score":0.007033595,"about_ca_system_score_codex":0.00047527972,"about_ca_system_score_gemma":0.0003143981,"threshold_uncertainty_score":0.023529708},"labels":[],"label_agreement":null},{"id":"W2963762723","doi":"10.1016/j.comgeo.2019.04.004","title":"Approximating dominating set on intersection graphs of rectangles and <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.svg\"><mml:mi mathvariant=\"sans-serif\">L</mml:mi></mml:math>-frames","year":2019,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Diagonal; Combinatorics; Intersection (aeronautics); Mathematics; Approximation algorithm; Line (geometry); Logarithm; Line segment; Dominating set; Discrete mathematics; Geometry; Graph; Mathematical analysis","score_opus":0.01817942780823386,"score_gpt":0.2655638147394427,"score_spread":0.24738438693120882,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963762723","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36147282,0.0015846154,0.6098288,0.0015029581,0.00016765772,0.00021464497,0.0025620486,0.0010794792,0.021586975],"genre_scores_gemma":[0.61702853,0.0010250789,0.3664624,0.00028981315,0.00015482298,0.00018252524,0.0050137606,0.0005076116,0.00933539],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978072,0.0007083664,0.00009890039,0.00057878345,0.00046574645,0.0003410393],"domain_scores_gemma":[0.99116373,0.005836886,0.0006731926,0.0010271895,0.000729281,0.0005698576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00205473,0.0012883021,0.001739337,0.0025024477,0.0010282696,0.0034836875,0.002725054,0.0011057536,0.0063908277],"category_scores_gemma":[0.012678498,0.0009796479,0.0015085385,0.0039059622,0.0012648718,0.0038681687,0.0023458682,0.0016553813,0.0010137206],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013722283,0.0003186629,0.008763983,0.0007977737,0.00026804744,0.00037221305,0.001041752,0.5702512,0.006320544,0.2544041,0.022396363,0.13369308],"study_design_scores_gemma":[0.0000640419,0.00010836046,0.0016386778,0.00007481333,0.00007284961,0.00025153125,0.0004195039,0.84884894,0.003351421,0.14010045,0.0050457837,0.000023678293],"about_ca_topic_score_codex":0.0067110336,"about_ca_topic_score_gemma":0.009493184,"teacher_disagreement_score":0.0067110336,"about_ca_system_score_codex":0.0027727187,"about_ca_system_score_gemma":0.0013815745,"threshold_uncertainty_score":0.02137947},"labels":[],"label_agreement":null},{"id":"W2981662868","doi":"10.1016/j.comgeo.2020.101700","title":"Folding polyominoes with holes into a cube","year":2020,"lang":"en","type":"preprint","venue":"Computational Geometry","topic":"Advanced Materials and Mechanics","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Austrian Science Fund; National Science Foundation","keywords":"Polyomino; Cube (algebra); Unit cube; Combinatorics; Folding (DSP implementation); Simple (philosophy); Mathematics; Tree (set theory); Computer science; Geometry","score_opus":0.014492423458373245,"score_gpt":0.23359799813320212,"score_spread":0.21910557467482888,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2981662868","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5622942,0.00033046817,0.3477803,0.0006916761,0.0006837801,0.00020817942,0.00074616075,0.0007145441,0.086550616],"genre_scores_gemma":[0.7169757,0.00039882376,0.25314587,0.00028153032,0.00008419138,0.00018434248,0.00070063537,0.00059925404,0.027629657],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99970907,0.000048720198,0.000021200673,0.00007196335,0.00009475756,0.000054252243],"domain_scores_gemma":[0.9996817,0.00011082796,0.000038125207,0.000079169076,0.000037696205,0.0000524894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002360802,0.00065431924,0.0006322535,0.0004917943,0.00072106894,0.0011782186,0.00073586835,0.0009348517,0.009405203],"category_scores_gemma":[0.0012202645,0.00040133102,0.00065247377,0.000480021,0.001050571,0.0016525232,0.0023690446,0.0013453222,0.0013801536],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00067228545,0.00020578223,0.0016420139,0.00033649534,0.000058345897,0.0009273735,0.0005928989,0.16240732,0.033414107,0.6914991,0.010011251,0.098233126],"study_design_scores_gemma":[0.00012874762,0.0002991343,0.00096187653,0.000095762545,0.000024965386,0.00057151925,0.0005678745,0.3336974,0.014436462,0.6173763,0.031791575,0.00004837212],"about_ca_topic_score_codex":0.0009380454,"about_ca_topic_score_gemma":0.001064703,"teacher_disagreement_score":0.009405203,"about_ca_system_score_codex":0.0003709997,"about_ca_system_score_gemma":0.00044066907,"threshold_uncertainty_score":0.031463504},"labels":[],"label_agreement":null},{"id":"W2987656947","doi":"10.1016/j.comgeo.2019.101592","title":"Colored anchored visibility representations in 2D and 3D space","year":2019,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"Università degli Studi di Perugia; Ministero dell’Istruzione, dell’Università e della Ricerca","keywords":"Visibility; Vertex (graph theory); Combinatorics; Visibility graph; Graph; Representation (politics); Mathematics; Geometry; Physics","score_opus":0.010727061834654588,"score_gpt":0.2637610059200685,"score_spread":0.2530339440854139,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2987656947","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013677542,0.000107297856,0.97980875,0.00012136614,0.00008932028,0.000021776896,0.00016148011,0.00067905325,0.005333385],"genre_scores_gemma":[0.47405115,0.00053243834,0.5117987,0.00019891707,0.00010644949,0.00012105407,0.0008002655,0.000857913,0.011533051],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99957544,0.00009317937,0.000019633459,0.00007694702,0.00016773454,0.00006700247],"domain_scores_gemma":[0.9992767,0.00021429804,0.00006307884,0.0002086693,0.00015856189,0.00007869635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043423893,0.000568989,0.0005969139,0.0012332681,0.00047448123,0.0033495892,0.0012776661,0.0011811164,0.00915342],"category_scores_gemma":[0.002369645,0.00043417685,0.00070362637,0.0012542605,0.0011371267,0.0026374375,0.0026584007,0.0015425868,0.0014506046],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001602981,0.000059937654,0.00033899365,0.000094825875,0.000018444174,0.00014320738,0.00034402285,0.1102243,0.008710206,0.77342916,0.0046401783,0.10183646],"study_design_scores_gemma":[0.000030475081,0.000045365145,0.00018351505,0.000039777035,0.000015487147,0.00009996359,0.00016046266,0.6237394,0.0043207137,0.35710648,0.014225816,0.00003246451],"about_ca_topic_score_codex":0.002053343,"about_ca_topic_score_gemma":0.0026600247,"teacher_disagreement_score":0.00915342,"about_ca_system_score_codex":0.0005500941,"about_ca_system_score_gemma":0.00054995203,"threshold_uncertainty_score":0.03062123},"labels":[],"label_agreement":null},{"id":"W2992950813","doi":"10.1016/j.comgeo.2021.101809","title":"A linear optimization oracle for zonotope computation","year":2021,"lang":"en","type":"preprint","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Polytope; Hyperplane; Oracle; Vertex (graph theory); Enumeration; Mathematics; Set (abstract data type); Computation; Combinatorics; Algorithm; Computer science; Graph","score_opus":0.03192042919016951,"score_gpt":0.29942144909575796,"score_spread":0.26750101990558844,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2992950813","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0074839,0.00028738886,0.9829806,0.00043161272,0.000070344635,0.00004142591,0.00061682734,0.0026049544,0.005482883],"genre_scores_gemma":[0.38767174,0.00043283717,0.59648514,0.00037006428,0.00022067895,0.00020784754,0.0030883367,0.0017490622,0.009774329],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985971,0.0003842906,0.00008658684,0.000324655,0.00042692112,0.00018052274],"domain_scores_gemma":[0.99647456,0.0018958389,0.00011872379,0.00094622414,0.000403084,0.0001615979],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011526309,0.0007793731,0.0015861401,0.00071212155,0.0005313656,0.0020864557,0.0023376746,0.0013233608,0.018418059],"category_scores_gemma":[0.0099013345,0.00055516127,0.00074731547,0.0016461469,0.0009568066,0.0035542178,0.0032810129,0.003109814,0.0034792868],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007884501,0.00026482987,0.0013406309,0.000461142,0.00006737681,0.00013863745,0.00014734386,0.38859913,0.005188399,0.19973245,0.041617494,0.36165407],"study_design_scores_gemma":[0.0000579634,0.00003943829,0.00019742856,0.000021657443,0.000008970328,0.000043912714,0.000025183303,0.87150586,0.0016052519,0.122338064,0.0041425135,0.000013811373],"about_ca_topic_score_codex":0.0039787292,"about_ca_topic_score_gemma":0.005110635,"teacher_disagreement_score":0.018418059,"about_ca_system_score_codex":0.0008441134,"about_ca_system_score_gemma":0.0012771848,"threshold_uncertainty_score":0.061614513},"labels":[],"label_agreement":null},{"id":"W2996115425","doi":"10.1016/j.comgeo.2023.102020","title":"Colouring bottomless rectangles and arborescences","year":2023,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Combinatorics; Mathematics; Corollary; Vertex (graph theory); Monochromatic color; Point (geometry); Order (exchange); Line (geometry); Plane (geometry); Discrete mathematics; Geometry; Graph; Optics; Physics","score_opus":0.024630486044784995,"score_gpt":0.3022855409761604,"score_spread":0.2776550549313754,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2996115425","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.297588,0.00069640815,0.6118328,0.0009076965,0.00033535814,0.000087753055,0.0004962828,0.001277124,0.086778514],"genre_scores_gemma":[0.6927177,0.00077349454,0.27244744,0.00042949177,0.00015189995,0.00011553382,0.00095487817,0.00089320325,0.031516485],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993988,0.00014815552,0.000032619588,0.00018718203,0.000109790315,0.00012336407],"domain_scores_gemma":[0.9978483,0.00089171,0.0002274101,0.0005011092,0.00025040962,0.0002811374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000476376,0.00066979206,0.00061846315,0.0010090143,0.0010397795,0.0023445962,0.0013567067,0.0010244098,0.0125015965],"category_scores_gemma":[0.0031615233,0.0007555053,0.00074880576,0.0013336812,0.0015967822,0.0029125302,0.0022630997,0.0021224653,0.0018058367],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020217196,0.000039880702,0.00072515686,0.00015309968,0.000017149989,0.0002828986,0.00039538075,0.010612448,0.014605651,0.92242795,0.0051402226,0.045397915],"study_design_scores_gemma":[0.0000514621,0.00006440811,0.0007747891,0.000076383665,0.000032567434,0.00051008887,0.0002632874,0.041198574,0.008822914,0.92401963,0.024155306,0.000030541334],"about_ca_topic_score_codex":0.0009683878,"about_ca_topic_score_gemma":0.001338558,"teacher_disagreement_score":0.0125015965,"about_ca_system_score_codex":0.0005786187,"about_ca_system_score_gemma":0.00022679672,"threshold_uncertainty_score":0.041822016},"labels":[],"label_agreement":null},{"id":"W3004391915","doi":"10.1016/j.comgeo.2020.101608","title":"Special issue on the 29th Canadian Conference on Computational Geometry, Guest Editors' foreword","year":2020,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Intersection (aeronautics); Combinatorics; Tree (set theory); Point (geometry); Line (geometry); Line segment; Euclidean geometry; Geometry; Mathematics; Plane (geometry); Computer science; Geography; Cartography","score_opus":0.03324093779524994,"score_gpt":0.251986747020698,"score_spread":0.21874580922544806,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3004391915","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012128318,0.013873667,0.0005204166,0.01637263,0.94817096,0.000054057196,0.000365061,0.00016877327,0.020353071],"genre_scores_gemma":[0.0016981794,0.022752201,0.000711779,0.008676993,0.6861983,0.00010709645,0.00080266746,0.00058708416,0.27846575],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9975141,0.00016478205,0.0001537211,0.00028485825,0.0015996321,0.0002828658],"domain_scores_gemma":[0.99053776,0.0010040242,0.00039917332,0.00034407363,0.005729277,0.001985698],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028656116,0.0030270158,0.003369311,0.0052579734,0.0024955692,0.008481926,0.002866503,0.004329724,0.14759584],"category_scores_gemma":[0.008067095,0.00086751423,0.0016010139,0.0029961215,0.001006403,0.0035526983,0.00272527,0.005456942,0.07696107],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001757084,0.0000080387335,0.000014898615,0.00006148209,0.0000028079444,0.000010944893,0.000002612818,0.000020719823,0.000052330666,0.00019064354,0.99382824,0.00578963],"study_design_scores_gemma":[0.000019942583,0.000022365646,0.0002771941,0.00012341175,0.00001326786,0.000039940187,0.000017738923,0.00012928188,0.00008823567,0.000586657,0.99867296,0.000009090014],"about_ca_topic_score_codex":0.008931921,"about_ca_topic_score_gemma":0.026090736,"teacher_disagreement_score":0.99106807,"about_ca_system_score_codex":0.0028063848,"about_ca_system_score_gemma":0.005255772,"threshold_uncertainty_score":0.49375725},"labels":[],"label_agreement":null},{"id":"W3023901952","doi":"10.1016/j.comgeo.2020.101629","title":"Hamiltonicity for convex shape Delaunay and Gabriel graphs","year":2020,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"H2020 Marie Skłodowska-Curie Actions; Horizon 2020; Consejo Nacional de Ciencia y Tecnología; Ministerio de Economía y Competitividad; Natural Sciences and Engineering Research Council of Canada; Grantová Agentura České Republiky","keywords":"Combinatorics; Mathematics; Regular polygon; Delaunay triangulation; Hamiltonian path; Vertex (graph theory); Upper and lower bounds; Discrete mathematics; Graph; Geometry; Mathematical analysis","score_opus":0.028755503294863937,"score_gpt":0.25226074124532544,"score_spread":0.2235052379504615,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3023901952","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37560186,0.000610465,0.55779505,0.0010914566,0.00009574829,0.00022620792,0.00058926834,0.00026491113,0.06372509],"genre_scores_gemma":[0.8732357,0.00090847124,0.08488528,0.000306397,0.00009219345,0.00028441785,0.0007495335,0.00025452103,0.039283417],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996923,0.00006509936,0.000011836112,0.00006389724,0.00011171383,0.000055298035],"domain_scores_gemma":[0.9985997,0.0007422122,0.00020895993,0.00010124194,0.00019190881,0.00015599547],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036719974,0.0005224673,0.00064163527,0.0015852525,0.0014909515,0.0016327788,0.0011413259,0.0008674622,0.0072782277],"category_scores_gemma":[0.0033897124,0.0006263732,0.0005699736,0.0011517407,0.001964006,0.001449061,0.0017745754,0.001231522,0.0007011283],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052356998,0.00002751631,0.00059883285,0.000059045746,0.000010941287,0.00013389502,0.00035651584,0.026551299,0.0016229601,0.95303065,0.0019731824,0.015582689],"study_design_scores_gemma":[0.000025324533,0.000020749228,0.00043863477,0.000017867433,0.00000897911,0.0000833297,0.00019474901,0.089354895,0.00076474674,0.9053235,0.0037516395,0.000015625965],"about_ca_topic_score_codex":0.007784344,"about_ca_topic_score_gemma":0.008932613,"teacher_disagreement_score":0.007784344,"about_ca_system_score_codex":0.0013532019,"about_ca_system_score_gemma":0.00085645745,"threshold_uncertainty_score":0.02434814},"labels":[],"label_agreement":null},{"id":"W3040601751","doi":"10.1016/j.comgeo.2020.101682","title":"An improved construction for spanners of disks","year":2020,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Spanner; Combinatorics; Disjoint sets; Pairwise comparison; Graph; Mathematics; Metric space; Plane (geometry); Metric (unit); Discrete mathematics; Computer science; Geometry","score_opus":0.023646996394319227,"score_gpt":0.2734262103874661,"score_spread":0.2497792139931469,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3040601751","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030037299,0.00022902555,0.94718623,0.00015985373,0.00026812748,0.00009465882,0.0001855974,0.0010795556,0.020759696],"genre_scores_gemma":[0.2612394,0.0004626595,0.7107362,0.00021163064,0.00015460637,0.00020388434,0.00071111677,0.0010783332,0.025202073],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999331,0.0001168725,0.000047695936,0.00014839674,0.00027833015,0.00007777379],"domain_scores_gemma":[0.99911135,0.00021745125,0.000049277663,0.00031452326,0.00017782126,0.00012955353],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050767284,0.000878388,0.00088342244,0.0012831625,0.00089486747,0.0012063226,0.0017541776,0.0008199926,0.011987805],"category_scores_gemma":[0.002308713,0.0006605847,0.0009159143,0.0010288453,0.0011321747,0.0020142405,0.0046846806,0.0021376843,0.0036744652],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002596817,0.00020199241,0.001207712,0.0004886169,0.000050497427,0.00067600457,0.00061788165,0.036793098,0.04971185,0.62801045,0.013256007,0.26872623],"study_design_scores_gemma":[0.00010500767,0.0005574844,0.0009464933,0.00014914967,0.000087448745,0.0012512831,0.00036915528,0.23827659,0.03139861,0.6201022,0.106674865,0.0000816457],"about_ca_topic_score_codex":0.00054235605,"about_ca_topic_score_gemma":0.00078833796,"teacher_disagreement_score":0.011987805,"about_ca_system_score_codex":0.00037323034,"about_ca_system_score_gemma":0.00044424695,"threshold_uncertainty_score":0.040103197},"labels":[],"label_agreement":null},{"id":"W3138447845","doi":"10.1016/s0925-7721(02)00093-7","title":"Computing contour trees in all dimensions","year":2002,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":460,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"University of North Carolina at Chapel Hill; Natural Sciences and Engineering Research Council of Canada; University of British Columbia","keywords":"Simple (philosophy); Computer science; Contour line; Algorithm; Mathematics; Artificial intelligence; Cartography; Geography","score_opus":0.04481388461551654,"score_gpt":0.2730690683067274,"score_spread":0.22825518369121084,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3138447845","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08574105,0.00087026885,0.9049456,0.00035256764,0.00009984215,0.00005441053,0.000554489,0.0017011823,0.0056806025],"genre_scores_gemma":[0.37076816,0.0009743756,0.6217643,0.00009092058,0.00008809056,0.0000799154,0.001396578,0.00048719914,0.0043503917],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993332,0.00010155107,0.00007052905,0.00014464198,0.00025758258,0.00009243809],"domain_scores_gemma":[0.9970059,0.001330577,0.00022566864,0.0008000748,0.00045569194,0.00018211266],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008292071,0.0006596583,0.0012794056,0.0019324474,0.0010049159,0.003467733,0.0014554766,0.00097609044,0.0053854487],"category_scores_gemma":[0.007557273,0.00076324464,0.0006203008,0.003191063,0.0010609501,0.0054003657,0.002495886,0.0013860374,0.0013884513],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046669046,0.00012248344,0.0053571016,0.00045089892,0.00009372753,0.00024780518,0.000632905,0.21212307,0.010736398,0.29511347,0.012230165,0.4624252],"study_design_scores_gemma":[0.00003364111,0.00006022469,0.0007096301,0.0000402727,0.00003600415,0.00012242257,0.0001247135,0.63500136,0.005699695,0.3487515,0.009400516,0.000020073376],"about_ca_topic_score_codex":0.001860953,"about_ca_topic_score_gemma":0.0030600675,"teacher_disagreement_score":0.0053854487,"about_ca_system_score_codex":0.00061560684,"about_ca_system_score_gemma":0.0007756648,"threshold_uncertainty_score":0.01801616},"labels":[],"label_agreement":null},{"id":"W3160363604","doi":"10.1016/j.comgeo.2021.101788","title":"Simultaneous visibility representations of undirected pairs of graphs","year":2021,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Visibility; Combinatorics; Visibility graph; Representation (politics); Vertex (graph theory); Mathematics; Enhanced Data Rates for GSM Evolution; Graph; Undirected graph; Geometry; Computer science; Physics; Artificial intelligence; Optics","score_opus":0.015585531037700577,"score_gpt":0.2782645236419245,"score_spread":0.26267899260422395,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3160363604","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05589409,0.00020913855,0.93145525,0.0001981376,0.00009389414,0.00006773954,0.00041159522,0.0008320849,0.010837954],"genre_scores_gemma":[0.72458124,0.00041448337,0.26691166,0.00007356674,0.00007565743,0.00011976757,0.0013611178,0.0005092965,0.0059531494],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995363,0.0000994399,0.000022069713,0.00012424405,0.00014178986,0.00007618558],"domain_scores_gemma":[0.99877363,0.0004681409,0.00014274685,0.00031747704,0.00019368136,0.00010430843],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035193097,0.00068402564,0.000688972,0.0013787951,0.00046835103,0.0023830486,0.0013658206,0.0012133394,0.008003403],"category_scores_gemma":[0.0035206124,0.0005570552,0.0008450187,0.0014003043,0.0006874911,0.003971102,0.0024747022,0.0017092753,0.00090001605],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004890074,0.0001447669,0.0013087827,0.00047731458,0.000069337875,0.0006827342,0.0012327058,0.13582572,0.019782005,0.6069119,0.007942299,0.2251334],"study_design_scores_gemma":[0.000046732013,0.00008740888,0.0004368644,0.00010042428,0.00004503089,0.00029423286,0.0003832047,0.63167435,0.0086060995,0.34672034,0.011575108,0.00003024027],"about_ca_topic_score_codex":0.0013108099,"about_ca_topic_score_gemma":0.0022151668,"teacher_disagreement_score":0.008003403,"about_ca_system_score_codex":0.0003969769,"about_ca_system_score_gemma":0.00040309536,"threshold_uncertainty_score":0.026774108},"labels":[],"label_agreement":null},{"id":"W4205206153","doi":"10.1016/j.comgeo.2014.09.003","title":"Guest Editor's foreword","year":2014,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Posthumanist Ethics and Activism","field":"Social Sciences","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Psychology","score_opus":0.0216056271453652,"score_gpt":0.31674415410414314,"score_spread":0.29513852695877796,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205206153","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006517364,0.0014586152,0.00014495413,0.08401832,0.9119312,0.000008221668,0.00004662016,0.000033969718,0.0022930056],"genre_scores_gemma":[0.0016183734,0.0015857626,0.0002032825,0.047524143,0.9265834,0.000028270459,0.000043702665,0.00006909516,0.022343911],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9977143,0.00037058478,0.0002551677,0.00035676023,0.0010464716,0.00025677244],"domain_scores_gemma":[0.98253673,0.005796098,0.0011618626,0.00084524153,0.0072945836,0.0023654497],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033887636,0.001243275,0.0015835214,0.0019040294,0.0024469143,0.006163469,0.0020423313,0.010427924,0.036074165],"category_scores_gemma":[0.0247818,0.0005821935,0.0012718133,0.0009294491,0.0016435824,0.002483486,0.002186528,0.012634784,0.013932586],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000159429,0.0000037568363,0.00002325384,0.000049473638,0.0000046544064,0.000080065285,0.0000094996985,0.000013381758,0.000033341148,0.00048294204,0.9962121,0.003071554],"study_design_scores_gemma":[0.000026308695,0.00001940503,0.00026302735,0.0002115057,0.000017190134,0.0002457757,0.00007308103,0.00014293978,0.00014130345,0.0014698097,0.99737644,0.000013292529],"about_ca_topic_score_codex":0.0012996385,"about_ca_topic_score_gemma":0.0025525738,"teacher_disagreement_score":0.036074165,"about_ca_system_score_codex":0.0017607639,"about_ca_system_score_gemma":0.0022507398,"threshold_uncertainty_score":0.120680094},"labels":[],"label_agreement":null},{"id":"W4205367317","doi":"10.1016/j.comgeo.2012.01.009","title":"Editorial","year":2012,"lang":"en","type":"editorial","venue":"Computational Geometry","topic":"","field":"","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University; University of New Brunswick","funders":"","keywords":"Political science","score_opus":0.010550432605954918,"score_gpt":0.28645453498467144,"score_spread":0.27590410237871654,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205367317","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00005581882,0.005339566,0.00026651213,0.051491417,0.93193936,0.000035319295,0.00014979174,0.00012645406,0.010595845],"genre_scores_gemma":[0.0010488353,0.004785775,0.00034784895,0.0266587,0.90621114,0.00005775579,0.00019544255,0.00014203014,0.060552504],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9968213,0.000620169,0.00025029003,0.00037815745,0.0016338886,0.000296253],"domain_scores_gemma":[0.9897938,0.002553495,0.0007348945,0.00058214075,0.004306146,0.002029609],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032136694,0.002382319,0.0021289578,0.0039943717,0.0024321063,0.006236742,0.0023427645,0.008483627,0.052093722],"category_scores_gemma":[0.019239279,0.0007782339,0.0017877113,0.0013573975,0.0017870952,0.002331322,0.0021836741,0.009181774,0.027662037],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009913388,0.0000024244248,0.000007572286,0.000032447537,0.000004082184,0.000037231566,0.0000021606259,0.000009012961,0.000009758456,0.00014680682,0.9969074,0.0028311615],"study_design_scores_gemma":[0.00003252781,0.000007514997,0.00010144125,0.00019105716,0.000020779633,0.00013555297,0.000013088201,0.000074944604,0.00005306498,0.00097417913,0.9983885,0.000007392775],"about_ca_topic_score_codex":0.0019169315,"about_ca_topic_score_gemma":0.005086319,"teacher_disagreement_score":0.052093722,"about_ca_system_score_codex":0.0023912168,"about_ca_system_score_gemma":0.0026925656,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W4205404903","doi":"10.1016/j.comgeo.2012.07.002","title":"Foreword","year":2012,"lang":"en","type":"article","venue":"Computational Geometry","topic":"","field":"","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Philosophy","score_opus":0.027905482584484134,"score_gpt":0.29332429425982853,"score_spread":0.2654188116753444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205404903","genre_codex":"editorial","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004890433,0.019964863,0.005565462,0.14002246,0.4228219,0.00014386949,0.0016823277,0.0007967581,0.40851337],"genre_scores_gemma":[0.0042954157,0.0072688214,0.0015045332,0.034148373,0.086510874,0.00012592271,0.0011946505,0.00081924384,0.86413217],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99922657,0.00011411229,0.00004407261,0.00013878202,0.00039476415,0.00008165301],"domain_scores_gemma":[0.99707365,0.0005121061,0.000118246964,0.00025716028,0.0015259647,0.0005128944],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00097371585,0.0009790951,0.0008263966,0.001978695,0.0018811506,0.0039279023,0.001212011,0.0026196002,0.22730383],"category_scores_gemma":[0.0061088135,0.00027106752,0.0005911928,0.0011612927,0.0010804274,0.0032269876,0.0022751712,0.004517827,0.19777411],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009488271,0.000005329615,0.000018105446,0.000055120552,0.0000014363478,0.000011797741,0.000013058298,0.000011774778,0.000082556966,0.0070450157,0.97087574,0.021870576],"study_design_scores_gemma":[0.0000033121364,0.00000645608,0.00007729175,0.000075945994,0.0000022809918,0.000031818094,0.000017210206,0.000022264887,0.00008900104,0.0041654203,0.9955059,0.0000031132033],"about_ca_topic_score_codex":0.0021228096,"about_ca_topic_score_gemma":0.003671949,"teacher_disagreement_score":0.77269614,"about_ca_system_score_codex":0.0020683547,"about_ca_system_score_gemma":0.0019806921,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W4205468123","doi":"10.1016/j.comgeo.2012.01.010","title":"Editorial","year":2012,"lang":"en","type":"editorial","venue":"Computational Geometry","topic":"","field":"","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science","score_opus":0.010550432605954918,"score_gpt":0.28645453498467144,"score_spread":0.27590410237871654,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205468123","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00005581882,0.005339566,0.00026651213,0.051491417,0.93193936,0.000035319295,0.00014979174,0.00012645406,0.010595845],"genre_scores_gemma":[0.0010488353,0.004785775,0.00034784895,0.0266587,0.90621114,0.00005775579,0.00019544255,0.00014203014,0.060552504],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9968213,0.000620169,0.00025029003,0.00037815745,0.0016338886,0.000296253],"domain_scores_gemma":[0.9897938,0.002553495,0.0007348945,0.00058214075,0.004306146,0.002029609],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032136694,0.002382319,0.0021289578,0.0039943717,0.0024321063,0.006236742,0.0023427645,0.008483627,0.052093722],"category_scores_gemma":[0.019239279,0.0007782339,0.0017877113,0.0013573975,0.0017870952,0.002331322,0.0021836741,0.009181774,0.027662037],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009913388,0.0000024244248,0.000007572286,0.000032447537,0.000004082184,0.000037231566,0.0000021606259,0.000009012961,0.000009758456,0.00014680682,0.9969074,0.0028311615],"study_design_scores_gemma":[0.00003252781,0.000007514997,0.00010144125,0.00019105716,0.000020779633,0.00013555297,0.000013088201,0.000074944604,0.00005306498,0.00097417913,0.9983885,0.000007392775],"about_ca_topic_score_codex":0.0019169315,"about_ca_topic_score_gemma":0.005086319,"teacher_disagreement_score":0.052093722,"about_ca_system_score_codex":0.0023912168,"about_ca_system_score_gemma":0.0026925656,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W4207027624","doi":"10.1016/j.comgeo.2017.06.010","title":"Table cartogram","year":2017,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; University of Manitoba; University of Waterloo; University of British Columbia","funders":"","keywords":"Rectangle; Table (database); Quadrilateral; Regular polygon; Mathematics; Partition (number theory); Combinatorics; Adjacency list; Geometry; Computer science; Physics; Database","score_opus":0.024357971888012264,"score_gpt":0.3034193636811764,"score_spread":0.27906139179316414,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4207027624","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019609766,0.0013389979,0.30172163,0.0016588992,0.0033630421,0.0008169754,0.07045477,0.023535194,0.5775007],"genre_scores_gemma":[0.18816331,0.002997437,0.36121127,0.0006416532,0.0005871039,0.0005922506,0.07359351,0.0048846537,0.36732882],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9998049,0.000015016254,0.00000975938,0.00005735999,0.00008814877,0.00002481494],"domain_scores_gemma":[0.9997876,0.000026324555,0.00000968403,0.00005015275,0.000101365855,0.000024971836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007760942,0.0009745771,0.0007109942,0.0021629927,0.0009857086,0.0021583347,0.00082293944,0.000668172,0.2797055],"category_scores_gemma":[0.0006273612,0.00038995556,0.00064106926,0.0028626132,0.0003418263,0.00093567104,0.00087321585,0.0005806789,0.06887451],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037196247,0.000053798078,0.00090954336,0.00053149596,0.00002830305,0.0009219984,0.0002008671,0.009673065,0.0113556115,0.05965533,0.3668457,0.5494524],"study_design_scores_gemma":[0.000054238943,0.00007643886,0.0012375716,0.000090450885,0.00002260304,0.0008396139,0.00023170072,0.016445883,0.0056678834,0.016941173,0.95834506,0.000047381192],"about_ca_topic_score_codex":0.0072479057,"about_ca_topic_score_gemma":0.0064391545,"teacher_disagreement_score":0.2797055,"about_ca_system_score_codex":0.00041654494,"about_ca_system_score_gemma":0.0011363951,"threshold_uncertainty_score":0.9357081},"labels":[],"label_agreement":null},{"id":"W4210743659","doi":"10.1016/j.comgeo.2020.101632","title":"Preface","year":2020,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Genetics, Bioinformatics, and Biomedical Research","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Memorial University of Newfoundland; Fields Institute for Research in Mathematical Sciences","keywords":"Delaunay triangulation; Computer science; Tetrahedron; Algorithm; Pruning; Computation; Representation (politics); Triangulation; Alpha (finance); Mathematics; Geometry","score_opus":0.024509652189703426,"score_gpt":0.2886808771066543,"score_spread":0.2641712249169509,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4210743659","genre_codex":"other","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002281062,0.01104685,0.0391128,0.05813331,0.2493657,0.00065434346,0.019534178,0.003897299,0.6159744],"genre_scores_gemma":[0.013527312,0.006033068,0.012418451,0.008893482,0.046407927,0.0003831879,0.017024932,0.0025228795,0.8927887],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992999,0.00012705768,0.000046155066,0.00013926582,0.00034131212,0.0000463671],"domain_scores_gemma":[0.9936382,0.001138984,0.00014905224,0.00069035025,0.0035905375,0.0007928885],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001509203,0.00078204466,0.0006867606,0.0024046768,0.0017842249,0.0030609146,0.0011739313,0.0008868809,0.38355535],"category_scores_gemma":[0.013125038,0.00027824496,0.0005341705,0.0019979521,0.00064020534,0.002395026,0.0018013536,0.002664756,0.22942114],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001650681,0.000013370301,0.00007215952,0.00005242833,0.0000018191716,0.000024751647,0.000047662164,0.00014164291,0.00008829761,0.010783212,0.9540024,0.034755636],"study_design_scores_gemma":[0.000004661602,0.000010160777,0.00020253065,0.000079064506,0.0000016097548,0.000046838006,0.00005043584,0.000090084635,0.00010112245,0.009272339,0.99013585,0.0000053313324],"about_ca_topic_score_codex":0.0031708677,"about_ca_topic_score_gemma":0.0037295332,"teacher_disagreement_score":0.38355535,"about_ca_system_score_codex":0.0019169663,"about_ca_system_score_gemma":0.0018001668,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W4210982562","doi":"10.1016/j.comgeo.2004.01.001","title":"Editorial","year":2004,"lang":"en","type":"editorial","venue":"Computational Geometry","topic":"","field":"","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Philosophy","score_opus":0.007576107578959697,"score_gpt":0.2780825414590256,"score_spread":0.2705064338800659,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4210982562","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000057270674,0.004736136,0.00023866129,0.04137818,0.94248325,0.00003493182,0.00012579396,0.00010981009,0.010835842],"genre_scores_gemma":[0.001350849,0.005670636,0.00045751335,0.023265094,0.89109945,0.00006416144,0.00021952347,0.00014020457,0.07773267],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9972779,0.00055138784,0.00024117567,0.00031845027,0.0013726222,0.000238365],"domain_scores_gemma":[0.98874646,0.002699828,0.0007446041,0.0007167114,0.0051628454,0.0019295831],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0031180868,0.0024361948,0.0023471608,0.004813872,0.0024463418,0.0055542635,0.002691599,0.008390175,0.051657345],"category_scores_gemma":[0.017457275,0.0008851573,0.0018918288,0.0015714788,0.0017448955,0.0022191193,0.001802401,0.008893595,0.026380265],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012399099,0.000002967551,0.000008328808,0.00003676301,0.000004783229,0.00004703074,0.0000020503956,0.000011029681,0.000011257674,0.0001466403,0.99678767,0.0029292228],"study_design_scores_gemma":[0.00003609632,0.000007661976,0.00010894367,0.00015406495,0.000024862924,0.0001371604,0.0000121726425,0.000080497055,0.00006812283,0.0008104075,0.99855345,0.0000066024354],"about_ca_topic_score_codex":0.0021747611,"about_ca_topic_score_gemma":0.0048792823,"teacher_disagreement_score":0.9483427,"about_ca_system_score_codex":0.0025636738,"about_ca_system_score_gemma":0.0025438464,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W4211032338","doi":"10.1016/s0925-7721(02)00168-2","title":"Editorial","year":2003,"lang":"en","type":"editorial","venue":"Computational Geometry","topic":"","field":"","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Medicine","score_opus":0.008317735964968896,"score_gpt":0.2779199927020234,"score_spread":0.2696022567370545,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4211032338","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00005831849,0.0050408826,0.0002599873,0.039272606,0.94273776,0.00004032075,0.00013862182,0.000121547426,0.012329881],"genre_scores_gemma":[0.0014905555,0.0065207346,0.00048732827,0.024830133,0.88148344,0.000072984476,0.000250868,0.00017685817,0.08468714],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.997528,0.0004706513,0.00021493631,0.00028841695,0.0012845472,0.00021357261],"domain_scores_gemma":[0.9890427,0.002542507,0.0007167771,0.0006871499,0.0050796657,0.0019312992],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0029470816,0.0023092139,0.0022992406,0.0043130964,0.0023407436,0.005467483,0.0025469407,0.007792439,0.051595163],"category_scores_gemma":[0.016272454,0.00079166127,0.0018476371,0.001544205,0.0017003857,0.0020470873,0.0016733293,0.008643328,0.027501918],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011802522,0.0000026162559,0.000007454975,0.00003503451,0.000004103614,0.000045899098,0.0000019704664,0.000009497658,0.00001018909,0.00013364351,0.9969541,0.0027835844],"study_design_scores_gemma":[0.000038021735,0.0000071906757,0.000109824345,0.00016634348,0.000022912913,0.00014545866,0.000012296781,0.0000812482,0.00006378431,0.00084605714,0.99850047,0.000006346463],"about_ca_topic_score_codex":0.0024348788,"about_ca_topic_score_gemma":0.0057505956,"teacher_disagreement_score":0.94840485,"about_ca_system_score_codex":0.002402781,"about_ca_system_score_gemma":0.0026234153,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W4211077528","doi":"10.1016/j.comgeo.2004.12.001","title":"Editorial","year":2005,"lang":"en","type":"editorial","venue":"Computational Geometry","topic":"","field":"","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Political science","score_opus":0.0077902607951852885,"score_gpt":0.28343394134916894,"score_spread":0.27564368055398364,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4211077528","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000050550938,0.004612244,0.00024433754,0.036125045,0.9483412,0.00003604137,0.00011937692,0.000111518,0.010359717],"genre_scores_gemma":[0.0012315286,0.0053769853,0.00044218297,0.022562636,0.905084,0.000060171067,0.00021468442,0.00012508404,0.06490273],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9970228,0.0005723582,0.00025813538,0.0003303498,0.0015660935,0.00025014495],"domain_scores_gemma":[0.98891175,0.0025905233,0.00075151643,0.0006479224,0.0050156936,0.0020826084],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033876963,0.0024804769,0.0022640475,0.004920839,0.0024462475,0.0057857623,0.002658,0.008344079,0.053403232],"category_scores_gemma":[0.017493388,0.00085403025,0.0019466848,0.0015129548,0.0017279463,0.0022395644,0.0018924465,0.008975281,0.025962882],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010698344,0.0000027443334,0.000007443143,0.000036323363,0.0000046386763,0.000043969427,0.000001950148,0.000010783137,0.000009460472,0.0001564702,0.9968244,0.0028910972],"study_design_scores_gemma":[0.000035267272,0.000008072224,0.00010533795,0.00017945042,0.000023821967,0.00013099409,0.0000122461015,0.00008535613,0.00005879418,0.00081410893,0.9985399,0.000006615683],"about_ca_topic_score_codex":0.002088807,"about_ca_topic_score_gemma":0.0052414765,"teacher_disagreement_score":0.053403232,"about_ca_system_score_codex":0.0024717622,"about_ca_system_score_gemma":0.002627512,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W4211098474","doi":"10.1016/j.comgeo.2007.06.002","title":"Editorial","year":2007,"lang":"en","type":"editorial","venue":"Computational Geometry","topic":"","field":"","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University; Carleton University","funders":"","keywords":"Political science","score_opus":0.009724885773030918,"score_gpt":0.3008812772410711,"score_spread":0.2911563914680402,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4211098474","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000050929742,0.004147457,0.00026197731,0.041644737,0.94246566,0.000038288432,0.00012870849,0.000118365526,0.011143861],"genre_scores_gemma":[0.0010051897,0.005064042,0.00042678535,0.02390698,0.90823376,0.00006180156,0.00021239376,0.00015120843,0.060937732],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99695563,0.00058940344,0.00023711054,0.00032657594,0.0016357584,0.00025548722],"domain_scores_gemma":[0.9884494,0.0028442263,0.0007307302,0.00067313394,0.005261849,0.0020407492],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0032462843,0.0024295475,0.0023045815,0.004620564,0.0024421576,0.0056243152,0.0027548806,0.00837258,0.05337499],"category_scores_gemma":[0.01712651,0.00088563486,0.0019540603,0.00149956,0.0018800686,0.0022415323,0.0020127525,0.009895219,0.02999775],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008167204,0.0000025350694,0.0000067113706,0.00003004104,0.0000039430793,0.000036392987,0.0000016672532,0.0000094640445,0.000008739465,0.00014865842,0.99722075,0.00252298],"study_design_scores_gemma":[0.00003374405,0.0000074306754,0.000094508556,0.00016584949,0.000021410111,0.00013232767,0.000011945616,0.00008719873,0.00006172352,0.0009001186,0.99847704,0.000006784865],"about_ca_topic_score_codex":0.0018426374,"about_ca_topic_score_gemma":0.0048011397,"teacher_disagreement_score":0.946625,"about_ca_system_score_codex":0.002421014,"about_ca_system_score_gemma":0.0028082535,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W4226118606","doi":"10.1016/j.comgeo.2022.101881","title":"On the spanning and routing ratios of the directed Θ6-graph","year":2022,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Windsor","funders":"","keywords":"Combinatorics; Computer science; Spanning tree; Mathematics","score_opus":0.014729963671572522,"score_gpt":0.22568190341607905,"score_spread":0.21095193974450652,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4226118606","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6974978,0.0031986362,0.18287708,0.0021872933,0.0002176607,0.00010809197,0.0010078062,0.00070014776,0.11220547],"genre_scores_gemma":[0.9404987,0.0018485636,0.048033595,0.00031560144,0.00024444817,0.00008461077,0.0007218081,0.00047074104,0.0077819414],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989416,0.00045349693,0.000040833722,0.0001689189,0.0002588133,0.0001363958],"domain_scores_gemma":[0.9857481,0.011378494,0.0010965611,0.00046874225,0.0007481099,0.00056003116],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019208613,0.001093546,0.00071684626,0.0032310958,0.00066264876,0.0021372195,0.0017858087,0.0008513396,0.010673396],"category_scores_gemma":[0.020413268,0.00047078446,0.0004698018,0.0018744156,0.0014454032,0.0029924633,0.0010646563,0.001486236,0.0012297045],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000710822,0.00018523334,0.0038396234,0.0003621087,0.000065700646,0.00025284747,0.00059697963,0.13753092,0.009346047,0.721044,0.012288365,0.11377728],"study_design_scores_gemma":[0.00007411029,0.00022928629,0.0042114467,0.00011719216,0.00010281172,0.0007752137,0.0005718273,0.45179963,0.0063571455,0.52790576,0.0077954507,0.00006017177],"about_ca_topic_score_codex":0.0018764863,"about_ca_topic_score_gemma":0.0015056897,"teacher_disagreement_score":0.010673396,"about_ca_system_score_codex":0.0013553313,"about_ca_system_score_gemma":0.00052638876,"threshold_uncertainty_score":0.035706103},"labels":[],"label_agreement":null},{"id":"W4233479398","doi":"10.1016/j.comgeo.2013.08.004","title":"Editorial","year":2013,"lang":"en","type":"editorial","venue":"Computational Geometry","topic":"","field":"","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Political science","score_opus":0.007911007244067174,"score_gpt":0.2715486134820179,"score_spread":0.26363760623795074,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4233479398","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00005337255,0.0048993197,0.00027186933,0.05201603,0.931349,0.000039973467,0.0001530406,0.00012737083,0.011090075],"genre_scores_gemma":[0.0010489261,0.005062963,0.0003565534,0.028857095,0.9060511,0.00006410382,0.00020249735,0.00016408418,0.058192667],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9964725,0.0006381127,0.0002699393,0.0003927544,0.0018939817,0.00033287695],"domain_scores_gemma":[0.9879216,0.0027989666,0.0008513885,0.0006207099,0.0053763427,0.0024311116],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0034956997,0.0022593646,0.0020995461,0.0041205133,0.0025618698,0.0066093258,0.0025803787,0.00878661,0.054389007],"category_scores_gemma":[0.021690423,0.00077394344,0.0019213677,0.0014931074,0.0019422687,0.0023332147,0.0023091238,0.009384656,0.028139384],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008600674,0.0000023514701,0.000008083824,0.00002987772,0.0000040564446,0.00003660475,0.000002150334,0.000009526516,0.000008136696,0.00015649955,0.997038,0.002696135],"study_design_scores_gemma":[0.00003365076,0.000006815475,0.00009666243,0.00020352365,0.000019681118,0.000121842495,0.0000136955605,0.000077364246,0.000049088412,0.0011921036,0.9981781,0.000007452939],"about_ca_topic_score_codex":0.0024860105,"about_ca_topic_score_gemma":0.0066376473,"teacher_disagreement_score":0.945611,"about_ca_system_score_codex":0.002892557,"about_ca_system_score_gemma":0.0035011356,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W4238393073","doi":"10.1016/j.comgeo.2016.08.005","title":"Guest Editor's foreword","year":2016,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Posthumanist Ethics and Activism","field":"Social Sciences","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science","score_opus":0.02744371421637009,"score_gpt":0.32399872652709827,"score_spread":0.29655501231072817,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4238393073","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000691432,0.0014577595,0.00014063936,0.084056646,0.9118509,0.000008416011,0.00004677214,0.000033752865,0.0023359691],"genre_scores_gemma":[0.0016792195,0.0015724731,0.00020185582,0.0478645,0.9261981,0.000028748533,0.000044299148,0.0000679307,0.02234289],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99769187,0.00037649454,0.000263956,0.00035665068,0.0010458896,0.00026513496],"domain_scores_gemma":[0.9826142,0.0056596166,0.0012144598,0.00085519376,0.0072775017,0.0023790514],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0033305143,0.0012332745,0.001562255,0.0018539407,0.0024266785,0.006077473,0.0020325931,0.010572359,0.037023716],"category_scores_gemma":[0.02497439,0.00057678844,0.0012602516,0.0008994815,0.0016425562,0.0024590644,0.0022037842,0.012320006,0.01428139],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016576276,0.0000038838034,0.00002496428,0.000052302254,0.000004826866,0.000089216635,0.000010135696,0.0000132139585,0.0000352388,0.00047679027,0.99609464,0.0031782864],"study_design_scores_gemma":[0.000026769401,0.000019921561,0.00026999728,0.00021816848,0.00001704339,0.0002683582,0.00007599372,0.00013878084,0.00014608359,0.0014248777,0.99738055,0.000013401004],"about_ca_topic_score_codex":0.0012163116,"about_ca_topic_score_gemma":0.0023898124,"teacher_disagreement_score":0.9629763,"about_ca_system_score_codex":0.0017019582,"about_ca_system_score_gemma":0.002215423,"threshold_uncertainty_score":0.12385666},"labels":[],"label_agreement":null},{"id":"W4280652037","doi":"10.1016/j.comgeo.2022.101897","title":"An Ω(n) lower bound on the number of cell crossings for weighted shortest paths in d-dimensional polyhedral structures","year":2022,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Shortest path problem; Combinatorics; Euclidean shortest path; Mathematics; Convexity; Generalization; Upper and lower bounds; Euclidean geometry; Path (computing); K shortest path routing; Computer science; Geometry; Graph; Mathematical analysis","score_opus":0.01410959408346892,"score_gpt":0.27390265288713267,"score_spread":0.25979305880366377,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4280652037","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12375251,0.005344945,0.7764623,0.0072477567,0.0013296643,0.0005047797,0.004732813,0.0035635957,0.077061504],"genre_scores_gemma":[0.45371768,0.004097271,0.49635035,0.0017953761,0.00076448533,0.0011399492,0.0058566234,0.0024811646,0.033797085],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.995698,0.0007772308,0.00029984256,0.0009829105,0.0015221736,0.0007198812],"domain_scores_gemma":[0.979385,0.014991434,0.0007945981,0.0027709003,0.0009826116,0.0010754125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030611618,0.003011855,0.0023420793,0.002273876,0.002132572,0.0050655347,0.006068841,0.0028935736,0.028028194],"category_scores_gemma":[0.024706226,0.0016447416,0.00241738,0.0034415433,0.0026939807,0.010442918,0.007256626,0.006890434,0.0053653414],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002790033,0.000987594,0.0064148237,0.0027815541,0.00047536156,0.00063115207,0.0007937641,0.33515856,0.039192423,0.20069718,0.06764786,0.34242967],"study_design_scores_gemma":[0.00022572652,0.0002587059,0.001928212,0.0002570112,0.00018064202,0.00055024726,0.00025804294,0.6845272,0.0080578355,0.28706005,0.016604327,0.000092025904],"about_ca_topic_score_codex":0.003165961,"about_ca_topic_score_gemma":0.00843248,"teacher_disagreement_score":0.028028194,"about_ca_system_score_codex":0.0030303837,"about_ca_system_score_gemma":0.0023946634,"threshold_uncertainty_score":0.09376365},"labels":[],"label_agreement":null},{"id":"W4304127965","doi":"10.1016/j.comgeo.2022.101948","title":"On path-greedy geometric spanners","year":2022,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Spanner; Planarity testing; Path (computing); Path graph; Shortest path problem; Line segment; Greedy algorithm; Distance; Graph; Discrete mathematics; Computer science; Algorithm; Line graph; Geometry; Graph power","score_opus":0.014211617992623942,"score_gpt":0.23649283017849868,"score_spread":0.22228121218587474,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4304127965","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02010026,0.0003816837,0.9612358,0.00029165903,0.00014714879,0.000121856465,0.00020486637,0.00062176934,0.016894845],"genre_scores_gemma":[0.27608028,0.0011955157,0.69170207,0.0004991594,0.00023012335,0.00035612404,0.0013331207,0.0010281232,0.02757548],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987581,0.00033977575,0.00005599607,0.000256275,0.00044476124,0.00014515482],"domain_scores_gemma":[0.9974375,0.0014735932,0.00015479581,0.0004556119,0.000276026,0.00020253571],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012540406,0.001567882,0.0016830235,0.001744105,0.0010542836,0.0015406954,0.0028961515,0.0016621604,0.01778732],"category_scores_gemma":[0.0078082974,0.0008948198,0.001111495,0.002337371,0.0020859316,0.0039138678,0.006238125,0.0024184966,0.0029391032],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028998608,0.00016425621,0.0007203217,0.00027421446,0.000054600718,0.00015581073,0.00026513715,0.3622818,0.003857224,0.45277727,0.013112167,0.16604719],"study_design_scores_gemma":[0.000032556665,0.00009207825,0.000115862116,0.000052280102,0.000017494514,0.00008146307,0.000076537035,0.49321985,0.0010465544,0.4995116,0.0057392735,0.00001451575],"about_ca_topic_score_codex":0.001937992,"about_ca_topic_score_gemma":0.0027385356,"teacher_disagreement_score":0.01778732,"about_ca_system_score_codex":0.0008517328,"about_ca_system_score_gemma":0.0009783487,"threshold_uncertainty_score":0.05950445},"labels":[],"label_agreement":null},{"id":"W4376118022","doi":"10.1016/j.comgeo.2023.102011","title":"Simple linear time algorithms for piercing pairwise intersecting disks","year":2023,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Metal Forming Simulation Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Windsor","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Pairwise comparison; Simple (philosophy); Combinatorics; Set (abstract data type); Mathematics; Algorithm; RADIUS; Point (geometry); Plane (geometry); Unit (ring theory); Computer science; Geometry; Statistics","score_opus":0.03213116140602747,"score_gpt":0.30558975604374256,"score_spread":0.2734585946377151,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4376118022","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00879691,0.00013661096,0.98372066,0.00008838606,0.000045837867,0.00011153372,0.00008715995,0.0018922644,0.0051206355],"genre_scores_gemma":[0.12874307,0.00020492286,0.8632494,0.000060895618,0.00003746908,0.00022490196,0.0004580349,0.0005178648,0.0065034395],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99874866,0.00016742678,0.00008289847,0.00025780612,0.00057721295,0.0001659712],"domain_scores_gemma":[0.9976488,0.0012614238,0.00015297417,0.0005238951,0.0003018087,0.00011114502],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067802117,0.0019148954,0.0015991871,0.0009204947,0.00125797,0.002156172,0.003682452,0.0015812492,0.022820625],"category_scores_gemma":[0.004593127,0.0011442819,0.0013210437,0.0019861828,0.0011775695,0.003470712,0.0044213072,0.0022037642,0.004209673],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00050579075,0.00027000613,0.00081091345,0.0006146073,0.00009357678,0.00017746308,0.00041875982,0.3335669,0.015249148,0.08123045,0.010677318,0.5563851],"study_design_scores_gemma":[0.0001739445,0.00011853514,0.00017605703,0.000024041261,0.000029536137,0.00012078743,0.00013667053,0.9214658,0.008478805,0.0626924,0.0065509602,0.000032407126],"about_ca_topic_score_codex":0.0044849813,"about_ca_topic_score_gemma":0.010557147,"teacher_disagreement_score":0.022820625,"about_ca_system_score_codex":0.0012901046,"about_ca_system_score_gemma":0.001445607,"threshold_uncertainty_score":0.07634258},"labels":[],"label_agreement":null},{"id":"W4382404770","doi":"10.1016/j.comgeo.2023.102035","title":"Guest editorial: Special issue on the 33rd Canadian Conference on Computational Geometry (CCCG)","year":2023,"lang":"en","type":"editorial","venue":"Computational Geometry","topic":"3D Modeling in Geospatial Applications","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Dalhousie University","funders":"","keywords":"Geometry; Computer science; Mathematics","score_opus":0.018482199184813492,"score_gpt":0.2555176904222433,"score_spread":0.2370354912374298,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382404770","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000020199468,0.0027586229,0.0000877918,0.01869102,0.97630364,0.000021296535,0.00006194362,0.00004438985,0.0020110495],"genre_scores_gemma":[0.00032954308,0.003093532,0.00010520822,0.012120987,0.96536595,0.000031137894,0.00007028459,0.00008166703,0.01880168],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99336797,0.0006816176,0.00042877774,0.00074086466,0.0042247935,0.00055591355],"domain_scores_gemma":[0.9765173,0.004510125,0.0012784429,0.0005625275,0.011942457,0.005189133],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0060997442,0.0044369195,0.005220381,0.005554527,0.0040826434,0.010684,0.0037954417,0.017528057,0.046775926],"category_scores_gemma":[0.02344218,0.0013662323,0.003308771,0.0019518241,0.0023771927,0.0035769036,0.0025040384,0.014774284,0.028216757],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001942792,0.000004930512,0.000010401188,0.000048694026,0.0000066306243,0.000036199202,0.0000032497514,0.000011823434,0.000026234133,0.00007498325,0.99821293,0.001544604],"study_design_scores_gemma":[0.000077193115,0.000019450214,0.0002443647,0.0002268713,0.000041442338,0.00011318619,0.000025719179,0.00016297754,0.00007712248,0.0005293198,0.9984658,0.000016568187],"about_ca_topic_score_codex":0.0065682,"about_ca_topic_score_gemma":0.023405978,"teacher_disagreement_score":0.9934318,"about_ca_system_score_codex":0.004571672,"about_ca_system_score_gemma":0.0046562036,"threshold_uncertainty_score":0.15648109},"labels":[],"label_agreement":null},{"id":"W4396609193","doi":"10.1016/j.comgeo.2024.102103","title":"Distance queries over dynamic interval graphs","year":2024,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Interval (graph theory); Interval graph; Computer science; Combinatorics; Mathematics; Chordal graph; Theoretical computer science; Graph; 1-planar graph","score_opus":0.012364742372267706,"score_gpt":0.3126870457532805,"score_spread":0.3003223033810128,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396609193","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08708883,0.0008194473,0.8922779,0.00090553204,0.00013425892,0.0002114971,0.002331141,0.010068584,0.006162799],"genre_scores_gemma":[0.6222381,0.00051329547,0.36813644,0.00042665884,0.0001757856,0.0003211343,0.0043541077,0.0007748646,0.0030596405],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9954965,0.0006459684,0.00056936964,0.0012274551,0.0014911726,0.00056955946],"domain_scores_gemma":[0.99065536,0.0033687607,0.0009972488,0.0034529795,0.0011416049,0.00038409856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018563954,0.0009708571,0.0013516787,0.0014726255,0.0008316661,0.0028350332,0.0042715003,0.0013168218,0.0036124657],"category_scores_gemma":[0.011382359,0.0007611666,0.000999486,0.0031749532,0.0012836996,0.01031248,0.0040674037,0.0020858431,0.0008922576],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0024957645,0.00045362677,0.0069701886,0.00082552107,0.00012987721,0.00039315314,0.0012427291,0.22639823,0.033044193,0.24289954,0.02623583,0.45891142],"study_design_scores_gemma":[0.00023168334,0.00046786107,0.0009843495,0.00008452738,0.00007199536,0.00035289407,0.00057799584,0.68078035,0.039887037,0.24442494,0.03201837,0.00011807379],"about_ca_topic_score_codex":0.0025010307,"about_ca_topic_score_gemma":0.0019953458,"teacher_disagreement_score":0.0042715003,"about_ca_system_score_codex":0.0017399944,"about_ca_system_score_gemma":0.0012211243,"threshold_uncertainty_score":0.012624621},"labels":[],"label_agreement":null},{"id":"W4399999583","doi":"10.1016/j.comgeo.2024.102120","title":"Online class cover problem","year":2024,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Science and Engineering Research Board; Natural Sciences and Engineering Research Council of Canada; Human Resource Development Group; Council of Scientific and Industrial Research, India","keywords":"Cover (algebra); Class (philosophy); Computer science; Artificial intelligence; Engineering","score_opus":0.02232847278315972,"score_gpt":0.29096735695886516,"score_spread":0.2686388841757055,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399999583","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11636597,0.0047561093,0.6077309,0.019269325,0.0017962005,0.0007888884,0.0137273185,0.0026129254,0.23295237],"genre_scores_gemma":[0.7745648,0.0028395709,0.11337735,0.0018554828,0.0025146555,0.0006450598,0.008719992,0.000880798,0.09460237],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99799156,0.00047088147,0.00005663647,0.00056268333,0.00054634357,0.0003719704],"domain_scores_gemma":[0.99545383,0.0028456138,0.00027157605,0.0007275858,0.0002780396,0.0004233287],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012272582,0.0012305593,0.0028548585,0.0010178641,0.0015036173,0.004883343,0.0029152704,0.0043530804,0.040712643],"category_scores_gemma":[0.008100627,0.0006402831,0.0011559861,0.0023079463,0.0013691827,0.006819988,0.002414547,0.0047050216,0.0043613217],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001078521,0.000950916,0.0012970474,0.0006853167,0.0001561316,0.00034475845,0.00017674152,0.12136566,0.002088957,0.39784282,0.21584547,0.25816774],"study_design_scores_gemma":[0.00024689696,0.00014134069,0.00079094735,0.0001151169,0.00007604018,0.00042830873,0.00013003305,0.40598208,0.002364723,0.5395581,0.050132725,0.000033635155],"about_ca_topic_score_codex":0.0026441868,"about_ca_topic_score_gemma":0.0028596774,"teacher_disagreement_score":0.040712643,"about_ca_system_score_codex":0.0029564884,"about_ca_system_score_gemma":0.0023900385,"threshold_uncertainty_score":0.13619739},"labels":[],"label_agreement":null},{"id":"W4400453024","doi":"10.1016/j.comgeo.2024.102121","title":"Routing on heavy path WSPD spanners","year":2024,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Routing (electronic design automation); Path (computing); Computer science; Computer network; Business; Distributed computing","score_opus":0.01706455049105644,"score_gpt":0.26645605779187354,"score_spread":0.2493915073008171,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400453024","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17773333,0.0003042517,0.8152919,0.00018917922,0.000072994444,0.00010951609,0.00041282785,0.00089435256,0.0049916697],"genre_scores_gemma":[0.71412784,0.00032640362,0.27665752,0.00011140702,0.000058560083,0.00018165454,0.0011875869,0.00017187817,0.007177204],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992884,0.00013937475,0.00005562343,0.00019837239,0.00021485162,0.00010338475],"domain_scores_gemma":[0.9989556,0.00022380927,0.00014763068,0.00041492793,0.0001601393,0.00009778417],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042995953,0.000600539,0.0006073409,0.00068342226,0.0006459865,0.00061788666,0.0010405682,0.00065730716,0.004059644],"category_scores_gemma":[0.0018910356,0.00030117316,0.00041942435,0.0009472498,0.0006426628,0.0024067082,0.0031219115,0.0006688209,0.0010839351],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010060233,0.00011398992,0.002943132,0.00038585468,0.00013085632,0.0011111189,0.0005525648,0.5175126,0.086744994,0.13258402,0.006146566,0.2507683],"study_design_scores_gemma":[0.00005109874,0.00037931936,0.0010709959,0.000037446545,0.000026604983,0.0005295846,0.00024819473,0.8224759,0.0332616,0.122764006,0.01911762,0.000037669113],"about_ca_topic_score_codex":0.000835421,"about_ca_topic_score_gemma":0.0009578199,"teacher_disagreement_score":0.004059644,"about_ca_system_score_codex":0.0005299137,"about_ca_system_score_gemma":0.00026406383,"threshold_uncertainty_score":0.013580859},"labels":[],"label_agreement":null},{"id":"W4403096939","doi":"10.1016/j.comgeo.2024.102147","title":"Computing Euclidean distance and maximum likelihood retraction maps for constrained optimization","year":2024,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Advanced Numerical Analysis Techniques","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Fields Institute for Research in Mathematical Sciences","keywords":"Euclidean distance; Maximum likelihood; Euclidean geometry; Computer science; Mathematical optimization; Constrained optimization problem; Mathematics; Combinatorics; Algorithm; Optimization problem; Artificial intelligence; Statistics; Geometry","score_opus":0.007015648072327307,"score_gpt":0.25176641300134794,"score_spread":0.24475076492902065,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403096939","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0093991365,0.00026816723,0.9883527,0.00020664478,0.00004783893,0.0000316726,0.000060005408,0.0004151745,0.0012186009],"genre_scores_gemma":[0.24231969,0.00048762074,0.7501569,0.00012339166,0.00012735915,0.00022755338,0.00041880066,0.0007988153,0.0053398837],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983658,0.0006512639,0.000092969734,0.00025384256,0.0005638391,0.000072184],"domain_scores_gemma":[0.9917092,0.006031416,0.00043796684,0.00071611756,0.0008548067,0.0002504956],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029885918,0.0013001442,0.0015949657,0.002035803,0.00075338443,0.002383688,0.0023280957,0.0021234057,0.004404955],"category_scores_gemma":[0.02739075,0.0011234826,0.0010321377,0.0016080369,0.0018962566,0.003752642,0.003423062,0.0025363632,0.0012047229],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025774026,0.000114672,0.0009167992,0.00033739224,0.00010133608,0.00013877855,0.00022961703,0.70306087,0.003961115,0.121384546,0.0038445785,0.16565262],"study_design_scores_gemma":[0.000011343797,0.000034567394,0.00013688291,0.000016403288,0.000006832524,0.000029931882,0.00001885495,0.9453839,0.0009824657,0.05233929,0.0010247618,0.000014689559],"about_ca_topic_score_codex":0.0030625914,"about_ca_topic_score_gemma":0.0033456548,"teacher_disagreement_score":0.004404955,"about_ca_system_score_codex":0.0011029074,"about_ca_system_score_gemma":0.002032036,"threshold_uncertainty_score":0.015805364},"labels":[{"model":"gemma","categories":[],"domain":null,"study_design":"theoretical_or_conceptual","genre":"methods","about_ca_system":false,"about_ca_topic":false,"confidence":"high"},{"model":"gpt","categories":[],"domain":null,"study_design":"theoretical_or_conceptual","genre":"methods","about_ca_system":false,"about_ca_topic":false,"confidence":"high"}],"label_agreement":"agree"},{"id":"W4407694635","doi":"10.1016/j.comgeo.2025.102172","title":"Approximating average bounded-angle minimum spanning trees","year":2025,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; Carleton University; University of Windsor","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bounded function; Minimum spanning tree; Mathematics; Spanning tree; Combinatorics; Mathematical analysis","score_opus":0.014400568408841604,"score_gpt":0.2617562545055416,"score_spread":0.24735568609669997,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407694635","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18221006,0.0016174286,0.8029538,0.00085144315,0.00027222413,0.00012476518,0.0009298689,0.0011716452,0.009868754],"genre_scores_gemma":[0.6603886,0.0007908426,0.33312535,0.00016442391,0.000115887415,0.00012493868,0.0016180923,0.00030013162,0.003371669],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987571,0.00037662958,0.000086138476,0.00023724469,0.00037971075,0.000163239],"domain_scores_gemma":[0.9950151,0.0032268674,0.00031065868,0.00059392845,0.0006276363,0.00022589519],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012388545,0.0010656918,0.0015481721,0.0014344068,0.00059707667,0.0016799562,0.0022407626,0.0013661893,0.0049135173],"category_scores_gemma":[0.015644949,0.00067846006,0.00068488927,0.0029315741,0.0005797874,0.003042421,0.0019184421,0.0014996828,0.0009606374],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00067659485,0.00019565491,0.0027618867,0.0002742565,0.00006437337,0.00011230223,0.00013247716,0.8254158,0.0038865248,0.029510254,0.0074906796,0.1294792],"study_design_scores_gemma":[0.000016959928,0.000037042897,0.00023482267,0.000011315279,0.000008252139,0.000044081076,0.0000328355,0.9853795,0.0006177766,0.012973238,0.0006409286,0.0000031647912],"about_ca_topic_score_codex":0.0026682257,"about_ca_topic_score_gemma":0.0045642634,"teacher_disagreement_score":0.0049135173,"about_ca_system_score_codex":0.0013426137,"about_ca_system_score_gemma":0.0008097674,"threshold_uncertainty_score":0.016437352},"labels":[],"label_agreement":null},{"id":"W4408961034","doi":"10.1016/j.comgeo.2025.102192","title":"Bounds on the edge-length ratio of 2-outerplanar graphs","year":2025,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"Ministero dell'Università e della Ricerca; Ministero dell’Istruzione, dell’Università e della Ricerca","keywords":"Enhanced Data Rates for GSM Evolution; Mathematics; Combinatorics; Outerplanar graph; Pathwidth; Computer science; Graph; Telecommunications; Line graph","score_opus":0.017873185146532328,"score_gpt":0.29802974953785755,"score_spread":0.2801565643913252,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408961034","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5128923,0.010766759,0.3676659,0.0035901421,0.00018980209,0.0001232436,0.0019561502,0.0032458105,0.09956983],"genre_scores_gemma":[0.93177426,0.0038638741,0.055353615,0.0005593199,0.00029120507,0.00018714422,0.0010540973,0.0009610359,0.005955406],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99728155,0.00052771124,0.000102200764,0.000805353,0.00074306666,0.000540054],"domain_scores_gemma":[0.98521763,0.010812987,0.0012727459,0.0013868554,0.00063899986,0.00067065994],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015041585,0.0020276604,0.0013551256,0.002696997,0.0013008873,0.0025244926,0.0034878186,0.0011307714,0.0091541475],"category_scores_gemma":[0.013033677,0.0007191778,0.0009922453,0.0024242764,0.0025333778,0.0070345276,0.0035263363,0.003506563,0.001856184],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0030498337,0.00048712664,0.016119203,0.002134419,0.00048571205,0.0015853406,0.0016992114,0.20817532,0.11912159,0.43599308,0.017965313,0.19318396],"study_design_scores_gemma":[0.00013521397,0.0005707847,0.012759163,0.00030402173,0.00046145066,0.0030172989,0.000686981,0.26056057,0.07590081,0.615734,0.029661516,0.00020821467],"about_ca_topic_score_codex":0.00072130666,"about_ca_topic_score_gemma":0.00096496625,"teacher_disagreement_score":0.0091541475,"about_ca_system_score_codex":0.0020025508,"about_ca_system_score_gemma":0.00044570354,"threshold_uncertainty_score":0.030623674},"labels":[],"label_agreement":null},{"id":"W4411341154","doi":"10.1016/j.comgeo.2025.102209","title":"Piercing unit geodesic disks","year":2025,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; Carleton University; University of Windsor","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Geodesic; Unit (ring theory); Mathematics; Computer science; Geology; Geometry","score_opus":0.01698410397826499,"score_gpt":0.2830171587380699,"score_spread":0.2660330547598049,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411341154","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32491878,0.001247183,0.5306828,0.0009387469,0.0008879016,0.00023323354,0.00042463402,0.00085036946,0.13981634],"genre_scores_gemma":[0.79897374,0.00093183666,0.10857425,0.00028970605,0.00020270837,0.00016674606,0.0006003582,0.0010043418,0.08925635],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995066,0.00008572025,0.000024500054,0.000084296684,0.00022986092,0.00006899235],"domain_scores_gemma":[0.9992473,0.00023703175,0.00009388535,0.00017197277,0.00013668004,0.00011315871],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041171696,0.00090005086,0.001037552,0.0016954165,0.0011259173,0.0022319125,0.0014054719,0.001427262,0.009897993],"category_scores_gemma":[0.0034698576,0.00060712965,0.00052145135,0.0013041693,0.0013459155,0.0016314619,0.0040767943,0.0020546252,0.002845942],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015848377,0.000049443363,0.00039499218,0.00011941565,0.000022401873,0.00048402193,0.000520854,0.027964262,0.0062438133,0.901856,0.005218959,0.05696743],"study_design_scores_gemma":[0.00005573497,0.00015113263,0.0003761309,0.000061262355,0.000017147051,0.00090221537,0.0005940878,0.20165125,0.009245573,0.74561024,0.04130279,0.000032419513],"about_ca_topic_score_codex":0.0006500943,"about_ca_topic_score_gemma":0.0005890903,"teacher_disagreement_score":0.009897993,"about_ca_system_score_codex":0.0007377241,"about_ca_system_score_gemma":0.00042738975,"threshold_uncertainty_score":0.03311211},"labels":[],"label_agreement":null},{"id":"W4414121634","doi":"10.1016/j.comgeo.2025.102227","title":"On the structure of extremal point-line arrangements","year":2025,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Nemzeti Kutatási Fejlesztési és Innovációs Hivatal; Natural Sciences and Engineering Research Council of Canada; University of British Columbia; Nemzeti Kutatási és Technológiai Hivatal; National Science Foundation","keywords":"Polynomial; Rigidity (electromagnetism); Existential quantification; Fraction (chemistry); Complement (music)","score_opus":0.014000167227193243,"score_gpt":0.26047994011055775,"score_spread":0.2464797728833645,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414121634","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5252672,0.0009056248,0.39260796,0.0011556884,0.0001542617,0.00008583999,0.00050537736,0.0004844664,0.07883363],"genre_scores_gemma":[0.9377997,0.0005011177,0.048083246,0.00014183338,0.0001061069,0.00006690553,0.00048809036,0.00018745234,0.012625606],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995078,0.000133387,0.000026692795,0.000092966075,0.00015490201,0.000084320425],"domain_scores_gemma":[0.99741226,0.0011882356,0.0004653082,0.00027097735,0.0004196387,0.00024367748],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056333,0.00036720323,0.0006872811,0.0023522882,0.0016009063,0.002423692,0.0013607971,0.0012998836,0.010977481],"category_scores_gemma":[0.0056189816,0.00053280866,0.00030079237,0.0016962603,0.0025185584,0.0030460476,0.0018421033,0.0019195061,0.0013845942],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006312411,0.000033654032,0.0007763751,0.000047279445,0.000006123572,0.00012485316,0.00025474463,0.012834085,0.0011425142,0.96698576,0.001645196,0.016086346],"study_design_scores_gemma":[0.000016799668,0.0000381632,0.00043128576,0.000032083848,0.0000062059794,0.00018840295,0.00021536925,0.057294786,0.0007111216,0.9377309,0.0033192742,0.000015681637],"about_ca_topic_score_codex":0.00042468577,"about_ca_topic_score_gemma":0.00057367486,"teacher_disagreement_score":0.010977481,"about_ca_system_score_codex":0.0006097267,"about_ca_system_score_gemma":0.00031570857,"threshold_uncertainty_score":0.036723316},"labels":[],"label_agreement":null},{"id":"W4414498470","doi":"10.1016/j.comgeo.2025.102230","title":"City guarding with cameras of bounded field of view","year":2025,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Video Surveillance and Tracking Methods","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Conjecture; Bounded function; Guard (computer science); Constructive; Regular polygon; Mathematical proof; Space (punctuation)","score_opus":0.016446833491829974,"score_gpt":0.32199638321835605,"score_spread":0.3055495497265261,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414498470","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0788121,0.00023661809,0.91571164,0.00017345064,0.000056101377,0.000057915353,0.00026158788,0.00039793234,0.004292715],"genre_scores_gemma":[0.75571185,0.0003367036,0.23572746,0.00007667805,0.000054294225,0.00007448488,0.0007730473,0.00013037556,0.0071150945],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99881953,0.00035640536,0.000039217415,0.0003726047,0.00021056744,0.00020180765],"domain_scores_gemma":[0.9981375,0.0008783604,0.0002603105,0.00037002208,0.00015836056,0.00019543996],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008835302,0.001149357,0.001640365,0.0007804021,0.000979123,0.001648837,0.0024466107,0.0019715128,0.002689168],"category_scores_gemma":[0.0043636705,0.001084324,0.0009833177,0.0013552016,0.0015414027,0.002561609,0.0034303162,0.0014786477,0.0005529375],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007045878,0.00009329995,0.0022919588,0.00011213733,0.000069165566,0.0004287228,0.00026039436,0.9102367,0.0040706103,0.028802237,0.0032115309,0.04971861],"study_design_scores_gemma":[0.000014687819,0.000028387809,0.00024939698,0.000008157464,0.000007505267,0.000046835332,0.000053908578,0.9912196,0.0008090027,0.0069646747,0.00059003563,0.000007838928],"about_ca_topic_score_codex":0.022138804,"about_ca_topic_score_gemma":0.015638605,"teacher_disagreement_score":0.022138804,"about_ca_system_score_codex":0.00095512473,"about_ca_system_score_gemma":0.0011300246,"threshold_uncertainty_score":0.044019878},"labels":[],"label_agreement":null},{"id":"W84917342","doi":"","title":"Selected papers from the 12th Annual Canadian Conference on Computational Geometry - Editorial.","year":2001,"lang":"en","type":"article","venue":"Computational Geometry","topic":"3D Modeling in Geospatial Applications","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Geometry; Computer science; Engineering physics; Physics; Mathematics","score_opus":0.011365324898782444,"score_gpt":0.22015143516890848,"score_spread":0.20878611027012603,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W84917342","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00017975332,0.02707179,0.0009632074,0.022520537,0.9168007,0.00008059185,0.0007103746,0.00020703969,0.031466022],"genre_scores_gemma":[0.004021638,0.064513646,0.0014907824,0.008899105,0.5278644,0.00010050538,0.0020320031,0.00065374566,0.39042425],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9975357,0.00013941282,0.00015252129,0.00029970665,0.0016866444,0.0001858725],"domain_scores_gemma":[0.9833009,0.0013043842,0.00031424777,0.00036929082,0.012344411,0.002366751],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002153989,0.0024778165,0.002368213,0.006502757,0.0038008525,0.005693488,0.0024412852,0.0024899656,0.123032965],"category_scores_gemma":[0.0075873956,0.0006075322,0.0012834228,0.004341157,0.0012729379,0.0027085918,0.0017925118,0.0035619098,0.06319088],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016782133,0.0000045370193,0.000020062205,0.00007080537,0.0000036563772,0.000018330857,0.0000065232466,0.000029632974,0.00005892518,0.00023077293,0.9934731,0.0060668886],"study_design_scores_gemma":[0.000013362968,0.000010634214,0.00027805183,0.00014356135,0.000013251746,0.000050497536,0.00004460095,0.00009682142,0.00011726727,0.0005992992,0.9986212,0.0000113037295],"about_ca_topic_score_codex":0.029957218,"about_ca_topic_score_gemma":0.1011694,"teacher_disagreement_score":0.123032965,"about_ca_system_score_codex":0.0046076737,"about_ca_system_score_gemma":0.0053511458,"threshold_uncertainty_score":0.41158623},"labels":[],"label_agreement":null}]}