{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008095333,0.000239076,0.0002654166,0.0006959634,0.0004128119,0.000600424,0.001440907,0.0000804876,0.00008752519],"category_scores_gemma":[0.0001688025,0.0002013958,0.0001787397,0.001040453,0.00015114,0.0007662894,0.0002289953,0.0003502967,0.00003809543],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001115644,"about_ca_system_score_gemma":0.0001124983,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004120121,"about_ca_topic_score_gemma":0.000001366274,"domain_scores_codex":[0.9969758,0.0001215963,0.001041571,0.0003767475,0.001232514,0.0002517255],"domain_scores_gemma":[0.9959829,0.001218865,0.00090234,0.0002789564,0.001442982,0.0001739503],"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.00002322337,0.0005108888,0.001413712,0.00002701635,0.0004080459,0.00002621177,0.0008692846,0.1293278,0.0005467873,0.09936512,0.001989493,0.7654924],"study_design_scores_gemma":[0.002367997,0.000284774,0.01182621,0.0001224416,0.00009956628,0.002662722,0.0002339163,0.6560636,0.0006937225,0.2537228,0.07115419,0.0007681505],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01069547,0.002066489,0.9804131,0.004709309,0.0005452913,0.0003570601,0.00001806468,0.00004757661,0.001147675],"genre_scores_gemma":[0.7307082,0.0001628859,0.2670048,0.0009861945,0.0008852676,0.00006089681,0.00002500208,0.0000152726,0.0001515493],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7647243,"threshold_uncertainty_score":0.8212683,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002052382,0.000156994,0.0002285103,0.001572563,0.0001707303,0.0003408732,0.00167553,0.00006859376,0.000009461567],"category_scores_gemma":[0.0007818812,0.0001600022,0.00007126693,0.00135254,0.0000616155,0.001340941,0.0002964163,0.0003620399,0.000003278719],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001333358,"about_ca_system_score_gemma":0.0003027564,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001032882,"about_ca_topic_score_gemma":0.000006484789,"domain_scores_codex":[0.9978321,0.0001388662,0.0007890661,0.0004511914,0.0005899785,0.0001988544],"domain_scores_gemma":[0.9962611,0.001611651,0.0008291798,0.0003173457,0.0008657309,0.0001149547],"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.00003368947,0.0001861492,0.01033316,0.00002755912,0.00004410282,0.000001654638,0.00005885643,0.05805096,0.0001647551,0.0148936,0.00008714048,0.9161184],"study_design_scores_gemma":[0.001431338,0.00009496405,0.03372748,0.00003980418,0.00002204506,0.00006656397,0.0000461927,0.8426529,0.00009352048,0.007148876,0.1144497,0.0002266786],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004112677,0.0006844432,0.9910625,0.003456051,0.0001384949,0.0003361161,0.00004312153,0.0000431996,0.0001233514],"genre_scores_gemma":[0.3724256,0.00002248911,0.6268857,0.0001710806,0.0002543349,0.00005366345,0.00015895,0.000009846135,0.00001831932],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9158917,"threshold_uncertainty_score":0.6524699,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005607545,0.00016291,0.0002337537,0.0006562556,0.0002249456,0.0001784421,0.001294066,0.00006065159,0.0002463222],"category_scores_gemma":[0.0001481013,0.0001369211,0.0002645249,0.0007684001,0.00009379523,0.0004295115,0.00009248865,0.0001678012,0.00008544827],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001055449,"about_ca_system_score_gemma":0.0001166015,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001601866,"about_ca_topic_score_gemma":3.481354e-7,"domain_scores_codex":[0.9977319,0.00007857298,0.0008149077,0.0002369202,0.0009706588,0.0001670474],"domain_scores_gemma":[0.9944474,0.002325256,0.0008120943,0.0002412458,0.002077721,0.00009626452],"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.00006337706,0.0007599218,0.00005592541,0.0000154536,0.0003837796,0.000003055708,0.0001650147,0.2134324,0.001731528,0.7081432,0.01633288,0.05891353],"study_design_scores_gemma":[0.001465059,0.000463837,0.001403276,0.00004885957,0.00005374891,0.0002320455,0.00003058647,0.3730728,0.003166693,0.5532678,0.06648555,0.0003097704],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01575254,0.0002626515,0.9758973,0.006392042,0.000317101,0.0004934784,0.0000905209,0.00002750754,0.0007668269],"genre_scores_gemma":[0.9495421,0.00002506858,0.04812949,0.001289469,0.0005682984,0.0001140101,0.00009678868,0.00001433149,0.0002204596],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9337896,"threshold_uncertainty_score":0.5583482,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003497717,0.0001502661,0.0001989761,0.0007432283,0.0001774213,0.0002158015,0.001316696,0.0000703375,0.00003989432],"category_scores_gemma":[0.000129181,0.000152592,0.0001885089,0.0007334519,0.00004885807,0.0005132867,0.0001035955,0.0001845314,0.0000659455],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001656056,"about_ca_system_score_gemma":0.00007041714,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004655879,"about_ca_topic_score_gemma":4.196474e-7,"domain_scores_codex":[0.9979323,0.00004152311,0.0006897144,0.0002592529,0.0008763531,0.0002009131],"domain_scores_gemma":[0.9966516,0.0007344501,0.0006015099,0.0002143225,0.001655577,0.000142527],"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.00002883998,0.0005568329,0.0002950453,0.0000168203,0.0002767033,0.00001739072,0.0002083988,0.6195251,0.0007695527,0.02845239,0.004208201,0.3456448],"study_design_scores_gemma":[0.001454407,0.0002681026,0.003589046,0.0000342629,0.00003757374,0.0007512062,0.00003385891,0.8130897,0.0009698503,0.07080266,0.1086708,0.0002984512],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001905738,0.000319135,0.9947546,0.001614631,0.0006251941,0.0003651771,0.00004060418,0.00006088408,0.0003140805],"genre_scores_gemma":[0.6150868,0.00002332804,0.3836149,0.0003068619,0.0007092993,0.0001001885,0.00002581417,0.00001379169,0.0001190507],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6131811,"threshold_uncertainty_score":0.6222519,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002054898,0.0001913657,0.0002412796,0.000822078,0.0002721396,0.0003506741,0.001071315,0.00007419813,0.00003264249],"category_scores_gemma":[0.00006211674,0.0001535046,0.0001918691,0.0009098478,0.0001920073,0.0007852293,0.0002145228,0.0003067465,0.00004786806],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001132128,"about_ca_system_score_gemma":0.0002159778,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002389074,"about_ca_topic_score_gemma":0.000003622703,"domain_scores_codex":[0.9971394,0.0001009681,0.0009887631,0.0002930746,0.00125429,0.0002234999],"domain_scores_gemma":[0.9958252,0.0013027,0.0007459812,0.0001929813,0.001766274,0.0001668573],"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.0003439497,0.0003751659,0.0005796115,0.00001714715,0.0004238049,0.00002732065,0.0003267047,0.07198752,0.0004053462,0.7008151,0.002270651,0.2224277],"study_design_scores_gemma":[0.007343127,0.0002676353,0.03926462,0.0001001533,0.0001128446,0.004393416,0.0001617922,0.05436902,0.0009405726,0.6446794,0.2476476,0.000719875],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00975762,0.0005658164,0.9809062,0.005652986,0.0004566802,0.0004038014,0.00001007397,0.00004397909,0.002202771],"genre_scores_gemma":[0.8062577,0.0001023793,0.1908702,0.001354468,0.001077272,0.00004796742,0.00007253219,0.00001330637,0.000204223],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7965001,"threshold_uncertainty_score":0.6259736,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004178807,0.0001533675,0.0002445939,0.0008698707,0.0001015057,0.0001427996,0.0009044144,0.00006120928,0.00001548626],"category_scores_gemma":[0.00007062335,0.0001522567,0.0001441782,0.0008256572,0.00009927331,0.0007393368,0.0001672391,0.0001640448,0.00001060925],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009647586,"about_ca_system_score_gemma":0.0003547559,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007745579,"about_ca_topic_score_gemma":0.00000264582,"domain_scores_codex":[0.9978082,0.00003819352,0.0008049991,0.0002440058,0.0009651744,0.000139428],"domain_scores_gemma":[0.9968818,0.0003212596,0.0007264323,0.0001669725,0.001770916,0.0001326539],"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.00004007134,0.0004424155,0.0008597368,0.00001965475,0.0002523326,0.0000143857,0.0003500746,0.442187,0.002018773,0.4133461,0.0001385183,0.1403309],"study_design_scores_gemma":[0.004303026,0.0004458411,0.04837407,0.0001400977,0.00005907702,0.001231546,0.0001304112,0.0143706,0.006600005,0.8845544,0.03926821,0.0005226486],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06456247,0.0006119151,0.9320232,0.00199908,0.0002825829,0.0001847939,0.00002205629,0.00002710536,0.0002868302],"genre_scores_gemma":[0.8206175,0.00006405287,0.1786775,0.0002572166,0.0003095243,0.00001889831,0.00002478017,0.000006786704,0.00002375782],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7560551,"threshold_uncertainty_score":0.620885,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009841848,0.0002051104,0.0001906252,0.0006127727,0.0002708685,0.0003057865,0.001699296,0.00006261234,0.0001868411],"category_scores_gemma":[0.0001158334,0.0001529485,0.0002152677,0.001108058,0.00008570745,0.001081572,0.0002095431,0.0003428904,0.0003393168],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001291023,"about_ca_system_score_gemma":0.0002132414,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002068015,"about_ca_topic_score_gemma":2.80502e-7,"domain_scores_codex":[0.9971399,0.00013607,0.0007222705,0.0002242247,0.001501419,0.0002761455],"domain_scores_gemma":[0.9960012,0.001471563,0.00066361,0.000289135,0.001374664,0.0001998098],"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.00002583741,0.0003461107,0.0006205555,0.000004971482,0.0001967199,0.00000260297,0.0001506325,0.1600651,0.00007807089,0.8084623,0.003949546,0.0260976],"study_design_scores_gemma":[0.001224567,0.0002267112,0.01923792,0.00007213274,0.00006056692,0.0005634896,0.00008583475,0.02934522,0.0008370029,0.4948973,0.4529001,0.0005491565],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008441183,0.000365307,0.9799845,0.006526361,0.0007265114,0.0003710186,0.00003073366,0.00004380356,0.003510634],"genre_scores_gemma":[0.9422493,0.00003123312,0.05392894,0.001899831,0.00134406,0.0001020269,0.0000594984,0.00001547237,0.0003696227],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9338081,"threshold_uncertainty_score":0.623706,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004431467,0.0001268354,0.0001983118,0.00102942,0.00009129278,0.0002124382,0.001489641,0.00005599328,0.0002525901],"category_scores_gemma":[0.0001094819,0.0001270282,0.0001208135,0.001172891,0.00005799036,0.0007290819,0.000187538,0.0003301711,0.00009612517],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001407305,"about_ca_system_score_gemma":0.0001009724,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005274352,"about_ca_topic_score_gemma":0.000002916949,"domain_scores_codex":[0.9976858,0.00007319826,0.0008353376,0.0002253969,0.0009810976,0.0001991445],"domain_scores_gemma":[0.9974411,0.0004537349,0.0004467624,0.0001846409,0.001328064,0.0001457565],"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.00001150402,0.002134141,0.006428979,0.00001152748,0.0001684257,0.00005807535,0.000607787,0.4645347,0.00009693671,0.3252828,0.001974314,0.1986908],"study_design_scores_gemma":[0.001655553,0.00009212703,0.0135161,0.00007186516,0.000008590011,0.0003280585,0.00009679289,0.8863664,0.00004277893,0.04899436,0.0485406,0.0002868048],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003782296,0.0002241561,0.9882351,0.00581185,0.000252984,0.000217193,0.00002236303,0.00004052213,0.001413587],"genre_scores_gemma":[0.8457258,0.0001297105,0.1528121,0.0007877955,0.0002800515,0.00002514492,0.0000325135,0.00001045663,0.000196401],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8419435,"threshold_uncertainty_score":0.5180061,"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000797505,0.0002411013,0.000442698,0.001846726,0.000179392,0.000191525,0.001541244,0.0001091355,0.0003336961],"category_scores_gemma":[0.00005821825,0.0002496295,0.0004387035,0.00338812,0.00009494014,0.0006964761,0.0001190583,0.0002222241,0.00003375433],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002618147,"about_ca_system_score_gemma":0.0003355479,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003541288,"about_ca_topic_score_gemma":0.000004354878,"domain_scores_codex":[0.9960002,0.00006960037,0.001357286,0.0004129162,0.001910678,0.0002493336],"domain_scores_gemma":[0.9953895,0.0003696441,0.0009715501,0.0003036595,0.00278772,0.0001779178],"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.0000872633,0.0008865421,0.0001841602,0.000009598394,0.001275861,0.000003918944,0.0001564099,0.2354483,0.005541376,0.03258002,0.001030628,0.7227958],"study_design_scores_gemma":[0.003832329,0.001672742,0.01303542,0.0001326866,0.001589394,0.0004074105,0.0001237968,0.4748152,0.04964468,0.1691481,0.2839077,0.001690567],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03109808,0.0003305166,0.9656661,0.001098234,0.0001994935,0.0005192092,0.0001259826,0.00006406604,0.000898351],"genre_scores_gemma":[0.9417344,0.0001254054,0.05642097,0.0006177025,0.0003663738,0.0001377211,0.0003154156,0.00001484484,0.0002671745],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9106363,"threshold_uncertainty_score":0.9999956,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003106905,0.0001820739,0.0002378746,0.001000865,0.0001239249,0.0001476918,0.0008372809,0.00006299474,0.00003300377],"category_scores_gemma":[0.00005984823,0.0001553162,0.0001349507,0.001033211,0.0001346213,0.0005265574,0.00007442944,0.0001993795,0.000006803972],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004941174,"about_ca_system_score_gemma":0.0001522565,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001813583,"about_ca_topic_score_gemma":2.718121e-7,"domain_scores_codex":[0.997802,0.00006827474,0.0007145432,0.0002607823,0.00100518,0.0001492407],"domain_scores_gemma":[0.9968579,0.0002761189,0.0005874574,0.0001794084,0.00198352,0.0001155776],"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.00006245219,0.0001647611,0.0001336731,0.00001060215,0.0001234062,0.000003960906,0.0001067208,0.09486916,0.001022067,0.8493549,0.0001777884,0.05397058],"study_design_scores_gemma":[0.0009140193,0.0003416922,0.0176497,0.00006627924,0.00002889804,0.0002220667,0.00001812025,0.0125792,0.001861788,0.9640172,0.002069388,0.0002316407],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1654043,0.00113253,0.8295215,0.002726316,0.0004232364,0.0002676406,0.00001481907,0.00003432414,0.0004753572],"genre_scores_gemma":[0.9520374,0.00005209149,0.04684158,0.0007651754,0.000205032,0.0000144571,0.00001905871,0.000007430125,0.00005777308],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7866331,"threshold_uncertainty_score":0.6333612,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006029553,0.0001861188,0.0003084624,0.001118977,0.0001454897,0.000194392,0.0009240497,0.00008133515,0.00002613496],"category_scores_gemma":[0.0001321247,0.0001887378,0.0001819539,0.00104327,0.0001000984,0.0008363313,0.00009582229,0.0001984887,0.000008750578],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001056463,"about_ca_system_score_gemma":0.0003337779,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004941557,"about_ca_topic_score_gemma":0.000002028073,"domain_scores_codex":[0.9974344,0.00008129266,0.001014136,0.000281968,0.00101193,0.0001762606],"domain_scores_gemma":[0.9960164,0.0006113495,0.0008849733,0.0002103924,0.002102084,0.0001747826],"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.00008187216,0.0004935901,0.000778342,0.00001225163,0.0002801466,0.00001340325,0.0002617505,0.09756482,0.001303568,0.5392832,0.0006434451,0.3592836],"study_design_scores_gemma":[0.0038839,0.0006540391,0.1154766,0.00009256876,0.0001101985,0.0008818724,0.0001424046,0.06464372,0.002153905,0.7696326,0.04171078,0.0006173551],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03459595,0.0008913924,0.9597767,0.003336618,0.0002926392,0.0003046728,0.00003058395,0.00003354004,0.0007379208],"genre_scores_gemma":[0.8382055,0.00006043215,0.1607659,0.0004491219,0.0003609859,0.00001730489,0.00005639059,0.000007399359,0.00007693654],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8036095,"threshold_uncertainty_score":0.7696506,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002340326,0.0001199008,0.0001515209,0.0002128599,0.000126413,0.0001749134,0.0006956647,0.00004459966,0.00006743356],"category_scores_gemma":[0.00002420053,0.00009756786,0.000150831,0.0003302347,0.00005904378,0.0002659795,0.00003711311,0.0002852888,0.00007337383],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001283329,"about_ca_system_score_gemma":0.0000989121,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002946795,"about_ca_topic_score_gemma":0.000007150144,"domain_scores_codex":[0.9984369,0.00003843598,0.0005290316,0.0001098104,0.000740878,0.0001449127],"domain_scores_gemma":[0.9985583,0.0004885111,0.0001942886,0.000130063,0.0005483027,0.00008047489],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0001091748,0.0001609494,0.01258316,0.00001037659,0.00112137,0.00007955177,0.0003853463,0.6795738,0.0007723489,0.01755771,0.007629139,0.2800171],"study_design_scores_gemma":[0.001217293,0.00003932462,0.05783329,0.0001010477,0.00005462648,0.001183808,0.0002908538,0.03661899,0.00005138621,0.08403151,0.8183092,0.0002686813],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1027526,0.003257043,0.886773,0.003304214,0.0007381956,0.0002472397,0.0000431182,0.00007043425,0.002814142],"genre_scores_gemma":[0.994656,0.0001522922,0.002087915,0.0004464175,0.002465653,0.00004798817,0.00005166472,0.00001946881,0.00007256927],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8919034,"threshold_uncertainty_score":0.3978702,"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006557059,0.0002471195,0.0002935091,0.0009848403,0.0002543035,0.0005329943,0.001726621,0.0001061395,0.0001054242],"category_scores_gemma":[0.00005332916,0.0002535885,0.0002696848,0.0008027144,0.00006884496,0.001903449,0.00009184434,0.0002458097,0.00003825314],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001843121,"about_ca_system_score_gemma":0.0001661093,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003092927,"about_ca_topic_score_gemma":9.171345e-7,"domain_scores_codex":[0.9971698,0.00008449508,0.0009221239,0.0004462914,0.001110431,0.0002668785],"domain_scores_gemma":[0.9955058,0.0004775849,0.000748715,0.0003041385,0.002697617,0.0002661676],"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.00002859928,0.0008387784,0.00008006985,0.00001045769,0.0002116717,0.000007946975,0.0002150087,0.09089607,0.001112269,0.0271881,0.000905426,0.8785056],"study_design_scores_gemma":[0.001427126,0.0003343889,0.001034048,0.00001581404,0.00002998741,0.0002598475,0.00003923394,0.9317876,0.0003870779,0.02325021,0.04115685,0.0002778296],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003670525,0.0004606841,0.9932886,0.0008445827,0.0008509529,0.0005734011,0.00007981681,0.00008196511,0.00014942],"genre_scores_gemma":[0.4937275,0.00004871458,0.5040851,0.000425673,0.001305705,0.0001109987,0.0001320505,0.00002050175,0.0001438194],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8782278,"threshold_uncertainty_score":0.9999917,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008932998,0.0001673559,0.0002157005,0.001392012,0.00016576,0.0004746909,0.004494345,0.00004847991,0.00002851583],"category_scores_gemma":[0.00009834054,0.0001699009,0.0001409262,0.001106993,0.00005119502,0.001763649,0.0006848689,0.0001697376,0.00005842843],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001400631,"about_ca_system_score_gemma":0.0002039545,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003101545,"about_ca_topic_score_gemma":0.000002380832,"domain_scores_codex":[0.9975629,0.00002884874,0.0007384771,0.0003969169,0.001052087,0.0002207249],"domain_scores_gemma":[0.996649,0.0005925469,0.0006162996,0.0005638928,0.001445635,0.000132577],"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.00002191776,0.0003702703,0.0001871518,0.00001767054,0.0002472991,0.000007445823,0.00001676372,0.1710191,0.00002008095,0.01683574,0.005623959,0.8056326],"study_design_scores_gemma":[0.00100805,0.00005134327,0.001041386,0.00001778291,0.00002989787,0.00007052136,0.00000980096,0.6484294,0.00009730639,0.008082081,0.3409813,0.0001810726],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0002180679,0.000240224,0.9929548,0.005258121,0.0005042599,0.0003727539,0.0001921045,0.00005796762,0.0002017137],"genre_scores_gemma":[0.1131903,0.00002616111,0.8830966,0.001191184,0.001729008,0.00005732834,0.0005710082,0.00001618629,0.0001222311],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8054515,"threshold_uncertainty_score":0.8351686,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009663695,0.0001806624,0.0002813893,0.000612675,0.000191916,0.0001451483,0.00115597,0.00006500371,0.00002003894],"category_scores_gemma":[0.000102616,0.0001580405,0.000144922,0.001687689,0.0001661672,0.0004391991,0.0002904105,0.0001635998,0.00001289688],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001391101,"about_ca_system_score_gemma":0.0003292444,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003137099,"about_ca_topic_score_gemma":0.00001478879,"domain_scores_codex":[0.9968328,0.0001249737,0.001318657,0.0003258476,0.001210656,0.0001870237],"domain_scores_gemma":[0.9927274,0.00110726,0.0010013,0.0003394037,0.004695372,0.0001292794],"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.0001092009,0.000815755,0.005234619,0.00009071912,0.0002474176,0.00000159854,0.0002817147,0.5053636,0.001074576,0.2672878,0.000817118,0.2186759],"study_design_scores_gemma":[0.003662947,0.0007579596,0.06050789,0.0001684418,0.0001793379,0.0003362522,0.0008727494,0.07170545,0.01458288,0.4749184,0.3712848,0.001022847],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04016997,0.0007971749,0.955654,0.001819204,0.0001633885,0.001022435,0.0001846173,0.0000221616,0.0001670323],"genre_scores_gemma":[0.9586421,0.00005169576,0.04044487,0.0001058301,0.0003575644,0.0002124822,0.00012093,0.000008150027,0.00005636853],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9184721,"threshold_uncertainty_score":0.6444706,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002163643,0.0001354987,0.0002836052,0.0006827241,0.00004309147,0.00002436734,0.0005963269,0.00006664744,0.000372216],"category_scores_gemma":[0.00007363965,0.0001272236,0.0002504938,0.0009609152,0.000088979,0.0002419015,0.00002760718,0.0001653803,0.00001814721],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001112701,"about_ca_system_score_gemma":0.00003975077,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000149784,"about_ca_topic_score_gemma":3.539994e-7,"domain_scores_codex":[0.9983359,0.0000126384,0.0007781754,0.0001353002,0.0005839028,0.0001540896],"domain_scores_gemma":[0.9979775,0.0005555605,0.0002589322,0.0001134249,0.001006352,0.00008824329],"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.00006088562,0.0002663145,0.0006098147,0.00004407075,0.0003439595,0.00000285857,0.00003133433,0.7124326,0.0004909136,0.007166524,0.0004155577,0.2781352],"study_design_scores_gemma":[0.003018977,0.0009090102,0.01288476,0.000179686,0.0003159909,0.0004563727,0.000181908,0.1843636,0.01657472,0.5552362,0.2247666,0.001112204],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03305477,0.0005459681,0.9646639,0.0001581689,0.0000843626,0.0002539609,0.00008683478,0.0000693636,0.00108263],"genre_scores_gemma":[0.8592188,0.0002853319,0.1399025,0.00006830887,0.0003144527,0.00007879189,0.00004611635,0.00001634123,0.00006941117],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.826164,"threshold_uncertainty_score":0.5188029,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007297308,0.0002058359,0.0002276789,0.0005340272,0.0003646649,0.000432912,0.001739831,0.00007216552,0.00006270944],"category_scores_gemma":[0.00008050173,0.0001698014,0.0002486488,0.001063002,0.0001097114,0.001126449,0.0002414644,0.0003471211,0.0001074202],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002108876,"about_ca_system_score_gemma":0.0003500967,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005690672,"about_ca_topic_score_gemma":0.000004211412,"domain_scores_codex":[0.9972882,0.0001146169,0.0009460881,0.0003118974,0.001114883,0.0002243253],"domain_scores_gemma":[0.995683,0.0007877494,0.0007982797,0.0003375633,0.002230654,0.0001627181],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00002567895,0.0002643307,0.0001386033,0.000006683149,0.0002521869,0.0002491964,0.000297331,0.3530383,0.00004637562,0.2129764,0.003762209,0.4289427],"study_design_scores_gemma":[0.001474206,0.0001183139,0.001575576,0.00003639499,0.00006172988,0.0435059,0.0001807993,0.168872,0.0003660501,0.06829417,0.7150837,0.0004311908],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005697838,0.0009803745,0.9739338,0.01747864,0.0006115081,0.0003215748,0.00001006538,0.00005905704,0.0009071364],"genre_scores_gemma":[0.8548314,0.00005987292,0.1403846,0.002038599,0.002328706,0.00007528898,0.00002309104,0.00001420291,0.0002442461],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8491336,"threshold_uncertainty_score":0.6924301,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007339916,0.0001601421,0.0001922858,0.0008382829,0.000148191,0.0002088558,0.0008430621,0.00006346552,0.00003036221],"category_scores_gemma":[0.00007043574,0.0001560282,0.0001280389,0.0008461785,0.00007512284,0.001936258,0.0001995933,0.0002076999,0.00003406707],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008186111,"about_ca_system_score_gemma":0.0001495703,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001908342,"about_ca_topic_score_gemma":3.121405e-7,"domain_scores_codex":[0.9979278,0.00006762162,0.0006324255,0.0002051311,0.0009451961,0.0002217907],"domain_scores_gemma":[0.9973218,0.0003918537,0.0005091537,0.0001668255,0.001361777,0.0002486216],"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.00002301951,0.0005221952,0.006039227,0.00001607255,0.000244568,0.000004868545,0.0002515596,0.01428413,0.0002470956,0.7556719,0.00106541,0.2216299],"study_design_scores_gemma":[0.001875727,0.0001933389,0.1006165,0.00005117162,0.00007345362,0.002328643,0.000108225,0.01735608,0.0009990697,0.621815,0.2539127,0.0006701464],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0252736,0.001619929,0.9699707,0.001401516,0.0006947507,0.0002369322,0.00001270503,0.00005291401,0.0007369829],"genre_scores_gemma":[0.818655,0.00008933014,0.1798615,0.0005890059,0.0006520427,0.00004436254,0.00002743011,0.000009171851,0.00007213562],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7933814,"threshold_uncertainty_score":0.6362645,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006655129,0.0001597421,0.0002424233,0.001000078,0.0000990782,0.0001199194,0.001097098,0.00005278214,0.00005196458],"category_scores_gemma":[0.000102905,0.0001500783,0.0002190611,0.001097721,0.00008291294,0.0006291966,0.00008693245,0.0001601922,0.00002389939],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008809561,"about_ca_system_score_gemma":0.0003666528,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002246996,"about_ca_topic_score_gemma":5.497128e-7,"domain_scores_codex":[0.997332,0.0001003662,0.0009350126,0.0002325459,0.001242831,0.000157273],"domain_scores_gemma":[0.995987,0.000194993,0.0007991823,0.0002160614,0.002688701,0.0001140428],"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.00003052672,0.0006321315,0.0006198494,0.00003214146,0.000383582,0.000006568593,0.0002044513,0.1694027,0.004184246,0.772146,0.0005878193,0.05176999],"study_design_scores_gemma":[0.003291318,0.0004223217,0.006524539,0.0001939783,0.0001034105,0.0009748266,0.0002413971,0.01582308,0.0502811,0.6589404,0.2624107,0.0007929402],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02303578,0.001258432,0.9728563,0.000727549,0.0005992521,0.0002723255,0.00001071406,0.00002728113,0.001212335],"genre_scores_gemma":[0.8688473,0.00006519174,0.1305178,0.0002378976,0.0001788785,0.00004627682,0.00001362901,0.000009106115,0.00008391108],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8458115,"threshold_uncertainty_score":0.6120017,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001284646,0.0001937961,0.0001942702,0.0005193073,0.0004867398,0.0005722226,0.001783804,0.00006873721,0.00003363592],"category_scores_gemma":[0.0001821792,0.0001563712,0.0002172646,0.001228545,0.00009942655,0.0007933283,0.0001354249,0.0003038974,0.00009247479],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001585003,"about_ca_system_score_gemma":0.0005532007,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002261766,"about_ca_topic_score_gemma":0.000001875185,"domain_scores_codex":[0.9969662,0.0001643541,0.0009224837,0.0002939008,0.0013898,0.0002632053],"domain_scores_gemma":[0.9949226,0.0009763232,0.0007521884,0.0002962593,0.002878964,0.0001736067],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000017324,0.0002647249,0.0005366312,0.000005654974,0.000214454,0.00001123139,0.00007536578,0.1100468,0.00009356951,0.7838842,0.003529366,0.1013206],"study_design_scores_gemma":[0.0007074955,0.00008255751,0.002934726,0.00001556663,0.00001781817,0.0006418127,0.00004220981,0.006473709,0.000425533,0.2977067,0.6907341,0.0002178161],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001726975,0.001293472,0.9885366,0.003592372,0.0009200628,0.00033552,0.00001395874,0.00005004088,0.003531017],"genre_scores_gemma":[0.7411523,0.0002095467,0.2558274,0.0008738811,0.0009031718,0.0001431653,0.00004227883,0.00002151531,0.0008266716],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7394254,"threshold_uncertainty_score":0.6376633,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008780175,0.0002011069,0.0003435551,0.001059654,0.0001186667,0.00008822424,0.0007749969,0.00008763868,0.0004959398],"category_scores_gemma":[0.0002796327,0.0001892362,0.0004127536,0.000827292,0.0001157884,0.000526015,0.00009842005,0.0003001869,0.0001603627],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001944872,"about_ca_system_score_gemma":0.00009159369,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004976745,"about_ca_topic_score_gemma":0.000001960539,"domain_scores_codex":[0.9973037,0.00007775929,0.0009267276,0.0001667685,0.001249737,0.0002753453],"domain_scores_gemma":[0.9955786,0.0009741556,0.001233412,0.0002199677,0.001756655,0.0002372354],"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.00006414256,0.001233772,0.01610151,0.00003280161,0.001595903,0.00001149704,0.0003027024,0.008703598,0.0001731519,0.9469624,0.01265129,0.01216725],"study_design_scores_gemma":[0.0007703661,0.00003844348,0.01221102,0.00005948831,0.0002396138,0.000421337,0.0004553048,0.0004585051,0.0002816102,0.9094269,0.07532406,0.0003134059],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1458204,0.0009975977,0.8446357,0.002647792,0.000888189,0.0004053712,0.0001262062,0.0000870127,0.004391824],"genre_scores_gemma":[0.9250529,0.00003015185,0.07290749,0.0003305704,0.001262572,0.00005036725,0.00004692722,0.00003499236,0.0002840524],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7792325,"threshold_uncertainty_score":0.7716829,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007252448,0.0002049103,0.0002465515,0.001240227,0.0001135846,0.0002161635,0.00134265,0.00007888176,0.00009630375],"category_scores_gemma":[0.00005921969,0.0002178856,0.0001750126,0.0009512628,0.00005447066,0.001390319,0.0002105044,0.0003184257,0.000147043],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000360979,"about_ca_system_score_gemma":0.0002788446,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003688272,"about_ca_topic_score_gemma":0.000004172779,"domain_scores_codex":[0.9968966,0.00008933119,0.001107714,0.0003423029,0.00131731,0.000246762],"domain_scores_gemma":[0.9980237,0.0004162737,0.0006655183,0.0002089487,0.0005236841,0.0001618184],"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.00002830725,0.0005315439,0.001003084,0.000004914653,0.000112529,0.00001883472,0.0002061028,0.7062456,0.000584099,0.05410517,0.0006213049,0.2365385],"study_design_scores_gemma":[0.004417719,0.0002642025,0.05314512,0.0001141079,0.00003930346,0.00169039,0.000130262,0.4075621,0.002644547,0.159029,0.3700002,0.0009630382],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02371017,0.0005423052,0.9697262,0.004370653,0.0003640899,0.0002685539,0.00001788223,0.00002993792,0.0009702125],"genre_scores_gemma":[0.7763145,0.00004186135,0.2216939,0.0009355647,0.0007574446,0.00005187541,0.00005863131,0.00001193599,0.0001342741],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7526043,"threshold_uncertainty_score":0.8885115,"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":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0004325284,0.0001874309,0.000193259,0.0005873939,0.0002333253,0.0002780626,0.0006541936,0.0000593922,0.00389562],"category_scores_gemma":[0.00004454787,0.0001938764,0.0001688915,0.001069185,0.0001040373,0.001159306,0.00006728111,0.0002105398,0.001953873],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001732372,"about_ca_system_score_gemma":0.0001031988,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009879319,"about_ca_topic_score_gemma":0.00002939546,"domain_scores_codex":[0.9976956,0.0000175457,0.0008435317,0.0002763557,0.0009758466,0.0001910893],"domain_scores_gemma":[0.9972487,0.00007058692,0.000304945,0.0002109199,0.002123824,0.00004101719],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00008057456,0.0004228621,0.0008386926,0.00003004954,0.0001723748,0.000002334655,0.00002196846,0.8930242,0.00000913336,0.02842541,0.003695035,0.07327735],"study_design_scores_gemma":[0.0008447344,0.00001975721,0.02794942,0.00002503726,0.00008697576,0.00002926774,0.0002203702,0.0330384,0.000004835352,0.01958123,0.9179032,0.0002967884],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04448703,0.0002122241,0.943107,0.004315632,0.0006032864,0.0003861197,0.0000590554,0.00008402329,0.006745646],"genre_scores_gemma":[0.9917495,0.00003583385,0.003010949,0.001731246,0.001265423,0.00009307444,0.0004347947,0.00001397803,0.001665228],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9472625,"threshold_uncertainty_score":0.9988232,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004513537,0.0001215104,0.0002127949,0.0004597199,0.00005794331,0.0001793857,0.0008713034,0.00004635749,0.0001989751],"category_scores_gemma":[0.00003083402,0.0001148739,0.00008601678,0.0006183317,0.00007797658,0.0005302582,0.00008863005,0.0002329655,0.0000430982],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006600023,"about_ca_system_score_gemma":0.0001036411,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000736159,"about_ca_topic_score_gemma":2.893458e-7,"domain_scores_codex":[0.9983358,0.00006876232,0.000589789,0.0002258711,0.0006246864,0.0001551343],"domain_scores_gemma":[0.9985629,0.0004904877,0.000245926,0.0001274294,0.0004382533,0.0001350179],"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.00002117966,0.0002414475,0.0009046834,0.000004582073,0.00007020342,0.00002986876,0.0001044517,0.03638298,0.00007101479,0.03148198,0.0001227169,0.9305649],"study_design_scores_gemma":[0.003715965,0.0004011967,0.1118223,0.0001327073,0.00003441903,0.002111035,0.0001298074,0.2132059,0.0004221098,0.3749636,0.2922579,0.0008030252],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0276894,0.0004084247,0.9684378,0.002266051,0.0001530918,0.0001440921,0.00001105538,0.00002008242,0.0008699892],"genre_scores_gemma":[0.4013017,0.0001509867,0.5974185,0.0006001155,0.0003500391,0.00002839955,0.000007103513,0.000008612572,0.0001345401],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9297619,"threshold_uncertainty_score":0.4684421,"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005322635,0.0002882752,0.0003655266,0.001497505,0.0002704974,0.0004380356,0.001832359,0.0001252692,0.0003547485],"category_scores_gemma":[0.0001499483,0.0002942861,0.0003356257,0.001681662,0.00009772001,0.001378666,0.0002175429,0.000341305,0.0003489334],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002146029,"about_ca_system_score_gemma":0.0001574781,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002718714,"about_ca_topic_score_gemma":0.000001415575,"domain_scores_codex":[0.9960637,0.0001127588,0.001218904,0.0004609594,0.001853028,0.0002906507],"domain_scores_gemma":[0.9945868,0.0007309276,0.00128105,0.0003555579,0.002774476,0.0002712414],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0001092734,0.002599548,0.001741511,0.00003804866,0.0008666292,0.0001247844,0.0006904147,0.2893561,0.000735695,0.1976343,0.01634227,0.4897614],"study_design_scores_gemma":[0.00469683,0.0003852043,0.01422926,0.0001274063,0.0001313623,0.001429872,0.0001378242,0.3313995,0.001375604,0.09413566,0.5508798,0.00107169],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01046847,0.001051509,0.9783695,0.006763384,0.001190467,0.0003613243,0.00006230118,0.00007630142,0.001656738],"genre_scores_gemma":[0.8709615,0.0001381194,0.1244686,0.0009959921,0.00220218,0.0001026774,0.00007654758,0.0000251783,0.001029176],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8604931,"threshold_uncertainty_score":0.9999509,"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007543379,0.0002684982,0.0003094583,0.002493583,0.0002457441,0.0005543752,0.001619928,0.0001130685,0.0001260212],"category_scores_gemma":[0.00008338276,0.0002775512,0.0002731738,0.003084231,0.00005318325,0.001576507,0.0002187601,0.0002924573,0.00005559874],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002951967,"about_ca_system_score_gemma":0.0003467842,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001616178,"about_ca_topic_score_gemma":0.000001921445,"domain_scores_codex":[0.9961161,0.00009080771,0.001283265,0.0004263309,0.001791492,0.0002919828],"domain_scores_gemma":[0.9951245,0.0005577285,0.00114051,0.0002752279,0.002748886,0.0001531465],"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.00001158591,0.0003118984,0.0006567896,0.000009696255,0.0001069289,0.00001156618,0.00002673679,0.8981535,0.0001468777,0.07489093,0.001332501,0.02434103],"study_design_scores_gemma":[0.003211694,0.0002455895,0.02028073,0.00009484905,0.00008546909,0.001186098,0.00003126311,0.6343027,0.001049099,0.1639484,0.1746572,0.0009069805],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003354859,0.0008783124,0.9917087,0.001129848,0.0008391133,0.0004412168,0.00002564117,0.0001000288,0.001522295],"genre_scores_gemma":[0.6871396,0.00006212414,0.3100898,0.0003798204,0.001752214,0.00008846606,0.0002061329,0.00002402537,0.0002578183],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6837848,"threshold_uncertainty_score":0.9999677,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048449,0.0001616599,0.0002956776,0.0007528035,0.0001505628,0.00008343391,0.001660075,0.00006962079,0.00002588562],"category_scores_gemma":[0.00008929809,0.0001625664,0.0001936251,0.0008298893,0.0001595892,0.0007025825,0.0001738557,0.0002337626,0.00004069025],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001535964,"about_ca_system_score_gemma":0.0004045412,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000938834,"about_ca_topic_score_gemma":2.084042e-7,"domain_scores_codex":[0.9970371,0.00007173135,0.00103134,0.0002493673,0.00142901,0.0001814778],"domain_scores_gemma":[0.9957055,0.0004975302,0.001159686,0.0002583906,0.0022453,0.0001335183],"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.00005009574,0.00149363,0.007577267,0.00004815294,0.0006494256,0.00008361635,0.001564857,0.7334273,0.0005439445,0.137188,0.001859232,0.1155145],"study_design_scores_gemma":[0.00567682,0.0007826817,0.1249439,0.0003065788,0.0001250907,0.00733358,0.0004371998,0.5091983,0.005999454,0.2770423,0.06677017,0.001383941],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02975166,0.0002575141,0.9681044,0.0004209817,0.0003899717,0.0002700763,0.00002801119,0.00004834598,0.0007290654],"genre_scores_gemma":[0.5617,0.0000425121,0.4377254,0.0001097135,0.0002839685,0.00003654547,0.000034474,0.00000908016,0.00005828682],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5319484,"threshold_uncertainty_score":0.6629265,"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000916142,0.0002510386,0.0003061958,0.001078508,0.0002004596,0.0003041366,0.001740548,0.0001035672,0.0001165191],"category_scores_gemma":[0.00007577702,0.0002498936,0.0002613899,0.00122933,0.00009063441,0.001726012,0.0001935274,0.0003350846,0.0002256027],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002414092,"about_ca_system_score_gemma":0.0003190226,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004067672,"about_ca_topic_score_gemma":0.00000242465,"domain_scores_codex":[0.9966615,0.00006494693,0.001057869,0.0003024049,0.001547367,0.0003658586],"domain_scores_gemma":[0.9956829,0.0005219359,0.0009115904,0.0002978744,0.002275804,0.0003098797],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00004088358,0.001318338,0.004747077,0.00004328124,0.000701959,0.0000119076,0.0004813749,0.2507559,0.0009333182,0.3979491,0.002786838,0.34023],"study_design_scores_gemma":[0.002782385,0.0002782146,0.1034119,0.0001371328,0.0001157245,0.002125385,0.00009757497,0.1389812,0.0007414726,0.2771504,0.4730809,0.001097646],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006242949,0.002420752,0.9865479,0.001865773,0.001407105,0.0004117092,0.00003000832,0.00007949714,0.0009943466],"genre_scores_gemma":[0.8147651,0.00007073403,0.182823,0.00068227,0.001316533,0.0001007814,0.0001039752,0.00002043394,0.0001171498],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8085222,"threshold_uncertainty_score":0.9999954,"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009170278,0.0002607632,0.0003011846,0.001189129,0.0002724619,0.0002963178,0.001228178,0.00009781363,0.0000927025],"category_scores_gemma":[0.0003173327,0.0002631745,0.0002610848,0.001672512,0.00006609881,0.0006656605,0.0001120995,0.0004158336,0.0001266412],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002427328,"about_ca_system_score_gemma":0.0004915093,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002661472,"about_ca_topic_score_gemma":9.105567e-7,"domain_scores_codex":[0.9965354,0.0001779733,0.001009266,0.0004353559,0.001554414,0.0002875479],"domain_scores_gemma":[0.9952064,0.001071942,0.0008377464,0.0003048506,0.002353764,0.0002253236],"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.00003683926,0.0006049967,0.0003410126,0.000007692382,0.0002030844,0.00002565927,0.00009875902,0.2118528,0.0001656859,0.7556893,0.001474184,0.02949997],"study_design_scores_gemma":[0.004185327,0.00066213,0.008252819,0.0001505768,0.00006803931,0.001858577,0.0001059993,0.062589,0.00276132,0.5494711,0.3688957,0.0009993181],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01813018,0.000320888,0.9748742,0.001047336,0.001219826,0.0003179991,0.00002325469,0.00008296641,0.003983377],"genre_scores_gemma":[0.7980837,0.00002130656,0.1998278,0.001258521,0.0005504993,0.00003010115,0.00006330624,0.0000190822,0.0001456374],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7799535,"threshold_uncertainty_score":0.9999821,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009392909,0.0001779499,0.0002329864,0.001035212,0.0001440301,0.0002488609,0.0007804553,0.00008935982,0.00002382021],"category_scores_gemma":[0.0001480603,0.0001878183,0.0001432337,0.001880536,0.00003849507,0.001022334,0.00007507049,0.0002238776,0.00003769869],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004363318,"about_ca_system_score_gemma":0.0002974377,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006714739,"about_ca_topic_score_gemma":0.000004928685,"domain_scores_codex":[0.9973079,0.0001856122,0.001000337,0.0003226773,0.0009754759,0.0002080153],"domain_scores_gemma":[0.9969533,0.0003398884,0.0006352124,0.0002033296,0.001728597,0.0001396625],"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.00002017604,0.0003088475,0.0004144405,0.0000105528,0.00004877853,0.00001326558,0.00007332927,0.9133884,0.0003551375,0.07065,0.0000246736,0.01469239],"study_design_scores_gemma":[0.002330022,0.0001151801,0.00350584,0.00006259397,0.00001962209,0.0006755287,0.0001581517,0.9710371,0.004674583,0.007024027,0.01009487,0.0003024519],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01217383,0.0003571664,0.9856752,0.0002896909,0.000708731,0.0003794345,0.000007786021,0.00006062592,0.0003475771],"genre_scores_gemma":[0.7355604,0.00002332455,0.2640252,0.0001065413,0.0001446054,0.00007027145,0.0000172823,0.00001062756,0.00004174403],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7233866,"threshold_uncertainty_score":0.7659006,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014769,0.0002594502,0.0002792878,0.000893586,0.0005998707,0.0007135387,0.002584717,0.00008085546,0.0000795442],"category_scores_gemma":[0.0000860162,0.0002159647,0.0003088331,0.00226717,0.00008538815,0.0007634793,0.0001814886,0.000367087,0.0001203306],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001453339,"about_ca_system_score_gemma":0.0004302308,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005699622,"about_ca_topic_score_gemma":0.000002925194,"domain_scores_codex":[0.9961808,0.0001598798,0.00112051,0.0004520538,0.001760381,0.0003263842],"domain_scores_gemma":[0.9956762,0.001092523,0.0005079767,0.0003801386,0.002037463,0.0003057001],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00006859793,0.0003589308,0.00003275669,0.000003390609,0.0001868555,0.000004969577,0.00009588789,0.3805791,0.00007785786,0.1670891,0.00120508,0.4502974],"study_design_scores_gemma":[0.002442198,0.0002931177,0.005173785,0.00003767027,0.00006270441,0.001377903,0.00007444641,0.2462016,0.0002568655,0.3404371,0.4030574,0.0005852141],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004770703,0.0004122647,0.9873509,0.003707628,0.0004659386,0.0005231652,0.00002984406,0.00006772722,0.002671871],"genre_scores_gemma":[0.3325241,0.00006961272,0.6635395,0.001586758,0.001410601,0.0002256702,0.0001104403,0.00002657658,0.0005067499],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4497122,"threshold_uncertainty_score":0.8806784,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004836996,0.0001886768,0.0002767728,0.001168276,0.0001481793,0.0001877686,0.0008661878,0.00007471052,0.00004906516],"category_scores_gemma":[0.00008760533,0.0001931721,0.0001649056,0.0007750351,0.00008387178,0.0007899545,0.0001702866,0.0002405169,0.00002416748],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001397565,"about_ca_system_score_gemma":0.0002771863,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004570739,"about_ca_topic_score_gemma":0.000002631063,"domain_scores_codex":[0.9974962,0.00007171028,0.000919805,0.0003071307,0.001023316,0.0001817666],"domain_scores_gemma":[0.9968823,0.0006135146,0.0008029174,0.0001862778,0.001365857,0.0001491419],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00005940226,0.0004163392,0.0004653723,0.00001235611,0.0002403601,0.000006183649,0.0002106439,0.2284541,0.001330887,0.2267696,0.000989425,0.5410453],"study_design_scores_gemma":[0.005287047,0.0009238485,0.04002558,0.0003160899,0.0001662807,0.001736036,0.0002558006,0.2084748,0.02447876,0.2552648,0.4616773,0.001393697],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08473492,0.000672662,0.9078629,0.004359184,0.0005455523,0.0002443113,0.00003311797,0.00003281955,0.001514495],"genre_scores_gemma":[0.7910706,0.0001346029,0.2050114,0.0006434669,0.002994442,0.00002204873,0.00002935985,0.00001262826,0.000081513],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7063357,"threshold_uncertainty_score":0.7877331,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005787862,0.0002005113,0.0002528681,0.0005937492,0.0001838306,0.0005099701,0.001950873,0.0000719303,0.0001658485],"category_scores_gemma":[0.00002920551,0.000163609,0.0001451188,0.0008930348,0.0001272891,0.001002352,0.0002006734,0.0005024945,0.00007356269],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008641062,"about_ca_system_score_gemma":0.0004333313,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001074221,"about_ca_topic_score_gemma":0.00001217118,"domain_scores_codex":[0.9972548,0.00006719116,0.0007566184,0.000317311,0.001354772,0.0002492927],"domain_scores_gemma":[0.9959777,0.0002352539,0.000644736,0.0003049045,0.002571832,0.0002655925],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00006042469,0.0004601408,0.002090128,0.00002291164,0.0004060986,0.00002970725,0.0002226228,0.2608788,0.0005320079,0.6224545,0.001367751,0.1114749],"study_design_scores_gemma":[0.003901334,0.0002832333,0.006642,0.0001040921,0.00005517876,0.001386213,0.00004281637,0.1049532,0.0005079027,0.140077,0.7413187,0.0007283766],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002431909,0.00008145079,0.987161,0.007162981,0.0003129587,0.000591258,0.00003312491,0.00006827158,0.002157055],"genre_scores_gemma":[0.3650082,0.00006909467,0.6328094,0.0009053517,0.0005354878,0.0001841127,0.000107372,0.0000226677,0.000358287],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.739951,"threshold_uncertainty_score":0.6671783,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007969401,0.0001047398,0.0002104005,0.0007430181,0.00003864562,0.0000700178,0.001012959,0.00004012959,0.00001679425],"category_scores_gemma":[0.00008200781,0.00008328645,0.00009216723,0.0008820293,0.0001642702,0.0004918272,0.0001175747,0.0001647352,0.000004194651],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002602413,"about_ca_system_score_gemma":0.000208701,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007037305,"about_ca_topic_score_gemma":9.76101e-7,"domain_scores_codex":[0.997968,0.00009168549,0.0007526603,0.0001743438,0.0009088488,0.0001045066],"domain_scores_gemma":[0.9973347,0.0005839452,0.0006696178,0.0001622622,0.001209061,0.0000404138],"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.00007975182,0.0006107516,0.01647069,0.0001208634,0.0002454332,0.000007165229,0.001932175,0.3231679,0.009401512,0.5369038,0.000125645,0.1109344],"study_design_scores_gemma":[0.006254297,0.0009669705,0.3076456,0.00131659,0.0001045214,0.001931781,0.002600658,0.201872,0.01938675,0.4435683,0.01335177,0.001000745],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4646575,0.0009324626,0.5324724,0.000940255,0.0002025642,0.0003586265,0.00001149411,0.000006791952,0.0004179705],"genre_scores_gemma":[0.9721727,0.00005130799,0.02751811,0.0001373805,0.000070986,0.00001953685,0.00000739021,0.000004168102,0.00001844826],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5075152,"threshold_uncertainty_score":0.3396323,"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006016577,0.0002454416,0.000370467,0.0009921985,0.0001822215,0.0001784944,0.001550124,0.0001035513,0.0002086094],"category_scores_gemma":[0.0001510917,0.00025702,0.0002394938,0.001419297,0.0002856748,0.001059859,0.0001678837,0.0002405076,0.00001714549],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001504471,"about_ca_system_score_gemma":0.0005661301,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002285207,"about_ca_topic_score_gemma":0.000004924613,"domain_scores_codex":[0.9967025,0.0001041274,0.001391468,0.0003504603,0.001210202,0.0002412482],"domain_scores_gemma":[0.9941654,0.0005951715,0.001426343,0.0002588874,0.003360638,0.0001936291],"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.00008083185,0.001240882,0.008268029,0.00004205948,0.00088959,0.00001811845,0.0008757038,0.04337311,0.001973709,0.7574952,0.002875754,0.182867],"study_design_scores_gemma":[0.00674003,0.0009332896,0.01749764,0.0003017457,0.0003332625,0.002072216,0.001724451,0.185923,0.02484106,0.662892,0.09477649,0.001964797],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02676759,0.0007305584,0.9684173,0.0005409459,0.000581749,0.0003147139,0.0001529284,0.00006120511,0.002432938],"genre_scores_gemma":[0.7447935,0.00004654991,0.2545343,0.0001625029,0.0001772968,0.00002872865,0.0001394938,0.0000138742,0.0001036654],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.718026,"threshold_uncertainty_score":0.9999882,"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008186674,0.0002592545,0.0002958812,0.001268468,0.0002144434,0.000323754,0.002252258,0.0001002352,0.00017259],"category_scores_gemma":[0.00006136204,0.0002630469,0.0002345505,0.001210331,0.00008396937,0.002056841,0.0002280968,0.000317793,0.00007293133],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002036405,"about_ca_system_score_gemma":0.0005056509,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001535686,"about_ca_topic_score_gemma":0.000001753651,"domain_scores_codex":[0.9967146,0.0001139384,0.001030664,0.0004327989,0.001430575,0.0002774573],"domain_scores_gemma":[0.9957767,0.0002228515,0.000762625,0.0003322806,0.00258941,0.0003161871],"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.00002928138,0.0009361305,0.0005928818,0.000006784271,0.0002738692,0.0000580401,0.00054333,0.02695192,0.0002258463,0.09627012,0.0003156165,0.8737962],"study_design_scores_gemma":[0.00293548,0.001112952,0.07365651,0.0001248225,0.0001501716,0.003681374,0.0004115785,0.3154905,0.004873507,0.5117546,0.08427734,0.001531187],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00537218,0.0002930684,0.990787,0.00035085,0.0009484643,0.0002791975,0.00003873691,0.0001003556,0.001830149],"genre_scores_gemma":[0.5214405,0.00004130279,0.4770291,0.0003682293,0.000910929,0.00004825184,0.00008929828,0.0000169015,0.00005552116],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.872265,"threshold_uncertainty_score":0.9999822,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009845251,0.0002030568,0.0003218674,0.001125953,0.0001215717,0.0001489343,0.001736088,0.0001095648,0.0001384435],"category_scores_gemma":[0.000208356,0.0002022672,0.0002953278,0.001185605,0.0002162495,0.0008077609,0.0001315388,0.0004349804,0.00002885298],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005757834,"about_ca_system_score_gemma":0.0005295452,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006978436,"about_ca_topic_score_gemma":0.000004626937,"domain_scores_codex":[0.9968781,0.00007884736,0.001208951,0.0003270594,0.00131121,0.0001958632],"domain_scores_gemma":[0.9942068,0.0008729023,0.001070728,0.0003413171,0.003313207,0.000195054],"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.00006836258,0.0006974958,0.00223603,0.00002949313,0.0003818185,0.00001522652,0.0002395264,0.04198772,0.007197928,0.8537715,0.001188768,0.09218609],"study_design_scores_gemma":[0.002099591,0.0002705501,0.02491397,0.00004255987,0.00005913165,0.001265654,0.0001063828,0.02603099,0.004528233,0.8941556,0.0460183,0.000509051],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05912666,0.000112702,0.9365734,0.001815221,0.00101274,0.000299048,0.0001001849,0.0000444891,0.0009155828],"genre_scores_gemma":[0.7693168,0.00001357167,0.2298367,0.0002625298,0.0004058319,0.00002917951,0.00009127151,0.000009460064,0.00003463555],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7101902,"threshold_uncertainty_score":0.8248219,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005189653,0.0001756909,0.0002165239,0.0006141256,0.0001579431,0.0003906154,0.0007052787,0.00007844565,0.0003394688],"category_scores_gemma":[0.0000536378,0.0001771372,0.0001250468,0.000642627,0.00007284396,0.002551882,0.0001037294,0.0002216369,0.0001045153],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001572437,"about_ca_system_score_gemma":0.0002011585,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001778135,"about_ca_topic_score_gemma":0.000001686668,"domain_scores_codex":[0.9975955,0.00007730188,0.0009938612,0.0002648061,0.0009204334,0.0001480611],"domain_scores_gemma":[0.9972315,0.0003678667,0.0005493668,0.0002119431,0.001475377,0.0001639084],"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.00005084893,0.000144946,0.000375769,0.000006170686,0.0001351824,0.000002702734,0.000151655,0.09887744,0.0001013789,0.01446887,0.0002662802,0.8854188],"study_design_scores_gemma":[0.003399633,0.0003635843,0.04570068,0.0001084383,0.00008162775,0.001399508,0.0001507506,0.2346809,0.001409594,0.5357033,0.1762758,0.0007261303],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08583861,0.0003203077,0.9100437,0.002320955,0.0004400822,0.0002778543,0.0000650242,0.00005174163,0.0006417398],"genre_scores_gemma":[0.7522665,0.0002201786,0.2453404,0.0009699251,0.0008453799,0.0000483616,0.0002196909,0.00000827932,0.00008120246],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8846926,"threshold_uncertainty_score":0.7223447,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008709806,0.0001826011,0.0002298055,0.0007275665,0.0002019858,0.0002512374,0.001820151,0.00007998566,0.0001342659],"category_scores_gemma":[0.0002581762,0.0001421752,0.0002586056,0.001079899,0.0001405126,0.0004663771,0.0001680777,0.0004820057,0.0000359333],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006648305,"about_ca_system_score_gemma":0.0003700458,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003168457,"about_ca_topic_score_gemma":0.000003602183,"domain_scores_codex":[0.9972377,0.00007309918,0.0008341006,0.0002680366,0.001411197,0.0001758844],"domain_scores_gemma":[0.9948221,0.001459019,0.0009200592,0.0003501242,0.002330948,0.000117683],"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.00008831159,0.0008656054,0.0006985562,0.00001005504,0.0003719245,0.00001466069,0.0002264247,0.1157946,0.004971652,0.7951728,0.002192565,0.07959283],"study_design_scores_gemma":[0.002333719,0.0006299464,0.04263743,0.0001370938,0.00009323173,0.0009027512,0.000131223,0.09515892,0.00725308,0.6569991,0.1929879,0.0007357068],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1279492,0.00008929464,0.862992,0.006057056,0.001217897,0.0003226562,0.00003185191,0.00002903224,0.001311045],"genre_scores_gemma":[0.9593875,0.00001314848,0.0389424,0.0007714452,0.0007022702,0.00005742162,0.00002625498,0.00001176707,0.00008776015],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8314384,"threshold_uncertainty_score":0.5797735,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002595893,0.0001213675,0.0001622627,0.0003979864,0.00006323781,0.00002040864,0.0005639723,0.00006417846,0.0001204177],"category_scores_gemma":[0.00004901339,0.0001267672,0.0001831558,0.0002895339,0.0001067264,0.00001705064,0.0001010564,0.0001022224,0.00001706118],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003220373,"about_ca_system_score_gemma":0.0001837938,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006825124,"about_ca_topic_score_gemma":0.000001271027,"domain_scores_codex":[0.9985484,0.00003955825,0.0006330035,0.000166062,0.0004859004,0.000127053],"domain_scores_gemma":[0.9975283,0.00006362968,0.0006106057,0.0001414231,0.001568728,0.00008734476],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"observational","study_design_scores_codex":[0.001119654,0.007403952,0.07492093,0.0002113738,0.009231525,0.00006659103,0.003784944,0.1819969,0.3086731,0.08810885,0.005183195,0.3192989],"study_design_scores_gemma":[0.01377997,0.003593777,0.4433394,0.000344713,0.0009654349,0.002888015,0.004352817,0.009435817,0.1945597,0.1595992,0.164279,0.002862127],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1852675,0.0004330863,0.8115398,0.0001560597,0.0002065664,0.0002295061,0.00007143951,0.00000837412,0.002087653],"genre_scores_gemma":[0.9365593,0.00002634279,0.06263036,0.00009695805,0.0004304362,0.00001534256,0.0001410397,0.00001669072,0.00008357463],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7512918,"threshold_uncertainty_score":0.5169416,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009157154,0.0001640321,0.000304515,0.0007031457,0.0001149044,0.00008287017,0.001396125,0.00005906286,0.00005394204],"category_scores_gemma":[0.0001569694,0.0001352431,0.0002617995,0.001171115,0.0001436693,0.0003920252,0.0001370371,0.0002161192,0.000009054026],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007129779,"about_ca_system_score_gemma":0.0003915129,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003947107,"about_ca_topic_score_gemma":7.084557e-7,"domain_scores_codex":[0.9970561,0.0001456955,0.001191175,0.0002197548,0.001222884,0.0001644062],"domain_scores_gemma":[0.9944595,0.0009525859,0.001377782,0.0002663491,0.002853,0.00009079712],"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.0000457081,0.0008552278,0.003631022,0.00003697958,0.000531543,0.000005937895,0.0004547816,0.3292652,0.001686484,0.5921723,0.0008407164,0.07047406],"study_design_scores_gemma":[0.007854016,0.000893298,0.05396517,0.0004446194,0.0002258044,0.003117034,0.0007865478,0.1819797,0.03682093,0.4611762,0.2514713,0.001265355],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02972491,0.0005759394,0.9664597,0.0009538188,0.0005332499,0.0002601872,0.00003003547,0.00001563454,0.001446519],"genre_scores_gemma":[0.9192182,0.00003038865,0.08017632,0.0002752339,0.0002034517,0.00001167496,0.00002569722,0.000009053134,0.00004999731],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8894933,"threshold_uncertainty_score":0.5515056,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007019893,0.000209095,0.0002707513,0.0008850405,0.0001434573,0.0002299274,0.000679815,0.00007648178,0.00008677504],"category_scores_gemma":[0.0000609487,0.0002149184,0.0001172541,0.0008783673,0.00007309223,0.0006889072,0.0001030989,0.0002916949,0.0001361997],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002173187,"about_ca_system_score_gemma":0.0001726235,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008310873,"about_ca_topic_score_gemma":0.000005888442,"domain_scores_codex":[0.9973845,0.00009326061,0.0008651178,0.0004167859,0.001032931,0.0002074355],"domain_scores_gemma":[0.9976696,0.0006557192,0.0003811023,0.0001946511,0.0009406221,0.0001582669],"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.00009395774,0.0004738074,0.0007363495,0.000008778728,0.0001002935,0.00003217766,0.0001646328,0.6789227,0.00007175355,0.009174661,0.0001251509,0.3100958],"study_design_scores_gemma":[0.005119807,0.0008858618,0.129369,0.0002991698,0.00005356138,0.0009397317,0.00006325723,0.687635,0.001382755,0.1141625,0.05910248,0.0009869001],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2335711,0.000160095,0.7620893,0.00251295,0.0001900924,0.0003681893,0.00003255092,0.00003922009,0.001036537],"genre_scores_gemma":[0.9430456,0.00008576826,0.05508455,0.0008440029,0.000489638,0.00003088486,0.00007103736,0.00001302373,0.0003355106],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7094745,"threshold_uncertainty_score":0.8764117,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001981254,0.0002035971,0.0003011132,0.001427349,0.0001343823,0.0001750104,0.001117509,0.00007681733,0.00003410699],"category_scores_gemma":[0.000133803,0.0001872605,0.0001714135,0.001299936,0.0000919328,0.001976418,0.0001331427,0.0002832461,0.00002170431],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00024043,"about_ca_system_score_gemma":0.0004467512,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009482679,"about_ca_topic_score_gemma":0.000003994607,"domain_scores_codex":[0.9964325,0.00006490127,0.001442383,0.000241691,0.001581839,0.0002367042],"domain_scores_gemma":[0.9938095,0.0007728696,0.001468639,0.0002603973,0.003510043,0.0001786155],"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.0002899387,0.0004917555,0.002088332,0.00004812859,0.0004361722,0.00002682297,0.0007568149,0.3065665,0.0004584018,0.3777255,0.0003012247,0.3108104],"study_design_scores_gemma":[0.007713887,0.0017763,0.1685101,0.0005556212,0.0001551452,0.004222438,0.001548482,0.1209745,0.008103108,0.5801871,0.1046023,0.001650928],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02139366,0.0001652151,0.9753262,0.001396384,0.0002800617,0.0003511106,0.00002898447,0.00004269071,0.001015646],"genre_scores_gemma":[0.688761,0.00001724423,0.3103425,0.0005264037,0.0002412734,0.00001639645,0.00007942839,0.000007707419,0.000008048957],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6673673,"threshold_uncertainty_score":0.763626,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001250887,0.0001658702,0.000255749,0.0004810232,0.0001719464,0.0001178794,0.002294588,0.0000506919,0.000029755],"category_scores_gemma":[0.0001111395,0.0001127931,0.0002702882,0.00107007,0.0002009899,0.0004208699,0.0002797599,0.0002726958,0.0000115019],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009713678,"about_ca_system_score_gemma":0.0003291267,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009696844,"about_ca_topic_score_gemma":0.00000487788,"domain_scores_codex":[0.9968809,0.000145869,0.001221554,0.0002166402,0.001361959,0.0001730033],"domain_scores_gemma":[0.9947029,0.00144407,0.001401063,0.0003335215,0.002039126,0.00007925751],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0000342455,0.0002765487,0.0002571337,0.000014714,0.0004184138,0.000002281794,0.001129074,0.579101,0.0009516233,0.2329137,0.001549794,0.1833515],"study_design_scores_gemma":[0.002148661,0.0004116932,0.01838235,0.0001425867,0.000165805,0.000952896,0.0006797541,0.3952993,0.005152659,0.1594643,0.4166641,0.0005359743],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02354645,0.0006196963,0.9626737,0.01204367,0.0003660379,0.0003196218,0.00004735797,0.00001784298,0.0003655872],"genre_scores_gemma":[0.9290031,0.00003660914,0.06941563,0.0005357073,0.0008976968,0.0000199631,0.00003984746,0.000009380378,0.00004211371],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9054566,"threshold_uncertainty_score":0.4599569,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007063005,0.0001578919,0.0002049126,0.00115782,0.0002055795,0.0003869237,0.00170803,0.00006239712,0.00006235009],"category_scores_gemma":[0.00006451784,0.0001609301,0.0002087381,0.001120653,0.0001185432,0.001166941,0.0001894258,0.0002846116,0.00007563164],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002123832,"about_ca_system_score_gemma":0.0002747829,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005050526,"about_ca_topic_score_gemma":9.0058e-7,"domain_scores_codex":[0.9971496,0.00008296378,0.00081508,0.0002727981,0.001445926,0.0002336665],"domain_scores_gemma":[0.9964464,0.0005501846,0.0006227167,0.0002371681,0.002030959,0.0001126019],"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.00005291956,0.0002956854,0.0008426111,0.000006553099,0.0001319256,0.00002410804,0.0000497423,0.393695,0.0008717626,0.5351774,0.0006931526,0.06815907],"study_design_scores_gemma":[0.001673018,0.000111581,0.01479092,0.00003260493,0.0000185063,0.0006229391,0.000039919,0.04469584,0.001063252,0.8351613,0.1014666,0.000323438],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01869294,0.000438038,0.9776131,0.001371893,0.0003616551,0.0002458621,0.00001925351,0.00006225782,0.001195022],"genre_scores_gemma":[0.7378695,0.00001317148,0.2606456,0.0001333723,0.0009909455,0.00004392802,0.00005034816,0.00001457628,0.0002385319],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7191765,"threshold_uncertainty_score":0.6562538,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004317939,0.0001936568,0.0003451183,0.001191519,0.00006845047,0.00007016755,0.001013606,0.00006045976,0.00003640034],"category_scores_gemma":[0.00007796918,0.0001738868,0.0001789487,0.001098245,0.00008282971,0.0004067883,0.00007332063,0.0002123618,0.000007452786],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001013209,"about_ca_system_score_gemma":0.0002866797,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000269766,"about_ca_topic_score_gemma":7.235798e-7,"domain_scores_codex":[0.9972229,0.00006010832,0.001020006,0.0002690474,0.001269171,0.0001587523],"domain_scores_gemma":[0.9955438,0.0005596973,0.00134005,0.0002261056,0.002218319,0.0001120792],"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.0004930208,0.001335788,0.0004480133,0.00004033704,0.0005672383,0.00002038713,0.0007529294,0.7482831,0.006383103,0.1113397,0.000432282,0.1299042],"study_design_scores_gemma":[0.01181151,0.009705707,0.02214801,0.001447001,0.000282677,0.002290439,0.0006877462,0.4141492,0.05202299,0.4752393,0.008692331,0.001523055],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1568893,0.0001136926,0.8406478,0.001412769,0.0002086168,0.0002432987,0.00003476371,0.00001908522,0.0004306742],"genre_scores_gemma":[0.9343442,0.0000129761,0.06488612,0.0004148899,0.0002207609,0.00001368247,0.00004725255,0.000009010726,0.00005110416],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7774549,"threshold_uncertainty_score":0.7090898,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001029189,0.0001998778,0.0002192037,0.0005098164,0.0004416138,0.0007025924,0.001978153,0.00007233016,0.00004866165],"category_scores_gemma":[0.0001563468,0.0001572877,0.0002811469,0.0008364184,0.0001188862,0.001084455,0.000174541,0.0002294995,0.00008179721],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001380662,"about_ca_system_score_gemma":0.0003311538,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008693845,"about_ca_topic_score_gemma":0.000002799623,"domain_scores_codex":[0.9971882,0.00008958249,0.001042263,0.0003276485,0.001081464,0.0002708683],"domain_scores_gemma":[0.9925651,0.002021564,0.0007958208,0.0003029646,0.004140089,0.0001744678],"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.00005527497,0.0003513176,0.0004527602,0.00002391155,0.0004097002,0.000002408724,0.0001689374,0.1080363,0.0003020043,0.5698002,0.01736446,0.3030328],"study_design_scores_gemma":[0.0008334097,0.0001471726,0.004797325,0.00001650222,0.00001999611,0.0002238214,0.00006553746,0.03595935,0.0002562085,0.8018711,0.1555863,0.0002233313],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004581224,0.0004358542,0.9833375,0.009352705,0.0006617453,0.001068727,0.00004720186,0.00005364151,0.0004614099],"genre_scores_gemma":[0.659108,0.00007610807,0.3374102,0.0009846409,0.0009861836,0.0008924846,0.0001795974,0.00002122741,0.0003415572],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6545268,"threshold_uncertainty_score":0.6775114,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005290511,0.00009115858,0.0001651577,0.0001864567,0.0001238962,0.00007263946,0.0006722811,0.00002033448,0.00005877186],"category_scores_gemma":[0.00006704343,0.0000616669,0.0001792091,0.0004065763,0.0001283933,0.0002483329,0.00005451152,0.0001392754,0.000001270943],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004005828,"about_ca_system_score_gemma":0.0002265525,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008256268,"about_ca_topic_score_gemma":0.00001306439,"domain_scores_codex":[0.9982833,0.00007125179,0.0006777194,0.0001344276,0.000696096,0.0001372671],"domain_scores_gemma":[0.9975762,0.0006047001,0.000647377,0.0001470588,0.0009731886,0.00005142008],"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.0002338387,0.001683153,0.04645032,0.00002437391,0.000271187,5.656242e-7,0.0007712063,0.5864351,0.007520971,0.1828909,0.0007104375,0.173008],"study_design_scores_gemma":[0.002499505,0.0004240024,0.2869301,0.0002254882,0.00007630139,0.00001880498,0.003297861,0.277799,0.01084294,0.4163274,0.001281583,0.0002770383],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5199345,0.00009026119,0.4783172,0.000970777,0.0001197657,0.0003382522,0.00006948796,0.000002845773,0.0001569507],"genre_scores_gemma":[0.9888739,0.00000106029,0.0107031,0.00006969248,0.000281481,0.00001517566,0.00003817077,0.000004999835,0.0000123989],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4689394,"threshold_uncertainty_score":0.2514703,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005789402,0.0002154521,0.0002638758,0.00100481,0.0001974736,0.0002222501,0.001668263,0.00008790503,0.00009364249],"category_scores_gemma":[0.00009403481,0.0001695267,0.0002910245,0.0007330549,0.00007441299,0.001054462,0.000101521,0.0001388405,0.00006987558],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001950607,"about_ca_system_score_gemma":0.0004084602,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001520592,"about_ca_topic_score_gemma":0.000001124899,"domain_scores_codex":[0.99731,0.00005628627,0.000935308,0.0003647911,0.001078867,0.0002547703],"domain_scores_gemma":[0.9948912,0.001300353,0.0007637297,0.0002418912,0.002603996,0.0001988458],"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.00006250613,0.0003241464,0.0001774336,0.00001369405,0.0003411902,0.000009027321,0.00007315171,0.007148367,0.002453809,0.6529191,0.006696894,0.3297807],"study_design_scores_gemma":[0.001981533,0.0001814011,0.002621477,0.00006300758,0.00003479524,0.0002929417,0.00001547384,0.00630723,0.001444258,0.6827106,0.3040074,0.000339794],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002611887,0.0002278714,0.9844657,0.01072819,0.0007736365,0.0004380526,0.0001422635,0.00007238484,0.0005399742],"genre_scores_gemma":[0.4851073,0.00006132494,0.5109386,0.001104172,0.00175226,0.0001958057,0.0001058018,0.00002574204,0.0007090004],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4824954,"threshold_uncertainty_score":0.69131,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001354605,0.000160534,0.0003156587,0.0006513144,0.000153754,0.00008503598,0.00159941,0.00005509193,0.00001645542],"category_scores_gemma":[0.0001840151,0.0001370588,0.0002629327,0.0008958156,0.0001412229,0.0003575841,0.0001670492,0.0001421393,0.000009539729],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006517913,"about_ca_system_score_gemma":0.000228402,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004638113,"about_ca_topic_score_gemma":2.970097e-7,"domain_scores_codex":[0.9972132,0.0001250955,0.001137967,0.0002521005,0.001099961,0.0001716303],"domain_scores_gemma":[0.9933666,0.001865705,0.001476004,0.0002540308,0.002954123,0.00008355315],"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.00003280933,0.0002619178,0.0001256345,0.00002119961,0.000236725,5.927103e-7,0.0001807097,0.6092799,0.001746572,0.01164981,0.001493283,0.3749708],"study_design_scores_gemma":[0.001469527,0.0002647044,0.004863522,0.00007187033,0.00005283319,0.00009053783,0.00005423696,0.9404444,0.00394413,0.01737024,0.03115556,0.0002184507],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0120253,0.0001593832,0.9855685,0.001115328,0.0004054184,0.0004306698,0.00005150619,0.0000173181,0.0002266339],"genre_scores_gemma":[0.611649,0.00001029781,0.3874419,0.0001845759,0.0005654074,0.00002420424,0.00003655265,0.000009568287,0.00007848885],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5996237,"threshold_uncertainty_score":0.5589094,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}