{"meta":{"query_hash":"8b09e7a63a99","filters":{"venue":"International Journal of Computational Geometry & Applications"},"cohort_total":87,"direct_labels_cover":0,"predictions_cover":87,"exported":87,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/8b09e7a63a99","api":"https://metacan.xera.ac/api/v1/cohort?venue=International+Journal+of+Computational+Geometry+%26+Applications"},"results":[{"id":"W1509069969","doi":"10.1142/s0218195900000322","title":"OBNOXIOUS FACILITY LOCATION: COMPLETE SERVICE WITH MINIMAL HARM","year":2000,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Facility location problem; Constraint (computer-aided design); Computer science; Range (aeronautics); Mathematical optimization; Service (business); Planar; Construct (python library); Harm; Location model; Mathematics; Operations research; Computer network; Engineering; Business; Geometry","score_opus":0.02276828891413497,"score_gpt":0.256431344373944,"score_spread":0.23366305545980903,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1509069969","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11740767,0.0003781037,0.86290807,0.0014086558,0.000061317085,0.00045265796,0.0017299181,0.0020350008,0.013618589],"genre_scores_gemma":[0.57737243,0.0003122753,0.41134053,0.0001936333,0.00006805879,0.00033077254,0.0023502107,0.00026812742,0.0077639055],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99879044,0.00029645124,0.0000620312,0.00025010353,0.00028079594,0.0003202301],"domain_scores_gemma":[0.9983169,0.0006495139,0.00024002539,0.00040654343,0.0001499716,0.00023709037],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008903892,0.0010478372,0.0014900983,0.0007681403,0.0010488539,0.002367098,0.0029647283,0.002479836,0.0088207675],"category_scores_gemma":[0.005011632,0.00053588755,0.00084702566,0.00224285,0.0010515812,0.0026674136,0.0033732906,0.0010922482,0.0016696459],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013172532,0.00040832922,0.0023036643,0.00067283394,0.000088541055,0.0004414902,0.00058443006,0.7367433,0.004939667,0.07718258,0.019315079,0.1560029],"study_design_scores_gemma":[0.00020717198,0.00022282402,0.00070154923,0.000044942266,0.0000370735,0.00048306063,0.00046138672,0.8930818,0.0037524148,0.09153818,0.009435782,0.000033793294],"about_ca_topic_score_codex":0.005095504,"about_ca_topic_score_gemma":0.0052301115,"teacher_disagreement_score":0.0088207675,"about_ca_system_score_codex":0.0015066757,"about_ca_system_score_gemma":0.0020490822,"threshold_uncertainty_score":0.029508412},"labels":[],"label_agreement":null},{"id":"W1515108012","doi":"10.1142/s0218195900000036","title":"COMPUTING LARGEST CIRCLES SEPARATING TWO SETS OF SEGMENTS","year":2000,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; Université du Québec en Outaouais","funders":"","keywords":"Ackermann function; Combinatorics; Line segment; Omega; Mathematics; Line (geometry); Inverse; Planar; Binary logarithm; Set (abstract data type); Function (biology); Discrete mathematics; Algorithm; Computer science; Geometry; Physics","score_opus":0.01232425687127098,"score_gpt":0.31876264280377237,"score_spread":0.3064383859325014,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1515108012","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20439894,0.0005922976,0.7857243,0.00023515738,0.000066300025,0.0002259044,0.00059034437,0.00347915,0.0046875873],"genre_scores_gemma":[0.35200447,0.0001646926,0.64209735,0.000042833555,0.00004068749,0.00015437936,0.0020670923,0.0005205962,0.002907894],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981919,0.00021305238,0.00017188421,0.0006036783,0.0005794275,0.00024012216],"domain_scores_gemma":[0.9945393,0.002560827,0.00071882136,0.0007311125,0.0010302196,0.00041964906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086819107,0.0012471724,0.0017703866,0.003859094,0.0013364358,0.002605857,0.0022423987,0.0019330824,0.0055863056],"category_scores_gemma":[0.011221544,0.0011922517,0.000955747,0.0023730237,0.0010646203,0.00315563,0.003118263,0.0009248154,0.0020814815],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018121569,0.00023086411,0.0089656925,0.00093051733,0.00020402599,0.0009830269,0.0013925749,0.23909931,0.06822369,0.04960322,0.010446066,0.61810887],"study_design_scores_gemma":[0.00010608553,0.00020507029,0.0017182366,0.00005434827,0.00006468917,0.00041038104,0.0005832376,0.8962705,0.042191703,0.047442563,0.010869708,0.00008343759],"about_ca_topic_score_codex":0.0025992857,"about_ca_topic_score_gemma":0.002789283,"teacher_disagreement_score":0.0055863056,"about_ca_system_score_codex":0.0009145309,"about_ca_system_score_gemma":0.0010590788,"threshold_uncertainty_score":0.018688023},"labels":[],"label_agreement":null},{"id":"W1517201934","doi":"10.1142/s0218195911003561","title":"COMPUTING SIGNED PERMUTATIONS OF POLYGONS","year":2011,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Carleton University","funders":"","keywords":"Polygon (computer graphics); Combinatorics; Rectilinear polygon; Rectangle; Enhanced Data Rates for GSM Evolution; Simple polygon; Mathematics; Polygon covering; Visibility polygon; Star-shaped polygon; Equiangular polygon; Algorithm; Computer science; Monotone polygon; Regular polygon; Geometry; Artificial intelligence; Convex set","score_opus":0.015814733847699006,"score_gpt":0.27821978918652956,"score_spread":0.2624050553388306,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1517201934","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4934127,0.00018946889,0.48996338,0.00034361889,0.00010548575,0.00036499012,0.0008683636,0.0025104072,0.012241653],"genre_scores_gemma":[0.6401065,0.00015002751,0.3520146,0.00008756921,0.000038962247,0.00016292681,0.0027960031,0.00040637128,0.004237015],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988175,0.00021116105,0.00011698468,0.00028048718,0.0003462364,0.00022754134],"domain_scores_gemma":[0.99693465,0.0016248989,0.000325587,0.00060562097,0.00033942834,0.00016972049],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005567404,0.00078121043,0.0011650476,0.0007842881,0.0008481183,0.0020329752,0.0013629242,0.0010313665,0.0060201995],"category_scores_gemma":[0.005893437,0.0007025269,0.0011899616,0.0012772987,0.001204342,0.002961222,0.0016877474,0.0009798076,0.0011076359],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011546308,0.0003227734,0.008820598,0.00064694526,0.00010705768,0.0011952155,0.00064956996,0.5173606,0.058280535,0.07567759,0.0059359428,0.3298485],"study_design_scores_gemma":[0.00014151157,0.00035633083,0.0016060309,0.000045104505,0.00005247296,0.0003219012,0.0004411552,0.82688504,0.035236787,0.12798208,0.0068827015,0.00004889879],"about_ca_topic_score_codex":0.0021564008,"about_ca_topic_score_gemma":0.0036959192,"teacher_disagreement_score":0.0060201995,"about_ca_system_score_codex":0.0010358972,"about_ca_system_score_gemma":0.0009851336,"threshold_uncertainty_score":0.020139515},"labels":[],"label_agreement":null},{"id":"W195330644","doi":"10.1142/s0218195911003536","title":"ON COMPUTING ENCLOSING ISOSCELES TRIANGLES AND RELATED PROBLEMS","year":2011,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Isosceles triangle; Computer science; Mathematics; Geometry","score_opus":0.02211372973481942,"score_gpt":0.26956698585340366,"score_spread":0.24745325611858424,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W195330644","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.068120934,0.00045462465,0.9253842,0.0002484321,0.000057850426,0.00008265492,0.00020298823,0.00057811855,0.004870197],"genre_scores_gemma":[0.27196434,0.0004139385,0.7234735,0.0001006336,0.0000887345,0.00013209581,0.0006749873,0.00024964663,0.0029021557],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99921584,0.00021510787,0.00006009877,0.00015952428,0.00026987624,0.00007941629],"domain_scores_gemma":[0.9969434,0.0022187755,0.0001639739,0.0003173099,0.00026001476,0.00009644108],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010633735,0.0008829268,0.0015034477,0.001172278,0.00067381636,0.0012013024,0.0018030067,0.0017048928,0.003872114],"category_scores_gemma":[0.0073578805,0.0004694231,0.0009837708,0.0019107288,0.001293288,0.002742368,0.0019230758,0.0014269244,0.00065686315],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020336648,0.0001039162,0.0014386153,0.00021468353,0.00002922115,0.00021291272,0.00023011719,0.84852946,0.0035010446,0.047346167,0.001930486,0.09626005],"study_design_scores_gemma":[0.000015606509,0.00003078761,0.0001438749,0.000012790783,0.000003227306,0.000067033485,0.00003631308,0.97000533,0.0009944012,0.027866865,0.0008163387,0.0000074707796],"about_ca_topic_score_codex":0.0030461997,"about_ca_topic_score_gemma":0.003719471,"teacher_disagreement_score":0.003872114,"about_ca_system_score_codex":0.0005878583,"about_ca_system_score_gemma":0.0004986801,"threshold_uncertainty_score":0.012953579},"labels":[],"label_agreement":null},{"id":"W1998920351","doi":"10.1142/s0218195912500094","title":"ON THE DISCRETE UNIT DISK COVER PROBLEM","year":2012,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":49,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick; University of Waterloo","funders":"","keywords":"Cover (algebra); Unit disk; Mathematics; Cardinality (data modeling); Combinatorics; Set cover problem; Constant (computer programming); Unit (ring theory); Set (abstract data type); Unit disk graph; Plane (geometry); Approximation algorithm; Point (geometry); Discrete mathematics; Geometry; Computer science","score_opus":0.018088765245865952,"score_gpt":0.2930174984656583,"score_spread":0.27492873321979233,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1998920351","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21311504,0.005645375,0.7165974,0.0048181834,0.00047510446,0.000623082,0.0032222958,0.0025274465,0.052976023],"genre_scores_gemma":[0.63292867,0.0038072935,0.33847138,0.00078057917,0.0006053121,0.00054898794,0.005722307,0.00055818714,0.016577277],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99819297,0.00041088703,0.000081525766,0.0005116699,0.00050208374,0.00030096047],"domain_scores_gemma":[0.9963341,0.00255997,0.00021643152,0.000491959,0.00024312802,0.00015439853],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090960745,0.0012099843,0.0018515114,0.0012421156,0.0012604737,0.0024784436,0.0021137844,0.0018427076,0.011528422],"category_scores_gemma":[0.007221956,0.0005593352,0.0010576784,0.0033848335,0.0013728947,0.005225021,0.00202345,0.0017661008,0.0016746959],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015019769,0.00052851485,0.0021509551,0.0010584662,0.00014847664,0.00063438056,0.0004542995,0.48999125,0.0042823795,0.13992533,0.057114147,0.30220985],"study_design_scores_gemma":[0.00017010761,0.00011768017,0.00068929954,0.000093735616,0.00005764391,0.00054827734,0.00023523839,0.7942967,0.0032711595,0.18245494,0.018019605,0.000045643417],"about_ca_topic_score_codex":0.0043352135,"about_ca_topic_score_gemma":0.0025054477,"teacher_disagreement_score":0.011528422,"about_ca_system_score_codex":0.002165252,"about_ca_system_score_gemma":0.0013123051,"threshold_uncertainty_score":0.03856647},"labels":[],"label_agreement":null},{"id":"W2039598212","doi":"10.1142/s0218195900000073","title":"COMPUTATIONAL GEOMETRY COLUMN 37","year":2000,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Column (typography); Geometry; Combinatorics; Computational geometry; Connection (principal bundle)","score_opus":0.010583747335228775,"score_gpt":0.27916497311766797,"score_spread":0.2685812257824392,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2039598212","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015922613,0.074915566,0.013631642,0.033408605,0.16274148,0.00026865155,0.014525407,0.0019731699,0.6969432],"genre_scores_gemma":[0.007294011,0.043942448,0.008615161,0.005257829,0.064178854,0.00020924184,0.021569785,0.0022603853,0.8466723],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99870074,0.000092077455,0.000075982054,0.0003257864,0.00068518985,0.00012020417],"domain_scores_gemma":[0.9962697,0.00057925505,0.00013568698,0.00036604443,0.0016957083,0.0009536385],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00079042953,0.0017771738,0.0018699158,0.004760129,0.001577202,0.006238536,0.001843513,0.0014422518,0.38960418],"category_scores_gemma":[0.0034882727,0.0008187816,0.0013453331,0.0061966274,0.0009997254,0.003479325,0.0028829924,0.0037362953,0.18748564],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023772376,0.000025635398,0.0000629448,0.00022845315,0.00000835368,0.000028498245,0.000006994587,0.00018267783,0.00023396156,0.00501189,0.9433613,0.05082554],"study_design_scores_gemma":[0.000010192245,0.000022112423,0.00034991105,0.00019860074,0.000007041323,0.00011714539,0.000020745792,0.00020075658,0.00024427724,0.0082372185,0.9905821,0.000009833058],"about_ca_topic_score_codex":0.0041576987,"about_ca_topic_score_gemma":0.0117314635,"teacher_disagreement_score":0.6103958,"about_ca_system_score_codex":0.0028195493,"about_ca_system_score_gemma":0.0036593892,"threshold_uncertainty_score":0.87065554},"labels":[],"label_agreement":null},{"id":"W2042411230","doi":"10.1142/s0218195911003718","title":"STOKER'S THEOREM FOR ORTHOGONAL POLYHEDRA","year":2011,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Polyhedron; Mathematics; Regular polygon; Dihedral angle; Uniqueness; Combinatorics; Enhanced Data Rates for GSM Evolution; Geometry; Mathematical analysis; Computer science","score_opus":0.015015808765644074,"score_gpt":0.24725560740559002,"score_spread":0.23223979863994595,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2042411230","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03991382,0.0004164079,0.9243306,0.0006781737,0.00023206547,0.000111212314,0.00044683655,0.000415533,0.033455335],"genre_scores_gemma":[0.52139485,0.0015731932,0.44115695,0.0012877382,0.000399829,0.0005725727,0.0014355158,0.0005185323,0.031660743],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979073,0.00029472026,0.00016065019,0.0006284952,0.0006649945,0.0003439724],"domain_scores_gemma":[0.99558073,0.002570256,0.00020445039,0.00081090594,0.000646864,0.00018681918],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015759321,0.00081104826,0.0014741808,0.0013342934,0.0024080342,0.0032417818,0.0016089198,0.0015696178,0.008833304],"category_scores_gemma":[0.0094480235,0.00061973144,0.002151937,0.0019007237,0.0035098167,0.007841564,0.00366895,0.0044208854,0.002121822],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007829928,0.000035930643,0.00031796118,0.00013313186,0.000019005667,0.000081504826,0.00016394188,0.016078092,0.0017224962,0.9404718,0.004437441,0.03646043],"study_design_scores_gemma":[0.000022470389,0.000034869463,0.00011145806,0.000027629458,0.000010424548,0.000110966146,0.00007945382,0.042723514,0.0021497384,0.94795173,0.006752454,0.000025195372],"about_ca_topic_score_codex":0.0011962588,"about_ca_topic_score_gemma":0.001068795,"teacher_disagreement_score":0.008833304,"about_ca_system_score_codex":0.0011061054,"about_ca_system_score_gemma":0.0015114371,"threshold_uncertainty_score":0.029550374},"labels":[],"label_agreement":null},{"id":"W2044795021","doi":"10.1142/s0218195912500112","title":"PROXIMITY GRAPHS: E, δ, Δ, χ AND ω","year":2012,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Mathematics; Combinatorics; Chordal graph; Planar graph; Discrete mathematics; Clique number; 1-planar graph; Pathwidth; Graph; Line graph","score_opus":0.013881614469072502,"score_gpt":0.28432210158644977,"score_spread":0.2704404871173773,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2044795021","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5861648,0.0012437665,0.37534544,0.0014660967,0.0001084653,0.00022313716,0.001303634,0.0004213629,0.033723377],"genre_scores_gemma":[0.93123525,0.00067944225,0.06345463,0.0001811712,0.00010363356,0.00016634594,0.0006087096,0.00009051924,0.0034802975],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986858,0.0003007047,0.00008626451,0.00044776595,0.0003373635,0.00014205478],"domain_scores_gemma":[0.9872246,0.00831062,0.0020590264,0.0008038851,0.0008160595,0.00078584114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000960783,0.00063942233,0.0006065241,0.0023537725,0.0017289255,0.0019500342,0.0013793369,0.0012529531,0.0049889167],"category_scores_gemma":[0.012201487,0.00047611177,0.0005926755,0.0034717827,0.0022322766,0.0040783645,0.0019082678,0.0015498888,0.000396734],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034780838,0.00014817338,0.0108745815,0.00060097163,0.00007217242,0.00075921044,0.001185707,0.030669963,0.008930516,0.8752451,0.0035818587,0.06758403],"study_design_scores_gemma":[0.000058030826,0.00021020108,0.009441619,0.0001445766,0.00011163398,0.0042948076,0.0020897384,0.09350164,0.010756462,0.8610872,0.01821571,0.0000883854],"about_ca_topic_score_codex":0.0008581284,"about_ca_topic_score_gemma":0.00074675836,"teacher_disagreement_score":0.0049889167,"about_ca_system_score_codex":0.0011822974,"about_ca_system_score_gemma":0.00045504168,"threshold_uncertainty_score":0.016689539},"labels":[],"label_agreement":null},{"id":"W2055608379","doi":"10.1142/s0218195911003810","title":"CONSTRUCTING CONSTRAINED DELAUNAY TETRAHEDRALIZATIONS OF VOLUMES BOUNDED BY PIECEWISE SMOOTH SURFACES","year":2011,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Delaunay triangulation; Chew's second algorithm; Bowyer–Watson algorithm; Ruppert's algorithm; Mathematics; Constrained Delaunay triangulation; Boundary (topology); Surface triangulation; Polygon mesh; Bounded function; Pitteway triangulation; Algorithm; Vertex (graph theory); Piecewise; Discretization; Triangulation; Topology (electrical circuits); Geometry; Combinatorics; Mathematical analysis","score_opus":0.016794818185421435,"score_gpt":0.26329315313191276,"score_spread":0.24649833494649132,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2055608379","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008120102,0.00002781636,0.99070436,0.00001963276,0.000009372694,0.000053287928,0.0000705558,0.0003161039,0.0006787829],"genre_scores_gemma":[0.11899562,0.000099011064,0.8786992,0.000031312993,0.000010908353,0.0002513464,0.00050365715,0.00043320103,0.00097584346],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989875,0.00013072937,0.00006750416,0.00018557528,0.00055098993,0.00007767725],"domain_scores_gemma":[0.9987697,0.000500373,0.00012632928,0.00028886466,0.00026475574,0.000049924645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007570862,0.00087299786,0.0014522383,0.0010450423,0.0005953815,0.0012292642,0.0019664743,0.00092898606,0.0031757413],"category_scores_gemma":[0.0045468756,0.001065636,0.0011988528,0.0009033267,0.0009309842,0.001333368,0.00264532,0.0015246049,0.00094164023],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010770499,0.000031929423,0.00097423466,0.00019488408,0.000051885472,0.0002485906,0.00047760084,0.7601721,0.020885915,0.04225553,0.0031573572,0.17144229],"study_design_scores_gemma":[0.000012769831,0.000028911749,0.00010924663,0.000017693921,0.000006247138,0.000064535285,0.00008751466,0.9759635,0.0048265746,0.014506532,0.0043589105,0.000017567196],"about_ca_topic_score_codex":0.0030747498,"about_ca_topic_score_gemma":0.00363398,"teacher_disagreement_score":0.0031757413,"about_ca_system_score_codex":0.00064360216,"about_ca_system_score_gemma":0.0011094407,"threshold_uncertainty_score":0.010623872},"labels":[],"label_agreement":null},{"id":"W2073199795","doi":"10.1142/s0218195914600048","title":"A POLYNOMIAL-TIME ALGORITHM FOR COMPUTING THE RESILIENCE OF ARRANGEMENTS OF RAY SENSORS","year":2014,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina; University of British Columbia","funders":"","keywords":"Resilience (materials science); Path (computing); Time complexity; Plane (geometry); Polynomial; Algorithm; Line (geometry); Mathematics; Wireless sensor network; Domain (mathematical analysis); Computer science; Geometry; Computer network; Mathematical analysis; Physics","score_opus":0.008442197794523045,"score_gpt":0.27682705252921863,"score_spread":0.2683848547346956,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2073199795","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.093832314,0.00082465104,0.8851955,0.00096401636,0.00010478974,0.0004011672,0.0019501246,0.009039912,0.0076876124],"genre_scores_gemma":[0.34068036,0.00025985332,0.6515525,0.00015350644,0.000050838804,0.00031304773,0.0033738825,0.00042349313,0.003192487],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99882656,0.00013879899,0.000090501366,0.0004191295,0.00023789558,0.00028714794],"domain_scores_gemma":[0.9968526,0.0018823633,0.0003457606,0.00051645964,0.00021156282,0.00019124303],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084235135,0.0015916813,0.0015754843,0.001864651,0.0011939058,0.0020492168,0.0029284733,0.0016616343,0.007881769],"category_scores_gemma":[0.0049053454,0.0008741415,0.001589956,0.0023501015,0.0012413445,0.0037406462,0.0025831575,0.0014836751,0.0014829132],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011772963,0.00027578848,0.0040589483,0.0008065925,0.00019727937,0.00031167862,0.00046605666,0.6142739,0.011988252,0.026797108,0.020238535,0.31940866],"study_design_scores_gemma":[0.00021056796,0.00013771298,0.0007030982,0.000030737676,0.00004831447,0.00016329072,0.0002022565,0.9557741,0.0030693333,0.036633957,0.0029974345,0.000029045676],"about_ca_topic_score_codex":0.0067598317,"about_ca_topic_score_gemma":0.01014617,"teacher_disagreement_score":0.007881769,"about_ca_system_score_codex":0.0020233903,"about_ca_system_score_gemma":0.0026632927,"threshold_uncertainty_score":0.026367128},"labels":[],"label_agreement":null},{"id":"W2074574297","doi":"10.1142/s0218195905001762","title":"SEPARATING POINT SETS IN POLYGONAL ENVIRONMENTS","year":2005,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Natural Sciences and Engineering Research Council of Canada; Queen's University","funders":"","keywords":"Mathematics; Geodesic; Polygon (computer graphics); Combinatorics; Chord (peer-to-peer); Point (geometry); Path (computing); Set (abstract data type); Pairwise comparison; Algorithm; Geometry; Computer science","score_opus":0.010807649532028845,"score_gpt":0.2926302831839573,"score_spread":0.28182263365192844,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2074574297","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13258258,0.0004368507,0.8558871,0.00030917293,0.000044625787,0.00013139911,0.00022283739,0.00029741376,0.010087905],"genre_scores_gemma":[0.620282,0.0005962661,0.37087372,0.000092609305,0.00007185706,0.00030864865,0.00081681414,0.00016607741,0.0067920554],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99798065,0.00045279888,0.00014174481,0.0004147604,0.00065916986,0.00035095928],"domain_scores_gemma":[0.99387133,0.0039751413,0.0008587882,0.00046154924,0.0003221322,0.00051106483],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009932994,0.0011101791,0.0011940594,0.0023564636,0.0020865004,0.002602486,0.002021127,0.00193892,0.004082965],"category_scores_gemma":[0.009636064,0.0010849424,0.0010191017,0.0021737278,0.0034278184,0.0040334202,0.0073119304,0.0018895558,0.0009358285],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041119842,0.00010132023,0.0018859063,0.00026752648,0.00007418092,0.0012777789,0.0010486244,0.51266164,0.0051790657,0.43122405,0.0014138465,0.044454835],"study_design_scores_gemma":[0.00008549142,0.00012134325,0.0003990754,0.000067759946,0.00003217012,0.00053712574,0.00060267147,0.5034417,0.004673328,0.47981393,0.010170905,0.000054628264],"about_ca_topic_score_codex":0.0014289682,"about_ca_topic_score_gemma":0.001142023,"teacher_disagreement_score":0.004082965,"about_ca_system_score_codex":0.0010237996,"about_ca_system_score_gemma":0.0006614976,"threshold_uncertainty_score":0.013658941},"labels":[],"label_agreement":null},{"id":"W2096451963","doi":"10.1142/s0218195908002751","title":"MEDIAL AXIS APPROXIMATION AND UNSTABLE FLOW COMPLEX","year":2008,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Medial axis; Mathematics; Boundary (topology); Topology (electrical circuits); Homotopy; Bounded function; Flow (mathematics); Simply connected space; Closeness; Geometry; Mathematical analysis; Combinatorics; Pure mathematics","score_opus":0.023305508746308278,"score_gpt":0.27423292670955524,"score_spread":0.25092741796324697,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096451963","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.096165165,0.00012757292,0.90069264,0.0001211158,0.000025094183,0.000061937106,0.00006690378,0.00031660774,0.00242297],"genre_scores_gemma":[0.67370635,0.00016770986,0.32197967,0.0000544603,0.000037970425,0.00009046276,0.0002717531,0.00016419133,0.0035274257],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99960834,0.00006353968,0.000021485146,0.00008246299,0.00018092369,0.00004329065],"domain_scores_gemma":[0.998838,0.00045855792,0.00016665636,0.00017581483,0.0002442435,0.000116728974],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080475013,0.00048796154,0.0005254403,0.0017374065,0.0005408118,0.0015308288,0.00066413585,0.00069016614,0.0022887057],"category_scores_gemma":[0.0050857374,0.00031178838,0.00050929096,0.0004203754,0.0013482653,0.0014784498,0.0019138231,0.0011979069,0.0005284756],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00057152484,0.00007887399,0.0075113564,0.00016644405,0.000043588778,0.0004937551,0.0008035766,0.3593281,0.0392684,0.41056347,0.0026583534,0.17851253],"study_design_scores_gemma":[0.000017048298,0.00006580925,0.0006454866,0.000019243655,0.0000053494755,0.00014174239,0.000057976406,0.9294942,0.005645317,0.06111293,0.0027790656,0.000015880067],"about_ca_topic_score_codex":0.0014611823,"about_ca_topic_score_gemma":0.0010731764,"teacher_disagreement_score":0.0022887057,"about_ca_system_score_codex":0.0007490095,"about_ca_system_score_gemma":0.000533674,"threshold_uncertainty_score":0.007656455},"labels":[],"label_agreement":null},{"id":"W2098355410","doi":"10.1142/s0218195902000748","title":"APPROXIMATING THE DIAMETER, WIDTH, SMALLEST ENCLOSING CYLINDER, AND MINIMUM-WIDTH ANNULUS","year":2002,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":96,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Annulus (botany); Mathematics; Combinatorics; Cylinder; Dimension (graph theory); Upper and lower bounds; Running time; Point (geometry); Simple (philosophy); RADIUS; Set (abstract data type); Approximation algorithm; Geometry; Mathematical analysis; Algorithm; Computer science","score_opus":0.020348855225838406,"score_gpt":0.2588979367072863,"score_spread":0.23854908148144788,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098355410","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.062628254,0.00071263604,0.9337693,0.00021745988,0.000033824035,0.00003179308,0.00011780028,0.0005716485,0.0019172521],"genre_scores_gemma":[0.3267605,0.000633307,0.67003566,0.00005301276,0.00009005134,0.00013589878,0.00043169767,0.0003213822,0.0015385067],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99919575,0.00019024905,0.000054036067,0.00016882061,0.00029955394,0.00009147804],"domain_scores_gemma":[0.99585223,0.002802695,0.00045674355,0.00036994496,0.0003297606,0.00018861418],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018566729,0.0012408013,0.0014114475,0.0013047428,0.00034489526,0.0009785206,0.0017430643,0.0012700447,0.0011307088],"category_scores_gemma":[0.0127878105,0.0007020025,0.00081099727,0.0011446172,0.0009180536,0.003035671,0.0019654965,0.0010738703,0.0004909685],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006591577,0.000106111096,0.004461686,0.00036163186,0.00005338106,0.00015406054,0.00025285414,0.79607147,0.01069506,0.06681596,0.0039561237,0.11641248],"study_design_scores_gemma":[0.000031481788,0.00004557388,0.00041413243,0.000015885176,0.000009704118,0.00006754017,0.000025466883,0.9736719,0.0029134925,0.02198331,0.00080832845,0.000013292449],"about_ca_topic_score_codex":0.001718797,"about_ca_topic_score_gemma":0.0014875598,"teacher_disagreement_score":0.0018566729,"about_ca_system_score_codex":0.0007810505,"about_ca_system_score_gemma":0.0007188435,"threshold_uncertainty_score":0.00981915},"labels":[],"label_agreement":null},{"id":"W2099432728","doi":"10.1142/s0218195907002380","title":"ON THE EXPECTED SIZE OF THE 2D VISIBILITY COMPLEX","year":2007,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Visibility; Disjoint sets; Mathematics; Bounded function; Unit (ring theory); Plane (geometry); Combinatorics; Geometry; Mathematical analysis; Optics; Physics","score_opus":0.019550224768341694,"score_gpt":0.3028139018826694,"score_spread":0.2832636771143277,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099432728","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7657931,0.0004965631,0.22769462,0.00061979645,0.000035891033,0.000053316817,0.0003299109,0.0003665303,0.004610241],"genre_scores_gemma":[0.98271495,0.00019144692,0.01586004,0.000037919017,0.000029455923,0.00006979266,0.0003444387,0.00011402158,0.0006379921],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99824214,0.0005169275,0.00007716155,0.0003290244,0.00062344386,0.00021135987],"domain_scores_gemma":[0.935215,0.053832285,0.004574582,0.0022296242,0.002293992,0.0018545326],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025766569,0.00062596356,0.00085699424,0.0017169537,0.0006384903,0.0020976157,0.0015632698,0.0012345533,0.0029532462],"category_scores_gemma":[0.046141654,0.00066722895,0.00040534456,0.0007269401,0.0024342777,0.004431404,0.0017749522,0.001213222,0.00026223806],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012009129,0.00033731555,0.03797196,0.0004749328,0.00012364105,0.0015780966,0.00084763125,0.5868412,0.073646285,0.25918502,0.0025699895,0.035222996],"study_design_scores_gemma":[0.000045952558,0.00014907,0.0064942264,0.00003912172,0.000019909632,0.00077542174,0.000145113,0.924212,0.01654237,0.050986834,0.0005266982,0.00006339228],"about_ca_topic_score_codex":0.0007408211,"about_ca_topic_score_gemma":0.00035305702,"teacher_disagreement_score":0.0029532462,"about_ca_system_score_codex":0.0014373604,"about_ca_system_score_gemma":0.0005622143,"threshold_uncertainty_score":0.0136268735},"labels":[],"label_agreement":null},{"id":"W2099582307","doi":"10.1142/s0218195906001975","title":"GEOMETRIC OPTIMIZATION PROBLEMS OVER SLIDING WINDOWS","year":2006,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Logarithm; Sublinear function; Dimension (graph theory); Constant (computer programming); Point (geometry); Simple (philosophy); Set (abstract data type); Sliding window protocol; Optimization problem; Space (punctuation); Upper and lower bounds; Mathematical optimization; Window (computing); Applied mathematics; Combinatorics; Mathematical analysis; Geometry; Computer science","score_opus":0.01009771432731352,"score_gpt":0.2581873079074709,"score_spread":0.2480895935801574,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099582307","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06342205,0.0013956038,0.9322438,0.00045554736,0.00008412229,0.000041827923,0.00010038303,0.00037186118,0.0018847318],"genre_scores_gemma":[0.6616038,0.0024059864,0.327165,0.00016689693,0.00027554636,0.00028450607,0.000451278,0.00034092754,0.0073060095],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99908555,0.000254404,0.00006147583,0.0002863188,0.00019380117,0.00011852693],"domain_scores_gemma":[0.9947397,0.0039896374,0.00046776352,0.00037264937,0.00020278794,0.0002274698],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020180284,0.0013692896,0.0019194384,0.0009076089,0.00050546305,0.0014863252,0.0017502151,0.0015897395,0.002701149],"category_scores_gemma":[0.009185926,0.00085942657,0.00095385016,0.0015151622,0.0014043079,0.0039609154,0.0020724444,0.0019750013,0.00044717386],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003028058,0.000059868496,0.0008827244,0.00015628246,0.00007970003,0.0001275212,0.0001006984,0.8778149,0.0023702965,0.078381196,0.0015868787,0.038137097],"study_design_scores_gemma":[0.00001522,0.000030503254,0.00010603697,0.000006171633,0.00000664621,0.0000131204115,0.000009518948,0.974116,0.0004373206,0.024826348,0.00042868147,0.0000043513473],"about_ca_topic_score_codex":0.0034424819,"about_ca_topic_score_gemma":0.0014267837,"teacher_disagreement_score":0.0034424819,"about_ca_system_score_codex":0.0013590145,"about_ca_system_score_gemma":0.0006686434,"threshold_uncertainty_score":0.01067251},"labels":[],"label_agreement":null},{"id":"W2100302985","doi":"10.1142/s021819591360011x","title":"ROBUST NONPARAMETRIC SIMPLIFICATION OF POLYGONAL CHAINS","year":2013,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Subsequence; Polygonal chain; Combinatorics; Cardinality (data modeling); Simple (philosophy); Nonparametric statistics; Sequence (biology); Mathematics; Monotonic function; Chain (unit); Piecewise; Piecewise linear function; Plane (geometry); Binary logarithm; Algorithm; Discrete mathematics; Computer science; Geometry; Bounded function; Regular polygon; Mathematical analysis; Statistics","score_opus":0.019437849981048746,"score_gpt":0.26814273900463526,"score_spread":0.2487048890235865,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100302985","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011919532,0.00007620451,0.9871826,0.00003679668,0.000008310908,0.000020996149,0.00007692687,0.00032038652,0.00035822543],"genre_scores_gemma":[0.311125,0.00033845365,0.6843989,0.00007787359,0.00007780434,0.00018605766,0.0012979886,0.00035111816,0.0021468098],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976649,0.000568117,0.00012485268,0.0004955899,0.0009671155,0.00017941085],"domain_scores_gemma":[0.99392396,0.0028864592,0.00082816754,0.0017451717,0.00044432393,0.00017184309],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022761563,0.0008356129,0.0019850566,0.0021788816,0.00077621604,0.0015167125,0.0028391476,0.0010591495,0.0022647036],"category_scores_gemma":[0.013844443,0.0009973039,0.0014256318,0.0024336237,0.0015679327,0.0025783498,0.0022762085,0.0022416764,0.00076546514],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002081535,0.0000456727,0.0025299808,0.000120906,0.00009046334,0.00018338833,0.00017789411,0.812744,0.009039699,0.022757944,0.0012005003,0.15090133],"study_design_scores_gemma":[0.000005471035,0.000025597377,0.00028019794,0.0000074554023,0.0000066609005,0.000060920494,0.000018190076,0.9887158,0.001994919,0.0076688183,0.0012063272,0.000009589063],"about_ca_topic_score_codex":0.0038325253,"about_ca_topic_score_gemma":0.0039048824,"teacher_disagreement_score":0.0038325253,"about_ca_system_score_codex":0.0010876708,"about_ca_system_score_gemma":0.0013086507,"threshold_uncertainty_score":0.012037575},"labels":[],"label_agreement":null},{"id":"W2100928221","doi":"10.1142/s0218195905001683","title":"GEOMETRIC ALGORITHMS FOR DENSITY-BASED DATA CLUSTERING","year":2005,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Cluster analysis; Approximation algorithm; Algorithm; Mathematics; Quadratic equation; Data point","score_opus":0.046781824903133894,"score_gpt":0.33619353800168617,"score_spread":0.2894117130985523,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100928221","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007393097,0.0003549548,0.9979151,0.000095555835,0.000026722644,0.000036909263,0.000045134497,0.00034848994,0.0004378607],"genre_scores_gemma":[0.04272176,0.0011200015,0.953919,0.00010355579,0.00010718346,0.00026177126,0.0005808929,0.00017041905,0.0010154713],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9954035,0.0012204612,0.00030851967,0.00074243563,0.0021177542,0.00020728423],"domain_scores_gemma":[0.9940181,0.0025686275,0.0005381897,0.0014909579,0.0012522055,0.0001319643],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033342692,0.0017337649,0.0022537883,0.0043659564,0.0014107939,0.0026670839,0.004281228,0.0022043062,0.0035056218],"category_scores_gemma":[0.018170351,0.0013111326,0.0018571615,0.006156098,0.0020525586,0.005089718,0.0044358387,0.0034055873,0.0026777822],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000105998275,0.00007032574,0.0010393971,0.00038902398,0.0001216864,0.00007267377,0.00026041392,0.5768158,0.0015593991,0.15794806,0.0074401367,0.25417715],"study_design_scores_gemma":[0.000023448652,0.000028189468,0.00021557366,0.000035396853,0.000015554526,0.00010802089,0.00005575774,0.881256,0.0012200513,0.108546324,0.008467405,0.000028234559],"about_ca_topic_score_codex":0.0055854656,"about_ca_topic_score_gemma":0.0036597957,"teacher_disagreement_score":0.0055854656,"about_ca_system_score_codex":0.0030499552,"about_ca_system_score_gemma":0.0020583812,"threshold_uncertainty_score":0.022129059},"labels":[],"label_agreement":null},{"id":"W2101955916","doi":"10.1142/s0218195909002861","title":"DELAUNAY AND DIAMOND TRIANGULATIONS CONTAIN SPANNERS OF BOUNDED DEGREE","year":2009,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Delaunay triangulation; Combinatorics; Spanner; Mathematics; Degree (music); Unit disk graph; Vertex (graph theory); Bounded function; Minimum-weight triangulation; Constant (computer programming); Upper and lower bounds; Point set triangulation; Graph; Pitteway triangulation; Discrete mathematics; Constrained Delaunay triangulation; Mathematical analysis; Computer science; Physics","score_opus":0.01813034938883125,"score_gpt":0.2913733717094611,"score_spread":0.27324302232062986,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2101955916","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16624077,0.00038951746,0.81982785,0.00021305656,0.000032872525,0.0001537762,0.00030913253,0.00053618295,0.012296895],"genre_scores_gemma":[0.45051894,0.00030372632,0.54223734,0.00008307571,0.000018177489,0.0001587674,0.000829564,0.00016833063,0.0056820777],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99916816,0.00016752555,0.000057400208,0.00021764245,0.00026456296,0.00012473317],"domain_scores_gemma":[0.99852353,0.000601907,0.00021076758,0.00037312252,0.00017372522,0.00011692271],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045962082,0.0004138665,0.0005334205,0.00043658548,0.00038193184,0.00054028165,0.0007536425,0.0004834662,0.004493834],"category_scores_gemma":[0.0036770795,0.00053616497,0.00047827946,0.0007199041,0.0005710846,0.0014517101,0.0024356015,0.00057043665,0.0007158076],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00076790334,0.00014327264,0.0074476916,0.00062358665,0.00008194801,0.00064616883,0.001063376,0.3679996,0.05503817,0.18446687,0.0058472403,0.3758741],"study_design_scores_gemma":[0.00015528509,0.00042913837,0.0030650669,0.00011964364,0.00003984113,0.0010075453,0.0004865319,0.75197256,0.04832007,0.16632716,0.02803076,0.00004636675],"about_ca_topic_score_codex":0.0015061636,"about_ca_topic_score_gemma":0.0025486131,"teacher_disagreement_score":0.004493834,"about_ca_system_score_codex":0.00045592894,"about_ca_system_score_gemma":0.00043318095,"threshold_uncertainty_score":0.015033364},"labels":[],"label_agreement":null},{"id":"W2102172432","doi":"10.1142/s0218195910003232","title":"GENERALIZED WATCHMAN ROUTE PROBLEM WITH DISCRETE VIEW COST","year":2010,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Polygon (computer graphics); Mathematics; Approximation algorithm; Combinatorics; Boundary (topology); Viewpoints; Time complexity; Mathematical optimization; Algorithm; Discrete mathematics; Computer science","score_opus":0.012058966365115536,"score_gpt":0.2997036074054154,"score_spread":0.28764464104029985,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102172432","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.083811566,0.0005227385,0.90842766,0.00049863453,0.00008201779,0.0001462676,0.0005904861,0.00052259886,0.005398057],"genre_scores_gemma":[0.4653206,0.0006560848,0.52240175,0.00020920791,0.000097965814,0.00040526743,0.0020211784,0.00031974594,0.008568166],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992841,0.00022139931,0.000032711694,0.00023584675,0.00011996669,0.000105918705],"domain_scores_gemma":[0.9989987,0.0005458712,0.00011562918,0.00018604449,0.000072720904,0.00008094975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006860593,0.0010327509,0.0013478782,0.00038448925,0.00052336074,0.0013072585,0.0020669203,0.0014849763,0.0053850682],"category_scores_gemma":[0.0019149291,0.00060894236,0.001065899,0.0009055522,0.0007589654,0.0034650255,0.001303505,0.001725198,0.00048351663],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045936918,0.00018460279,0.0010837903,0.00048745016,0.0001319951,0.0006744843,0.00023592058,0.784889,0.0061682467,0.10624196,0.008111833,0.09133134],"study_design_scores_gemma":[0.000106179745,0.00022485243,0.00043898742,0.00002457573,0.000043270717,0.00038121847,0.00014330924,0.912872,0.002097301,0.07530287,0.008334769,0.000030686046],"about_ca_topic_score_codex":0.002589149,"about_ca_topic_score_gemma":0.0030787908,"teacher_disagreement_score":0.0053850682,"about_ca_system_score_codex":0.0007509771,"about_ca_system_score_gemma":0.00080442266,"threshold_uncertainty_score":0.018014848},"labels":[],"label_agreement":null},{"id":"W2102779916","doi":"10.1142/s0218195900000218","title":"A COST/BENEFIT ANALYSIS OF SIMPLICIAL MESH IMPROVEMENT TECHNIQUES AS MEASURED BY SOLUTION EFFICIENCY","year":2000,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Polygon mesh; Mathematical optimization; Laplacian smoothing; Finite element method; Simple (philosophy); Smoothing; Computer science; Eigenvalues and eigenvectors; Finite volume method; T-vertices; Mathematics; Quality (philosophy); Algorithm; Applied mathematics; Mesh generation; Geometry","score_opus":0.013400962522910589,"score_gpt":0.30061710136805564,"score_spread":0.2872161388451451,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102779916","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38551143,0.0056312815,0.5745727,0.0026324873,0.00008935211,0.00042085463,0.00021198431,0.00055900356,0.030371014],"genre_scores_gemma":[0.84508836,0.0015527498,0.15032303,0.0001327668,0.000072572395,0.00021567452,0.00012342179,0.00020957603,0.0022818916],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99473697,0.0026487978,0.00015935555,0.00016986136,0.0019733608,0.0003116111],"domain_scores_gemma":[0.9624194,0.030978478,0.0014455892,0.0029640682,0.0019387088,0.00025380126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0062643965,0.0006815162,0.0007245561,0.001768138,0.00040596578,0.001098201,0.0010886063,0.0012753597,0.003473408],"category_scores_gemma":[0.040437765,0.00039849087,0.0007637747,0.0018713822,0.0012117911,0.0020176433,0.0014182086,0.0008108794,0.0005227049],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009729388,0.00026329985,0.0071928683,0.00045191307,0.00017144984,0.00015343328,0.00016038962,0.72849166,0.014914655,0.07232555,0.0010946261,0.17380722],"study_design_scores_gemma":[0.000119098826,0.0007200385,0.0057111518,0.000068861955,0.00017161648,0.00031001584,0.00011901819,0.9501692,0.012518923,0.02745782,0.0025946132,0.00003967124],"about_ca_topic_score_codex":0.0005608748,"about_ca_topic_score_gemma":0.0005348606,"teacher_disagreement_score":0.0062643965,"about_ca_system_score_codex":0.0007630061,"about_ca_system_score_gemma":0.0006583215,"threshold_uncertainty_score":0.03312975},"labels":[],"label_agreement":null},{"id":"W2102922436","doi":"10.1142/s0218195900000048","title":"POINT VISIBILITY GRAPHS AND ${\\mathcal O}$-CONVEX COVER","year":2000,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Mathematics; Visibility graph; Polygon (computer graphics); Visibility polygon; Regular polygon; Visibility; Cardinality (data modeling); Uncountable set; Discrete mathematics; Polygon covering; Computer science; Geometry","score_opus":0.00838546564601397,"score_gpt":0.2720966079656274,"score_spread":0.26371114231961346,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102922436","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39783317,0.0003591336,0.57059425,0.0009084682,0.000032827174,0.00011808449,0.0010359746,0.0007041917,0.028413944],"genre_scores_gemma":[0.90095526,0.000335733,0.08914511,0.00014405132,0.000036975263,0.000102622704,0.0013506325,0.00021070291,0.007718965],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992712,0.00009994693,0.00003652273,0.0002443711,0.00019400992,0.00015388455],"domain_scores_gemma":[0.99782073,0.0011068624,0.0003931892,0.00038941237,0.00012975145,0.00015995554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000330058,0.00045114374,0.0005065471,0.0006416863,0.0009488735,0.001708091,0.0010409049,0.0006213241,0.0049315835],"category_scores_gemma":[0.0037375907,0.00043323298,0.00075696246,0.0008910724,0.0017720686,0.004014928,0.0018901008,0.0010185004,0.00033410112],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016095459,0.00005907758,0.002524826,0.00014770318,0.000027656457,0.00030923574,0.00051008235,0.1065726,0.0056485045,0.82889795,0.0029559263,0.052185442],"study_design_scores_gemma":[0.000028046512,0.00005555143,0.0017215622,0.00003439432,0.000026144618,0.00026143432,0.00026665998,0.2128008,0.0063606817,0.769008,0.009412831,0.000023976736],"about_ca_topic_score_codex":0.004681929,"about_ca_topic_score_gemma":0.0036871433,"teacher_disagreement_score":0.0049315835,"about_ca_system_score_codex":0.0012680244,"about_ca_system_score_gemma":0.0007581519,"threshold_uncertainty_score":0.016497731},"labels":[],"label_agreement":null},{"id":"W2103189192","doi":"10.1142/s0218195912600096","title":"THREE PROBLEMS ABOUT DYNAMIC CONVEX HULLS","year":2012,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Convex hull; Combinatorics; Mathematics; Amortized analysis; Binary logarithm; Line segment; Plane (geometry); Line (geometry); Data structure; Computational geometry; Regular polygon; Range (aeronautics); Competitive analysis; Set (abstract data type); Convex set; Upper and lower bounds; Algorithm; Convex optimization; Geometry; Computer science; Mathematical analysis","score_opus":0.013952405619557368,"score_gpt":0.28906387226589997,"score_spread":0.2751114666463426,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2103189192","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0152043095,0.0015363139,0.96942925,0.0050403946,0.00024481298,0.00014458867,0.00071667595,0.0016907102,0.005993008],"genre_scores_gemma":[0.27902004,0.0033664757,0.6961744,0.001656035,0.0020293337,0.0006836662,0.0031057734,0.0011578333,0.012806515],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9904323,0.0015098031,0.0006806731,0.0026977211,0.0034868366,0.0011927522],"domain_scores_gemma":[0.9521408,0.024143567,0.0029374617,0.016198218,0.0035205963,0.0010593474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046015256,0.0017129561,0.002151252,0.0018479079,0.0027182875,0.0057762936,0.0075503564,0.0037096736,0.009901887],"category_scores_gemma":[0.028138952,0.001700244,0.0029144126,0.0056461105,0.005434466,0.022254383,0.009881315,0.008794151,0.0022644643],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000990857,0.000512012,0.003554422,0.0011093828,0.00017237275,0.00043774038,0.0011362663,0.12112276,0.0076904744,0.34378168,0.03714401,0.48234802],"study_design_scores_gemma":[0.0002469658,0.00031333612,0.0017744134,0.0001681963,0.000121424506,0.0013359168,0.0008662022,0.4305415,0.017950777,0.5034378,0.04303791,0.00020553828],"about_ca_topic_score_codex":0.005305208,"about_ca_topic_score_gemma":0.0022634421,"teacher_disagreement_score":0.009901887,"about_ca_system_score_codex":0.002954673,"about_ca_system_score_gemma":0.0020169846,"threshold_uncertainty_score":0.033125103},"labels":[],"label_agreement":null},{"id":"W2105525115","doi":"10.1142/s0218195903001207","title":"THE LARGEST EMPTY ANNULUS PROBLEM","year":2003,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Mathematics; Combinatorics; Annulus (botany); Minimax; Euclidean space; Plane (geometry); Constant (computer programming); Space (punctuation); Circumference; Upper and lower bounds; Concentric; 1-center problem; Binary logarithm; Facility location problem; Discrete mathematics; Geometry; Mathematical optimization; Mathematical analysis; Computer science","score_opus":0.00901005290849842,"score_gpt":0.2732297818459956,"score_spread":0.2642197289374972,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105525115","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12859541,0.0027084057,0.84215313,0.0024843137,0.00021825024,0.00030956077,0.002543402,0.001899968,0.019087534],"genre_scores_gemma":[0.44249213,0.0010404801,0.54163426,0.0004269886,0.00024734414,0.00042520792,0.004388666,0.0005914382,0.0087534785],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977348,0.0007492114,0.00018198582,0.00067346764,0.00034540452,0.00031513043],"domain_scores_gemma":[0.9959544,0.0025409951,0.00037326012,0.00054494507,0.00028149635,0.0003049399],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002358635,0.001015805,0.003110608,0.0010418697,0.0015965392,0.0025530087,0.0029482266,0.0028470166,0.008298377],"category_scores_gemma":[0.009949421,0.0009244978,0.0014930974,0.0017360002,0.0016213576,0.00572676,0.0034110686,0.0014352362,0.00208003],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0023811169,0.00038396948,0.003979705,0.001720703,0.00019190904,0.0009561726,0.0013198066,0.46326545,0.007855823,0.23191454,0.05580163,0.23022915],"study_design_scores_gemma":[0.0003495671,0.00040051,0.0011656667,0.00017388114,0.00010598915,0.0011461591,0.0008351497,0.68008476,0.006385487,0.2783577,0.030906903,0.000088217384],"about_ca_topic_score_codex":0.001276133,"about_ca_topic_score_gemma":0.0011301575,"teacher_disagreement_score":0.008298377,"about_ca_system_score_codex":0.00076604454,"about_ca_system_score_gemma":0.0011921029,"threshold_uncertainty_score":0.027760804},"labels":[],"label_agreement":null},{"id":"W2105729287","doi":"10.1142/s0218195910003207","title":"DILATION-OPTIMAL EDGE DELETION IN POLYGONAL CYCLES","year":2010,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Dilation (metric space); Mathematics; Combinatorics; Convex polygon; Regular polygon; Shortest path problem; Euclidean geometry; Time complexity; Polygon (computer graphics); Path (computing); Binary logarithm; Geometry; Graph; Computer science","score_opus":0.008597747177721698,"score_gpt":0.28283690844958936,"score_spread":0.27423916127186765,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105729287","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30408907,0.0011473959,0.6805301,0.00085459766,0.00016565566,0.00030039105,0.00052239606,0.0017537244,0.010636771],"genre_scores_gemma":[0.55486834,0.00069190294,0.4370011,0.00016756335,0.00006451493,0.00023014468,0.0010119376,0.00029644396,0.0056680418],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99934775,0.00013155682,0.000045537377,0.0001921427,0.00012966059,0.00015340181],"domain_scores_gemma":[0.99827063,0.00088133826,0.00027038675,0.00035624637,0.00011414553,0.00010721119],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000506819,0.00062029844,0.0012100673,0.0006774008,0.00090494106,0.000899539,0.0015087612,0.0008787019,0.003145399],"category_scores_gemma":[0.004069975,0.0005233051,0.0004872441,0.0013165592,0.00078593625,0.0017629687,0.0017203907,0.00063996436,0.0007146162],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012522796,0.00018832902,0.0025646354,0.00053697475,0.000064611355,0.00074526714,0.00040779592,0.6105392,0.03045786,0.044574168,0.008672625,0.2999963],"study_design_scores_gemma":[0.00021497623,0.00030026585,0.000708864,0.000046903097,0.00004357896,0.00049574446,0.00024125841,0.9134287,0.019132176,0.049170073,0.016185002,0.000032405896],"about_ca_topic_score_codex":0.0019610054,"about_ca_topic_score_gemma":0.0022926584,"teacher_disagreement_score":0.003145399,"about_ca_system_score_codex":0.00080010423,"about_ca_system_score_gemma":0.00079375785,"threshold_uncertainty_score":0.010522425},"labels":[],"label_agreement":null},{"id":"W2107749697","doi":"10.1142/s0218195911003627","title":"RECONSTRUCTING CONVEX POLYGONS AND CONVEX POLYHEDRA FROM EDGE AND FACE COUNTS IN ORTHOGONAL PROJECTIONS","year":2011,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Polyhedron; Mathematics; Regular polygon; Combinatorics; Polygon (computer graphics); Rectilinear polygon; Convex polygon; Star-shaped polygon; Face (sociological concept); Enhanced Data Rates for GSM Evolution; Convex polytope; Polygon covering; Convex set; Geometry; Convex optimization; Computer science; Simple polygon; Artificial intelligence","score_opus":0.023415847383909623,"score_gpt":0.28165872347345394,"score_spread":0.2582428760895443,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107749697","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06078024,0.00018478087,0.9365366,0.00017096756,0.000021550895,0.00008039749,0.0003600212,0.00033224572,0.0015331033],"genre_scores_gemma":[0.23422313,0.00036563803,0.7617613,0.000057611625,0.000053522526,0.00023965661,0.0016114077,0.00018665846,0.0015010198],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985563,0.00034565252,0.00008696995,0.000334435,0.0004905699,0.00018598462],"domain_scores_gemma":[0.9948192,0.0034561409,0.00053127843,0.00061555515,0.00039900836,0.000178784],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00105886,0.0014027095,0.0020025107,0.0015142477,0.0007738966,0.0017977613,0.0017191916,0.0013814567,0.0022120862],"category_scores_gemma":[0.00845592,0.0015971275,0.0015593078,0.0024897486,0.0016494556,0.0034195469,0.002293001,0.002552835,0.00062522537],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045652955,0.00018416035,0.003625935,0.00035955242,0.00006746918,0.0004922107,0.00031791514,0.7541073,0.008641381,0.0440414,0.0033439295,0.18436225],"study_design_scores_gemma":[0.000024154613,0.000058688638,0.0005348624,0.000023653492,0.000012151473,0.00018046935,0.00013108317,0.94934857,0.0046784705,0.04380509,0.0011769444,0.00002578664],"about_ca_topic_score_codex":0.0036072037,"about_ca_topic_score_gemma":0.0038305945,"teacher_disagreement_score":0.0036072037,"about_ca_system_score_codex":0.0007645065,"about_ca_system_score_gemma":0.00087241124,"threshold_uncertainty_score":0.007400155},"labels":[],"label_agreement":null},{"id":"W2108375200","doi":"10.1142/s0218195905001841","title":"COMPUTING THE SET OF ALL THE DISTANT HORIZONS OF A TERRAIN","year":2005,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Defense Advanced Research Projects Agency","keywords":"Terrain; Horizon; Mathematics; Combinatorics; Set (abstract data type); Convex hull; Regular polygon; Algorithm; Geometry; Computer science","score_opus":0.01670172683024567,"score_gpt":0.3065674018432316,"score_spread":0.28986567501298593,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2108375200","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5790574,0.0012526533,0.40378097,0.00092624425,0.00007949618,0.00016156751,0.0063689714,0.0015451094,0.006827591],"genre_scores_gemma":[0.7892949,0.0004027275,0.19709568,0.0000839042,0.00006503195,0.00009574908,0.010382538,0.00020356789,0.0023759236],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994647,0.000056747394,0.000034271507,0.00015869716,0.00016677618,0.000118790806],"domain_scores_gemma":[0.9988795,0.00052762515,0.00018072434,0.0001299808,0.00012512776,0.00015702234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040048469,0.0006699057,0.0015760605,0.0018333888,0.0009870788,0.0015683225,0.0014342355,0.0011324611,0.0037430085],"category_scores_gemma":[0.0041743335,0.00065251364,0.0010850013,0.0016937412,0.0007099988,0.0037113358,0.0017475487,0.0011287335,0.00036725312],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010428672,0.0002996008,0.019781534,0.001013332,0.00019709191,0.00084345177,0.00080853456,0.69118315,0.015023996,0.034353204,0.013265561,0.22218764],"study_design_scores_gemma":[0.00009002948,0.00015226731,0.0061839498,0.000076002245,0.00006451678,0.00033783366,0.00074807095,0.9088735,0.0059502316,0.07197208,0.005497591,0.00005404374],"about_ca_topic_score_codex":0.004668729,"about_ca_topic_score_gemma":0.005052351,"teacher_disagreement_score":0.004668729,"about_ca_system_score_codex":0.0006750202,"about_ca_system_score_gemma":0.000872651,"threshold_uncertainty_score":0.012521684},"labels":[],"label_agreement":null},{"id":"W2109083408","doi":"10.1142/s0218195902000803","title":"ON THE TIME BOUND FOR CONVEX DECOMPOSITION OF SIMPLE POLYGONS","year":2002,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":69,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Combinatorics; Mathematics; Simple polygon; Simple (philosophy); Decomposition; Regular polygon; Convex polygon; Geometry","score_opus":0.01666600020750904,"score_gpt":0.2948917396336267,"score_spread":0.27822573942611767,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2109083408","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13094272,0.0061113667,0.80022246,0.002590013,0.00043253956,0.00035292786,0.0018522155,0.009268601,0.048227217],"genre_scores_gemma":[0.501885,0.003053965,0.46796945,0.00080901297,0.00032308482,0.00059466687,0.0050209174,0.0027847071,0.017559268],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996894,0.00051860185,0.00015470675,0.0004801583,0.0010724929,0.0008799214],"domain_scores_gemma":[0.9917563,0.0054635904,0.00047308466,0.0013531784,0.0005330706,0.00042069677],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002073558,0.0026579786,0.0020262655,0.0014800627,0.0011602151,0.0042565246,0.0026946755,0.0013030767,0.020885874],"category_scores_gemma":[0.010545119,0.0010054599,0.0018950846,0.0025562674,0.0015577556,0.0070382194,0.0036516641,0.0021806995,0.0041989987],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.005222025,0.00040876435,0.0031182847,0.0018492534,0.00024949643,0.00064478134,0.000572039,0.40912384,0.05192753,0.07927399,0.044023477,0.4035866],"study_design_scores_gemma":[0.00035490666,0.00027721544,0.0007898372,0.00013555429,0.00013809388,0.00026594492,0.00019695066,0.89647996,0.013443043,0.07703386,0.010837795,0.000046896246],"about_ca_topic_score_codex":0.0063914326,"about_ca_topic_score_gemma":0.010485671,"teacher_disagreement_score":0.020885874,"about_ca_system_score_codex":0.0025608828,"about_ca_system_score_gemma":0.002124116,"threshold_uncertainty_score":0.06987023},"labels":[],"label_agreement":null},{"id":"W2111465243","doi":"10.1142/s0218195905001877","title":"GENERALIZING MONOTONICITY: ON RECOGNIZING SPECIAL CLASSES OF POLYGONS AND POLYHEDRA","year":2005,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Polyhedron; Combinatorics; Mathematics; Vertex (graph theory); Regular polygon; Polygon (computer graphics); Simple polygon; Monotonic function; Convex set; Polygon covering; Convex polytope; Intersection (aeronautics); Star-shaped polygon; Rectilinear polygon; Simple (philosophy); Geometry; Computer science; Convex optimization; Mathematical analysis","score_opus":0.016600819376952018,"score_gpt":0.29098531703691255,"score_spread":0.27438449765996054,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111465243","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16868328,0.0005818706,0.81400967,0.00041032446,0.000092803624,0.00024387018,0.00027552768,0.0012878187,0.014414931],"genre_scores_gemma":[0.53544,0.00076828245,0.45512366,0.00040563729,0.0002455371,0.0002914307,0.0014364594,0.00033600975,0.005952948],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997844,0.00037219358,0.00017916708,0.0006730479,0.0005401306,0.00039149792],"domain_scores_gemma":[0.99316883,0.003212709,0.0006032608,0.002065258,0.0007104076,0.00023965228],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011958942,0.00093331025,0.0010768181,0.0012258101,0.001069808,0.0021230944,0.0022398715,0.0011400139,0.0035849803],"category_scores_gemma":[0.009071864,0.00093739276,0.0017473083,0.0016116513,0.0023874706,0.00799846,0.002753119,0.0021328744,0.0010781125],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007515663,0.00042169023,0.01840045,0.00068783556,0.00008418496,0.0016797507,0.0018132875,0.20337197,0.046473604,0.2634446,0.008431324,0.45443982],"study_design_scores_gemma":[0.00003572874,0.0002132115,0.0038716055,0.00009675747,0.000033301418,0.0013063042,0.0004348602,0.7544368,0.017648574,0.20922223,0.012620081,0.0000806406],"about_ca_topic_score_codex":0.0039721737,"about_ca_topic_score_gemma":0.0037392054,"teacher_disagreement_score":0.0039721737,"about_ca_system_score_codex":0.0009803487,"about_ca_system_score_gemma":0.0007794563,"threshold_uncertainty_score":0.011992931},"labels":[],"label_agreement":null},{"id":"W2112695860","doi":"10.1142/s021819590800257x","title":"BOUNDED-VELOCITY APPROXIMATION OF MOBILE EUCLIDEAN 2-CENTRES","year":2008,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; McGill University","funders":"Mitacs; Simon Fraser University","keywords":"Euclidean geometry; Bounded function; Mathematics; Euclidean distance; Plane (geometry); RADIUS; Closeness; Combinatorics; Set (abstract data type); Trajectory; Geometry; Mathematical analysis; Computer science; Physics","score_opus":0.017897807115312497,"score_gpt":0.28662663567978275,"score_spread":0.2687288285644702,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2112695860","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046804406,0.00012708161,0.9479358,0.00008021506,0.000023841565,0.000045919765,0.000086229564,0.00032768576,0.0045688166],"genre_scores_gemma":[0.7063174,0.00026311132,0.28768018,0.000059606497,0.000026366255,0.0001631304,0.00030689684,0.00015024206,0.0050329184],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99899954,0.00029016877,0.000047123278,0.00015603054,0.00031793764,0.00018911881],"domain_scores_gemma":[0.9983985,0.0006203771,0.00031385076,0.0002543564,0.0002756193,0.00013733072],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093418604,0.00095406466,0.0008460137,0.0009543342,0.00053257943,0.0014331718,0.0020500557,0.0011452559,0.0024960784],"category_scores_gemma":[0.0064230156,0.0004788958,0.0008836721,0.000821056,0.0013205154,0.001468984,0.0024510673,0.0013030997,0.0010115183],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028686956,0.000052497115,0.0011614639,0.000066375236,0.000021730139,0.0001738392,0.0002606857,0.8433151,0.0045127133,0.12271448,0.0011744451,0.02625989],"study_design_scores_gemma":[0.000018198536,0.00007836709,0.00017747941,0.000014672916,0.0000041415565,0.000102528014,0.000044590433,0.97531486,0.0020482717,0.020111555,0.00206826,0.000017052334],"about_ca_topic_score_codex":0.00405011,"about_ca_topic_score_gemma":0.0024937168,"teacher_disagreement_score":0.00405011,"about_ca_system_score_codex":0.001550021,"about_ca_system_score_gemma":0.00094711443,"threshold_uncertainty_score":0.011246204},"labels":[],"label_agreement":null},{"id":"W2113528966","doi":"10.1142/s0218195900000061","title":"ORTHOGONAL EDGE VISIBILITY GRAPHS OF POLYGONS WITH HOLES","year":2000,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Visibility graph; Mathematics; Bipartite graph; Combinatorics; Visibility; Polygon (computer graphics); Planar graph; Enhanced Data Rates for GSM Evolution; Graph; Visibility polygon; Polygon covering; Discrete mathematics; Geometry; Regular polygon; Computer science; Artificial intelligence; Optics; Telecommunications","score_opus":0.008723127740412584,"score_gpt":0.2677453525527823,"score_spread":0.25902222481236975,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113528966","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.73350537,0.00023484796,0.24270894,0.00040420293,0.00012844427,0.00016165835,0.0004936766,0.00054788176,0.021814989],"genre_scores_gemma":[0.96714514,0.00021520413,0.030092334,0.00011479677,0.000045509103,0.00007593452,0.00078757526,0.000105263905,0.0014182683],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985935,0.0002080991,0.000089397974,0.0002532396,0.00032577998,0.0005299336],"domain_scores_gemma":[0.9962812,0.0017910729,0.0006889201,0.0004671834,0.0003874976,0.00038405275],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063622155,0.00045715552,0.0006602108,0.0007044214,0.00125026,0.0015270116,0.00075075275,0.00084510894,0.003543448],"category_scores_gemma":[0.006411438,0.0005613728,0.00068920944,0.0006189331,0.0017490733,0.0036496818,0.0022675616,0.00122746,0.00033260428],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00084291666,0.00020495028,0.009322859,0.00042804776,0.00007888595,0.003812108,0.0018131123,0.039845556,0.058582753,0.8273622,0.0033923895,0.054314252],"study_design_scores_gemma":[0.00020837416,0.00036616556,0.006979001,0.00012257595,0.00010412176,0.0025741905,0.0031391433,0.085604735,0.050570447,0.8306199,0.019563869,0.00014745463],"about_ca_topic_score_codex":0.0015169726,"about_ca_topic_score_gemma":0.0016548226,"teacher_disagreement_score":0.003543448,"about_ca_system_score_codex":0.0003211933,"about_ca_system_score_gemma":0.0007416628,"threshold_uncertainty_score":0.011853993},"labels":[],"label_agreement":null},{"id":"W2115043830","doi":"10.1142/s0218195902000724","title":"KINETIC COLLISION DETECTION FOR SIMPLE POLYGONS","year":2002,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":66,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Mathematics; Logarithm; Simple (philosophy); Regular polygon; Plane (geometry); Combinatorics; Certificate; Set (abstract data type); Collision detection; Upper and lower bounds; Collision; Discrete mathematics; Algorithm; Geometry; Computer science; Mathematical analysis","score_opus":0.021427093830425268,"score_gpt":0.29288042518449425,"score_spread":0.27145333135406896,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2115043830","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03391059,0.00006627592,0.96312356,0.000096326934,0.00004004922,0.00006701305,0.00026667098,0.0013766409,0.0010528044],"genre_scores_gemma":[0.56272525,0.00016072122,0.43308643,0.00007338872,0.00004670435,0.00021080178,0.0011746943,0.00025551888,0.0022664883],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980405,0.00019053409,0.00019711978,0.0004096963,0.0009074483,0.00025471614],"domain_scores_gemma":[0.99507046,0.0013812863,0.0007815876,0.001893515,0.0006179752,0.00025510046],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011578057,0.0007226536,0.0013186975,0.0019644857,0.0011610166,0.0024494345,0.0036951026,0.0008306622,0.002967636],"category_scores_gemma":[0.007770008,0.00085492624,0.00097188994,0.002252009,0.0023373745,0.006003061,0.0040621646,0.0016207712,0.0009581421],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019117818,0.00022845545,0.008733562,0.0006134454,0.00007869928,0.0006832451,0.0008897066,0.3314747,0.048199087,0.30779216,0.0056918226,0.2937034],"study_design_scores_gemma":[0.000085618136,0.00025884339,0.0006811159,0.000045407487,0.000030737694,0.0003534661,0.00016170145,0.8227757,0.048025902,0.11890839,0.00858781,0.000085364736],"about_ca_topic_score_codex":0.0015367358,"about_ca_topic_score_gemma":0.0011265648,"teacher_disagreement_score":0.0036951026,"about_ca_system_score_codex":0.0010201859,"about_ca_system_score_gemma":0.001064958,"threshold_uncertainty_score":0.00992769},"labels":[],"label_agreement":null},{"id":"W2115581764","doi":"10.1142/s0218195909003040","title":"AN EXPLICIT SOLUTION FOR COMPUTING THE VERTICES OF THE EUCLIDEAN d-DIMENSIONAL VORONOI DIAGRAM OF SPHERES IN A FLOATING-POINT ARITHMETIC","year":2009,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Scientific Research and Discoveries","field":"Physics and Astronomy","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada; University of Calgary","keywords":"Voronoi diagram; Weighted Voronoi diagram; Power diagram; Centroidal Voronoi tessellation; Mathematics; Euclidean geometry; Computation; Bowyer–Watson algorithm; Point (geometry); Diagram; Euclidean distance; Computational geometry; Algorithm; Set (abstract data type); Combinatorics; Discrete mathematics; Computer science; Geometry","score_opus":0.012885069259639101,"score_gpt":0.3268844164189159,"score_spread":0.3139993471592768,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2115581764","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0052400418,0.0000807747,0.9926197,0.00003553648,0.000027154518,0.000016795564,0.00002630812,0.0003394294,0.0016144143],"genre_scores_gemma":[0.09019182,0.00016042145,0.90756726,0.000027644935,0.000023881683,0.00005650991,0.00011035777,0.000116340365,0.0017457557],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99966073,0.00004264766,0.000021255804,0.000055231878,0.00018288445,0.00003724946],"domain_scores_gemma":[0.99954563,0.00019545529,0.000031512227,0.00008096357,0.000125456,0.000021034615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035434513,0.00045058504,0.0006238507,0.0006429419,0.00055654545,0.0009171855,0.0010954494,0.0005804598,0.0032469819],"category_scores_gemma":[0.0027776107,0.00027765587,0.00043899074,0.0007731417,0.00051361293,0.0012686392,0.0011342095,0.00071311713,0.0011154993],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017792643,0.00005326928,0.00088532874,0.00033546553,0.000041234307,0.00024297286,0.00039262293,0.27657875,0.02077443,0.24356909,0.0048962026,0.45205265],"study_design_scores_gemma":[0.0000801861,0.000045926226,0.00026452093,0.00004720088,0.000019255935,0.00019517128,0.00007448876,0.9063447,0.01235115,0.066848665,0.013701287,0.000027488371],"about_ca_topic_score_codex":0.002931188,"about_ca_topic_score_gemma":0.004127891,"teacher_disagreement_score":0.0032469819,"about_ca_system_score_codex":0.0005573279,"about_ca_system_score_gemma":0.00095434475,"threshold_uncertainty_score":0.010862291},"labels":[],"label_agreement":null},{"id":"W2116409181","doi":"10.1142/s0218195900000309","title":"VISIBILITY STABS AND DEPTH-FIRST SPIRALLING ON LINE SEGMENTS IN OUTPUT SENSITIVE TIME","year":2000,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge; University of Saskatchewan","funders":"","keywords":"Traverse; Visibility; Visibility graph; Visibility polygon; Graph; Computer science; Line (geometry); Line segment; Algorithm; Set (abstract data type); Mathematics; Artificial intelligence; Optics; Theoretical computer science; Geometry; Regular polygon; Simple polygon; Geography; Geodesy; Physics","score_opus":0.016608263547273308,"score_gpt":0.28811897972057954,"score_spread":0.27151071617330624,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116409181","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042309187,0.000087967324,0.9535024,0.00006884324,0.0000141832,0.000051146246,0.00009251201,0.0016361999,0.0022375786],"genre_scores_gemma":[0.3670257,0.00010264061,0.6297712,0.000044076776,0.000017793722,0.000095056224,0.00044537327,0.0003420912,0.0021560804],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999411,0.00009673457,0.000042172516,0.00010313439,0.00021643982,0.00013049936],"domain_scores_gemma":[0.9986093,0.0005395804,0.0001849292,0.00036124393,0.00021608685,0.00008889481],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042728346,0.0006529055,0.0007489977,0.0010060597,0.0005352196,0.0013425344,0.0011628884,0.0005272095,0.003386579],"category_scores_gemma":[0.0036890325,0.00045289614,0.00080183137,0.001173659,0.00085506716,0.0022533496,0.0018382925,0.0008508591,0.00062269234],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011812446,0.00015872774,0.0040057087,0.00032872782,0.000081321705,0.00044521262,0.00077788025,0.39627025,0.057108514,0.103192806,0.0052479133,0.4312017],"study_design_scores_gemma":[0.0000726818,0.00012417047,0.00045799575,0.000019176547,0.000016809874,0.00012538796,0.000093348965,0.9296785,0.021464618,0.04416727,0.0037583471,0.0000217621],"about_ca_topic_score_codex":0.004365749,"about_ca_topic_score_gemma":0.005402786,"teacher_disagreement_score":0.004365749,"about_ca_system_score_codex":0.00075260515,"about_ca_system_score_gemma":0.0009598547,"threshold_uncertainty_score":0.011329234},"labels":[],"label_agreement":null},{"id":"W2116598609","doi":"10.1142/s0218195900000292","title":"OPTIMAL FACILITY LOCATION UNDER VARIOUS DISTANCE FUNCTIONS","year":2000,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Facility location problem; 1-center problem; Location model; Mathematics; Function (biology); Mathematical optimization; Location-allocation; Computer science; Operations research","score_opus":0.014649332940829006,"score_gpt":0.2540445895816632,"score_spread":0.2393952566408342,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116598609","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02634677,0.0006837035,0.9667027,0.00060971576,0.000046479334,0.00014149498,0.00032022453,0.00055119646,0.004597623],"genre_scores_gemma":[0.3219375,0.0011048337,0.67005396,0.00020462312,0.00019071007,0.00041898302,0.0009620581,0.00028343158,0.004843942],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960437,0.0017577072,0.00017922082,0.0007198037,0.00067092245,0.0006287533],"domain_scores_gemma":[0.9885329,0.008500658,0.00085756514,0.00080295396,0.00088261405,0.00042338247],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041806833,0.0018232794,0.002580552,0.002289687,0.0013303326,0.0032039343,0.0036496192,0.0038026657,0.005440147],"category_scores_gemma":[0.019366853,0.0010399058,0.00135656,0.0035712523,0.0018446353,0.0056224754,0.0038306527,0.0022782572,0.0010270806],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027659815,0.00015844933,0.00057301915,0.00019547695,0.000045580822,0.00006275868,0.00010676568,0.884734,0.00059764227,0.06258319,0.0044396003,0.046226855],"study_design_scores_gemma":[0.0000801347,0.000066951216,0.00017673544,0.000019477431,0.00002110655,0.00005430988,0.00007476973,0.9410695,0.0008030695,0.05625681,0.0013564134,0.000020738344],"about_ca_topic_score_codex":0.005967486,"about_ca_topic_score_gemma":0.005556682,"teacher_disagreement_score":0.005967486,"about_ca_system_score_codex":0.004946373,"about_ca_system_score_gemma":0.0033853047,"threshold_uncertainty_score":0.035888553},"labels":[],"label_agreement":null},{"id":"W2116792850","doi":"10.1142/s0218195910003281","title":"GRID VERTEX-UNFOLDING ORTHOSTACKS","year":2010,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"McGill University","keywords":"Vertex (graph theory); Mathematics; Combinatorics; Grid; Surface (topology); Plane (geometry); Geometry; Graph","score_opus":0.007965995282322239,"score_gpt":0.28004740388542537,"score_spread":0.27208140860310315,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116792850","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.075502045,0.00012202575,0.914386,0.00008798092,0.00010430252,0.00011544421,0.0003853736,0.0019993463,0.0072974996],"genre_scores_gemma":[0.35777,0.00010171456,0.633977,0.000052946554,0.000020505158,0.00011034116,0.001246653,0.0005348443,0.006186073],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995633,0.000039832743,0.000027077234,0.0001083138,0.00017677603,0.000084701016],"domain_scores_gemma":[0.9991021,0.00024345567,0.000067909736,0.0003817565,0.0001379026,0.00006692663],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029391597,0.0006466888,0.00077008695,0.00063425663,0.0006892023,0.000656335,0.00090473203,0.0006757257,0.0076716663],"category_scores_gemma":[0.0016948736,0.00038936513,0.0006578398,0.00076346216,0.00079227786,0.0009134693,0.0027566326,0.0010000698,0.0015111221],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011675946,0.00022670261,0.00650664,0.0005476755,0.000121881465,0.0011922254,0.00087804714,0.3454928,0.054186422,0.07777782,0.016261565,0.4956406],"study_design_scores_gemma":[0.00008090707,0.00028897496,0.001625268,0.000049722144,0.00003400354,0.0005885556,0.00033502522,0.85605484,0.037733253,0.07736401,0.025801724,0.000043706357],"about_ca_topic_score_codex":0.0011428931,"about_ca_topic_score_gemma":0.002149155,"teacher_disagreement_score":0.0076716663,"about_ca_system_score_codex":0.0002919646,"about_ca_system_score_gemma":0.0002891231,"threshold_uncertainty_score":0.02566421},"labels":[],"label_agreement":null},{"id":"W2117878581","doi":"10.1142/s0218195911003755","title":"SHORTEST DESCENDING PATHS: TOWARDS AN EXACT ALGORITHM","year":2011,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Shortest path problem; Path (computing); Terrain; Euclidean shortest path; Algorithm; Sequence (biology); Combinatorics; Time complexity; Approximation algorithm; Point (geometry); Yen's algorithm; K shortest path routing; Computer science; Dijkstra's algorithm; Geometry; Graph; Geography","score_opus":0.03376333864733476,"score_gpt":0.30093062877473153,"score_spread":0.26716729012739676,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2117878581","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006228086,0.00078163383,0.9799329,0.00056343473,0.00010366273,0.00018153063,0.0006404984,0.0042148996,0.007353376],"genre_scores_gemma":[0.048551474,0.00053564284,0.9430778,0.00019037978,0.00006627487,0.00023471689,0.0015995536,0.00069467956,0.005049508],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985065,0.00023756638,0.00014633471,0.000402052,0.00045759787,0.00024997548],"domain_scores_gemma":[0.99736637,0.0012484061,0.000111569825,0.00076456857,0.0003938724,0.0001152694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011347914,0.001914285,0.0017442743,0.0013610467,0.0013659637,0.002411044,0.0035954728,0.0021177148,0.0149067845],"category_scores_gemma":[0.0056709,0.0012217765,0.0014148491,0.0033399279,0.0010109931,0.0057005994,0.0035078393,0.0033420748,0.00552543],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037552038,0.00034495952,0.0009880256,0.00074340624,0.00009586556,0.000208541,0.00035430686,0.20696814,0.004085648,0.120431304,0.04762376,0.61778057],"study_design_scores_gemma":[0.00019474671,0.000098295226,0.00018931205,0.00010321134,0.000044006276,0.00017880613,0.0001974752,0.62746876,0.0020827006,0.34358767,0.025815478,0.000039506907],"about_ca_topic_score_codex":0.00555042,"about_ca_topic_score_gemma":0.007862715,"teacher_disagreement_score":0.0149067845,"about_ca_system_score_codex":0.0016956507,"about_ca_system_score_gemma":0.0026491222,"threshold_uncertainty_score":0.049868166},"labels":[],"label_agreement":null},{"id":"W2118695911","doi":"10.1142/s0218195910003256","title":"FINDING ALL DOOR LOCATIONS THAT MAKE A ROOM SEARCHABLE","year":2010,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge; Simon Fraser University","funders":"","keywords":"Polygon (computer graphics); Boundary (topology); Simple polygon; Combinatorics; Point (geometry); Mathematics; Line (geometry); Line segment; Polygon covering; Computer science; Algorithm; Computer graphics (images); Geometry; Monotone polygon; Mathematical analysis; Computer network","score_opus":0.02494821649383296,"score_gpt":0.3166541974319437,"score_spread":0.29170598093811073,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2118695911","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25904247,0.00078625075,0.7175728,0.00033637712,0.00012850881,0.00036768673,0.0015480616,0.002874919,0.017342815],"genre_scores_gemma":[0.5164033,0.00033251,0.4740184,0.000039669372,0.000023996046,0.00016505341,0.0022316375,0.0006061877,0.0061791902],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993767,0.00008809068,0.00004590812,0.00018064231,0.00013420753,0.00017443205],"domain_scores_gemma":[0.9992487,0.0003269892,0.000080418235,0.0001566262,0.00009011536,0.00009707074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003335302,0.0006759289,0.0012142343,0.0011397636,0.000888468,0.0010298883,0.00151701,0.00089568435,0.010445145],"category_scores_gemma":[0.0034733124,0.00067333365,0.0011191032,0.00064750283,0.000728979,0.0021833023,0.0026487126,0.0007753762,0.0019132976],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0031727517,0.0005834977,0.008827605,0.001779895,0.00018360745,0.0019521328,0.001634956,0.15927498,0.09587716,0.04098578,0.02349645,0.6622312],"study_design_scores_gemma":[0.00045757048,0.0015308586,0.006998332,0.00037759307,0.00026723064,0.0021972582,0.004045226,0.6887929,0.135097,0.10610235,0.053899612,0.00023415101],"about_ca_topic_score_codex":0.0009844492,"about_ca_topic_score_gemma":0.0017179421,"teacher_disagreement_score":0.010445145,"about_ca_system_score_codex":0.00022946164,"about_ca_system_score_gemma":0.0008068033,"threshold_uncertainty_score":0.034942508},"labels":[],"label_agreement":null},{"id":"W2119490711","doi":"10.1142/s0218195900000085","title":"EXACT AND OPTIMAL CONVEX HULLS IN 2D","year":2000,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Convex hull; Rounding; Mathematics; Hull; Floating point; Computation; Convex combination; Interval arithmetic; Algorithm; Convex set; Regular polygon; Combinatorics; Arithmetic; Convex optimization; Computer science; Geometry; Mathematical analysis","score_opus":0.011457383642419352,"score_gpt":0.31300177017626346,"score_spread":0.30154438653384413,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2119490711","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0137371505,0.00014817592,0.9809106,0.000094363815,0.00003736868,0.00003565163,0.00018196442,0.00045358046,0.0044012074],"genre_scores_gemma":[0.24055828,0.0003361553,0.7527441,0.000065008644,0.00004947795,0.00013761096,0.000747829,0.00043645923,0.0049250848],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99910295,0.00011957922,0.000045246867,0.000115676,0.0005154708,0.00010110342],"domain_scores_gemma":[0.99918014,0.0003793264,0.00006162036,0.00014180734,0.00019018984,0.000046931575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060620747,0.0007362552,0.001043902,0.0012450046,0.00052122277,0.0019826847,0.001003807,0.00084183697,0.005036933],"category_scores_gemma":[0.0035310995,0.00063995976,0.00085829565,0.0012001552,0.0012778857,0.0019873686,0.0023783478,0.0012245943,0.0013905532],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018564184,0.00004714199,0.0007494571,0.00016092247,0.000024218416,0.00016936348,0.00025675283,0.6060998,0.0049011,0.20561928,0.0057140966,0.17607221],"study_design_scores_gemma":[0.00001967833,0.00002064426,0.00014412505,0.000012952884,0.0000025903298,0.000039342045,0.00003895288,0.91780424,0.0017322103,0.07670632,0.003463771,0.000015118088],"about_ca_topic_score_codex":0.0037330769,"about_ca_topic_score_gemma":0.0047602938,"teacher_disagreement_score":0.005036933,"about_ca_system_score_codex":0.0009689642,"about_ca_system_score_gemma":0.00090694334,"threshold_uncertainty_score":0.016850173},"labels":[],"label_agreement":null},{"id":"W2120092636","doi":"10.1142/s0218195900000103","title":"An O(n <font>log</font> n) ALGORITHM FOR FINDING A SHORTEST CENTRAL LINK SEGMENT","year":2000,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Combinatorics; Simple polygon; Mathematics; Link (geometry); Polygon (computer graphics); Vertex (graph theory); Upper and lower bounds; Algorithm; Geometry; Graph; Regular polygon; Computer science; Mathematical analysis","score_opus":0.015412377064069742,"score_gpt":0.30347923727356124,"score_spread":0.2880668602094915,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120092636","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018752543,0.00050470565,0.9405771,0.0005853641,0.00016539122,0.00039677622,0.0008353005,0.012369171,0.025813663],"genre_scores_gemma":[0.07300325,0.00031824425,0.9080227,0.00015408805,0.000049103783,0.00033173925,0.0018531034,0.0011840672,0.015083655],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99957186,0.000056861667,0.00003220169,0.00013939368,0.00014086034,0.00005886359],"domain_scores_gemma":[0.9990545,0.00037463574,0.00011591929,0.0002441709,0.00013392788,0.00007686],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032187812,0.0010385691,0.0006699101,0.0010186228,0.00089467573,0.0014689729,0.0018589231,0.0010039251,0.03511042],"category_scores_gemma":[0.0017400401,0.00051824,0.00069591624,0.0017009677,0.00065232336,0.0019999975,0.0017804488,0.0009572529,0.012542729],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00066726183,0.0002701694,0.0008690688,0.0005968313,0.00005102241,0.00025062455,0.0002346807,0.018119859,0.030280974,0.011908759,0.064764835,0.8719859],"study_design_scores_gemma":[0.0011499434,0.00069291395,0.003680033,0.0002769267,0.00012513668,0.0021645706,0.00083358405,0.59374297,0.052934356,0.111679204,0.23253895,0.00018144859],"about_ca_topic_score_codex":0.0019431618,"about_ca_topic_score_gemma":0.004798666,"teacher_disagreement_score":0.03511042,"about_ca_system_score_codex":0.0007391991,"about_ca_system_score_gemma":0.0010766895,"threshold_uncertainty_score":0.11745602},"labels":[],"label_agreement":null},{"id":"W2120958705","doi":"10.1142/s0218195901000638","title":"SEARCHING A POLYGONAL REGION FROM THE BOUNDARY","year":2001,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Guidance and Control Systems","field":"Engineering","cited_by":31,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Boundary (topology); Polygon (computer graphics); Monotone polygon; Mathematics; Conjecture; Visibility polygon; Combinatorics; Equivalence (formal languages); Simple polygon; Computer science; Discrete mathematics; Geometry","score_opus":0.011310559180230979,"score_gpt":0.25605745540734653,"score_spread":0.24474689622711557,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120958705","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1700277,0.00053403864,0.81203616,0.00039726714,0.000037888825,0.00012562434,0.00021664373,0.0003145856,0.016310154],"genre_scores_gemma":[0.67286,0.0012096594,0.3169461,0.00008921539,0.00005350813,0.00014709566,0.0007407296,0.000113333874,0.007840308],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995765,0.00008753367,0.000027753314,0.00012823092,0.0001170325,0.00006294336],"domain_scores_gemma":[0.9988024,0.0007217034,0.00019495154,0.00013229027,0.000072822644,0.00007582416],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003549185,0.00037937117,0.0005915547,0.00065207685,0.00064322137,0.0014465972,0.0009080427,0.0009405329,0.0036691327],"category_scores_gemma":[0.0043353657,0.0003003714,0.0006162734,0.0006274448,0.0013981103,0.00420671,0.0020259812,0.00069461454,0.00054205576],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00055495446,0.000082250095,0.0033396652,0.000772083,0.00006433555,0.0012509361,0.0012869093,0.2835389,0.031989098,0.47480935,0.0037787466,0.1985327],"study_design_scores_gemma":[0.000074273456,0.00029493828,0.0018741367,0.00011705377,0.0000401307,0.001259126,0.0007685426,0.62712723,0.018272785,0.32526454,0.024846917,0.00006033243],"about_ca_topic_score_codex":0.0012567292,"about_ca_topic_score_gemma":0.00054545724,"teacher_disagreement_score":0.0036691327,"about_ca_system_score_codex":0.0002909925,"about_ca_system_score_gemma":0.00049596524,"threshold_uncertainty_score":0.012274504},"labels":[],"label_agreement":null},{"id":"W2121154134","doi":"10.1142/s0218195901000559","title":"LOWER BOUNDS FOR STREETS AND GENERALIZED STREETS","year":2001,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Competitive analysis; Mathematics; Combinatorics; Upper and lower bounds; Matching (statistics); Metric (unit); Simple (philosophy); Online algorithm; Line (geometry); Cross-ratio; Discrete mathematics; Mathematical optimization; Statistics; Geometry; Mathematical analysis; Pure mathematics","score_opus":0.019899946799461558,"score_gpt":0.31829916885142107,"score_spread":0.2983992220519595,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2121154134","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12103722,0.0072297957,0.768492,0.00336731,0.00037583345,0.00044048633,0.0015835271,0.0016370689,0.09583684],"genre_scores_gemma":[0.7032943,0.005542147,0.26876014,0.001156118,0.00081118324,0.0008347903,0.0025489705,0.0010473273,0.01600512],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99523526,0.0009295824,0.00016169024,0.00069566356,0.0015951082,0.0013827009],"domain_scores_gemma":[0.97933906,0.014019997,0.0015819173,0.0018984645,0.0016886533,0.0014719034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025634654,0.0021570523,0.0021277,0.0024194599,0.0017327606,0.005326975,0.0044720275,0.002334333,0.016832717],"category_scores_gemma":[0.02047136,0.00084829296,0.0018746287,0.0037462958,0.0025097833,0.008505857,0.0043299207,0.003987073,0.0026677677],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00070457894,0.00039222627,0.0036055304,0.0009468555,0.00023115147,0.00031537193,0.00030994022,0.27039558,0.0072314865,0.57763416,0.023353498,0.11487969],"study_design_scores_gemma":[0.000082948725,0.00034475749,0.0011635888,0.00010790578,0.00011859474,0.00068624836,0.00017096709,0.636436,0.00455386,0.33171532,0.02455838,0.00006142647],"about_ca_topic_score_codex":0.003218691,"about_ca_topic_score_gemma":0.0033577988,"teacher_disagreement_score":0.016832717,"about_ca_system_score_codex":0.0030161936,"about_ca_system_score_gemma":0.001741147,"threshold_uncertainty_score":0.05631101},"labels":[],"label_agreement":null},{"id":"W2123672008","doi":"10.1142/s0218195909003143","title":"ON STRUCTURAL AND GRAPH THEORETIC PROPERTIES OF HIGHER ORDER DELAUNAY GRAPHS","year":2009,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Departament d'Universitats, Recerca i Societat de la Informació; Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Delaunay triangulation; Line graph; Discrete mathematics; Complement graph; Graph; Voltage graph","score_opus":0.00971004641262518,"score_gpt":0.2639447868047667,"score_spread":0.2542347403921415,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123672008","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6667562,0.00096410816,0.30506203,0.0011738763,0.00006613913,0.00015215215,0.0006939573,0.000312304,0.024819195],"genre_scores_gemma":[0.9182664,0.00094466476,0.07564704,0.00014238781,0.00012988602,0.00013968545,0.0008247567,0.00016311301,0.0037419982],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99904495,0.00020656553,0.00006054972,0.00023562892,0.0002940955,0.00015823722],"domain_scores_gemma":[0.98514485,0.008597995,0.0026566368,0.0014907593,0.0012041715,0.00090544455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000794752,0.00063990394,0.0007912035,0.0029950037,0.0016187669,0.0028996347,0.0017772855,0.0011461115,0.0050637084],"category_scores_gemma":[0.010233836,0.0008951899,0.00083095476,0.0025307923,0.0031181725,0.005470499,0.0019694571,0.0016974395,0.0005414534],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002540543,0.00015678858,0.0075125815,0.00031460501,0.000048250058,0.0004589698,0.0014648132,0.16300635,0.010134009,0.7787126,0.0026827736,0.03525431],"study_design_scores_gemma":[0.00004125162,0.00014587998,0.0034331712,0.00006657296,0.000040914125,0.00083367724,0.0007298957,0.28512168,0.0042784465,0.69871217,0.006542606,0.000053772503],"about_ca_topic_score_codex":0.0023275942,"about_ca_topic_score_gemma":0.00277629,"teacher_disagreement_score":0.0050637084,"about_ca_system_score_codex":0.0017938482,"about_ca_system_score_gemma":0.00066602184,"threshold_uncertainty_score":0.016939819},"labels":[],"label_agreement":null},{"id":"W2124205318","doi":"10.1142/s0218195902000979","title":"DIAMONDS ARE NOT A MINIMUM WEIGHT TRIANGULATION'S BEST FRIEND","year":2002,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; McGill University; Carleton University","funders":"","keywords":"Minimum-weight triangulation; Mathematics; Combinatorics; Triangulation; Point set triangulation; Graph; Time complexity; Pitteway triangulation; Constant (computer programming); Point (geometry); Set (abstract data type); Discrete mathematics; Delaunay triangulation; Bowyer–Watson algorithm; Geometry; Computer science","score_opus":0.022254890056135224,"score_gpt":0.27384084145362225,"score_spread":0.251585951397487,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2124205318","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08503426,0.0016663552,0.8556445,0.008009024,0.0007917142,0.0001346726,0.00084288314,0.0019899441,0.045886684],"genre_scores_gemma":[0.41594592,0.0007957727,0.55531675,0.0015214669,0.00017391263,0.00016119008,0.00085106655,0.00070071814,0.024533272],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985581,0.00022308342,0.000066242545,0.00039028534,0.000628831,0.00013345065],"domain_scores_gemma":[0.9928271,0.0033212781,0.00053658715,0.0019135132,0.0009829858,0.00041851908],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001116657,0.00047080152,0.0010511416,0.0009909091,0.0016886218,0.0018505519,0.0014918625,0.0020389103,0.014823165],"category_scores_gemma":[0.011874687,0.00086955377,0.0010559523,0.00095634535,0.0015524767,0.0036385097,0.0018860032,0.0023323558,0.003331268],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008221146,0.00010460072,0.004017995,0.00056051963,0.00014748194,0.00058669725,0.00075550197,0.029859653,0.014643505,0.5986893,0.041706167,0.30810645],"study_design_scores_gemma":[0.00024519284,0.00029421513,0.0014748205,0.00018044093,0.00007408544,0.0014912337,0.00079151976,0.09036197,0.011252887,0.78331816,0.110418074,0.000097439945],"about_ca_topic_score_codex":0.0014790848,"about_ca_topic_score_gemma":0.002580508,"teacher_disagreement_score":0.014823165,"about_ca_system_score_codex":0.00059424795,"about_ca_system_score_gemma":0.0007123832,"threshold_uncertainty_score":0.04958844},"labels":[],"label_agreement":null},{"id":"W2126525546","doi":"10.1142/s0218195903001189","title":"COLLISION DETECTION OPTIMIZATION IN A MULTI-PARTICLE SYSTEM","year":2003,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada; Research Services, University of Calgary; University of Calgary","keywords":"Voronoi diagram; Collision detection; Collision; Particle system; Event (particle physics); Computer science; Discrete event simulation; Mathematical optimization; Particle (ecology); Algorithm; Mathematics; Simulation; Geometry; Physics; Computer graphics (images)","score_opus":0.015992117870421124,"score_gpt":0.28245956038806685,"score_spread":0.26646744251764576,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2126525546","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15265061,0.00014842459,0.84355694,0.00019836209,0.00003716426,0.00006466843,0.00007238702,0.00024253888,0.0030287656],"genre_scores_gemma":[0.8459844,0.000106693864,0.15180731,0.00005330815,0.0000130318695,0.00012094359,0.00013313949,0.000072004965,0.0017091855],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993718,0.00017085472,0.000033566856,0.00008957736,0.0002558838,0.00007829195],"domain_scores_gemma":[0.9990946,0.0005118986,0.000094258445,0.000103895916,0.00012912619,0.00006624299],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083775504,0.0003379862,0.00085404364,0.00061519945,0.00081482925,0.00097099453,0.0012202198,0.00083721563,0.0014673007],"category_scores_gemma":[0.0024420575,0.0004531466,0.00054241606,0.0007079091,0.0009097145,0.0012556692,0.0012697013,0.0006102214,0.00017234925],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044262757,0.000023425684,0.00046714488,0.000017338356,0.000013111989,0.00005934172,0.00003581548,0.979814,0.0015995258,0.013735129,0.00011378327,0.0040770713],"study_design_scores_gemma":[0.000008393283,0.000007707554,0.00006868148,0.000001041905,0.000001747087,0.000009478483,0.000006559207,0.9960084,0.0007609057,0.0028727525,0.00025013436,0.0000041406365],"about_ca_topic_score_codex":0.0043494175,"about_ca_topic_score_gemma":0.0016847478,"teacher_disagreement_score":0.0043494175,"about_ca_system_score_codex":0.0011324055,"about_ca_system_score_gemma":0.0011028617,"threshold_uncertainty_score":0.008648217},"labels":[],"label_agreement":null},{"id":"W2126873594","doi":"10.1142/s0218195910003335","title":"A LOWER BOUND ON THE AREA OF A 3-COLOURED DISK PACKING","year":2010,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Disjoint sets; Conjecture; Set (abstract data type); Cover (algebra); Pairwise comparison; Upper and lower bounds; Plane (geometry); Fraction (chemistry); Unit (ring theory); Discrete mathematics; Computer science; Geometry; Statistics","score_opus":0.015092753927062564,"score_gpt":0.2819490346999965,"score_spread":0.26685628077293394,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2126873594","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50035477,0.009388068,0.40015924,0.005054051,0.0004902419,0.00023655985,0.0019715973,0.0017703868,0.080575086],"genre_scores_gemma":[0.90839785,0.0027461795,0.07948349,0.0005285825,0.00051815587,0.00027122666,0.0008201795,0.0003835257,0.006850785],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978625,0.0005151638,0.00010594428,0.00040045517,0.0005355359,0.0005803377],"domain_scores_gemma":[0.9857473,0.010954653,0.00066543295,0.0014577021,0.0004908542,0.00068400725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020220648,0.0012657752,0.0020999429,0.0016099496,0.0013393965,0.0034600152,0.0029071704,0.0018731509,0.0095823845],"category_scores_gemma":[0.017077329,0.0008211307,0.0012543866,0.0024149697,0.0022205792,0.005589278,0.0037902526,0.0020618122,0.0015720924],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0034887136,0.000509008,0.008587053,0.0015272722,0.0002761332,0.0007619281,0.0011314988,0.5200708,0.049043413,0.2223316,0.029273383,0.16299918],"study_design_scores_gemma":[0.00017890408,0.00045513743,0.0032557559,0.00018879157,0.00016229298,0.0010160934,0.00027304405,0.76750314,0.012340574,0.20004918,0.014489083,0.00008809205],"about_ca_topic_score_codex":0.0012617265,"about_ca_topic_score_gemma":0.00096569065,"teacher_disagreement_score":0.0095823845,"about_ca_system_score_codex":0.0018840822,"about_ca_system_score_gemma":0.0007282343,"threshold_uncertainty_score":0.032056212},"labels":[],"label_agreement":null},{"id":"W2127083985","doi":"10.1142/s0218195907002343","title":"MAINTAINING VISIBILITY INFORMATION OF PLANAR POINT SETS WITH A MOVING VIEWPOINT","year":2007,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge; McGill University","funders":"","keywords":"Mathematics; Amortized analysis; Combinatorics; Visibility; Binary logarithm; Set (abstract data type); Point (geometry); Planar; Plane (geometry); Time complexity; Preprocessor; Data structure; Discrete mathematics; Algorithm; Computer science; Geometry; Artificial intelligence","score_opus":0.008923220077508166,"score_gpt":0.2787615474502688,"score_spread":0.26983832737276064,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2127083985","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31487486,0.00085887074,0.6754834,0.0004751379,0.00005774872,0.000120288096,0.0015177365,0.003581911,0.0030300817],"genre_scores_gemma":[0.64698106,0.0005171358,0.34605318,0.00006379376,0.00007733702,0.000088195564,0.0044475617,0.0003772358,0.0013945014],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99810874,0.00017806346,0.00015281017,0.00045539273,0.00083984307,0.0002652103],"domain_scores_gemma":[0.9949391,0.0017156543,0.0008116727,0.0017315418,0.0005797365,0.00022230734],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094477704,0.0009401965,0.0023115186,0.0028976707,0.00136765,0.0025837524,0.0033022214,0.0015725453,0.0015460588],"category_scores_gemma":[0.009571872,0.0016036059,0.001334256,0.0053700157,0.00092104607,0.006159553,0.0039296714,0.0015898311,0.00079011323],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020610415,0.00040566106,0.01006918,0.000628923,0.00024673104,0.0009784402,0.0016405741,0.26455036,0.085893504,0.02086477,0.007695386,0.6049653],"study_design_scores_gemma":[0.0002576349,0.00048905803,0.0051491386,0.00008198241,0.00022418014,0.0006554694,0.0006801908,0.8563308,0.0748991,0.053134616,0.007963172,0.00013466217],"about_ca_topic_score_codex":0.007813316,"about_ca_topic_score_gemma":0.0073106843,"teacher_disagreement_score":0.007813316,"about_ca_system_score_codex":0.0009046265,"about_ca_system_score_gemma":0.001355097,"threshold_uncertainty_score":0.015535653},"labels":[],"label_agreement":null},{"id":"W2131197449","doi":"10.1142/s0218195905001853","title":"ON MULTI-LEVEL k-RANGES FOR RANGE SEARCH","year":2005,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick; University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Range (aeronautics); Mathematics; Combinatorics; Binary logarithm; Tree (set theory); Materials science","score_opus":0.05640688424490003,"score_gpt":0.350634776905452,"score_spread":0.29422789266055194,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2131197449","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16211337,0.0014148287,0.815691,0.0007348166,0.000060073216,0.00029807154,0.0005189138,0.008773865,0.010395041],"genre_scores_gemma":[0.38214046,0.00023931605,0.61418974,0.00017497252,0.000035742265,0.00027055768,0.0007064585,0.00035724664,0.001885435],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99643505,0.00089362706,0.00036791837,0.00051848084,0.001310338,0.00047462707],"domain_scores_gemma":[0.9885747,0.0051096855,0.00084732793,0.003867712,0.0012621298,0.00033848104],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002608171,0.00060905266,0.0012505399,0.0020634965,0.0009381151,0.002276998,0.0041187275,0.0013563663,0.0072025047],"category_scores_gemma":[0.014427633,0.0007354684,0.0010081788,0.004061011,0.0012582432,0.008062659,0.0048213475,0.001284641,0.002675589],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019147103,0.0007888764,0.01139524,0.0007403902,0.00015957859,0.00034539757,0.0013511324,0.1424027,0.023814239,0.08923468,0.010820275,0.71703285],"study_design_scores_gemma":[0.0003549271,0.00096931733,0.0023648643,0.000118859614,0.00007215803,0.0007925822,0.0004876926,0.8935603,0.019957121,0.06942324,0.011744215,0.00015481946],"about_ca_topic_score_codex":0.002899032,"about_ca_topic_score_gemma":0.0037951604,"teacher_disagreement_score":0.0072025047,"about_ca_system_score_codex":0.00097331277,"about_ca_system_score_gemma":0.0012642478,"threshold_uncertainty_score":0.02409476},"labels":[],"label_agreement":null},{"id":"W2132048063","doi":"10.1142/s0218195900000346","title":"EQUIVALENCE OF TOPOLOGICAL FORM FOR CURVILINEAR GEOMETRIC OBJECTS","year":2000,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Advanced Numerical Analysis Techniques","field":"Engineering","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Curvilinear coordinates; Mathematics; Parametric surface; Surface (topology); Boundary (topology); Topology (electrical circuits); Object (grammar); Geometric modeling; Equivalence (formal languages); Geometry; Pure mathematics; Parametric statistics; Computer science; Mathematical analysis; Combinatorics; Artificial intelligence","score_opus":0.011739093172455294,"score_gpt":0.30373041615598373,"score_spread":0.2919913229835284,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2132048063","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5243502,0.00024154288,0.4467478,0.00044969344,0.00015043835,0.00008757009,0.00017614086,0.00031250058,0.027484085],"genre_scores_gemma":[0.9636616,0.0001904214,0.03096263,0.00009967064,0.00007293437,0.00006221859,0.00028266376,0.0001149822,0.0045528654],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99815303,0.00025274843,0.00016192599,0.00043067557,0.00085004565,0.00015154171],"domain_scores_gemma":[0.99676967,0.000784863,0.0006613749,0.00078555493,0.0006216987,0.00037686087],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012041006,0.0003628667,0.00048154805,0.0012604106,0.0006636711,0.0026795287,0.0006204687,0.0009199507,0.0034580724],"category_scores_gemma":[0.006924019,0.0002946755,0.0005948047,0.00052543933,0.0033143451,0.0039638416,0.0038028935,0.0013897384,0.00047238433],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007898982,0.00005453274,0.00126591,0.000055623255,0.000009544684,0.00032023143,0.0009119573,0.010284986,0.0082828235,0.9543744,0.00044765868,0.02391339],"study_design_scores_gemma":[0.000046635603,0.0003374186,0.0025567464,0.000026306609,0.000016240034,0.000920837,0.000565187,0.079354316,0.006982125,0.89779407,0.011352561,0.00004746723],"about_ca_topic_score_codex":0.0003055446,"about_ca_topic_score_gemma":0.00017416097,"teacher_disagreement_score":0.0034580724,"about_ca_system_score_codex":0.0004944319,"about_ca_system_score_gemma":0.0002497106,"threshold_uncertainty_score":0.011568427},"labels":[],"label_agreement":null},{"id":"W2133160845","doi":"10.1142/s0218195913600091","title":"THE POINT-SET EMBEDDABILITY PROBLEM FOR PLANE GRAPHS","year":2013,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Treewidth; Mathematics; Combinatorics; Planar graph; 1-planar graph; Book embedding; Planar straight-line graph; Pathwidth; Partial k-tree; Chordal graph; Clique-sum; Outerplanar graph; Discrete mathematics; Embedding; Bounded function; Graph; Line graph; Computer science; Mathematical analysis","score_opus":0.01220426644043338,"score_gpt":0.28457366787008476,"score_spread":0.2723694014296514,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2133160845","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3658285,0.001487394,0.61257637,0.0026395645,0.00011666792,0.00030754937,0.0022985372,0.0007399707,0.014005428],"genre_scores_gemma":[0.84186244,0.002319903,0.14171726,0.0003007083,0.0002491194,0.0002811935,0.004777854,0.00027429173,0.00821717],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988254,0.00019838981,0.00007329434,0.00040804018,0.0003283459,0.00016643158],"domain_scores_gemma":[0.99499184,0.0036857536,0.00050886977,0.00040361044,0.00022204536,0.00018788327],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063216547,0.0012376992,0.0012156785,0.00081108767,0.00096654333,0.002619645,0.0018891592,0.0023895167,0.0055954726],"category_scores_gemma":[0.005557955,0.00082825194,0.0014240784,0.001733481,0.0015975814,0.008171794,0.0021135914,0.0029092983,0.0007697663],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008115722,0.00048263645,0.004771544,0.0014739747,0.0002626525,0.0019006317,0.0015398223,0.48280758,0.027507013,0.307652,0.011091855,0.15969859],"study_design_scores_gemma":[0.00018215239,0.00022139623,0.001638055,0.00013584136,0.00014390008,0.0014977918,0.000911514,0.34642982,0.019712757,0.61677665,0.012264414,0.000085760395],"about_ca_topic_score_codex":0.0017473083,"about_ca_topic_score_gemma":0.0011811148,"teacher_disagreement_score":0.0055954726,"about_ca_system_score_codex":0.001252758,"about_ca_system_score_gemma":0.0005418197,"threshold_uncertainty_score":0.01871872},"labels":[],"label_agreement":null},{"id":"W2133642716","doi":"10.1142/s021819591000344x","title":"CONSTRAINED POINT-SET EMBEDDABILITY OF PLANAR GRAPHS","year":2010,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Mathematics; Combinatorics; General position; Embedding; Planar graph; Discrete mathematics; Parameterized complexity; Disjoint sets; Graph; Computer science","score_opus":0.010859052222396621,"score_gpt":0.28850990657733566,"score_spread":0.277650854354939,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2133642716","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32481974,0.00028054087,0.6702289,0.00023309149,0.000015155413,0.0001093807,0.00042008035,0.0005285178,0.0033645616],"genre_scores_gemma":[0.80904293,0.00048927206,0.18529855,0.00004638725,0.000036224752,0.00014113684,0.0012994071,0.00025342152,0.0033925958],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999099,0.00018778983,0.000045775938,0.00022003612,0.00032215737,0.00012522105],"domain_scores_gemma":[0.99561936,0.0027249882,0.0005360582,0.0007265488,0.00020914708,0.00018385156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005682378,0.0009279135,0.0012330196,0.00086728734,0.0005725485,0.00147937,0.0020918986,0.0013650254,0.005073305],"category_scores_gemma":[0.006738833,0.0009994773,0.00096993346,0.0014765764,0.0012794738,0.00457264,0.0024463197,0.001584151,0.000563068],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033888922,0.0001242982,0.0017674257,0.0002983016,0.00007239747,0.000398275,0.00039054078,0.853829,0.014211677,0.065054215,0.0011144755,0.06240044],"study_design_scores_gemma":[0.000040735467,0.0001285707,0.0007707241,0.000028167782,0.000023436758,0.0002478934,0.0001496527,0.877114,0.008055096,0.11141965,0.001994162,0.000027858763],"about_ca_topic_score_codex":0.0013827723,"about_ca_topic_score_gemma":0.0012994157,"teacher_disagreement_score":0.005073305,"about_ca_system_score_codex":0.00087771076,"about_ca_system_score_gemma":0.0003558653,"threshold_uncertainty_score":0.016971886},"labels":[],"label_agreement":null},{"id":"W2134408180","doi":"10.1142/s0218195905001786","title":"MAXIMIZING A VORONOI REGION: THE CONVEX CASE","year":2005,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Voronoi diagram; Power diagram; Mathematics; Centroidal Voronoi tessellation; Combinatorics; Plane (geometry); Regular polygon; Weighted Voronoi diagram; Position (finance); Point (geometry); Set (abstract data type); Geometry; Computer science","score_opus":0.01837095015847291,"score_gpt":0.2848444143815391,"score_spread":0.2664734642230662,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134408180","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06767101,0.0008182736,0.91523826,0.00069162995,0.000020352662,0.00008148187,0.0000901726,0.00011418121,0.015274765],"genre_scores_gemma":[0.81529844,0.0010764232,0.17748633,0.00013192972,0.00013863137,0.0001886264,0.00012880868,0.00016517531,0.005385666],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975241,0.0008930429,0.00007544541,0.00045926528,0.00070001517,0.00034816537],"domain_scores_gemma":[0.9890298,0.008198882,0.0010883544,0.00064011884,0.00060014776,0.00044273393],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027793003,0.0010282912,0.002010545,0.00084709906,0.0011870391,0.001992962,0.0027951633,0.0016293034,0.0035030406],"category_scores_gemma":[0.025411349,0.0010553935,0.00088391505,0.001424357,0.002776513,0.0059899753,0.003156973,0.0014722303,0.0005815324],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030769582,0.00010297987,0.0030475503,0.00033235623,0.00010225684,0.0014988726,0.0009765651,0.44909877,0.0075378944,0.46350408,0.003722706,0.06976827],"study_design_scores_gemma":[0.00004624476,0.000097914155,0.00081342517,0.000044190565,0.000033365126,0.0007876367,0.0002542298,0.772274,0.0046122186,0.21760954,0.0033910435,0.000036176076],"about_ca_topic_score_codex":0.0017189778,"about_ca_topic_score_gemma":0.0014857732,"teacher_disagreement_score":0.0035030406,"about_ca_system_score_codex":0.0010379006,"about_ca_system_score_gemma":0.00059148535,"threshold_uncertainty_score":0.014698565},"labels":[],"label_agreement":null},{"id":"W2138394562","doi":"10.1142/s0218195902000906","title":"AN IMPROVED ALGORITHM FOR SUBDIVISION TRAVERSAL WITHOUT EXTRA STORAGE","year":2002,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Subdivision; Tree traversal; Mathematics; Pointer (user interface); Algorithm; Binary logarithm; Running time; Constant (computer programming); Combinatorics; Planar; Graph traversal; Computer science; Computer graphics (images); Artificial intelligence","score_opus":0.017631964689593434,"score_gpt":0.29424230258391576,"score_spread":0.2766103378943223,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2138394562","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004728807,0.00018600293,0.98643285,0.000115497794,0.000120535646,0.000120957,0.00018205289,0.005336817,0.0027765243],"genre_scores_gemma":[0.02398697,0.00009935327,0.9702364,0.00008545157,0.000033163662,0.00015261135,0.0008346067,0.00048932544,0.004082111],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99860805,0.00012743844,0.00011149958,0.00026999053,0.00069390575,0.00018914606],"domain_scores_gemma":[0.9987047,0.00022273156,0.000055916025,0.00053591834,0.0004276362,0.000053100313],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005575438,0.0011402419,0.0012828349,0.0016843276,0.0007118664,0.0013096937,0.002881414,0.0012829528,0.0129407635],"category_scores_gemma":[0.0030203406,0.0007301668,0.0013374736,0.002758008,0.0005866267,0.0028058765,0.00267391,0.001717101,0.006576615],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030266162,0.0001841197,0.0008176759,0.0002812681,0.00007749965,0.00019442056,0.0002254787,0.020233808,0.04519541,0.020419413,0.020555919,0.8915123],"study_design_scores_gemma":[0.00057071884,0.00045098178,0.0020517427,0.000096586766,0.00028200596,0.0017972764,0.00015548116,0.7213666,0.04978485,0.061097912,0.1621391,0.00020677499],"about_ca_topic_score_codex":0.0055112233,"about_ca_topic_score_gemma":0.008857844,"teacher_disagreement_score":0.0129407635,"about_ca_system_score_codex":0.00075639825,"about_ca_system_score_gemma":0.0016477949,"threshold_uncertainty_score":0.04329115},"labels":[],"label_agreement":null},{"id":"W2139188177","doi":"10.1142/s0218195906002075","title":"THE STEINER CENTRE OF A SET OF POINTS: STABILITY, ECCENTRICITY, AND APPLICATIONS TO MOBILE FACILITY LOCATION","year":2006,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Mathematics; Combinatorics; Euclidean geometry; Steiner tree problem; Eccentricity (behavior); RADIUS; Point (geometry); Function (biology); Geometry; Discrete mathematics; Computer science","score_opus":0.011293344345689578,"score_gpt":0.2740421019614167,"score_spread":0.26274875761572714,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139188177","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.094952844,0.002197597,0.8895789,0.0008063179,0.00008956652,0.000053681648,0.00007942786,0.00014617688,0.012095525],"genre_scores_gemma":[0.8527671,0.0018405166,0.14244944,0.0000923196,0.0001799604,0.00008638639,0.00009063003,0.000112972186,0.0023807664],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99876523,0.00042445023,0.000067184745,0.0002065146,0.00041417129,0.00012243638],"domain_scores_gemma":[0.99069136,0.005660389,0.0013169544,0.0007491113,0.0011522282,0.000430031],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021351846,0.00065102684,0.0009103262,0.0025231997,0.0008873313,0.0016621257,0.0013375545,0.0011389587,0.0018234547],"category_scores_gemma":[0.018773833,0.00035423943,0.00088856195,0.0027421857,0.0036018093,0.0030601593,0.0038000855,0.0016261054,0.00044196224],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022822549,0.00005157471,0.0071340883,0.00022992076,0.000045696754,0.00054598495,0.00092713133,0.3094353,0.012341534,0.60808307,0.0017661239,0.059211425],"study_design_scores_gemma":[0.000022018963,0.00024341377,0.003835575,0.00011864104,0.000025055911,0.0011188692,0.00050053385,0.7277019,0.006546359,0.2515992,0.008213222,0.00007516082],"about_ca_topic_score_codex":0.0020860615,"about_ca_topic_score_gemma":0.0011242968,"teacher_disagreement_score":0.0025231997,"about_ca_system_score_codex":0.0018826339,"about_ca_system_score_gemma":0.00066102017,"threshold_uncertainty_score":0.013659477},"labels":[],"label_agreement":null},{"id":"W2140027094","doi":"10.1142/s0218195905001622","title":"GEOMETRIC PROXIMITY GRAPHS FOR IMPROVING NEAREST NEIGHBOR METHODS IN INSTANCE-BASED LEARNING AND DATA MINING","year":2005,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Machine Learning and Data Classification","field":"Computer Science","cited_by":88,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"k-nearest neighbors algorithm; Voronoi diagram; Classification rule; Computer science; Data mining; Decision rule; Pattern recognition (psychology); Artificial intelligence; Rule induction; Classifier (UML); Large margin nearest neighbor; Nearest neighbor graph; Mathematics","score_opus":0.036824472942890776,"score_gpt":0.38571561570188495,"score_spread":0.3488911427589942,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140027094","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005891326,0.002323884,0.98852485,0.0002876868,0.00014978096,0.00007769215,0.000115996016,0.00064423954,0.0019846046],"genre_scores_gemma":[0.18640222,0.0037159347,0.80560523,0.00050606614,0.00036810813,0.000250853,0.00065747404,0.00036675765,0.0021273908],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99604696,0.0013861598,0.00020244265,0.0006754798,0.0015703624,0.000118633354],"domain_scores_gemma":[0.9940941,0.0035969992,0.00038106315,0.0008016922,0.0009835863,0.00014251475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030779908,0.001316121,0.0021174005,0.0036609524,0.0008785747,0.002084005,0.0025201377,0.0017595087,0.0033419381],"category_scores_gemma":[0.022892725,0.0006221558,0.0013939907,0.0052607777,0.0013298499,0.005166006,0.0031955952,0.0026998522,0.00170299],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024038795,0.00020056206,0.0020415415,0.00055822363,0.00020661466,0.00015049249,0.00033614165,0.26343942,0.0033101877,0.15400912,0.00784932,0.567658],"study_design_scores_gemma":[0.000027241698,0.00013512351,0.00050799956,0.000070461014,0.00005582697,0.00013982129,0.000093937844,0.8031239,0.0025026263,0.18050975,0.012796838,0.000036599933],"about_ca_topic_score_codex":0.004052667,"about_ca_topic_score_gemma":0.0026044918,"teacher_disagreement_score":0.004052667,"about_ca_system_score_codex":0.0012569813,"about_ca_system_score_gemma":0.00095237,"threshold_uncertainty_score":0.016278148},"labels":[],"label_agreement":null},{"id":"W2141214294","doi":"10.1142/s021819590300127x","title":"COMPUTING THE CENTER OF AREA OF A CONVEX POLYGON","year":2003,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Convex polygon; Center (category theory); Mathematics; Regular polygon; Polygon (computer graphics); Simple polygon; Combinatorics; Convex set; Point (geometry); Set (abstract data type); Planar; Polygon covering; Geometry; Computer science; Convex optimization; Computer graphics (images)","score_opus":0.014468167253318398,"score_gpt":0.2792880748208776,"score_spread":0.2648199075675592,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141214294","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4674033,0.0006583971,0.5172291,0.00046508145,0.000089338726,0.00015977846,0.001156397,0.003184107,0.009654519],"genre_scores_gemma":[0.7945795,0.00021540812,0.20214133,0.00004010188,0.000055590895,0.000115514515,0.001175932,0.00025828523,0.0014182556],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99949634,0.0000613584,0.0000288179,0.00013887975,0.00019887042,0.0000757597],"domain_scores_gemma":[0.9986821,0.0005771857,0.00020438574,0.0001849859,0.00023478887,0.000116506584],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034759525,0.00051290944,0.0010274168,0.0014750235,0.0005318038,0.0011092965,0.00083369616,0.0006179302,0.0033024475],"category_scores_gemma":[0.0038559148,0.0004143501,0.0004793991,0.0011652514,0.00071521,0.0018185662,0.0014662719,0.0005349462,0.0006120303],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019070529,0.00024153179,0.026861968,0.00055707677,0.00022066743,0.0006886995,0.00052884594,0.3165248,0.06824605,0.045679707,0.0170489,0.5214946],"study_design_scores_gemma":[0.00010958633,0.00021260283,0.0045911875,0.000026743957,0.000036977366,0.00033363746,0.00022679786,0.9343484,0.027063698,0.027903965,0.005104232,0.00004212152],"about_ca_topic_score_codex":0.0016377837,"about_ca_topic_score_gemma":0.0021266139,"teacher_disagreement_score":0.0033024475,"about_ca_system_score_codex":0.00054565776,"about_ca_system_score_gemma":0.00073925866,"threshold_uncertainty_score":0.01104784},"labels":[],"label_agreement":null},{"id":"W2144674749","doi":"10.1142/s0218195906002038","title":"BOUNDARY-OPTIMAL TRIANGULATION FLOODING","year":2006,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Triangulation; Mathematics; Boundary (topology); Combinatorics; Point set triangulation; Flooding (psychology); Pitteway triangulation; Geometry; Discrete mathematics; Delaunay triangulation; Mathematical analysis","score_opus":0.013541345117598781,"score_gpt":0.3188351588273645,"score_spread":0.3052938137097657,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144674749","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1618617,0.0009129228,0.8068577,0.0012422168,0.00016922131,0.00024424173,0.00076335046,0.0026468395,0.02530188],"genre_scores_gemma":[0.572863,0.00043521696,0.41675305,0.0002607329,0.0000841098,0.00024318638,0.0012794811,0.00052996265,0.0075512584],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991665,0.00018239857,0.000048625032,0.00019332122,0.00022724866,0.00018194773],"domain_scores_gemma":[0.9968918,0.0015627624,0.00033182788,0.0006828408,0.00030988426,0.0002209093],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008329334,0.000683674,0.0011633665,0.0006976414,0.0010138815,0.0009540238,0.0016888406,0.0017080625,0.0057292846],"category_scores_gemma":[0.0104470095,0.00067408325,0.0006942178,0.00086662447,0.0012459364,0.0030384937,0.0035042511,0.0010031144,0.0009097054],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007454085,0.000095064606,0.0017494246,0.00061746256,0.0000839291,0.00043343788,0.00063103734,0.69475317,0.023363734,0.1144062,0.018147537,0.14497364],"study_design_scores_gemma":[0.00017689132,0.0001284348,0.00043406434,0.00004737707,0.000032966702,0.00022467975,0.00019929284,0.84585655,0.0052601574,0.14200255,0.005606149,0.000030914758],"about_ca_topic_score_codex":0.0035406323,"about_ca_topic_score_gemma":0.00341725,"teacher_disagreement_score":0.0057292846,"about_ca_system_score_codex":0.0011532601,"about_ca_system_score_gemma":0.0010249497,"threshold_uncertainty_score":0.01916635},"labels":[],"label_agreement":null},{"id":"W2144946213","doi":"10.1142/s0218195900000310","title":"THE THREE-PHASE METHOD: A UNIFIED APPROACH TO ORTHOGONAL GRAPH DRAWING","year":2000,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Graph drawing; Graph; Computer science; Lattice graph; Theoretical computer science; Mathematics; Algorithm; Line graph; Voltage graph","score_opus":0.019812903323334543,"score_gpt":0.32708899494590643,"score_spread":0.3072760916225719,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144946213","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00043129653,0.00005023617,0.9984609,0.000018988309,0.000016999744,0.00001761855,0.000010196767,0.00013506325,0.0008587067],"genre_scores_gemma":[0.020528845,0.00033953157,0.97666,0.000050661874,0.00004930918,0.00012199007,0.000094597046,0.0002592793,0.0018956957],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99860233,0.0003928444,0.00007174849,0.00022790839,0.00058938435,0.00011578376],"domain_scores_gemma":[0.99879575,0.00040508586,0.00009312853,0.0003450338,0.00028520467,0.000075813754],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013492511,0.0009184285,0.0009885192,0.0020338944,0.0007628549,0.001972305,0.0025371148,0.0012578556,0.006641056],"category_scores_gemma":[0.0040077283,0.0007431577,0.0013299957,0.002877375,0.0015702113,0.0035927899,0.0027521385,0.0021664598,0.00219665],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000679871,0.00006718695,0.00038326482,0.0002553496,0.00003591326,0.000105268955,0.0003121721,0.07869601,0.008525383,0.5673757,0.0064033307,0.3377724],"study_design_scores_gemma":[0.00004845495,0.0000949818,0.0001669259,0.000071259085,0.000027425078,0.00033053255,0.000115208044,0.6291593,0.0074876207,0.2992026,0.06323178,0.000064050626],"about_ca_topic_score_codex":0.0013698523,"about_ca_topic_score_gemma":0.0016383413,"teacher_disagreement_score":0.006641056,"about_ca_system_score_codex":0.0006678852,"about_ca_system_score_gemma":0.0010196883,"threshold_uncertainty_score":0.022216558},"labels":[],"label_agreement":null},{"id":"W2145427355","doi":"10.1142/s0218195900000115","title":"POINT AND LINE SEGMENT RECONSTRUCTION FROM VISIBILITY INFORMATION","year":2000,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Visibility polygon; Visibility graph; Visibility; Mathematics; Graph; Set (abstract data type); Line segment; Dual graph; Line (geometry); Algorithm; Computer science; Combinatorics; Planar graph; Simple polygon; Geometry; Geography","score_opus":0.0072309491043516605,"score_gpt":0.2539805635127922,"score_spread":0.24674961440844054,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145427355","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010236478,0.00004547485,0.98832613,0.00004186991,0.0000049532505,0.000022516406,0.00012985972,0.0002788269,0.0009138664],"genre_scores_gemma":[0.21569245,0.0002021937,0.78028804,0.00003203529,0.000018100405,0.00006812357,0.0014396503,0.00018854887,0.0020708318],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99916494,0.00014622664,0.00004061605,0.00021043926,0.00036215055,0.000075692275],"domain_scores_gemma":[0.99832875,0.0007270327,0.0002150469,0.00041051873,0.0002590687,0.00005959632],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005746812,0.00071351277,0.0008163548,0.0013953336,0.00038040784,0.0011511139,0.0008894628,0.00094797084,0.0034895544],"category_scores_gemma":[0.0039608404,0.0006119451,0.00091186014,0.0012754003,0.0008053938,0.002233798,0.0015887318,0.001291847,0.0008734238],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00056403613,0.000104154264,0.002456295,0.00036729246,0.00006733612,0.00038691505,0.00024919296,0.3895005,0.050188627,0.092943944,0.0036712878,0.4595005],"study_design_scores_gemma":[0.000028555713,0.00010435738,0.000914299,0.00003060287,0.000020993606,0.0002537054,0.00010527662,0.8916071,0.028282693,0.073506296,0.005111028,0.00003510186],"about_ca_topic_score_codex":0.0018247883,"about_ca_topic_score_gemma":0.0024514275,"teacher_disagreement_score":0.0034895544,"about_ca_system_score_codex":0.00052336324,"about_ca_system_score_gemma":0.0008457949,"threshold_uncertainty_score":0.0116737485},"labels":[],"label_agreement":null},{"id":"W2149041248","doi":"10.1142/s0218195909003015","title":"FLOATING-POINT ARITHMETIC FOR COMPUTATIONAL GEOMETRY PROBLEMS WITH UNCERTAIN DATA","year":2009,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Advanced Numerical Analysis Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Natural Sciences and Engineering Research Council of Canada; Université de Montréal","funders":"","keywords":"Computational geometry; Context (archaeology); Mathematics; Convex hull; Computation; Algorithm; Interval arithmetic; Point (geometry); Mathematical optimization; Convex geometry; Regular polygon; Simple (philosophy); Computer science; Convex analysis; Convex optimization; Geometry","score_opus":0.018759480653945084,"score_gpt":0.30742302886094525,"score_spread":0.2886635482070002,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149041248","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018505385,0.0044431123,0.98025596,0.002018033,0.00042976422,0.00006009042,0.00008300413,0.0002244973,0.010634997],"genre_scores_gemma":[0.15257937,0.010779096,0.8237383,0.0012995395,0.0020292886,0.0006339907,0.00034652633,0.00027637134,0.008317521],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99560094,0.0014763467,0.00037807037,0.00042415145,0.0019739375,0.00014652719],"domain_scores_gemma":[0.99508154,0.0033609308,0.00028182234,0.0007682279,0.0004377045,0.000069797185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005802678,0.0015512591,0.0013165791,0.0018684621,0.0013200421,0.004190209,0.0025096699,0.002206088,0.004584166],"category_scores_gemma":[0.018210167,0.000499411,0.0014516251,0.003205226,0.0063748145,0.005670763,0.0034437615,0.006293861,0.0018770333],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002256516,0.00000607047,0.000058620626,0.00014504761,0.000013085381,0.00011525755,0.0001804286,0.023818417,0.0004081437,0.95267457,0.0022130674,0.020344872],"study_design_scores_gemma":[0.000013063121,0.00001958973,0.00004355337,0.00011533063,0.000009939017,0.000071475115,0.000046299934,0.08959036,0.0004867971,0.8898635,0.019723818,0.00001627975],"about_ca_topic_score_codex":0.0019775622,"about_ca_topic_score_gemma":0.001068121,"teacher_disagreement_score":0.005802678,"about_ca_system_score_codex":0.0024686605,"about_ca_system_score_gemma":0.001785094,"threshold_uncertainty_score":0.030687869},"labels":[],"label_agreement":null},{"id":"W2149305893","doi":"10.1142/s0218195907002471","title":"A GENERAL APPROXIMATION ALGORITHM FOR PLANAR MAPS WITH APPLICATIONS","year":2007,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Voronoi diagram; Algorithm; Correctness; Intersection (aeronautics); Approximation algorithm; Mathematics; Triangulation; Planar; Metric (unit); Bowyer–Watson algorithm; Computer science; Delaunay triangulation","score_opus":0.011804474993635954,"score_gpt":0.28480258702338795,"score_spread":0.272998112029752,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149305893","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014091266,0.00013940877,0.99648654,0.00004830315,0.00002564664,0.000028068453,0.00003740032,0.00060826185,0.0012171707],"genre_scores_gemma":[0.0502493,0.0003328003,0.9456477,0.00004916521,0.00004025166,0.00013391001,0.00027292798,0.00019747179,0.0030765338],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992138,0.00013750003,0.000052328218,0.00014563423,0.00036263035,0.00008815574],"domain_scores_gemma":[0.99931085,0.00024738908,0.00003631153,0.00017157431,0.00019999454,0.000033895747],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065994915,0.0010812326,0.0008814809,0.0015064921,0.00075124943,0.001596631,0.0019037277,0.0014099913,0.006417625],"category_scores_gemma":[0.004276054,0.00045891813,0.0010557752,0.0021342216,0.00063540135,0.0022037504,0.002691343,0.0014679506,0.002283432],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015755618,0.00005790985,0.00047341626,0.00025231944,0.000045658373,0.00015474793,0.00020722291,0.27659303,0.0073668044,0.15709339,0.010219086,0.54737884],"study_design_scores_gemma":[0.000029324749,0.000043440057,0.00009848633,0.000026016785,0.000014453467,0.00020038492,0.000045872173,0.9047205,0.0034390518,0.068153866,0.023211088,0.000017592778],"about_ca_topic_score_codex":0.0028816578,"about_ca_topic_score_gemma":0.0023434344,"teacher_disagreement_score":0.006417625,"about_ca_system_score_codex":0.0008644122,"about_ca_system_score_gemma":0.0009515356,"threshold_uncertainty_score":0.021469116},"labels":[],"label_agreement":null},{"id":"W2150278829","doi":"10.1142/s0218195903001281","title":"PROPERTIES OF ARRANGEMENT GRAPHS","year":2003,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge; Carleton University","funders":"","keywords":"Combinatorics; Mathematics; General position; Hyperplane; Hamiltonian path; Line segment; Graph; Discrete mathematics; Geometry","score_opus":0.01914964241694904,"score_gpt":0.2647208432120246,"score_spread":0.24557120079507555,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2150278829","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5453833,0.0010000619,0.32074788,0.0014883792,0.00019167503,0.00031732762,0.004456419,0.0019958012,0.12441918],"genre_scores_gemma":[0.9239025,0.00082853704,0.057636615,0.00027461813,0.00013642911,0.00025704663,0.0045576883,0.00038956842,0.0120169185],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989801,0.00016477607,0.000081015816,0.0002884385,0.00029603622,0.00018966601],"domain_scores_gemma":[0.99411654,0.0027386583,0.0011149847,0.0008690577,0.00064845674,0.00051225186],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004196601,0.0005161138,0.00055864605,0.0013497331,0.0016140714,0.0026761107,0.0011477339,0.0008369097,0.014659143],"category_scores_gemma":[0.005225043,0.0006083739,0.0006231857,0.0025216509,0.0015454891,0.0044316817,0.0011694217,0.0011305033,0.0018110271],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034966582,0.00024524055,0.010731438,0.0007592621,0.000092869566,0.0014232275,0.0014582351,0.025229605,0.02038414,0.79498625,0.022614462,0.12172559],"study_design_scores_gemma":[0.00010155686,0.00025674768,0.0067603486,0.00011959547,0.00013312517,0.004519844,0.0012599153,0.03743603,0.011539778,0.86519796,0.07260277,0.000072269024],"about_ca_topic_score_codex":0.0012331865,"about_ca_topic_score_gemma":0.0011465973,"teacher_disagreement_score":0.014659143,"about_ca_system_score_codex":0.00089301413,"about_ca_system_score_gemma":0.0005544461,"threshold_uncertainty_score":0.04903972},"labels":[],"label_agreement":null},{"id":"W2151369108","doi":"10.1142/s0218195909003088","title":"EFFICIENT NON-INTERSECTION QUERIES ON AGGREGATED GEOMETRIC DATA","year":2009,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Intersection (aeronautics); Complement (music); Disjoint sets; Class (philosophy); Mathematics; Set (abstract data type); Object (grammar); Theoretical computer science; Computer science; Combinatorics; Artificial intelligence","score_opus":0.019258034141779803,"score_gpt":0.30260727728707343,"score_spread":0.28334924314529364,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2151369108","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08341926,0.0011409072,0.90818346,0.0004593423,0.000061044564,0.00023867365,0.0010927876,0.0030469836,0.0023574887],"genre_scores_gemma":[0.500203,0.0007585904,0.49102068,0.00022427397,0.00017432394,0.00027125585,0.004370825,0.00040297923,0.0025740936],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9921538,0.001673937,0.00077435834,0.0015252507,0.0031360434,0.0007365653],"domain_scores_gemma":[0.9868788,0.006663706,0.0011634567,0.0036412522,0.0013646208,0.00028816337],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035836876,0.0016437545,0.0040019597,0.0024681743,0.0013697937,0.0037965851,0.0039931694,0.0017742241,0.0021855785],"category_scores_gemma":[0.018327417,0.00088931154,0.0016276799,0.0063113044,0.0017824856,0.009553816,0.0061191376,0.0019559723,0.0010354926],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018904324,0.0005389896,0.0069942577,0.0010717759,0.00029286754,0.0009272467,0.002402832,0.37076354,0.032272797,0.09367819,0.013372248,0.47579488],"study_design_scores_gemma":[0.000094751806,0.00027114854,0.0013255761,0.00003523078,0.0000651846,0.00042837483,0.0009034705,0.89898586,0.014508721,0.078184254,0.0051457556,0.00005155272],"about_ca_topic_score_codex":0.003674715,"about_ca_topic_score_gemma":0.0033355735,"teacher_disagreement_score":0.0040019597,"about_ca_system_score_codex":0.0015707292,"about_ca_system_score_gemma":0.0017761007,"threshold_uncertainty_score":0.018952549},"labels":[],"label_agreement":null},{"id":"W2151606606","doi":"10.1142/s0218195904001433","title":"PATHWIDTH AND LAYERED DRAWINGS OF TREES","year":2004,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":50,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Vertex (graph theory); Combinatorics; Enhanced Data Rates for GSM Evolution; Graph drawing; Mathematics; Line (geometry); Layer (electronics); Planar; Pathwidth; Geometry; Graph; Upper and lower bounds; Computer science; Line graph; Computer graphics (images); Mathematical analysis; Materials science; Artificial intelligence","score_opus":0.009141361070416429,"score_gpt":0.26573960444992983,"score_spread":0.2565982433795134,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2151606606","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16720039,0.001042837,0.8092157,0.0005511867,0.00006022406,0.00011322637,0.0011048552,0.001508269,0.019203365],"genre_scores_gemma":[0.48375922,0.0015988164,0.5052072,0.00017625288,0.000078230245,0.00024257133,0.0020645026,0.00046162208,0.0064115524],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99880993,0.00028190474,0.00009079083,0.00020836228,0.00039988183,0.00020918576],"domain_scores_gemma":[0.99586666,0.002108008,0.0006081769,0.00080969045,0.00033612226,0.00027133134],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000572932,0.00072877057,0.0005148447,0.00085574493,0.0006034781,0.0022062631,0.0011996336,0.00075480697,0.006652819],"category_scores_gemma":[0.008705392,0.00086771103,0.00056997745,0.0016371531,0.0007401772,0.0044033537,0.0015750607,0.0012555603,0.0011572217],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00058579707,0.00013980824,0.0029987316,0.00054387597,0.00007104759,0.0006248749,0.00093500305,0.25625595,0.036869433,0.36161196,0.01490324,0.32446036],"study_design_scores_gemma":[0.000102725644,0.00020753148,0.0019430489,0.0001239551,0.00007870587,0.0011349885,0.00036183887,0.44510773,0.014728395,0.5086647,0.02749337,0.00005300475],"about_ca_topic_score_codex":0.0014362863,"about_ca_topic_score_gemma":0.0028054095,"teacher_disagreement_score":0.006652819,"about_ca_system_score_codex":0.00093711587,"about_ca_system_score_gemma":0.00046123352,"threshold_uncertainty_score":0.022255957},"labels":[],"label_agreement":null},{"id":"W2152446315","doi":"10.1142/s0218195903001153","title":"On Computing a Largest Empty Arbitrarily Oriented Rectangle","year":2003,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Rectangle; Mathematics; Combinatorics; Bounded function; Point (geometry); Set (abstract data type); Binary logarithm; Discrete mathematics; Geometry; Computer science; Mathematical analysis","score_opus":0.010404289121629183,"score_gpt":0.28026560062544614,"score_spread":0.269861311503817,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152446315","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.066044375,0.00049405784,0.9252598,0.00021643605,0.000055128876,0.00016311544,0.00024410285,0.0029687914,0.004554179],"genre_scores_gemma":[0.111320324,0.00022708243,0.8852081,0.000084696854,0.000025511108,0.00020152051,0.000822699,0.0003007935,0.0018093286],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99885535,0.00022723207,0.00010135984,0.00027307324,0.00031835894,0.00022456139],"domain_scores_gemma":[0.99806625,0.0009970663,0.0002499496,0.0003105501,0.00026518083,0.000110933404],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010004276,0.0010779775,0.0016622063,0.0012052653,0.000894807,0.0012273418,0.002023192,0.00088636164,0.004384174],"category_scores_gemma":[0.0044584847,0.00065162487,0.0008750695,0.0022220365,0.0009831444,0.0028399942,0.0032772073,0.00076827605,0.0016679609],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0027050423,0.00022724635,0.005566236,0.0010232506,0.0001360919,0.0009617263,0.0008981064,0.22071306,0.06336329,0.05784675,0.017850267,0.6287089],"study_design_scores_gemma":[0.00036255983,0.0004957875,0.001396429,0.00010790721,0.000076307,0.0006625214,0.0004988287,0.911469,0.031761017,0.03711155,0.0159563,0.00010184367],"about_ca_topic_score_codex":0.002537512,"about_ca_topic_score_gemma":0.0035375466,"teacher_disagreement_score":0.004384174,"about_ca_system_score_codex":0.0005232545,"about_ca_system_score_gemma":0.0012329074,"threshold_uncertainty_score":0.014666498},"labels":[],"label_agreement":null},{"id":"W2155070046","doi":"10.1142/s021819590900312x","title":"ON INTERSECTING A SET OF ISOTHETIC LINE SEGMENTS WITH A CONVEX POLYGON OF MINIMUM AREA","year":2009,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"Natural Sciences and Engineering Research Council of Canada; Universities Space Research Association","keywords":"Combinatorics; Convex polygon; Polygon (computer graphics); Mathematics; Polygon covering; Rectilinear polygon; Regular polygon; Simple polygon; Set (abstract data type); Line segment; Star-shaped polygon; Line (geometry); Convex set; Geometry; Computer science; Convex optimization","score_opus":0.015199704029000286,"score_gpt":0.28677835300601806,"score_spread":0.2715786489770178,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155070046","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027092746,0.00021972977,0.96645856,0.00014258396,0.00004017173,0.00023269677,0.00015406536,0.0007910554,0.0048684394],"genre_scores_gemma":[0.0903866,0.0003313278,0.9059158,0.000043208493,0.00003718193,0.00021408724,0.0004965914,0.00020695107,0.0023682648],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99898404,0.00014353574,0.00004802369,0.00018017259,0.0005190309,0.00012525],"domain_scores_gemma":[0.99787724,0.0012407884,0.00026990694,0.00024332653,0.00028440455,0.000084343665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006413049,0.0015430864,0.001755175,0.0018781786,0.0012185182,0.001712652,0.0023105512,0.0014688825,0.0075370222],"category_scores_gemma":[0.004827064,0.00084747165,0.0010873434,0.0033056792,0.0016446711,0.0028905484,0.002930554,0.0012432708,0.0017670888],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006799155,0.00022785513,0.0025356382,0.0008735309,0.00010715449,0.00090686517,0.0006718945,0.39643836,0.024745688,0.031455085,0.007801159,0.5335568],"study_design_scores_gemma":[0.00012094534,0.00022761624,0.00089653075,0.00008095159,0.000047380086,0.0005792386,0.000367674,0.9431855,0.014326793,0.03280038,0.007308661,0.000058252004],"about_ca_topic_score_codex":0.0034141208,"about_ca_topic_score_gemma":0.0047451006,"teacher_disagreement_score":0.0075370222,"about_ca_system_score_codex":0.00077166926,"about_ca_system_score_gemma":0.0008644406,"threshold_uncertainty_score":0.025213897},"labels":[],"label_agreement":null},{"id":"W2165542100","doi":"10.1142/s021819590900299x","title":"DETERMINING A SET OF MAXIMUM INSCRIBED RECTANGLES FOR LABEL PLACEMENT IN A REGION","year":2009,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Inscribed figure; Polygon (computer graphics); Set (abstract data type); Regular polygon; Convex polygon; Combinatorics; Orientation (vector space); Mathematics; Computer science; Algorithm; Geometry","score_opus":0.034106281611396255,"score_gpt":0.3253124541080849,"score_spread":0.2912061724966887,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2165542100","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0613844,0.00016411924,0.93108517,0.00022554799,0.000024440813,0.00030562922,0.0006545399,0.0028659736,0.0032902653],"genre_scores_gemma":[0.09615434,0.000094480754,0.90120405,0.00003691394,0.000010852026,0.00016847963,0.0010938518,0.00031603358,0.00092099246],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985562,0.00024697863,0.00008964154,0.00042911046,0.00047601474,0.00020202149],"domain_scores_gemma":[0.99750024,0.0011516273,0.00042602172,0.00035998464,0.00041450045,0.000147592],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011941895,0.001086038,0.0013960905,0.0016252626,0.0011381416,0.001953125,0.002295284,0.0013842158,0.0060454495],"category_scores_gemma":[0.0060442206,0.00096423377,0.0010937012,0.0017118875,0.000779072,0.002059069,0.0018868381,0.001022626,0.00275539],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009938976,0.00057143543,0.010998427,0.0011088855,0.000104450366,0.00084881927,0.001813782,0.22711487,0.10883912,0.02856412,0.015519953,0.6035223],"study_design_scores_gemma":[0.00012916382,0.00030897214,0.002209075,0.0000739945,0.00003808972,0.0004525491,0.0012686123,0.9032255,0.06368373,0.017847154,0.010687419,0.000075793745],"about_ca_topic_score_codex":0.0021817954,"about_ca_topic_score_gemma":0.0037371987,"teacher_disagreement_score":0.0060454495,"about_ca_system_score_codex":0.00071156665,"about_ca_system_score_gemma":0.0016568461,"threshold_uncertainty_score":0.020224094},"labels":[],"label_agreement":null},{"id":"W2168192372","doi":"10.1142/s0218195907002264","title":"POLYGON DECOMPOSITION AND THE ORTHOGONAL ART GALLERY PROBLEM","year":2007,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":57,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan; University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Polygon (computer graphics); Polygon covering; Visibility polygon; Simple polygon; Rectilinear polygon; Cardinality (data modeling); Decomposition; Cover (algebra); Star-shaped polygon; Rectangle; Point (geometry); Discrete mathematics; Geometry; Regular polygon; Computer science; Convex set","score_opus":0.007288858907567653,"score_gpt":0.28497267076778005,"score_spread":0.2776838118602124,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168192372","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25803474,0.0010920943,0.71301645,0.0010739107,0.000114498696,0.0001765407,0.0012500772,0.00053273985,0.024708912],"genre_scores_gemma":[0.6257074,0.0009736258,0.35746273,0.00015792342,0.00012115316,0.00015666083,0.0034522968,0.00025491888,0.011713351],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991148,0.00022694778,0.00004831034,0.00020449536,0.00023199315,0.00017333165],"domain_scores_gemma":[0.99871266,0.00063043175,0.00019994804,0.00021579102,0.00010762836,0.00013356809],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064853457,0.0006254796,0.0009107626,0.00083083205,0.0008089407,0.0015109897,0.00092134316,0.0009517967,0.0048697274],"category_scores_gemma":[0.0028909498,0.0005459348,0.0010324711,0.0012347038,0.0012412168,0.003172763,0.002319998,0.0013354301,0.0008207483],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007067184,0.00027225018,0.0036341469,0.0004924988,0.00011903943,0.00057438976,0.00063047657,0.50475717,0.010786772,0.26575875,0.020920856,0.19134691],"study_design_scores_gemma":[0.0000936209,0.00016903495,0.0017166993,0.000081760074,0.000044315,0.0008035729,0.00061955815,0.70223564,0.0061375527,0.2668573,0.021201355,0.000039531194],"about_ca_topic_score_codex":0.0016242192,"about_ca_topic_score_gemma":0.0013576858,"teacher_disagreement_score":0.0048697274,"about_ca_system_score_codex":0.00061384094,"about_ca_system_score_gemma":0.00046780784,"threshold_uncertainty_score":0.016290843},"labels":[],"label_agreement":null},{"id":"W2171151410","doi":"10.1142/s021819590200089x","title":"ONLINE ROUTING IN CONVEX SUBDIVISIONS","year":2002,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":47,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Carleton University","funders":"","keywords":"Delaunay triangulation; Mathematics; Combinatorics; Destination-Sequenced Distance Vector routing; Discrete mathematics; Computer science; Mathematical optimization; Link-state routing protocol; Routing (electronic design automation); Computer network","score_opus":0.030471045598837843,"score_gpt":0.3160281218117496,"score_spread":0.28555707621291176,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2171151410","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14399546,0.00059974845,0.8355576,0.00094530074,0.000111756955,0.00016863053,0.00026947155,0.00090756826,0.017444469],"genre_scores_gemma":[0.7442155,0.0006537161,0.24399143,0.00028810304,0.00008704552,0.00017415687,0.0007331432,0.00021087236,0.009646043],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99887544,0.0002926744,0.000043874395,0.00023176863,0.0003081724,0.00024814045],"domain_scores_gemma":[0.9975183,0.001210169,0.0002869354,0.0006065618,0.00020407593,0.00017395715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068915397,0.0007537984,0.0012766764,0.00047662336,0.0009516389,0.0016390396,0.0020502722,0.0013533932,0.006324033],"category_scores_gemma":[0.005175292,0.00045186377,0.00072742725,0.0013212438,0.0013218272,0.0038924594,0.0020143115,0.0012498022,0.0009825897],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004249297,0.00020481426,0.0007686151,0.00014597183,0.00004264649,0.00024805535,0.00020071954,0.75900567,0.00573207,0.13366619,0.005470956,0.0940894],"study_design_scores_gemma":[0.00003042125,0.00005796987,0.000114800605,0.000007549381,0.0000113333845,0.00007322951,0.00005352376,0.9157707,0.0015837407,0.07900921,0.0032792066,0.000008306505],"about_ca_topic_score_codex":0.0037184355,"about_ca_topic_score_gemma":0.0034788654,"teacher_disagreement_score":0.006324033,"about_ca_system_score_codex":0.0014395041,"about_ca_system_score_gemma":0.0007526073,"threshold_uncertainty_score":0.021155953},"labels":[],"label_agreement":null},{"id":"W2261377644","doi":"10.1142/s0218195910003396","title":"VORONOI DIAGRAM OF POLYGONAL CHAINS UNDER THE DISCRETE FRÉCHET DISTANCE","year":2010,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Voronoi diagram; Mathematics; Dimension (graph theory); Combinatorics; Measure (data warehouse); Diagram; Discrete geometry; Similarity (geometry); Computational geometry; Discrete mathematics; Geometry; Image (mathematics); Computer science; Data mining; Artificial intelligence","score_opus":0.008520262516378265,"score_gpt":0.2823124643501812,"score_spread":0.27379220183380293,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2261377644","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47700453,0.0010007565,0.50216603,0.00038514976,0.000092363065,0.00008765374,0.0005062399,0.00016690868,0.018590406],"genre_scores_gemma":[0.92213273,0.00075581734,0.07180811,0.00006403454,0.00010097227,0.00009413769,0.0005584886,0.000054895998,0.0044308463],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994012,0.00012405452,0.000026952643,0.00009437751,0.00027666386,0.00007673269],"domain_scores_gemma":[0.9990822,0.0003851156,0.00016225489,0.00006626871,0.00018934491,0.00011478425],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002891377,0.00016699398,0.0005082682,0.0010481767,0.0005836803,0.0015272254,0.00065548706,0.00041832286,0.0022979798],"category_scores_gemma":[0.0022193126,0.00019033236,0.0003017526,0.0007624094,0.0011133039,0.0014210071,0.000932728,0.0004770099,0.00026855938],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017494374,0.000028950535,0.002145291,0.000120173216,0.00002655969,0.00035900885,0.0003964618,0.06070404,0.012555402,0.88678503,0.0016051988,0.035098903],"study_design_scores_gemma":[0.00006661264,0.00006440183,0.0018052288,0.000030412453,0.000016974216,0.0006553843,0.00020118864,0.29865956,0.004806138,0.68067455,0.012983968,0.00003548337],"about_ca_topic_score_codex":0.002335427,"about_ca_topic_score_gemma":0.0011848351,"teacher_disagreement_score":0.002335427,"about_ca_system_score_codex":0.0007407435,"about_ca_system_score_gemma":0.00041083308,"threshold_uncertainty_score":0.0076874495},"labels":[],"label_agreement":null},{"id":"W2291025091","doi":"10.1142/s0218195915500156","title":"Placing Two Axis-Parallel Squares to Maximize the Number of Enclosed Points","year":2015,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Simon Fraser University","keywords":"Intersection (aeronautics); Disjoint sets; Mathematics; Combinatorics; Unit (ring theory); Plane (geometry); Least-squares function approximation; Set (abstract data type); Space (punctuation); Geometry; Computer science; Statistics","score_opus":0.025765005357318727,"score_gpt":0.3270088259625079,"score_spread":0.30124382060518917,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2291025091","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08491599,0.00031028097,0.8979311,0.00036030347,0.00025321037,0.0005841235,0.00028461093,0.0024665317,0.012893861],"genre_scores_gemma":[0.17408818,0.0001627147,0.82049,0.0000944034,0.000025801957,0.00029493103,0.00032746713,0.00027428727,0.0042422605],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99922216,0.00010453057,0.000054972905,0.000167164,0.0003467893,0.00010440962],"domain_scores_gemma":[0.9990324,0.00034296844,0.000119301854,0.00012733633,0.00029904142,0.000078902754],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000605683,0.0018503828,0.001745649,0.0007995867,0.00072466896,0.0011220628,0.0020151495,0.0010388651,0.013122876],"category_scores_gemma":[0.0037727007,0.0009214784,0.00052645826,0.0013665812,0.0007145634,0.0014133346,0.0026352596,0.00093294354,0.0035440607],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002543804,0.0004948396,0.004996114,0.0013882039,0.0001359198,0.0011263964,0.00048778264,0.26543096,0.12908612,0.03620179,0.021038106,0.5370699],"study_design_scores_gemma":[0.00028496995,0.00065644085,0.0012337171,0.00007144082,0.00005634826,0.0007248399,0.00034075018,0.8714882,0.08942868,0.018988453,0.016613178,0.00011306182],"about_ca_topic_score_codex":0.0017302624,"about_ca_topic_score_gemma":0.0028802222,"teacher_disagreement_score":0.013122876,"about_ca_system_score_codex":0.0005775732,"about_ca_system_score_gemma":0.002002645,"threshold_uncertainty_score":0.04390043},"labels":[],"label_agreement":null},{"id":"W2397546986","doi":"10.1142/s0218195918500127","title":"On Combinatorial Depth Measures","year":2018,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Advanced Statistical Methods and Models","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Mathematics; Combinatorics; Multiset; Point (geometry); Geometry","score_opus":0.07954057890063079,"score_gpt":0.4419219396705607,"score_spread":0.3623813607699299,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397546986","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08086516,0.002081018,0.8892985,0.0009202561,0.0001352603,0.00019531966,0.001916663,0.0015455604,0.023042234],"genre_scores_gemma":[0.52424294,0.0019627598,0.45424727,0.00072020007,0.00046454757,0.0006678021,0.0029650445,0.0014464632,0.013282971],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99538606,0.000880754,0.00032073585,0.0011761156,0.0015789189,0.000657442],"domain_scores_gemma":[0.98810464,0.006797237,0.0010403636,0.0021372621,0.0011459235,0.0007746481],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024522254,0.0016407234,0.001371123,0.0042202906,0.0013798953,0.006206425,0.002779143,0.001484943,0.012090909],"category_scores_gemma":[0.025032058,0.0010599913,0.0017754812,0.0046844273,0.0038707203,0.01988424,0.0069287526,0.004118348,0.002169086],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027197387,0.000092623275,0.0036041152,0.00030878134,0.000044291395,0.00010871306,0.0006633772,0.03697173,0.0036871783,0.85867184,0.005346354,0.09022912],"study_design_scores_gemma":[0.000038225066,0.000088290246,0.0013353806,0.00008793312,0.000042495365,0.00027853082,0.0002398788,0.11947089,0.0030936303,0.86137754,0.0138896555,0.00005756503],"about_ca_topic_score_codex":0.0022297408,"about_ca_topic_score_gemma":0.0023121818,"teacher_disagreement_score":0.012090909,"about_ca_system_score_codex":0.0033856847,"about_ca_system_score_gemma":0.0012985744,"threshold_uncertainty_score":0.04044819},"labels":[],"label_agreement":null},{"id":"W2606103541","doi":"10.1142/s0218195916600013","title":"The Price of Order","year":2016,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Disjoint sets; Order (exchange); Discrete mathematics; Graph","score_opus":0.013356323884241277,"score_gpt":0.32675577623270985,"score_spread":0.31339945234846855,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2606103541","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0615547,0.020460365,0.27840537,0.052042823,0.007892105,0.0001490959,0.001986127,0.002174542,0.57533485],"genre_scores_gemma":[0.700244,0.015715515,0.11072766,0.015956739,0.0071924916,0.00041430056,0.0018372978,0.003462504,0.1444494],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9950696,0.0010881219,0.00020594598,0.0010818422,0.0017550399,0.0007995108],"domain_scores_gemma":[0.97969604,0.009007093,0.0010737606,0.0065881144,0.002393231,0.0012417482],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031229178,0.0015108299,0.0018767855,0.00172957,0.0038229143,0.008574834,0.0023354436,0.0028968041,0.042847708],"category_scores_gemma":[0.021045038,0.0010251758,0.0017421875,0.0026794078,0.007879983,0.026004564,0.0055554807,0.0094870655,0.0089719575],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009164352,0.000024078612,0.00031547394,0.00011158116,0.000019343079,0.000076772834,0.00017605517,0.002164768,0.00037883813,0.96152216,0.017967915,0.017151287],"study_design_scores_gemma":[0.000023456772,0.000035209796,0.00015923746,0.000063254694,0.000017916369,0.000146649,0.00011273476,0.004081114,0.00046905963,0.92264336,0.07222613,0.000022018456],"about_ca_topic_score_codex":0.0037850365,"about_ca_topic_score_gemma":0.004408753,"teacher_disagreement_score":0.042847708,"about_ca_system_score_codex":0.0052818027,"about_ca_system_score_gemma":0.0022065497,"threshold_uncertainty_score":0.14333993},"labels":[],"label_agreement":null},{"id":"W2762112321","doi":"10.1142/s0218195912600047","title":"π/2-ANGLE YAO GRAPHS ARE SPANNERS","year":2012,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Fixed Point Theorems Analysis","field":"Mathematics","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Spanner; Graph; Metric (unit); Plane (geometry); Metric space","score_opus":0.025349291335207764,"score_gpt":0.329245877191997,"score_spread":0.30389658585678925,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2762112321","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.69812155,0.0006035947,0.20637755,0.0008630109,0.00020653116,0.000070775786,0.00048995233,0.00039133753,0.09287576],"genre_scores_gemma":[0.93968725,0.00074097305,0.03553504,0.00026981978,0.000099437755,0.00010715997,0.00052550575,0.00015716789,0.02287761],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997235,0.000047608763,0.000012030586,0.000078926845,0.000074284835,0.00006367428],"domain_scores_gemma":[0.9994686,0.00012871204,0.00018166634,0.00006184642,0.00007401785,0.00008517429],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021405873,0.0005583692,0.00037569925,0.00068004313,0.00058570964,0.0009618995,0.00048075666,0.0006991973,0.009129489],"category_scores_gemma":[0.0010802972,0.00028209432,0.00034837436,0.0008102599,0.000861377,0.0031417308,0.0014889275,0.0011383904,0.0012028654],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018872858,0.000043384684,0.0011455577,0.00009149969,0.000022559467,0.00037071336,0.00022917755,0.011340871,0.012672903,0.94850206,0.0020566955,0.02333585],"study_design_scores_gemma":[0.000037547754,0.00017910197,0.0018418126,0.000036538382,0.000028066937,0.0006926956,0.0004523877,0.02925691,0.010983323,0.9380109,0.018437907,0.000042749896],"about_ca_topic_score_codex":0.00041339116,"about_ca_topic_score_gemma":0.0006822545,"teacher_disagreement_score":0.009129489,"about_ca_system_score_codex":0.00033882144,"about_ca_system_score_gemma":0.0002139718,"threshold_uncertainty_score":0.030541182},"labels":[],"label_agreement":null},{"id":"W2793208001","doi":"10.1142/s0218195917500066","title":"Competitive Online Routing on Delaunay Triangulations","year":2017,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba; Carleton University","funders":"","keywords":"Delaunay triangulation; Constrained Delaunay triangulation; Combinatorics; Bowyer–Watson algorithm; Mathematics; Pitteway triangulation; Competitive analysis; Chew's second algorithm; Discrete mathematics; Upper and lower bounds","score_opus":0.03124044391697462,"score_gpt":0.35422964422401154,"score_spread":0.3229892003070369,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2793208001","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0906415,0.0010226743,0.86593467,0.0011251821,0.00024187201,0.0004884532,0.0007600914,0.0022112064,0.03757435],"genre_scores_gemma":[0.48661235,0.0007049657,0.4921333,0.00042596407,0.00021452928,0.0006404142,0.0017152835,0.0005277835,0.017025324],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975821,0.0005469437,0.00012425898,0.0004942287,0.00086126983,0.00039121066],"domain_scores_gemma":[0.99481577,0.0025624707,0.0004493186,0.0010215368,0.0007331467,0.0004177097],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012342029,0.0011721256,0.001587176,0.0011357995,0.0016417516,0.0021875915,0.0035811157,0.0019515696,0.012073909],"category_scores_gemma":[0.009645715,0.0007609447,0.000988087,0.0022000063,0.0010262306,0.004318512,0.0034927374,0.0013532072,0.0027034343],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009004954,0.0003056236,0.0012680818,0.00050275173,0.00009621181,0.00052045047,0.00033332885,0.55083394,0.010213355,0.20621522,0.022043249,0.20676726],"study_design_scores_gemma":[0.000073302144,0.000106852116,0.00015640566,0.000017512733,0.000019425413,0.00017965084,0.00007882704,0.9203635,0.0022975437,0.06890201,0.0077821505,0.000022827782],"about_ca_topic_score_codex":0.0049896785,"about_ca_topic_score_gemma":0.0058800234,"teacher_disagreement_score":0.012073909,"about_ca_system_score_codex":0.0019720402,"about_ca_system_score_gemma":0.0014765166,"threshold_uncertainty_score":0.040391207},"labels":[],"label_agreement":null},{"id":"W2919291874","doi":"10.1142/s0218195919500018","title":"Partial Enclosure Range Searching","year":2019,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Rectangle; Polygon (computer graphics); Mathematics; Parallelogram; Intersection (aeronautics); Combinatorics; Range (aeronautics); Set (abstract data type); Discrete mathematics; Geometry; Computer science; Artificial intelligence","score_opus":0.011409741148092003,"score_gpt":0.2891017941395135,"score_spread":0.27769205299142147,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2919291874","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034634564,0.0011354627,0.95849466,0.00022626382,0.000054908116,0.00014537144,0.00047093426,0.0010281777,0.0038096237],"genre_scores_gemma":[0.3933256,0.0011078826,0.5954718,0.00025415173,0.00016974188,0.00035425555,0.002380319,0.00051151495,0.006424765],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99573046,0.0008858012,0.0004103298,0.0011750851,0.0014227415,0.00037561057],"domain_scores_gemma":[0.99203277,0.004509633,0.00073606346,0.0017275232,0.00072432513,0.00026972516],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016883615,0.0011333493,0.003450184,0.0017930013,0.0010457569,0.0029471533,0.0031210808,0.0019487814,0.00581868],"category_scores_gemma":[0.011567861,0.0007477767,0.001492261,0.003480547,0.0015039673,0.007670577,0.004349156,0.0013728341,0.0011187345],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009593884,0.00030202055,0.0085807685,0.0013971791,0.00028256016,0.0009845968,0.0012113518,0.29869184,0.019751467,0.091805436,0.013352253,0.5626811],"study_design_scores_gemma":[0.00007906919,0.00044604848,0.0019670874,0.00014447403,0.00009612561,0.0017464262,0.00048380953,0.8751045,0.013789478,0.08649605,0.01954128,0.00010572759],"about_ca_topic_score_codex":0.0014191659,"about_ca_topic_score_gemma":0.0009941122,"teacher_disagreement_score":0.00581868,"about_ca_system_score_codex":0.0005033821,"about_ca_system_score_gemma":0.0007394566,"threshold_uncertainty_score":0.019465446},"labels":[],"label_agreement":null},{"id":"W2973401770","doi":"10.1142/s021819591950002x","title":"Spanning Properties of Yao and 𝜃-Graphs in the Presence of Constraints","year":2019,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Disjoint sets; Upper and lower bounds; Discrete mathematics; Graph","score_opus":0.015887978363585277,"score_gpt":0.2665921095269326,"score_spread":0.2507041311633473,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2973401770","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.56369483,0.0017408716,0.38375437,0.0013510403,0.00007264304,0.00020797031,0.001195583,0.0008413646,0.047141332],"genre_scores_gemma":[0.8698218,0.0014353364,0.11869432,0.0004905628,0.000108269945,0.00027988435,0.0016022646,0.000397673,0.0071698828],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99812406,0.00046022853,0.00010667575,0.0004422852,0.0005306532,0.00033595503],"domain_scores_gemma":[0.99161166,0.0048778118,0.0012585915,0.0010104564,0.00073645246,0.0005050709],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014673239,0.0011378689,0.0009407059,0.001831036,0.0012900832,0.0017617532,0.001789096,0.00092134543,0.006291613],"category_scores_gemma":[0.011477661,0.0008336714,0.00093020085,0.002497893,0.0012494557,0.006621412,0.0021309198,0.0015974895,0.0007071977],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006776425,0.00021666083,0.0045082434,0.00053791323,0.00015828312,0.0008969112,0.0005865047,0.24615543,0.023080802,0.6394529,0.008038507,0.0756903],"study_design_scores_gemma":[0.00007904982,0.00017129269,0.0025778003,0.00011187302,0.000122025725,0.0009166543,0.00029210764,0.38807938,0.009919515,0.5863873,0.011262623,0.00008055422],"about_ca_topic_score_codex":0.0020687527,"about_ca_topic_score_gemma":0.002576809,"teacher_disagreement_score":0.006291613,"about_ca_system_score_codex":0.0013845777,"about_ca_system_score_gemma":0.00073550275,"threshold_uncertainty_score":0.021047473},"labels":[],"label_agreement":null},{"id":"W3022247802","doi":"10.1142/s0218195919500092","title":"The Most Likely Object to be Seen Through a Window","year":2019,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Mathematics; Combinatorics; Interval (graph theory)","score_opus":0.01278905434978944,"score_gpt":0.2947066355962634,"score_spread":0.281917581246474,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3022247802","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38977662,0.0009492105,0.6024767,0.0017419152,0.00008303725,0.00021640799,0.0013279285,0.0021881366,0.0012400658],"genre_scores_gemma":[0.6949103,0.00040057296,0.29842302,0.00029121162,0.00020676204,0.0002894167,0.0021774487,0.0005128451,0.0027884622],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99643075,0.0007149752,0.0002736835,0.0014267215,0.0007880915,0.0003657145],"domain_scores_gemma":[0.9800601,0.014566186,0.0016783183,0.0019754518,0.0009992627,0.0007207007],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042214426,0.0009796148,0.0026168956,0.0016749701,0.001105248,0.003476547,0.0041110497,0.0035376577,0.0033401977],"category_scores_gemma":[0.030779079,0.0012252051,0.0012384031,0.002177785,0.0015196992,0.0125193335,0.0027408362,0.0019227774,0.00086539413],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0053111757,0.0014756925,0.041961513,0.001798523,0.00053222425,0.0012537622,0.004838116,0.4399523,0.0687868,0.15582854,0.013082817,0.2651784],"study_design_scores_gemma":[0.00008198473,0.00033841564,0.0010802399,0.00003094607,0.00006318208,0.00017824919,0.000272135,0.9363149,0.008711813,0.051201213,0.0016900148,0.00003676977],"about_ca_topic_score_codex":0.003264545,"about_ca_topic_score_gemma":0.002020471,"teacher_disagreement_score":0.0042214426,"about_ca_system_score_codex":0.001624049,"about_ca_system_score_gemma":0.0015206026,"threshold_uncertainty_score":0.022325397},"labels":[],"label_agreement":null},{"id":"W3022463586","doi":"10.1142/s0218195916600050","title":"Planar Matchings for Weighted Straight Skeletons","year":2016,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Austrian Science Fund","keywords":"Planarity testing; Planar; Mathematics; Matching (statistics); Combinatorics; Set (abstract data type); Line (geometry); Line segment; Wavefront; Algorithm; Computer science; Geometry; Optics","score_opus":0.010909268826992155,"score_gpt":0.28020013969562296,"score_spread":0.2692908708686308,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3022463586","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04858166,0.00013052758,0.9387914,0.00011522446,0.000047465586,0.00008585322,0.00020438977,0.0002934082,0.011750138],"genre_scores_gemma":[0.50105995,0.00048584328,0.47671062,0.00017222883,0.00008862465,0.00034659475,0.0009048201,0.0004233309,0.01980791],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99909735,0.00014736467,0.00006859907,0.00024055576,0.00031719523,0.00012893778],"domain_scores_gemma":[0.9988846,0.00025044364,0.0002766612,0.00020215695,0.00026837076,0.00011773776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007155904,0.0006430329,0.00051781535,0.0020994092,0.0008676536,0.0015695415,0.0012301496,0.0012380306,0.008992258],"category_scores_gemma":[0.003580483,0.0004396608,0.00082264893,0.0013941454,0.0017797797,0.0034230165,0.0025279834,0.0013630684,0.002160844],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000391155,0.000028901546,0.0002818366,0.00006759325,0.0000105377985,0.00011494317,0.00013221239,0.02000257,0.006794067,0.9406026,0.0011271944,0.030798424],"study_design_scores_gemma":[0.000024077757,0.00009150307,0.0002905633,0.00003602771,0.00001593388,0.00026585252,0.00020146222,0.13826342,0.00677323,0.8400375,0.013966704,0.000033667842],"about_ca_topic_score_codex":0.00048373587,"about_ca_topic_score_gemma":0.0005980902,"teacher_disagreement_score":0.008992258,"about_ca_system_score_codex":0.0006351976,"about_ca_system_score_gemma":0.00048145346,"threshold_uncertainty_score":0.030082107},"labels":[],"label_agreement":null},{"id":"W3023015788","doi":"10.1142/s0218195919500122","title":"Line-of-Sight Pursuit in Monotone and Scallop Polygons","year":2019,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Guidance and Control Systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"National Science Foundation","keywords":"Polygon (computer graphics); Monotone polygon; Combinatorics; Mathematics; Point (geometry); Line (geometry); Pursuit-evasion; Regular polygon; Position (finance); Line segment; Boundary (topology); Computer science; Geometry; Artificial intelligence; Mathematical analysis; Frame (networking)","score_opus":0.00449537150908884,"score_gpt":0.2338924095762113,"score_spread":0.22939703806712244,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3023015788","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6993168,0.00076912035,0.23139583,0.00072657433,0.000101367594,0.00013455226,0.0004235016,0.00019535873,0.06693689],"genre_scores_gemma":[0.97596484,0.00036787096,0.016140042,0.00004740676,0.000025002533,0.00006437115,0.00016208497,0.000046891648,0.0071814763],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99940956,0.00019683395,0.000020443935,0.00008277568,0.000120842764,0.00016957421],"domain_scores_gemma":[0.99848783,0.0008975679,0.0002430541,0.00006858108,0.00006423474,0.00023865122],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004696104,0.00083899335,0.00058271363,0.00046502287,0.0007138096,0.0016657774,0.0010590436,0.001046488,0.0041029095],"category_scores_gemma":[0.0037760502,0.00031963267,0.0007245906,0.00043202195,0.0018905326,0.0017469957,0.0014260495,0.000942969,0.00041551952],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004904797,0.00012308129,0.0039677722,0.00018127201,0.00005912673,0.0021361292,0.00070101523,0.4347677,0.0030024683,0.5423033,0.0019982343,0.010269347],"study_design_scores_gemma":[0.000093449766,0.00016551347,0.0007496418,0.0000385348,0.00002758947,0.00030718328,0.00048195815,0.83434266,0.00065246015,0.15955508,0.0035621212,0.000023705352],"about_ca_topic_score_codex":0.004938035,"about_ca_topic_score_gemma":0.0024376821,"teacher_disagreement_score":0.004938035,"about_ca_system_score_codex":0.0010930336,"about_ca_system_score_gemma":0.0004499101,"threshold_uncertainty_score":0.013725638},"labels":[],"label_agreement":null},{"id":"W3082387259","doi":"10.1142/s0218195920500016","title":"Local Routing in Convex Subdivisions","year":2020,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan; University of Manitoba; Carleton University","funders":"","keywords":"Subdivision; Monotone polygon; Mathematics; Computer science; Topology (electrical circuits); Combinatorics; Geometry; Geography","score_opus":0.015343762615412522,"score_gpt":0.28210660449716746,"score_spread":0.2667628418817549,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3082387259","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07851755,0.00021691839,0.9108987,0.00020581967,0.00003462911,0.00006987386,0.000115940085,0.0007614686,0.0091790715],"genre_scores_gemma":[0.77411354,0.00025611374,0.21821706,0.000141136,0.000027029584,0.00014547192,0.00034426473,0.00015106863,0.006604294],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994282,0.00013670478,0.00003543792,0.00012802595,0.00017774913,0.000093916045],"domain_scores_gemma":[0.9983987,0.00066560315,0.00021000394,0.00045587687,0.00020082027,0.0000690674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056877616,0.0003556942,0.00056140916,0.0004059637,0.00063719065,0.0010503342,0.0011439371,0.00044223492,0.0028606688],"category_scores_gemma":[0.0030413563,0.00023566416,0.00041435522,0.00049467257,0.0012974445,0.0019541858,0.002041073,0.0008710432,0.00057990267],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002797046,0.000057387966,0.0009659481,0.00013141774,0.000022804768,0.0001962423,0.00047292135,0.4556618,0.017351419,0.3736403,0.0029643008,0.1482557],"study_design_scores_gemma":[0.000015668067,0.00007469187,0.0001511584,0.000015001104,0.000007938758,0.000062404775,0.00006539453,0.8488289,0.0056711654,0.14132947,0.003763694,0.000014463643],"about_ca_topic_score_codex":0.0019617353,"about_ca_topic_score_gemma":0.002503307,"teacher_disagreement_score":0.0028606688,"about_ca_system_score_codex":0.00096825825,"about_ca_system_score_gemma":0.00054774596,"threshold_uncertainty_score":0.009569883},"labels":[],"label_agreement":null},{"id":"W3197202594","doi":"10.1142/s0218195922410035","title":"Bottleneck Convex Subsets: Finding k Large Convex Sets in a Point Set","year":2023,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Saskatchewan; University of Manitoba","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Disjoint sets; Convex hull; Cardinality (data modeling); Parameterized complexity; Convex set; Generalization; Time complexity; Discrete mathematics; Regular polygon; Convex analysis; Convex optimization; Computer science","score_opus":0.024667587464482957,"score_gpt":0.3269574322328215,"score_spread":0.30228984476833853,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3197202594","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042897448,0.00054929045,0.948486,0.0005906494,0.00003839761,0.00068639126,0.0010650798,0.0010997913,0.0045870394],"genre_scores_gemma":[0.20455076,0.0004398261,0.78606164,0.00019555022,0.00008707996,0.0011280603,0.003003252,0.0005276685,0.0040060915],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99792826,0.00055894064,0.00017000601,0.00062042504,0.00044740416,0.0002749813],"domain_scores_gemma":[0.9942954,0.0041839182,0.00035376646,0.0006268349,0.00032965324,0.00021038814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027723943,0.002558677,0.0034876808,0.0025584092,0.0017620357,0.0026522737,0.0037474905,0.0026225469,0.0068626306],"category_scores_gemma":[0.011600007,0.0020861242,0.0028882488,0.004825106,0.0024427883,0.0077137803,0.004567926,0.0026336499,0.0018482597],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014229285,0.00043047286,0.003780348,0.0011842989,0.00028480333,0.00051268,0.0011235056,0.6005713,0.010431183,0.104135476,0.01875107,0.25737193],"study_design_scores_gemma":[0.00017794147,0.000110395165,0.00055600615,0.00007312662,0.00005032389,0.00018691676,0.00030701637,0.84944147,0.005709216,0.13955966,0.0037822572,0.000045706427],"about_ca_topic_score_codex":0.004402664,"about_ca_topic_score_gemma":0.0038386853,"teacher_disagreement_score":0.0068626306,"about_ca_system_score_codex":0.002030933,"about_ca_system_score_gemma":0.0020268934,"threshold_uncertainty_score":0.022957802},"labels":[],"label_agreement":null},{"id":"W4231917931","doi":"10.1142/s021819590500183x","title":"GUEST EDITORS' FOREWORD","year":2005,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Queen's University","funders":"","keywords":"Mathematics; Library science; Computer science","score_opus":0.00928222932080469,"score_gpt":0.2835271118827819,"score_spread":0.2742448825619772,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4231917931","genre_codex":"editorial","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00031232813,0.014373625,0.0012956084,0.028566308,0.8552599,0.00013196829,0.00090536324,0.0008080469,0.09834681],"genre_scores_gemma":[0.0028696524,0.019285856,0.001386127,0.012262354,0.38109028,0.00012312928,0.0011467448,0.00090041955,0.5809354],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99773324,0.00016111265,0.00020333593,0.00032062808,0.0013937549,0.00018789314],"domain_scores_gemma":[0.9853302,0.001374357,0.00061773945,0.0007240198,0.009278087,0.00267558],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.002276371,0.0017718357,0.001668647,0.0038936054,0.0017572698,0.0068838364,0.0019584498,0.002494336,0.3057856],"category_scores_gemma":[0.012759386,0.00055472704,0.0011972721,0.002209811,0.0006320806,0.0040634493,0.0024037277,0.0036367418,0.30372792],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009523113,0.00000676192,0.000025884874,0.00009113762,0.0000016724609,0.000022407987,0.000009810877,0.00001621757,0.00006968591,0.00034800015,0.97715354,0.022245461],"study_design_scores_gemma":[0.0000032873857,0.000010274545,0.00008617125,0.00010461921,0.0000027541578,0.000071380375,0.000019843403,0.000023952862,0.00007216588,0.00036613768,0.9992353,0.0000041526096],"about_ca_topic_score_codex":0.00078398176,"about_ca_topic_score_gemma":0.0016854769,"teacher_disagreement_score":0.6942144,"about_ca_system_score_codex":0.0012409129,"about_ca_system_score_gemma":0.0020281496,"threshold_uncertainty_score":0.9902126},"labels":[],"label_agreement":null},{"id":"W4254025326","doi":"10.1142/s0218195916020015","title":"Guest Editors’ Foreword","year":2016,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Contemporary Sociological Theory and Practice","field":"Social Sciences","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Mathematics; Computer science","score_opus":0.03265187974506776,"score_gpt":0.3705544209717984,"score_spread":0.33790254122673063,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4254025326","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011386944,0.0037164516,0.00020187085,0.042539507,0.94685477,0.000023209024,0.000084923995,0.00008680353,0.0063784937],"genre_scores_gemma":[0.0024062821,0.0033550607,0.00031171262,0.03219326,0.89144653,0.00007733787,0.00012304765,0.00016078907,0.069926016],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.996976,0.00037087497,0.00030004597,0.0005510407,0.0014227155,0.00037923755],"domain_scores_gemma":[0.98009574,0.0038443226,0.0014570432,0.0009529587,0.009359681,0.004290292],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004256909,0.0013736966,0.0013946759,0.0020149462,0.0021219642,0.0075719613,0.0020432733,0.0070876717,0.08079236],"category_scores_gemma":[0.02932576,0.00053801795,0.0011091543,0.0009141048,0.0010657264,0.003137944,0.0027855835,0.008931423,0.04998141],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021937123,0.000007596987,0.000046053698,0.00007541811,0.000004318778,0.000071154136,0.00001133045,0.000014927126,0.00006718517,0.0004463569,0.989239,0.009994727],"study_design_scores_gemma":[0.000018163424,0.000021447267,0.00021824181,0.00014738938,0.000010043441,0.00018324581,0.000036081554,0.00006245253,0.00015076366,0.00075209135,0.99839056,0.000009540904],"about_ca_topic_score_codex":0.00064171327,"about_ca_topic_score_gemma":0.0013133972,"teacher_disagreement_score":0.08079236,"about_ca_system_score_codex":0.0014277515,"about_ca_system_score_gemma":0.00264081,"threshold_uncertainty_score":0.27027738},"labels":[],"label_agreement":null},{"id":"W4255103485","doi":"10.1142/s0218195912500057","title":"GHOST CHIMNEYS","year":2012,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Mathematics; Combinatorics; Set (abstract data type); Point (geometry); Planar; Value (mathematics); Projection (relational algebra); Geometry; Algorithm; Computer science; Statistics; Computer graphics (images)","score_opus":0.013166922812998352,"score_gpt":0.2918596728452709,"score_spread":0.27869275003227256,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4255103485","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4153858,0.00093555194,0.5115863,0.000708841,0.00024112962,0.00018300366,0.003217951,0.0017201888,0.0660211],"genre_scores_gemma":[0.7871818,0.00034337363,0.1928137,0.00019376277,0.000092633854,0.00019168772,0.0029804083,0.00038596115,0.01581671],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99836713,0.00020798824,0.00012070797,0.00037002834,0.0006333355,0.00030091312],"domain_scores_gemma":[0.9953625,0.0013158352,0.0006062246,0.0010742565,0.00076621433,0.00087503094],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010750382,0.00082608836,0.0011985815,0.0019283731,0.0016066823,0.0027457557,0.0020350572,0.00107031,0.009883597],"category_scores_gemma":[0.0069761956,0.0010621515,0.0009360388,0.0012534836,0.0031110707,0.0038918694,0.004988516,0.0019915549,0.0012634438],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010517023,0.00008709324,0.010148359,0.0006537786,0.00013293463,0.0010061624,0.0007059304,0.059687257,0.02473658,0.8261141,0.010772852,0.06490333],"study_design_scores_gemma":[0.000103674975,0.0002910625,0.007058203,0.00030876746,0.0001225749,0.0024431518,0.0007896701,0.17492704,0.03944577,0.7382537,0.03606776,0.00018867252],"about_ca_topic_score_codex":0.0006805041,"about_ca_topic_score_gemma":0.00081447605,"teacher_disagreement_score":0.009883597,"about_ca_system_score_codex":0.0007849662,"about_ca_system_score_gemma":0.0007224896,"threshold_uncertainty_score":0.03306389},"labels":[],"label_agreement":null},{"id":"W4313404159","doi":"10.1142/s0218195922410011","title":"Ruler Wrapping","year":2022,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Ruler; Mathematics; Clockwise; Hinge; Combinatorics; Interval (graph theory); Session (web analytics); Computer science; Geometry; Rotation (mathematics); Engineering; Physics","score_opus":0.012747428891085781,"score_gpt":0.27660298234753367,"score_spread":0.2638555534564479,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313404159","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12640467,0.0014297904,0.8291373,0.0010266309,0.0006418166,0.00085316855,0.0014171911,0.0035835125,0.035505954],"genre_scores_gemma":[0.47048798,0.0008875989,0.502198,0.000730168,0.00016526216,0.00042502215,0.0035611705,0.00081092963,0.020733872],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964978,0.0005066601,0.0003041009,0.0013624815,0.0008993505,0.00042963],"domain_scores_gemma":[0.9962763,0.0015898007,0.00030864237,0.0011463028,0.00048222364,0.00019674057],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012578184,0.001194197,0.0018924997,0.00080428587,0.0013827151,0.0017044662,0.0021261547,0.0017064518,0.009935575],"category_scores_gemma":[0.0069235046,0.0007627389,0.0021136256,0.0012141846,0.0019561667,0.0037872777,0.0031801078,0.001855126,0.0036167249],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016703724,0.00044261705,0.0032633485,0.001222721,0.00019514035,0.0028605796,0.00095155207,0.13144219,0.052181046,0.14574836,0.032132346,0.62788975],"study_design_scores_gemma":[0.00029046042,0.0011849338,0.0014893451,0.00031270963,0.00023089821,0.0031891544,0.0008702979,0.42253548,0.09710704,0.37135792,0.10121046,0.00022130826],"about_ca_topic_score_codex":0.0010502788,"about_ca_topic_score_gemma":0.0010264585,"teacher_disagreement_score":0.009935575,"about_ca_system_score_codex":0.00073439156,"about_ca_system_score_gemma":0.0006981748,"threshold_uncertainty_score":0.033237875},"labels":[],"label_agreement":null},{"id":"W4389914592","doi":"10.1142/s021819592350005x","title":"Maximum Bipartite Subgraphs of Geometric Intersection Graphs","year":2023,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Combinatorics; Bipartite graph; Mathematics; Intersection graph; Intersection (aeronautics); Complete bipartite graph; Unit (ring theory); Unit disk graph; Set (abstract data type); Graph; Discrete mathematics; Line graph; Computer science","score_opus":0.015685794196199566,"score_gpt":0.2849872331532422,"score_spread":0.2693014389570426,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389914592","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.266888,0.0013786242,0.7006409,0.0016703465,0.000088874156,0.0003198827,0.0018982098,0.0017912046,0.025324017],"genre_scores_gemma":[0.7341965,0.00102569,0.24711442,0.0005018879,0.00019217673,0.00036638175,0.0068841344,0.0009224289,0.008796445],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982256,0.00067261606,0.000059321403,0.0003743215,0.0003640085,0.00030402074],"domain_scores_gemma":[0.9953454,0.0029060384,0.0006146621,0.0005022997,0.00034555755,0.00028603472],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090655923,0.0012020407,0.0012364786,0.0013945956,0.0010229304,0.0016234322,0.0021089632,0.0011164125,0.0071820817],"category_scores_gemma":[0.006564349,0.0011002246,0.0013495029,0.0032460592,0.0012581839,0.004610758,0.0027229388,0.0017708415,0.0008803093],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00075466663,0.00047361344,0.004721813,0.0011857959,0.00026618788,0.00078718236,0.0008250867,0.44259408,0.01034885,0.38310236,0.025764557,0.12917581],"study_design_scores_gemma":[0.000104157974,0.000085142136,0.0016376562,0.00007524265,0.00008835264,0.0004006179,0.00024583814,0.51783556,0.004354482,0.465896,0.009244454,0.000032460248],"about_ca_topic_score_codex":0.0034496102,"about_ca_topic_score_gemma":0.003173529,"teacher_disagreement_score":0.0071820817,"about_ca_system_score_codex":0.0018313706,"about_ca_system_score_gemma":0.00089977385,"threshold_uncertainty_score":0.024026513},"labels":[],"label_agreement":null},{"id":"W7124166552","doi":"10.1142/s0218195926500019","title":"An Effective Cloud Resource Allocation Framework with User Authentication Based on BED-DSA and AR-BiLSTM","year":2025,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Cloud computing; Resource allocation; Virtual machine; Authentication (law); Queue; Signature (topology); Resource (disambiguation); Digital signature","score_opus":0.004223656884772528,"score_gpt":0.2697324280358858,"score_spread":0.26550877115111327,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7124166552","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018269721,0.0003905512,0.97363055,0.00016355918,0.00009505249,0.00014123287,0.00011625058,0.0044324924,0.0027605444],"genre_scores_gemma":[0.59908235,0.0002658831,0.39476088,0.00019690189,0.00007251578,0.00027053594,0.0004926424,0.00013947542,0.0047188476],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.999134,0.00013277335,0.00006339177,0.00018285922,0.00031187266,0.00017522606],"domain_scores_gemma":[0.9997069,0.000034419692,0.000025506612,0.00004744417,0.00012874187,0.00005695505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005967646,0.0005950278,0.0009256106,0.0007002065,0.0010107673,0.0011874264,0.0015014067,0.00053484045,0.0027337526],"category_scores_gemma":[0.00086528563,0.00027491638,0.00062823924,0.000784894,0.00038407196,0.0015051047,0.0015615961,0.00064686197,0.0007754535],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009014525,0.0004878258,0.003912025,0.00024227616,0.00012628904,0.0004871666,0.00030842714,0.28696737,0.03908031,0.037905656,0.019090984,0.61049026],"study_design_scores_gemma":[0.00003300654,0.00006518813,0.00044014645,0.0000061550977,0.0000159366,0.00012626774,0.000042623957,0.9872344,0.0039913002,0.0032228087,0.0047912616,0.000030932115],"about_ca_topic_score_codex":0.012680264,"about_ca_topic_score_gemma":0.009631906,"teacher_disagreement_score":0.012680264,"about_ca_system_score_codex":0.0010041905,"about_ca_system_score_gemma":0.0024091422,"threshold_uncertainty_score":0.025212884},"labels":[],"label_agreement":null}]}