{"meta":{"query_hash":"8b09e7a63a99","filters":{"venue":"International Journal of Computational Geometry & Applications"},"cohort_total":87,"direct_labels_cover":0,"predictions_cover":87,"exported":87,"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/8b09e7a63a99","api":"https://metacan.xera.ac/api/v1/cohort?venue=International+Journal+of+Computational+Geometry+%26+Applications"},"results":[{"id":"W1509069969","doi":"10.1142/s0218195900000322","title":"OBNOXIOUS FACILITY LOCATION: COMPLETE SERVICE WITH MINIMAL HARM","year":2000,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Facility location problem; Constraint (computer-aided design); Computer science; Range (aeronautics); Mathematical optimization; Service (business); Planar; Construct (python library); Harm; Location model; Mathematics; Operations research; Computer network; Engineering; Business; Geometry","score_opus":0.02276828891413497,"score_gpt":0.256431344373944,"score_spread":0.23366305545980903,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1509069969","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26114964,0.00042144605,0.68067676,0.031199398,0.0008739868,0.0015179539,0.00021499497,0.00024840448,0.023697421],"genre_scores_gemma":[0.9881292,0.000020485943,0.0045573357,0.005035326,0.0012362453,0.000094090414,0.0004333613,0.000016716953,0.00047722607],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.99754465,0.000016779692,0.0008038491,0.00028497848,0.0011500369,0.00019970977],"domain_scores_gemma":[0.9959802,0.00006618346,0.0003399968,0.00021621076,0.0033508646,0.000046543482],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00038255448,0.00021102988,0.00022846805,0.0005568568,0.00019250794,0.00027706052,0.00083094876,0.000049107577,0.003512875],"category_scores_gemma":[0.000025917356,0.0001980431,0.000111891386,0.0013253904,0.00009110579,0.001032454,0.00007494656,0.0001975454,0.0017332704],"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.0004674631,0.00097389903,0.0035041408,0.00017951577,0.0005698227,0.00001711051,0.00011723133,0.7917083,0.00004314766,0.023581518,0.0057775676,0.17306028],"study_design_scores_gemma":[0.0015516931,0.000040411906,0.037411883,0.00005057507,0.00010638754,0.00007916151,0.00022657358,0.030466577,0.000009541725,0.0080706,0.92160386,0.00038271138],"about_ca_topic_score_codex":0.00015367613,"about_ca_topic_score_gemma":0.00006064189,"teacher_disagreement_score":0.9158263,"about_ca_system_score_codex":0.000110550194,"about_ca_system_score_gemma":0.00011848976,"threshold_uncertainty_score":0.999044},"labels":[],"label_agreement":null},{"id":"W1515108012","doi":"10.1142/s0218195900000036","title":"COMPUTING LARGEST CIRCLES SEPARATING TWO SETS OF SEGMENTS","year":2000,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; Université du Québec en Outaouais","funders":"","keywords":"Ackermann function; Combinatorics; Line segment; Omega; Mathematics; Line (geometry); Inverse; Planar; Binary logarithm; Set (abstract data type); Function (biology); Discrete mathematics; Algorithm; Computer science; Geometry; Physics","score_opus":0.01232425687127098,"score_gpt":0.31876264280377237,"score_spread":0.3064383859325014,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1515108012","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1276873,0.00041524047,0.868922,0.0006996196,0.00038468596,0.00025781308,0.00003839372,0.00004823895,0.0015467182],"genre_scores_gemma":[0.81117207,0.00004127685,0.18769339,0.00034777244,0.0005286881,0.000015186213,0.0000824917,0.000013319079,0.00010582448],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99657106,0.00011502768,0.0012969418,0.00033809384,0.0014426184,0.00023625318],"domain_scores_gemma":[0.9959967,0.0006065912,0.00096982,0.0002495809,0.0020175963,0.0001597188],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007538731,0.00021476379,0.00033468055,0.00081637374,0.00019197474,0.00020512509,0.0015150729,0.00006593272,0.00021144825],"category_scores_gemma":[0.000051972875,0.0002302782,0.00024221418,0.0012313909,0.00008192451,0.0008577,0.00015508334,0.0002564578,0.00007835016],"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.00002779055,0.00038697652,0.0011062381,0.000015606578,0.00023561816,0.0000111077825,0.00017638667,0.5948731,0.0006652115,0.025574261,0.00036589347,0.37656182],"study_design_scores_gemma":[0.007615438,0.00060920167,0.057084903,0.0004174082,0.00016549054,0.0024783192,0.00018222663,0.6124689,0.007718411,0.21766001,0.092111625,0.0014880456],"about_ca_topic_score_codex":0.000009991085,"about_ca_topic_score_gemma":0.0000013612928,"teacher_disagreement_score":0.68348473,"about_ca_system_score_codex":0.00012356378,"about_ca_system_score_gemma":0.00033266947,"threshold_uncertainty_score":0.9390472},"labels":[],"label_agreement":null},{"id":"W1517201934","doi":"10.1142/s0218195911003561","title":"COMPUTING SIGNED PERMUTATIONS OF POLYGONS","year":2011,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Carleton University","funders":"","keywords":"Polygon (computer graphics); Combinatorics; Rectilinear polygon; Rectangle; Enhanced Data Rates for GSM Evolution; Simple polygon; Mathematics; Polygon covering; Visibility polygon; Star-shaped polygon; Equiangular polygon; Algorithm; Computer science; Monotone polygon; Regular polygon; Geometry; Artificial intelligence; Convex set","score_opus":0.015814733847699006,"score_gpt":0.27821978918652956,"score_spread":0.2624050553388306,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1517201934","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18526746,0.00043308627,0.8115398,0.00015605967,0.00020656642,0.00022950608,0.00007143951,0.00000837412,0.002087653],"genre_scores_gemma":[0.93655926,0.000026342786,0.06263036,0.00009695805,0.0004304362,0.00001534256,0.00014103971,0.000016690716,0.000083574625],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99854845,0.00003955825,0.0006330035,0.00016606203,0.00048590044,0.00012705299],"domain_scores_gemma":[0.99752825,0.000063629675,0.0006106057,0.00014142305,0.0015687275,0.000087344764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025958935,0.000121367484,0.00016226275,0.00039798638,0.000063237814,0.00002040864,0.0005639723,0.00006417846,0.0001204177],"category_scores_gemma":[0.00004901339,0.00012676719,0.00018315579,0.00028953393,0.00010672635,0.000017050641,0.00010105641,0.00010222236,0.000017061177],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011196543,0.007403952,0.07492093,0.00021137379,0.009231525,0.000066591034,0.0037849436,0.18199694,0.30867314,0.088108845,0.0051831948,0.31929892],"study_design_scores_gemma":[0.013779966,0.0035937766,0.44333938,0.00034471304,0.0009654349,0.0028880155,0.004352817,0.009435817,0.19455972,0.15959923,0.16427901,0.002862127],"about_ca_topic_score_codex":0.0000068251243,"about_ca_topic_score_gemma":0.000001271027,"teacher_disagreement_score":0.7512918,"about_ca_system_score_codex":0.000032203734,"about_ca_system_score_gemma":0.0001837938,"threshold_uncertainty_score":0.5169416},"labels":[],"label_agreement":null},{"id":"W195330644","doi":"10.1142/s0218195911003536","title":"ON COMPUTING ENCLOSING ISOSCELES TRIANGLES AND RELATED PROBLEMS","year":2011,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Isosceles triangle; Computer science; Mathematics; Geometry","score_opus":0.02211372973481942,"score_gpt":0.26956698585340366,"score_spread":0.24745325611858424,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W195330644","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0339237,0.0005882567,0.9607203,0.00063793734,0.00060195196,0.0003085539,0.000010804103,0.000070372684,0.0031381203],"genre_scores_gemma":[0.8655074,0.000050490766,0.13367684,0.00034006345,0.00028259892,0.000018424367,0.000027262344,0.000013712607,0.000083194485],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99756604,0.00009702623,0.00091176835,0.00034508595,0.0008874538,0.00019264479],"domain_scores_gemma":[0.9969676,0.0006419113,0.0007853141,0.00018328804,0.0012623322,0.00015953508],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006667634,0.00020279235,0.00024646072,0.0010692771,0.00021273867,0.00021639591,0.0009565401,0.00008272148,0.00007226484],"category_scores_gemma":[0.00009943786,0.0001978569,0.00014754168,0.00086342666,0.000092333095,0.0006578785,0.00017914567,0.00028210896,0.00003868643],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043712585,0.00060063397,0.0005668987,0.00002094897,0.0003494025,0.000025201922,0.0009025798,0.111266986,0.00027054682,0.62840337,0.00043750543,0.25711223],"study_design_scores_gemma":[0.0023249579,0.0005094387,0.021103477,0.00017614495,0.000055887052,0.0014363722,0.000115507966,0.09301616,0.00088089553,0.8675257,0.012296169,0.00055928814],"about_ca_topic_score_codex":0.0000044217463,"about_ca_topic_score_gemma":5.148612e-7,"teacher_disagreement_score":0.8315837,"about_ca_system_score_codex":0.00009798277,"about_ca_system_score_gemma":0.00017125877,"threshold_uncertainty_score":0.8068371},"labels":[],"label_agreement":null},{"id":"W1998920351","doi":"10.1142/s0218195912500094","title":"ON THE DISCRETE UNIT DISK COVER PROBLEM","year":2012,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":49,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick; University of Waterloo","funders":"","keywords":"Cover (algebra); Unit disk; Mathematics; Cardinality (data modeling); Combinatorics; Set cover problem; Constant (computer programming); Unit (ring theory); Set (abstract data type); Unit disk graph; Plane (geometry); Approximation algorithm; Point (geometry); Discrete mathematics; Geometry; Computer science","score_opus":0.018088765245865952,"score_gpt":0.2930174984656583,"score_spread":0.27492873321979233,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1998920351","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008441183,0.00036530697,0.97998446,0.0065263608,0.00072651135,0.00037101857,0.000030733663,0.00004380356,0.0035106344],"genre_scores_gemma":[0.9422493,0.000031233118,0.05392894,0.0018998306,0.0013440604,0.000102026905,0.000059498398,0.000015472373,0.00036962272],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971399,0.00013607004,0.0007222705,0.00022422467,0.0015014192,0.00027614547],"domain_scores_gemma":[0.99600124,0.0014715625,0.00066361,0.00028913503,0.0013746636,0.00019980982],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009841848,0.00020511042,0.00019062521,0.0006127727,0.0002708685,0.00030578653,0.0016992963,0.000062612344,0.00018684113],"category_scores_gemma":[0.000115833434,0.00015294855,0.00021526769,0.0011080577,0.00008570745,0.0010815719,0.00020954307,0.00034289045,0.00033931682],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002583741,0.00034611067,0.00062055554,0.000004971482,0.00019671995,0.00000260297,0.0001506325,0.16006507,0.00007807089,0.8084623,0.003949546,0.026097596],"study_design_scores_gemma":[0.0012245674,0.00022671117,0.01923792,0.00007213274,0.00006056692,0.0005634896,0.00008583475,0.029345224,0.0008370029,0.4948973,0.45290008,0.0005491565],"about_ca_topic_score_codex":0.0000020680152,"about_ca_topic_score_gemma":2.80502e-7,"teacher_disagreement_score":0.93380815,"about_ca_system_score_codex":0.00012910234,"about_ca_system_score_gemma":0.00021324144,"threshold_uncertainty_score":0.62370604},"labels":[],"label_agreement":null},{"id":"W2039598212","doi":"10.1142/s0218195900000073","title":"COMPUTATIONAL GEOMETRY COLUMN 37","year":2000,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Column (typography); Geometry; Combinatorics; Computational geometry; Connection (principal bundle)","score_opus":0.010583747335228775,"score_gpt":0.27916497311766797,"score_spread":0.2685812257824392,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2039598212","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022110913,0.00090424117,0.9688978,0.0032379027,0.0008446198,0.0004856056,0.00008510879,0.00014444713,0.00328937],"genre_scores_gemma":[0.70619476,0.00018571912,0.28792828,0.0020887067,0.0018753004,0.00011976907,0.0003435815,0.000039388717,0.0012244731],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9947737,0.00015476432,0.0015877567,0.0005996201,0.0024766105,0.00040755965],"domain_scores_gemma":[0.9942518,0.00092365994,0.00086082774,0.0004004754,0.0031999222,0.00036332483],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0008988314,0.0003742763,0.00045751018,0.0013206641,0.00036463543,0.00062330416,0.002603371,0.000157544,0.0011961396],"category_scores_gemma":[0.000088376764,0.00040294102,0.0004189921,0.0024349964,0.0001586218,0.0016285098,0.00021027162,0.0004870622,0.0006080525],"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.000054950007,0.00051101507,0.00036575488,0.000012166631,0.00030330353,0.00003104316,0.00009092874,0.6585004,0.00004681085,0.064994484,0.003814151,0.271275],"study_design_scores_gemma":[0.0029299578,0.00032408605,0.016270528,0.000078990604,0.00007853309,0.0020078623,0.00005754828,0.15890881,0.0002471876,0.293704,0.5245073,0.0008851893],"about_ca_topic_score_codex":0.000008408396,"about_ca_topic_score_gemma":0.0000015391848,"teacher_disagreement_score":0.6840839,"about_ca_system_score_codex":0.00030810302,"about_ca_system_score_gemma":0.0006938036,"threshold_uncertainty_score":0.9998422},"labels":[],"label_agreement":null},{"id":"W2042411230","doi":"10.1142/s0218195911003718","title":"STOKER'S THEOREM FOR ORTHOGONAL POLYHEDRA","year":2011,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Polyhedron; Mathematics; Regular polygon; Dihedral angle; Uniqueness; Combinatorics; Enhanced Data Rates for GSM Evolution; Geometry; Mathematical analysis; Computer science","score_opus":0.015015808765644074,"score_gpt":0.24725560740559002,"score_spread":0.23223979863994595,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2042411230","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036283877,0.000508626,0.9569584,0.00010093552,0.0008405165,0.00032735802,0.0001464089,0.00007213492,0.004761717],"genre_scores_gemma":[0.98370147,0.000021240898,0.01516088,0.00010286068,0.000745757,0.00012753964,0.00005171889,0.000028461536,0.00006008883],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99863213,0.000025244848,0.00061965804,0.00011944554,0.0004475958,0.00015593584],"domain_scores_gemma":[0.9984361,0.00021188514,0.00024433414,0.00010989938,0.00088594324,0.000111817],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037006967,0.00014641727,0.00018815236,0.0004974491,0.00007364649,0.00004659897,0.00058716926,0.0000646543,0.00020192911],"category_scores_gemma":[0.000019280442,0.00014300301,0.00023291826,0.00027971133,0.000070039765,0.00025219194,0.000024162528,0.00016067865,0.00004481248],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025542275,0.00033304826,0.0010656511,0.00005753936,0.0012106582,0.000011329726,0.0005207687,0.092356905,0.0005996979,0.8417095,0.0014025813,0.06047692],"study_design_scores_gemma":[0.0018861728,0.00022163201,0.009815571,0.0000820762,0.0001205111,0.000734412,0.00040180903,0.0140971765,0.0016192185,0.81174946,0.15873559,0.00053639134],"about_ca_topic_score_codex":0.0000011766269,"about_ca_topic_score_gemma":6.6282917e-7,"teacher_disagreement_score":0.94741756,"about_ca_system_score_codex":0.000066279055,"about_ca_system_score_gemma":0.00006209569,"threshold_uncertainty_score":0.5831493},"labels":[],"label_agreement":null},{"id":"W2044795021","doi":"10.1142/s0218195912500112","title":"PROXIMITY GRAPHS: E, δ, Δ, χ AND ω","year":2012,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Mathematics; Combinatorics; Chordal graph; Planar graph; Discrete mathematics; Clique number; 1-planar graph; Pathwidth; Graph; Line graph","score_opus":0.013881614469072502,"score_gpt":0.28432210158644977,"score_spread":0.2704404871173773,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2044795021","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025273595,0.001619929,0.9699707,0.0014015157,0.00069475075,0.00023693217,0.000012705026,0.00005291401,0.0007369829],"genre_scores_gemma":[0.818655,0.00008933014,0.17986153,0.00058900594,0.00065204274,0.000044362543,0.000027430111,0.000009171851,0.00007213562],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99792784,0.00006762162,0.0006324255,0.00020513113,0.00094519614,0.00022179067],"domain_scores_gemma":[0.9973218,0.0003918537,0.0005091537,0.00016682548,0.0013617773,0.00024862157],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073399156,0.00016014211,0.0001922858,0.0008382829,0.00014819101,0.00020885581,0.0008430621,0.000063465515,0.000030362211],"category_scores_gemma":[0.000070435744,0.00015602818,0.00012803891,0.0008461785,0.00007512284,0.0019362584,0.00019959327,0.0002076999,0.000034067067],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023019511,0.0005221952,0.006039227,0.000016072549,0.00024456804,0.000004868545,0.0002515596,0.014284126,0.0002470956,0.7556719,0.0010654104,0.22162992],"study_design_scores_gemma":[0.0018757266,0.00019333886,0.10061647,0.00005117162,0.000073453615,0.0023286426,0.00010822501,0.017356077,0.0009990697,0.621815,0.25391266,0.0006701464],"about_ca_topic_score_codex":0.0000019083416,"about_ca_topic_score_gemma":3.1214051e-7,"teacher_disagreement_score":0.7933814,"about_ca_system_score_codex":0.00008186111,"about_ca_system_score_gemma":0.00014957032,"threshold_uncertainty_score":0.6362645},"labels":[],"label_agreement":null},{"id":"W2055608379","doi":"10.1142/s0218195911003810","title":"CONSTRUCTING CONSTRAINED DELAUNAY TETRAHEDRALIZATIONS OF VOLUMES BOUNDED BY PIECEWISE SMOOTH SURFACES","year":2011,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Delaunay triangulation; Chew's second algorithm; Bowyer–Watson algorithm; Ruppert's algorithm; Mathematics; Constrained Delaunay triangulation; Boundary (topology); Surface triangulation; Polygon mesh; Bounded function; Pitteway triangulation; Algorithm; Vertex (graph theory); Piecewise; Discretization; Triangulation; Topology (electrical circuits); Geometry; Combinatorics; Mathematical analysis","score_opus":0.016794818185421435,"score_gpt":0.26329315313191276,"score_spread":0.24649833494649132,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2055608379","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026767595,0.0007305584,0.96841735,0.0005409459,0.00058174896,0.0003147139,0.00015292838,0.00006120511,0.0024329382],"genre_scores_gemma":[0.74479353,0.00004654991,0.25453433,0.00016250293,0.00017729677,0.000028728648,0.00013949377,0.0000138742025,0.000103665356],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967025,0.00010412742,0.0013914679,0.00035046032,0.001210202,0.00024124824],"domain_scores_gemma":[0.99416536,0.00059517147,0.0014263429,0.00025888736,0.0033606377,0.00019362911],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00060165767,0.00024544157,0.00037046697,0.0009921985,0.00018222151,0.00017849437,0.0015501236,0.00010355134,0.00020860939],"category_scores_gemma":[0.0001510917,0.00025702003,0.00023949385,0.0014192967,0.00028567482,0.0010598592,0.00016788366,0.00024050756,0.00001714549],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008083185,0.0012408817,0.008268029,0.000042059477,0.00088958995,0.000018118451,0.00087570376,0.04337311,0.0019737093,0.7574952,0.0028757541,0.18286698],"study_design_scores_gemma":[0.0067400304,0.00093328964,0.017497642,0.00030174566,0.00033326255,0.0020722165,0.0017244512,0.18592297,0.02484106,0.66289204,0.09477649,0.0019647966],"about_ca_topic_score_codex":0.000022852066,"about_ca_topic_score_gemma":0.000004924613,"teacher_disagreement_score":0.718026,"about_ca_system_score_codex":0.00015044711,"about_ca_system_score_gemma":0.0005661301,"threshold_uncertainty_score":0.9999882},"labels":[],"label_agreement":null},{"id":"W2073199795","doi":"10.1142/s0218195914600048","title":"A POLYNOMIAL-TIME ALGORITHM FOR COMPUTING THE RESILIENCE OF ARRANGEMENTS OF RAY SENSORS","year":2014,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina; University of British Columbia","funders":"","keywords":"Resilience (materials science); Path (computing); Time complexity; Plane (geometry); Polynomial; Algorithm; Line (geometry); Mathematics; Wireless sensor network; Domain (mathematical analysis); Computer science; Geometry; Computer network; Mathematical analysis; Physics","score_opus":0.008442197794523045,"score_gpt":0.27682705252921863,"score_spread":0.2683848547346956,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2073199795","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0120252995,0.00015938317,0.98556846,0.0011153284,0.00040541837,0.0004306698,0.00005150619,0.000017318096,0.00022663393],"genre_scores_gemma":[0.611649,0.000010297808,0.38744193,0.00018457587,0.0005654074,0.000024204239,0.000036552647,0.000009568287,0.000078488854],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99721324,0.00012509554,0.0011379671,0.00025210052,0.0010999608,0.00017163026],"domain_scores_gemma":[0.9933666,0.0018657045,0.001476004,0.0002540308,0.002954123,0.00008355315],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013546048,0.00016053401,0.00031565866,0.0006513144,0.00015375404,0.00008503598,0.00159941,0.00005509193,0.00001645542],"category_scores_gemma":[0.00018401511,0.00013705876,0.00026293268,0.00089581555,0.00014122292,0.00035758407,0.0001670492,0.0001421393,0.000009539729],"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.000032809334,0.0002619178,0.00012563453,0.000021199612,0.00023672501,5.927103e-7,0.0001807097,0.60927993,0.0017465716,0.011649806,0.0014932831,0.37497082],"study_design_scores_gemma":[0.0014695273,0.00026470443,0.0048635225,0.00007187033,0.00005283319,0.00009053783,0.00005423696,0.9404444,0.0039441297,0.017370235,0.03115556,0.00021845072],"about_ca_topic_score_codex":0.0000046381133,"about_ca_topic_score_gemma":2.9700968e-7,"teacher_disagreement_score":0.5996237,"about_ca_system_score_codex":0.00006517913,"about_ca_system_score_gemma":0.00022840202,"threshold_uncertainty_score":0.5589094},"labels":[],"label_agreement":null},{"id":"W2074574297","doi":"10.1142/s0218195905001762","title":"SEPARATING POINT SETS IN POLYGONAL ENVIRONMENTS","year":2005,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Natural Sciences and Engineering Research Council of Canada; Queen's University","funders":"","keywords":"Mathematics; Geodesic; Polygon (computer graphics); Combinatorics; Chord (peer-to-peer); Point (geometry); Path (computing); Set (abstract data type); Pairwise comparison; Algorithm; Geometry; Computer science","score_opus":0.010807649532028845,"score_gpt":0.2926302831839573,"score_spread":0.28182263365192844,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2074574297","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023710165,0.0005423052,0.9697262,0.0043706526,0.00036408994,0.0002685539,0.000017882234,0.000029937924,0.0009702125],"genre_scores_gemma":[0.7763145,0.000041861353,0.22169392,0.0009355647,0.00075744465,0.00005187541,0.00005863131,0.000011935988,0.0001342741],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99689656,0.00008933119,0.0011077143,0.00034230287,0.0013173105,0.000246762],"domain_scores_gemma":[0.99802375,0.00041627372,0.0006655183,0.00020894867,0.0005236841,0.00016181845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072524475,0.00020491032,0.00024655153,0.0012402275,0.00011358456,0.00021616353,0.0013426497,0.000078881756,0.00009630375],"category_scores_gemma":[0.000059219692,0.00021788555,0.0001750126,0.0009512628,0.000054470656,0.0013903194,0.0002105044,0.00031842568,0.00014704296],"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.000028307248,0.00053154386,0.0010030842,0.0000049146533,0.00011252902,0.000018834717,0.00020610276,0.7062456,0.000584099,0.054105174,0.0006213049,0.23653853],"study_design_scores_gemma":[0.004417719,0.00026420248,0.053145118,0.000114107905,0.00003930346,0.0016903902,0.00013026196,0.40756214,0.0026445466,0.159029,0.37000015,0.0009630382],"about_ca_topic_score_codex":0.000003688272,"about_ca_topic_score_gemma":0.0000041727785,"teacher_disagreement_score":0.7526043,"about_ca_system_score_codex":0.00036097897,"about_ca_system_score_gemma":0.00027884459,"threshold_uncertainty_score":0.88851154},"labels":[],"label_agreement":null},{"id":"W2096451963","doi":"10.1142/s0218195908002751","title":"MEDIAL AXIS APPROXIMATION AND UNSTABLE FLOW COMPLEX","year":2008,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Medial axis; Mathematics; Boundary (topology); Topology (electrical circuits); Homotopy; Bounded function; Flow (mathematics); Simply connected space; Closeness; Geometry; Mathematical analysis; Combinatorics; Pure mathematics","score_opus":0.023305508746308278,"score_gpt":0.27423292670955524,"score_spread":0.25092741796324697,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096451963","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016921444,0.00045551223,0.978843,0.002150654,0.0005045324,0.000298349,0.000032074833,0.00006346563,0.00073097873],"genre_scores_gemma":[0.6232075,0.00015981359,0.37488636,0.0005348507,0.00089768943,0.000050112514,0.00014473111,0.000012716745,0.000106231295],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99714774,0.00008420957,0.000871645,0.000343207,0.0013430048,0.00021017577],"domain_scores_gemma":[0.9963537,0.0004971446,0.00062987074,0.00020727924,0.0021019944,0.00021005113],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005077131,0.00020813337,0.00027982792,0.00096603605,0.00031891256,0.00019945568,0.0010130943,0.000082099774,0.00007825668],"category_scores_gemma":[0.000092558614,0.00021236343,0.0001457992,0.0009978994,0.00018844409,0.0011857963,0.00020951958,0.00023658341,0.000046265744],"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.00010667354,0.0008699395,0.0020680483,0.00004253809,0.0004909062,0.00007638176,0.00092017517,0.48563898,0.0015560662,0.22726654,0.007327492,0.27363628],"study_design_scores_gemma":[0.003545697,0.000326678,0.04132853,0.000053827574,0.000058666617,0.005419239,0.00008605259,0.5511096,0.0010326968,0.18368334,0.21255404,0.00080165174],"about_ca_topic_score_codex":0.0000038053734,"about_ca_topic_score_gemma":9.41142e-7,"teacher_disagreement_score":0.60628605,"about_ca_system_score_codex":0.00013275506,"about_ca_system_score_gemma":0.00036158174,"threshold_uncertainty_score":0.8659929},"labels":[],"label_agreement":null},{"id":"W2098355410","doi":"10.1142/s0218195902000748","title":"APPROXIMATING THE DIAMETER, WIDTH, SMALLEST ENCLOSING CYLINDER, AND MINIMUM-WIDTH ANNULUS","year":2002,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":96,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Annulus (botany); Mathematics; Combinatorics; Cylinder; Dimension (graph theory); Upper and lower bounds; Running time; Point (geometry); Simple (philosophy); RADIUS; Set (abstract data type); Approximation algorithm; Geometry; Mathematical analysis; Algorithm; Computer science","score_opus":0.020348855225838406,"score_gpt":0.2588979367072863,"score_spread":0.23854908148144788,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098355410","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010695472,0.0020664886,0.9804131,0.0047093085,0.00054529135,0.00035706008,0.000018064682,0.000047576614,0.0011476754],"genre_scores_gemma":[0.7307082,0.00016288586,0.26700476,0.0009861945,0.00088526757,0.000060896815,0.000025002084,0.000015272599,0.00015154926],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99697584,0.00012159632,0.0010415715,0.0003767475,0.0012325137,0.0002517255],"domain_scores_gemma":[0.9959829,0.0012188654,0.00090234005,0.00027895643,0.0014429818,0.00017395028],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008095333,0.00023907605,0.0002654166,0.0006959634,0.00041281187,0.00060042395,0.0014409067,0.000080487596,0.000087525186],"category_scores_gemma":[0.00016880246,0.00020139581,0.00017873972,0.0010404533,0.00015114005,0.00076628936,0.00022899527,0.00035029667,0.000038095426],"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.000023223369,0.0005108888,0.0014137118,0.000027016353,0.00040804592,0.000026211772,0.00086928456,0.12932776,0.00054678734,0.099365115,0.001989493,0.76549244],"study_design_scores_gemma":[0.0023679968,0.00028477397,0.011826211,0.00012244165,0.000099566285,0.0026627218,0.00023391626,0.65606356,0.00069372245,0.25372276,0.07115419,0.0007681505],"about_ca_topic_score_codex":0.0000041201206,"about_ca_topic_score_gemma":0.0000013662742,"teacher_disagreement_score":0.7647243,"about_ca_system_score_codex":0.00011156436,"about_ca_system_score_gemma":0.000112498295,"threshold_uncertainty_score":0.82126826},"labels":[],"label_agreement":null},{"id":"W2099432728","doi":"10.1142/s0218195907002380","title":"ON THE EXPECTED SIZE OF THE 2D VISIBILITY COMPLEX","year":2007,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Visibility; Disjoint sets; Mathematics; Bounded function; Unit (ring theory); Plane (geometry); Combinatorics; Geometry; Mathematical analysis; Optics; Physics","score_opus":0.019550224768341694,"score_gpt":0.3028139018826694,"score_spread":0.2832636771143277,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099432728","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08209621,0.00009310843,0.91024935,0.005265895,0.00061227364,0.00039674743,0.000024593826,0.000025310843,0.0012365244],"genre_scores_gemma":[0.96364707,0.0000061724295,0.03434849,0.0014037865,0.00046242806,0.000021460723,0.000012976345,0.000009100074,0.00008849592],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965997,0.0001405924,0.0010542632,0.00026094163,0.0017553476,0.00018920722],"domain_scores_gemma":[0.9917196,0.004079169,0.0010636267,0.0004375209,0.0026017511,0.00009830684],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015518868,0.00017319365,0.00021233235,0.00039657552,0.00025484696,0.00013023216,0.0024486873,0.000061851526,0.00012344104],"category_scores_gemma":[0.00052231184,0.00011497267,0.00030134956,0.0016468912,0.00017203408,0.0003071931,0.00025703764,0.00032010695,0.000022900822],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010233904,0.00076958654,0.0011133354,0.000011444964,0.0003070355,0.0000052374803,0.00029657624,0.15412949,0.0023574869,0.7880882,0.0030384364,0.049780857],"study_design_scores_gemma":[0.0016230241,0.00026010378,0.33180404,0.00008426512,0.000052295796,0.00036036703,0.00019542192,0.023750423,0.0069607454,0.58929455,0.04519293,0.0004218371],"about_ca_topic_score_codex":0.000004783782,"about_ca_topic_score_gemma":0.000003192397,"teacher_disagreement_score":0.88155085,"about_ca_system_score_codex":0.00016243912,"about_ca_system_score_gemma":0.0002950034,"threshold_uncertainty_score":0.46884492},"labels":[],"label_agreement":null},{"id":"W2099582307","doi":"10.1142/s0218195906001975","title":"GEOMETRIC OPTIMIZATION PROBLEMS OVER SLIDING WINDOWS","year":2006,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Logarithm; Sublinear function; Dimension (graph theory); Constant (computer programming); Point (geometry); Simple (philosophy); Set (abstract data type); Sliding window protocol; Optimization problem; Space (punctuation); Upper and lower bounds; Mathematical optimization; Window (computing); Applied mathematics; Combinatorics; Mathematical analysis; Geometry; Computer science","score_opus":0.01009771432731352,"score_gpt":0.2581873079074709,"score_spread":0.2480895935801574,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099582307","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033548586,0.0008783124,0.9917087,0.0011298483,0.0008391133,0.0004412168,0.000025641173,0.00010002875,0.0015222951],"genre_scores_gemma":[0.68713963,0.00006212414,0.3100898,0.00037982044,0.0017522137,0.00008846606,0.00020613291,0.000024025368,0.00025781826],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961161,0.00009080771,0.0012832651,0.00042633092,0.0017914916,0.0002919828],"domain_scores_gemma":[0.9951245,0.0005577285,0.0011405096,0.00027522785,0.002748886,0.00015314645],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00075433793,0.00026849823,0.00030945826,0.0024935827,0.00024574413,0.00055437523,0.0016199284,0.00011306847,0.00012602116],"category_scores_gemma":[0.00008338276,0.00027755118,0.00027317376,0.003084231,0.00005318325,0.0015765071,0.00021876008,0.0002924573,0.000055598735],"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.000011585912,0.00031189845,0.0006567896,0.000009696255,0.00010692892,0.000011566176,0.000026736794,0.8981535,0.00014687769,0.07489093,0.0013325014,0.024341032],"study_design_scores_gemma":[0.003211694,0.00024558947,0.020280726,0.00009484905,0.00008546909,0.0011860983,0.00003126311,0.6343027,0.0010490986,0.16394836,0.17465718,0.00090698054],"about_ca_topic_score_codex":0.000016161779,"about_ca_topic_score_gemma":0.0000019214447,"teacher_disagreement_score":0.6837848,"about_ca_system_score_codex":0.00029519675,"about_ca_system_score_gemma":0.00034678416,"threshold_uncertainty_score":0.9999677},"labels":[],"label_agreement":null},{"id":"W2100302985","doi":"10.1142/s021819591360011x","title":"ROBUST NONPARAMETRIC SIMPLIFICATION OF POLYGONAL CHAINS","year":2013,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Subsequence; Polygonal chain; Combinatorics; Cardinality (data modeling); Simple (philosophy); Nonparametric statistics; Sequence (biology); Mathematics; Monotonic function; Chain (unit); Piecewise; Piecewise linear function; Plane (geometry); Binary logarithm; Algorithm; Discrete mathematics; Computer science; Geometry; Bounded function; Regular polygon; Mathematical analysis; Statistics","score_opus":0.019437849981048746,"score_gpt":0.26814273900463526,"score_spread":0.2487048890235865,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100302985","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023457328,0.00044534288,0.97215384,0.0020735548,0.0005480313,0.0004854589,0.000029599349,0.00004609237,0.0007607501],"genre_scores_gemma":[0.7802986,0.00004799806,0.21833548,0.00036898258,0.00059307844,0.000100212645,0.00008780283,0.000014191101,0.00015364506],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963672,0.00009093543,0.0013565788,0.00034996032,0.0016008224,0.00023446359],"domain_scores_gemma":[0.9925157,0.00078224245,0.001355683,0.0003260998,0.004816416,0.00020385296],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005836263,0.0002240058,0.0003340843,0.0019830326,0.00012920433,0.00025245443,0.0018734747,0.00010258587,0.0001911558],"category_scores_gemma":[0.00015832124,0.00022450853,0.00027544255,0.0023674038,0.00010677566,0.0013267243,0.00019993694,0.00026551972,0.00013923642],"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.00002527641,0.0008071356,0.0011679778,0.000027538159,0.0003568546,0.0000045265156,0.00014570654,0.5283461,0.0019931444,0.2397479,0.0018466912,0.2255311],"study_design_scores_gemma":[0.0035572974,0.0006192655,0.11570772,0.0001292109,0.00011812764,0.0011271478,0.00025537962,0.4787254,0.0059225657,0.3443295,0.048350696,0.0011576788],"about_ca_topic_score_codex":0.000013815477,"about_ca_topic_score_gemma":6.6845047e-7,"teacher_disagreement_score":0.7568413,"about_ca_system_score_codex":0.00016532984,"about_ca_system_score_gemma":0.00042615653,"threshold_uncertainty_score":0.91551924},"labels":[],"label_agreement":null},{"id":"W2100928221","doi":"10.1142/s0218195905001683","title":"GEOMETRIC ALGORITHMS FOR DENSITY-BASED DATA CLUSTERING","year":2005,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Cluster analysis; Approximation algorithm; Algorithm; Mathematics; Quadratic equation; Data point","score_opus":0.046781824903133894,"score_gpt":0.33619353800168617,"score_spread":0.2894117130985523,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100928221","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00021806787,0.00024022402,0.9929548,0.0052581206,0.0005042599,0.0003727539,0.00019210455,0.000057967616,0.00020171373],"genre_scores_gemma":[0.11319027,0.00002616111,0.88309664,0.0011911836,0.0017290078,0.000057328336,0.00057100825,0.000016186294,0.00012223108],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99756294,0.000028848743,0.0007384771,0.00039691693,0.0010520867,0.00022072488],"domain_scores_gemma":[0.996649,0.0005925469,0.0006162996,0.00056389277,0.0014456352,0.000132577],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089329976,0.00016735586,0.00021570051,0.0013920119,0.00016576004,0.00047469093,0.004494345,0.000048479906,0.000028515835],"category_scores_gemma":[0.00009834054,0.00016990092,0.00014092617,0.0011069926,0.000051195024,0.0017636492,0.0006848689,0.00016973756,0.000058428428],"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.000021917756,0.00037027034,0.00018715182,0.000017670543,0.00024729906,0.000007445823,0.000016763717,0.17101912,0.000020080948,0.016835738,0.0056239585,0.8056326],"study_design_scores_gemma":[0.0010080499,0.00005134327,0.001041386,0.000017782912,0.000029897872,0.00007052136,0.00000980096,0.6484294,0.00009730639,0.008082081,0.34098133,0.00018107261],"about_ca_topic_score_codex":0.000003101545,"about_ca_topic_score_gemma":0.0000023808318,"teacher_disagreement_score":0.8054515,"about_ca_system_score_codex":0.00014006307,"about_ca_system_score_gemma":0.00020395448,"threshold_uncertainty_score":0.8351686},"labels":[],"label_agreement":null},{"id":"W2101955916","doi":"10.1142/s0218195909002861","title":"DELAUNAY AND DIAMOND TRIANGULATIONS CONTAIN SPANNERS OF BOUNDED DEGREE","year":2009,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Delaunay triangulation; Combinatorics; Spanner; Mathematics; Degree (music); Unit disk graph; Vertex (graph theory); Bounded function; Minimum-weight triangulation; Constant (computer programming); Upper and lower bounds; Point set triangulation; Graph; Pitteway triangulation; Discrete mathematics; Constrained Delaunay triangulation; Mathematical analysis; Computer science; Physics","score_opus":0.01813034938883125,"score_gpt":0.2913733717094611,"score_spread":0.27324302232062986,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2101955916","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034595948,0.0008913924,0.9597767,0.0033366184,0.00029263916,0.0003046728,0.000030583946,0.000033540036,0.0007379208],"genre_scores_gemma":[0.8382055,0.000060432147,0.1607659,0.00044912187,0.00036098587,0.00001730489,0.00005639059,0.000007399359,0.00007693654],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99743444,0.00008129266,0.001014136,0.00028196798,0.0010119299,0.0001762606],"domain_scores_gemma":[0.99601644,0.0006113495,0.00088497327,0.00021039236,0.002102084,0.00017478262],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060295535,0.00018611884,0.00030846245,0.0011189767,0.0001454897,0.00019439198,0.0009240497,0.00008133515,0.000026134963],"category_scores_gemma":[0.00013212468,0.00018873785,0.0001819539,0.0010432695,0.0001000984,0.00083633134,0.00009582229,0.00019848868,0.000008750578],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008187216,0.0004935901,0.000778342,0.000012251631,0.00028014663,0.00001340325,0.00026175054,0.09756482,0.0013035677,0.5392832,0.00064344506,0.35928363],"study_design_scores_gemma":[0.0038839001,0.00065403915,0.11547659,0.00009256876,0.0001101985,0.00088187243,0.00014240462,0.06464372,0.002153905,0.76963264,0.041710783,0.0006173551],"about_ca_topic_score_codex":0.0000049415567,"about_ca_topic_score_gemma":0.0000020280734,"teacher_disagreement_score":0.80360955,"about_ca_system_score_codex":0.00010564631,"about_ca_system_score_gemma":0.00033377792,"threshold_uncertainty_score":0.7696506},"labels":[],"label_agreement":null},{"id":"W2102172432","doi":"10.1142/s0218195910003232","title":"GENERALIZED WATCHMAN ROUTE PROBLEM WITH DISCRETE VIEW COST","year":2010,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Polygon (computer graphics); Mathematics; Approximation algorithm; Combinatorics; Boundary (topology); Viewpoints; Time complexity; Mathematical optimization; Algorithm; Discrete mathematics; Computer science","score_opus":0.012058966365115536,"score_gpt":0.2997036074054154,"score_spread":0.28764464104029985,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102172432","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024319093,0.00008145079,0.987161,0.0071629807,0.00031295867,0.000591258,0.000033124907,0.00006827158,0.0021570553],"genre_scores_gemma":[0.36500823,0.00006909467,0.6328094,0.00090535166,0.00053548784,0.00018411265,0.00010737201,0.000022667704,0.00035828695],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9972548,0.00006719116,0.0007566184,0.00031731103,0.0013547717,0.00024929267],"domain_scores_gemma":[0.9959777,0.00023525394,0.000644736,0.00030490448,0.0025718317,0.00026559248],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057878625,0.00020051128,0.0002528681,0.00059374917,0.0001838306,0.00050997006,0.0019508727,0.0000719303,0.00016584851],"category_scores_gemma":[0.000029205514,0.00016360905,0.00014511879,0.0008930348,0.00012728908,0.0010023521,0.00020067336,0.0005024945,0.00007356269],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006042469,0.00046014084,0.002090128,0.000022911643,0.00040609858,0.000029707253,0.00022262284,0.26087883,0.0005320079,0.62245446,0.0013677512,0.111474924],"study_design_scores_gemma":[0.0039013335,0.00028323333,0.0066420003,0.00010409211,0.000055178763,0.0013862127,0.000042816373,0.10495318,0.0005079027,0.14007698,0.7413187,0.00072837656],"about_ca_topic_score_codex":0.000010742207,"about_ca_topic_score_gemma":0.000012171179,"teacher_disagreement_score":0.73995095,"about_ca_system_score_codex":0.00008641062,"about_ca_system_score_gemma":0.00043333127,"threshold_uncertainty_score":0.66717833},"labels":[],"label_agreement":null},{"id":"W2102779916","doi":"10.1142/s0218195900000218","title":"A COST/BENEFIT ANALYSIS OF SIMPLICIAL MESH IMPROVEMENT TECHNIQUES AS MEASURED BY SOLUTION EFFICIENCY","year":2000,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Polygon mesh; Mathematical optimization; Laplacian smoothing; Finite element method; Simple (philosophy); Smoothing; Computer science; Eigenvalues and eigenvectors; Finite volume method; T-vertices; Mathematics; Quality (philosophy); Algorithm; Applied mathematics; Mesh generation; Geometry","score_opus":0.013400962522910589,"score_gpt":0.30061710136805564,"score_spread":0.2872161388451451,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102779916","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031098085,0.00033051657,0.96566606,0.0010982343,0.00019949346,0.0005192092,0.00012598255,0.000064066044,0.000898351],"genre_scores_gemma":[0.9417344,0.00012540538,0.056420974,0.0006177025,0.00036637377,0.00013772113,0.0003154156,0.000014844838,0.00026717453],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960002,0.00006960037,0.0013572864,0.00041291615,0.0019106779,0.00024933362],"domain_scores_gemma":[0.9953895,0.00036964414,0.0009715501,0.00030365947,0.0027877197,0.00017791778],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00079750497,0.0002411013,0.00044269802,0.0018467259,0.000179392,0.00019152505,0.0015412436,0.000109135515,0.00033369605],"category_scores_gemma":[0.000058218255,0.00024962946,0.00043870354,0.0033881203,0.000094940144,0.00069647614,0.000119058255,0.00022222415,0.000033754328],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000087263295,0.0008865421,0.00018416022,0.000009598394,0.0012758613,0.0000039189435,0.00015640992,0.23544835,0.005541376,0.032580018,0.0010306278,0.72279584],"study_design_scores_gemma":[0.0038323293,0.0016727416,0.013035425,0.00013268662,0.0015893937,0.00040741052,0.00012379678,0.47481522,0.049644675,0.1691481,0.28390765,0.0016905674],"about_ca_topic_score_codex":0.000035412882,"about_ca_topic_score_gemma":0.0000043548775,"teacher_disagreement_score":0.9106363,"about_ca_system_score_codex":0.00026181465,"about_ca_system_score_gemma":0.00033554793,"threshold_uncertainty_score":0.9999956},"labels":[],"label_agreement":null},{"id":"W2102922436","doi":"10.1142/s0218195900000048","title":"POINT VISIBILITY GRAPHS AND ${\\mathcal O}$-CONVEX COVER","year":2000,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Mathematics; Visibility graph; Polygon (computer graphics); Visibility polygon; Regular polygon; Visibility; Cardinality (data modeling); Uncountable set; Discrete mathematics; Polygon covering; Computer science; Geometry","score_opus":0.00838546564601397,"score_gpt":0.2720966079656274,"score_spread":0.26371114231961346,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102922436","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08604785,0.0006292768,0.90831274,0.0026994424,0.00035055977,0.00031384727,0.000031855532,0.0000689642,0.0015454567],"genre_scores_gemma":[0.89456373,0.00016940413,0.10309823,0.0012072901,0.00043123882,0.000046820944,0.000057392223,0.000013852333,0.0004120148],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997273,0.000091224414,0.00089339743,0.00039749563,0.0011390989,0.0002057787],"domain_scores_gemma":[0.9972006,0.0004991343,0.00041720274,0.00025379687,0.0014061134,0.00022314198],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068778876,0.00020931831,0.00027453387,0.0007000679,0.00018213132,0.0003505765,0.0010566101,0.00008506874,0.00044842248],"category_scores_gemma":[0.000053308228,0.00020731201,0.00019277545,0.0009103042,0.00012255493,0.0011697664,0.00013643749,0.0002714638,0.00014751856],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009422223,0.0005932936,0.0011034443,0.00002010977,0.00032145105,0.00002822487,0.00021659762,0.13421535,0.00022412841,0.28732488,0.001991626,0.57386667],"study_design_scores_gemma":[0.0020843837,0.00025353153,0.04023653,0.00004874824,0.00005076126,0.0016837801,0.00003773855,0.08869766,0.00040571933,0.6877526,0.17819434,0.0005541744],"about_ca_topic_score_codex":0.0000051561005,"about_ca_topic_score_gemma":6.5313276e-7,"teacher_disagreement_score":0.8085159,"about_ca_system_score_codex":0.00010868698,"about_ca_system_score_gemma":0.00023939899,"threshold_uncertainty_score":0.8453939},"labels":[],"label_agreement":null},{"id":"W2103189192","doi":"10.1142/s0218195912600096","title":"THREE PROBLEMS ABOUT DYNAMIC CONVEX HULLS","year":2012,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Convex hull; Combinatorics; Mathematics; Amortized analysis; Binary logarithm; Line segment; Plane (geometry); Line (geometry); Data structure; Computational geometry; Regular polygon; Range (aeronautics); Competitive analysis; Set (abstract data type); Convex set; Upper and lower bounds; Algorithm; Convex optimization; Geometry; Computer science; Mathematical analysis","score_opus":0.013952405619557368,"score_gpt":0.28906387226589997,"score_spread":0.2751114666463426,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2103189192","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006242949,0.0024207523,0.9865479,0.0018657733,0.0014071047,0.00041170922,0.000030008323,0.00007949714,0.0009943466],"genre_scores_gemma":[0.8147651,0.00007073403,0.182823,0.00068227,0.0013165333,0.00010078142,0.000103975224,0.000020433936,0.00011714983],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99666154,0.00006494693,0.0010578689,0.00030240486,0.0015473671,0.00036585864],"domain_scores_gemma":[0.9956829,0.0005219359,0.0009115904,0.00029787436,0.0022758036,0.00030987972],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00091614196,0.00025103864,0.0003061958,0.0010785084,0.00020045962,0.00030413663,0.0017405482,0.000103567174,0.00011651906],"category_scores_gemma":[0.000075777025,0.00024989355,0.00026138985,0.0012293297,0.00009063441,0.0017260122,0.00019352736,0.0003350846,0.0002256027],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040883577,0.0013183375,0.004747077,0.000043281245,0.000701959,0.000011907597,0.00048137485,0.2507559,0.0009333182,0.39794913,0.0027868382,0.34023002],"study_design_scores_gemma":[0.0027823846,0.00027821463,0.103411935,0.0001371328,0.00011572454,0.002125385,0.00009757497,0.13898121,0.00074147264,0.27715042,0.4730809,0.0010976461],"about_ca_topic_score_codex":0.000004067672,"about_ca_topic_score_gemma":0.00000242465,"teacher_disagreement_score":0.80852216,"about_ca_system_score_codex":0.00024140923,"about_ca_system_score_gemma":0.00031902263,"threshold_uncertainty_score":0.99999535},"labels":[],"label_agreement":null},{"id":"W2105525115","doi":"10.1142/s0218195903001207","title":"THE LARGEST EMPTY ANNULUS PROBLEM","year":2003,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Mathematics; Combinatorics; Annulus (botany); Minimax; Euclidean space; Plane (geometry); Constant (computer programming); Space (punctuation); Circumference; Upper and lower bounds; Concentric; 1-center problem; Binary logarithm; Facility location problem; Discrete mathematics; Geometry; Mathematical optimization; Mathematical analysis; Computer science","score_opus":0.00901005290849842,"score_gpt":0.2732297818459956,"score_spread":0.2642197289374972,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105525115","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017269748,0.0012934722,0.9885366,0.0035923722,0.00092006277,0.00033551996,0.000013958736,0.000050040875,0.0035310173],"genre_scores_gemma":[0.74115235,0.00020954672,0.2558274,0.0008738811,0.00090317184,0.00014316528,0.000042278825,0.000021515307,0.0008266716],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99696624,0.00016435415,0.0009224837,0.0002939008,0.0013897996,0.00026320526],"domain_scores_gemma":[0.99492264,0.00097632315,0.00075218844,0.0002962593,0.0028789644,0.00017360675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012846456,0.00019379606,0.0001942702,0.0005193073,0.00048673977,0.00057222263,0.001783804,0.00006873721,0.000033635915],"category_scores_gemma":[0.00018217918,0.00015637121,0.0002172646,0.0012285446,0.00009942655,0.0007933283,0.00013542485,0.0003038974,0.00009247479],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017324004,0.00026472495,0.0005366312,0.000005654974,0.00021445402,0.000011231391,0.00007536578,0.110046804,0.00009356951,0.7838842,0.003529366,0.10132064],"study_design_scores_gemma":[0.0007074955,0.00008255751,0.0029347264,0.000015566635,0.000017818167,0.00064181275,0.000042209813,0.006473709,0.00042553304,0.29770666,0.6907341,0.00021781611],"about_ca_topic_score_codex":0.0000022617658,"about_ca_topic_score_gemma":0.0000018751847,"teacher_disagreement_score":0.7394254,"about_ca_system_score_codex":0.0001585003,"about_ca_system_score_gemma":0.0005532007,"threshold_uncertainty_score":0.6376633},"labels":[],"label_agreement":null},{"id":"W2105729287","doi":"10.1142/s0218195910003207","title":"DILATION-OPTIMAL EDGE DELETION IN POLYGONAL CYCLES","year":2010,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Dilation (metric space); Mathematics; Combinatorics; Convex polygon; Regular polygon; Shortest path problem; Euclidean geometry; Time complexity; Polygon (computer graphics); Path (computing); Binary logarithm; Geometry; Graph; Computer science","score_opus":0.008597747177721698,"score_gpt":0.28283690844958936,"score_spread":0.27423916127186765,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105729287","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.116827086,0.00017674691,0.8783894,0.0024650465,0.0011687018,0.0002749076,0.000022600647,0.000050580536,0.0006249142],"genre_scores_gemma":[0.79366344,0.000024542042,0.20452607,0.00037570827,0.0011688794,0.00006185992,0.00010078355,0.000013865548,0.000064874774],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968903,0.00007521605,0.0011041252,0.00037732322,0.0012975448,0.00025548413],"domain_scores_gemma":[0.99639,0.000591423,0.0006986378,0.00025664558,0.0018793636,0.00018395101],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008297534,0.00022413232,0.00026222342,0.0017266102,0.00014917014,0.00031736415,0.0015473514,0.00013182127,0.00011722425],"category_scores_gemma":[0.0001334383,0.00023676253,0.00020573742,0.0014324625,0.000093612514,0.0012975849,0.00018682578,0.0005927004,0.000082140126],"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.00006818935,0.00080579764,0.005389021,0.000012680944,0.00015359384,0.00003332468,0.00022708117,0.42259943,0.0039655375,0.31842223,0.0007282566,0.24759483],"study_design_scores_gemma":[0.0042526536,0.00027516083,0.24708647,0.000087538465,0.000052460153,0.0020553838,0.00011231029,0.26863444,0.0034126805,0.29410073,0.17878737,0.0011428344],"about_ca_topic_score_codex":0.000008743258,"about_ca_topic_score_gemma":0.000013479072,"teacher_disagreement_score":0.6768363,"about_ca_system_score_codex":0.0001377592,"about_ca_system_score_gemma":0.0004788647,"threshold_uncertainty_score":0.96548957},"labels":[],"label_agreement":null},{"id":"W2107749697","doi":"10.1142/s0218195911003627","title":"RECONSTRUCTING CONVEX POLYGONS AND CONVEX POLYHEDRA FROM EDGE AND FACE COUNTS IN ORTHOGONAL PROJECTIONS","year":2011,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Polyhedron; Mathematics; Regular polygon; Combinatorics; Polygon (computer graphics); Rectilinear polygon; Convex polygon; Star-shaped polygon; Face (sociological concept); Enhanced Data Rates for GSM Evolution; Convex polytope; Polygon covering; Convex set; Geometry; Convex optimization; Computer science; Simple polygon; Artificial intelligence","score_opus":0.023415847383909623,"score_gpt":0.28165872347345394,"score_spread":0.2582428760895443,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107749697","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035662595,0.0005598115,0.9573858,0.0005200995,0.00020767731,0.00016721206,0.000048032914,0.000058850786,0.005389921],"genre_scores_gemma":[0.79334736,0.00003895698,0.20627578,0.000155347,0.000098922166,0.000021686794,0.000010177334,0.0000075086136,0.00004426187],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989159,0.00002395165,0.00042315124,0.00020801368,0.00032230836,0.00010665562],"domain_scores_gemma":[0.99880224,0.00021411882,0.00031663605,0.00009726369,0.00048952637,0.000080217076],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019481173,0.00010604655,0.00014999317,0.0005129864,0.000063496256,0.00020261023,0.0004849451,0.000049005317,0.000035756846],"category_scores_gemma":[0.000049620186,0.00010992216,0.000037692273,0.0003515318,0.00014324921,0.0007944887,0.00015527479,0.00019406226,0.000012632016],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046962665,0.00052433944,0.061664764,0.00002839796,0.00032061324,0.000048615842,0.001480768,0.0001427322,0.000469593,0.2588322,0.000696329,0.6757447],"study_design_scores_gemma":[0.0014470504,0.00014638499,0.08820517,0.000245306,0.00004408347,0.0022358987,0.00043692588,0.028419672,0.0015439121,0.85782194,0.018788017,0.0006656502],"about_ca_topic_score_codex":0.000018703737,"about_ca_topic_score_gemma":0.0000018812948,"teacher_disagreement_score":0.75768477,"about_ca_system_score_codex":0.0000504329,"about_ca_system_score_gemma":0.00017908502,"threshold_uncertainty_score":0.44824955},"labels":[],"label_agreement":null},{"id":"W2108375200","doi":"10.1142/s0218195905001841","title":"COMPUTING THE SET OF ALL THE DISTANT HORIZONS OF A TERRAIN","year":2005,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Defense Advanced Research Projects Agency","keywords":"Terrain; Horizon; Mathematics; Combinatorics; Set (abstract data type); Convex hull; Regular polygon; Algorithm; Geometry; Computer science","score_opus":0.01670172683024567,"score_gpt":0.3065674018432316,"score_spread":0.28986567501298593,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2108375200","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023546454,0.00061969634,0.9626737,0.012043666,0.0003660379,0.00031962176,0.000047357975,0.000017842976,0.00036558716],"genre_scores_gemma":[0.92900306,0.00003660914,0.06941563,0.0005357073,0.00089769677,0.000019963098,0.00003984746,0.000009380378,0.000042113712],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.99688095,0.00014586901,0.0012215539,0.00021664024,0.0013619594,0.00017300333],"domain_scores_gemma":[0.99470294,0.0014440696,0.0014010632,0.00033352146,0.0020391261,0.00007925751],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012508873,0.00016587021,0.00025574898,0.00048102325,0.00017194636,0.000117879354,0.002294588,0.0000506919,0.000029755001],"category_scores_gemma":[0.00011113954,0.0001127931,0.0002702882,0.0010700702,0.00020098987,0.00042086994,0.00027975993,0.00027269582,0.000011501898],"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.0000342455,0.00027654873,0.0002571337,0.000014713997,0.00041841378,0.0000022817944,0.0011290739,0.57910097,0.00095162325,0.23291372,0.0015497939,0.1833515],"study_design_scores_gemma":[0.0021486613,0.0004116932,0.018382354,0.00014258672,0.00016580499,0.00095289596,0.00067975407,0.39529926,0.0051526595,0.15946428,0.41666406,0.00053597434],"about_ca_topic_score_codex":0.000009696844,"about_ca_topic_score_gemma":0.00000487788,"teacher_disagreement_score":0.9054566,"about_ca_system_score_codex":0.00009713678,"about_ca_system_score_gemma":0.00032912672,"threshold_uncertainty_score":0.45995694},"labels":[],"label_agreement":null},{"id":"W2109083408","doi":"10.1142/s0218195902000803","title":"ON THE TIME BOUND FOR CONVEX DECOMPOSITION OF SIMPLE POLYGONS","year":2002,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":69,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Combinatorics; Mathematics; Simple polygon; Simple (philosophy); Decomposition; Regular polygon; Convex polygon; Geometry","score_opus":0.01666600020750904,"score_gpt":0.2948917396336267,"score_spread":0.27822573942611767,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2109083408","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015752535,0.0002626515,0.9758973,0.0063920417,0.000317101,0.0004934784,0.0000905209,0.000027507542,0.0007668269],"genre_scores_gemma":[0.9495421,0.00002506858,0.048129488,0.0012894687,0.0005682984,0.00011401012,0.00009678868,0.000014331495,0.00022045958],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99773186,0.00007857298,0.00081490766,0.0002369202,0.0009706588,0.00016704742],"domain_scores_gemma":[0.9944474,0.0023252557,0.00081209425,0.00024124575,0.0020777206,0.00009626452],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005607545,0.00016291,0.00023375372,0.0006562556,0.00022494557,0.0001784421,0.0012940663,0.000060651586,0.00024632222],"category_scores_gemma":[0.00014810129,0.00013692114,0.00026452495,0.0007684001,0.00009379523,0.00042951148,0.00009248865,0.00016780122,0.00008544827],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006337706,0.0007599218,0.000055925415,0.000015453605,0.00038377964,0.0000030557082,0.00016501472,0.21343239,0.0017315284,0.7081432,0.016332876,0.058913533],"study_design_scores_gemma":[0.001465059,0.00046383697,0.0014032762,0.000048859565,0.000053748907,0.00023204548,0.000030586474,0.3730728,0.003166693,0.5532678,0.06648555,0.0003097704],"about_ca_topic_score_codex":0.0000016018662,"about_ca_topic_score_gemma":3.4813544e-7,"teacher_disagreement_score":0.93378955,"about_ca_system_score_codex":0.00010554486,"about_ca_system_score_gemma":0.000116601484,"threshold_uncertainty_score":0.5583482},"labels":[],"label_agreement":null},{"id":"W2111465243","doi":"10.1142/s0218195905001877","title":"GENERALIZING MONOTONICITY: ON RECOGNIZING SPECIAL CLASSES OF POLYGONS AND POLYHEDRA","year":2005,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Polyhedron; Combinatorics; Mathematics; Vertex (graph theory); Regular polygon; Polygon (computer graphics); Simple polygon; Monotonic function; Convex set; Polygon covering; Convex polytope; Intersection (aeronautics); Star-shaped polygon; Rectilinear polygon; Simple (philosophy); Geometry; Computer science; Convex optimization; Mathematical analysis","score_opus":0.016600819376952018,"score_gpt":0.29098531703691255,"score_spread":0.27438449765996054,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111465243","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.084734924,0.000672662,0.9078629,0.0043591843,0.00054555235,0.00024431135,0.000033117965,0.00003281955,0.0015144949],"genre_scores_gemma":[0.7910706,0.00013460293,0.20501135,0.0006434669,0.0029944417,0.000022048727,0.000029359851,0.000012628259,0.000081513],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99749625,0.00007171028,0.000919805,0.00030713066,0.0010233157,0.00018176659],"domain_scores_gemma":[0.9968823,0.00061351457,0.0008029174,0.0001862778,0.0013658572,0.0001491419],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048369964,0.00018867684,0.00027677283,0.0011682756,0.0001481793,0.00018776862,0.0008661878,0.00007471052,0.00004906516],"category_scores_gemma":[0.00008760533,0.00019317213,0.00016490558,0.00077503506,0.00008387178,0.0007899545,0.0001702866,0.00024051694,0.000024167482],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005940226,0.00041633917,0.00046537234,0.00001235611,0.00024036005,0.000006183649,0.00021064389,0.22845408,0.0013308866,0.22676961,0.000989425,0.5410453],"study_design_scores_gemma":[0.0052870465,0.00092384854,0.040025577,0.00031608992,0.0001662807,0.0017360356,0.00025580055,0.20847481,0.024478758,0.25526476,0.46167728,0.0013936966],"about_ca_topic_score_codex":0.000004570739,"about_ca_topic_score_gemma":0.000002631063,"teacher_disagreement_score":0.70633566,"about_ca_system_score_codex":0.00013975652,"about_ca_system_score_gemma":0.00027718634,"threshold_uncertainty_score":0.7877331},"labels":[],"label_agreement":null},{"id":"W2112695860","doi":"10.1142/s021819590800257x","title":"BOUNDED-VELOCITY APPROXIMATION OF MOBILE EUCLIDEAN 2-CENTRES","year":2008,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; McGill University","funders":"Mitacs; Simon Fraser University","keywords":"Euclidean geometry; Bounded function; Mathematics; Euclidean distance; Plane (geometry); RADIUS; Closeness; Combinatorics; Set (abstract data type); Trajectory; Geometry; Mathematical analysis; Computer science; Physics","score_opus":0.017897807115312497,"score_gpt":0.28662663567978275,"score_spread":0.2687288285644702,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2112695860","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029751662,0.00025751413,0.96810436,0.00042098167,0.0003899717,0.00027007633,0.000028011193,0.00004834598,0.00072906545],"genre_scores_gemma":[0.56170005,0.000042512103,0.43772537,0.000109713474,0.0002839685,0.00003654547,0.000034474004,0.0000090801595,0.000058286823],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99703705,0.000071731345,0.0010313399,0.00024936732,0.00142901,0.00018147776],"domain_scores_gemma":[0.99570554,0.0004975302,0.0011596864,0.00025839056,0.0022453004,0.0001335183],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048449,0.00016165989,0.00029567763,0.0007528035,0.00015056276,0.00008343391,0.0016600754,0.000069620786,0.000025885623],"category_scores_gemma":[0.00008929809,0.00016256639,0.00019362508,0.00082988926,0.00015958922,0.00070258253,0.00017385573,0.00023376258,0.00004069025],"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.00005009574,0.0014936303,0.0075772665,0.000048152942,0.0006494256,0.000083616345,0.0015648565,0.73342735,0.00054394454,0.137188,0.001859232,0.11551446],"study_design_scores_gemma":[0.0056768204,0.00078268175,0.1249439,0.00030657876,0.0001250907,0.0073335804,0.0004371998,0.5091983,0.005999454,0.27704227,0.06677017,0.001383941],"about_ca_topic_score_codex":0.00000938834,"about_ca_topic_score_gemma":2.0840419e-7,"teacher_disagreement_score":0.5319484,"about_ca_system_score_codex":0.00015359641,"about_ca_system_score_gemma":0.0004045412,"threshold_uncertainty_score":0.6629265},"labels":[],"label_agreement":null},{"id":"W2113528966","doi":"10.1142/s0218195900000061","title":"ORTHOGONAL EDGE VISIBILITY GRAPHS OF POLYGONS WITH HOLES","year":2000,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Visibility graph; Mathematics; Bipartite graph; Combinatorics; Visibility; Polygon (computer graphics); Planar graph; Enhanced Data Rates for GSM Evolution; Graph; Visibility polygon; Polygon covering; Discrete mathematics; Geometry; Regular polygon; Computer science; Artificial intelligence; Optics; Telecommunications","score_opus":0.008723127740412584,"score_gpt":0.2677453525527823,"score_spread":0.25902222481236975,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113528966","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.117609225,0.00040202434,0.87844867,0.00096664735,0.00018242636,0.00028618384,0.0000547667,0.00004336652,0.002006667],"genre_scores_gemma":[0.8624962,0.000059675876,0.13659967,0.00028551425,0.00028446366,0.000037063575,0.00007802456,0.000012878332,0.00014651025],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967642,0.00009394529,0.0010428076,0.00036485423,0.0015239221,0.0002102606],"domain_scores_gemma":[0.99583685,0.0004965526,0.00072811823,0.0003165786,0.0024389843,0.00018288419],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005708858,0.0002221862,0.0003253757,0.00094294,0.00014548053,0.00014747331,0.0014741606,0.00007552268,0.00024859328],"category_scores_gemma":[0.000033757115,0.00020025877,0.0002477019,0.001612331,0.0002198291,0.0008831858,0.000095667456,0.0002579951,0.000042241376],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019323012,0.001002011,0.0030264494,0.000021585125,0.0004804121,0.00001885549,0.00017848291,0.34738338,0.0003837441,0.32005945,0.00039047527,0.32686192],"study_design_scores_gemma":[0.0066827056,0.0014193762,0.16896184,0.0002766438,0.00022292783,0.0030445284,0.00017496958,0.04261087,0.003873955,0.61269224,0.15855804,0.0014819162],"about_ca_topic_score_codex":0.0000046397613,"about_ca_topic_score_gemma":0.000002736914,"teacher_disagreement_score":0.744887,"about_ca_system_score_codex":0.000089771136,"about_ca_system_score_gemma":0.0005292182,"threshold_uncertainty_score":0.81663156},"labels":[],"label_agreement":null},{"id":"W2115043830","doi":"10.1142/s0218195902000724","title":"KINETIC COLLISION DETECTION FOR SIMPLE POLYGONS","year":2002,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":66,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Mathematics; Logarithm; Simple (philosophy); Regular polygon; Plane (geometry); Combinatorics; Certificate; Set (abstract data type); Collision detection; Upper and lower bounds; Collision; Discrete mathematics; Algorithm; Geometry; Computer science; Mathematical analysis","score_opus":0.021427093830425268,"score_gpt":0.29288042518449425,"score_spread":0.27145333135406896,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2115043830","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019057378,0.000319135,0.99475455,0.0016146314,0.0006251941,0.00036517714,0.00004060418,0.00006088408,0.00031408048],"genre_scores_gemma":[0.6150868,0.000023328039,0.38361487,0.00030686185,0.00070929935,0.00010018852,0.000025814168,0.000013791686,0.00011905069],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99793226,0.00004152311,0.0006897144,0.0002592529,0.0008763531,0.00020091305],"domain_scores_gemma":[0.9966516,0.00073445006,0.00060150994,0.00021432247,0.0016555768,0.00014252702],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034977167,0.00015026606,0.00019897611,0.0007432283,0.00017742135,0.00021580151,0.0013166957,0.000070337504,0.00003989432],"category_scores_gemma":[0.000129181,0.00015259195,0.00018850886,0.0007334519,0.00004885807,0.00051328674,0.000103595514,0.00018453141,0.000065945496],"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.000028839979,0.00055683294,0.0002950453,0.000016820302,0.0002767033,0.000017390717,0.00020839876,0.6195251,0.00076955266,0.028452385,0.0042082006,0.34564477],"study_design_scores_gemma":[0.0014544068,0.00026810257,0.0035890457,0.000034262895,0.000037573744,0.00075120624,0.00003385891,0.8130897,0.00096985034,0.07080266,0.108670846,0.0002984512],"about_ca_topic_score_codex":0.0000046558794,"about_ca_topic_score_gemma":4.1964745e-7,"teacher_disagreement_score":0.61318105,"about_ca_system_score_codex":0.00016560564,"about_ca_system_score_gemma":0.00007041714,"threshold_uncertainty_score":0.6222519},"labels":[],"label_agreement":null},{"id":"W2115581764","doi":"10.1142/s0218195909003040","title":"AN EXPLICIT SOLUTION FOR COMPUTING THE VERTICES OF THE EUCLIDEAN d-DIMENSIONAL VORONOI DIAGRAM OF SPHERES IN A FLOATING-POINT ARITHMETIC","year":2009,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Scientific Research and Discoveries","field":"Physics and Astronomy","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada; University of Calgary","keywords":"Voronoi diagram; Weighted Voronoi diagram; Power diagram; Centroidal Voronoi tessellation; Mathematics; Euclidean geometry; Computation; Bowyer–Watson algorithm; Point (geometry); Diagram; Euclidean distance; Computational geometry; Algorithm; Set (abstract data type); Combinatorics; Discrete mathematics; Computer science; Geometry","score_opus":0.012885069259639101,"score_gpt":0.3268844164189159,"score_spread":0.3139993471592768,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2115581764","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5199345,0.00009026119,0.47831717,0.000970777,0.00011976574,0.0003382522,0.00006948796,0.0000028457732,0.00015695067],"genre_scores_gemma":[0.9888739,0.00000106029,0.010703103,0.000069692476,0.00028148104,0.00001517566,0.000038170765,0.000004999835,0.000012398896],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99828327,0.00007125179,0.0006777194,0.00013442761,0.000696096,0.00013726711],"domain_scores_gemma":[0.99757624,0.0006047001,0.00064737705,0.00014705883,0.00097318855,0.00005142008],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005290511,0.00009115858,0.00016515767,0.00018645667,0.00012389618,0.00007263946,0.00067228114,0.000020334477,0.000058771864],"category_scores_gemma":[0.00006704343,0.0000616669,0.00017920908,0.0004065763,0.00012839327,0.00024833292,0.000054511518,0.00013927543,0.0000012709435],"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.0002338387,0.0016831533,0.04645032,0.000024373905,0.000271187,5.6562425e-7,0.0007712063,0.5864351,0.007520971,0.18289086,0.0007104375,0.17300804],"study_design_scores_gemma":[0.0024995054,0.00042400236,0.28693014,0.00022548821,0.00007630139,0.000018804976,0.0032978614,0.27779895,0.010842937,0.4163274,0.0012815828,0.00027703829],"about_ca_topic_score_codex":0.00008256268,"about_ca_topic_score_gemma":0.00001306439,"teacher_disagreement_score":0.46893942,"about_ca_system_score_codex":0.00004005828,"about_ca_system_score_gemma":0.00022655251,"threshold_uncertainty_score":0.25147033},"labels":[],"label_agreement":null},{"id":"W2116409181","doi":"10.1142/s0218195900000309","title":"VISIBILITY STABS AND DEPTH-FIRST SPIRALLING ON LINE SEGMENTS IN OUTPUT SENSITIVE TIME","year":2000,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge; University of Saskatchewan","funders":"","keywords":"Traverse; Visibility; Visibility graph; Visibility polygon; Graph; Computer science; Line (geometry); Line segment; Algorithm; Set (abstract data type); Mathematics; Artificial intelligence; Optics; Theoretical computer science; Geometry; Regular polygon; Simple polygon; Geography; Geodesy; Physics","score_opus":0.016608263547273308,"score_gpt":0.28811897972057954,"score_spread":0.27151071617330624,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116409181","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23357111,0.00016009503,0.76208925,0.0025129498,0.00019009244,0.00036818933,0.000032550917,0.00003922009,0.0010365366],"genre_scores_gemma":[0.94304556,0.00008576826,0.05508455,0.00084400293,0.00048963795,0.000030884865,0.000071037364,0.000013023727,0.00033551062],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973845,0.000093260605,0.0008651178,0.00041678594,0.001032931,0.00020743549],"domain_scores_gemma":[0.99766964,0.0006557192,0.0003811023,0.00019465107,0.0009406221,0.00015826689],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007019893,0.00020909496,0.00027075133,0.0008850405,0.00014345732,0.00022992738,0.000679815,0.00007648178,0.00008677504],"category_scores_gemma":[0.000060948696,0.00021491839,0.000117254065,0.00087836734,0.000073092226,0.0006889072,0.00010309893,0.00029169492,0.00013619965],"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.00009395774,0.00047380736,0.0007363495,0.0000087787275,0.000100293524,0.00003217766,0.00016463279,0.67892265,0.00007175355,0.009174661,0.00012515085,0.3100958],"study_design_scores_gemma":[0.0051198066,0.0008858618,0.12936899,0.0002991698,0.000053561376,0.00093973166,0.00006325723,0.687635,0.0013827553,0.11416249,0.059102483,0.0009869001],"about_ca_topic_score_codex":0.0000083108725,"about_ca_topic_score_gemma":0.0000058884416,"teacher_disagreement_score":0.7094745,"about_ca_system_score_codex":0.00021731874,"about_ca_system_score_gemma":0.00017262348,"threshold_uncertainty_score":0.87641174},"labels":[],"label_agreement":null},{"id":"W2116598609","doi":"10.1142/s0218195900000292","title":"OPTIMAL FACILITY LOCATION UNDER VARIOUS DISTANCE FUNCTIONS","year":2000,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Facility location problem; 1-center problem; Location model; Mathematics; Function (biology); Mathematical optimization; Location-allocation; Computer science; Operations research","score_opus":0.014649332940829006,"score_gpt":0.2540445895816632,"score_spread":0.2393952566408342,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116598609","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04448703,0.00021222408,0.943107,0.004315632,0.00060328643,0.00038611973,0.0000590554,0.00008402329,0.006745646],"genre_scores_gemma":[0.99174947,0.00003583385,0.0030109491,0.0017312461,0.0012654233,0.000093074435,0.0004347947,0.000013978026,0.0016652282],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9976956,0.0000175457,0.00084353174,0.00027635568,0.0009758466,0.00019108932],"domain_scores_gemma":[0.9972487,0.000070586924,0.00030494496,0.00021091991,0.0021238236,0.00004101719],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00043252838,0.00018743087,0.00019325902,0.00058739394,0.00023332532,0.0002780626,0.00065419363,0.000059392198,0.0038956201],"category_scores_gemma":[0.00004454787,0.00019387639,0.00016889148,0.0010691854,0.00010403728,0.0011593059,0.00006728111,0.00021053979,0.001953873],"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.00008057456,0.00042286207,0.0008386926,0.00003004954,0.00017237483,0.0000023346554,0.000021968463,0.8930242,0.00000913336,0.028425409,0.0036950347,0.07327735],"study_design_scores_gemma":[0.00084473443,0.000019757206,0.027949417,0.000025037263,0.000086975764,0.000029267743,0.00022037022,0.0330384,0.000004835352,0.019581234,0.9179032,0.0002967884],"about_ca_topic_score_codex":0.00009879319,"about_ca_topic_score_gemma":0.000029395456,"teacher_disagreement_score":0.94726247,"about_ca_system_score_codex":0.00017323725,"about_ca_system_score_gemma":0.00010319882,"threshold_uncertainty_score":0.9988232},"labels":[],"label_agreement":null},{"id":"W2116792850","doi":"10.1142/s0218195910003281","title":"GRID VERTEX-UNFOLDING ORTHOSTACKS","year":2010,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"McGill University","keywords":"Vertex (graph theory); Mathematics; Combinatorics; Grid; Surface (topology); Plane (geometry); Geometry; Graph","score_opus":0.007965995282322239,"score_gpt":0.28004740388542537,"score_spread":0.27208140860310315,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116792850","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027971221,0.00020380286,0.9641427,0.002360614,0.0034418947,0.00026197877,0.000031766438,0.000081854785,0.0015041863],"genre_scores_gemma":[0.7734446,0.000030823485,0.22354883,0.0007371595,0.0019342485,0.000050994546,0.00009245752,0.00001727824,0.00014361386],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9969316,0.000054623746,0.0009572827,0.00035617762,0.0014545043,0.0002457846],"domain_scores_gemma":[0.99517894,0.0006429618,0.0007574915,0.0003213018,0.0028586963,0.0002406004],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007415954,0.00022105925,0.0002544588,0.0011725407,0.00022285659,0.00043123704,0.0020445916,0.000111357,0.00015976882],"category_scores_gemma":[0.00016284749,0.00022399731,0.0002568666,0.0012316664,0.000084238665,0.001235515,0.00024881345,0.00056243635,0.00013067029],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004219559,0.0005941321,0.0016774466,0.000015611007,0.0003627807,0.000045255925,0.00018063775,0.110001385,0.0052776476,0.5556466,0.004283908,0.32187244],"study_design_scores_gemma":[0.0020478235,0.00020387759,0.01590651,0.000048519978,0.000058523936,0.0021496709,0.000058993315,0.050421864,0.0036492066,0.26381102,0.66090256,0.000741437],"about_ca_topic_score_codex":0.000003925487,"about_ca_topic_score_gemma":0.0000033966407,"teacher_disagreement_score":0.7454734,"about_ca_system_score_codex":0.00009445862,"about_ca_system_score_gemma":0.00048098632,"threshold_uncertainty_score":0.9134345},"labels":[],"label_agreement":null},{"id":"W2117878581","doi":"10.1142/s0218195911003755","title":"SHORTEST DESCENDING PATHS: TOWARDS AN EXACT ALGORITHM","year":2011,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Shortest path problem; Path (computing); Terrain; Euclidean shortest path; Algorithm; Sequence (biology); Combinatorics; Time complexity; Approximation algorithm; Point (geometry); Yen's algorithm; K shortest path routing; Computer science; Dijkstra's algorithm; Geometry; Graph; Geography","score_opus":0.03376333864733476,"score_gpt":0.30093062877473153,"score_spread":0.26716729012739676,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2117878581","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0053721797,0.0002930684,0.99078697,0.00035085002,0.0009484643,0.0002791975,0.00003873691,0.00010035556,0.0018301489],"genre_scores_gemma":[0.5214405,0.000041302792,0.4770291,0.00036822926,0.000910929,0.000048251844,0.00008929828,0.000016901504,0.000055521163],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967146,0.000113938404,0.0010306636,0.00043279893,0.0014305754,0.0002774573],"domain_scores_gemma":[0.99577665,0.00022285151,0.00076262496,0.0003322806,0.00258941,0.00031618713],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008186674,0.00025925454,0.00029588118,0.0012684676,0.00021444343,0.00032375404,0.0022522581,0.00010023517,0.00017258998],"category_scores_gemma":[0.00006136204,0.0002630469,0.00023455052,0.0012103315,0.000083969375,0.0020568408,0.00022809679,0.00031779305,0.00007293133],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029281382,0.0009361305,0.0005928818,0.000006784271,0.0002738692,0.000058040096,0.00054333004,0.02695192,0.00022584634,0.09627012,0.00031561655,0.87379616],"study_design_scores_gemma":[0.0029354803,0.0011129522,0.07365651,0.00012482255,0.00015017159,0.0036813745,0.00041157845,0.3154905,0.004873507,0.5117546,0.08427734,0.0015311872],"about_ca_topic_score_codex":0.000015356862,"about_ca_topic_score_gemma":0.0000017536512,"teacher_disagreement_score":0.872265,"about_ca_system_score_codex":0.00020364049,"about_ca_system_score_gemma":0.00050565094,"threshold_uncertainty_score":0.9999822},"labels":[],"label_agreement":null},{"id":"W2118695911","doi":"10.1142/s0218195910003256","title":"FINDING ALL DOOR LOCATIONS THAT MAKE A ROOM SEARCHABLE","year":2010,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge; Simon Fraser University","funders":"","keywords":"Polygon (computer graphics); Boundary (topology); Simple polygon; Combinatorics; Point (geometry); Mathematics; Line (geometry); Line segment; Polygon covering; Computer science; Algorithm; Computer graphics (images); Geometry; Monotone polygon; Mathematical analysis; Computer network","score_opus":0.02494821649383296,"score_gpt":0.3166541974319437,"score_spread":0.29170598093811073,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2118695911","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017502833,0.00021710308,0.9733778,0.0055201007,0.0014981753,0.00039316557,0.00004298424,0.000090251495,0.0013575413],"genre_scores_gemma":[0.75094485,0.000038229664,0.24620011,0.00091587467,0.0012355535,0.000101983205,0.00014134479,0.000020692456,0.00040133088],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9965104,0.00007928624,0.0008894038,0.00043275586,0.0017570587,0.00033110636],"domain_scores_gemma":[0.9952563,0.0007881506,0.00077832956,0.00039775894,0.0024805493,0.00029892684],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009981269,0.00025353278,0.00027759033,0.0014804949,0.0002896524,0.0005824328,0.0022858097,0.00012988481,0.00018866925],"category_scores_gemma":[0.00013548414,0.0002601271,0.00026581308,0.0012254649,0.00009523835,0.0010896066,0.00031397567,0.0006694642,0.00016864714],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004987245,0.00095786515,0.0021924956,0.000027676695,0.00062019704,0.000043171593,0.000385585,0.22287768,0.0045874263,0.4980982,0.0040646433,0.2660952],"study_design_scores_gemma":[0.0019570151,0.00017714576,0.019268705,0.000053334647,0.00007384573,0.0018700474,0.000107206855,0.09606741,0.0034820382,0.25087875,0.62532324,0.000741265],"about_ca_topic_score_codex":0.000010007009,"about_ca_topic_score_gemma":0.000013024644,"teacher_disagreement_score":0.733442,"about_ca_system_score_codex":0.00014813303,"about_ca_system_score_gemma":0.0006091708,"threshold_uncertainty_score":0.9999851},"labels":[],"label_agreement":null},{"id":"W2119490711","doi":"10.1142/s0218195900000085","title":"EXACT AND OPTIMAL CONVEX HULLS IN 2D","year":2000,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Convex hull; Rounding; Mathematics; Hull; Floating point; Computation; Convex combination; Interval arithmetic; Algorithm; Convex set; Regular polygon; Combinatorics; Arithmetic; Convex optimization; Computer science; Geometry; Mathematical analysis","score_opus":0.011457383642419352,"score_gpt":0.31300177017626346,"score_spread":0.30154438653384413,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2119490711","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027689397,0.0004084247,0.9684378,0.002266051,0.0001530918,0.00014409208,0.000011055377,0.000020082423,0.00086998916],"genre_scores_gemma":[0.40130165,0.00015098673,0.59741855,0.00060011545,0.00035003907,0.00002839955,0.0000071035133,0.000008612572,0.0001345401],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983358,0.00006876232,0.000589789,0.00022587115,0.0006246864,0.00015513434],"domain_scores_gemma":[0.9985629,0.00049048767,0.00024592597,0.00012742939,0.00043825328,0.00013501788],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045135373,0.00012151038,0.00021279491,0.0004597199,0.000057943307,0.00017938572,0.0008713034,0.00004635749,0.0001989751],"category_scores_gemma":[0.000030834017,0.00011487388,0.00008601678,0.0006183317,0.00007797658,0.00053025817,0.00008863005,0.00023296545,0.000043098204],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002117966,0.00024144752,0.00090468343,0.0000045820734,0.000070203416,0.000029868757,0.00010445173,0.03638298,0.00007101479,0.031481978,0.00012271688,0.9305649],"study_design_scores_gemma":[0.0037159647,0.00040119665,0.1118223,0.00013270733,0.000034419027,0.002111035,0.00012980736,0.21320595,0.00042210982,0.3749636,0.29225788,0.0008030252],"about_ca_topic_score_codex":0.0000073615897,"about_ca_topic_score_gemma":2.8934582e-7,"teacher_disagreement_score":0.9297619,"about_ca_system_score_codex":0.00006600023,"about_ca_system_score_gemma":0.00010364108,"threshold_uncertainty_score":0.46844208},"labels":[],"label_agreement":null},{"id":"W2120092636","doi":"10.1142/s0218195900000103","title":"An O(n <font>log</font> n) ALGORITHM FOR FINDING A SHORTEST CENTRAL LINK SEGMENT","year":2000,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Combinatorics; Simple polygon; Mathematics; Link (geometry); Polygon (computer graphics); Vertex (graph theory); Upper and lower bounds; Algorithm; Geometry; Graph; Regular polygon; Computer science; Mathematical analysis","score_opus":0.015412377064069742,"score_gpt":0.30347923727356124,"score_spread":0.2880668602094915,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120092636","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005697797,0.00031333865,0.99011564,0.001908957,0.00073526474,0.00063429325,0.00013916343,0.000084854575,0.00037071516],"genre_scores_gemma":[0.38168132,0.0000745657,0.61323327,0.0009641313,0.0030752458,0.00020341542,0.00045987673,0.000026706943,0.0002814774],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99662197,0.000085430576,0.0011065019,0.0004967264,0.001299436,0.0003899186],"domain_scores_gemma":[0.9966684,0.0005383056,0.00055851927,0.00030784094,0.0015858556,0.0003410863],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00066875725,0.00027823017,0.00032055963,0.0008510668,0.00031852745,0.00051525974,0.0018158483,0.00011346768,0.00019673033],"category_scores_gemma":[0.000032262196,0.000291539,0.00031131756,0.00092301675,0.00006656872,0.0013681084,0.00007947272,0.00027293531,0.000047750676],"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.000027484213,0.00036721866,0.0001470879,0.0000047631643,0.00015920405,0.0000082193865,0.00010968759,0.29575217,0.00012997794,0.015536645,0.0004283725,0.6873292],"study_design_scores_gemma":[0.0020665887,0.00049064145,0.007516161,0.00005166194,0.000065740656,0.00060766574,0.00006327273,0.72830546,0.0006213527,0.06931314,0.19034402,0.0005542826],"about_ca_topic_score_codex":0.0000062899067,"about_ca_topic_score_gemma":0.0000021590695,"teacher_disagreement_score":0.68677485,"about_ca_system_score_codex":0.0002932269,"about_ca_system_score_gemma":0.00047702208,"threshold_uncertainty_score":0.9999537},"labels":[],"label_agreement":null},{"id":"W2120958705","doi":"10.1142/s0218195901000638","title":"SEARCHING A POLYGONAL REGION FROM THE BOUNDARY","year":2001,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Guidance and Control Systems","field":"Engineering","cited_by":31,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Boundary (topology); Polygon (computer graphics); Monotone polygon; Mathematics; Conjecture; Visibility polygon; Combinatorics; Equivalence (formal languages); Simple polygon; Computer science; Discrete mathematics; Geometry","score_opus":0.011310559180230979,"score_gpt":0.25605745540734653,"score_spread":0.24474689622711557,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120958705","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.102752626,0.003257043,0.886773,0.0033042142,0.00073819555,0.00024723975,0.0000431182,0.000070434246,0.0028141416],"genre_scores_gemma":[0.994656,0.00015229221,0.0020879153,0.00044641749,0.0024656528,0.00004798817,0.000051664716,0.00001946881,0.000072569266],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984369,0.000038435977,0.00052903156,0.00010981042,0.000740878,0.0001449127],"domain_scores_gemma":[0.99855834,0.0004885111,0.00019428856,0.00013006302,0.00054830266,0.00008047489],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023403265,0.000119900826,0.00015152092,0.00021285986,0.00012641304,0.0001749134,0.00069566467,0.00004459966,0.00006743356],"category_scores_gemma":[0.000024200526,0.000097567856,0.00015083097,0.00033023467,0.000059043778,0.0002659795,0.000037113106,0.00028528876,0.000073373834],"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.00010917483,0.0001609494,0.012583155,0.000010376588,0.00112137,0.00007955177,0.0003853463,0.67957383,0.0007723489,0.01755771,0.007629139,0.28001708],"study_design_scores_gemma":[0.001217293,0.00003932462,0.057833288,0.000101047655,0.00005462648,0.0011838084,0.00029085376,0.03661899,0.00005138621,0.08403151,0.8183092,0.0002686813],"about_ca_topic_score_codex":0.00002946795,"about_ca_topic_score_gemma":0.0000071501445,"teacher_disagreement_score":0.8919034,"about_ca_system_score_codex":0.00012833295,"about_ca_system_score_gemma":0.0000989121,"threshold_uncertainty_score":0.39787015},"labels":[],"label_agreement":null},{"id":"W2121154134","doi":"10.1142/s0218195901000559","title":"LOWER BOUNDS FOR STREETS AND GENERALIZED STREETS","year":2001,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Competitive analysis; Mathematics; Combinatorics; Upper and lower bounds; Matching (statistics); Metric (unit); Simple (philosophy); Online algorithm; Line (geometry); Cross-ratio; Discrete mathematics; Mathematical optimization; Statistics; Geometry; Mathematical analysis; Pure mathematics","score_opus":0.019899946799461558,"score_gpt":0.31829916885142107,"score_spread":0.2983992220519595,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2121154134","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00737675,0.00031084218,0.986402,0.004507915,0.00032708823,0.00035042374,0.000030466428,0.000036544,0.0006580022],"genre_scores_gemma":[0.5926896,0.0002523635,0.40487334,0.0009903321,0.0006065032,0.000114029936,0.000065382155,0.000016493781,0.0003919657],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99821305,0.00003934638,0.0005815586,0.00024205366,0.00074003823,0.00018396424],"domain_scores_gemma":[0.9969447,0.00037158353,0.0003969308,0.00016151942,0.0019489581,0.00017629097],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040792357,0.00013538374,0.00018143172,0.00056911807,0.00015595109,0.00036424657,0.000953624,0.0000563361,0.00006090362],"category_scores_gemma":[0.000058795085,0.00013157101,0.00012715206,0.00048589846,0.00007355274,0.0006593656,0.00013786247,0.00013799821,0.000011917532],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014307456,0.00074875,0.0025233408,0.000022316914,0.00047951195,0.00002823714,0.000210171,0.21467572,0.00024933994,0.46607384,0.004169438,0.31067625],"study_design_scores_gemma":[0.0037206016,0.00032772307,0.0065631373,0.00004711333,0.00003299207,0.0006827855,0.000049783295,0.22724149,0.0001026139,0.27143183,0.48938462,0.00041529597],"about_ca_topic_score_codex":0.0000035677367,"about_ca_topic_score_gemma":0.0000024095195,"teacher_disagreement_score":0.58531284,"about_ca_system_score_codex":0.00007838957,"about_ca_system_score_gemma":0.00020095815,"threshold_uncertainty_score":0.53653103},"labels":[],"label_agreement":null},{"id":"W2123672008","doi":"10.1142/s0218195909003143","title":"ON STRUCTURAL AND GRAPH THEORETIC PROPERTIES OF HIGHER ORDER DELAUNAY GRAPHS","year":2009,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Departament d'Universitats, Recerca i Societat de la Informació; Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Delaunay triangulation; Line graph; Discrete mathematics; Complement graph; Graph; Voltage graph","score_opus":0.00971004641262518,"score_gpt":0.2639447868047667,"score_spread":0.2542347403921415,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123672008","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16540433,0.0011325302,0.8295215,0.0027263158,0.00042323643,0.0002676406,0.0000148190675,0.000034324137,0.00047535717],"genre_scores_gemma":[0.9520374,0.000052091487,0.046841577,0.00076517544,0.000205032,0.000014457104,0.000019058705,0.000007430125,0.00005777308],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99780196,0.00006827474,0.00071454316,0.00026078225,0.0010051803,0.00014924069],"domain_scores_gemma":[0.99685794,0.00027611887,0.00058745744,0.00017940842,0.0019835199,0.000115577604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031069055,0.00018207387,0.00023787458,0.001000865,0.00012392488,0.00014769183,0.0008372809,0.00006299474,0.000033003766],"category_scores_gemma":[0.000059848226,0.00015531623,0.00013495074,0.0010332107,0.00013462134,0.0005265574,0.000074429445,0.00019937949,0.0000068039717],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006245219,0.00016476109,0.00013367308,0.000010602151,0.00012340624,0.000003960906,0.00010672079,0.09486916,0.001022067,0.84935486,0.00017778837,0.053970575],"study_design_scores_gemma":[0.0009140193,0.00034169215,0.017649695,0.000066279244,0.00002889804,0.00022206672,0.000018120254,0.012579195,0.0018617876,0.9640172,0.0020693876,0.00023164073],"about_ca_topic_score_codex":0.0000018135835,"about_ca_topic_score_gemma":2.7181207e-7,"teacher_disagreement_score":0.7866331,"about_ca_system_score_codex":0.000049411745,"about_ca_system_score_gemma":0.00015225647,"threshold_uncertainty_score":0.6333612},"labels":[],"label_agreement":null},{"id":"W2124205318","doi":"10.1142/s0218195902000979","title":"DIAMONDS ARE NOT A MINIMUM WEIGHT TRIANGULATION'S BEST FRIEND","year":2002,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; McGill University; Carleton University","funders":"","keywords":"Minimum-weight triangulation; Mathematics; Combinatorics; Triangulation; Point set triangulation; Graph; Time complexity; Pitteway triangulation; Constant (computer programming); Point (geometry); Set (abstract data type); Discrete mathematics; Delaunay triangulation; Bowyer–Watson algorithm; Geometry; Computer science","score_opus":0.022254890056135224,"score_gpt":0.27384084145362225,"score_spread":0.251585951397487,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2124205318","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010468474,0.0010515086,0.9783695,0.0067633837,0.0011904666,0.00036132435,0.00006230118,0.00007630142,0.0016567382],"genre_scores_gemma":[0.87096155,0.00013811942,0.12446858,0.0009959921,0.0022021797,0.0001026774,0.00007654758,0.000025178297,0.0010291758],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9960637,0.000112758804,0.001218904,0.00046095936,0.001853028,0.00029065073],"domain_scores_gemma":[0.99458677,0.0007309276,0.00128105,0.00035555786,0.002774476,0.00027124136],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005322635,0.0002882752,0.00036552656,0.0014975055,0.0002704974,0.0004380356,0.0018323589,0.0001252692,0.00035474848],"category_scores_gemma":[0.00014994833,0.00029428606,0.00033562566,0.0016816617,0.00009772001,0.001378666,0.00021754288,0.000341305,0.00034893342],"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.00010927337,0.002599548,0.001741511,0.000038048656,0.00086662924,0.0001247844,0.0006904147,0.28935605,0.000735695,0.19763432,0.01634227,0.48976144],"study_design_scores_gemma":[0.0046968297,0.0003852043,0.014229264,0.00012740628,0.00013136232,0.0014298721,0.00013782423,0.3313995,0.0013756043,0.094135664,0.5508798,0.0010716895],"about_ca_topic_score_codex":0.0000027187143,"about_ca_topic_score_gemma":0.0000014155753,"teacher_disagreement_score":0.86049306,"about_ca_system_score_codex":0.0002146029,"about_ca_system_score_gemma":0.00015747808,"threshold_uncertainty_score":0.99995095},"labels":[],"label_agreement":null},{"id":"W2126525546","doi":"10.1142/s0218195903001189","title":"COLLISION DETECTION OPTIMIZATION IN A MULTI-PARTICLE SYSTEM","year":2003,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada; Research Services, University of Calgary; University of Calgary","keywords":"Voronoi diagram; Collision detection; Collision; Particle system; Event (particle physics); Computer science; Discrete event simulation; Mathematical optimization; Particle (ecology); Algorithm; Mathematics; Simulation; Geometry; Physics; Computer graphics (images)","score_opus":0.015992117870421124,"score_gpt":0.28245956038806685,"score_spread":0.26646744251764576,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2126525546","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012173834,0.00035716637,0.98567516,0.0002896909,0.000708731,0.00037943452,0.000007786021,0.000060625916,0.00034757712],"genre_scores_gemma":[0.7355604,0.000023324546,0.26402518,0.00010654126,0.00014460542,0.000070271446,0.0000172823,0.000010627558,0.000041744028],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973079,0.00018561221,0.0010003371,0.00032267728,0.0009754759,0.00020801526],"domain_scores_gemma":[0.9969533,0.00033988841,0.0006352124,0.00020332963,0.0017285965,0.00013966252],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009392909,0.00017794991,0.00023298642,0.0010352123,0.00014403005,0.00024886086,0.0007804553,0.00008935982,0.000023820206],"category_scores_gemma":[0.00014806031,0.00018781825,0.00014323369,0.0018805361,0.000038495065,0.0010223339,0.00007507049,0.00022387762,0.000037698686],"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.00002017604,0.00030884755,0.00041444047,0.000010552802,0.00004877853,0.000013265584,0.00007332927,0.91338843,0.00035513754,0.07065,0.000024673596,0.014692387],"study_design_scores_gemma":[0.0023300224,0.000115180104,0.0035058402,0.00006259397,0.000019622094,0.0006755287,0.00015815174,0.97103715,0.004674583,0.007024027,0.010094869,0.00030245192],"about_ca_topic_score_codex":0.0000067147394,"about_ca_topic_score_gemma":0.000004928685,"teacher_disagreement_score":0.7233866,"about_ca_system_score_codex":0.00043633181,"about_ca_system_score_gemma":0.00029743765,"threshold_uncertainty_score":0.7659006},"labels":[],"label_agreement":null},{"id":"W2126873594","doi":"10.1142/s0218195910003335","title":"A LOWER BOUND ON THE AREA OF A 3-COLOURED DISK PACKING","year":2010,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Disjoint sets; Conjecture; Set (abstract data type); Cover (algebra); Pairwise comparison; Upper and lower bounds; Plane (geometry); Fraction (chemistry); Unit (ring theory); Discrete mathematics; Computer science; Geometry; Statistics","score_opus":0.015092753927062564,"score_gpt":0.2819490346999965,"score_spread":0.26685628077293394,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2126873594","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12794916,0.00008929464,0.862992,0.0060570557,0.0012178967,0.00032265618,0.000031851905,0.000029032239,0.0013110454],"genre_scores_gemma":[0.95938754,0.000013148483,0.038942404,0.0007714452,0.0007022702,0.000057421617,0.000026254984,0.000011767071,0.00008776015],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972377,0.00007309918,0.00083410065,0.0002680366,0.001411197,0.00017588436],"domain_scores_gemma":[0.99482214,0.0014590193,0.0009200592,0.00035012423,0.0023309481,0.000117683034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087098056,0.00018260111,0.00022980552,0.00072756654,0.00020198578,0.00025123745,0.0018201512,0.000079985664,0.00013426592],"category_scores_gemma":[0.00025817624,0.00014217518,0.0002586056,0.0010798987,0.00014051264,0.00046637713,0.00016807769,0.00048200574,0.000035933295],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008831159,0.0008656054,0.0006985562,0.00001005504,0.0003719245,0.000014660685,0.00022642473,0.11579457,0.004971652,0.7951728,0.0021925655,0.07959283],"study_design_scores_gemma":[0.0023337193,0.00062994636,0.04263743,0.0001370938,0.00009323173,0.00090275117,0.000131223,0.09515892,0.0072530797,0.65699905,0.19298787,0.00073570677],"about_ca_topic_score_codex":0.0000031684567,"about_ca_topic_score_gemma":0.0000036021834,"teacher_disagreement_score":0.83143836,"about_ca_system_score_codex":0.00006648305,"about_ca_system_score_gemma":0.00037004577,"threshold_uncertainty_score":0.57977355},"labels":[],"label_agreement":null},{"id":"W2127083985","doi":"10.1142/s0218195907002343","title":"MAINTAINING VISIBILITY INFORMATION OF PLANAR POINT SETS WITH A MOVING VIEWPOINT","year":2007,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge; McGill University","funders":"","keywords":"Mathematics; Amortized analysis; Combinatorics; Visibility; Binary logarithm; Set (abstract data type); Point (geometry); Planar; Plane (geometry); Time complexity; Preprocessor; Data structure; Discrete mathematics; Algorithm; Computer science; Geometry; Artificial intelligence","score_opus":0.008923220077508166,"score_gpt":0.2787615474502688,"score_spread":0.26983832737276064,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2127083985","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021393657,0.00016521505,0.97532624,0.001396384,0.00028006168,0.00035111065,0.000028984472,0.000042690706,0.001015646],"genre_scores_gemma":[0.688761,0.000017244227,0.3103425,0.0005264037,0.00024127342,0.000016396445,0.00007942839,0.000007707419,0.000008048957],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964325,0.00006490127,0.0014423829,0.00024169103,0.0015818389,0.00023670425],"domain_scores_gemma":[0.99380946,0.00077286956,0.0014686394,0.00026039733,0.0035100428,0.00017861553],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019812537,0.00020359705,0.0003011132,0.0014273493,0.00013438227,0.00017501035,0.0011175094,0.00007681733,0.000034106994],"category_scores_gemma":[0.000133803,0.00018726046,0.00017141351,0.0012999364,0.0000919328,0.0019764176,0.00013314269,0.00028324613,0.000021704309],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028993873,0.0004917555,0.0020883316,0.00004812859,0.00043617215,0.000026822972,0.0007568149,0.30656654,0.00045840183,0.37772545,0.0003012247,0.31081042],"study_design_scores_gemma":[0.0077138874,0.0017763004,0.16851011,0.0005556212,0.00015514517,0.0042224377,0.001548482,0.12097452,0.008103108,0.58018714,0.10460231,0.0016509276],"about_ca_topic_score_codex":0.000009482679,"about_ca_topic_score_gemma":0.0000039946067,"teacher_disagreement_score":0.66736734,"about_ca_system_score_codex":0.00024043002,"about_ca_system_score_gemma":0.00044675116,"threshold_uncertainty_score":0.763626},"labels":[],"label_agreement":null},{"id":"W2131197449","doi":"10.1142/s0218195905001853","title":"ON MULTI-LEVEL k-RANGES FOR RANGE SEARCH","year":2005,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick; University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Range (aeronautics); Mathematics; Combinatorics; Binary logarithm; Tree (set theory); Materials science","score_opus":0.05640688424490003,"score_gpt":0.350634776905452,"score_spread":0.29422789266055194,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2131197449","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010424951,0.00014579686,0.99060136,0.006935548,0.00030789553,0.0003749825,0.00014525068,0.000037149242,0.00040954907],"genre_scores_gemma":[0.24264005,0.000041774725,0.7536202,0.0013662429,0.0014377175,0.00011757786,0.00010499424,0.000015328209,0.0006561021],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.998136,0.000028682207,0.00049190124,0.0002458782,0.00091841974,0.00017914656],"domain_scores_gemma":[0.99758905,0.000553778,0.0002963786,0.00020684981,0.0012487043,0.00010525344],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005390725,0.00013407669,0.00015838355,0.00074783503,0.0001226815,0.00027768087,0.0018648527,0.000039159597,0.000042306096],"category_scores_gemma":[0.000048360125,0.00012709557,0.00016468055,0.00041963934,0.00004449441,0.0008041879,0.00016590428,0.00016094572,0.00012591713],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040301165,0.0006268938,0.00010067944,0.000011161073,0.00023203934,0.0000038533894,0.00008224202,0.07932038,0.000041064373,0.27076557,0.0060648085,0.642711],"study_design_scores_gemma":[0.005690303,0.0003378201,0.011919236,0.00008045663,0.00005067983,0.00010919056,0.00006919908,0.32718346,0.0007386674,0.081101395,0.5721415,0.0005780476],"about_ca_topic_score_codex":0.0000015794235,"about_ca_topic_score_gemma":0.0000012537815,"teacher_disagreement_score":0.64213294,"about_ca_system_score_codex":0.0001190612,"about_ca_system_score_gemma":0.00010058439,"threshold_uncertainty_score":0.5182807},"labels":[],"label_agreement":null},{"id":"W2132048063","doi":"10.1142/s0218195900000346","title":"EQUIVALENCE OF TOPOLOGICAL FORM FOR CURVILINEAR GEOMETRIC OBJECTS","year":2000,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Advanced Numerical Analysis Techniques","field":"Engineering","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Curvilinear coordinates; Mathematics; Parametric surface; Surface (topology); Boundary (topology); Topology (electrical circuits); Object (grammar); Geometric modeling; Equivalence (formal languages); Geometry; Pure mathematics; Parametric statistics; Computer science; Mathematical analysis; Combinatorics; Artificial intelligence","score_opus":0.011739093172455294,"score_gpt":0.30373041615598373,"score_spread":0.2919913229835284,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2132048063","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033054765,0.00054596807,0.9646639,0.00015816893,0.0000843626,0.00025396093,0.00008683478,0.000069363596,0.0010826304],"genre_scores_gemma":[0.8592188,0.0002853319,0.13990247,0.00006830887,0.00031445266,0.00007879189,0.000046116347,0.000016341231,0.00006941117],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983359,0.0000126384,0.0007781754,0.0001353002,0.00058390276,0.00015408962],"domain_scores_gemma":[0.9979775,0.0005555605,0.0002589322,0.00011342494,0.0010063521,0.00008824329],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021636428,0.00013549875,0.00028360522,0.00068272406,0.000043091466,0.00002436734,0.0005963269,0.000066647444,0.00037221596],"category_scores_gemma":[0.00007363965,0.00012722364,0.0002504938,0.00096091523,0.000088979,0.0002419015,0.000027607184,0.00016538028,0.000018147211],"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.000060885617,0.0002663145,0.00060981466,0.000044070748,0.00034395955,0.0000028585698,0.000031334326,0.7124326,0.0004909136,0.007166524,0.0004155577,0.27813515],"study_design_scores_gemma":[0.0030189767,0.0009090102,0.012884765,0.00017968605,0.00031599094,0.00045637268,0.00018190798,0.18436356,0.016574718,0.55523616,0.22476664,0.0011122037],"about_ca_topic_score_codex":0.0000014978398,"about_ca_topic_score_gemma":3.5399938e-7,"teacher_disagreement_score":0.826164,"about_ca_system_score_codex":0.0001112701,"about_ca_system_score_gemma":0.000039750772,"threshold_uncertainty_score":0.51880294},"labels":[],"label_agreement":null},{"id":"W2133160845","doi":"10.1142/s0218195913600091","title":"THE POINT-SET EMBEDDABILITY PROBLEM FOR PLANE GRAPHS","year":2013,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Treewidth; Mathematics; Combinatorics; Planar graph; 1-planar graph; Book embedding; Planar straight-line graph; Pathwidth; Partial k-tree; Chordal graph; Clique-sum; Outerplanar graph; Discrete mathematics; Embedding; Bounded function; Graph; Line graph; Computer science; Mathematical analysis","score_opus":0.01220426644043338,"score_gpt":0.28457366787008476,"score_spread":0.2723694014296514,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2133160845","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0045812237,0.00043585416,0.98333746,0.009352705,0.00066174526,0.0010687266,0.000047201862,0.000053641506,0.00046140995],"genre_scores_gemma":[0.65910804,0.000076108074,0.33741015,0.0009846409,0.0009861836,0.0008924846,0.0001795974,0.000021227414,0.00034155723],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99718815,0.00008958249,0.001042263,0.00032764848,0.0010814643,0.0002708683],"domain_scores_gemma":[0.9925651,0.0020215642,0.0007958208,0.0003029646,0.004140089,0.00017446784],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001029189,0.00019987782,0.00021920372,0.0005098164,0.00044161384,0.00070259237,0.0019781531,0.000072330164,0.000048661648],"category_scores_gemma":[0.00015634682,0.00015728771,0.00028114693,0.0008364184,0.000118886164,0.0010844548,0.00017454097,0.00022949946,0.00008179721],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055274966,0.00035131763,0.00045276023,0.000023911549,0.00040970024,0.0000024087244,0.00016893737,0.10803629,0.00030200434,0.5698002,0.017364461,0.30303276],"study_design_scores_gemma":[0.0008334097,0.00014717257,0.0047973245,0.000016502223,0.000019996114,0.00022382142,0.00006553746,0.03595935,0.00025620853,0.80187106,0.15558629,0.00022333127],"about_ca_topic_score_codex":0.000008693845,"about_ca_topic_score_gemma":0.0000027996234,"teacher_disagreement_score":0.6545268,"about_ca_system_score_codex":0.00013806617,"about_ca_system_score_gemma":0.00033115377,"threshold_uncertainty_score":0.6775114},"labels":[],"label_agreement":null},{"id":"W2133642716","doi":"10.1142/s021819591000344x","title":"CONSTRAINED POINT-SET EMBEDDABILITY OF PLANAR GRAPHS","year":2010,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Mathematics; Combinatorics; General position; Embedding; Planar graph; Discrete mathematics; Parameterized complexity; Disjoint sets; Graph; Computer science","score_opus":0.010859052222396621,"score_gpt":0.28850990657733566,"score_spread":0.277650854354939,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2133642716","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.059126657,0.00011270199,0.9365734,0.001815221,0.0010127402,0.000299048,0.00010018487,0.000044489105,0.00091558276],"genre_scores_gemma":[0.7693168,0.0000135716655,0.22983672,0.0002625298,0.00040583193,0.000029179515,0.00009127151,0.000009460064,0.000034635552],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968781,0.00007884736,0.0012089512,0.0003270594,0.0013112098,0.00019586318],"domain_scores_gemma":[0.9942068,0.0008729023,0.001070728,0.00034131712,0.0033132068,0.00019505396],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009845251,0.00020305684,0.00032186744,0.0011259533,0.00012157175,0.0001489343,0.001736088,0.000109564826,0.00013844355],"category_scores_gemma":[0.00020835595,0.00020226724,0.00029532783,0.0011856051,0.00021624952,0.0008077609,0.00013153882,0.00043498038,0.00002885298],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006836258,0.00069749577,0.00223603,0.000029493132,0.00038181854,0.000015226518,0.00023952643,0.041987725,0.007197928,0.8537715,0.001188768,0.09218609],"study_design_scores_gemma":[0.002099591,0.00027055014,0.024913974,0.00004255987,0.000059131653,0.0012656538,0.00010638282,0.026030986,0.004528233,0.89415556,0.046018302,0.00050905097],"about_ca_topic_score_codex":0.0000069784364,"about_ca_topic_score_gemma":0.0000046269374,"teacher_disagreement_score":0.7101902,"about_ca_system_score_codex":0.00005757834,"about_ca_system_score_gemma":0.0005295452,"threshold_uncertainty_score":0.8248219},"labels":[],"label_agreement":null},{"id":"W2134408180","doi":"10.1142/s0218195905001786","title":"MAXIMIZING A VORONOI REGION: THE CONVEX CASE","year":2005,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Voronoi diagram; Power diagram; Mathematics; Centroidal Voronoi tessellation; Combinatorics; Plane (geometry); Regular polygon; Weighted Voronoi diagram; Position (finance); Point (geometry); Set (abstract data type); Geometry; Computer science","score_opus":0.01837095015847291,"score_gpt":0.2848444143815391,"score_spread":0.2664734642230662,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134408180","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0056978385,0.0009803745,0.9739338,0.017478637,0.00061150815,0.00032157483,0.000010065376,0.000059057038,0.00090713636],"genre_scores_gemma":[0.8548314,0.000059872924,0.1403846,0.0020385992,0.002328706,0.000075288975,0.00002309104,0.000014202913,0.00024424613],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99728817,0.0001146169,0.0009460881,0.00031189737,0.0011148826,0.0002243253],"domain_scores_gemma":[0.995683,0.0007877494,0.0007982797,0.00033756334,0.0022306542,0.00016271813],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007297308,0.00020583585,0.00022767886,0.0005340272,0.00036466485,0.00043291197,0.0017398311,0.000072165516,0.00006270944],"category_scores_gemma":[0.000080501726,0.00016980141,0.00024864884,0.001063002,0.000109711385,0.0011264494,0.00024146435,0.00034712112,0.00010742018],"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.00002567895,0.00026433068,0.00013860333,0.0000066831485,0.00025218693,0.0002491964,0.00029733105,0.3530383,0.000046375615,0.21297643,0.0037622093,0.42894268],"study_design_scores_gemma":[0.0014742058,0.000118313925,0.0015755761,0.000036394995,0.00006172988,0.043505903,0.00018079934,0.16887198,0.00036605005,0.068294175,0.71508366,0.00043119083],"about_ca_topic_score_codex":0.0000056906724,"about_ca_topic_score_gemma":0.0000042114116,"teacher_disagreement_score":0.84913355,"about_ca_system_score_codex":0.00021088758,"about_ca_system_score_gemma":0.0003500967,"threshold_uncertainty_score":0.6924301},"labels":[],"label_agreement":null},{"id":"W2138394562","doi":"10.1142/s0218195902000906","title":"AN IMPROVED ALGORITHM FOR SUBDIVISION TRAVERSAL WITHOUT EXTRA STORAGE","year":2002,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Subdivision; Tree traversal; Mathematics; Pointer (user interface); Algorithm; Binary logarithm; Running time; Constant (computer programming); Combinatorics; Planar; Graph traversal; Computer science; Computer graphics (images); Artificial intelligence","score_opus":0.017631964689593434,"score_gpt":0.29424230258391576,"score_spread":0.2766103378943223,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2138394562","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036705246,0.00046068407,0.99328864,0.00084458274,0.0008509529,0.0005734011,0.00007981681,0.00008196511,0.00014942003],"genre_scores_gemma":[0.49372748,0.00004871458,0.50408506,0.00042567297,0.0013057046,0.00011099873,0.00013205051,0.000020501751,0.0001438194],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971698,0.000084495085,0.0009221239,0.0004462914,0.0011104312,0.00026687852],"domain_scores_gemma":[0.99550575,0.0004775849,0.00074871496,0.00030413852,0.002697617,0.0002661676],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006557059,0.00024711946,0.00029350913,0.0009848403,0.0002543035,0.00053299434,0.0017266211,0.000106139516,0.00010542415],"category_scores_gemma":[0.000053329164,0.0002535885,0.00026968482,0.0008027144,0.00006884496,0.0019034493,0.00009184434,0.00024580973,0.000038253136],"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.000028599277,0.00083877845,0.00008006985,0.000010457692,0.00021167166,0.000007946975,0.00021500871,0.09089607,0.0011122695,0.027188104,0.00090542604,0.8785056],"study_design_scores_gemma":[0.0014271257,0.00033438887,0.0010340484,0.000015814043,0.000029987406,0.00025984753,0.000039233943,0.9317876,0.00038707786,0.023250211,0.04115685,0.00027782956],"about_ca_topic_score_codex":0.0000030929266,"about_ca_topic_score_gemma":9.1713446e-7,"teacher_disagreement_score":0.8782278,"about_ca_system_score_codex":0.00018431213,"about_ca_system_score_gemma":0.00016610931,"threshold_uncertainty_score":0.99999166},"labels":[],"label_agreement":null},{"id":"W2139188177","doi":"10.1142/s0218195906002075","title":"THE STEINER CENTRE OF A SET OF POINTS: STABILITY, ECCENTRICITY, AND APPLICATIONS TO MOBILE FACILITY LOCATION","year":2006,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Mathematics; Combinatorics; Euclidean geometry; Steiner tree problem; Eccentricity (behavior); RADIUS; Point (geometry); Function (biology); Geometry; Discrete mathematics; Computer science","score_opus":0.011293344345689578,"score_gpt":0.2740421019614167,"score_spread":0.26274875761572714,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139188177","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040169973,0.00079717493,0.955654,0.0018192042,0.00016338851,0.0010224347,0.0001846173,0.000022161596,0.00016703228],"genre_scores_gemma":[0.9586421,0.000051695763,0.04044487,0.00010583008,0.00035756436,0.00021248223,0.00012093001,0.000008150027,0.000056368528],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99683285,0.00012497374,0.0013186568,0.00032584765,0.0012106557,0.00018702367],"domain_scores_gemma":[0.9927274,0.0011072604,0.0010012998,0.00033940372,0.0046953717,0.00012927942],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096636947,0.00018066242,0.00028138928,0.00061267504,0.00019191598,0.0001451483,0.0011559698,0.00006500371,0.000020038942],"category_scores_gemma":[0.00010261601,0.00015804052,0.00014492199,0.0016876886,0.00016616716,0.0004391991,0.0002904105,0.00016359976,0.00001289688],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000109200926,0.00081575505,0.005234619,0.00009071912,0.0002474176,0.00000159854,0.0002817147,0.5053636,0.0010745759,0.26728782,0.00081711804,0.21867588],"study_design_scores_gemma":[0.0036629469,0.0007579596,0.060507886,0.00016844177,0.00017933792,0.0003362522,0.0008727494,0.07170545,0.0145828845,0.47491843,0.37128484,0.0010228474],"about_ca_topic_score_codex":0.000031370986,"about_ca_topic_score_gemma":0.000014788793,"teacher_disagreement_score":0.9184721,"about_ca_system_score_codex":0.00013911011,"about_ca_system_score_gemma":0.0003292444,"threshold_uncertainty_score":0.6444706},"labels":[],"label_agreement":null},{"id":"W2140027094","doi":"10.1142/s0218195905001622","title":"GEOMETRIC PROXIMITY GRAPHS FOR IMPROVING NEAREST NEIGHBOR METHODS IN INSTANCE-BASED LEARNING AND DATA MINING","year":2005,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Machine Learning and Data Classification","field":"Computer Science","cited_by":88,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"k-nearest neighbors algorithm; Voronoi diagram; Classification rule; Computer science; Data mining; Decision rule; Pattern recognition (psychology); Artificial intelligence; Rule induction; Classifier (UML); Large margin nearest neighbor; Nearest neighbor graph; Mathematics","score_opus":0.036824472942890776,"score_gpt":0.38571561570188495,"score_spread":0.3488911427589942,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140027094","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0041126767,0.00068444316,0.9910625,0.003456051,0.00013849488,0.00033611606,0.00004312153,0.000043199605,0.00012335142],"genre_scores_gemma":[0.37242565,0.000022489114,0.62688565,0.00017108064,0.00025433485,0.000053663447,0.00015894999,0.000009846135,0.000018319315],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99783206,0.00013886623,0.0007890661,0.00045119136,0.00058997853,0.00019885441],"domain_scores_gemma":[0.9962611,0.0016116506,0.0008291798,0.00031734566,0.00086573086,0.000114954666],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002052382,0.00015699396,0.00022851027,0.001572563,0.0001707303,0.00034087323,0.0016755295,0.00006859376,0.000009461567],"category_scores_gemma":[0.00078188116,0.00016000216,0.00007126693,0.0013525399,0.0000616155,0.0013409414,0.00029641626,0.0003620399,0.0000032787193],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033689474,0.00018614925,0.010333155,0.000027559121,0.000044102817,0.0000016546384,0.00005885643,0.058050957,0.00016475505,0.014893604,0.00008714048,0.9161184],"study_design_scores_gemma":[0.001431338,0.000094964045,0.033727482,0.00003980418,0.000022045058,0.000066563975,0.0000461927,0.84265286,0.00009352048,0.0071488763,0.11444968,0.0002266786],"about_ca_topic_score_codex":0.000010328816,"about_ca_topic_score_gemma":0.0000064847886,"teacher_disagreement_score":0.9158917,"about_ca_system_score_codex":0.00013333581,"about_ca_system_score_gemma":0.0003027564,"threshold_uncertainty_score":0.6524699},"labels":[],"label_agreement":null},{"id":"W2141214294","doi":"10.1142/s021819590300127x","title":"COMPUTING THE CENTER OF AREA OF A CONVEX POLYGON","year":2003,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Convex polygon; Center (category theory); Mathematics; Regular polygon; Polygon (computer graphics); Simple polygon; Combinatorics; Convex set; Point (geometry); Set (abstract data type); Planar; Polygon covering; Geometry; Computer science; Convex optimization; Computer graphics (images)","score_opus":0.014468167253318398,"score_gpt":0.2792880748208776,"score_spread":0.2648199075675592,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141214294","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029724915,0.0005759394,0.9664597,0.0009538188,0.00053324987,0.0002601872,0.00003003547,0.000015634536,0.0014465186],"genre_scores_gemma":[0.9192182,0.000030388652,0.08017632,0.0002752339,0.00020345165,0.0000116749625,0.000025697216,0.000009053134,0.00004999731],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99705607,0.00014569546,0.0011911746,0.00021975485,0.0012228843,0.0001644062],"domain_scores_gemma":[0.9944595,0.00095258595,0.0013777817,0.0002663491,0.0028529998,0.00009079712],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009157154,0.0001640321,0.000304515,0.0007031457,0.00011490436,0.00008287017,0.0013961247,0.000059062862,0.000053942036],"category_scores_gemma":[0.00015696944,0.00013524314,0.00026179946,0.0011711153,0.00014366933,0.00039202516,0.00013703713,0.00021611921,0.000009054026],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045708104,0.00085522776,0.0036310218,0.00003697958,0.00053154305,0.0000059378954,0.0004547816,0.32926524,0.0016864843,0.5921723,0.0008407164,0.07047406],"study_design_scores_gemma":[0.007854016,0.00089329795,0.053965174,0.0004446194,0.00022580435,0.0031170344,0.0007865478,0.18197975,0.03682093,0.4611762,0.25147128,0.0012653548],"about_ca_topic_score_codex":0.0000039471074,"about_ca_topic_score_gemma":7.0845573e-7,"teacher_disagreement_score":0.8894933,"about_ca_system_score_codex":0.000071297785,"about_ca_system_score_gemma":0.00039151288,"threshold_uncertainty_score":0.55150557},"labels":[],"label_agreement":null},{"id":"W2144674749","doi":"10.1142/s0218195906002038","title":"BOUNDARY-OPTIMAL TRIANGULATION FLOODING","year":2006,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Triangulation; Mathematics; Boundary (topology); Combinatorics; Point set triangulation; Flooding (psychology); Pitteway triangulation; Geometry; Discrete mathematics; Delaunay triangulation; Mathematical analysis","score_opus":0.013541345117598781,"score_gpt":0.3188351588273645,"score_spread":0.3052938137097657,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144674749","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018692937,0.00043803803,0.9776131,0.0013718928,0.0003616551,0.0002458621,0.00001925351,0.000062257815,0.0011950224],"genre_scores_gemma":[0.7378695,0.000013171476,0.26064563,0.00013337235,0.0009909455,0.00004392802,0.000050348157,0.000014576284,0.0002385319],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971496,0.00008296378,0.00081507995,0.00027279806,0.001445926,0.00023366646],"domain_scores_gemma":[0.9964464,0.0005501846,0.0006227167,0.00023716813,0.002030959,0.000112601876],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007063005,0.0001578919,0.00020491256,0.00115782,0.00020557946,0.00038692367,0.0017080299,0.00006239712,0.00006235009],"category_scores_gemma":[0.00006451784,0.00016093008,0.0002087381,0.0011206532,0.00011854322,0.0011669412,0.00018942576,0.00028461163,0.000075631644],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005291956,0.00029568543,0.0008426111,0.0000065530994,0.00013192558,0.000024108042,0.000049742295,0.39369503,0.0008717626,0.5351774,0.0006931526,0.06815907],"study_design_scores_gemma":[0.0016730181,0.000111580994,0.01479092,0.000032604934,0.000018506304,0.00062293914,0.000039918996,0.04469584,0.001063252,0.8351613,0.10146665,0.00032343803],"about_ca_topic_score_codex":0.000005050526,"about_ca_topic_score_gemma":9.0058e-7,"teacher_disagreement_score":0.71917653,"about_ca_system_score_codex":0.0002123832,"about_ca_system_score_gemma":0.00027478294,"threshold_uncertainty_score":0.6562538},"labels":[],"label_agreement":null},{"id":"W2144946213","doi":"10.1142/s0218195900000310","title":"THE THREE-PHASE METHOD: A UNIFIED APPROACH TO ORTHOGONAL GRAPH DRAWING","year":2000,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Graph drawing; Graph; Computer science; Lattice graph; Theoretical computer science; Mathematics; Algorithm; Line graph; Voltage graph","score_opus":0.019812903323334543,"score_gpt":0.32708899494590643,"score_spread":0.3072760916225719,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144946213","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0047707027,0.00041226472,0.9873509,0.0037076278,0.00046593865,0.00052316516,0.00002984406,0.00006772722,0.0026718709],"genre_scores_gemma":[0.33252406,0.000069612724,0.6635395,0.0015867576,0.0014106008,0.00022567024,0.00011044029,0.000026576583,0.0005067499],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9961808,0.00015987984,0.0011205104,0.00045205376,0.0017603812,0.0003263842],"domain_scores_gemma":[0.9956762,0.0010925229,0.00050797674,0.0003801386,0.0020374635,0.00030570014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014769001,0.0002594502,0.00027928784,0.000893586,0.0005998707,0.0007135387,0.002584717,0.00008085546,0.0000795442],"category_scores_gemma":[0.000086016196,0.00021596467,0.00030883309,0.0022671695,0.00008538815,0.0007634793,0.0001814886,0.00036708702,0.00012033062],"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.00006859793,0.00035893076,0.00003275669,0.0000033906085,0.00018685553,0.0000049695773,0.00009588789,0.38057914,0.00007785786,0.16708906,0.0012050804,0.45029745],"study_design_scores_gemma":[0.0024421979,0.00029311774,0.005173785,0.000037670274,0.00006270441,0.001377903,0.000074446405,0.24620156,0.00025686555,0.34043714,0.4030574,0.0005852141],"about_ca_topic_score_codex":0.0000056996223,"about_ca_topic_score_gemma":0.0000029251944,"teacher_disagreement_score":0.44971225,"about_ca_system_score_codex":0.00014533394,"about_ca_system_score_gemma":0.0004302308,"threshold_uncertainty_score":0.88067836},"labels":[],"label_agreement":null},{"id":"W2145427355","doi":"10.1142/s0218195900000115","title":"POINT AND LINE SEGMENT RECONSTRUCTION FROM VISIBILITY INFORMATION","year":2000,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Visibility polygon; Visibility graph; Visibility; Mathematics; Graph; Set (abstract data type); Line segment; Dual graph; Line (geometry); Algorithm; Computer science; Combinatorics; Planar graph; Simple polygon; Geometry; Geography","score_opus":0.0072309491043516605,"score_gpt":0.2539805635127922,"score_spread":0.24674961440844054,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145427355","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08583861,0.0003203077,0.9100437,0.0023209546,0.00044008222,0.00027785427,0.0000650242,0.00005174163,0.00064173975],"genre_scores_gemma":[0.7522665,0.00022017857,0.24534042,0.0009699251,0.0008453799,0.000048361602,0.00021969092,0.00000827932,0.00008120246],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99759555,0.000077301884,0.0009938612,0.00026480612,0.00092043343,0.00014806107],"domain_scores_gemma":[0.99723154,0.00036786665,0.0005493668,0.00021194314,0.0014753768,0.0001639084],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005189653,0.00017569093,0.00021652391,0.0006141256,0.00015794313,0.00039061543,0.0007052787,0.00007844565,0.00033946877],"category_scores_gemma":[0.000053637803,0.00017713725,0.00012504679,0.000642627,0.00007284396,0.0025518816,0.000103729384,0.0002216369,0.00010451526],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050848932,0.00014494595,0.00037576898,0.000006170686,0.00013518236,0.0000027027338,0.000151655,0.09887744,0.00010137886,0.014468875,0.0002662802,0.8854188],"study_design_scores_gemma":[0.003399633,0.00036358426,0.04570068,0.00010843833,0.00008162775,0.001399508,0.0001507506,0.23468092,0.0014095942,0.5357033,0.17627583,0.0007261303],"about_ca_topic_score_codex":0.000017781354,"about_ca_topic_score_gemma":0.0000016866677,"teacher_disagreement_score":0.8846926,"about_ca_system_score_codex":0.00015724372,"about_ca_system_score_gemma":0.00020115853,"threshold_uncertainty_score":0.7223447},"labels":[],"label_agreement":null},{"id":"W2149041248","doi":"10.1142/s0218195909003015","title":"FLOATING-POINT ARITHMETIC FOR COMPUTATIONAL GEOMETRY PROBLEMS WITH UNCERTAIN DATA","year":2009,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Advanced Numerical Analysis Techniques","field":"Engineering","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":"Natural Sciences and Engineering Research Council of Canada; Université de Montréal","funders":"","keywords":"Computational geometry; Context (archaeology); Mathematics; Convex hull; Computation; Algorithm; Interval arithmetic; Point (geometry); Mathematical optimization; Convex geometry; Regular polygon; Simple (philosophy); Computer science; Convex analysis; Convex optimization; Geometry","score_opus":0.018759480653945084,"score_gpt":0.30742302886094525,"score_spread":0.2886635482070002,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149041248","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022294535,0.00047635206,0.99445695,0.0014275623,0.00009697613,0.00055930566,0.00026761918,0.00017359904,0.0003121904],"genre_scores_gemma":[0.5302346,0.000040983465,0.46800604,0.00034200252,0.00046151402,0.00006141141,0.0007945533,0.000032263033,0.000026651027],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99730754,0.0000267064,0.0010043287,0.00034098275,0.0010606888,0.0002597276],"domain_scores_gemma":[0.99656665,0.0006599324,0.0005081392,0.0003125353,0.0017884434,0.00016432363],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004525017,0.00027150605,0.00039308888,0.00089774246,0.00012266764,0.00014046067,0.0013109132,0.00008003002,0.000048423895],"category_scores_gemma":[0.00009446426,0.00024914663,0.00015749919,0.0010592421,0.000096334115,0.0006516808,0.0000758356,0.00032972166,0.000014202495],"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.000039086022,0.00021688399,0.00014656117,0.000025064626,0.00036564365,0.0000051620227,0.000025008047,0.93277067,0.00012983022,0.0051526055,0.0012352885,0.05988822],"study_design_scores_gemma":[0.0016434309,0.00041276068,0.0028160803,0.00014939519,0.0001860187,0.0004414678,0.00008625957,0.65111333,0.00028675803,0.28218424,0.060070876,0.0006093925],"about_ca_topic_score_codex":0.0000030540155,"about_ca_topic_score_gemma":0.0000014798097,"teacher_disagreement_score":0.5280051,"about_ca_system_score_codex":0.00024720805,"about_ca_system_score_gemma":0.00013140264,"threshold_uncertainty_score":0.99999607},"labels":[],"label_agreement":null},{"id":"W2149305893","doi":"10.1142/s0218195907002471","title":"A GENERAL APPROXIMATION ALGORITHM FOR PLANAR MAPS WITH APPLICATIONS","year":2007,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Voronoi diagram; Algorithm; Correctness; Intersection (aeronautics); Approximation algorithm; Mathematics; Triangulation; Planar; Metric (unit); Bowyer–Watson algorithm; Computer science; Delaunay triangulation","score_opus":0.011804474993635954,"score_gpt":0.28480258702338795,"score_spread":0.272998112029752,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149305893","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00059260166,0.00033450194,0.9955174,0.0011263965,0.0003773232,0.0011822139,0.00012465267,0.00009150413,0.00065340626],"genre_scores_gemma":[0.045643434,0.000026664418,0.95018613,0.00066599256,0.002145116,0.00047400853,0.0005862868,0.000029257497,0.00024309436],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99661094,0.000045416087,0.0011267437,0.00046882912,0.0014051318,0.0003429514],"domain_scores_gemma":[0.9939017,0.00080501294,0.0010225223,0.00030682824,0.00371527,0.00024862093],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012185506,0.00027778037,0.0003115042,0.0013693224,0.00030191525,0.00032195894,0.0015053065,0.00011377779,0.000015709866],"category_scores_gemma":[0.00003475175,0.00026399942,0.00022906002,0.0014820338,0.00009472628,0.00097291864,0.0000889825,0.00025604555,0.000030576866],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007905263,0.0004782248,0.00013279275,0.000021633132,0.0003319613,0.000010663864,0.000095608746,0.06158021,0.00030048614,0.28910625,0.000993004,0.6468701],"study_design_scores_gemma":[0.0042950017,0.0005947652,0.0039303983,0.00006681877,0.00012710154,0.0016219815,0.0001458932,0.15107253,0.0024788324,0.32548022,0.5092888,0.0008976307],"about_ca_topic_score_codex":0.00000379693,"about_ca_topic_score_gemma":0.0000032978987,"teacher_disagreement_score":0.6459725,"about_ca_system_score_codex":0.0002605757,"about_ca_system_score_gemma":0.00043783474,"threshold_uncertainty_score":0.9999812},"labels":[],"label_agreement":null},{"id":"W2150278829","doi":"10.1142/s0218195903001281","title":"PROPERTIES OF ARRANGEMENT GRAPHS","year":2003,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge; Carleton University","funders":"","keywords":"Combinatorics; Mathematics; General position; Hyperplane; Hamiltonian path; Line segment; Graph; Discrete mathematics; Geometry","score_opus":0.01914964241694904,"score_gpt":0.2647208432120246,"score_spread":0.24557120079507555,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2150278829","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02303578,0.0012584323,0.97285634,0.00072754896,0.0005992521,0.00027232553,0.000010714063,0.000027281134,0.0012123347],"genre_scores_gemma":[0.8688473,0.000065191736,0.13051778,0.00023789758,0.00017887849,0.00004627682,0.0000136290055,0.000009106115,0.00008391108],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997332,0.00010036621,0.0009350126,0.00023254586,0.0012428311,0.00015727304],"domain_scores_gemma":[0.995987,0.00019499299,0.00079918234,0.00021606138,0.0026887013,0.000114042836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066551287,0.00015974212,0.0002424233,0.001000078,0.0000990782,0.00011991941,0.0010970975,0.00005278214,0.00005196458],"category_scores_gemma":[0.00010290504,0.00015007833,0.00021906105,0.0010977213,0.00008291294,0.00062919664,0.00008693245,0.0001601922,0.00002389939],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003052672,0.0006321315,0.0006198494,0.00003214146,0.000383582,0.0000065685927,0.00020445134,0.16940272,0.004184246,0.772146,0.00058781926,0.051769987],"study_design_scores_gemma":[0.0032913182,0.0004223217,0.0065245386,0.00019397825,0.00010341048,0.0009748266,0.00024139707,0.01582308,0.050281096,0.6589404,0.2624107,0.0007929402],"about_ca_topic_score_codex":0.000002246996,"about_ca_topic_score_gemma":5.4971275e-7,"teacher_disagreement_score":0.84581155,"about_ca_system_score_codex":0.00008809561,"about_ca_system_score_gemma":0.00036665276,"threshold_uncertainty_score":0.61200166},"labels":[],"label_agreement":null},{"id":"W2151369108","doi":"10.1142/s0218195909003088","title":"EFFICIENT NON-INTERSECTION QUERIES ON AGGREGATED GEOMETRIC DATA","year":2009,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Intersection (aeronautics); Complement (music); Disjoint sets; Class (philosophy); Mathematics; Set (abstract data type); Object (grammar); Theoretical computer science; Computer science; Combinatorics; Artificial intelligence","score_opus":0.019258034141779803,"score_gpt":0.30260727728707343,"score_spread":0.28334924314529364,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2151369108","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018348088,0.0003733728,0.97487473,0.0037013313,0.0011446237,0.0003680901,0.000057083467,0.000087453496,0.0010452169],"genre_scores_gemma":[0.914805,0.000045260316,0.0824102,0.0012017117,0.0011282795,0.000021973528,0.0002642699,0.000013147746,0.00011014102],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962836,0.00008284034,0.0010389135,0.0005617832,0.0017667003,0.00026617112],"domain_scores_gemma":[0.9954423,0.00053619384,0.00094578584,0.0006326892,0.0022373307,0.00020573782],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00084741256,0.00027134863,0.00030990646,0.0024552518,0.00023350024,0.00041528288,0.0029796066,0.000098250835,0.000047357225],"category_scores_gemma":[0.00019457437,0.00026617077,0.00018801812,0.002740204,0.000063692925,0.0007199901,0.00027184995,0.00037039188,0.00012662078],"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.000079553014,0.00071053806,0.00005503903,0.0000055808487,0.00016439855,0.000021946387,0.00007584113,0.6709178,0.00023135,0.03627611,0.0024894553,0.28897238],"study_design_scores_gemma":[0.0031035654,0.0011865197,0.029982926,0.00017253472,0.00008778142,0.0012224881,0.000097006305,0.7811897,0.0018076451,0.07530924,0.10491905,0.0009215434],"about_ca_topic_score_codex":0.0000043731175,"about_ca_topic_score_gemma":7.979695e-7,"teacher_disagreement_score":0.8964569,"about_ca_system_score_codex":0.00027871222,"about_ca_system_score_gemma":0.00037832552,"threshold_uncertainty_score":0.9999791},"labels":[],"label_agreement":null},{"id":"W2151606606","doi":"10.1142/s0218195904001433","title":"PATHWIDTH AND LAYERED DRAWINGS OF TREES","year":2004,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":50,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Vertex (graph theory); Combinatorics; Enhanced Data Rates for GSM Evolution; Graph drawing; Mathematics; Line (geometry); Layer (electronics); Planar; Pathwidth; Geometry; Graph; Upper and lower bounds; Computer science; Line graph; Computer graphics (images); Mathematical analysis; Materials science; Artificial intelligence","score_opus":0.009141361070416429,"score_gpt":0.26573960444992983,"score_spread":0.2565982433795134,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2151606606","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06456247,0.0006119151,0.93202317,0.0019990802,0.00028258294,0.00018479385,0.000022056289,0.000027105361,0.00028683024],"genre_scores_gemma":[0.8206175,0.000064052874,0.17867748,0.0002572166,0.00030952427,0.00001889831,0.000024780167,0.0000067867036,0.000023757824],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978082,0.000038193524,0.00080499914,0.0002440058,0.0009651744,0.00013942798],"domain_scores_gemma":[0.9968818,0.0003212596,0.0007264323,0.0001669725,0.0017709163,0.00013265393],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041788068,0.00015336751,0.0002445939,0.00086987065,0.00010150569,0.00014279963,0.0009044144,0.00006120928,0.000015486265],"category_scores_gemma":[0.000070623355,0.00015225675,0.00014417816,0.0008256572,0.00009927331,0.00073933677,0.00016723908,0.00016404483,0.000010609247],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040071343,0.0004424155,0.0008597368,0.000019654753,0.0002523326,0.000014385696,0.00035007464,0.442187,0.002018773,0.41334608,0.00013851831,0.14033094],"study_design_scores_gemma":[0.0043030255,0.00044584105,0.04837407,0.0001400977,0.000059077018,0.0012315463,0.00013041122,0.014370604,0.0066000046,0.88455445,0.039268214,0.0005226486],"about_ca_topic_score_codex":0.000007745579,"about_ca_topic_score_gemma":0.0000026458204,"teacher_disagreement_score":0.75605506,"about_ca_system_score_codex":0.00009647586,"about_ca_system_score_gemma":0.0003547559,"threshold_uncertainty_score":0.620885},"labels":[],"label_agreement":null},{"id":"W2152446315","doi":"10.1142/s0218195903001153","title":"On Computing a Largest Empty Arbitrarily Oriented Rectangle","year":2003,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Rectangle; Mathematics; Combinatorics; Bounded function; Point (geometry); Set (abstract data type); Binary logarithm; Discrete mathematics; Geometry; Computer science; Mathematical analysis","score_opus":0.010404289121629183,"score_gpt":0.28026560062544614,"score_spread":0.269861311503817,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152446315","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018130181,0.000320888,0.9748742,0.0010473359,0.0012198257,0.00031799913,0.000023254686,0.000082966406,0.0039833775],"genre_scores_gemma":[0.7980837,0.000021306558,0.19982783,0.001258521,0.0005504993,0.000030101148,0.000063306245,0.000019082196,0.00014563739],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965354,0.00017797334,0.001009266,0.0004353559,0.0015544136,0.00028754794],"domain_scores_gemma":[0.99520636,0.001071942,0.0008377464,0.00030485063,0.0023537637,0.00022532359],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00091702776,0.00026076316,0.00030118463,0.0011891287,0.0002724619,0.00029631783,0.0012281784,0.00009781363,0.000092702496],"category_scores_gemma":[0.00031733265,0.00026317447,0.00026108482,0.0016725117,0.00006609881,0.0006656605,0.000112099515,0.0004158336,0.00012664121],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003683926,0.0006049967,0.00034101264,0.0000076923825,0.00020308443,0.00002565927,0.000098759025,0.2118528,0.00016568592,0.7556893,0.0014741842,0.029499969],"study_design_scores_gemma":[0.004185327,0.00066213,0.008252819,0.0001505768,0.000068039306,0.0018585771,0.00010599931,0.062589005,0.00276132,0.54947114,0.3688957,0.0009993181],"about_ca_topic_score_codex":0.0000026614723,"about_ca_topic_score_gemma":9.105567e-7,"teacher_disagreement_score":0.77995354,"about_ca_system_score_codex":0.00024273277,"about_ca_system_score_gemma":0.00049150933,"threshold_uncertainty_score":0.99998206},"labels":[],"label_agreement":null},{"id":"W2155070046","doi":"10.1142/s021819590900312x","title":"ON INTERSECTING A SET OF ISOTHETIC LINE SEGMENTS WITH A CONVEX POLYGON OF MINIMUM AREA","year":2009,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"Natural Sciences and Engineering Research Council of Canada; Universities Space Research Association","keywords":"Combinatorics; Convex polygon; Polygon (computer graphics); Mathematics; Polygon covering; Rectilinear polygon; Regular polygon; Simple polygon; Set (abstract data type); Line segment; Star-shaped polygon; Line (geometry); Convex set; Geometry; Computer science; Convex optimization","score_opus":0.015199704029000286,"score_gpt":0.28677835300601806,"score_spread":0.2715786489770178,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155070046","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15688933,0.00011369259,0.84064776,0.0014127691,0.00020861675,0.00024329871,0.000034763707,0.00001908522,0.00043067423],"genre_scores_gemma":[0.93434423,0.000012976098,0.064886115,0.00041488986,0.00022076088,0.000013682467,0.000047252553,0.000009010726,0.00005110416],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972229,0.000060108323,0.0010200064,0.00026904736,0.0012691708,0.0001587523],"domain_scores_gemma":[0.9955438,0.00055969734,0.0013400498,0.00022610556,0.0022183189,0.000112079244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043179386,0.0001936568,0.00034511826,0.0011915187,0.00006845047,0.00007016755,0.0010136064,0.000060459755,0.000036400343],"category_scores_gemma":[0.000077969176,0.00017388682,0.00017894867,0.0010982448,0.00008282971,0.00040678825,0.00007332063,0.00021236176,0.0000074527857],"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.00049302075,0.0013357878,0.00044801334,0.00004033704,0.0005672383,0.000020387128,0.0007529294,0.7482831,0.0063831033,0.11133969,0.00043228202,0.12990415],"study_design_scores_gemma":[0.011811513,0.009705707,0.022148011,0.0014470011,0.000282677,0.0022904389,0.00068774616,0.4141492,0.052022994,0.47523934,0.008692331,0.0015230551],"about_ca_topic_score_codex":0.0000026976602,"about_ca_topic_score_gemma":7.235798e-7,"teacher_disagreement_score":0.77745485,"about_ca_system_score_codex":0.0001013209,"about_ca_system_score_gemma":0.00028667971,"threshold_uncertainty_score":0.7090898},"labels":[],"label_agreement":null},{"id":"W2165542100","doi":"10.1142/s021819590900299x","title":"DETERMINING A SET OF MAXIMUM INSCRIBED RECTANGLES FOR LABEL PLACEMENT IN A REGION","year":2009,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Inscribed figure; Polygon (computer graphics); Set (abstract data type); Regular polygon; Convex polygon; Combinatorics; Orientation (vector space); Mathematics; Computer science; Algorithm; Geometry","score_opus":0.034106281611396255,"score_gpt":0.3253124541080849,"score_spread":0.2912061724966887,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2165542100","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033465408,0.00027377033,0.9629788,0.0022796402,0.00028426267,0.00046200267,0.000025142304,0.000023071934,0.00020790209],"genre_scores_gemma":[0.76650953,0.00003345022,0.23249145,0.00042002185,0.00036376156,0.00006712444,0.00006466145,0.000007648436,0.00004237993],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976288,0.00006151191,0.0010617296,0.00027445247,0.00078910205,0.00018438463],"domain_scores_gemma":[0.99659616,0.0005900978,0.0008691938,0.00017508314,0.001678278,0.00009116834],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006032851,0.0001638385,0.0002847402,0.0013352839,0.00007236239,0.000103468126,0.0009938355,0.000070439724,0.0000072964835],"category_scores_gemma":[0.00012470796,0.00017221636,0.0001554553,0.0010620849,0.000037385515,0.00059298566,0.00007467366,0.00015685581,0.000003447208],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023698343,0.00083560275,0.0007242617,0.00003505466,0.00017630955,0.000023612032,0.0006479873,0.333614,0.0017805793,0.10808037,0.0010262497,0.552819],"study_design_scores_gemma":[0.007232293,0.0014152142,0.017634787,0.00030564674,0.0000582071,0.00079028035,0.00021906072,0.2363884,0.0033883215,0.6953465,0.036561407,0.00065992924],"about_ca_topic_score_codex":0.0000021459578,"about_ca_topic_score_gemma":0.0000019687013,"teacher_disagreement_score":0.7330441,"about_ca_system_score_codex":0.00017539384,"about_ca_system_score_gemma":0.00031413767,"threshold_uncertainty_score":0.7022779},"labels":[],"label_agreement":null},{"id":"W2168192372","doi":"10.1142/s0218195907002264","title":"POLYGON DECOMPOSITION AND THE ORTHOGONAL ART GALLERY PROBLEM","year":2007,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":57,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan; University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Polygon (computer graphics); Polygon covering; Visibility polygon; Simple polygon; Rectilinear polygon; Cardinality (data modeling); Decomposition; Cover (algebra); Star-shaped polygon; Rectangle; Point (geometry); Discrete mathematics; Geometry; Regular polygon; Computer science; Convex set","score_opus":0.007288858907567653,"score_gpt":0.28497267076778005,"score_spread":0.2776838118602124,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168192372","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00975762,0.00056581636,0.98090625,0.0056529865,0.0004566802,0.0004038014,0.000010073972,0.000043979086,0.0022027707],"genre_scores_gemma":[0.8062577,0.00010237933,0.19087015,0.0013544684,0.0010772718,0.000047967424,0.00007253219,0.000013306373,0.000204223],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971394,0.00010096808,0.0009887631,0.00029307458,0.0012542903,0.00022349994],"domain_scores_gemma":[0.99582523,0.0013027005,0.0007459812,0.00019298126,0.0017662741,0.0001668573],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002054898,0.00019136567,0.0002412796,0.00082207803,0.00027213962,0.0003506741,0.001071315,0.000074198135,0.000032642485],"category_scores_gemma":[0.00006211674,0.00015350459,0.00019186914,0.00090984785,0.0001920073,0.0007852293,0.0002145228,0.00030674651,0.00004786806],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034394974,0.00037516592,0.00057961146,0.000017147153,0.0004238049,0.000027320651,0.00032670473,0.071987525,0.00040534616,0.70081514,0.0022706506,0.22242765],"study_design_scores_gemma":[0.0073431274,0.00026763527,0.03926462,0.00010015328,0.00011284457,0.0043934155,0.00016179224,0.05436902,0.00094057265,0.64467937,0.24764755,0.00071987504],"about_ca_topic_score_codex":0.0000023890736,"about_ca_topic_score_gemma":0.0000036227032,"teacher_disagreement_score":0.7965001,"about_ca_system_score_codex":0.00011321278,"about_ca_system_score_gemma":0.00021597782,"threshold_uncertainty_score":0.6259736},"labels":[],"label_agreement":null},{"id":"W2171151410","doi":"10.1142/s021819590200089x","title":"ONLINE ROUTING IN CONVEX SUBDIVISIONS","year":2002,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":47,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Carleton University","funders":"","keywords":"Delaunay triangulation; Mathematics; Combinatorics; Destination-Sequenced Distance Vector routing; Discrete mathematics; Computer science; Mathematical optimization; Link-state routing protocol; Routing (electronic design automation); Computer network","score_opus":0.030471045598837843,"score_gpt":0.3160281218117496,"score_spread":0.28555707621291176,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2171151410","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003782296,0.00022415609,0.98823506,0.0058118496,0.00025298397,0.00021719304,0.000022363032,0.000040522133,0.0014135871],"genre_scores_gemma":[0.84572583,0.00012971053,0.15281211,0.0007877955,0.0002800515,0.000025144918,0.000032513504,0.0000104566325,0.00019640097],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99768585,0.00007319826,0.00083533756,0.00022539686,0.0009810976,0.0001991445],"domain_scores_gemma":[0.99744105,0.0004537349,0.00044676237,0.00018464094,0.0013280639,0.0001457565],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044314674,0.0001268354,0.00019831184,0.0010294203,0.00009129278,0.00021243819,0.0014896414,0.000055993278,0.00025259008],"category_scores_gemma":[0.00010948189,0.00012702824,0.000120813536,0.0011728911,0.00005799036,0.00072908186,0.00018753797,0.00033017105,0.00009612517],"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.000011504025,0.002134141,0.0064289793,0.000011527477,0.00016842573,0.000058075348,0.00060778705,0.46453473,0.00009693671,0.3252828,0.0019743135,0.19869079],"study_design_scores_gemma":[0.0016555529,0.00009212703,0.0135160955,0.000071865165,0.000008590011,0.0003280585,0.000096792886,0.88636637,0.000042778927,0.04899436,0.048540596,0.00028680483],"about_ca_topic_score_codex":0.000005274352,"about_ca_topic_score_gemma":0.0000029169494,"teacher_disagreement_score":0.8419435,"about_ca_system_score_codex":0.00014073045,"about_ca_system_score_gemma":0.00010097241,"threshold_uncertainty_score":0.51800615},"labels":[],"label_agreement":null},{"id":"W2261377644","doi":"10.1142/s0218195910003396","title":"VORONOI DIAGRAM OF POLYGONAL CHAINS UNDER THE DISCRETE FRÉCHET DISTANCE","year":2010,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Voronoi diagram; Mathematics; Dimension (graph theory); Combinatorics; Measure (data warehouse); Diagram; Discrete geometry; Similarity (geometry); Computational geometry; Discrete mathematics; Geometry; Image (mathematics); Computer science; Data mining; Artificial intelligence","score_opus":0.008520262516378265,"score_gpt":0.2823124643501812,"score_spread":0.27379220183380293,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2261377644","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028475339,0.00029607237,0.96349823,0.005721961,0.001133019,0.00028327262,0.00006692483,0.000031877345,0.000493307],"genre_scores_gemma":[0.9292862,0.000030854757,0.06871332,0.0005699279,0.0010883107,0.00005710663,0.0000710721,0.000013858334,0.00016935669],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969286,0.000082193634,0.0009949659,0.0003031173,0.0014744904,0.00021663442],"domain_scores_gemma":[0.995441,0.00087720086,0.001019035,0.00037984666,0.0021292,0.00015371232],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007891085,0.00021040115,0.0002612505,0.00057290785,0.00021695916,0.00022322657,0.0022483235,0.00008893293,0.00008373379],"category_scores_gemma":[0.00009291863,0.00016813302,0.000284494,0.0010870901,0.00023164155,0.000687529,0.00023922077,0.00050970487,0.000026085729],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031372452,0.0003158101,0.00062788377,0.000009127571,0.00023800824,0.000003917728,0.00014263949,0.15144153,0.0015324514,0.78024465,0.0004995693,0.06491303],"study_design_scores_gemma":[0.002583799,0.00031455175,0.09754945,0.00007844949,0.00012143461,0.0010843027,0.00027514962,0.22120292,0.0044404715,0.5081412,0.16330454,0.00090372155],"about_ca_topic_score_codex":0.000007677702,"about_ca_topic_score_gemma":0.000011666361,"teacher_disagreement_score":0.90081084,"about_ca_system_score_codex":0.000074140495,"about_ca_system_score_gemma":0.0004377341,"threshold_uncertainty_score":0.68562657},"labels":[],"label_agreement":null},{"id":"W2291025091","doi":"10.1142/s0218195915500156","title":"Placing Two Axis-Parallel Squares to Maximize the Number of Enclosed Points","year":2015,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Simon Fraser University","keywords":"Intersection (aeronautics); Disjoint sets; Mathematics; Combinatorics; Unit (ring theory); Plane (geometry); Least-squares function approximation; Set (abstract data type); Space (punctuation); Geometry; Computer science; Statistics","score_opus":0.025765005357318727,"score_gpt":0.3270088259625079,"score_spread":0.30124382060518917,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2291025091","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021234093,0.0001793345,0.9709634,0.005402134,0.00069009414,0.00037375806,0.00002761079,0.000033925255,0.0010956173],"genre_scores_gemma":[0.68530065,0.000008463045,0.31295994,0.00092765177,0.0005733308,0.000057550205,0.000028261826,0.000011920735,0.00013224134],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99645656,0.00013913008,0.0010566416,0.00029823292,0.0018374559,0.00021195743],"domain_scores_gemma":[0.9939507,0.00081483356,0.00082010403,0.00031721953,0.0038290683,0.0002680453],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011825943,0.00020184931,0.0002883793,0.0006753902,0.00013666309,0.00022536566,0.002059699,0.000054042135,0.00006836662],"category_scores_gemma":[0.00021600252,0.00016933847,0.00020882688,0.0014270693,0.00008220428,0.0006615485,0.0002579404,0.00024332227,0.00014593409],"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.00010345148,0.0003062821,0.0008689303,0.000008039778,0.00022787853,0.000009564283,0.00055798946,0.8028846,0.0001447982,0.1378362,0.0018951937,0.055157084],"study_design_scores_gemma":[0.006257109,0.000395621,0.015277389,0.00015659683,0.00010949167,0.0021100477,0.00057027495,0.15167746,0.0023048175,0.6921591,0.12807107,0.00091101194],"about_ca_topic_score_codex":0.000016849985,"about_ca_topic_score_gemma":0.0000024599135,"teacher_disagreement_score":0.66406655,"about_ca_system_score_codex":0.00018025927,"about_ca_system_score_gemma":0.000570517,"threshold_uncertainty_score":0.6905422},"labels":[],"label_agreement":null},{"id":"W2397546986","doi":"10.1142/s0218195918500127","title":"On Combinatorial Depth Measures","year":2018,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Advanced Statistical Methods and Models","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Mathematics; Combinatorics; Multiset; Point (geometry); Geometry","score_opus":0.07954057890063079,"score_gpt":0.4419219396705607,"score_spread":0.3623813607699299,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397546986","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0039749015,0.0000406889,0.98934066,0.00049538974,0.00087332336,0.00021495676,0.000052257776,0.000028694958,0.0049791355],"genre_scores_gemma":[0.61295015,0.000007945672,0.38494638,0.00030647113,0.0016528271,0.00003120695,0.000011075255,0.000019125917,0.000074819596],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977448,0.00008262698,0.00068320864,0.00018872213,0.0011441613,0.00015650017],"domain_scores_gemma":[0.99426806,0.0022738264,0.0005330838,0.00014634579,0.0026376978,0.00014097901],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058119197,0.00014883943,0.0002439405,0.00038657087,0.0001269405,0.0000636395,0.00054481905,0.000064429434,0.0001511128],"category_scores_gemma":[0.0008352024,0.00013255623,0.00014151895,0.00029606654,0.00016538247,0.00015635586,0.000054578977,0.00024166264,0.000063237836],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014179919,0.00034698806,0.00003940634,0.0000055511146,0.00016228908,0.0000059803256,0.000043172662,0.0017649148,0.0000623386,0.9227416,0.0016952865,0.07299071],"study_design_scores_gemma":[0.0008167025,0.0002158808,0.00032919663,0.00003143843,0.000031657448,0.000073416864,0.000021186672,0.00081241515,0.00028452004,0.96559036,0.031669922,0.00012330203],"about_ca_topic_score_codex":0.000001250523,"about_ca_topic_score_gemma":0.0000010615548,"teacher_disagreement_score":0.60897523,"about_ca_system_score_codex":0.00012570966,"about_ca_system_score_gemma":0.00013317444,"threshold_uncertainty_score":0.5405486},"labels":[],"label_agreement":null},{"id":"W2606103541","doi":"10.1142/s0218195916600013","title":"The Price of Order","year":2016,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Disjoint sets; Order (exchange); Discrete mathematics; Graph","score_opus":0.013356323884241277,"score_gpt":0.32675577623270985,"score_spread":0.31339945234846855,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2606103541","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002076593,0.00035871356,0.990237,0.0060599255,0.00022927948,0.00016335843,0.000014419274,0.000016634533,0.00084410596],"genre_scores_gemma":[0.8621415,0.00019895974,0.13666171,0.00016959256,0.00033464545,0.00005336941,0.0000026494276,0.0000117478085,0.00042581698],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977774,0.000075890115,0.000623909,0.00015887509,0.0011988883,0.0001650394],"domain_scores_gemma":[0.9929971,0.002239508,0.0006362026,0.00027607282,0.0037586365,0.000092485534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007925898,0.0000940136,0.00013259807,0.00043148614,0.00013155946,0.0000846226,0.002510343,0.000031962845,0.000033379583],"category_scores_gemma":[0.000260429,0.000055811684,0.0001225346,0.0009440262,0.00021880986,0.0005303297,0.00024302404,0.00013491478,0.000041221032],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000363327,0.00011651275,0.0004909161,0.0000031018785,0.00015949616,0.000003324691,0.000033256518,0.004597233,0.0009552058,0.74441266,0.00035712484,0.24883485],"study_design_scores_gemma":[0.00076880795,0.00008980603,0.005268516,0.000038667713,0.0000070780047,0.0001986484,0.000028661603,0.0013212813,0.001541392,0.832884,0.15772809,0.0001250262],"about_ca_topic_score_codex":7.864087e-7,"about_ca_topic_score_gemma":4.234628e-7,"teacher_disagreement_score":0.8600649,"about_ca_system_score_codex":0.00008931538,"about_ca_system_score_gemma":0.00028037056,"threshold_uncertainty_score":0.46648833},"labels":[],"label_agreement":null},{"id":"W2762112321","doi":"10.1142/s0218195912600047","title":"π/2-ANGLE YAO GRAPHS ARE SPANNERS","year":2012,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Fixed Point Theorems Analysis","field":"Mathematics","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Spanner; Graph; Metric (unit); Plane (geometry); Metric space","score_opus":0.025349291335207764,"score_gpt":0.329245877191997,"score_spread":0.30389658585678925,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2762112321","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14582036,0.0009975977,0.84463567,0.0026477922,0.000888189,0.00040537125,0.00012620621,0.000087012704,0.004391824],"genre_scores_gemma":[0.9250529,0.000030151848,0.07290749,0.0003305704,0.0012625715,0.00005036725,0.00004692722,0.000034992365,0.0002840524],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99730366,0.00007775929,0.0009267276,0.00016676851,0.0012497365,0.00027534526],"domain_scores_gemma":[0.9955786,0.00097415556,0.001233412,0.00021996768,0.001756655,0.0002372354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008780175,0.00020110693,0.00034355512,0.0010596537,0.00011866666,0.00008822424,0.0007749969,0.00008763868,0.0004959398],"category_scores_gemma":[0.00027963266,0.00018923622,0.00041275364,0.00082729204,0.00011578842,0.000526015,0.000098420045,0.00030018695,0.00016036266],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006414256,0.0012337724,0.016101515,0.00003280161,0.001595903,0.000011497035,0.0003027024,0.008703598,0.00017315194,0.94696236,0.012651289,0.012167249],"study_design_scores_gemma":[0.00077036605,0.000038443475,0.012211021,0.00005948831,0.00023961383,0.00042133697,0.00045530478,0.00045850506,0.00028161024,0.90942687,0.07532406,0.00031340594],"about_ca_topic_score_codex":0.000004976745,"about_ca_topic_score_gemma":0.0000019605386,"teacher_disagreement_score":0.7792325,"about_ca_system_score_codex":0.00019448725,"about_ca_system_score_gemma":0.00009159369,"threshold_uncertainty_score":0.7716829},"labels":[],"label_agreement":null},{"id":"W2793208001","doi":"10.1142/s0218195917500066","title":"Competitive Online Routing on Delaunay Triangulations","year":2017,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba; Carleton University","funders":"","keywords":"Delaunay triangulation; Constrained Delaunay triangulation; Combinatorics; Bowyer–Watson algorithm; Mathematics; Pitteway triangulation; Competitive analysis; Chew's second algorithm; Discrete mathematics; Upper and lower bounds","score_opus":0.03124044391697462,"score_gpt":0.35422964422401154,"score_spread":0.3229892003070369,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2793208001","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001631671,0.00004875087,0.9815444,0.008712639,0.0004973702,0.0002935531,0.000069379195,0.00004747515,0.007154763],"genre_scores_gemma":[0.82403505,0.000034806268,0.17409934,0.0007479001,0.00069270306,0.000030288493,0.000075305084,0.0000133912445,0.00027123545],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976144,0.000071336,0.0007215049,0.0002661245,0.0011365322,0.00019009189],"domain_scores_gemma":[0.99532837,0.00053550093,0.0011311718,0.00043519327,0.002396132,0.00017366203],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005276132,0.00015741665,0.00021771593,0.0006453332,0.00057177304,0.0007550316,0.0026475212,0.00006219934,0.00008174068],"category_scores_gemma":[0.0002804389,0.00015206619,0.00019030877,0.0002955497,0.00012135632,0.00097292446,0.0002771899,0.00032566697,0.00008522485],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023176462,0.00044133718,0.0006838086,0.0000031666816,0.00016335411,0.000014029607,0.00010175762,0.15573087,0.000041124043,0.7754971,0.00034172783,0.06695858],"study_design_scores_gemma":[0.0060748225,0.00051057385,0.09716597,0.00028769698,0.00006295003,0.0005350193,0.00026138773,0.35446075,0.00041173433,0.26873997,0.27058616,0.0009029658],"about_ca_topic_score_codex":0.000006664074,"about_ca_topic_score_gemma":0.000004107999,"teacher_disagreement_score":0.8224034,"about_ca_system_score_codex":0.00014934751,"about_ca_system_score_gemma":0.00028250704,"threshold_uncertainty_score":0.72807866},"labels":[],"label_agreement":null},{"id":"W2919291874","doi":"10.1142/s0218195919500018","title":"Partial Enclosure Range Searching","year":2019,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Rectangle; Polygon (computer graphics); Mathematics; Parallelogram; Intersection (aeronautics); Combinatorics; Range (aeronautics); Set (abstract data type); Discrete mathematics; Geometry; Computer science; Artificial intelligence","score_opus":0.011409741148092003,"score_gpt":0.2891017941395135,"score_spread":0.27769205299142147,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2919291874","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036951885,0.0004154674,0.9571869,0.002207678,0.0011314659,0.0003894588,0.00002014431,0.000060361195,0.0016366397],"genre_scores_gemma":[0.8872913,0.000037555204,0.11034869,0.0006766458,0.0011995522,0.000043839027,0.000059499285,0.000015415162,0.0003275146],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9968106,0.00010838332,0.00083457044,0.00035009708,0.0016569763,0.0002393369],"domain_scores_gemma":[0.9963299,0.00059293443,0.00062747236,0.00028151952,0.0019866796,0.0001814934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081394723,0.00019284358,0.0002636544,0.0009815131,0.00013269045,0.00035169447,0.0017369393,0.00007872761,0.0002030108],"category_scores_gemma":[0.00006379127,0.00019245855,0.00025273938,0.0010641778,0.00004779246,0.0011531754,0.00024320377,0.0003422991,0.00037224474],"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.000074555945,0.0004890912,0.005637873,0.000029083076,0.0004068453,0.000029281871,0.00028267896,0.5032544,0.000948755,0.30944732,0.0013869469,0.17801316],"study_design_scores_gemma":[0.004329263,0.00048778232,0.032553308,0.0001267928,0.000066433866,0.0015121539,0.00013179223,0.1876976,0.0019054116,0.23150007,0.5387188,0.0009705544],"about_ca_topic_score_codex":0.0000035403975,"about_ca_topic_score_gemma":5.212029e-7,"teacher_disagreement_score":0.8503394,"about_ca_system_score_codex":0.00015237869,"about_ca_system_score_gemma":0.0004175485,"threshold_uncertainty_score":0.7848232},"labels":[],"label_agreement":null},{"id":"W2973401770","doi":"10.1142/s021819591950002x","title":"Spanning Properties of Yao and 𝜃-Graphs in the Presence of Constraints","year":2019,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Disjoint sets; Upper and lower bounds; Discrete mathematics; Graph","score_opus":0.015887978363585277,"score_gpt":0.2665921095269326,"score_spread":0.2507041311633473,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2973401770","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4646575,0.00093246263,0.5324724,0.000940255,0.00020256416,0.00035862645,0.000011494109,0.0000067919523,0.00041797047],"genre_scores_gemma":[0.9721727,0.000051307987,0.02751811,0.00013738051,0.000070986,0.00001953685,0.00000739021,0.000004168102,0.000018448256],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99796796,0.00009168549,0.00075266033,0.00017434385,0.0009088488,0.000104506595],"domain_scores_gemma":[0.9973347,0.00058394525,0.0006696178,0.00016226222,0.0012090615,0.000040413805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079694006,0.0001047398,0.00021040045,0.00074301806,0.000038645616,0.0000700178,0.0010129589,0.000040129587,0.000016794249],"category_scores_gemma":[0.00008200781,0.00008328645,0.000092167225,0.0008820293,0.00016427018,0.0004918272,0.00011757468,0.0001647352,0.0000041946514],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000079751815,0.00061075157,0.016470691,0.00012086344,0.0002454332,0.0000071652294,0.0019321749,0.32316786,0.009401512,0.5369038,0.00012564499,0.110934354],"study_design_scores_gemma":[0.0062542967,0.00096697046,0.30764565,0.0013165897,0.00010452135,0.0019317808,0.0026006585,0.201872,0.01938675,0.44356826,0.013351771,0.0010007451],"about_ca_topic_score_codex":0.000007037305,"about_ca_topic_score_gemma":9.76101e-7,"teacher_disagreement_score":0.5075152,"about_ca_system_score_codex":0.000026024127,"about_ca_system_score_gemma":0.00020870096,"threshold_uncertainty_score":0.33963227},"labels":[],"label_agreement":null},{"id":"W3022247802","doi":"10.1142/s0218195919500092","title":"The Most Likely Object to be Seen Through a Window","year":2019,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Mathematics; Combinatorics; Interval (graph theory)","score_opus":0.01278905434978944,"score_gpt":0.2947066355962634,"score_spread":0.281917581246474,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3022247802","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0062676785,0.00030565602,0.9795555,0.011086906,0.00083141983,0.00041779646,0.000053635187,0.000038742255,0.0014426748],"genre_scores_gemma":[0.6315614,0.00012370612,0.3593069,0.006469647,0.0014118297,0.00013147485,0.00009109691,0.00003111549,0.0008728347],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99741554,0.00005641733,0.0006468256,0.00028918253,0.0013764462,0.00021557945],"domain_scores_gemma":[0.9965758,0.0008130662,0.0004888673,0.0004063417,0.0015762709,0.00013965662],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004776811,0.00015967597,0.0001890355,0.00029429843,0.0002447211,0.00050863257,0.002828255,0.000051044408,0.000048894508],"category_scores_gemma":[0.000059972004,0.00011980411,0.00014224257,0.0009002766,0.000048609858,0.000909143,0.00051184656,0.00026603238,0.00025169612],"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.00013565646,0.00054641993,0.0021902123,0.000015050275,0.0006233688,0.00002721363,0.0008065109,0.17552646,0.000851276,0.46788752,0.022803959,0.32858637],"study_design_scores_gemma":[0.00078707404,0.00016047603,0.010954636,0.00004432295,0.00001345891,0.00030976676,0.00009249456,0.016779495,0.0002703406,0.0691415,0.9011942,0.0002522336],"about_ca_topic_score_codex":0.000014750831,"about_ca_topic_score_gemma":0.0000020892019,"teacher_disagreement_score":0.87839025,"about_ca_system_score_codex":0.00012802877,"about_ca_system_score_gemma":0.00031350114,"threshold_uncertainty_score":0.5255649},"labels":[],"label_agreement":null},{"id":"W3022463586","doi":"10.1142/s0218195916600050","title":"Planar Matchings for Weighted Straight Skeletons","year":2016,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Austrian Science Fund","keywords":"Planarity testing; Planar; Mathematics; Matching (statistics); Combinatorics; Set (abstract data type); Line (geometry); Line segment; Wavefront; Algorithm; Computer science; Geometry; Optics","score_opus":0.010909268826992155,"score_gpt":0.28020013969562296,"score_spread":0.2692908708686308,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3022463586","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026118867,0.0002278714,0.9844657,0.010728186,0.0007736365,0.00043805264,0.00014226351,0.00007238484,0.0005399742],"genre_scores_gemma":[0.48510727,0.00006132494,0.51093864,0.0011041724,0.0017522604,0.00019580574,0.000105801766,0.000025742036,0.0007090004],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99731,0.000056286266,0.000935308,0.0003647911,0.0010788675,0.00025477028],"domain_scores_gemma":[0.99489117,0.0013003527,0.00076372974,0.00024189116,0.0026039958,0.00019884584],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005789402,0.00021545209,0.00026387576,0.0010048097,0.00019747362,0.00022225014,0.0016682625,0.00008790503,0.00009364249],"category_scores_gemma":[0.00009403481,0.00016952674,0.00029102445,0.0007330549,0.000074412994,0.0010544619,0.000101520964,0.00013884046,0.000069875576],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006250613,0.0003241464,0.00017743364,0.00001369405,0.0003411902,0.000009027321,0.00007315171,0.007148367,0.0024538091,0.6529191,0.0066968943,0.32978067],"study_design_scores_gemma":[0.001981533,0.00018140113,0.0026214772,0.00006300758,0.000034795237,0.0002929417,0.000015473835,0.00630723,0.0014442576,0.68271065,0.30400744,0.00033979403],"about_ca_topic_score_codex":0.0000015205923,"about_ca_topic_score_gemma":0.0000011248985,"teacher_disagreement_score":0.48249537,"about_ca_system_score_codex":0.00019506065,"about_ca_system_score_gemma":0.00040846024,"threshold_uncertainty_score":0.69131},"labels":[],"label_agreement":null},{"id":"W3023015788","doi":"10.1142/s0218195919500122","title":"Line-of-Sight Pursuit in Monotone and Scallop Polygons","year":2019,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Guidance and Control Systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"National Science Foundation","keywords":"Polygon (computer graphics); Monotone polygon; Combinatorics; Mathematics; Point (geometry); Line (geometry); Pursuit-evasion; Regular polygon; Position (finance); Line segment; Boundary (topology); Computer science; Geometry; Artificial intelligence; Mathematical analysis; Frame (networking)","score_opus":0.00449537150908884,"score_gpt":0.2338924095762113,"score_spread":0.22939703806712244,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3023015788","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.74747527,0.0026004135,0.2458221,0.00061002583,0.00048820704,0.00043134444,0.00004708313,0.00002934967,0.0024962092],"genre_scores_gemma":[0.9970144,0.0000884503,0.002462145,0.00005247855,0.00024486418,0.000033709806,0.000014866661,0.000013418521,0.00007567479],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.99869096,0.0000150800515,0.00062742544,0.00009939669,0.00046299098,0.00010414509],"domain_scores_gemma":[0.9990368,0.00019587099,0.00020208192,0.00008475846,0.00041986353,0.000060610753],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021512735,0.00010069177,0.00022255501,0.00055220583,0.0000142957115,0.000038807484,0.00033853363,0.00005202428,0.00005145955],"category_scores_gemma":[0.000013027771,0.0001016293,0.00007595713,0.0003238884,0.00003018974,0.00019481848,0.00003071318,0.00015790678,0.00003154952],"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.00006234687,0.00020687724,0.037540838,0.00007918313,0.00041410394,0.000008838501,0.00018399514,0.88520664,0.009906605,0.020867696,0.00021563328,0.045307215],"study_design_scores_gemma":[0.009379014,0.00040634244,0.47213778,0.0007264232,0.00012974699,0.000894375,0.00063229597,0.2922889,0.004248637,0.083697975,0.13432035,0.0011381753],"about_ca_topic_score_codex":0.000008259623,"about_ca_topic_score_gemma":0.0000033665958,"teacher_disagreement_score":0.59291774,"about_ca_system_score_codex":0.000068988214,"about_ca_system_score_gemma":0.000052877014,"threshold_uncertainty_score":0.41443226},"labels":[],"label_agreement":null},{"id":"W3082387259","doi":"10.1142/s0218195920500016","title":"Local Routing in Convex Subdivisions","year":2020,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan; University of Manitoba; Carleton University","funders":"","keywords":"Subdivision; Monotone polygon; Mathematics; Computer science; Topology (electrical circuits); Combinatorics; Geometry; Geography","score_opus":0.015343762615412522,"score_gpt":0.28210660449716746,"score_spread":0.2667628418817549,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3082387259","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030482567,0.00019626574,0.9879013,0.007638131,0.00025218955,0.00023202236,0.000010768008,0.00004583489,0.0006752418],"genre_scores_gemma":[0.9331058,0.000024026096,0.06425724,0.0020030455,0.0005299662,0.000037407808,0.000018230734,0.000012081224,0.000012160238],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99747723,0.00007188551,0.00092309405,0.0002972432,0.0010194993,0.0002110682],"domain_scores_gemma":[0.99745494,0.0006016161,0.0005506903,0.00017183364,0.0009891969,0.0002317165],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004179098,0.00015262538,0.0002571011,0.00041829364,0.00007249403,0.00018451142,0.0019873152,0.00006860794,0.00007212699],"category_scores_gemma":[0.000085264044,0.00015837929,0.00015252494,0.0012420268,0.00008068502,0.0006423415,0.00031268294,0.00043245428,0.00010278618],"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.000028708137,0.0002495845,0.0033581154,0.000008170405,0.00012371312,0.000071682225,0.00033815863,0.5313986,0.00007051356,0.30783704,0.0011440956,0.15537159],"study_design_scores_gemma":[0.0016989802,0.00014992095,0.016792152,0.00007250684,0.000016988171,0.00032780357,0.00017312683,0.8627636,0.00017175204,0.06325974,0.054203223,0.00037021685],"about_ca_topic_score_codex":0.00000556034,"about_ca_topic_score_gemma":0.0000017312412,"teacher_disagreement_score":0.9300576,"about_ca_system_score_codex":0.00015557616,"about_ca_system_score_gemma":0.00027992853,"threshold_uncertainty_score":0.64585197},"labels":[],"label_agreement":null},{"id":"W3197202594","doi":"10.1142/s0218195922410035","title":"Bottleneck Convex Subsets: Finding k Large Convex Sets in a Point Set","year":2023,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Saskatchewan; University of Manitoba","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Disjoint sets; Convex hull; Cardinality (data modeling); Parameterized complexity; Convex set; Generalization; Time complexity; Discrete mathematics; Regular polygon; Convex analysis; Convex optimization; Computer science","score_opus":0.024667587464482957,"score_gpt":0.3269574322328215,"score_spread":0.30228984476833853,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3197202594","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06256045,0.0003267512,0.9300673,0.004848943,0.0010010483,0.00043816085,0.00012379489,0.0001342439,0.0004993215],"genre_scores_gemma":[0.9639553,0.000110703746,0.03362601,0.0010062659,0.00056896865,0.00011846632,0.0004091226,0.000023935412,0.00018124195],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99624765,0.00013527315,0.0012350767,0.00044943232,0.0015271094,0.00040545562],"domain_scores_gemma":[0.9963073,0.00095523533,0.00073730433,0.00027900288,0.0015163164,0.00020482087],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015161308,0.00025543425,0.00037991663,0.0026083388,0.00018310657,0.00032285336,0.0016379859,0.00011776428,0.000121436395],"category_scores_gemma":[0.00017356363,0.00027370153,0.00023258287,0.0033072785,0.000062527964,0.0011247264,0.000345953,0.000401066,0.00040375258],"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.00010500335,0.0008820187,0.0097372355,0.00006493258,0.0005122269,0.00028819454,0.0013991562,0.5952825,0.00063397066,0.2994229,0.014539006,0.07713286],"study_design_scores_gemma":[0.005080267,0.00021788607,0.09034308,0.00019438953,0.000043218864,0.0010387677,0.00050538173,0.43029612,0.00075224234,0.31049985,0.16007444,0.0009543614],"about_ca_topic_score_codex":0.0000061824285,"about_ca_topic_score_gemma":0.0000061306764,"teacher_disagreement_score":0.90139484,"about_ca_system_score_codex":0.0002807837,"about_ca_system_score_gemma":0.0004734841,"threshold_uncertainty_score":0.9999715},"labels":[],"label_agreement":null},{"id":"W4231917931","doi":"10.1142/s021819590500183x","title":"GUEST EDITORS' FOREWORD","year":2005,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Queen's University","funders":"","keywords":"Mathematics; Library science; Computer science","score_opus":0.00928222932080469,"score_gpt":0.2835271118827819,"score_spread":0.2742448825619772,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4231917931","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017478258,0.00049918215,0.9848698,0.007151857,0.0038822733,0.00025193556,0.000021512034,0.00007993704,0.0014957004],"genre_scores_gemma":[0.5799876,0.00006401948,0.38524708,0.0013642252,0.032815468,0.000078303616,0.00010044808,0.000020764197,0.0003221067],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9968523,0.00006374121,0.0009947263,0.00032656448,0.0015274507,0.00023525722],"domain_scores_gemma":[0.9955614,0.0004937604,0.00074340956,0.0002694179,0.0027172007,0.00021477282],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060962164,0.00021196529,0.00024598197,0.0010893024,0.00017697593,0.00034280258,0.0019110794,0.0000919198,0.000092812465],"category_scores_gemma":[0.000087355176,0.00021372792,0.00024766548,0.0010905054,0.00006895899,0.0015140423,0.00022019072,0.00029724705,0.00023732505],"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.000041937164,0.000730401,0.00041734672,0.000012026177,0.0003472271,0.00001771875,0.00016976448,0.38078824,0.00029172545,0.19331385,0.035687022,0.38818276],"study_design_scores_gemma":[0.00081448315,0.00008903375,0.0018113483,0.000022002452,0.000020765792,0.00045986424,0.000017470033,0.028374197,0.0007497765,0.045130495,0.9222521,0.00025844306],"about_ca_topic_score_codex":0.0000021002174,"about_ca_topic_score_gemma":0.0000015484716,"teacher_disagreement_score":0.8865651,"about_ca_system_score_codex":0.00022909463,"about_ca_system_score_gemma":0.00037443382,"threshold_uncertainty_score":0.8715572},"labels":[],"label_agreement":null},{"id":"W4254025326","doi":"10.1142/s0218195916020015","title":"Guest Editors’ Foreword","year":2016,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Contemporary Sociological Theory and Practice","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":"Carleton University","funders":"","keywords":"Mathematics; Computer science","score_opus":0.03265187974506776,"score_gpt":0.3705544209717984,"score_spread":0.33790254122673063,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4254025326","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013290564,0.00063147687,0.85843307,0.062335238,0.009604689,0.0005544254,0.000116334566,0.00009979067,0.054934442],"genre_scores_gemma":[0.96974397,0.00018160557,0.0045472286,0.00059052603,0.023734193,0.00003436704,0.00001214579,0.00000847228,0.0011474745],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9980905,0.00023072281,0.0004991013,0.00013959559,0.00088876905,0.00015130268],"domain_scores_gemma":[0.9946788,0.002965425,0.00057024887,0.00008708116,0.0015392627,0.0001592044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014210737,0.00009151392,0.0001468669,0.000243079,0.0002619394,0.00008691811,0.0007455304,0.000092164075,0.0007749298],"category_scores_gemma":[0.00069935684,0.00006736753,0.00016619808,0.00031812268,0.00031151852,0.0007246394,0.000053447893,0.00017056757,0.00018281746],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020427348,0.00040869872,0.0056017,0.000004016148,0.00036845967,0.000023298675,0.0007222845,0.00036912804,0.00015990384,0.777646,0.024359178,0.19013304],"study_design_scores_gemma":[0.0002884539,0.000032686457,0.0013216829,0.000016582804,0.0000108841605,0.000017639239,0.00021313164,0.0000027130156,0.00002021391,0.22049877,0.7775021,0.00007510406],"about_ca_topic_score_codex":0.00001253513,"about_ca_topic_score_gemma":0.0000034862417,"teacher_disagreement_score":0.95645344,"about_ca_system_score_codex":0.00015798412,"about_ca_system_score_gemma":0.0003121637,"threshold_uncertainty_score":0.8484938},"labels":[],"label_agreement":null},{"id":"W4255103485","doi":"10.1142/s0218195912500057","title":"GHOST CHIMNEYS","year":2012,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Mathematics; Combinatorics; Set (abstract data type); Point (geometry); Planar; Value (mathematics); Projection (relational algebra); Geometry; Algorithm; Computer science; Statistics; Computer graphics (images)","score_opus":0.013166922812998352,"score_gpt":0.2918596728452709,"score_spread":0.27869275003227256,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4255103485","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004148177,0.0012003684,0.9889257,0.0018648261,0.0014742421,0.0002342772,0.000019098026,0.0000650721,0.0020682693],"genre_scores_gemma":[0.80722183,0.000052941512,0.18915127,0.00087061414,0.0024061613,0.00005014297,0.00006438547,0.000013954498,0.00016871402],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99717003,0.000083204584,0.000851144,0.00022850775,0.0013670063,0.00030013503],"domain_scores_gemma":[0.9964141,0.00047500906,0.00069467595,0.00024679775,0.0018741806,0.00029518493],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081720244,0.00019862005,0.00023307599,0.0010171297,0.00016887895,0.00024150357,0.0015659819,0.00007792701,0.00011302689],"category_scores_gemma":[0.000089770365,0.00019671547,0.00023138397,0.0011667368,0.000060893894,0.0017725027,0.00022339915,0.00026442792,0.00022220536],"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.000037262584,0.0011326866,0.004627136,0.000017215942,0.00046369244,0.000011602887,0.00036541533,0.10447312,0.0004973813,0.5925189,0.0047980407,0.2910575],"study_design_scores_gemma":[0.0018773533,0.00018074214,0.048921026,0.000051036703,0.00006940583,0.0019293912,0.00009586355,0.019316899,0.0019052783,0.16622718,0.7586906,0.0007352678],"about_ca_topic_score_codex":0.0000022217878,"about_ca_topic_score_gemma":2.6715452e-7,"teacher_disagreement_score":0.80307364,"about_ca_system_score_codex":0.00016986269,"about_ca_system_score_gemma":0.0002633971,"threshold_uncertainty_score":0.8021824},"labels":[],"label_agreement":null},{"id":"W4313404159","doi":"10.1142/s0218195922410011","title":"Ruler Wrapping","year":2022,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Ruler; Mathematics; Clockwise; Hinge; Combinatorics; Interval (graph theory); Session (web analytics); Computer science; Geometry; Rotation (mathematics); Engineering; Physics","score_opus":0.012747428891085781,"score_gpt":0.27660298234753367,"score_spread":0.2638555534564479,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313404159","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0049446044,0.0006258454,0.9881606,0.0033302489,0.0012069705,0.0002609737,0.000036693018,0.000065624154,0.0013684535],"genre_scores_gemma":[0.84437364,0.000029159515,0.15228488,0.0016356751,0.0010165534,0.00019264604,0.0001151,0.000017023736,0.00033533043],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.99662584,0.00013311979,0.00084624666,0.00030985163,0.0018814398,0.00020347927],"domain_scores_gemma":[0.99686736,0.0004247672,0.00077075185,0.0002411045,0.0015536994,0.0001423195],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008481563,0.00016703396,0.00021389264,0.0013136618,0.00044158756,0.00023948688,0.002194798,0.000034899214,0.0003042186],"category_scores_gemma":[0.000046864694,0.0001860204,0.00023531054,0.001573209,0.000045996978,0.00075738714,0.0005532825,0.00038755438,0.000052563344],"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.000027392745,0.00037375887,0.0002562972,0.000005262473,0.00020798469,0.000026165178,0.00014517209,0.68189335,0.00026661123,0.19372377,0.0031013722,0.11997285],"study_design_scores_gemma":[0.0012461474,0.00019565443,0.0036999085,0.000011652944,0.000026818156,0.0015673117,0.00013129758,0.057457466,0.00023997038,0.19544423,0.73960614,0.0003734004],"about_ca_topic_score_codex":0.000002862509,"about_ca_topic_score_gemma":2.7372863e-7,"teacher_disagreement_score":0.839429,"about_ca_system_score_codex":0.00029812477,"about_ca_system_score_gemma":0.0004661063,"threshold_uncertainty_score":0.75856924},"labels":[],"label_agreement":null},{"id":"W4389914592","doi":"10.1142/s021819592350005x","title":"Maximum Bipartite Subgraphs of Geometric Intersection Graphs","year":2023,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Combinatorics; Bipartite graph; Mathematics; Intersection graph; Intersection (aeronautics); Complete bipartite graph; Unit (ring theory); Unit disk graph; Set (abstract data type); Graph; Discrete mathematics; Line graph; Computer science","score_opus":0.015685794196199566,"score_gpt":0.2849872331532422,"score_spread":0.2693014389570426,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389914592","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06246186,0.00036963506,0.9338477,0.0010754011,0.0012701845,0.00029834718,0.000042950953,0.00011962024,0.00051425886],"genre_scores_gemma":[0.95340204,0.0001730952,0.045404226,0.00020355143,0.00045992134,0.00006761039,0.00014552427,0.00001883032,0.00012520589],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99635947,0.00009944257,0.0012642728,0.000361863,0.0016507269,0.00026421165],"domain_scores_gemma":[0.99463123,0.00072937476,0.0011155524,0.00029873863,0.003051715,0.00017336749],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010547345,0.00021985883,0.00033604144,0.0055656726,0.00014593416,0.00017768396,0.001612295,0.000097595934,0.00005959331],"category_scores_gemma":[0.00015267229,0.00022653151,0.00038269054,0.0077853403,0.00010832116,0.00096630136,0.0002662967,0.0002655241,0.00012281918],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000091547314,0.00064985803,0.003633115,0.000057833196,0.000731493,0.00003429872,0.00030003427,0.47321096,0.002033402,0.21162875,0.005054611,0.3025741],"study_design_scores_gemma":[0.002706886,0.0005698204,0.073888026,0.00013339164,0.00010469981,0.00078167836,0.00022709297,0.070718005,0.0061601726,0.750403,0.0935284,0.00077887194],"about_ca_topic_score_codex":0.000008173115,"about_ca_topic_score_gemma":0.0000016980673,"teacher_disagreement_score":0.8909402,"about_ca_system_score_codex":0.00012789537,"about_ca_system_score_gemma":0.0002953381,"threshold_uncertainty_score":0.9237687},"labels":[],"label_agreement":null},{"id":"W7124166552","doi":"10.1142/s0218195926500019","title":"An Effective Cloud Resource Allocation Framework with User Authentication Based on BED-DSA and AR-BiLSTM","year":2025,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Cloud computing; Resource allocation; Virtual machine; Authentication (law); Queue; Signature (topology); Resource (disambiguation); Digital signature","score_opus":0.004223656884772528,"score_gpt":0.2697324280358858,"score_spread":0.26550877115111327,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7124166552","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06345072,0.000096628406,0.92898184,0.006015162,0.00022434033,0.00048204217,0.0000059742015,0.000073313284,0.00066998415],"genre_scores_gemma":[0.9085308,0.0000028041904,0.08926191,0.0016130576,0.0003822478,0.000092231174,0.00002409679,0.00001249406,0.00008038792],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978044,0.00014364705,0.00052593264,0.00041951376,0.00093279744,0.00017368593],"domain_scores_gemma":[0.99688345,0.001071297,0.0005002386,0.0004050268,0.0010140879,0.00012588661],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006556428,0.00019938548,0.00020998597,0.0009872632,0.00023106838,0.00036161506,0.0012023373,0.00008278289,0.0000074384398],"category_scores_gemma":[0.00007353069,0.0001752866,0.00009004386,0.0010070634,0.00010820545,0.00012735822,0.0001065779,0.0003318736,0.0000090678195],"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.00014750051,0.0007347559,0.0021050808,0.000027012933,0.000275226,0.00000737642,0.00027550742,0.5840174,0.000066651846,0.2751239,0.00039108534,0.13682854],"study_design_scores_gemma":[0.0021886518,0.0006967178,0.059452903,0.0005276012,0.000121114295,0.00007952945,0.00021663967,0.79393613,0.0005331823,0.088433884,0.05334397,0.00046970247],"about_ca_topic_score_codex":0.0000049829728,"about_ca_topic_score_gemma":7.8779027e-7,"teacher_disagreement_score":0.8450801,"about_ca_system_score_codex":0.00018621211,"about_ca_system_score_gemma":0.00013810347,"threshold_uncertainty_score":0.714798},"labels":[],"label_agreement":null}]}