{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":87,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":87,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12","author_layer_release":"2026-06-26"},"query_hash":"8b09e7a63a99","filters":{"venue":"International Journal of Computational Geometry & Applications"}},"results":[{"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Timothy M. Chan","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02034885522583841,"gpt":0.2588979367072863,"spread":0.2385490814814479,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001856673,0.001240801,0.001411448,0.001304743,0.0003448953,0.0009785206,0.001743064,0.001270045,0.001130709],"category_scores_gemma":[0.01278781,0.0007020025,0.0008109973,0.001144617,0.0009180536,0.003035671,0.001965496,0.00107387,0.0004909685],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007810505,"about_ca_system_score_gemma":0.0007188435,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001718797,"about_ca_topic_score_gemma":0.00148756,"domain_scores_codex":[0.9991958,0.000190249,0.00005403607,0.0001688206,0.0002995539,0.00009147804],"domain_scores_gemma":[0.9958522,0.002802695,0.0004567436,0.000369945,0.0003297606,0.0001886142],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0006591577,0.0001061111,0.004461686,0.0003616319,0.00005338106,0.0001540605,0.0002528541,0.7960715,0.01069506,0.06681596,0.003956124,0.1164125],"study_design_scores_gemma":[0.00003148179,0.00004557388,0.0004141324,0.00001588518,0.000009704118,0.00006754017,0.00002546688,0.9736719,0.002913492,0.02198331,0.0008083284,0.00001329245],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06262825,0.000712636,0.9337693,0.0002174599,0.00003382404,0.00003179308,0.0001178003,0.0005716485,0.001917252],"genre_scores_gemma":[0.3267605,0.000633307,0.6700357,0.00005301276,0.00009005134,0.0001358988,0.0004316977,0.0003213822,0.001538507],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001856673,"threshold_uncertainty_score":0.00981915,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Godfried Toussaint","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03682447294289078,"gpt":0.385715615701885,"spread":0.3488911427589942,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003077991,0.001316121,0.002117401,0.003660952,0.0008785747,0.002084005,0.002520138,0.001759509,0.003341938],"category_scores_gemma":[0.02289272,0.0006221558,0.001393991,0.005260778,0.00132985,0.005166006,0.003195595,0.002699852,0.00170299],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001256981,"about_ca_system_score_gemma":0.00095237,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004052667,"about_ca_topic_score_gemma":0.002604492,"domain_scores_codex":[0.996047,0.00138616,0.0002024427,0.0006754798,0.001570362,0.0001186334],"domain_scores_gemma":[0.9940941,0.003596999,0.0003810631,0.0008016922,0.0009835863,0.0001425147],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002403879,0.0002005621,0.002041542,0.0005582236,0.0002066147,0.0001504925,0.0003361416,0.2634394,0.003310188,0.1540091,0.00784932,0.567658],"study_design_scores_gemma":[0.0000272417,0.0001351235,0.0005079996,0.00007046101,0.00005582697,0.0001398213,0.00009393784,0.8031239,0.002502626,0.1805097,0.01279684,0.00003659993],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005891326,0.002323884,0.9885249,0.0002876868,0.000149781,0.00007769215,0.000115996,0.0006442395,0.001984605],"genre_scores_gemma":[0.1864022,0.003715935,0.8056052,0.0005060661,0.0003681081,0.000250853,0.000657474,0.0003667577,0.002127391],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004052667,"threshold_uncertainty_score":0.01627815,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Combinatorics; Mathematics; Simple polygon; Simple (philosophy); Decomposition; Regular polygon; Convex polygon; Geometry","authors":[{"name":"Mark Keil","is_ca":true},{"name":"Jack Snoeyink","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01666600020750904,"gpt":0.2948917396336267,"spread":0.2782257394261177,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002073558,0.002657979,0.002026265,0.001480063,0.001160215,0.004256525,0.002694675,0.001303077,0.02088587],"category_scores_gemma":[0.01054512,0.00100546,0.001895085,0.002556267,0.001557756,0.007038219,0.003651664,0.002180699,0.004198999],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002560883,"about_ca_system_score_gemma":0.002124116,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006391433,"about_ca_topic_score_gemma":0.01048567,"domain_scores_codex":[0.996894,0.0005186019,0.0001547068,0.0004801583,0.001072493,0.0008799214],"domain_scores_gemma":[0.9917563,0.00546359,0.0004730847,0.001353178,0.0005330706,0.0004206968],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.005222025,0.0004087643,0.003118285,0.001849253,0.0002494964,0.0006447813,0.000572039,0.4091238,0.05192753,0.07927399,0.04402348,0.4035866],"study_design_scores_gemma":[0.0003549067,0.0002772154,0.0007898372,0.0001355543,0.0001380939,0.0002659449,0.0001969507,0.89648,0.01344304,0.07703386,0.0108378,0.00004689625],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1309427,0.006111367,0.8002225,0.002590013,0.0004325396,0.0003529279,0.001852216,0.009268601,0.04822722],"genre_scores_gemma":[0.501885,0.003053965,0.4679694,0.000809013,0.0003230848,0.0005946669,0.005020917,0.002784707,0.01755927],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02088587,"threshold_uncertainty_score":0.06987023,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"David Kirkpatrick","is_ca":true},{"name":"Jack Snoeyink","is_ca":false},{"name":"Bettina Speckmann","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02142709383042527,"gpt":0.2928804251844943,"spread":0.271453331354069,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001157806,0.0007226536,0.001318697,0.001964486,0.001161017,0.002449434,0.003695103,0.0008306622,0.002967636],"category_scores_gemma":[0.007770008,0.0008549262,0.0009718899,0.002252009,0.002337374,0.006003061,0.004062165,0.001620771,0.0009581421],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001020186,"about_ca_system_score_gemma":0.001064958,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001536736,"about_ca_topic_score_gemma":0.001126565,"domain_scores_codex":[0.9980405,0.0001905341,0.0001971198,0.0004096963,0.0009074483,0.0002547161],"domain_scores_gemma":[0.9950705,0.001381286,0.0007815876,0.001893515,0.0006179752,0.0002551005],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001911782,0.0002284555,0.008733562,0.0006134454,0.00007869928,0.0006832451,0.0008897066,0.3314747,0.04819909,0.3077922,0.005691823,0.2937034],"study_design_scores_gemma":[0.00008561814,0.0002588434,0.0006811159,0.00004540749,0.00003073769,0.0003534661,0.0001617014,0.8227757,0.0480259,0.1189084,0.00858781,0.00008536474],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03391059,0.00006627592,0.9631236,0.00009632693,0.00004004922,0.00006701305,0.000266671,0.001376641,0.001052804],"genre_scores_gemma":[0.5627252,0.0001607212,0.4330864,0.00007338872,0.00004670435,0.0002108018,0.001174694,0.0002555189,0.002266488],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003695103,"threshold_uncertainty_score":0.00992769,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Chris Worman","is_ca":true},{"name":"Julian Keil","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.007288858907567653,"gpt":0.28497267076778,"spread":0.2776838118602124,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006485346,0.0006254796,0.0009107626,0.0008308321,0.0008089407,0.00151099,0.0009213432,0.0009517967,0.004869727],"category_scores_gemma":[0.00289095,0.0005459348,0.001032471,0.001234704,0.001241217,0.003172763,0.002319998,0.00133543,0.0008207483],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006138409,"about_ca_system_score_gemma":0.0004678078,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001624219,"about_ca_topic_score_gemma":0.001357686,"domain_scores_codex":[0.9991148,0.0002269478,0.00004831034,0.0002044954,0.0002319932,0.0001733316],"domain_scores_gemma":[0.9987127,0.0006304318,0.000199948,0.000215791,0.0001076284,0.0001335681],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0007067184,0.0002722502,0.003634147,0.0004924988,0.0001190394,0.0005743898,0.0006304766,0.5047572,0.01078677,0.2657588,0.02092086,0.1913469],"study_design_scores_gemma":[0.0000936209,0.0001690349,0.001716699,0.00008176007,0.000044315,0.0008035729,0.0006195582,0.7022356,0.006137553,0.2668573,0.02120136,0.00003953119],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2580347,0.001092094,0.7130165,0.001073911,0.0001144987,0.0001765407,0.001250077,0.0005327399,0.02470891],"genre_scores_gemma":[0.6257074,0.0009736258,0.3574627,0.0001579234,0.0001211532,0.0001566608,0.003452297,0.0002549189,0.01171335],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004869727,"threshold_uncertainty_score":0.01629084,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Matthew Suderman","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.009141361070416429,"gpt":0.2657396044499298,"spread":0.2565982433795134,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000572932,0.0007287706,0.0005148447,0.0008557449,0.0006034781,0.002206263,0.001199634,0.000754807,0.006652819],"category_scores_gemma":[0.008705392,0.000867711,0.0005699774,0.001637153,0.0007401772,0.004403354,0.001575061,0.00125556,0.001157222],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009371159,"about_ca_system_score_gemma":0.0004612335,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001436286,"about_ca_topic_score_gemma":0.002805409,"domain_scores_codex":[0.9988099,0.0002819047,0.00009079083,0.0002083623,0.0003998818,0.0002091858],"domain_scores_gemma":[0.9958667,0.002108008,0.0006081769,0.0008096904,0.0003361223,0.0002713313],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0005857971,0.0001398082,0.002998732,0.000543876,0.00007104759,0.0006248749,0.000935003,0.256256,0.03686943,0.361612,0.01490324,0.3244604],"study_design_scores_gemma":[0.0001027256,0.0002075315,0.001943049,0.0001239551,0.00007870587,0.001134989,0.0003618389,0.4451077,0.0147284,0.5086647,0.02749337,0.00005300475],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1672004,0.001042837,0.8092157,0.0005511867,0.00006022406,0.0001132264,0.001104855,0.001508269,0.01920336],"genre_scores_gemma":[0.4837592,0.001598816,0.5052072,0.0001762529,0.00007823024,0.0002425713,0.002064503,0.0004616221,0.006411552],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006652819,"threshold_uncertainty_score":0.02225596,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Gautam K. Das","is_ca":false},{"name":"Robert Fraser","is_ca":true},{"name":"ALEJANDRO LÓOPEZ-ORTIZ","is_ca":true},{"name":"Bradford G. Nickerson","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01808876524586595,"gpt":0.2930174984656583,"spread":0.2749287332197923,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009096075,0.001209984,0.001851511,0.001242116,0.001260474,0.002478444,0.002113784,0.001842708,0.01152842],"category_scores_gemma":[0.007221956,0.0005593352,0.001057678,0.003384833,0.001372895,0.005225021,0.00202345,0.001766101,0.001674696],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002165252,"about_ca_system_score_gemma":0.001312305,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004335213,"about_ca_topic_score_gemma":0.002505448,"domain_scores_codex":[0.998193,0.000410887,0.00008152577,0.0005116699,0.0005020837,0.0003009605],"domain_scores_gemma":[0.9963341,0.00255997,0.0002164315,0.000491959,0.000243128,0.0001543985],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001501977,0.0005285149,0.002150955,0.001058466,0.0001484766,0.0006343806,0.0004542995,0.4899912,0.00428238,0.1399253,0.05711415,0.3022099],"study_design_scores_gemma":[0.0001701076,0.0001176802,0.0006892995,0.00009373562,0.00005764391,0.0005482773,0.0002352384,0.7942967,0.003271159,0.1824549,0.01801961,0.00004564342],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.213115,0.005645375,0.7165974,0.004818183,0.0004751045,0.000623082,0.003222296,0.002527446,0.05297602],"genre_scores_gemma":[0.6329287,0.003807293,0.3384714,0.0007805792,0.0006053121,0.0005489879,0.005722307,0.0005581871,0.01657728],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01152842,"threshold_uncertainty_score":0.03856647,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Prosenjit Bose","is_ca":true},{"name":"Andrej Brodnik","is_ca":false},{"name":"Svante Carlsson","is_ca":false},{"name":"Erik D. Demaine","is_ca":false},{"name":"Rudolf Fleischer","is_ca":false},{"name":"Alejandro López-Ortíz","is_ca":true},{"name":"Pat Morin","is_ca":true},{"name":"J. Ian Munro","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03047104559883784,"gpt":0.3160281218117496,"spread":0.2855570762129118,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000689154,0.0007537984,0.001276676,0.0004766234,0.0009516389,0.00163904,0.002050272,0.001353393,0.006324033],"category_scores_gemma":[0.005175292,0.0004518638,0.0007274273,0.001321244,0.001321827,0.003892459,0.002014311,0.001249802,0.0009825897],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001439504,"about_ca_system_score_gemma":0.0007526073,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003718436,"about_ca_topic_score_gemma":0.003478865,"domain_scores_codex":[0.9988754,0.0002926744,0.0000438744,0.0002317686,0.0003081724,0.0002481405],"domain_scores_gemma":[0.9975183,0.001210169,0.0002869354,0.0006065618,0.0002040759,0.0001739571],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0004249297,0.0002048143,0.0007686151,0.0001459718,0.00004264649,0.0002480554,0.0002007195,0.7590057,0.00573207,0.1336662,0.005470956,0.0940894],"study_design_scores_gemma":[0.00003042125,0.00005796987,0.0001148006,0.000007549381,0.00001133338,0.00007322951,0.00005352376,0.9157707,0.001583741,0.07900921,0.003279207,0.000008306505],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1439955,0.0005997485,0.8355576,0.0009453007,0.000111757,0.0001686305,0.0002694716,0.0009075683,0.01744447],"genre_scores_gemma":[0.7442155,0.0006537161,0.2439914,0.000288103,0.00008704552,0.0001741569,0.0007331432,0.0002108724,0.009646043],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006324033,"threshold_uncertainty_score":0.02115595,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Lori Freitag","is_ca":false},{"name":"Carl Ollivier‐Gooch","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01340096252291059,"gpt":0.3006171013680556,"spread":0.2872161388451451,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006264396,0.0006815162,0.0007245561,0.001768138,0.0004059658,0.001098201,0.001088606,0.00127536,0.003473408],"category_scores_gemma":[0.04043777,0.0003984909,0.0007637747,0.001871382,0.001211791,0.002017643,0.001418209,0.0008108794,0.0005227049],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007630061,"about_ca_system_score_gemma":0.0006583215,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005608748,"about_ca_topic_score_gemma":0.0005348606,"domain_scores_codex":[0.994737,0.002648798,0.0001593555,0.0001698614,0.001973361,0.0003116111],"domain_scores_gemma":[0.9624194,0.03097848,0.001445589,0.002964068,0.001938709,0.0002538013],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0009729388,0.0002632999,0.007192868,0.0004519131,0.0001714498,0.0001534333,0.0001603896,0.7284917,0.01491466,0.07232555,0.001094626,0.1738072],"study_design_scores_gemma":[0.0001190988,0.0007200385,0.005711152,0.00006886195,0.0001716165,0.0003100158,0.0001190182,0.9501692,0.01251892,0.02745782,0.002594613,0.00003967124],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3855114,0.005631282,0.5745727,0.002632487,0.00008935211,0.0004208546,0.0002119843,0.0005590036,0.03037101],"genre_scores_gemma":[0.8450884,0.00155275,0.150323,0.0001327668,0.00007257239,0.0002156745,0.0001234218,0.000209576,0.002281892],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006264396,"threshold_uncertainty_score":0.03312975,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Manuel Abellanas","is_ca":false},{"name":"Prosenjit Bose","is_ca":true},{"name":"Jesús Garcı́a","is_ca":false},{"name":"Ferrán Hurtado","is_ca":false},{"name":"Carlos M. Nicolás","is_ca":false},{"name":"Pedro Ramos","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.00971004641262518,"gpt":0.2639447868047667,"spread":0.2542347403921415,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000794752,0.0006399039,0.0007912035,0.002995004,0.001618767,0.002899635,0.001777285,0.001146112,0.005063708],"category_scores_gemma":[0.01023384,0.0008951899,0.0008309548,0.002530792,0.003118173,0.005470499,0.001969457,0.001697439,0.0005414534],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001793848,"about_ca_system_score_gemma":0.0006660218,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002327594,"about_ca_topic_score_gemma":0.00277629,"domain_scores_codex":[0.999045,0.0002065655,0.00006054972,0.0002356289,0.0002940955,0.0001582372],"domain_scores_gemma":[0.9851449,0.008597995,0.002656637,0.001490759,0.001204171,0.0009054446],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002540543,0.0001567886,0.007512582,0.000314605,0.00004825006,0.0004589698,0.001464813,0.1630064,0.01013401,0.7787126,0.002682774,0.03525431],"study_design_scores_gemma":[0.00004125162,0.00014588,0.003433171,0.00006657296,0.00004091412,0.0008336772,0.0007298957,0.2851217,0.004278447,0.6987122,0.006542606,0.0000537725],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6667562,0.0009641082,0.305062,0.001173876,0.00006613913,0.0001521521,0.0006939573,0.000312304,0.0248192],"genre_scores_gemma":[0.9182664,0.0009446648,0.07564704,0.0001423878,0.000129886,0.0001396854,0.0008247567,0.000163113,0.003741998],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005063708,"threshold_uncertainty_score":0.01693982,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Prosenjit Bose","is_ca":true},{"name":"Michiel Smid","is_ca":true},{"name":"Daming Xu","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01813034938883125,"gpt":0.2913733717094611,"spread":0.2732430223206299,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004596208,0.0004138665,0.0005334205,0.0004365855,0.0003819318,0.0005402816,0.0007536425,0.0004834662,0.004493834],"category_scores_gemma":[0.003677079,0.000536165,0.0004782795,0.0007199041,0.0005710846,0.00145171,0.002435602,0.0005704366,0.0007158076],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004559289,"about_ca_system_score_gemma":0.0004331809,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001506164,"about_ca_topic_score_gemma":0.002548613,"domain_scores_codex":[0.9991682,0.0001675255,0.00005740021,0.0002176424,0.000264563,0.0001247332],"domain_scores_gemma":[0.9985235,0.000601907,0.0002107676,0.0003731225,0.0001737252,0.0001169227],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0007679033,0.0001432726,0.007447692,0.0006235866,0.00008194801,0.0006461688,0.001063376,0.3679996,0.05503817,0.1844669,0.00584724,0.3758741],"study_design_scores_gemma":[0.0001552851,0.0004291384,0.003065067,0.0001196436,0.00003984113,0.001007545,0.0004865319,0.7519726,0.04832007,0.1663272,0.02803076,0.00004636675],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1662408,0.0003895175,0.8198279,0.0002130566,0.00003287253,0.0001537762,0.0003091325,0.000536183,0.01229689],"genre_scores_gemma":[0.4505189,0.0003037263,0.5422373,0.00008307571,0.00001817749,0.0001587674,0.000829564,0.0001683306,0.005682078],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004493834,"threshold_uncertainty_score":0.01503336,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"I. Suzuki","is_ca":false},{"name":"YUICHI TAZOE","is_ca":false},{"name":"Masafumi Yamashita","is_ca":false},{"name":"Tiko Kameda","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01131055918023098,"gpt":0.2560574554073465,"spread":0.2447468962271156,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003549185,0.0003793712,0.0005915547,0.0006520769,0.0006432214,0.001446597,0.0009080427,0.0009405329,0.003669133],"category_scores_gemma":[0.004335366,0.0003003714,0.0006162734,0.0006274448,0.00139811,0.00420671,0.002025981,0.0006946145,0.0005420558],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002909925,"about_ca_system_score_gemma":0.0004959652,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001256729,"about_ca_topic_score_gemma":0.0005454572,"domain_scores_codex":[0.9995765,0.00008753367,0.00002775331,0.0001282309,0.0001170325,0.00006294336],"domain_scores_gemma":[0.9988024,0.0007217034,0.0001949515,0.0001322903,0.00007282264,0.00007582416],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0005549545,0.0000822501,0.003339665,0.000772083,0.00006433555,0.001250936,0.001286909,0.2835389,0.0319891,0.4748093,0.003778747,0.1985327],"study_design_scores_gemma":[0.00007427346,0.0002949383,0.001874137,0.0001170538,0.0000401307,0.001259126,0.0007685426,0.6271272,0.01827279,0.3252645,0.02484692,0.00006033243],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1700277,0.0005340386,0.8120362,0.0003972671,0.00003788883,0.0001256243,0.0002166437,0.0003145856,0.01631015],"genre_scores_gemma":[0.67286,0.001209659,0.3169461,0.00008921539,0.00005350813,0.0001470957,0.0007407296,0.0001133339,0.007840308],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003669133,"threshold_uncertainty_score":0.0122745,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Prosenjit Bose","is_ca":true},{"name":"Pat Morin","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01763196468959343,"gpt":0.2942423025839158,"spread":0.2766103378943223,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005575438,0.001140242,0.001282835,0.001684328,0.0007118664,0.001309694,0.002881414,0.001282953,0.01294076],"category_scores_gemma":[0.003020341,0.0007301668,0.001337474,0.002758008,0.0005866267,0.002805877,0.00267391,0.001717101,0.006576615],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007563983,"about_ca_system_score_gemma":0.001647795,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005511223,"about_ca_topic_score_gemma":0.008857844,"domain_scores_codex":[0.9986081,0.0001274384,0.0001114996,0.0002699905,0.0006939057,0.0001891461],"domain_scores_gemma":[0.9987047,0.0002227316,0.00005591603,0.0005359183,0.0004276362,0.00005310031],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003026616,0.0001841197,0.0008176759,0.0002812681,0.00007749965,0.0001944206,0.0002254787,0.02023381,0.04519541,0.02041941,0.02055592,0.8915123],"study_design_scores_gemma":[0.0005707188,0.0004509818,0.002051743,0.00009658677,0.000282006,0.001797276,0.0001554812,0.7213666,0.04978485,0.06109791,0.1621391,0.000206775],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004728807,0.0001860029,0.9864329,0.0001154978,0.0001205356,0.000120957,0.0001820529,0.005336817,0.002776524],"genre_scores_gemma":[0.02398697,0.00009935327,0.9702364,0.00008545157,0.00003316366,0.0001526113,0.0008346067,0.0004893254,0.004082111],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01294076,"threshold_uncertainty_score":0.04329115,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Cluster analysis; Approximation algorithm; Algorithm; Mathematics; Quadratic equation; Data point","authors":[{"name":"Danny Z. Chen","is_ca":false},{"name":"Michiel Smid","is_ca":true},{"name":"Bin Xu","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04678182490313389,"gpt":0.3361935380016862,"spread":0.2894117130985523,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003334269,0.001733765,0.002253788,0.004365956,0.001410794,0.002667084,0.004281228,0.002204306,0.003505622],"category_scores_gemma":[0.01817035,0.001311133,0.001857162,0.006156098,0.002052559,0.005089718,0.004435839,0.003405587,0.002677782],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003049955,"about_ca_system_score_gemma":0.002058381,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005585466,"about_ca_topic_score_gemma":0.003659796,"domain_scores_codex":[0.9954035,0.001220461,0.0003085197,0.0007424356,0.002117754,0.0002072842],"domain_scores_gemma":[0.9940181,0.002568627,0.0005381897,0.001490958,0.001252205,0.0001319643],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001059983,0.00007032574,0.001039397,0.000389024,0.0001216864,0.00007267377,0.0002604139,0.5768158,0.001559399,0.1579481,0.007440137,0.2541772],"study_design_scores_gemma":[0.00002344865,0.00002818947,0.0002155737,0.00003539685,0.00001555453,0.0001080209,0.00005575774,0.881256,0.001220051,0.1085463,0.008467405,0.00002823456],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0007393097,0.0003549548,0.9979151,0.00009555584,0.00002672264,0.00003690926,0.0000451345,0.0003484899,0.0004378607],"genre_scores_gemma":[0.04272176,0.001120002,0.953919,0.0001035558,0.0001071835,0.0002617713,0.0005808929,0.0001704191,0.001015471],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005585466,"threshold_uncertainty_score":0.02212906,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Stéphane Durocher","is_ca":true},{"name":"David Kirkpatrick","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01129334434568958,"gpt":0.2740421019614167,"spread":0.2627487576157271,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002135185,0.0006510268,0.0009103262,0.0025232,0.0008873313,0.001662126,0.001337555,0.001138959,0.001823455],"category_scores_gemma":[0.01877383,0.0003542394,0.0008885619,0.002742186,0.003601809,0.003060159,0.003800086,0.001626105,0.0004419622],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001882634,"about_ca_system_score_gemma":0.0006610202,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002086062,"about_ca_topic_score_gemma":0.001124297,"domain_scores_codex":[0.9987652,0.0004244502,0.00006718474,0.0002065146,0.0004141713,0.0001224364],"domain_scores_gemma":[0.9906914,0.005660389,0.001316954,0.0007491113,0.001152228,0.000430031],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002282255,0.00005157471,0.007134088,0.0002299208,0.00004569675,0.0005459849,0.0009271313,0.3094353,0.01234153,0.6080831,0.001766124,0.05921143],"study_design_scores_gemma":[0.00002201896,0.0002434138,0.003835575,0.000118641,0.00002505591,0.001118869,0.0005005338,0.7277019,0.006546359,0.2515992,0.008213222,0.00007516082],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09495284,0.002197597,0.8895789,0.0008063179,0.00008956652,0.00005368165,0.00007942786,0.0001461769,0.01209552],"genre_scores_gemma":[0.8527671,0.001840517,0.1424494,0.0000923196,0.0001799604,0.00008638639,0.00009063003,0.0001129722,0.002380766],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0025232,"threshold_uncertainty_score":0.01365948,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"L.-E. Andersson","is_ca":false},{"name":"T. J. Peters","is_ca":false},{"name":"Nathaniel Stewart","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01173909317245529,"gpt":0.3037304161559837,"spread":0.2919913229835284,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001204101,0.0003628667,0.000481548,0.001260411,0.0006636711,0.002679529,0.0006204687,0.0009199507,0.003458072],"category_scores_gemma":[0.006924019,0.0002946755,0.0005948047,0.0005254393,0.003314345,0.003963842,0.003802893,0.001389738,0.0004723843],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004944319,"about_ca_system_score_gemma":0.0002497106,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003055446,"about_ca_topic_score_gemma":0.000174161,"domain_scores_codex":[0.998153,0.0002527484,0.000161926,0.0004306756,0.0008500456,0.0001515417],"domain_scores_gemma":[0.9967697,0.000784863,0.0006613749,0.0007855549,0.0006216987,0.0003768609],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00007898982,0.00005453274,0.00126591,0.00005562326,0.000009544684,0.0003202314,0.0009119573,0.01028499,0.008282823,0.9543744,0.0004476587,0.02391339],"study_design_scores_gemma":[0.0000466356,0.0003374186,0.002556746,0.00002630661,0.00001624003,0.000920837,0.000565187,0.07935432,0.006982125,0.8977941,0.01135256,0.00004746723],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5243502,0.0002415429,0.4467478,0.0004496934,0.0001504384,0.00008757009,0.0001761409,0.0003125006,0.02748409],"genre_scores_gemma":[0.9636616,0.0001904214,0.03096263,0.00009967064,0.00007293437,0.00006221859,0.0002826638,0.0001149822,0.004552865],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003458072,"threshold_uncertainty_score":0.01156843,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Frank Dehne","is_ca":true},{"name":"Rolf Klein","is_ca":false},{"name":"Raimund Seidel","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01837095015847291,"gpt":0.2848444143815391,"spread":0.2664734642230662,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027793,0.001028291,0.002010545,0.0008470991,0.001187039,0.001992962,0.002795163,0.001629303,0.003503041],"category_scores_gemma":[0.02541135,0.001055393,0.0008839151,0.001424357,0.002776513,0.005989975,0.003156973,0.00147223,0.0005815324],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001037901,"about_ca_system_score_gemma":0.0005914854,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001718978,"about_ca_topic_score_gemma":0.001485773,"domain_scores_codex":[0.9975241,0.0008930429,0.00007544541,0.0004592653,0.0007000152,0.0003481654],"domain_scores_gemma":[0.9890298,0.008198882,0.001088354,0.0006401188,0.0006001478,0.0004427339],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003076958,0.0001029799,0.00304755,0.0003323562,0.0001022568,0.001498873,0.0009765651,0.4490988,0.007537894,0.4635041,0.003722706,0.06976827],"study_design_scores_gemma":[0.00004624476,0.00009791416,0.0008134252,0.00004419056,0.00003336513,0.0007876367,0.0002542298,0.772274,0.004612219,0.2176095,0.003391044,0.00003617608],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06767101,0.0008182736,0.9152383,0.0006916299,0.00002035266,0.00008148187,0.0000901726,0.0001141812,0.01527476],"genre_scores_gemma":[0.8152984,0.001076423,0.1774863,0.0001319297,0.0001386314,0.0001886264,0.0001288087,0.0001651753,0.005385666],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003503041,"threshold_uncertainty_score":0.01469857,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Prosenjit Bose","is_ca":true},{"name":"Vida Dujmović","is_ca":true},{"name":"Ferrán Hurtado","is_ca":false},{"name":"John Iacono","is_ca":false},{"name":"Stefan Langerman","is_ca":false},{"name":"Henk Meijer","is_ca":false},{"name":"Vera Sacristán","is_ca":false},{"name":"Maria Saumell","is_ca":false},{"name":"David R. Wood","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0138816144690725,"gpt":0.2843221015864498,"spread":0.2704404871173773,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000960783,0.0006394223,0.0006065241,0.002353773,0.001728926,0.001950034,0.001379337,0.001252953,0.004988917],"category_scores_gemma":[0.01220149,0.0004761118,0.0005926755,0.003471783,0.002232277,0.004078364,0.001908268,0.001549889,0.000396734],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001182297,"about_ca_system_score_gemma":0.0004550417,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008581284,"about_ca_topic_score_gemma":0.0007467584,"domain_scores_codex":[0.9986858,0.0003007047,0.00008626451,0.000447766,0.0003373635,0.0001420548],"domain_scores_gemma":[0.9872246,0.00831062,0.002059026,0.0008038851,0.0008160595,0.0007858411],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003478084,0.0001481734,0.01087458,0.0006009716,0.00007217242,0.0007592104,0.001185707,0.03066996,0.008930516,0.8752451,0.003581859,0.06758403],"study_design_scores_gemma":[0.00005803083,0.0002102011,0.009441619,0.0001445766,0.000111634,0.004294808,0.002089738,0.09350164,0.01075646,0.8610872,0.01821571,0.0000883854],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5861648,0.001243767,0.3753454,0.001466097,0.0001084653,0.0002231372,0.001303634,0.0004213629,0.03372338],"genre_scores_gemma":[0.9312353,0.0006794423,0.06345463,0.0001811712,0.0001036336,0.0001663459,0.0006087096,0.00009051924,0.003480298],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004988917,"threshold_uncertainty_score":0.01668954,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Prosenjit Bose","is_ca":true},{"name":"Hazel Everett","is_ca":false},{"name":"STEPHEN WISMATH","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01914964241694904,"gpt":0.2647208432120246,"spread":0.2455712007950756,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004196601,0.0005161138,0.000558646,0.001349733,0.001614071,0.002676111,0.001147734,0.0008369097,0.01465914],"category_scores_gemma":[0.005225043,0.0006083739,0.0006231857,0.002521651,0.001545489,0.004431682,0.001169422,0.001130503,0.001811027],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008930141,"about_ca_system_score_gemma":0.0005544461,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001233186,"about_ca_topic_score_gemma":0.001146597,"domain_scores_codex":[0.9989801,0.0001647761,0.00008101582,0.0002884385,0.0002960362,0.000189666],"domain_scores_gemma":[0.9941165,0.002738658,0.001114985,0.0008690577,0.0006484567,0.0005122519],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003496658,0.0002452405,0.01073144,0.0007592621,0.00009286957,0.001423227,0.001458235,0.0252296,0.02038414,0.7949862,0.02261446,0.1217256],"study_design_scores_gemma":[0.0001015569,0.0002567477,0.006760349,0.0001195955,0.0001331252,0.004519844,0.001259915,0.03743603,0.01153978,0.865198,0.07260277,0.00007226902],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5453833,0.001000062,0.3207479,0.001488379,0.000191675,0.0003173276,0.004456419,0.001995801,0.1244192],"genre_scores_gemma":[0.9239025,0.000828537,0.05763661,0.0002746181,0.0001364291,0.0002570466,0.004557688,0.0003895684,0.01201692],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01465914,"threshold_uncertainty_score":0.04903972,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"José Miguel Díaz-Báñez","is_ca":false},{"name":"F. Hurtado","is_ca":false},{"name":"Henk Meijer","is_ca":true},{"name":"David Rappaport","is_ca":true},{"name":"J. Antoni Sellarès","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.00901005290849842,"gpt":0.2732297818459956,"spread":0.2642197289374972,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002358635,0.001015805,0.003110608,0.00104187,0.001596539,0.002553009,0.002948227,0.002847017,0.008298377],"category_scores_gemma":[0.009949421,0.0009244978,0.001493097,0.001736,0.001621358,0.00572676,0.003411069,0.001435236,0.00208003],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007660445,"about_ca_system_score_gemma":0.001192103,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001276133,"about_ca_topic_score_gemma":0.001130157,"domain_scores_codex":[0.9977348,0.0007492114,0.0001819858,0.0006734676,0.0003454045,0.0003151304],"domain_scores_gemma":[0.9959544,0.002540995,0.0003732601,0.0005449451,0.0002814964,0.0003049399],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.002381117,0.0003839695,0.003979705,0.001720703,0.000191909,0.0009561726,0.001319807,0.4632654,0.007855823,0.2319145,0.05580163,0.2302292],"study_design_scores_gemma":[0.0003495671,0.00040051,0.001165667,0.0001738811,0.0001059892,0.001146159,0.0008351497,0.6800848,0.006385487,0.2783577,0.0309069,0.00008821738],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1285954,0.002708406,0.8421531,0.002484314,0.0002182502,0.0003095608,0.002543402,0.001899968,0.01908753],"genre_scores_gemma":[0.4424921,0.00104048,0.5416343,0.0004269886,0.0002473441,0.0004252079,0.004388666,0.0005914382,0.008753479],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008298377,"threshold_uncertainty_score":0.0277608,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Spanner; Graph; Metric (unit); Plane (geometry); Metric space","authors":[],"retraction":null,"screen_n_in":null,"score":{"opus":0.02534929133520776,"gpt":0.329245877191997,"spread":0.3038965858567892,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002140587,0.0005583692,0.0003756993,0.0006800431,0.0005857096,0.0009618995,0.0004807567,0.0006991973,0.009129489],"category_scores_gemma":[0.001080297,0.0002820943,0.0003483744,0.0008102599,0.000861377,0.003141731,0.001488928,0.00113839,0.001202865],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003388214,"about_ca_system_score_gemma":0.0002139718,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004133912,"about_ca_topic_score_gemma":0.0006822545,"domain_scores_codex":[0.9997235,0.00004760876,0.00001203059,0.00007892685,0.00007428484,0.00006367428],"domain_scores_gemma":[0.9994686,0.000128712,0.0001816663,0.00006184642,0.00007401785,0.00008517429],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001887286,0.00004338468,0.001145558,0.00009149969,0.00002255947,0.0003707134,0.0002291775,0.01134087,0.0126729,0.9485021,0.002056696,0.02333585],"study_design_scores_gemma":[0.00003754775,0.000179102,0.001841813,0.00003653838,0.00002806694,0.0006926956,0.0004523877,0.02925691,0.01098332,0.9380109,0.01843791,0.0000427499],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6981215,0.0006035947,0.2063776,0.0008630109,0.0002065312,0.00007077579,0.0004899523,0.0003913375,0.09287576],"genre_scores_gemma":[0.9396873,0.000740973,0.03553504,0.0002698198,0.00009943776,0.00010716,0.0005255057,0.0001571679,0.02287761],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.009129489,"threshold_uncertainty_score":0.03054118,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Erik D. Demaine","is_ca":false},{"name":"Jeff Erickson","is_ca":false},{"name":"Ferrán Hurtado","is_ca":false},{"name":"John Iacono","is_ca":false},{"name":"Stefan Langerman","is_ca":false},{"name":"Henk Meijer","is_ca":true},{"name":"Mark Overmars","is_ca":false},{"name":"Sue Whitesides","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01080764953202885,"gpt":0.2926302831839573,"spread":0.2818226336519284,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009932994,0.001110179,0.001194059,0.002356464,0.0020865,0.002602486,0.002021127,0.00193892,0.004082965],"category_scores_gemma":[0.009636064,0.001084942,0.001019102,0.002173728,0.003427818,0.00403342,0.00731193,0.001889556,0.0009358285],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0010238,"about_ca_system_score_gemma":0.0006614976,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001428968,"about_ca_topic_score_gemma":0.001142023,"domain_scores_codex":[0.9979807,0.0004527989,0.0001417448,0.0004147604,0.0006591699,0.0003509593],"domain_scores_gemma":[0.9938713,0.003975141,0.0008587882,0.0004615492,0.0003221322,0.0005110648],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0004111984,0.0001013202,0.001885906,0.0002675265,0.00007418092,0.001277779,0.001048624,0.5126616,0.005179066,0.431224,0.001413847,0.04445484],"study_design_scores_gemma":[0.00008549142,0.0001213432,0.0003990754,0.00006775995,0.00003217012,0.0005371257,0.0006026715,0.5034417,0.004673328,0.4798139,0.0101709,0.00005462826],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1325826,0.0004368507,0.8558871,0.0003091729,0.00004462579,0.0001313991,0.0002228374,0.0002974138,0.01008791],"genre_scores_gemma":[0.620282,0.0005962661,0.3708737,0.00009260931,0.00007185706,0.0003086487,0.0008168141,0.0001660774,0.006792055],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004082965,"threshold_uncertainty_score":0.01365894,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Sergei Bespamyatnikh","is_ca":true},{"name":"Klara Kedem","is_ca":false},{"name":"Michael Segal","is_ca":true},{"name":"Arie Tamir","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01464933294082901,"gpt":0.2540445895816632,"spread":0.2393952566408342,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004180683,0.001823279,0.002580552,0.002289687,0.001330333,0.003203934,0.003649619,0.003802666,0.005440147],"category_scores_gemma":[0.01936685,0.001039906,0.00135656,0.003571252,0.001844635,0.005622475,0.003830653,0.002278257,0.001027081],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004946373,"about_ca_system_score_gemma":0.003385305,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005967486,"about_ca_topic_score_gemma":0.005556682,"domain_scores_codex":[0.9960437,0.001757707,0.0001792208,0.0007198037,0.0006709225,0.0006287533],"domain_scores_gemma":[0.9885329,0.008500658,0.0008575651,0.000802954,0.0008826141,0.0004233825],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002765981,0.0001584493,0.0005730191,0.000195477,0.00004558082,0.00006275868,0.0001067657,0.884734,0.0005976423,0.06258319,0.0044396,0.04622686],"study_design_scores_gemma":[0.0000801347,0.00006695122,0.0001767354,0.00001947743,0.00002110655,0.00005430988,0.00007476973,0.9410695,0.0008030695,0.05625681,0.001356413,0.00002073834],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02634677,0.0006837035,0.9667027,0.0006097158,0.00004647933,0.000141495,0.0003202245,0.0005511965,0.004597623],"genre_scores_gemma":[0.3219375,0.001104834,0.670054,0.0002046231,0.0001907101,0.000418983,0.0009620581,0.0002834316,0.004843942],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005967486,"threshold_uncertainty_score":0.03588855,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"H. Ratschek","is_ca":false},{"name":"Jon Rokne","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01145738364241935,"gpt":0.3130017701762635,"spread":0.3015443865338441,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006062075,0.0007362552,0.001043902,0.001245005,0.0005212228,0.001982685,0.001003807,0.000841837,0.005036933],"category_scores_gemma":[0.0035311,0.0006399598,0.0008582957,0.001200155,0.001277886,0.001987369,0.002378348,0.001224594,0.001390553],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009689642,"about_ca_system_score_gemma":0.0009069433,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003733077,"about_ca_topic_score_gemma":0.004760294,"domain_scores_codex":[0.999103,0.0001195792,0.00004524687,0.000115676,0.0005154708,0.0001011034],"domain_scores_gemma":[0.9991801,0.0003793264,0.00006162036,0.0001418073,0.0001901898,0.00004693157],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001856418,0.00004714199,0.0007494571,0.0001609225,0.00002421842,0.0001693635,0.0002567528,0.6060998,0.0049011,0.2056193,0.005714097,0.1760722],"study_design_scores_gemma":[0.00001967833,0.00002064426,0.000144125,0.00001295288,0.00000259033,0.00003934205,0.00003895288,0.9178042,0.00173221,0.07670632,0.003463771,0.00001511809],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01373715,0.0001481759,0.9809106,0.00009436382,0.00003736868,0.00003565163,0.0001819644,0.0004535805,0.004401207],"genre_scores_gemma":[0.2405583,0.0003361553,0.7527441,0.00006500864,0.00004947795,0.000137611,0.000747829,0.0004364592,0.004925085],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005036933,"threshold_uncertainty_score":0.01685017,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Prosenjit Bose","is_ca":true},{"name":"Luc Devroye","is_ca":true},{"name":"William Evans","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02225489005613522,"gpt":0.2738408414536223,"spread":0.251585951397487,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001116657,0.0004708015,0.001051142,0.0009909091,0.001688622,0.001850552,0.001491862,0.00203891,0.01482316],"category_scores_gemma":[0.01187469,0.0008695538,0.001055952,0.0009563453,0.001552477,0.00363851,0.001886003,0.002332356,0.003331268],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005942479,"about_ca_system_score_gemma":0.0007123832,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001479085,"about_ca_topic_score_gemma":0.002580508,"domain_scores_codex":[0.9985581,0.0002230834,0.00006624254,0.0003902853,0.000628831,0.0001334507],"domain_scores_gemma":[0.9928271,0.003321278,0.0005365871,0.001913513,0.0009829858,0.0004185191],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0008221146,0.0001046007,0.004017995,0.0005605196,0.0001474819,0.0005866972,0.000755502,0.02985965,0.01464351,0.5986893,0.04170617,0.3081065],"study_design_scores_gemma":[0.0002451928,0.0002942151,0.001474821,0.0001804409,0.00007408544,0.001491234,0.0007915198,0.09036197,0.01125289,0.7833182,0.1104181,0.00009743994],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08503426,0.001666355,0.8556445,0.008009024,0.0007917142,0.0001346726,0.0008428831,0.001989944,0.04588668],"genre_scores_gemma":[0.4159459,0.0007957727,0.5553167,0.001521467,0.0001739126,0.0001611901,0.0008510666,0.0007007181,0.02453327],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01482316,"threshold_uncertainty_score":0.04958844,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Timothy M. Chan","is_ca":true},{"name":"Bashir Sadjad","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01009771432731352,"gpt":0.2581873079074709,"spread":0.2480895935801574,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002018028,0.00136929,0.001919438,0.0009076089,0.000505463,0.001486325,0.001750215,0.001589739,0.002701149],"category_scores_gemma":[0.009185926,0.0008594266,0.0009538502,0.001515162,0.001404308,0.003960915,0.002072444,0.001975001,0.0004471739],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001359015,"about_ca_system_score_gemma":0.0006686434,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003442482,"about_ca_topic_score_gemma":0.001426784,"domain_scores_codex":[0.9990855,0.000254404,0.00006147583,0.0002863188,0.0001938012,0.0001185269],"domain_scores_gemma":[0.9947397,0.003989637,0.0004677635,0.0003726494,0.0002027879,0.0002274698],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003028058,0.0000598685,0.0008827244,0.0001562825,0.00007970003,0.0001275212,0.0001006984,0.8778149,0.002370297,0.0783812,0.001586879,0.0381371],"study_design_scores_gemma":[0.00001522,0.00003050325,0.000106037,0.000006171633,0.00000664621,0.00001312041,0.000009518948,0.974116,0.0004373206,0.02482635,0.0004286815,0.000004351347],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06342205,0.001395604,0.9322438,0.0004555474,0.00008412229,0.00004182792,0.000100383,0.0003718612,0.001884732],"genre_scores_gemma":[0.6616038,0.002405986,0.327165,0.0001668969,0.0002755464,0.0002845061,0.000451278,0.0003409275,0.00730601],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003442482,"threshold_uncertainty_score":0.01067251,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Stéphane Durocher","is_ca":true},{"name":"David Kirkpatrick","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0178978071153125,"gpt":0.2866266356797827,"spread":0.2687288285644702,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000934186,0.0009540647,0.0008460137,0.0009543342,0.0005325794,0.001433172,0.002050056,0.001145256,0.002496078],"category_scores_gemma":[0.006423016,0.0004788958,0.0008836721,0.000821056,0.001320515,0.001468984,0.002451067,0.0013031,0.001011518],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001550021,"about_ca_system_score_gemma":0.0009471144,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00405011,"about_ca_topic_score_gemma":0.002493717,"domain_scores_codex":[0.9989995,0.0002901688,0.00004712328,0.0001560305,0.0003179376,0.0001891188],"domain_scores_gemma":[0.9983985,0.0006203771,0.0003138508,0.0002543564,0.0002756193,0.0001373307],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002868696,0.00005249711,0.001161464,0.00006637524,0.00002173014,0.0001738392,0.0002606857,0.8433151,0.004512713,0.1227145,0.001174445,0.02625989],"study_design_scores_gemma":[0.00001819854,0.00007836709,0.0001774794,0.00001467292,0.000004141556,0.000102528,0.00004459043,0.9753149,0.002048272,0.02011156,0.00206826,0.00001705233],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04680441,0.0001270816,0.9479358,0.00008021506,0.00002384157,0.00004591977,0.00008622956,0.0003276858,0.004568817],"genre_scores_gemma":[0.7063174,0.0002631113,0.2876802,0.0000596065,0.00002636626,0.0001631304,0.0003068968,0.0001502421,0.005032918],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00405011,"threshold_uncertainty_score":0.0112462,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Timothy M. Chan","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01395240561955737,"gpt":0.2890638722659,"spread":0.2751114666463426,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004601526,0.001712956,0.002151252,0.001847908,0.002718288,0.005776294,0.007550356,0.003709674,0.009901887],"category_scores_gemma":[0.02813895,0.001700244,0.002914413,0.005646111,0.005434466,0.02225438,0.009881315,0.008794151,0.002264464],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002954673,"about_ca_system_score_gemma":0.002016985,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005305208,"about_ca_topic_score_gemma":0.002263442,"domain_scores_codex":[0.9904323,0.001509803,0.0006806731,0.002697721,0.003486837,0.001192752],"domain_scores_gemma":[0.9521408,0.02414357,0.002937462,0.01619822,0.003520596,0.001059347],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000990857,0.000512012,0.003554422,0.001109383,0.0001723727,0.0004377404,0.001136266,0.1211228,0.007690474,0.3437817,0.03714401,0.482348],"study_design_scores_gemma":[0.0002469658,0.0003133361,0.001774413,0.0001681963,0.0001214245,0.001335917,0.0008662022,0.4305415,0.01795078,0.5034378,0.04303791,0.0002055383],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01520431,0.001536314,0.9694293,0.005040395,0.000244813,0.0001445887,0.0007166759,0.00169071,0.005993008],"genre_scores_gemma":[0.27902,0.003366476,0.6961744,0.001656035,0.002029334,0.0006836662,0.003105773,0.001157833,0.01280652],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009901887,"threshold_uncertainty_score":0.0331251,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Asish Mukhopadhyay","is_ca":true},{"name":"S. Venugopal Rao","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01040428912162918,"gpt":0.2802656006254461,"spread":0.269861311503817,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001000428,0.001077977,0.001662206,0.001205265,0.000894807,0.001227342,0.002023192,0.0008863616,0.004384174],"category_scores_gemma":[0.004458485,0.0006516249,0.0008750695,0.002222036,0.0009831444,0.002839994,0.003277207,0.000768276,0.001667961],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005232545,"about_ca_system_score_gemma":0.001232907,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002537512,"about_ca_topic_score_gemma":0.003537547,"domain_scores_codex":[0.9988554,0.0002272321,0.0001013598,0.0002730732,0.0003183589,0.0002245614],"domain_scores_gemma":[0.9980662,0.0009970663,0.0002499496,0.0003105501,0.0002651808,0.0001109334],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.002705042,0.0002272463,0.005566236,0.001023251,0.0001360919,0.0009617263,0.0008981064,0.2207131,0.06336329,0.05784675,0.01785027,0.6287089],"study_design_scores_gemma":[0.0003625598,0.0004957875,0.001396429,0.0001079072,0.000076307,0.0006625214,0.0004988287,0.911469,0.03176102,0.03711155,0.0159563,0.0001018437],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06604438,0.0004940578,0.9252598,0.000216436,0.00005512888,0.0001631154,0.0002441028,0.002968791,0.004554179],"genre_scores_gemma":[0.1113203,0.0002270824,0.8852081,0.00008469685,0.00002551111,0.0002015205,0.000822699,0.0003007935,0.001809329],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004384174,"threshold_uncertainty_score":0.0146665,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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)","authors":[{"name":"Marina L. Gavrilova","is_ca":true},{"name":"Jon Rokne","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01599211787042112,"gpt":0.2824595603880669,"spread":0.2664674425176458,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000837755,0.0003379862,0.0008540436,0.0006151994,0.0008148293,0.0009709945,0.00122022,0.0008372156,0.001467301],"category_scores_gemma":[0.002442057,0.0004531466,0.0005424161,0.0007079091,0.0009097145,0.001255669,0.001269701,0.0006102214,0.0001723492],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001132405,"about_ca_system_score_gemma":0.001102862,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004349418,"about_ca_topic_score_gemma":0.001684748,"domain_scores_codex":[0.9993718,0.0001708547,0.00003356686,0.00008957736,0.0002558838,0.00007829195],"domain_scores_gemma":[0.9990946,0.0005118986,0.00009425844,0.0001038959,0.0001291262,0.00006624299],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004426276,0.00002342568,0.0004671449,0.00001733836,0.00001311199,0.00005934172,0.00003581548,0.979814,0.001599526,0.01373513,0.0001137833,0.004077071],"study_design_scores_gemma":[0.000008393283,0.000007707554,0.00006868148,0.000001041905,0.000001747087,0.000009478483,0.000006559207,0.9960084,0.0007609057,0.002872752,0.0002501344,0.000004140637],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1526506,0.0001484246,0.8435569,0.0001983621,0.00003716426,0.00006466843,0.00007238702,0.0002425389,0.003028766],"genre_scores_gemma":[0.8459844,0.0001066939,0.1518073,0.00005330815,0.00001303187,0.0001209436,0.0001331395,0.00007200496,0.001709186],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004349418,"threshold_uncertainty_score":0.008648217,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Thérèse Biedl","is_ca":true},{"name":"Brendan Madden","is_ca":false},{"name":"Ioannis G. Tollis","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01981290332333454,"gpt":0.3270889949459064,"spread":0.3072760916225719,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001349251,0.0009184285,0.0009885192,0.002033894,0.0007628549,0.001972305,0.002537115,0.001257856,0.006641056],"category_scores_gemma":[0.004007728,0.0007431577,0.001329996,0.002877375,0.001570211,0.00359279,0.002752139,0.00216646,0.00219665],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006678852,"about_ca_system_score_gemma":0.001019688,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001369852,"about_ca_topic_score_gemma":0.001638341,"domain_scores_codex":[0.9986023,0.0003928444,0.00007174849,0.0002279084,0.0005893843,0.0001157838],"domain_scores_gemma":[0.9987957,0.0004050859,0.00009312853,0.0003450338,0.0002852047,0.00007581375],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0000679871,0.00006718695,0.0003832648,0.0002553496,0.00003591326,0.000105269,0.0003121721,0.07869601,0.008525383,0.5673757,0.006403331,0.3377724],"study_design_scores_gemma":[0.00004845495,0.0000949818,0.0001669259,0.00007125908,0.00002742508,0.0003305326,0.000115208,0.6291593,0.007487621,0.2992026,0.06323178,0.00006405063],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0004312965,0.00005023617,0.9984609,0.00001898831,0.00001699974,0.00001761855,0.00001019677,0.0001350633,0.0008587067],"genre_scores_gemma":[0.02052885,0.0003395316,0.97666,0.00005066187,0.00004930918,0.0001219901,0.00009459705,0.0002592793,0.001895696],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006641056,"threshold_uncertainty_score":0.02221656,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Prosenjit Bose","is_ca":true},{"name":"Marc van Kreveld","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01660081937695202,"gpt":0.2909853170369125,"spread":0.2743844976599605,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001195894,0.0009333102,0.001076818,0.00122581,0.001069808,0.002123094,0.002239872,0.001140014,0.00358498],"category_scores_gemma":[0.009071864,0.0009373928,0.001747308,0.001611651,0.002387471,0.00799846,0.002753119,0.002132874,0.001078113],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009803487,"about_ca_system_score_gemma":0.0007794563,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003972174,"about_ca_topic_score_gemma":0.003739205,"domain_scores_codex":[0.997844,0.0003721936,0.0001791671,0.0006730479,0.0005401306,0.0003914979],"domain_scores_gemma":[0.9931688,0.003212709,0.0006032608,0.002065258,0.0007104076,0.0002396523],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0007515663,0.0004216902,0.01840045,0.0006878356,0.00008418496,0.001679751,0.001813287,0.203372,0.0464736,0.2634446,0.008431324,0.4544398],"study_design_scores_gemma":[0.00003572874,0.0002132115,0.003871605,0.00009675747,0.00003330142,0.001306304,0.0004348602,0.7544368,0.01764857,0.2092222,0.01262008,0.0000806406],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1686833,0.0005818706,0.8140097,0.0004103245,0.00009280362,0.0002438702,0.0002755277,0.001287819,0.01441493],"genre_scores_gemma":[0.53544,0.0007682825,0.4551237,0.0004056373,0.0002455371,0.0002914307,0.001436459,0.0003360097,0.005952948],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003972174,"threshold_uncertainty_score":0.01199293,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Pengpeng Wang","is_ca":true},{"name":"Ramesh Krishnamurti","is_ca":true},{"name":"Kamal Gupta","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01205896636511554,"gpt":0.2997036074054154,"spread":0.2876446410402999,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006860593,0.001032751,0.001347878,0.0003844892,0.0005233607,0.001307258,0.00206692,0.001484976,0.005385068],"category_scores_gemma":[0.001914929,0.0006089424,0.001065899,0.0009055522,0.0007589654,0.003465025,0.001303505,0.001725198,0.0004835166],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007509771,"about_ca_system_score_gemma":0.0008044227,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002589149,"about_ca_topic_score_gemma":0.003078791,"domain_scores_codex":[0.9992841,0.0002213993,0.00003271169,0.0002358467,0.0001199667,0.0001059187],"domain_scores_gemma":[0.9989987,0.0005458712,0.0001156292,0.0001860445,0.0000727209,0.00008094975],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0004593692,0.0001846028,0.00108379,0.0004874502,0.0001319951,0.0006744843,0.0002359206,0.784889,0.006168247,0.106242,0.008111833,0.09133134],"study_design_scores_gemma":[0.0001061797,0.0002248524,0.0004389874,0.00002457573,0.00004327072,0.0003812185,0.0001433092,0.912872,0.002097301,0.07530287,0.008334769,0.00003068605],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08381157,0.0005227385,0.9084277,0.0004986345,0.00008201779,0.0001462676,0.0005904861,0.0005225989,0.005398057],"genre_scores_gemma":[0.4653206,0.0006560848,0.5224018,0.0002092079,0.00009796581,0.0004052674,0.002021178,0.0003197459,0.008568166],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005385068,"threshold_uncertainty_score":0.01801485,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Disjoint sets; Upper and lower bounds; Discrete mathematics; Graph","authors":[{"name":"Prosenjit Bose","is_ca":true},{"name":"André van Renssen","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01588797836358528,"gpt":0.2665921095269326,"spread":0.2507041311633473,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001467324,0.001137869,0.0009407059,0.001831036,0.001290083,0.001761753,0.001789096,0.0009213454,0.006291613],"category_scores_gemma":[0.01147766,0.0008336714,0.0009302009,0.002497893,0.001249456,0.006621412,0.00213092,0.001597489,0.0007071977],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001384578,"about_ca_system_score_gemma":0.0007355027,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002068753,"about_ca_topic_score_gemma":0.002576809,"domain_scores_codex":[0.9981241,0.0004602285,0.0001066757,0.0004422852,0.0005306532,0.000335955],"domain_scores_gemma":[0.9916117,0.004877812,0.001258592,0.001010456,0.0007364525,0.0005050709],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0006776425,0.0002166608,0.004508243,0.0005379132,0.0001582831,0.0008969112,0.0005865047,0.2461554,0.0230808,0.6394529,0.008038507,0.0756903],"study_design_scores_gemma":[0.00007904982,0.0001712927,0.0025778,0.000111873,0.0001220257,0.0009166543,0.0002921076,0.3880794,0.009919515,0.5863873,0.01126262,0.00008055422],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5636948,0.001740872,0.3837544,0.00135104,0.00007264304,0.0002079703,0.001195583,0.0008413646,0.04714133],"genre_scores_gemma":[0.8698218,0.001435336,0.1186943,0.0004905628,0.0001082699,0.0002798843,0.001602265,0.000397673,0.007169883],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.006291613,"threshold_uncertainty_score":0.02104747,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Serge Gosselin","is_ca":true},{"name":"Carl Ollivier‐Gooch","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01679481818542143,"gpt":0.2632931531319128,"spread":0.2464983349464913,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007570862,0.0008729979,0.001452238,0.001045042,0.0005953815,0.001229264,0.001966474,0.0009289861,0.003175741],"category_scores_gemma":[0.004546876,0.001065636,0.001198853,0.0009033267,0.0009309842,0.001333368,0.00264532,0.001524605,0.0009416402],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006436022,"about_ca_system_score_gemma":0.001109441,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00307475,"about_ca_topic_score_gemma":0.00363398,"domain_scores_codex":[0.9989875,0.0001307294,0.00006750416,0.0001855753,0.0005509899,0.00007767725],"domain_scores_gemma":[0.9987697,0.000500373,0.0001263293,0.0002888647,0.0002647557,0.00004992465],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000107705,0.00003192942,0.0009742347,0.0001948841,0.00005188547,0.0002485906,0.0004776008,0.7601721,0.02088591,0.04225553,0.003157357,0.1714423],"study_design_scores_gemma":[0.00001276983,0.00002891175,0.0001092466,0.00001769392,0.000006247138,0.00006453528,0.00008751466,0.9759635,0.004826575,0.01450653,0.00435891,0.0000175672],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008120102,0.00002781636,0.9907044,0.00001963276,0.000009372694,0.00005328793,0.0000705558,0.0003161039,0.0006787829],"genre_scores_gemma":[0.1189956,0.00009901106,0.8786992,0.00003131299,0.00001090835,0.0002513464,0.0005036572,0.000433201,0.0009758435],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003175741,"threshold_uncertainty_score":0.01062387,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Mustaq Ahmed","is_ca":false},{"name":"Anna Lubiw","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03376333864733476,"gpt":0.3009306287747315,"spread":0.2671672901273968,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001134791,0.001914285,0.001744274,0.001361047,0.001365964,0.002411044,0.003595473,0.002117715,0.01490678],"category_scores_gemma":[0.0056709,0.001221776,0.001414849,0.003339928,0.001010993,0.005700599,0.003507839,0.003342075,0.00552543],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001695651,"about_ca_system_score_gemma":0.002649122,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00555042,"about_ca_topic_score_gemma":0.007862715,"domain_scores_codex":[0.9985065,0.0002375664,0.0001463347,0.000402052,0.0004575979,0.0002499755],"domain_scores_gemma":[0.9973664,0.001248406,0.0001115698,0.0007645686,0.0003938724,0.0001152694],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003755204,0.0003449595,0.0009880256,0.0007434062,0.00009586556,0.000208541,0.0003543069,0.2069681,0.004085648,0.1204313,0.04762376,0.6177806],"study_design_scores_gemma":[0.0001947467,0.00009829523,0.000189312,0.0001032113,0.00004400628,0.0001788061,0.0001974752,0.6274688,0.002082701,0.3435877,0.02581548,0.00003950691],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.006228086,0.0007816338,0.9799329,0.0005634347,0.0001036627,0.0001815306,0.0006404984,0.0042149,0.007353376],"genre_scores_gemma":[0.04855147,0.0005356428,0.9430778,0.0001903798,0.00006627487,0.0002347169,0.001599554,0.0006946796,0.005049508],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01490678,"threshold_uncertainty_score":0.04986817,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Emilio Di Giacomo","is_ca":false},{"name":"Walter Didimo","is_ca":false},{"name":"Giuseppe Liotta","is_ca":false},{"name":"Henk Meijer","is_ca":false},{"name":"Stephen Wismath","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01085905222239662,"gpt":0.2885099065773357,"spread":0.277650854354939,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005682378,0.0009279135,0.00123302,0.0008672873,0.0005725485,0.00147937,0.002091899,0.001365025,0.005073305],"category_scores_gemma":[0.006738833,0.0009994773,0.0009699335,0.001476576,0.001279474,0.00457264,0.00244632,0.001584151,0.000563068],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008777108,"about_ca_system_score_gemma":0.0003558653,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001382772,"about_ca_topic_score_gemma":0.001299416,"domain_scores_codex":[0.999099,0.0001877898,0.00004577594,0.0002200361,0.0003221574,0.000125221],"domain_scores_gemma":[0.9956194,0.002724988,0.0005360582,0.0007265488,0.0002091471,0.0001838516],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003388892,0.0001242982,0.001767426,0.0002983016,0.00007239747,0.000398275,0.0003905408,0.853829,0.01421168,0.06505422,0.001114476,0.06240044],"study_design_scores_gemma":[0.00004073547,0.0001285707,0.0007707241,0.00002816778,0.00002343676,0.0002478934,0.0001496527,0.877114,0.008055096,0.1114196,0.001994162,0.00002785876],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3248197,0.0002805409,0.6702289,0.0002330915,0.00001515541,0.0001093807,0.0004200804,0.0005285178,0.003364562],"genre_scores_gemma":[0.8090429,0.0004892721,0.1852985,0.00004638725,0.00003622475,0.0001411368,0.001299407,0.0002534215,0.003392596],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005073305,"threshold_uncertainty_score":0.01697189,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"STEPHEN WISMATH","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.007230949104351661,"gpt":0.2539805635127922,"spread":0.2467496144084405,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005746812,0.0007135128,0.0008163548,0.001395334,0.0003804078,0.001151114,0.0008894628,0.0009479708,0.003489554],"category_scores_gemma":[0.00396084,0.0006119451,0.0009118601,0.0012754,0.0008053938,0.002233798,0.001588732,0.001291847,0.0008734238],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005233632,"about_ca_system_score_gemma":0.0008457949,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001824788,"about_ca_topic_score_gemma":0.002451428,"domain_scores_codex":[0.9991649,0.0001462266,0.00004061605,0.0002104393,0.0003621505,0.00007569227],"domain_scores_gemma":[0.9983287,0.0007270327,0.0002150469,0.0004105187,0.0002590687,0.00005959632],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0005640361,0.0001041543,0.002456295,0.0003672925,0.00006733612,0.0003869151,0.000249193,0.3895005,0.05018863,0.09294394,0.003671288,0.4595005],"study_design_scores_gemma":[0.00002855571,0.0001043574,0.000914299,0.00003060287,0.00002099361,0.0002537054,0.0001052766,0.8916071,0.02828269,0.0735063,0.005111028,0.00003510186],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01023648,0.00004547485,0.9883261,0.00004186991,0.00000495325,0.00002251641,0.0001298597,0.0002788269,0.0009138664],"genre_scores_gemma":[0.2156924,0.0002021937,0.780288,0.00003203529,0.00001810041,0.00006812357,0.00143965,0.0001885489,0.002070832],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003489554,"threshold_uncertainty_score":0.01167375,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Peter Braß","is_ca":false},{"name":"Ferrán Hurtado","is_ca":false},{"name":"Benjamin Lafreniere","is_ca":true},{"name":"Anna Lubiw","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01509275392706256,"gpt":0.2819490346999965,"spread":0.2668562807729339,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002022065,0.001265775,0.002099943,0.00160995,0.001339396,0.003460015,0.00290717,0.001873151,0.009582384],"category_scores_gemma":[0.01707733,0.0008211307,0.001254387,0.00241497,0.002220579,0.005589278,0.003790253,0.002061812,0.001572092],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001884082,"about_ca_system_score_gemma":0.0007282343,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001261726,"about_ca_topic_score_gemma":0.0009656906,"domain_scores_codex":[0.9978625,0.0005151638,0.0001059443,0.0004004552,0.0005355359,0.0005803377],"domain_scores_gemma":[0.9857473,0.01095465,0.0006654329,0.001457702,0.0004908542,0.0006840072],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.003488714,0.000509008,0.008587053,0.001527272,0.0002761332,0.0007619281,0.001131499,0.5200708,0.04904341,0.2223316,0.02927338,0.1629992],"study_design_scores_gemma":[0.0001789041,0.0004551374,0.003255756,0.0001887916,0.000162293,0.001016093,0.000273044,0.7675031,0.01234057,0.2000492,0.01448908,0.00008809205],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5003548,0.009388068,0.4001592,0.005054051,0.0004902419,0.0002365598,0.001971597,0.001770387,0.08057509],"genre_scores_gemma":[0.9083979,0.002746179,0.07948349,0.0005285825,0.0005181559,0.0002712267,0.0008201795,0.0003835257,0.006850785],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.009582384,"threshold_uncertainty_score":0.03205621,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Greg Aloupis","is_ca":false},{"name":"Prosenjit Bose","is_ca":true},{"name":"Erik D. Demaine","is_ca":false},{"name":"Stefan Langerman","is_ca":false},{"name":"Henk Meijer","is_ca":false},{"name":"Mark Overmars","is_ca":false},{"name":"Godfried Toussaint","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01581473384769901,"gpt":0.2782197891865296,"spread":0.2624050553388306,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005567404,0.0007812104,0.001165048,0.0007842881,0.0008481183,0.002032975,0.001362924,0.001031367,0.0060202],"category_scores_gemma":[0.005893437,0.0007025269,0.001189962,0.001277299,0.001204342,0.002961222,0.001687747,0.0009798076,0.001107636],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001035897,"about_ca_system_score_gemma":0.0009851336,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002156401,"about_ca_topic_score_gemma":0.003695919,"domain_scores_codex":[0.9988175,0.0002111611,0.0001169847,0.0002804872,0.0003462364,0.0002275413],"domain_scores_gemma":[0.9969347,0.001624899,0.000325587,0.000605621,0.0003394283,0.0001697205],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001154631,0.0003227734,0.008820598,0.0006469453,0.0001070577,0.001195216,0.00064957,0.5173606,0.05828054,0.07567759,0.005935943,0.3298485],"study_design_scores_gemma":[0.0001415116,0.0003563308,0.001606031,0.00004510451,0.00005247296,0.0003219012,0.0004411552,0.826885,0.03523679,0.1279821,0.006882702,0.00004889879],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"methods","genre_scores_codex":[0.4934127,0.0001894689,0.4899634,0.0003436189,0.0001054857,0.0003649901,0.0008683636,0.002510407,0.01224165],"genre_scores_gemma":[0.6401065,0.0001500275,0.3520146,0.00008756921,0.00003896225,0.0001629268,0.002796003,0.0004063713,0.004237015],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.0060202,"threshold_uncertainty_score":0.02013952,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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)","authors":[{"name":"Peter Braß","is_ca":false},{"name":"Laura Heinrich-Litan","is_ca":false},{"name":"Pat Morin","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0144681672533184,"gpt":0.2792880748208776,"spread":0.2648199075675592,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003475953,0.0005129094,0.001027417,0.001475023,0.0005318038,0.001109296,0.0008336962,0.0006179302,0.003302447],"category_scores_gemma":[0.003855915,0.0004143501,0.0004793991,0.001165251,0.00071521,0.001818566,0.001466272,0.0005349462,0.0006120303],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005456578,"about_ca_system_score_gemma":0.0007392587,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001637784,"about_ca_topic_score_gemma":0.002126614,"domain_scores_codex":[0.9994963,0.0000613584,0.0000288179,0.0001388798,0.0001988704,0.0000757597],"domain_scores_gemma":[0.9986821,0.0005771857,0.0002043857,0.0001849859,0.0002347889,0.0001165066],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001907053,0.0002415318,0.02686197,0.0005570768,0.0002206674,0.0006886995,0.0005288459,0.3165248,0.06824605,0.04567971,0.0170489,0.5214946],"study_design_scores_gemma":[0.0001095863,0.0002126028,0.004591187,0.00002674396,0.00003697737,0.0003336375,0.0002267979,0.9343484,0.0270637,0.02790396,0.005104232,0.00004212152],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.4674033,0.0006583971,0.5172291,0.0004650815,0.00008933873,0.0001597785,0.001156397,0.003184107,0.009654519],"genre_scores_gemma":[0.7945795,0.0002154081,0.2021413,0.00004010188,0.0000555909,0.0001155145,0.001175932,0.0002582852,0.001418256],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003302447,"threshold_uncertainty_score":0.01104784,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Mark Keil","is_ca":true},{"name":"David M. Mount","is_ca":false},{"name":"Stephen Wismath","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01660826354727331,"gpt":0.2881189797205795,"spread":0.2715107161733062,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004272835,0.0006529055,0.0007489977,0.00100606,0.0005352196,0.001342534,0.001162888,0.0005272095,0.003386579],"category_scores_gemma":[0.003689033,0.0004528961,0.0008018314,0.001173659,0.0008550672,0.00225335,0.001838292,0.0008508591,0.0006226923],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007526051,"about_ca_system_score_gemma":0.0009598547,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004365749,"about_ca_topic_score_gemma":0.005402786,"domain_scores_codex":[0.999411,0.00009673457,0.00004217252,0.0001031344,0.0002164398,0.0001304994],"domain_scores_gemma":[0.9986093,0.0005395804,0.0001849292,0.0003612439,0.0002160868,0.00008889481],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001181245,0.0001587277,0.004005709,0.0003287278,0.0000813217,0.0004452126,0.0007778803,0.3962702,0.05710851,0.1031928,0.005247913,0.4312017],"study_design_scores_gemma":[0.0000726818,0.0001241705,0.0004579957,0.00001917655,0.00001680987,0.000125388,0.00009334896,0.9296785,0.02146462,0.04416727,0.003758347,0.0000217621],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04230919,0.00008796732,0.9535024,0.00006884324,0.0000141832,0.00005114625,0.00009251201,0.0016362,0.002237579],"genre_scores_gemma":[0.3670257,0.0001026406,0.6297712,0.00004407678,0.00001779372,0.00009505622,0.0004453733,0.0003420912,0.00215608],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004365749,"threshold_uncertainty_score":0.01132923,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Olivier Devillers","is_ca":false},{"name":"Vida Dujmović","is_ca":true},{"name":"Hazel Everett","is_ca":false},{"name":"Samuel Hornus","is_ca":false},{"name":"Sue Whitesides","is_ca":true},{"name":"STEVE WISMATH","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.008923220077508166,"gpt":0.2787615474502688,"spread":0.2698383273727606,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000944777,0.0009401965,0.002311519,0.002897671,0.00136765,0.002583752,0.003302221,0.001572545,0.001546059],"category_scores_gemma":[0.009571872,0.001603606,0.001334256,0.005370016,0.0009210461,0.006159553,0.003929671,0.001589831,0.0007901132],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009046265,"about_ca_system_score_gemma":0.001355097,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007813316,"about_ca_topic_score_gemma":0.007310684,"domain_scores_codex":[0.9981087,0.0001780635,0.0001528102,0.0004553927,0.0008398431,0.0002652103],"domain_scores_gemma":[0.9949391,0.001715654,0.0008116727,0.001731542,0.0005797365,0.0002223073],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.002061042,0.0004056611,0.01006918,0.000628923,0.000246731,0.0009784402,0.001640574,0.2645504,0.0858935,0.02086477,0.007695386,0.6049653],"study_design_scores_gemma":[0.0002576349,0.000489058,0.005149139,0.00008198241,0.0002241801,0.0006554694,0.0006801908,0.8563308,0.0748991,0.05313462,0.007963172,0.0001346622],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3148749,0.0008588707,0.6754834,0.0004751379,0.00005774872,0.0001202881,0.001517736,0.003581911,0.003030082],"genre_scores_gemma":[0.6469811,0.0005171358,0.3460532,0.00006379376,0.00007733702,0.00008819556,0.004447562,0.0003772358,0.001394501],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007813316,"threshold_uncertainty_score":0.01553565,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Daniel Archambault","is_ca":true},{"name":"WILLAM EVANS","is_ca":true},{"name":"David Kirkpatrick","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01670172683024567,"gpt":0.3065674018432316,"spread":0.2898656750129859,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004004847,0.0006699057,0.001576061,0.001833389,0.0009870788,0.001568323,0.001434235,0.001132461,0.003743008],"category_scores_gemma":[0.004174334,0.0006525136,0.001085001,0.001693741,0.0007099988,0.003711336,0.001747549,0.001128734,0.0003672531],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006750202,"about_ca_system_score_gemma":0.000872651,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004668729,"about_ca_topic_score_gemma":0.005052351,"domain_scores_codex":[0.9994647,0.00005674739,0.00003427151,0.0001586972,0.0001667762,0.0001187908],"domain_scores_gemma":[0.9988795,0.0005276251,0.0001807243,0.0001299808,0.0001251278,0.0001570223],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001042867,0.0002996008,0.01978153,0.001013332,0.0001970919,0.0008434518,0.0008085346,0.6911831,0.015024,0.0343532,0.01326556,0.2221876],"study_design_scores_gemma":[0.00009002948,0.0001522673,0.00618395,0.00007600224,0.00006451678,0.0003378337,0.0007480709,0.9088735,0.005950232,0.07197208,0.005497591,0.00005404374],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5790574,0.001252653,0.403781,0.0009262442,0.00007949618,0.0001615675,0.006368971,0.001545109,0.006827591],"genre_scores_gemma":[0.7892949,0.0004027275,0.1970957,0.0000839042,0.00006503195,0.00009574908,0.01038254,0.0002035679,0.002375924],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004668729,"threshold_uncertainty_score":0.01252168,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Richard J. Nowakowski","is_ca":true},{"name":"Norbert Zeh","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01354134511759878,"gpt":0.3188351588273645,"spread":0.3052938137097657,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008329334,0.000683674,0.001163366,0.0006976414,0.001013882,0.0009540238,0.001688841,0.001708062,0.005729285],"category_scores_gemma":[0.01044701,0.0006740832,0.0006942178,0.0008666245,0.001245936,0.003038494,0.003504251,0.001003114,0.0009097054],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00115326,"about_ca_system_score_gemma":0.00102495,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003540632,"about_ca_topic_score_gemma":0.00341725,"domain_scores_codex":[0.9991665,0.0001823986,0.00004862503,0.0001933212,0.0002272487,0.0001819477],"domain_scores_gemma":[0.9968918,0.001562762,0.0003318279,0.0006828408,0.0003098843,0.0002209093],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0007454085,0.00009506461,0.001749425,0.0006174626,0.0000839291,0.0004334379,0.0006310373,0.6947532,0.02336373,0.1144062,0.01814754,0.1449736],"study_design_scores_gemma":[0.0001768913,0.0001284348,0.0004340643,0.00004737707,0.0000329667,0.0002246798,0.0001992928,0.8458565,0.005260157,0.1420026,0.005606149,0.00003091476],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1618617,0.0009129228,0.8068577,0.001242217,0.0001692213,0.0002442417,0.0007633505,0.002646839,0.02530188],"genre_scores_gemma":[0.572863,0.000435217,0.4167531,0.0002607329,0.0000841098,0.0002431864,0.001279481,0.0005299627,0.007551258],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005729285,"threshold_uncertainty_score":0.01916635,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Asish Mukhopadhyay","is_ca":true},{"name":"Eugene Greene","is_ca":true},{"name":"S. Venugopal Rao","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01519970402900029,"gpt":0.2867783530060181,"spread":0.2715786489770178,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006413049,0.001543086,0.001755175,0.001878179,0.001218518,0.001712652,0.002310551,0.001468883,0.007537022],"category_scores_gemma":[0.004827064,0.0008474716,0.001087343,0.003305679,0.001644671,0.002890548,0.002930554,0.001243271,0.001767089],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007716693,"about_ca_system_score_gemma":0.0008644406,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003414121,"about_ca_topic_score_gemma":0.004745101,"domain_scores_codex":[0.998984,0.0001435357,0.00004802369,0.0001801726,0.0005190309,0.00012525],"domain_scores_gemma":[0.9978772,0.001240788,0.0002699069,0.0002433265,0.0002844046,0.00008434366],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0006799155,0.0002278551,0.002535638,0.0008735309,0.0001071545,0.0009068652,0.0006718945,0.3964384,0.02474569,0.03145508,0.007801159,0.5335568],"study_design_scores_gemma":[0.0001209453,0.0002276162,0.0008965307,0.00008095159,0.00004738009,0.0005792386,0.000367674,0.9431855,0.01432679,0.03280038,0.007308661,0.000058252],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02709275,0.0002197298,0.9664586,0.000142584,0.00004017173,0.0002326968,0.0001540654,0.0007910554,0.004868439],"genre_scores_gemma":[0.0903866,0.0003313278,0.9059158,0.00004320849,0.00003718193,0.0002140872,0.0004965914,0.0002069511,0.002368265],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007537022,"threshold_uncertainty_score":0.0252139,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Thérèse Biedl","is_ca":true},{"name":"Martin Vatshelle","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01220426644043338,"gpt":0.2845736678700848,"spread":0.2723694014296514,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006321655,0.001237699,0.001215679,0.0008110877,0.0009665433,0.002619645,0.001889159,0.002389517,0.005595473],"category_scores_gemma":[0.005557955,0.0008282519,0.001424078,0.001733481,0.001597581,0.008171794,0.002113591,0.002909298,0.0007697663],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001252758,"about_ca_system_score_gemma":0.0005418197,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001747308,"about_ca_topic_score_gemma":0.001181115,"domain_scores_codex":[0.9988254,0.0001983898,0.00007329434,0.0004080402,0.0003283459,0.0001664316],"domain_scores_gemma":[0.9949918,0.003685754,0.0005088698,0.0004036104,0.0002220454,0.0001878833],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0008115722,0.0004826364,0.004771544,0.001473975,0.0002626525,0.001900632,0.001539822,0.4828076,0.02750701,0.307652,0.01109186,0.1596986],"study_design_scores_gemma":[0.0001821524,0.0002213962,0.001638055,0.0001358414,0.0001439001,0.001497792,0.000911514,0.3464298,0.01971276,0.6167766,0.01226441,0.0000857604],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3658285,0.001487394,0.6125764,0.002639564,0.0001166679,0.0003075494,0.002298537,0.0007399707,0.01400543],"genre_scores_gemma":[0.8418624,0.002319903,0.1417173,0.0003007083,0.0002491194,0.0002811935,0.004777854,0.0002742917,0.00821717],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005595473,"threshold_uncertainty_score":0.01871872,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Marina L. Gavrilova","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0128850692596391,"gpt":0.3268844164189159,"spread":0.3139993471592768,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003543451,0.000450585,0.0006238507,0.0006429419,0.0005565454,0.0009171855,0.001095449,0.0005804598,0.003246982],"category_scores_gemma":[0.002777611,0.0002776559,0.0004389907,0.0007731417,0.0005136129,0.001268639,0.001134209,0.0007131171,0.001115499],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005573279,"about_ca_system_score_gemma":0.0009543448,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002931188,"about_ca_topic_score_gemma":0.004127891,"domain_scores_codex":[0.9996607,0.00004264766,0.0000212558,0.00005523188,0.0001828845,0.00003724946],"domain_scores_gemma":[0.9995456,0.0001954553,0.00003151223,0.00008096357,0.000125456,0.00002103462],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001779264,0.00005326928,0.0008853287,0.0003354655,0.00004123431,0.0002429729,0.0003926229,0.2765788,0.02077443,0.2435691,0.004896203,0.4520527],"study_design_scores_gemma":[0.0000801861,0.00004592623,0.0002645209,0.00004720088,0.00001925593,0.0001951713,0.00007448876,0.9063447,0.01235115,0.06684867,0.01370129,0.00002748837],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.005240042,0.0000807747,0.9926197,0.00003553648,0.00002715452,0.00001679556,0.00002630812,0.0003394294,0.001614414],"genre_scores_gemma":[0.09019182,0.0001604214,0.9075673,0.00002764494,0.00002388168,0.00005650991,0.0001103578,0.0001163404,0.001745756],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003246982,"threshold_uncertainty_score":0.01086229,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Thérèse Biedl","is_ca":true},{"name":"Stefan Huber","is_ca":true},{"name":"Peter Palfrader","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01090926882699216,"gpt":0.280200139695623,"spread":0.2692908708686308,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007155904,0.0006430329,0.0005178154,0.002099409,0.0008676536,0.001569542,0.00123015,0.001238031,0.008992258],"category_scores_gemma":[0.003580483,0.0004396608,0.0008226489,0.001394145,0.00177978,0.003423017,0.002527983,0.001363068,0.002160844],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006351976,"about_ca_system_score_gemma":0.0004814535,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004837359,"about_ca_topic_score_gemma":0.0005980902,"domain_scores_codex":[0.9990973,0.0001473647,0.00006859907,0.0002405558,0.0003171952,0.0001289378],"domain_scores_gemma":[0.9988846,0.0002504436,0.0002766612,0.000202157,0.0002683708,0.0001177378],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0000391155,0.00002890155,0.0002818366,0.00006759325,0.0000105378,0.0001149432,0.0001322124,0.02000257,0.006794067,0.9406026,0.001127194,0.03079842],"study_design_scores_gemma":[0.00002407776,0.00009150307,0.0002905633,0.00003602771,0.00001593388,0.0002658525,0.0002014622,0.1382634,0.00677323,0.8400375,0.0139667,0.00003366784],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04858166,0.0001305276,0.9387914,0.0001152245,0.00004746559,0.00008585322,0.0002043898,0.0002934082,0.01175014],"genre_scores_gemma":[0.5010599,0.0004858433,0.4767106,0.0001722288,0.00008862465,0.0003465948,0.0009048201,0.0004233309,0.01980791],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008992258,"threshold_uncertainty_score":0.03008211,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"David Kirkpatrick","is_ca":true},{"name":"Boting Yang","is_ca":true},{"name":"Sandra Zilles","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.008442197794523045,"gpt":0.2768270525292186,"spread":0.2683848547346956,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008423514,0.001591681,0.001575484,0.001864651,0.001193906,0.002049217,0.002928473,0.001661634,0.007881769],"category_scores_gemma":[0.004905345,0.0008741415,0.001589956,0.002350101,0.001241344,0.003740646,0.002583158,0.001483675,0.001482913],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00202339,"about_ca_system_score_gemma":0.002663293,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006759832,"about_ca_topic_score_gemma":0.01014617,"domain_scores_codex":[0.9988266,0.000138799,0.00009050137,0.0004191295,0.0002378956,0.0002871479],"domain_scores_gemma":[0.9968526,0.001882363,0.0003457606,0.0005164596,0.0002115628,0.000191243],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001177296,0.0002757885,0.004058948,0.0008065925,0.0001972794,0.0003116786,0.0004660567,0.6142739,0.01198825,0.02679711,0.02023854,0.3194087],"study_design_scores_gemma":[0.000210568,0.000137713,0.0007030982,0.00003073768,0.00004831447,0.0001632907,0.0002022565,0.9557741,0.003069333,0.03663396,0.002997434,0.00002904568],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09383231,0.000824651,0.8851955,0.0009640164,0.0001047897,0.0004011672,0.001950125,0.009039912,0.007687612],"genre_scores_gemma":[0.3406804,0.0002598533,0.6515525,0.0001535064,0.0000508388,0.0003130477,0.003373883,0.0004234931,0.003192487],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007881769,"threshold_uncertainty_score":0.02636713,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}