{"meta":{"query_hash":"d040838b2c79","filters":{"venue":"Canadian Conference on Computational Geometry"},"cohort_total":115,"direct_labels_cover":0,"predictions_cover":115,"exported":115,"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/d040838b2c79","api":"https://metacan.xera.ac/api/v1/cohort?venue=Canadian+Conference+on+Computational+Geometry"},"results":[{"id":"W10199753","doi":"10.1210/jcem.84.4.5617","title":"The Steiner Ratio for Obstacle-Avoiding Rectilinear Steiner Trees","year":2008,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"VLSI and FPGA Design Techniques","field":"Engineering","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":"Steiner tree problem; Obstacle; Combinatorics; Mathematics; Set (abstract data type); Computer science; Discrete mathematics; Mathematical optimization; Geography","score_opus":0.04271413218695374,"score_gpt":0.23622477898947547,"score_spread":0.19351064680252172,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W10199753","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3581877,0.0012707169,0.6048782,0.0027590839,0.0018861139,0.0018179185,0.0005404605,0.00127643,0.027383413],"genre_scores_gemma":[0.9957785,0.000046798774,0.0024201933,0.00025286252,0.00017560604,0.000074355296,0.00007533205,0.000034551573,0.0011417927],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990236,0.00002987431,0.00022428119,0.00018915148,0.00018463147,0.000348466],"domain_scores_gemma":[0.99886876,0.00050021627,0.00003089206,0.00016925632,0.00021312949,0.0002177669],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018150425,0.0001707198,0.00014842619,0.0002726692,0.0005596302,0.000092475886,0.00021316248,0.00009100174,0.00005851818],"category_scores_gemma":[0.00012742655,0.00014707475,0.000066369474,0.00030441975,0.00007203888,0.0000981013,0.000007447068,0.00020882214,0.000039868017],"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.00007247236,0.000057836092,0.0022422152,0.00010807244,0.0003570464,0.00009283508,0.0011223084,0.4268127,0.0024156608,0.21880485,0.19854376,0.14937025],"study_design_scores_gemma":[0.0007027058,0.00025082642,0.008589248,0.00007348262,0.000018798213,0.000057866368,0.000272223,0.8845611,0.0025290558,0.009102995,0.093097724,0.00074392935],"about_ca_topic_score_codex":0.00066185213,"about_ca_topic_score_gemma":0.0048584323,"teacher_disagreement_score":0.6375908,"about_ca_system_score_codex":0.00018135401,"about_ca_system_score_gemma":0.00033957994,"threshold_uncertainty_score":0.5997534},"labels":[],"label_agreement":null},{"id":"W105892904","doi":"","title":"Approximate Orthogonal Range Search using Patricia Tries","year":2005,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Data Management and Algorithms","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 New Brunswick","funders":"","keywords":"Rectangle; Range query (database); Combinatorics; Range (aeronautics); Mathematics; Boundary (topology); Set (abstract data type); Trie; Range tree; Binary logarithm; Computational geometry; Data structure; Discrete mathematics; Algorithm; Computer science; Tree structure; Geometry; Binary tree; Sargable; Search engine; Interval tree; Mathematical analysis","score_opus":0.05859047501254531,"score_gpt":0.2789679369922952,"score_spread":0.22037746197974992,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W105892904","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0726504,0.000101226586,0.9096899,0.0052132327,0.00044932374,0.00034650753,0.00020934075,0.00016005283,0.01118002],"genre_scores_gemma":[0.91941965,0.000007551227,0.07811501,0.0016227565,0.00025868294,0.000006754215,0.000120712444,0.000012500973,0.00043640277],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998133,0.000058659625,0.00024691722,0.00048234,0.00054735824,0.00053175096],"domain_scores_gemma":[0.99887836,0.000099240846,0.000063464475,0.00032656468,0.00022640482,0.00040595958],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000351317,0.00019127376,0.00017732965,0.00097137823,0.00031520746,0.0005668301,0.00092961406,0.00006229994,0.00027677958],"category_scores_gemma":[0.00003072191,0.00020166904,0.000059506692,0.0011266714,0.000073657226,0.0007678823,0.00014460756,0.00020015366,0.0003147973],"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.00000765393,0.00006584547,0.0017955367,0.000022590062,0.00004583936,0.000058202917,0.00018893059,0.04946891,0.0000064133737,0.6713164,0.0029948654,0.2740288],"study_design_scores_gemma":[0.000416881,0.000042913773,0.005863655,0.000022336968,0.000005999042,0.00000910325,0.000042665863,0.9806701,0.00001799123,0.0050096433,0.0075883917,0.00031030554],"about_ca_topic_score_codex":0.0020972076,"about_ca_topic_score_gemma":0.0022302468,"teacher_disagreement_score":0.9312012,"about_ca_system_score_codex":0.00022063812,"about_ca_system_score_gemma":0.0009304551,"threshold_uncertainty_score":0.82238245},"labels":[],"label_agreement":null},{"id":"W106774954","doi":"","title":"k-star-shaped polygons.","year":2010,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Star (game theory); Computer science; Astronomy; Physics; Astrophysics","score_opus":0.021260620510737852,"score_gpt":0.2466922709916981,"score_spread":0.22543165048096026,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W106774954","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25817558,0.00006452099,0.6825866,0.017289886,0.0040440094,0.00050086045,0.00012559365,0.00039943613,0.036813494],"genre_scores_gemma":[0.94583863,0.0000023706505,0.049408924,0.003594509,0.00025413994,0.000018919121,0.00013949828,0.000013753099,0.00072926853],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99799716,0.00005383774,0.00030972232,0.00060305174,0.0005377712,0.00049842376],"domain_scores_gemma":[0.9979501,0.00025275917,0.00009843809,0.0004503739,0.0004960911,0.00075224653],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003124902,0.00024351176,0.00018922787,0.0011200374,0.00040420648,0.00044274743,0.00091038574,0.00014783852,0.0007995607],"category_scores_gemma":[0.00017454947,0.00026650558,0.00008800984,0.0013398158,0.0000820215,0.00044128674,0.00007609944,0.0004826996,0.0006711091],"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.0000048797874,0.00004834027,0.00027523065,0.000005510535,0.000021789852,0.00003179682,0.00008882747,0.005802536,0.00087594084,0.9492685,0.0031653694,0.040411234],"study_design_scores_gemma":[0.0006361333,0.00015580063,0.04181235,0.000020216277,0.000007661382,0.00010257884,0.000026417903,0.79591775,0.00023889042,0.11305383,0.047307387,0.00072097214],"about_ca_topic_score_codex":0.0018582375,"about_ca_topic_score_gemma":0.009905346,"teacher_disagreement_score":0.8362147,"about_ca_system_score_codex":0.00010505836,"about_ca_system_score_gemma":0.0020496747,"threshold_uncertainty_score":0.9999787},"labels":[],"label_agreement":null},{"id":"W116145823","doi":"","title":"Generalizations of Interval Graphs","year":2009,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Constraint Satisfaction and Optimization","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":"Simon Fraser University","funders":"","keywords":"Interval graph; Interval (graph theory); Computer science; Context (archaeology); Graph theory; Constraint satisfaction; Constraint satisfaction problem; Theoretical computer science; Discrete mathematics; Indifference graph; Constraint (computer-aided design); Chordal graph; Graph; Mathematics; Combinatorics; Algorithm; Artificial intelligence; 1-planar graph; Probabilistic logic","score_opus":0.024376740920435104,"score_gpt":0.2516074585732732,"score_spread":0.22723071765283812,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W116145823","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013733263,0.000017679859,0.96437186,0.00515011,0.00027974902,0.000117367345,0.000031997275,0.000069834496,0.016228113],"genre_scores_gemma":[0.9669654,0.0000054753878,0.03097041,0.0018810325,0.00001548382,0.0000020183984,0.000048292608,0.0000032169419,0.00010866379],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991104,0.00003476101,0.00022881968,0.00022669844,0.00021997742,0.00017934255],"domain_scores_gemma":[0.999119,0.00004844069,0.00008314247,0.00019432436,0.00031774663,0.00023738813],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008592921,0.00010306149,0.000121529185,0.00077895547,0.00010700827,0.00009006904,0.0003311803,0.000052829957,0.00028482682],"category_scores_gemma":[0.000045292178,0.00011416269,0.000054877208,0.0008641209,0.000045554134,0.00021387721,0.000013206868,0.000087099455,0.000036865687],"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.0000012023695,0.000017528038,0.0005679319,0.0000018105342,0.0000073560195,0.0000032239404,0.00007874068,0.046278853,0.000021325855,0.89334404,0.00080707687,0.05887088],"study_design_scores_gemma":[0.00042620674,0.0002070365,0.14044102,0.00004667158,0.000006047416,0.000023850494,0.000041733914,0.71154726,0.00012323451,0.14567629,0.0011353875,0.00032526738],"about_ca_topic_score_codex":0.00071364566,"about_ca_topic_score_gemma":0.0017999349,"teacher_disagreement_score":0.95323217,"about_ca_system_score_codex":0.00007220251,"about_ca_system_score_gemma":0.0006439051,"threshold_uncertainty_score":0.46554196},"labels":[],"label_agreement":null},{"id":"W121085945","doi":"","title":"The PKD-tree for Orthogonal d-Dimensional Range Search.","year":2006,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Data Management and Algorithms","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 New Brunswick","funders":"","keywords":"Range tree; Tree (set theory); Combinatorics; R-tree; Search engine indexing; K-ary tree; Mathematics; Pyramid (geometry); Tree structure; Interval tree; Computer science; Algorithm; Binary tree; Spatial database; Artificial intelligence; Statistics; Spatial analysis; Geometry","score_opus":0.02736035179704939,"score_gpt":0.24675582092588252,"score_spread":0.21939546912883312,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W121085945","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016358726,0.00019973301,0.9196595,0.036029525,0.0015468826,0.00096478395,0.00060611253,0.0001850054,0.024449766],"genre_scores_gemma":[0.97185296,0.0000033832816,0.021958353,0.0018559117,0.0003731973,0.000053347118,0.0004540206,0.000015718551,0.0034331197],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99823755,0.000045185938,0.00023151538,0.00043301898,0.00052150193,0.0005312347],"domain_scores_gemma":[0.99859816,0.00042011632,0.00005968299,0.00033939074,0.0003334495,0.0002492193],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043856626,0.00016828686,0.00012656047,0.0003729528,0.00068714895,0.0006181711,0.0010491968,0.00005003632,0.000059421727],"category_scores_gemma":[0.000042488577,0.0001393387,0.00008273193,0.00055964454,0.000110162124,0.0003078163,0.000110552915,0.00014215027,0.00019916818],"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.0000064726123,0.00002033133,0.00022352004,0.0000049367545,0.000019114528,0.000011381277,0.000008369082,0.0063713253,0.0000027132194,0.89596176,0.026030298,0.071339756],"study_design_scores_gemma":[0.0007116434,0.00010280651,0.03484404,0.000021414842,0.000007317542,0.0000066694947,0.000020220145,0.7644218,0.000015745805,0.1202195,0.07926868,0.000360171],"about_ca_topic_score_codex":0.0032956745,"about_ca_topic_score_gemma":0.015735656,"teacher_disagreement_score":0.9554942,"about_ca_system_score_codex":0.000114988754,"about_ca_system_score_gemma":0.00081125594,"threshold_uncertainty_score":0.87808657},"labels":[],"label_agreement":null},{"id":"W121933743","doi":"","title":"Area-Proportional Drawings of Intersecting Families of Simple Closed Curves.","year":2005,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Jordan curve theorem; Mathematics; Combinatorics; Plane curve; Simple (philosophy); Graph; Plane (geometry); Geometry","score_opus":0.028939908460865162,"score_gpt":0.2564893939256543,"score_spread":0.22754948546478912,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W121933743","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45671332,0.00034263547,0.52697307,0.004540362,0.00045217812,0.0003890687,0.0001685647,0.00008320852,0.010337581],"genre_scores_gemma":[0.9777967,0.000019566427,0.020513574,0.0012721356,0.00008418665,0.000008561954,0.00019418787,0.000008836559,0.00010227736],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980446,0.00005733288,0.00060446525,0.00038904144,0.0006164872,0.000288049],"domain_scores_gemma":[0.99798185,0.00029808405,0.00032103658,0.00025803555,0.0008894709,0.00025151903],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037448338,0.00018670825,0.0002859429,0.0010621353,0.00013282595,0.000051861833,0.00055362214,0.0000748402,0.00030192494],"category_scores_gemma":[0.00022370592,0.00020524483,0.000112720765,0.0012013887,0.0001085636,0.00039640852,0.00007120935,0.00016879676,0.00002852559],"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.000025500183,0.00020772147,0.0030834354,0.00021791385,0.00012111261,0.00001166026,0.00073306117,0.33904022,0.00092776574,0.48387814,0.007560301,0.16419315],"study_design_scores_gemma":[0.0010944763,0.0004261805,0.05752256,0.0005467214,0.000026039821,0.00004830587,0.00025869923,0.88492966,0.0054093953,0.042870626,0.0061305775,0.0007367577],"about_ca_topic_score_codex":0.0016498228,"about_ca_topic_score_gemma":0.002417304,"teacher_disagreement_score":0.54588944,"about_ca_system_score_codex":0.00015477263,"about_ca_system_score_gemma":0.0014908776,"threshold_uncertainty_score":0.8369641},"labels":[],"label_agreement":null},{"id":"W129388523","doi":"","title":"On the Computation and Chromatic Number of Colored Domino Tilings.","year":2005,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Cellular Automata and Applications","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 Regina","funders":"","keywords":"Colored; Domino; Rectangle; Polygon (computer graphics); Mathematics; Combinatorics; Set (abstract data type); Simple (philosophy); Computer science; Frame (networking); Geometry","score_opus":0.020398733762552145,"score_gpt":0.25723889698568386,"score_spread":0.23684016322313173,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W129388523","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.76621014,0.0000272911,0.20951201,0.011548811,0.0000928291,0.00037452203,0.00004365582,0.00006347312,0.012127236],"genre_scores_gemma":[0.9848792,0.0000025681948,0.013565002,0.001377357,0.000026400752,0.000018124576,0.00003113854,0.000006335677,0.00009388118],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99900395,0.000045390374,0.00023164968,0.00026451363,0.00026569498,0.00018879962],"domain_scores_gemma":[0.9988299,0.0004970361,0.000109469474,0.00022603906,0.00015849937,0.00017904794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018185347,0.00012226468,0.00013873477,0.000198912,0.00019917492,0.00012821562,0.0003849136,0.000050780513,0.00015056902],"category_scores_gemma":[0.00005379786,0.00010318422,0.00003572964,0.00047024383,0.00010970669,0.000117029915,0.00003912841,0.000118952164,0.00022916918],"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.0000023642422,0.000036694917,0.00013927906,0.000009241912,0.000015786642,0.0000019463605,0.00023686698,0.009613825,0.000049609782,0.9660699,0.0017639959,0.022060482],"study_design_scores_gemma":[0.00028749395,0.000048650447,0.014250758,0.000040690567,0.000005935971,0.000020772386,0.000040997016,0.9260005,0.00018101258,0.057928618,0.0010331615,0.0001614598],"about_ca_topic_score_codex":0.00066323957,"about_ca_topic_score_gemma":0.00076684606,"teacher_disagreement_score":0.9163866,"about_ca_system_score_codex":0.00008445507,"about_ca_system_score_gemma":0.0003923524,"threshold_uncertainty_score":0.42077303},"labels":[],"label_agreement":null},{"id":"W130561602","doi":"","title":"Morphing Planar Graph Drawings.","year":2007,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","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":"Morphing; Planar graph; Graph drawing; Mathematical proof; Outerplanar graph; Computer science; Lattice graph; Planar straight-line graph; Vertex (graph theory); Graph; Mathematics; Combinatorics; Line graph; Computer graphics (images); Pathwidth; Geometry; Voltage graph","score_opus":0.02609874843551627,"score_gpt":0.25238890273672476,"score_spread":0.2262901543012085,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W130561602","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043173432,0.00006907789,0.9363164,0.0026342624,0.00087662745,0.00018324019,0.000024833857,0.00015633811,0.016565844],"genre_scores_gemma":[0.9480151,0.0000036157733,0.04754776,0.0037242472,0.0002149444,0.0000061147443,0.00012429866,0.00001334157,0.00035059577],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977149,0.000046901205,0.0003892201,0.0005871736,0.00064283557,0.000618966],"domain_scores_gemma":[0.9980622,0.00033629246,0.00012020455,0.00032589916,0.00042612705,0.0007292698],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007451346,0.00024373671,0.00019564429,0.0017926705,0.00046620288,0.0003678846,0.0007614138,0.00012239038,0.00013605722],"category_scores_gemma":[0.000115210605,0.00027252364,0.00009334957,0.0018498681,0.00006405569,0.00047861066,0.000045173732,0.00028628932,0.00034125135],"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.000008359335,0.00003707554,0.0006380742,0.000008033434,0.000029884139,0.00011159947,0.00018203235,0.036387347,0.00012814715,0.91702104,0.003328406,0.042119995],"study_design_scores_gemma":[0.0015092036,0.0004500616,0.16608252,0.00013997732,0.000020768202,0.00027183915,0.00019351,0.35932985,0.0011100089,0.435982,0.033108264,0.0018020247],"about_ca_topic_score_codex":0.002144105,"about_ca_topic_score_gemma":0.0047983406,"teacher_disagreement_score":0.90484166,"about_ca_system_score_codex":0.0002515657,"about_ca_system_score_gemma":0.0010155884,"threshold_uncertainty_score":0.9999727},"labels":[],"label_agreement":null},{"id":"W1590814900","doi":"","title":"Space-Efficient Algorithms for Klee's Measure Problem.","year":2005,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","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":"Measure (data warehouse); Combinatorics; Mathematics; Plane (geometry); Space (punctuation); Binary logarithm; Set (abstract data type); Computational geometry; Degenerate energy levels; Time complexity; Algorithm; Discrete mathematics; Geometry; Computer science; Physics; Data mining","score_opus":0.03807973057664759,"score_gpt":0.2652294900331958,"score_spread":0.2271497594565482,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1590814900","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003842313,0.00009476521,0.96926254,0.01645502,0.00046719186,0.000623136,0.00008798276,0.0001264514,0.0090405885],"genre_scores_gemma":[0.73076516,0.000002290426,0.26590323,0.0019606173,0.00033731418,0.00008251665,0.00012564544,0.00001681116,0.0008063977],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977068,0.00006265669,0.0003562386,0.0006906156,0.0006185839,0.0005651243],"domain_scores_gemma":[0.997968,0.00027219133,0.00012460878,0.0003230075,0.0007174166,0.0005947682],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00048198446,0.00026914242,0.00022203785,0.0008493132,0.0004374992,0.00034543354,0.00066358305,0.00012580039,0.00021440422],"category_scores_gemma":[0.000113036556,0.00029205895,0.00011819452,0.0011862464,0.000055020708,0.00028066346,0.000063875785,0.00019356763,0.00040946604],"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.000005798351,0.00004915152,0.000018155195,0.000006996223,0.000018156754,0.0000030575293,0.00009280075,0.563543,0.000023610644,0.32476163,0.008083617,0.10339402],"study_design_scores_gemma":[0.0005823794,0.00013474272,0.0011032243,0.000028581197,0.0000071293302,0.000020916592,0.000014397758,0.92340875,0.00016814494,0.018809594,0.05534977,0.00037236253],"about_ca_topic_score_codex":0.0006640994,"about_ca_topic_score_gemma":0.0019316875,"teacher_disagreement_score":0.72692287,"about_ca_system_score_codex":0.00042888193,"about_ca_system_score_gemma":0.0016081322,"threshold_uncertainty_score":0.99995315},"labels":[],"label_agreement":null},{"id":"W159810765","doi":"","title":"Approximating Radio Maps.","year":2005,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","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":"Computer science; Terrain; Algorithm; WiMAX; Approximation algorithm; Antenna (radio); Radar; Scale (ratio); Wireless; Point (geometry); Real-time computing; Mathematics; Telecommunications; Geography","score_opus":0.02632379849969603,"score_gpt":0.2428773898434252,"score_spread":0.21655359134372915,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W159810765","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014644614,0.00014651561,0.93598473,0.012792255,0.0006054379,0.00028643577,0.000048301674,0.000227725,0.035263974],"genre_scores_gemma":[0.8436591,0.000003889569,0.15176652,0.0033152814,0.00033087813,0.000020078549,0.0001429289,0.000012356684,0.0007489497],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979504,0.000072956165,0.00039407567,0.0005612675,0.0005374911,0.00048381294],"domain_scores_gemma":[0.99841094,0.00020835247,0.00012449865,0.00034016345,0.0003590315,0.0005570136],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00038117956,0.00023080189,0.00020175065,0.0010114092,0.00038129085,0.00040960652,0.0007434255,0.00009847369,0.00027312807],"category_scores_gemma":[0.00011862948,0.0002563751,0.0000817192,0.0012074163,0.000048767943,0.000588898,0.00006642255,0.0002445535,0.0008638952],"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.0000024977965,0.00003450815,0.00009463611,0.000006739609,0.000018061886,0.000010794364,0.00014048575,0.1906071,0.000023856688,0.64644045,0.005960237,0.15666065],"study_design_scores_gemma":[0.00043453329,0.000080563725,0.0037005774,0.000029998842,0.0000045022493,0.00005807443,0.000026278136,0.9145275,0.00015184912,0.039829593,0.040724795,0.0004317685],"about_ca_topic_score_codex":0.0006020359,"about_ca_topic_score_gemma":0.0017398312,"teacher_disagreement_score":0.8290145,"about_ca_system_score_codex":0.00034086886,"about_ca_system_score_gemma":0.0012505283,"threshold_uncertainty_score":0.99998885},"labels":[],"label_agreement":null},{"id":"W163009970","doi":"","title":"The 2x2 simple packing problem","year":2011,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Simple (philosophy); Computer science; Packing problems; Algorithm","score_opus":0.053264506631380576,"score_gpt":0.24375607048789819,"score_spread":0.1904915638565176,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W163009970","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021222414,0.00012522479,0.87243164,0.0043806215,0.0009265028,0.00050062995,0.000031012147,0.00020904733,0.100172915],"genre_scores_gemma":[0.9677708,0.000008025806,0.029936021,0.001631959,0.000093418406,0.000029551244,0.00004192639,0.000011544403,0.00047671428],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982539,0.00008939572,0.000298767,0.000440324,0.0004389309,0.0004787037],"domain_scores_gemma":[0.9984608,0.00028088276,0.00011426527,0.00036767017,0.00036354794,0.00041282186],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004096598,0.0001926001,0.00012994665,0.00038107086,0.0008162187,0.00036983422,0.00090207224,0.000074351025,0.00032267655],"category_scores_gemma":[0.000090041234,0.00016488842,0.000069981805,0.0011285752,0.00008558941,0.0003410012,0.000103401595,0.00021125884,0.0005123111],"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.0000053219883,0.00002427413,0.0004784809,0.0000035290448,0.000023512841,0.000017162038,0.0003600978,0.011042244,0.0000075670387,0.87374586,0.006751861,0.10754009],"study_design_scores_gemma":[0.00039927848,0.00021478988,0.039022103,0.000025862935,0.000008208903,0.000049487648,0.000093251576,0.29403955,0.00015695453,0.60640085,0.05902251,0.00056714605],"about_ca_topic_score_codex":0.002891489,"about_ca_topic_score_gemma":0.0074735074,"teacher_disagreement_score":0.9465484,"about_ca_system_score_codex":0.00016826665,"about_ca_system_score_gemma":0.0009941706,"threshold_uncertainty_score":0.67239547},"labels":[],"label_agreement":null},{"id":"W165396895","doi":"","title":"K-Nearest Neighbor Search using the Pyramid Technique.","year":2006,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Data Management and Algorithms","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 New Brunswick","funders":"","keywords":"Pyramid (geometry); k-nearest neighbors algorithm; RADIUS; Best bin first; Nearest neighbor graph; Nearest neighbor search; Nearest-neighbor chain algorithm; Range (aeronautics); Point (geometry); Range query (database); Mathematics; Computer science; Pattern recognition (psychology); Algorithm; Artificial intelligence; Combinatorics; Geometry; Search engine; Information retrieval; Cluster analysis; Web search query","score_opus":0.04234192041526704,"score_gpt":0.2690653430377264,"score_spread":0.22672342262245934,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W165396895","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0062221596,0.00003740421,0.9696585,0.004957411,0.0003216359,0.0003950076,0.00008280575,0.00011054002,0.018214533],"genre_scores_gemma":[0.9611409,0.0000017722259,0.036853142,0.0011258138,0.00016252759,0.000016390366,0.000101660866,0.0000116497295,0.00058615336],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984418,0.000060195027,0.00019442067,0.000395789,0.00046506582,0.00044268894],"domain_scores_gemma":[0.99899596,0.00011596141,0.00005317559,0.00044738263,0.00020159698,0.00018593199],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033212092,0.0001592955,0.00011641531,0.00055159244,0.0004152929,0.0007250426,0.0012746645,0.000055082855,0.00013458791],"category_scores_gemma":[0.000018094137,0.00013458553,0.00004681569,0.0011114473,0.00012305584,0.00038058648,0.00015790208,0.00022004214,0.0001441538],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001802048,0.000028309154,0.00054187764,0.000008387229,0.000014192519,0.00005894303,0.000025731044,0.029883472,0.000039586816,0.94543046,0.005021274,0.018945947],"study_design_scores_gemma":[0.00018959449,0.000059570702,0.012488278,0.000035220477,0.0000055541796,0.000021523674,0.000042739954,0.93502605,0.00011296905,0.039499678,0.012193127,0.00032566936],"about_ca_topic_score_codex":0.023866152,"about_ca_topic_score_gemma":0.00443914,"teacher_disagreement_score":0.95491874,"about_ca_system_score_codex":0.00017894975,"about_ca_system_score_gemma":0.00074056606,"threshold_uncertainty_score":0.982634},"labels":[],"label_agreement":null},{"id":"W170076","doi":"10.1289/ehp.7511129","title":"Farthest Neighbor Voronoi Diagram in the Presence of Rectangular Obstacles.","year":2005,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","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":"Voronoi diagram; Disjoint sets; Combinatorics; Geodesic; Mathematics; Plane (geometry); Computational geometry; Weighted Voronoi diagram; Metric (unit); Diagram; Power diagram; Set (abstract data type); Point (geometry); Representation (politics); Centroidal Voronoi tessellation; Algorithm; Computer science; Geometry","score_opus":0.024418599950654606,"score_gpt":0.24808481372084273,"score_spread":0.22366621377018814,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W170076","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37495732,0.00076954457,0.57641757,0.026466675,0.00079494686,0.0010170536,0.00010943195,0.00010089255,0.01936658],"genre_scores_gemma":[0.98547906,0.000013021323,0.0123672085,0.0018033993,0.00012667952,0.000021373895,0.000053985175,0.00000739376,0.00012790303],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980776,0.00017448736,0.00039532728,0.00041502275,0.0005732806,0.00036430807],"domain_scores_gemma":[0.99837023,0.0006118756,0.00013048762,0.0004008637,0.0002839965,0.00020251906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055769517,0.00018343868,0.00019280524,0.0007627146,0.00013675966,0.00017347286,0.0010483501,0.00008271057,0.0001053071],"category_scores_gemma":[0.00021042678,0.00016239051,0.00007144244,0.0016072185,0.0000872668,0.00039046578,0.00004871708,0.00023337427,0.00009885269],"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.00000696205,0.00010597311,0.0010005481,0.000011172496,0.000013951231,0.000018582281,0.0009129308,0.20493951,0.000039901293,0.597718,0.0014398387,0.19379264],"study_design_scores_gemma":[0.00058544317,0.00019390303,0.10782682,0.00006758952,0.00000663384,0.000033785742,0.0001613977,0.84577113,0.00025040185,0.028280105,0.016407449,0.00041532],"about_ca_topic_score_codex":0.0022804006,"about_ca_topic_score_gemma":0.013079178,"teacher_disagreement_score":0.64083165,"about_ca_system_score_codex":0.00015773626,"about_ca_system_score_gemma":0.0010156377,"threshold_uncertainty_score":0.7298488},"labels":[],"label_agreement":null},{"id":"W172707356","doi":"","title":"Realization of Degree 10 Minimum Spanning Trees in 3-Space.","year":2006,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Advanced Graph Theory Research","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":"McGill University","funders":"","keywords":"Realization (probability); Spanning tree; Minimum spanning tree; Degree (music); Minimum degree spanning tree; Computer science; Space (punctuation); Mathematics; Combinatorics; Physics; Statistics","score_opus":0.046233520706352484,"score_gpt":0.28765465180558203,"score_spread":0.24142113109922955,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W172707356","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09451278,0.00011069321,0.85992455,0.0014784829,0.00016284351,0.00029050634,0.000052375515,0.000064040934,0.043403737],"genre_scores_gemma":[0.9880242,0.0000024927074,0.011110923,0.000096319185,0.000030437519,0.000009858972,0.00006266586,0.000010255971,0.0006528655],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99835664,0.00012178222,0.0003084999,0.00038210797,0.00042897885,0.00040199736],"domain_scores_gemma":[0.998736,0.00030808873,0.000110111905,0.0002976575,0.0003512513,0.00019686142],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000369627,0.00014511142,0.00019302986,0.0016723608,0.00009041292,0.000082959334,0.0006283089,0.000079594975,0.0001391245],"category_scores_gemma":[0.0001339671,0.00016365378,0.00004321318,0.0018565005,0.00011752132,0.00028176102,0.000054833454,0.0001549426,0.000047848276],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000075999183,0.000029688024,0.0042516766,0.000007922528,0.0000047848257,0.000027390666,0.00006642284,0.09370883,0.00010726404,0.89029807,0.0005916489,0.010898713],"study_design_scores_gemma":[0.0006129004,0.0001456153,0.18710734,0.00010965091,0.0000020775285,0.000009026031,0.000071577306,0.34493607,0.0003033306,0.4655436,0.00083969434,0.00031912499],"about_ca_topic_score_codex":0.0094253635,"about_ca_topic_score_gemma":0.035554405,"teacher_disagreement_score":0.8935114,"about_ca_system_score_codex":0.00020238615,"about_ca_system_score_gemma":0.0009385856,"threshold_uncertainty_score":0.997171},"labels":[],"label_agreement":null},{"id":"W188453315","doi":"","title":"Collection depot location problem in the plane.","year":2005,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","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":"Simon Fraser University; Queen's University","funders":"","keywords":"Facility location problem; Computer science; Depot; Service (business); Operations research; Data collection; Set (abstract data type); Mathematical optimization; Computer network; Mathematics; Geography; Business; Statistics; Marketing","score_opus":0.03465438420203517,"score_gpt":0.2315149242619012,"score_spread":0.19686054005986603,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W188453315","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4190232,0.00013003853,0.013735644,0.12940516,0.001089669,0.002214746,0.000026037627,0.00021957625,0.43415594],"genre_scores_gemma":[0.9889904,0.00000268949,0.00031692264,0.009709317,0.000252644,0.000049335296,0.00020678526,0.0000067813276,0.00046507397],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99899894,0.00001764808,0.00023237514,0.00022478306,0.00029354356,0.00023269282],"domain_scores_gemma":[0.99955654,0.000030433508,0.000044240438,0.00013418034,0.00020876767,0.000025828578],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00035285705,0.00011673391,0.00008318738,0.00079195155,0.00021888078,0.00021937687,0.00023833536,0.000045536737,0.0007740309],"category_scores_gemma":[0.000057807905,0.000105994295,0.000023844254,0.0013710251,0.000029782726,0.00035380092,0.000014913959,0.00013024798,0.0012882388],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019819974,0.00012344295,0.0057476885,0.00008554666,0.000016187838,0.0000064789106,0.00022688917,0.4709633,0.0000019869822,0.438733,0.045560885,0.038514778],"study_design_scores_gemma":[0.00060000626,0.000022717488,0.2024709,0.000056909725,0.000014816119,0.0000035550725,0.0008906453,0.5699052,0.0000023308849,0.012279109,0.21337979,0.00037398713],"about_ca_topic_score_codex":0.04862312,"about_ca_topic_score_gemma":0.3284536,"teacher_disagreement_score":0.56996727,"about_ca_system_score_codex":0.00017500787,"about_ca_system_score_gemma":0.00020425522,"threshold_uncertainty_score":0.99948937},"labels":[],"label_agreement":null},{"id":"W2096716375","doi":"","title":"On exact solution of a point-location problem in a system of d-dimensional hyperbolic surfaces.","year":2003,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","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 Calgary","funders":"","keywords":"Voronoi diagram; Point (geometry); SPHERES; Set (abstract data type); Mathematics; Computer science; Algorithm; Mathematical optimization; Geometry; Physics","score_opus":0.019854562947411242,"score_gpt":0.22959724654543012,"score_spread":0.20974268359801887,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096716375","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6874675,0.00019271356,0.2986423,0.00095561956,0.0005942264,0.0007552068,0.00006742719,0.00006817956,0.0112568075],"genre_scores_gemma":[0.97885615,0.0000018641624,0.020782314,0.00019262175,0.000016057365,0.000018362734,0.00006384108,0.000009638692,0.00005913299],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978254,0.00020916693,0.00058841414,0.00045262472,0.0006098266,0.00031459975],"domain_scores_gemma":[0.9981088,0.0003914416,0.0002716974,0.0002777166,0.000725774,0.00022453899],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006694176,0.00019960488,0.00030428026,0.0015702461,0.00009918612,0.00004581746,0.00033932447,0.00011179812,0.000048537164],"category_scores_gemma":[0.00019382723,0.00021757322,0.000066362314,0.0020842438,0.00006271767,0.00025770685,0.000024947887,0.0001707898,0.000039782437],"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.000010871815,0.000078341815,0.00027874016,0.00005115167,0.000011937737,0.000004372794,0.00009036495,0.44129178,0.00020376313,0.55572265,0.00013975831,0.0021162399],"study_design_scores_gemma":[0.0012346995,0.00044600866,0.031330135,0.0004984958,0.000009000098,0.00004305596,0.00008743052,0.9239099,0.0016609144,0.04019956,0.00016799121,0.00041282392],"about_ca_topic_score_codex":0.0026232332,"about_ca_topic_score_gemma":0.0016763249,"teacher_disagreement_score":0.51552314,"about_ca_system_score_codex":0.00037937178,"about_ca_system_score_gemma":0.0021492143,"threshold_uncertainty_score":0.88723785},"labels":[],"label_agreement":null},{"id":"W2102775149","doi":"","title":"Zipper Unfoldings of Polyhedral Complexes","year":2010,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Advanced Materials and Mechanics","field":"Engineering","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 Waterloo","funders":"","keywords":"Zipper; Polyhedron; Tetrahedron; Enhanced Data Rates for GSM Evolution; Combinatorics; Planar; Regular polygon; Hamiltonian (control theory); Mathematics; Topology (electrical circuits); Crystallography; Computer science; Geometry; Algorithm; Chemistry; Computer graphics (images); Artificial intelligence","score_opus":0.012545625704137281,"score_gpt":0.22107809702892994,"score_spread":0.20853247132479266,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102775149","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98311454,0.000019434057,0.009029201,0.00015635596,0.0009892407,0.00008655109,0.00021211054,0.00007232039,0.006320218],"genre_scores_gemma":[0.99472904,0.000003876894,0.004919945,0.0001499166,0.000067305,0.000003586097,0.00005340364,0.000017064513,0.00005585915],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993993,0.0000042011216,0.00015594954,0.000110951274,0.00011836162,0.00021126149],"domain_scores_gemma":[0.9995153,0.000039498496,0.00002639546,0.00010430294,0.000098324796,0.00021621032],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000049332357,0.000107845786,0.00014050896,0.00024471397,0.000044808334,0.000025703926,0.00013176103,0.000069492344,0.0008144551],"category_scores_gemma":[0.00002319989,0.00011760074,0.000028555734,0.00015970322,0.00003861993,0.00006396323,0.000008748375,0.00013719937,0.000053126925],"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.000007706678,0.000014970596,0.00026808368,0.00006256918,0.00003140423,0.000009416817,0.00009206923,0.06002835,0.10476163,0.8236935,0.0012918015,0.009738455],"study_design_scores_gemma":[0.0021658828,0.00037916045,0.04169131,0.0002597711,0.000050482708,0.000103511724,0.00047219818,0.5327818,0.11405705,0.25192404,0.05382451,0.0022902903],"about_ca_topic_score_codex":0.001184395,"about_ca_topic_score_gemma":0.005039158,"teacher_disagreement_score":0.57176954,"about_ca_system_score_codex":0.000034941142,"about_ca_system_score_gemma":0.00017715628,"threshold_uncertainty_score":0.8917712},"labels":[],"label_agreement":null},{"id":"W2107966077","doi":"","title":"Efficient Snap Rounding with Integer Arithmetic.","year":2007,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","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":"Simon Fraser University","funders":"","keywords":"Rounding; Combinatorics; Partition (number theory); Logarithm; Intersection (aeronautics); Integer (computer science); Mathematics; Time complexity; Line segment; Discrete mathematics; Computer science; Algorithm; Geometry","score_opus":0.022500775482839738,"score_gpt":0.2500785208696665,"score_spread":0.22757774538682674,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107966077","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.084619865,0.000038920505,0.9003203,0.0017124618,0.0005224074,0.00020562559,0.000012436649,0.00010064496,0.012467362],"genre_scores_gemma":[0.9326467,8.7936286e-7,0.065099925,0.0016610333,0.00014715311,0.0000088370825,0.00006265989,0.000014041346,0.00035877558],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976703,0.000048924216,0.00034194576,0.0006064794,0.00072147796,0.00061087403],"domain_scores_gemma":[0.9978908,0.00039429485,0.00011837619,0.00032134587,0.0006032183,0.00067201006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000730049,0.00025590803,0.00020202623,0.0015481401,0.0003873415,0.00037808152,0.0005918032,0.00009723725,0.00012567684],"category_scores_gemma":[0.00009200753,0.00024371524,0.0000606806,0.0019612168,0.000085125306,0.00017777366,0.000057186295,0.00028508814,0.00023661424],"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.000013816678,0.00004689575,0.0002741686,0.000006554197,0.000024996738,0.000074362964,0.00014010681,0.49518555,0.000027477525,0.4793583,0.00036521896,0.024482565],"study_design_scores_gemma":[0.0007289964,0.00032586494,0.022356523,0.00008595707,0.000010834229,0.00015500862,0.00012603494,0.95505947,0.00025692824,0.014786678,0.0054533696,0.00065435],"about_ca_topic_score_codex":0.0011428493,"about_ca_topic_score_gemma":0.0041562947,"teacher_disagreement_score":0.8480268,"about_ca_system_score_codex":0.00043065747,"about_ca_system_score_gemma":0.0013358251,"threshold_uncertainty_score":0.99384195},"labels":[],"label_agreement":null},{"id":"W2111009215","doi":"","title":"On a geometric approach to the segment sum problem and its generalization","year":2007,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Generalization; Combinatorics; Monotone polygon; Mathematics; Optimization problem; Sequence (biology); Subset sum problem; Discrete mathematics; Mathematical optimization; Computer science; Algorithm; Knapsack problem; Geometry","score_opus":0.030181404593928495,"score_gpt":0.24807000493480882,"score_spread":0.21788860034088034,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111009215","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032170955,0.00013105752,0.9467984,0.004585896,0.00038454967,0.0006719677,0.000031165906,0.00007103353,0.01515502],"genre_scores_gemma":[0.96532494,0.00000766533,0.027220543,0.006546549,0.00016943699,0.00003989527,0.00012347572,0.000014007831,0.0005534875],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99766195,0.000082525876,0.0003493651,0.00066620845,0.00072376395,0.0005161616],"domain_scores_gemma":[0.9981226,0.00036086846,0.00010302647,0.0002894714,0.00048147564,0.00064261287],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009501706,0.00024948653,0.0001750707,0.0019908934,0.00051809143,0.00039544498,0.0006097404,0.00009499798,0.000032525895],"category_scores_gemma":[0.00015864904,0.00021502875,0.000048221216,0.003459328,0.000028432469,0.00023092664,0.00009440759,0.0002143015,0.00017316724],"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.00000826046,0.00005285813,0.000051315623,0.000009463863,0.000016495476,0.000004751047,0.00017527246,0.28282318,0.000016284861,0.6841391,0.002826386,0.029876662],"study_design_scores_gemma":[0.00074259675,0.00051508885,0.029611703,0.0000551041,0.000013605461,0.00007097418,0.000081019105,0.9237497,0.00030538288,0.027390087,0.016708208,0.0007565489],"about_ca_topic_score_codex":0.0005180898,"about_ca_topic_score_gemma":0.0011565639,"teacher_disagreement_score":0.933154,"about_ca_system_score_codex":0.00022519949,"about_ca_system_score_gemma":0.00059177674,"threshold_uncertainty_score":0.8768618},"labels":[],"label_agreement":null},{"id":"W2112429204","doi":"","title":"Optimistic Shortest Paths on Uncertain Terrains","year":2004,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Robotic Path Planning Algorithms","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 British Columbia","funders":"","keywords":"K shortest path routing; Shortest path problem; Euclidean shortest path; Yen's algorithm; Shortest Path Faster Algorithm; Constrained Shortest Path First; Terrain; Computer science; Geodesic; Longest path problem; Path (computing); Widest path problem; Pathfinding; Mathematical optimization; Algorithm; Mathematics; Dijkstra's algorithm; Theoretical computer science; Geography; Graph; Geometry","score_opus":0.04657298695031612,"score_gpt":0.2724671985039716,"score_spread":0.2258942115536555,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2112429204","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011590504,0.000026206593,0.95835793,0.0071164723,0.0009881295,0.0002958878,0.00011857795,0.00024242881,0.021263847],"genre_scores_gemma":[0.8854265,0.0000014358058,0.110649295,0.0035046956,0.00009976081,0.00001659365,0.00008880042,0.000016294789,0.00019659042],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977904,0.000056438308,0.0002855296,0.00067109574,0.00057764293,0.00061889464],"domain_scores_gemma":[0.9981358,0.00028285707,0.000089003945,0.00049724325,0.00022435423,0.00077073026],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002403203,0.00028059148,0.00023158615,0.00079759135,0.0002962969,0.00029994224,0.001018949,0.00013163387,0.00007576467],"category_scores_gemma":[0.00023453445,0.0002962633,0.00006690395,0.0008690935,0.00010291659,0.00017924797,0.000051989922,0.0003855715,0.0007048017],"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.0000021258336,0.000045275152,0.0001496182,0.000004044925,0.000015175703,0.00031738754,0.00020177843,0.7546544,0.0000034359107,0.23224787,0.00056268455,0.0117962025],"study_design_scores_gemma":[0.0009626428,0.000797057,0.026065351,0.0002784869,0.000009155705,0.00013964983,0.00009544959,0.90519476,0.000028368877,0.06463924,0.0009185842,0.00087128376],"about_ca_topic_score_codex":0.0045022387,"about_ca_topic_score_gemma":0.00096742355,"teacher_disagreement_score":0.87383604,"about_ca_system_score_codex":0.0006699042,"about_ca_system_score_gemma":0.002581824,"threshold_uncertainty_score":0.999949},"labels":[],"label_agreement":null},{"id":"W2113703646","doi":"","title":"On the nonexistence of dimension reduction for $\\ell2_2$ metrics.","year":2008,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Complexity and Algorithms in Graphs","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 Toronto","funders":"","keywords":"Mathematics; Dimension (graph theory); Metric (unit); Dimensionality reduction; Combinatorics; Dimension function; Metric dimension; Reduction (mathematics); Embedding; Lemma (botany); Discrete mathematics; Effective dimension; Metric space; Euclidean distance; Hausdorff dimension; Computer science; Graph","score_opus":0.08041085738545625,"score_gpt":0.2616961247978016,"score_spread":0.18128526741234532,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113703646","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1997704,0.00012200859,0.7744947,0.010838059,0.0018039083,0.0009789045,0.00017015872,0.00010825893,0.011713605],"genre_scores_gemma":[0.97637016,0.000009736022,0.022593334,0.0007564962,0.00004964544,0.000021056721,0.000019896861,0.000007103459,0.0001726046],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99859506,0.000055018532,0.00025736578,0.0003769272,0.0004346321,0.00028098928],"domain_scores_gemma":[0.9980268,0.0008193627,0.00013327923,0.00038900055,0.00043329207,0.00019828069],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030308097,0.00014787528,0.00017587119,0.0007699401,0.00048817418,0.000056494635,0.0007477568,0.0000630834,0.00006424941],"category_scores_gemma":[0.0002367766,0.00012443213,0.00010065398,0.0014013938,0.0001969704,0.00012270054,0.000047296333,0.00017213976,0.00004024894],"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.000009130471,0.000042086205,0.000036136455,0.0000072774246,0.000015591926,0.000005396916,0.00016406689,0.006134881,0.000030849373,0.9826964,0.0030751633,0.0077830036],"study_design_scores_gemma":[0.00056351494,0.00069272023,0.0069783274,0.00009956221,0.000008754639,0.00009313202,0.00011164916,0.57930535,0.0010290163,0.40866247,0.0020228424,0.0004326887],"about_ca_topic_score_codex":0.0014486142,"about_ca_topic_score_gemma":0.00022766033,"teacher_disagreement_score":0.7765997,"about_ca_system_score_codex":0.00010924402,"about_ca_system_score_gemma":0.0007046491,"threshold_uncertainty_score":0.5074195},"labels":[],"label_agreement":null},{"id":"W2119288811","doi":"","title":"The Gaussian Centre of a Set of Mobile Points","year":2003,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","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 British Columbia","funders":"","keywords":"Facility location problem; Position (finance); Bounded function; Euclidean geometry; Set (abstract data type); Computer science; Motion (physics); Function (biology); Gaussian; Mathematical optimization; Mathematics; Mathematical analysis; Geometry; Physics; Artificial intelligence","score_opus":0.020640345941570753,"score_gpt":0.2478583186047206,"score_spread":0.22721797266314986,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2119288811","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29895145,0.00089426,0.6392156,0.008360851,0.0022533874,0.0012872216,0.00034199844,0.00010382983,0.048591394],"genre_scores_gemma":[0.98952097,0.000010716667,0.009826106,0.000249532,0.000027139273,0.000009041025,0.00003482627,0.0000063642383,0.0003152904],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984448,0.00014529379,0.00039383688,0.0002843043,0.0004461848,0.0002855779],"domain_scores_gemma":[0.99819064,0.00047643727,0.00020141847,0.00032305528,0.0005560413,0.00025240897],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046051605,0.00014086008,0.00018318853,0.0004495346,0.00021578933,0.000081506696,0.000536982,0.00006154785,0.00012785246],"category_scores_gemma":[0.00020335834,0.00012159835,0.00007888855,0.0011153088,0.000106327265,0.00014462542,0.0000315239,0.00011999079,0.00004001723],"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.0000043933164,0.000026323667,0.00039322278,0.000012613158,0.000027777427,0.0000036917768,0.00022717405,0.03636972,0.00004134596,0.94116926,0.001096662,0.020627802],"study_design_scores_gemma":[0.0022451517,0.0009005574,0.03154525,0.00025045508,0.000035599944,0.00009280329,0.0012456101,0.430076,0.007912974,0.4187211,0.10576747,0.0012070093],"about_ca_topic_score_codex":0.00057656295,"about_ca_topic_score_gemma":0.00172359,"teacher_disagreement_score":0.6905695,"about_ca_system_score_codex":0.000081709986,"about_ca_system_score_gemma":0.0015737327,"threshold_uncertainty_score":0.49586368},"labels":[],"label_agreement":null},{"id":"W2123411109","doi":"","title":"Flipping your lid","year":2001,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","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":"Université du Québec; Carleton University","funders":"","keywords":"Combinatorics; Convex polygon; Regular polygon; Polygon (computer graphics); Midpoint; Sequence (biology); Mathematics; Star-shaped polygon; Polygon covering; Computer science; Convex set; Geometry; Convex optimization; Chemistry; Telecommunications","score_opus":0.05257903836359342,"score_gpt":0.2725959820000142,"score_spread":0.2200169436364208,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123411109","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05987838,0.00012411195,0.88836455,0.00903123,0.0011048174,0.00024719565,0.000024794293,0.00021474827,0.041010167],"genre_scores_gemma":[0.97301656,0.00001579616,0.021117827,0.00401552,0.00026192816,0.000016758453,0.00010897043,0.0000129398595,0.0014337056],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99800986,0.000068582376,0.00031313358,0.000573574,0.0005302487,0.00050457654],"domain_scores_gemma":[0.9983116,0.00017337417,0.000095563104,0.0003499309,0.00045981436,0.0006097439],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00027482572,0.0002283165,0.00018905236,0.0011836834,0.0004047387,0.00042072457,0.00074619986,0.00010230696,0.00043746352],"category_scores_gemma":[0.000112942966,0.0002559578,0.00008400615,0.0017488815,0.00004519584,0.00049465516,0.00007041647,0.00022960744,0.00083028484],"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.000007691465,0.000053467273,0.00079047476,0.000007410442,0.000033446395,0.00011783661,0.00019132569,0.17944227,0.000053872347,0.6909651,0.004236508,0.12410056],"study_design_scores_gemma":[0.0006414246,0.00018747909,0.03248713,0.000057135454,0.000007620786,0.00021736568,0.00006319782,0.8069023,0.00008170695,0.08310499,0.07553272,0.00071693433],"about_ca_topic_score_codex":0.0014337914,"about_ca_topic_score_gemma":0.0020360283,"teacher_disagreement_score":0.91313815,"about_ca_system_score_codex":0.00025001372,"about_ca_system_score_gemma":0.0013424894,"threshold_uncertainty_score":0.9999893},"labels":[],"label_agreement":null},{"id":"W2123788968","doi":"","title":"Computing the Straight Skeleton of a Monotone Polygon in O(nlogn) Time","year":2010,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":15,"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":"Monotone polygon; Simple polygon; Polygon (computer graphics); Combinatorics; Polygon covering; Skeleton (computer programming); Computational geometry; Simple (philosophy); Rectilinear polygon; Time complexity; Mathematics; Computer science; Algorithm; Geometry","score_opus":0.011715641864569531,"score_gpt":0.23644737920830203,"score_spread":0.2247317373437325,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123788968","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6586443,0.00004464078,0.32321915,0.0067014913,0.0013145291,0.00047783705,0.000051859497,0.000070286704,0.009475894],"genre_scores_gemma":[0.97517,0.0000011748544,0.023505077,0.00084550015,0.00017665901,0.000007701116,0.00006285392,0.00000975732,0.00022124857],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981499,0.000099629935,0.00044226408,0.00044748982,0.00046604953,0.00039469486],"domain_scores_gemma":[0.99835855,0.00048759277,0.00016954257,0.0003790183,0.00034260334,0.00026268588],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005895751,0.00020197274,0.0002332093,0.000989935,0.00020626963,0.00015912051,0.0009081899,0.00011944842,0.00026204603],"category_scores_gemma":[0.0001454658,0.00018204996,0.00007506486,0.0016078927,0.000117763884,0.00023852575,0.00008419851,0.0004671751,0.00012472148],"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.000010687481,0.00009936976,0.00071650854,0.000014616098,0.000026503814,0.00002185698,0.00042534227,0.25392455,0.0016043107,0.6727569,0.0011243974,0.06927494],"study_design_scores_gemma":[0.0003695483,0.00008873798,0.0476775,0.000030759402,0.0000034075388,0.000026318949,0.000019096045,0.9275584,0.00038247093,0.02215887,0.00144699,0.00023788546],"about_ca_topic_score_codex":0.0025212858,"about_ca_topic_score_gemma":0.0072327163,"teacher_disagreement_score":0.6736339,"about_ca_system_score_codex":0.00008836465,"about_ca_system_score_gemma":0.0013680403,"threshold_uncertainty_score":0.7423782},"labels":[],"label_agreement":null},{"id":"W2124089227","doi":"","title":"An Algorithm for the MaxMin Area Triangulation of a Convex Polygon","year":2003,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","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 Saskatchewan","funders":"","keywords":"Minimum-weight triangulation; Polygon (computer graphics); Convex polygon; Triangulation; Point set triangulation; Mathematics; Pitteway triangulation; Star-shaped polygon; Polygon covering; Combinatorics; Regular polygon; Diagonal; Rectilinear polygon; Algorithm; Computer science; Delaunay triangulation; Simple polygon; Convex optimization; Convex set; Bowyer–Watson algorithm; Geometry","score_opus":0.0404761246826628,"score_gpt":0.27205617256618186,"score_spread":0.23158004788351907,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2124089227","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006880086,0.00011736659,0.9898056,0.0010768074,0.00055263535,0.00046983815,0.000101803824,0.000034562752,0.00096130103],"genre_scores_gemma":[0.9013334,0.000003934347,0.09735283,0.00083442597,0.00007874179,0.000047760255,0.00015022737,0.0000101919395,0.00018849604],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99844176,0.00011575376,0.000348642,0.00040067453,0.00039126092,0.00030188533],"domain_scores_gemma":[0.99783605,0.0007032011,0.00016607555,0.00035953344,0.0006536739,0.00028146605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005936774,0.00017611762,0.00020194637,0.00061214814,0.00031937798,0.000179039,0.00053576037,0.00009006261,0.00012778767],"category_scores_gemma":[0.00017023271,0.00015695453,0.000091668015,0.0009803033,0.00006879411,0.0003114344,0.000013650359,0.000113708025,0.0000166037],"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.00000766123,0.000059214562,0.0000828111,0.0000075583716,0.000036805875,0.0000022777458,0.00016014739,0.10689141,0.00009384393,0.64739287,0.00068505516,0.24458036],"study_design_scores_gemma":[0.00059149927,0.00022672476,0.004506867,0.00001370184,0.00001156353,0.0000143297575,0.00007591993,0.9496232,0.0006027039,0.03983604,0.0042892573,0.00020817749],"about_ca_topic_score_codex":0.00070524466,"about_ca_topic_score_gemma":0.0008431614,"teacher_disagreement_score":0.8944533,"about_ca_system_score_codex":0.00011436918,"about_ca_system_score_gemma":0.0014576237,"threshold_uncertainty_score":0.640042},"labels":[],"label_agreement":null},{"id":"W2125573420","doi":"","title":"On computing shortest external watchman routes for convex polygons","year":2006,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","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":"McGill University","funders":"","keywords":"Regular polygon; Computer science; Mathematics; Geometry","score_opus":0.02155396410099874,"score_gpt":0.25277989988577937,"score_spread":0.23122593578478062,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2125573420","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07275045,0.00006825514,0.91620153,0.003478936,0.00091548666,0.00045051056,0.00013306197,0.0001524002,0.0058493796],"genre_scores_gemma":[0.9530348,0.0000012064804,0.042538766,0.0028154212,0.00046946757,0.000029383187,0.00037916435,0.000022274788,0.00070949853],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974416,0.000070588074,0.0004796998,0.00077685335,0.0005772406,0.0006540083],"domain_scores_gemma":[0.99755144,0.00093197584,0.00016783278,0.00034871374,0.00055917824,0.00044083747],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00035302868,0.00033595305,0.0002961833,0.001046043,0.0006199897,0.0005586678,0.0007577485,0.00012872726,0.0001029538],"category_scores_gemma":[0.00011554814,0.0003675369,0.00014696096,0.0009019921,0.000076759476,0.00030126615,0.000059991224,0.00024081627,0.00017077324],"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.000010156618,0.00006912819,0.00035557093,0.0000079659285,0.000015989795,0.00001446416,0.000038731847,0.2500888,0.00006484371,0.7285526,0.0049693813,0.015812399],"study_design_scores_gemma":[0.0007126758,0.0003077857,0.024940914,0.00007368933,0.00000903261,0.000030700652,0.000017578901,0.7858545,0.00026388175,0.18417922,0.003097672,0.0005123344],"about_ca_topic_score_codex":0.0030240198,"about_ca_topic_score_gemma":0.0030678741,"teacher_disagreement_score":0.88028437,"about_ca_system_score_codex":0.00030397132,"about_ca_system_score_gemma":0.0011245816,"threshold_uncertainty_score":0.99987763},"labels":[],"label_agreement":null},{"id":"W2127519911","doi":"","title":"Tiling Layouts with Dominoes","year":2004,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","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":"University of Saskatchewan","funders":"","keywords":"Colored; Domino; Tile; Mathematics; Hexagonal tiling; Set (abstract data type); Combinatorics; Square tiling; Tessellation (computer graphics); Plane (geometry); Unit square; Discrete mathematics; Computer science; Grid; Geometry","score_opus":0.019659232827445576,"score_gpt":0.2392991311069203,"score_spread":0.21963989827947472,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2127519911","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9831044,0.00005006774,0.0076896716,0.00067682,0.00008016394,0.000090532194,0.000027747732,0.000014426886,0.008266183],"genre_scores_gemma":[0.994985,0.000003141505,0.0029514888,0.0015664498,0.00013288774,0.000003855639,0.00020297035,0.00000870819,0.00014549674],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.9992119,0.000016512922,0.000107470194,0.00029178985,0.00011554854,0.00025675356],"domain_scores_gemma":[0.99946964,0.000016829961,0.000037171492,0.00011207541,0.00013114295,0.00023316492],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000732899,0.00012511208,0.00009569076,0.00010825524,0.00012670089,0.00004817571,0.00015131546,0.00009107526,0.0000481214],"category_scores_gemma":[0.00004175523,0.000100246456,0.00003413681,0.00015278319,0.00007406123,0.0000026972923,0.000022616176,0.00009482122,0.00004920363],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005817493,0.00036649988,0.044878002,0.00007730838,0.00043928126,0.0003913608,0.0002621765,0.63096607,0.03537726,0.20179796,0.0021068938,0.08275543],"study_design_scores_gemma":[0.020921182,0.016527014,0.6115958,0.0012704214,0.00017408484,0.0010103561,0.0021085916,0.01928105,0.08428956,0.1055562,0.12862922,0.008636477],"about_ca_topic_score_codex":0.0011038582,"about_ca_topic_score_gemma":0.0046320343,"teacher_disagreement_score":0.61168504,"about_ca_system_score_codex":0.00004281474,"about_ca_system_score_gemma":0.00059435284,"threshold_uncertainty_score":0.40879318},"labels":[],"label_agreement":null},{"id":"W2136013120","doi":"","title":"I/O-efficient triangular range search and its application.","year":2010,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Combinatorics; Range (aeronautics); Range query (database); Binary logarithm; Data structure; Set (abstract data type); Mathematics; Computational geometry; Point (geometry); Discrete mathematics; Computer science; Algorithm; Search engine; Geometry; Web search query; Sargable; Information retrieval","score_opus":0.024349150862565387,"score_gpt":0.25993228784615396,"score_spread":0.23558313698358857,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136013120","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5343537,0.00013650296,0.4551019,0.005908967,0.00065854687,0.00053727033,0.000059943228,0.000117006886,0.0031261675],"genre_scores_gemma":[0.9859684,0.000003851479,0.0123986,0.0010979204,0.00020335194,0.00003716116,0.000065289045,0.000011082913,0.0002143184],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99821794,0.000061438535,0.00025441637,0.00058726646,0.000501378,0.00037757275],"domain_scores_gemma":[0.9982653,0.00021140522,0.000054899978,0.00030360944,0.00053588056,0.00062887487],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047203802,0.00019141565,0.00016767849,0.0009132479,0.00038396096,0.00026963215,0.00053241674,0.00012011449,0.00014845947],"category_scores_gemma":[0.000116206385,0.00020689402,0.000049529324,0.001093221,0.000060819613,0.00014352419,0.00007809948,0.0003581481,0.0003016212],"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.0000050448602,0.000041114174,0.00014267533,0.000010002231,0.0000139392105,0.000008727355,0.00012948836,0.10486467,0.0006303305,0.84890413,0.00024306413,0.045006827],"study_design_scores_gemma":[0.00042858702,0.00005365932,0.012619535,0.000008051327,0.000003945112,0.000027714828,0.000016336067,0.9756297,0.00026640858,0.007960628,0.0027244044,0.00026105726],"about_ca_topic_score_codex":0.00082883856,"about_ca_topic_score_gemma":0.0019996017,"teacher_disagreement_score":0.87076503,"about_ca_system_score_codex":0.00007755655,"about_ca_system_score_gemma":0.0010421913,"threshold_uncertainty_score":0.8436893},"labels":[],"label_agreement":null},{"id":"W2140740564","doi":"","title":"Multidimensional Orthogonal Range Search Using Tries.","year":2003,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Data Management and Algorithms","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 New Brunswick","funders":"","keywords":"Rectangle; Range (aeronautics); Competitive analysis; Set (abstract data type); Algorithm; Space (punctuation); Computer science; Range query (database); Online algorithm; Combinatorics; Search algorithm; Mathematics; Theoretical computer science; Search engine; Information retrieval; Upper and lower bounds; Web search query; Engineering; Geometry; Sargable","score_opus":0.06550581335891824,"score_gpt":0.28024586088074516,"score_spread":0.2147400475218269,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140740564","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09372063,0.00009580059,0.87931204,0.0019210662,0.0011521463,0.00041421546,0.0001694834,0.00013138243,0.02308323],"genre_scores_gemma":[0.8879965,0.0000040188706,0.10952823,0.0015911207,0.00007391609,0.0000037399943,0.000102458514,0.000013387353,0.0006866029],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99797624,0.00011031148,0.00023510115,0.00053088705,0.00061934313,0.0005281152],"domain_scores_gemma":[0.9986491,0.00015889147,0.00005481171,0.00033677256,0.00029033757,0.00051005394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044863144,0.00019882504,0.00017589364,0.0008228378,0.00034605202,0.00029808644,0.00059138687,0.00006844674,0.0006186973],"category_scores_gemma":[0.0000835088,0.00021096207,0.00006422359,0.0010228066,0.00008667968,0.00050255406,0.00008401575,0.00021876246,0.00037026938],"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.0000032094865,0.00003737699,0.0010420559,0.0000075662624,0.00002892255,0.00006829362,0.000051477975,0.015826544,0.00000876809,0.96942663,0.0015589127,0.011940258],"study_design_scores_gemma":[0.0010945622,0.000093961826,0.010447313,0.000049374034,0.000009835324,0.000032936692,0.000083983534,0.94847167,0.00007175733,0.016719162,0.022286762,0.0006386833],"about_ca_topic_score_codex":0.0017920934,"about_ca_topic_score_gemma":0.0007914428,"teacher_disagreement_score":0.95270747,"about_ca_system_score_codex":0.00019410216,"about_ca_system_score_gemma":0.0016901592,"threshold_uncertainty_score":0.86027837},"labels":[],"label_agreement":null},{"id":"W2140984273","doi":"","title":"Planar Case of the Maximum Box and Related Problems","year":2003,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Mathematical Approximation and Integration","field":"Mathematics","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Cardinality (data modeling); Planar; Combinatorics; Mathematics; Extension (predicate logic); Planar graph; Approximation algorithm; Discrete mathematics; Computer science; Graph","score_opus":0.04753680883092413,"score_gpt":0.27328650963995604,"score_spread":0.22574970080903192,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140984273","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7343409,0.000053667267,0.02583701,0.0038205558,0.00028212756,0.0011337269,0.00016009017,0.000061780906,0.23431017],"genre_scores_gemma":[0.9889485,0.0000010688541,0.010143544,0.00020551408,0.0000050562094,0.000009716137,0.000009042546,0.0000091919355,0.0006683264],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991684,0.00007736228,0.00029360218,0.0001484965,0.00016831298,0.00014381195],"domain_scores_gemma":[0.9991264,0.00027579846,0.00011990673,0.00014579917,0.00017428437,0.00015782025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025510602,0.00010658985,0.00014561054,0.00017164434,0.00012774003,0.000035001576,0.00008409158,0.00007785467,0.00078207365],"category_scores_gemma":[0.000488613,0.00007759854,0.00003873172,0.00031150214,0.00009534866,0.000050122624,0.0000061817736,0.00014653109,0.000020987894],"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":[7.933141e-7,0.000024676976,0.00007680035,0.00005804756,0.000014440178,0.000009431068,0.0002656563,0.000052263786,0.000006892083,0.99796784,0.00068664446,0.0008365195],"study_design_scores_gemma":[0.0002020897,0.000032468342,0.0002491316,0.000076977514,0.00001086656,0.00035783643,0.00029289408,0.010284816,0.00006353323,0.98785174,0.0004809649,0.000096707685],"about_ca_topic_score_codex":0.0007160645,"about_ca_topic_score_gemma":0.0033285706,"teacher_disagreement_score":0.25460765,"about_ca_system_score_codex":0.00005513278,"about_ca_system_score_gemma":0.00029747022,"threshold_uncertainty_score":0.85631585},"labels":[],"label_agreement":null},{"id":"W2141096989","doi":"","title":"Bounded-Curvature Path Normalization","year":2006,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","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":"University of British Columbia","funders":"","keywords":"Bounded function; Normalization (sociology); Curvature; Mathematics; Path (computing); Computer science; Mathematical analysis; Geometry","score_opus":0.012956058346223341,"score_gpt":0.2180384118051253,"score_spread":0.20508235345890194,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141096989","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025005406,0.0001224298,0.9345096,0.004137985,0.0009086764,0.00026946815,0.00006960259,0.00020045498,0.034776375],"genre_scores_gemma":[0.9668527,0.0000038118558,0.028645413,0.002322484,0.000300948,0.000019216808,0.00066412287,0.0000139096355,0.0011773856],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99799144,0.0000764457,0.00034433982,0.00054739666,0.00059308525,0.00044727558],"domain_scores_gemma":[0.9985313,0.00013795788,0.00012996644,0.00031294275,0.0005617643,0.00032608362],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00024645755,0.00024034065,0.00017608576,0.00092610205,0.0004415869,0.00055685395,0.00057339884,0.0001365606,0.0001962646],"category_scores_gemma":[0.00005364798,0.00026434506,0.00007494643,0.0015957438,0.000051191204,0.00058825425,0.000051062372,0.0002131482,0.000329548],"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.00000280946,0.00004061392,0.00042024668,0.0000068870822,0.000011310187,0.000021140315,0.000039447263,0.11869648,0.000027178507,0.86388063,0.008944138,0.007909096],"study_design_scores_gemma":[0.0005667185,0.00013242924,0.050768103,0.000039831153,0.000009168016,0.000053486358,0.000017674953,0.64844424,0.00013629539,0.25788528,0.0413304,0.0006163693],"about_ca_topic_score_codex":0.0039796922,"about_ca_topic_score_gemma":0.0057394374,"teacher_disagreement_score":0.9418473,"about_ca_system_score_codex":0.00028558352,"about_ca_system_score_gemma":0.0013718163,"threshold_uncertainty_score":0.99998087},"labels":[],"label_agreement":null},{"id":"W2141507454","doi":"","title":"Multi-guard covers for polygonal regions","year":2010,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Guard (computer science); Polygon (computer graphics); Boundary (topology); Simple polygon; Combinatorics; Cover (algebra); Regular polygon; Convex hull; Mathematics; Time complexity; Computer science; Geometry; Mathematical analysis; Engineering","score_opus":0.040816492942253306,"score_gpt":0.2785055720344605,"score_spread":0.2376890790922072,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141507454","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03887135,0.000019737123,0.94681084,0.008949122,0.0020736991,0.000468068,0.00021387415,0.00013492361,0.002458378],"genre_scores_gemma":[0.83193415,0.0000019059665,0.16381283,0.0028469365,0.00024013371,0.000054833305,0.00026663335,0.00001438547,0.0008282209],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99817383,0.000037268164,0.00029967033,0.0006061885,0.00039673704,0.0004863217],"domain_scores_gemma":[0.99780625,0.0004264451,0.0001118774,0.00036463706,0.0006510819,0.0006396817],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00030773788,0.00023248483,0.000191338,0.00094287726,0.00049891666,0.00034794357,0.00075179583,0.00015109101,0.00016191998],"category_scores_gemma":[0.00026246303,0.00026002605,0.0001289523,0.0008796998,0.00008915256,0.00037215662,0.00005045527,0.0003329096,0.000186281],"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.000010888937,0.00006939303,0.00014421932,0.000007944155,0.000032499604,0.000010081274,0.00008333612,0.03591024,0.0012171156,0.93750167,0.008409715,0.016602887],"study_design_scores_gemma":[0.0013230062,0.00019878987,0.01770095,0.000021929633,0.000011494711,0.000065891945,0.000035373523,0.8655634,0.00044856578,0.06922896,0.044757415,0.00064422045],"about_ca_topic_score_codex":0.0009854819,"about_ca_topic_score_gemma":0.009584568,"teacher_disagreement_score":0.8682727,"about_ca_system_score_codex":0.00012456776,"about_ca_system_score_gemma":0.0022399079,"threshold_uncertainty_score":0.9999852},"labels":[],"label_agreement":null},{"id":"W2145677964","doi":"","title":"A Genetic Algorithm for the Minimum Tetrahedralization of a Convex Polyhedron.","year":2003,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","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":"Memorial University of Newfoundland","funders":"","keywords":"Polyhedron; Regular polygon; Convex polytope; Tetrahedron; Partition (number theory); Combinatorics; Mathematics; Algorithm; Mathematical optimization; Computer science; Convex set; Convex optimization; Geometry","score_opus":0.025794518208532104,"score_gpt":0.24950504614207109,"score_spread":0.223710527933539,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145677964","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032453286,0.00028427204,0.99290866,0.0011846478,0.00063094974,0.00047428661,0.000075253985,0.000030796058,0.0011658262],"genre_scores_gemma":[0.8421531,0.000011884152,0.15624286,0.0010965628,0.000077820136,0.000057803918,0.000051061223,0.000011902209,0.00029703302],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99840707,0.00009021469,0.0003718752,0.000393015,0.00040259975,0.0003352121],"domain_scores_gemma":[0.9978896,0.0007261823,0.00015988782,0.00031198675,0.0006692489,0.00024313728],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033717786,0.00018384735,0.00019397693,0.0005874856,0.00030837473,0.00015200826,0.0005426913,0.00008560322,0.00011194905],"category_scores_gemma":[0.00020801992,0.00016494759,0.00009999934,0.0011430398,0.00008872232,0.0001705947,0.000022126918,0.00010406138,0.00002762435],"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.0000042121846,0.00005278459,0.0001815118,0.00001697108,0.000059622296,0.0000038124497,0.00016803882,0.114970334,0.000041503776,0.7207063,0.0018905936,0.16190434],"study_design_scores_gemma":[0.0005546192,0.00017363716,0.0067545213,0.000020750898,0.000014827127,0.000026901347,0.00005579989,0.942519,0.00029220432,0.040022213,0.0093288105,0.00023672075],"about_ca_topic_score_codex":0.00059354503,"about_ca_topic_score_gemma":0.00053312216,"teacher_disagreement_score":0.8389077,"about_ca_system_score_codex":0.00010902889,"about_ca_system_score_gemma":0.0017043283,"threshold_uncertainty_score":0.67263675},"labels":[],"label_agreement":null},{"id":"W2147664710","doi":"","title":"Application of computational geometry to network p-center location problems","year":2008,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","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":"Ackermann function; Center (category theory); Combinatorics; Measure (data warehouse); Function (biology); Mathematics; Computational geometry; Tree (set theory); Inverse; Binary logarithm; Geometry; Algorithm; Discrete mathematics; Computer science; Data mining; Crystallography","score_opus":0.0278149769113654,"score_gpt":0.2411485933884939,"score_spread":0.2133336164771285,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147664710","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04200441,0.000086117616,0.9519481,0.0024424002,0.000489463,0.00066648395,0.00008714267,0.00011306759,0.0021627916],"genre_scores_gemma":[0.9214062,0.0000073208025,0.07499099,0.0024163174,0.00022990964,0.000081545666,0.00065042457,0.000022134613,0.00019516237],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967913,0.00011475198,0.00072752114,0.00081317994,0.0009680473,0.000585203],"domain_scores_gemma":[0.9965782,0.0003302673,0.00029306934,0.0004852986,0.0016312917,0.0006818405],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00044524702,0.00033066727,0.0003633215,0.0015453844,0.0004931975,0.000118996904,0.0008842593,0.0001523529,0.00008388958],"category_scores_gemma":[0.00013293349,0.00038128765,0.00010845798,0.00422971,0.00011379204,0.00045503897,0.000118528376,0.0002474058,0.00042274946],"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.000010502227,0.00010063162,0.0026241732,0.000024148,0.000032006385,0.0000059201748,0.00018136876,0.8067718,0.000022738845,0.17158754,0.0037666145,0.014872559],"study_design_scores_gemma":[0.00077669433,0.00030433736,0.099998474,0.00009307703,0.000008872715,0.00010596673,0.00001952005,0.8427004,0.00005906496,0.04510209,0.010230828,0.0006006583],"about_ca_topic_score_codex":0.0013700455,"about_ca_topic_score_gemma":0.0010339536,"teacher_disagreement_score":0.8794018,"about_ca_system_score_codex":0.0003311849,"about_ca_system_score_gemma":0.0017826947,"threshold_uncertainty_score":0.9998639},"labels":[],"label_agreement":null},{"id":"W2148022401","doi":"","title":"When can a graph form an orthogonal polyhedron","year":2004,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","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 Waterloo","funders":"","keywords":"Polyhedron; Vertex (graph theory); Combinatorics; Mathematics; Regular polygon; Integer points in convex polyhedra; Convex polytope; Graph; Convex set; Algorithm; Geometry; Convex optimization; Linear programming","score_opus":0.02769961273247762,"score_gpt":0.24791843677306832,"score_spread":0.2202188240405907,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148022401","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1965676,0.00006324326,0.7842578,0.011525442,0.0008469725,0.0003614997,0.00014146301,0.00022655234,0.006009423],"genre_scores_gemma":[0.94769937,0.000003896831,0.046501003,0.0049406206,0.00019544207,0.000026672622,0.0004200264,0.000017977509,0.00019501317],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975035,0.00006582982,0.00037192402,0.0007422988,0.00070679496,0.00060965796],"domain_scores_gemma":[0.997836,0.000096156364,0.00012194741,0.0004440198,0.00049295154,0.0010089035],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00029504608,0.00030443445,0.00023100934,0.0014393266,0.00048351754,0.00046953792,0.0009090025,0.00013647952,0.00022412413],"category_scores_gemma":[0.000059591483,0.00033589467,0.0001049784,0.0012646262,0.0000844984,0.0007306299,0.00006685455,0.00028175118,0.00017415159],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000073423885,0.0000792566,0.00021316916,0.0000065176678,0.00002463793,0.000044335065,0.00040380566,0.1325382,0.00003401557,0.836016,0.0004273116,0.030205432],"study_design_scores_gemma":[0.001213973,0.00055337854,0.028838325,0.00005412619,0.000010775118,0.00013832522,0.00007921081,0.09085364,0.00018925098,0.87413245,0.0031465676,0.00078994915],"about_ca_topic_score_codex":0.006978568,"about_ca_topic_score_gemma":0.035903946,"teacher_disagreement_score":0.7511318,"about_ca_system_score_codex":0.0004594894,"about_ca_system_score_gemma":0.003656898,"threshold_uncertainty_score":0.9999093},"labels":[],"label_agreement":null},{"id":"W2149884111","doi":"","title":"Computing Nice Sweeps for Polyhedra and Polygons","year":2004,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","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":"Polyhedron; Monotone polygon; Combinatorics; Regular polygon; Polygon (computer graphics); Mathematics; Rectilinear polygon; Simple polygon; Convex polygon; Convex set; Polygon covering; Krein–Milman theorem; Convex polytope; Computer science; Geometry; Convex optimization","score_opus":0.02848420590755417,"score_gpt":0.2638921882300127,"score_spread":0.23540798232245852,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149884111","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05836974,0.00014440653,0.92965,0.00874744,0.00052218064,0.00035198347,0.00008242012,0.00011025488,0.0020215341],"genre_scores_gemma":[0.8975875,0.0000053054073,0.09885318,0.0031116295,0.0001693905,0.000015532203,0.0001319824,0.000013581505,0.00011194438],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982315,0.000037065598,0.00031028234,0.00060900796,0.00032941185,0.0004827648],"domain_scores_gemma":[0.9982468,0.00044457254,0.000107944215,0.00024333138,0.00039557525,0.0005617658],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00028376022,0.0002329645,0.00021305589,0.00083715376,0.0005611164,0.00050392735,0.00047441674,0.000104639716,0.000022340777],"category_scores_gemma":[0.0001735885,0.00026400297,0.00007329984,0.0008575887,0.00007523085,0.00044994042,0.00007588167,0.00017328392,0.000055633183],"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.0000061734668,0.00003061606,0.00008947203,0.000014445992,0.00002380174,0.000008179873,0.0001950317,0.116861336,0.0000517458,0.82960445,0.00036039753,0.052754335],"study_design_scores_gemma":[0.0026295255,0.0005565732,0.03587692,0.00013485528,0.00002193716,0.00014169178,0.00014553677,0.6357786,0.00039447888,0.3145851,0.008680854,0.0010539391],"about_ca_topic_score_codex":0.001705321,"about_ca_topic_score_gemma":0.0023359552,"teacher_disagreement_score":0.8392177,"about_ca_system_score_codex":0.00023491253,"about_ca_system_score_gemma":0.0016298281,"threshold_uncertainty_score":0.9999812},"labels":[],"label_agreement":null},{"id":"W2151289047","doi":"","title":"The Bichromatic Rectangle Problem in High Dimensions.","year":2009,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","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":"University of Saskatchewan","funders":"","keywords":"Rectangle; Set (abstract data type); Point (geometry); Combinatorics; Space (punctuation); Algorithm; Mathematics; Computer science; Discrete mathematics; Geometry","score_opus":0.015620461884556005,"score_gpt":0.2340983481156226,"score_spread":0.2184778862310666,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2151289047","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4230486,0.0009821801,0.4303276,0.105819106,0.0023637866,0.0018423136,0.000052036397,0.00043778785,0.035126626],"genre_scores_gemma":[0.97259444,0.000016156715,0.024265049,0.0026560805,0.00006559964,0.000018727345,0.000044710905,0.000006028886,0.00033317896],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981718,0.00012540369,0.00036842946,0.00042569704,0.00045985178,0.00044880368],"domain_scores_gemma":[0.9985186,0.00049530255,0.00009823186,0.00032791216,0.00025713237,0.000302849],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049355126,0.00018302313,0.00016897614,0.00074239273,0.0004674363,0.00036518648,0.00067396986,0.000077008575,0.000037411082],"category_scores_gemma":[0.0001399644,0.00015573438,0.00004834282,0.0018319645,0.000048055357,0.00028134964,0.000035998186,0.00023179206,0.00016887813],"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.0000049683417,0.000042277497,0.000111264155,0.0000028948907,0.000008059198,0.000026614493,0.000097997996,0.06875783,0.000027456455,0.8346088,0.00260729,0.093704574],"study_design_scores_gemma":[0.0005504475,0.00027253502,0.066503964,0.000074885145,0.0000035666667,0.00003523578,0.00003664212,0.40236756,0.000053861262,0.5250234,0.0047052014,0.00037271148],"about_ca_topic_score_codex":0.0014630558,"about_ca_topic_score_gemma":0.0052489536,"teacher_disagreement_score":0.5495459,"about_ca_system_score_codex":0.00028798718,"about_ca_system_score_gemma":0.0012317031,"threshold_uncertainty_score":0.63506633},"labels":[],"label_agreement":null},{"id":"W2160650170","doi":"","title":"Cache-Oblivious Output-Sensitive Two-Dimensional Convex Hull","year":2007,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Optimization and Search Problems","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":"Convex hull; Cache; Cache-oblivious algorithm; Parallel computing; Combinatorics; Computer science; Cache algorithms; Block size; CPU cache; Algorithm; Mathematics; Regular polygon; Geometry; Key (lock)","score_opus":0.03535666633472642,"score_gpt":0.27830733210590486,"score_spread":0.24295066577117844,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2160650170","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0283744,0.000038291535,0.89288235,0.0077708266,0.0010229242,0.000525817,0.00009343937,0.00025180294,0.06904016],"genre_scores_gemma":[0.96045655,0.0000015382915,0.030504731,0.0070222793,0.00009696586,0.0000058916867,0.000121190074,0.000016954913,0.0017739149],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974022,0.00010334598,0.00037199285,0.0006392716,0.000735965,0.00074721855],"domain_scores_gemma":[0.997021,0.00051704014,0.000110351975,0.00035749882,0.00092116196,0.001072943],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0008239604,0.00024823908,0.00024184068,0.001191236,0.00035747807,0.00029950123,0.0006301748,0.00012020368,0.00042510268],"category_scores_gemma":[0.00015460933,0.00026702805,0.0000796156,0.0011414874,0.00014998292,0.000312355,0.00010239743,0.0003742547,0.0012710418],"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.000021097005,0.000105886895,0.00064900314,0.000011577365,0.00006793236,0.0004553143,0.000585801,0.24561827,0.000046607805,0.6999415,0.009012252,0.043484736],"study_design_scores_gemma":[0.0012823895,0.00019542554,0.017395493,0.00006466841,0.000007328268,0.00013690404,0.000113309296,0.95546144,0.0001857817,0.019448439,0.0049608033,0.00074803084],"about_ca_topic_score_codex":0.005117494,"about_ca_topic_score_gemma":0.008995122,"teacher_disagreement_score":0.9320821,"about_ca_system_score_codex":0.00034710765,"about_ca_system_score_gemma":0.0019602578,"threshold_uncertainty_score":0.9999782},"labels":[],"label_agreement":null},{"id":"W2166438223","doi":"","title":"Decomposing Polygons Into Diameter Bounded Components","year":2003,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","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 Saskatchewan","funders":"","keywords":"Simple polygon; Polygon (computer graphics); Polygon covering; Visibility polygon; Mathematics; Combinatorics; Bounded function; Rectilinear polygon; Heuristics; Bounding overwatch; Decomposition; Intersection (aeronautics); Point in polygon; Reduction (mathematics); Polygon mesh; Algorithm; Computer science; Monotone polygon; Mathematical optimization; Geometry; Artificial intelligence","score_opus":0.032631385377684945,"score_gpt":0.25722298217696493,"score_spread":0.22459159679927998,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2166438223","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.109020926,0.00013767571,0.8703347,0.0027542582,0.0013317707,0.0002924673,0.000023626995,0.00014704965,0.015957532],"genre_scores_gemma":[0.8806578,0.0000042206634,0.116032824,0.002790922,0.00007071046,0.000018157327,0.00012258581,0.000016982432,0.00028580253],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99752367,0.00020298203,0.00040892512,0.0006947588,0.0005944716,0.00057517615],"domain_scores_gemma":[0.99793774,0.00035524886,0.0001273035,0.00042357977,0.0004096693,0.000746445],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00038665655,0.00030331258,0.00025888043,0.0013022696,0.00065142877,0.0006134442,0.0006826255,0.00012259222,0.0002680276],"category_scores_gemma":[0.00018091693,0.00034157504,0.000113413545,0.0014373497,0.00008901035,0.00050490955,0.000057966263,0.00027094912,0.00048315164],"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.000005461706,0.000085403386,0.0007454548,0.0000111035515,0.00004795249,0.000033253935,0.00022110721,0.030465081,0.00029282365,0.94848657,0.0014759029,0.018129917],"study_design_scores_gemma":[0.0015752643,0.00031376237,0.028688714,0.0001112598,0.000021989807,0.00017310209,0.00008162184,0.4710554,0.0013312718,0.44336,0.051830765,0.0014568741],"about_ca_topic_score_codex":0.002044334,"about_ca_topic_score_gemma":0.0026787198,"teacher_disagreement_score":0.77163684,"about_ca_system_score_codex":0.00040919732,"about_ca_system_score_gemma":0.0015815935,"threshold_uncertainty_score":0.9999036},"labels":[],"label_agreement":null},{"id":"W2168122044","doi":"","title":"Towards a Dynamic Data Structure for Ecient Bounded Line Range Search","year":2010,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Intersection (aeronautics); Bounded function; Rectangle; Line (geometry); Data structure; Combinatorics; Line segment; Mathematics; Range (aeronautics); Binary logarithm; Plane (geometry); Algorithm; Discrete mathematics; Computer science; Geometry; Mathematical analysis","score_opus":0.05768482059480392,"score_gpt":0.3178930795238237,"score_spread":0.2602082589290198,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168122044","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11015383,0.0000436753,0.87680274,0.007866596,0.001903693,0.0006155371,0.0016067016,0.000099294055,0.00090791215],"genre_scores_gemma":[0.86357,0.0000027947515,0.13214767,0.0015028176,0.00029256693,0.000019375217,0.002167508,0.000016265114,0.00028102915],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975026,0.000055841603,0.00033545293,0.0009124671,0.0006473991,0.0005462069],"domain_scores_gemma":[0.9972662,0.00029677723,0.00009334601,0.00090923335,0.000828493,0.0006059604],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005410891,0.00025709777,0.00023065544,0.00096421264,0.00047704543,0.0006170951,0.0019196304,0.00016579572,0.00027312443],"category_scores_gemma":[0.00027023812,0.00026787954,0.00006908753,0.0011534131,0.000096778196,0.00051214616,0.00022538955,0.0004385904,0.00006574687],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000309454,0.00009290464,0.00014112856,0.000045874443,0.00006934257,0.000016521968,0.00022638786,0.05865796,0.0007832988,0.72090036,0.004599666,0.21443562],"study_design_scores_gemma":[0.0006155839,0.00012974642,0.0061769374,0.000013969696,0.000008006304,0.000024699115,0.00001584282,0.92731506,0.00013111645,0.054160126,0.011077412,0.00033148538],"about_ca_topic_score_codex":0.0013451928,"about_ca_topic_score_gemma":0.026703179,"teacher_disagreement_score":0.8686571,"about_ca_system_score_codex":0.00016974329,"about_ca_system_score_gemma":0.0037358487,"threshold_uncertainty_score":0.99997735},"labels":[],"label_agreement":null},{"id":"W2171353987","doi":"","title":"On multi-level k-ranges for range search.","year":2004,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Data Management and Algorithms","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 New Brunswick; University of Victoria","funders":"","keywords":"Range (aeronautics); Combinatorics; Binary logarithm; Tree (set theory); Mathematics; Physics; Materials science","score_opus":0.1099219150007775,"score_gpt":0.29831106541324254,"score_spread":0.18838915041246504,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2171353987","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005019663,0.00002153956,0.98316216,0.007694648,0.00046559656,0.00042790847,0.00047888976,0.00008920407,0.0026404122],"genre_scores_gemma":[0.849431,0.0000053259046,0.14509849,0.0041437116,0.000115506606,0.00004432554,0.0002561804,0.000016481654,0.0008889878],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99848294,0.000023630506,0.00016676707,0.0004996936,0.0003664928,0.00046047615],"domain_scores_gemma":[0.9988365,0.00018096634,0.000043944867,0.00033494507,0.00021637631,0.0003872503],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023983441,0.00018133088,0.00015282753,0.00074396265,0.00025417068,0.00035848762,0.0009336573,0.000059822956,0.00006293957],"category_scores_gemma":[0.00007762426,0.0001864401,0.00006614615,0.0005327992,0.000056956393,0.00033081498,0.0000669235,0.00014310694,0.00038964767],"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.0000070926326,0.00006557599,0.00003578889,0.000016315502,0.0000259355,0.000022194183,0.00009810497,0.02177975,0.0000028240106,0.89669895,0.0029092182,0.07833823],"study_design_scores_gemma":[0.008024179,0.0011251066,0.047706388,0.00029427404,0.00002211496,0.000011824156,0.00017807209,0.6742974,0.0002465826,0.24777244,0.01869596,0.0016256971],"about_ca_topic_score_codex":0.002656978,"about_ca_topic_score_gemma":0.0050627925,"teacher_disagreement_score":0.8444113,"about_ca_system_score_codex":0.00022301722,"about_ca_system_score_gemma":0.0007115647,"threshold_uncertainty_score":0.76028067},"labels":[],"label_agreement":null},{"id":"W2172037166","doi":"","title":"Approximation Algorithms for the Discrete Piercing Set Problem for Unit Disks","year":2011,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Mechanical Behavior of Composites","field":"Engineering","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 New Brunswick","funders":"","keywords":"Approximation algorithm; Set (abstract data type); Unit (ring theory); RADIUS; Algorithm; Simple (philosophy); Mathematics; Time complexity; Combinatorics; Constant (computer programming); Running time; Polynomial; Factor (programming language); Computer science; Discrete mathematics; Mathematical analysis","score_opus":0.10202323723914943,"score_gpt":0.2829609674534197,"score_spread":0.1809377302142703,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2172037166","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015073839,0.000045830227,0.98054284,0.00041393284,0.0003228289,0.0011612554,0.00056434027,0.00011686717,0.0017582496],"genre_scores_gemma":[0.9457752,0.0000024626247,0.053246364,0.00012999405,0.000074951146,0.00032395386,0.00033278688,0.00003365846,0.00008061895],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990748,0.000013418492,0.00022473869,0.00020027136,0.00015708279,0.00032965982],"domain_scores_gemma":[0.99896884,0.00039623864,0.000040958643,0.00016362574,0.00019749171,0.00023284335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001900226,0.00016490064,0.00014604433,0.0002105116,0.00021154415,0.000083752726,0.00028530008,0.0000818347,0.00013749409],"category_scores_gemma":[0.00004526382,0.00014292245,0.00007146378,0.00022129572,0.00003648079,0.00010346183,0.0000118895,0.00013513387,0.000022923194],"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.00006865505,0.000044013228,0.0006761908,0.00032687854,0.00023456737,0.0000048547,0.0012435719,0.18557827,0.00047788583,0.6636644,0.0036431039,0.14403757],"study_design_scores_gemma":[0.00036383534,0.00011385414,0.0035702358,0.000050417893,0.000039758204,0.0000033493427,0.000119941935,0.9537829,0.0005520068,0.03945993,0.0016695826,0.0002741736],"about_ca_topic_score_codex":0.00078937167,"about_ca_topic_score_gemma":0.0015338789,"teacher_disagreement_score":0.9307014,"about_ca_system_score_codex":0.00010211488,"about_ca_system_score_gemma":0.00015898776,"threshold_uncertainty_score":0.58282083},"labels":[],"label_agreement":null},{"id":"W2182520915","doi":"","title":"Exact Algorithms and APX-Hardness Results for Geometric Set Cover","year":2011,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","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":"Combinatorics; Cover (algebra); Mathematics; Vertex cover; Monotone polygon; Rectangle; Set cover problem; Unit square; Approximation algorithm; Time complexity; Algorithm; Line segment; Computational geometry; Square (algebra); Set (abstract data type); Computer science; Geometry","score_opus":0.0761986086665031,"score_gpt":0.2723684118473931,"score_spread":0.19616980318088997,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2182520915","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01547483,0.00016423617,0.97104615,0.0012778456,0.0011326883,0.00056766166,0.00056382525,0.00011348465,0.009659308],"genre_scores_gemma":[0.925945,0.0000196079,0.07094517,0.0014748276,0.0001623698,0.00005501487,0.00038935032,0.000017189666,0.0009914985],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99776,0.00006863647,0.00042608508,0.0007894457,0.00043971653,0.0005160958],"domain_scores_gemma":[0.99772996,0.00045646995,0.00016473446,0.00034154902,0.00066670106,0.00064058043],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00056818686,0.0002792645,0.0002640793,0.0017681078,0.00038160157,0.00029541715,0.000580746,0.00013901536,0.00010206006],"category_scores_gemma":[0.00031773702,0.00029991023,0.0000829177,0.0017753313,0.00008205545,0.0005082962,0.0000838292,0.00018069724,0.00013434741],"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.0001675831,0.000197924,0.00063967664,0.00008734328,0.00017642629,0.000074995936,0.0014606015,0.023817442,0.000024835632,0.61277586,0.03442097,0.32615635],"study_design_scores_gemma":[0.0030335174,0.00088045833,0.057584118,0.00007405007,0.000031134914,0.00011073302,0.00010757743,0.8117409,0.00037650575,0.079310216,0.045568693,0.0011821274],"about_ca_topic_score_codex":0.0015649346,"about_ca_topic_score_gemma":0.00046549345,"teacher_disagreement_score":0.9104701,"about_ca_system_score_codex":0.0001696815,"about_ca_system_score_gemma":0.0010840598,"threshold_uncertainty_score":0.9999453},"labels":[],"label_agreement":null},{"id":"W2183482302","doi":"","title":"Computing a planar widest empty -siphon in o(n 3 ) time","year":2007,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","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":"Combinatorics; Planar; Plane (geometry); Computational geometry; Euclidean geometry; Euclidean space; Time complexity; Mathematics; Set (abstract data type); Chain (unit); Binary logarithm; Property (philosophy); Algorithm; Geometry; Computer science; Physics; Computer graphics (images)","score_opus":0.02081391544154621,"score_gpt":0.254161815478128,"score_spread":0.2333479000365818,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2183482302","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28204116,0.000060922797,0.7036916,0.0020296972,0.00059087493,0.00031234647,0.000028297594,0.00013942705,0.011105679],"genre_scores_gemma":[0.9678163,0.0000019575223,0.028968168,0.0025246968,0.00016480291,0.000003965386,0.00015756575,0.00001474929,0.00034778955],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99731374,0.000084367864,0.00053627265,0.0006653627,0.00069044874,0.0007098305],"domain_scores_gemma":[0.9980246,0.0006030337,0.00013660964,0.00031622904,0.0003112133,0.000608303],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011848295,0.00027065506,0.000268095,0.002102816,0.0002656483,0.00029960796,0.0008848709,0.00014662856,0.00013471706],"category_scores_gemma":[0.00015417545,0.00031466293,0.00007261945,0.0023003502,0.00007567289,0.00036701752,0.000072140996,0.00034929987,0.0006849624],"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.000045824127,0.0002189977,0.007862096,0.000027597089,0.000046030218,0.00048751806,0.0008863578,0.19172639,0.00030866158,0.6898923,0.0046476014,0.10385063],"study_design_scores_gemma":[0.0011920352,0.00023433023,0.25742018,0.00014620606,0.0000055099,0.000116730516,0.00009007425,0.67993504,0.00025076856,0.054732803,0.004996753,0.0008795367],"about_ca_topic_score_codex":0.0030906568,"about_ca_topic_score_gemma":0.010401089,"teacher_disagreement_score":0.6857751,"about_ca_system_score_codex":0.00049160287,"about_ca_system_score_gemma":0.0012305145,"threshold_uncertainty_score":0.99993056},"labels":[],"label_agreement":null},{"id":"W2185134590","doi":"","title":"Turning Orthogonally Convex Polyhedra into Orthoballs","year":2014,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","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 Waterloo","funders":"","keywords":"Polyhedron; Convex polytope; Regular polygon; Combinatorics; Mathematics; Planar graph; Face (sociological concept); Graph; Convex set; Computer science; Geometry; Convex optimization","score_opus":0.01531333210797006,"score_gpt":0.2375764296703209,"score_spread":0.22226309756235083,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2185134590","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053022806,0.00007097038,0.9205445,0.005569782,0.00092203106,0.00022015715,0.000018775145,0.00018717746,0.01944378],"genre_scores_gemma":[0.9402767,0.0000040846267,0.0525176,0.0061470936,0.0002652846,0.000018934028,0.00018798503,0.00001819159,0.000564123],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973096,0.00017788859,0.0004474896,0.00076135166,0.00073700014,0.00056664896],"domain_scores_gemma":[0.99740976,0.00051809964,0.00016932638,0.00044107664,0.00064851536,0.0008132325],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006040669,0.00031600922,0.0002993062,0.001192807,0.00051170116,0.00051865436,0.00094235217,0.0001467934,0.00036579007],"category_scores_gemma":[0.00031682107,0.00034614728,0.00011373761,0.0014501147,0.0000877151,0.000502536,0.00010683771,0.00032693363,0.0005854032],"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.0000058250025,0.000031458996,0.0007798558,0.00001274567,0.00002924169,0.000016718017,0.00016263324,0.094756275,0.000095414565,0.8131275,0.0015727674,0.08940953],"study_design_scores_gemma":[0.0006387271,0.0002484382,0.036746915,0.00006111389,0.000009550008,0.000054041044,0.000029975563,0.7949308,0.00013103441,0.12671351,0.039739687,0.0006961969],"about_ca_topic_score_codex":0.002031949,"about_ca_topic_score_gemma":0.005116633,"teacher_disagreement_score":0.8872539,"about_ca_system_score_codex":0.00023554501,"about_ca_system_score_gemma":0.0017274276,"threshold_uncertainty_score":0.999899},"labels":[],"label_agreement":null},{"id":"W2185561909","doi":"","title":"The spanning ratio of the Delaunay triangulation is greater than = 2","year":2009,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","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":"McGill University; Carleton University","funders":"","keywords":"Delaunay triangulation; Combinatorics; Euclidean minimum spanning tree; Mathematics; Spanning tree; Shortest path problem; Pitteway triangulation; Discrete mathematics; Graph; Kruskal's algorithm","score_opus":0.02716924511353718,"score_gpt":0.24636877119434886,"score_spread":0.21919952608081167,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2185561909","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1947235,0.0001868844,0.7559499,0.04038236,0.0013300339,0.0006140855,0.000045135836,0.000072123454,0.0066959364],"genre_scores_gemma":[0.99408,0.000003935244,0.0022839182,0.0026953088,0.00011096702,0.0000070453266,0.000022783743,0.0000056263216,0.0007904009],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983165,0.00011651016,0.00036259237,0.0003372212,0.0005635203,0.00030360452],"domain_scores_gemma":[0.99845123,0.00025305268,0.0001967018,0.00042506435,0.00049203215,0.00018193075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037194148,0.0001688947,0.00014436821,0.00034439316,0.0006906922,0.00029473004,0.000827364,0.00007658174,0.000047128222],"category_scores_gemma":[0.00012308783,0.00011789169,0.00011378137,0.0012692572,0.00007630718,0.00026451558,0.00004355647,0.00017618513,0.000038717866],"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.000022446919,0.000027910826,0.0010969948,0.000004389261,0.000042398016,0.0000035470791,0.0006675211,0.13437961,0.0001687174,0.76312596,0.003571637,0.09688886],"study_design_scores_gemma":[0.0005344506,0.00020374978,0.33833608,0.00005136142,0.000014008984,0.00002064663,0.000044389108,0.53130543,0.0012820086,0.124281466,0.0036311971,0.00029521683],"about_ca_topic_score_codex":0.00044828682,"about_ca_topic_score_gemma":0.00065140007,"teacher_disagreement_score":0.7993565,"about_ca_system_score_codex":0.0001317954,"about_ca_system_score_gemma":0.0010203697,"threshold_uncertainty_score":0.5312316},"labels":[],"label_agreement":null},{"id":"W2186560431","doi":"","title":"Maximum Independent Set for Interval Graphs and Trees in Space Efficient Models.","year":2014,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Advanced Graph Theory Research","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":"Simon Fraser University","funders":"","keywords":"Interval (graph theory); Maximal independent set; Set (abstract data type); Interval graph; Combinatorics; Space (punctuation); Independent set; Mathematics; Upper and lower bounds; Discrete mathematics; Product (mathematics); Algorithm; Computer science; Pathwidth; Graph; Line graph","score_opus":0.04062558458719696,"score_gpt":0.28570176632086003,"score_spread":0.24507618173366308,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2186560431","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17525288,0.00004685883,0.82002425,0.0021003254,0.00016746145,0.0003606585,0.00005792032,0.000043033204,0.0019466092],"genre_scores_gemma":[0.98522705,0.0000033980646,0.014128423,0.00047199862,0.000014335473,0.00004193455,0.000024332752,0.000012093278,0.00007645527],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998235,0.000102282764,0.00021980317,0.0005653234,0.00036613934,0.0005114592],"domain_scores_gemma":[0.99849683,0.00048045823,0.0000585391,0.0002875888,0.00022150151,0.00045507925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006009868,0.0001804561,0.00020872758,0.0013557287,0.00014696535,0.00019690803,0.00063732686,0.00008102013,0.00001596623],"category_scores_gemma":[0.00012667185,0.00019016485,0.000051795156,0.00073257776,0.0001236307,0.0001978453,0.000109908135,0.00023126247,0.000014248297],"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.000014342591,0.000018995615,0.00037143537,0.000009371942,0.000006985211,0.0000060454895,0.00019914305,0.19373192,0.00000768184,0.78910357,0.000079573954,0.016450958],"study_design_scores_gemma":[0.00035866656,0.00009893551,0.003872951,0.000024556808,8.5763463e-7,0.0000056305967,0.00004466876,0.54673153,0.000011304738,0.44857737,0.00014673805,0.00012681389],"about_ca_topic_score_codex":0.0014854405,"about_ca_topic_score_gemma":0.011699358,"teacher_disagreement_score":0.80997413,"about_ca_system_score_codex":0.00016069325,"about_ca_system_score_gemma":0.0004269461,"threshold_uncertainty_score":0.7754698},"labels":[],"label_agreement":null},{"id":"W2188440933","doi":"","title":"Optimal Bounds on Theta-Graphs: More is not Always Better.","year":2012,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":13,"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; Upper and lower bounds; Discrete mathematics","score_opus":0.05157835567815482,"score_gpt":0.30788677617249155,"score_spread":0.2563084204943367,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2188440933","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.60512376,0.0002855218,0.30798918,0.036390815,0.002017955,0.0009831844,0.0006117362,0.0004444992,0.046153337],"genre_scores_gemma":[0.9716557,0.0000056863223,0.016142638,0.011376031,0.00013432237,0.000032434556,0.000048909096,0.000026527892,0.0005777131],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968674,0.00012352037,0.00029320465,0.0006391663,0.0009477531,0.001128911],"domain_scores_gemma":[0.9972061,0.00044758216,0.000100666286,0.0007167707,0.00033631336,0.0011925743],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00050012453,0.00032778093,0.00026915089,0.0014199554,0.00047237868,0.00034176395,0.001409014,0.00013781543,0.00051122316],"category_scores_gemma":[0.00010162651,0.0003287392,0.00014192742,0.0014085065,0.00027000083,0.000659192,0.00013346551,0.0005269334,0.0009204489],"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.000024245857,0.00008785901,0.0021690426,0.0000104484425,0.000060873746,0.00003360207,0.0006721725,0.0074772346,0.00003273539,0.95492584,0.0049632974,0.029542636],"study_design_scores_gemma":[0.002586549,0.0013959557,0.14715071,0.00026017876,0.000037157144,0.0001919337,0.00061217014,0.34195697,0.0027064118,0.41675243,0.08299987,0.003349659],"about_ca_topic_score_codex":0.00074857817,"about_ca_topic_score_gemma":0.00026449628,"teacher_disagreement_score":0.53817344,"about_ca_system_score_codex":0.0002804134,"about_ca_system_score_gemma":0.0008041356,"threshold_uncertainty_score":0.9999165},"labels":[],"label_agreement":null},{"id":"W2188906995","doi":"","title":"An improved method for generating triangle-mesh models of images","year":2014,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Computer Graphics and Visualization 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 Victoria","funders":"","keywords":"Computation; Computer science; Margin (machine learning); Algorithm; Triangulation; Noise (video); Triangle mesh; Signal-to-noise ratio (imaging); Artificial intelligence; Image (mathematics); Mathematics; Computer graphics (images); Polygon mesh; Telecommunications; Geometry","score_opus":0.043397298308301954,"score_gpt":0.3264325494921041,"score_spread":0.28303525118380213,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2188906995","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001129556,0.000015520598,0.9972723,0.0004028417,0.00017046354,0.00029291795,0.00006971532,0.00010908195,0.0005376089],"genre_scores_gemma":[0.55655205,0.0000016747023,0.4424891,0.00078526133,0.000059742684,0.000025778656,0.00005572141,0.000009939048,0.00002073516],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984891,0.00013878284,0.0003814351,0.00047533188,0.00022401905,0.00029136715],"domain_scores_gemma":[0.9979486,0.00037671247,0.00018831831,0.00040092602,0.0007606718,0.00032479488],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078277994,0.00017549343,0.00027992143,0.0008453592,0.00018582959,0.00025964802,0.0007881135,0.00009181561,0.000013039644],"category_scores_gemma":[0.000087726505,0.00018753114,0.00010010811,0.00061182375,0.00003793169,0.00037352435,0.000044283683,0.000097091804,0.0000013395899],"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.0000031156355,0.000027755867,0.000020668067,0.00001612249,0.0000128096835,3.8203535e-7,0.00009289813,0.015915822,0.00027475433,0.895071,0.0003822496,0.08818239],"study_design_scores_gemma":[0.0002810204,0.00029647863,0.0001334476,0.000019473424,0.0000036851275,0.0000021294454,0.000008798515,0.83613586,0.0010308638,0.16163518,0.00027257885,0.00018047167],"about_ca_topic_score_codex":0.00209781,"about_ca_topic_score_gemma":0.0009253419,"teacher_disagreement_score":0.82022005,"about_ca_system_score_codex":0.000051567986,"about_ca_system_score_gemma":0.000626247,"threshold_uncertainty_score":0.7647298},"labels":[],"label_agreement":null},{"id":"W22225833","doi":"10.48550/arxiv.1311.4860","title":"Computing Covers of Plane Forests","year":2013,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","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":"Carleton University","funders":"","keywords":"Cover (algebra); Disjoint sets; Combinatorics; Convex hull; Bounding overwatch; Mathematics; Plane (geometry); Function (biology); Pairwise comparison; Set (abstract data type); Regular polygon; Discrete mathematics; Computer science; Geometry; Artificial intelligence","score_opus":0.021014756440552698,"score_gpt":0.23658945077304488,"score_spread":0.21557469433249218,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W22225833","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25570482,0.000055538007,0.72771096,0.0025779803,0.0006454886,0.00039566678,0.000045400866,0.00009349795,0.012770634],"genre_scores_gemma":[0.97102594,0.0000019771617,0.027582293,0.00094718236,0.00007700214,0.000009114155,0.000116533825,0.000009250788,0.00023071069],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982726,0.000062591585,0.00038246508,0.0004098358,0.00049251184,0.00037998322],"domain_scores_gemma":[0.9981471,0.0003562695,0.00016674613,0.00028306872,0.00061803893,0.0004288298],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020120092,0.00019212987,0.0002238279,0.0009199186,0.00018699966,0.00020671493,0.00063673424,0.000089155685,0.00037181377],"category_scores_gemma":[0.0001022704,0.00020685466,0.000072891504,0.0010624296,0.00007106092,0.0004206149,0.00007093161,0.0001661401,0.0004023142],"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.0000046905698,0.000059599526,0.0023955642,0.00002317211,0.00004708098,0.000013160798,0.00020433043,0.27314365,0.00013974671,0.6431535,0.00836522,0.07245034],"study_design_scores_gemma":[0.00047546296,0.00018289725,0.130055,0.00005604337,0.0000047624094,0.000028555625,0.00004508213,0.8132602,0.0003232982,0.053741105,0.0014727558,0.00035487115],"about_ca_topic_score_codex":0.0053902627,"about_ca_topic_score_gemma":0.0023376944,"teacher_disagreement_score":0.7153211,"about_ca_system_score_codex":0.00013650634,"about_ca_system_score_gemma":0.0010826933,"threshold_uncertainty_score":0.8435288},"labels":[],"label_agreement":null},{"id":"W2293145487","doi":"","title":"An In-Place Priority Search Tree","year":2011,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Algorithms and Data Compression","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":"Computer science; Tree (set theory); Search tree; Data structure; Set (abstract data type); Point (geometry); Range tree; Segment tree; K-ary tree; Tree structure; Interval tree; Space (punctuation); Theoretical computer science; Data mining; Algorithm; Search algorithm; Mathematics; Combinatorics","score_opus":0.05831943655892484,"score_gpt":0.2812326171816245,"score_spread":0.22291318062269966,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2293145487","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3037485,0.000067517976,0.65157586,0.0012570443,0.0007907873,0.00043789655,0.0001310482,0.00018876078,0.041802593],"genre_scores_gemma":[0.9476177,0.000003807298,0.05162214,0.000570915,0.0000434525,0.0000068414492,0.000054565364,0.000007860193,0.00007268208],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983569,0.000101527534,0.00021097805,0.00052228244,0.00037167603,0.00043662827],"domain_scores_gemma":[0.99856883,0.00008127921,0.000042282227,0.0005027483,0.00019319438,0.00061169016],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032565073,0.0001572037,0.00015581117,0.0007627408,0.00015333736,0.00017283995,0.0011467437,0.00009079522,0.0002920375],"category_scores_gemma":[0.000026087595,0.0001613114,0.000029864095,0.0007739718,0.000057986945,0.0006364022,0.00008959229,0.00027806003,0.00021231896],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002184799,0.00023547902,0.011589391,0.000013459278,0.000013464828,0.00025712617,0.0015152018,0.004664905,0.00004047942,0.739198,0.0010724129,0.2413782],"study_design_scores_gemma":[0.0004305812,0.00022861174,0.3044531,0.000041288626,0.0000015156904,0.000017951996,0.00009529106,0.671657,0.00008752384,0.021566218,0.0010689404,0.0003519668],"about_ca_topic_score_codex":0.027234552,"about_ca_topic_score_gemma":0.026549043,"teacher_disagreement_score":0.7176318,"about_ca_system_score_codex":0.00018033231,"about_ca_system_score_gemma":0.0014293854,"threshold_uncertainty_score":0.9912139},"labels":[],"label_agreement":null},{"id":"W2293226065","doi":"","title":"Window Queries On Planar Subdivisions Arising From Overlapping Polygons","year":2014,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Regular polygon; Combinatorics; Point in polygon; Planar; Subdivision; Space (punctuation); Simple (philosophy); Computational geometry; Polygon (computer graphics); Polygon mesh; Mathematics; Computer science; Algorithm; Geometry; Computer graphics (images)","score_opus":0.025237448898434094,"score_gpt":0.23910004481009484,"score_spread":0.21386259591166074,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2293226065","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12379486,0.000056013603,0.85195756,0.006787775,0.0012295627,0.0002196207,0.00017258048,0.00018438991,0.0155976545],"genre_scores_gemma":[0.97130686,0.0000045945744,0.022418227,0.0053210664,0.00032398794,0.000012285416,0.00038470703,0.000017125007,0.00021114336],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975687,0.00015818125,0.00036704855,0.0007421964,0.00065889227,0.0005049415],"domain_scores_gemma":[0.9974949,0.0009868379,0.00014381844,0.00046623743,0.00028950276,0.0006186997],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00030714393,0.00030114688,0.00027762126,0.0011294499,0.000659764,0.0005628116,0.00071266247,0.00013534163,0.00020090195],"category_scores_gemma":[0.0002959044,0.00032957143,0.0000985924,0.0010508881,0.00007555826,0.00040912087,0.00005757645,0.00033584094,0.0004702624],"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.000010200554,0.000048784183,0.000602365,0.000004873146,0.00003914705,0.000015752214,0.00021082247,0.10269368,0.00014143252,0.83506334,0.0025217314,0.058647852],"study_design_scores_gemma":[0.0007719044,0.0003535031,0.13394487,0.00017657381,0.000013868238,0.000017778157,0.00008171373,0.66675544,0.00026203884,0.17344505,0.02332647,0.00085079],"about_ca_topic_score_codex":0.0051384154,"about_ca_topic_score_gemma":0.004955342,"teacher_disagreement_score":0.847512,"about_ca_system_score_codex":0.00024822194,"about_ca_system_score_gemma":0.0010120546,"threshold_uncertainty_score":0.99991566},"labels":[],"label_agreement":null},{"id":"W2294012348","doi":"","title":"Almost Online Square Packing","year":2014,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","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 Waterloo","funders":"","keywords":"Competitive analysis; Logarithm; Square (algebra); Online algorithm; Advice (programming); Oracle; Packing problems; Computer science; Algorithm; Sequence (biology); Mathematics; Mathematical optimization; Upper and lower bounds","score_opus":0.039339746340765196,"score_gpt":0.2710083307283992,"score_spread":0.231668584387634,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2294012348","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0045295972,0.00001149892,0.9517449,0.010426512,0.00033606373,0.00016234443,0.000047898415,0.00013129688,0.032609895],"genre_scores_gemma":[0.94826984,0.000003746447,0.045521274,0.005284698,0.00008290416,0.0000062494155,0.0001568045,0.000011072385,0.0006634105],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99850374,0.000102933,0.00020587548,0.00040688028,0.00038713822,0.00039344197],"domain_scores_gemma":[0.99841183,0.00021551848,0.00006206378,0.00032343276,0.00041515037,0.0005719737],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028757734,0.0001461308,0.00014394739,0.0005981618,0.00024204218,0.00033070808,0.0006725352,0.000072185416,0.00054429186],"category_scores_gemma":[0.00018831111,0.00015409205,0.000044914475,0.0007896189,0.00005066859,0.0002437956,0.000060802602,0.0002067071,0.0005884965],"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.0000014377988,0.000037999354,0.0008663604,0.000010797969,0.00001088339,0.0000101064725,0.00014766684,0.09301045,0.0000041852877,0.8215846,0.0029431742,0.08137234],"study_design_scores_gemma":[0.00026574824,0.00006503382,0.008659016,0.00004191135,0.0000013605755,0.000009233502,0.00003063626,0.9522459,0.0000062684944,0.021267777,0.017179754,0.00022737004],"about_ca_topic_score_codex":0.0017860271,"about_ca_topic_score_gemma":0.005818189,"teacher_disagreement_score":0.94374025,"about_ca_system_score_codex":0.00012727919,"about_ca_system_score_gemma":0.0007814654,"threshold_uncertainty_score":0.75641286},"labels":[],"label_agreement":null},{"id":"W2294243368","doi":"","title":"Optimal Average Case Strategy for Looking around a Corner","year":2012,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Robotic Path Planning Algorithms","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; Dalhousie University","funders":"","keywords":"Robot; Vertex (graph theory); Mathematics; Regular polygon; Path (computing); Function (biology); Motion planning; Computer science; Mathematical optimization; Artificial intelligence; Combinatorics; Geometry; Graph","score_opus":0.06612095846838448,"score_gpt":0.2950670190433908,"score_spread":0.2289460605750063,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2294243368","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042473257,0.00007236462,0.95253646,0.0004647487,0.00079688395,0.0002797327,0.000104268904,0.00008843155,0.0031838634],"genre_scores_gemma":[0.84928083,5.291412e-7,0.14934179,0.0007631653,0.00023820426,0.000028721939,0.00005965752,0.000014867067,0.0002722324],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981762,0.00005474775,0.0002609369,0.0004161468,0.00029622673,0.0007957109],"domain_scores_gemma":[0.99807495,0.00042235525,0.000104445884,0.00030818998,0.00026444453,0.00082563865],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004044891,0.00022572074,0.00020718224,0.0005396946,0.00035169633,0.0003536942,0.0005051362,0.000112919755,0.00006619189],"category_scores_gemma":[0.00010248459,0.0002453135,0.00007048617,0.00048920483,0.000059279217,0.0005121206,0.000048138256,0.00022173824,0.00015323295],"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.000005754933,0.000054794404,0.0010300766,0.000019640614,0.000047826907,0.0007084728,0.0004550588,0.74538296,0.0000045501147,0.22562842,0.0017676936,0.024894712],"study_design_scores_gemma":[0.00039857585,0.00012265459,0.0029563468,0.00003237888,0.000007583837,0.0013578909,0.00012028048,0.99088484,0.000011943172,0.002679766,0.0010619077,0.00036583477],"about_ca_topic_score_codex":0.002728355,"about_ca_topic_score_gemma":0.00040446533,"teacher_disagreement_score":0.8068076,"about_ca_system_score_codex":0.00027534817,"about_ca_system_score_gemma":0.001132368,"threshold_uncertainty_score":0.99999994},"labels":[],"label_agreement":null},{"id":"W2294852551","doi":"","title":"Online Packing of Equilateral Triangles","year":2015,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Optimization and Packing Problems","field":"Engineering","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":"Equilateral triangle; Competitive analysis; Online algorithm; Computer science; Sequence (biology); Packing problems; Unit (ring theory); Upper and lower bounds; Algorithm; Combinatorics; Mathematics; Geometry","score_opus":0.07778953216714346,"score_gpt":0.26259192413017024,"score_spread":0.18480239196302678,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2294852551","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8083494,0.00042149538,0.07638551,0.0019286957,0.002417353,0.0004653151,0.0010534613,0.00045941726,0.1085194],"genre_scores_gemma":[0.9951204,0.0000045341985,0.004204007,0.00020633572,0.00005462231,0.0000018017058,0.00025145183,0.000015755542,0.00014106817],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99934334,0.000016059397,0.0001903039,0.00010244277,0.00016828549,0.0001796023],"domain_scores_gemma":[0.99932104,0.000044405293,0.000031195497,0.00008859241,0.00020528564,0.0003094515],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009373517,0.00010040996,0.00013375297,0.00041076777,0.000024961875,0.0000370349,0.00011358329,0.00006068604,0.0002533832],"category_scores_gemma":[0.000036144473,0.00010959701,0.000028436489,0.00033877903,0.00003055485,0.000066920715,0.0000070376514,0.00009979757,0.00004922162],"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.0000035798869,0.000012922396,0.0007057324,0.000017603024,0.00001993711,0.0000047373173,0.00015738592,0.9772466,0.000009477647,0.015395365,0.0020433627,0.0043833037],"study_design_scores_gemma":[0.000792282,0.000091205875,0.005285889,0.00010237863,0.0000081067565,0.000008524442,0.00020323445,0.9807888,0.000075532414,0.00708104,0.0052675814,0.00029541252],"about_ca_topic_score_codex":0.0010492707,"about_ca_topic_score_gemma":0.003128967,"teacher_disagreement_score":0.18677108,"about_ca_system_score_codex":0.00010542217,"about_ca_system_score_gemma":0.00036001473,"threshold_uncertainty_score":0.4469236},"labels":[],"label_agreement":null},{"id":"W2295098206","doi":"","title":"Approximation Algorithms for a Triangle Enclosure Problem","year":2011,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","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":"Carleton University","funders":"","keywords":"Convex hull; Combinatorics; Approximation algorithm; Regular polygon; Mathematics; Triangle inequality; Enclosure; Set (abstract data type); Plane (geometry); Algorithm; Discrete mathematics; Computer science; Geometry","score_opus":0.08659723767557773,"score_gpt":0.26544009848704214,"score_spread":0.17884286081146442,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2295098206","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027851898,0.000035292785,0.97784466,0.0012776878,0.00045218205,0.0006991067,0.000072733346,0.00011809986,0.016715044],"genre_scores_gemma":[0.6054399,0.0000022436486,0.39248782,0.0010707943,0.0001256403,0.00014831458,0.00020406759,0.000014494816,0.0005067262],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99818385,0.00006725449,0.00037022738,0.0005764727,0.0003782283,0.00042395527],"domain_scores_gemma":[0.9984105,0.00019343042,0.00015130958,0.00028300585,0.0005412201,0.00042053196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045033623,0.00022580555,0.0002214115,0.00080394297,0.00032283948,0.00019255832,0.00060255465,0.00012554544,0.0003117699],"category_scores_gemma":[0.0001094247,0.00024340095,0.00011443576,0.0011040496,0.000045686258,0.00048239742,0.000050097588,0.00014240673,0.00020252005],"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.00002041719,0.000098458084,0.000118574884,0.000024203002,0.000040079856,0.000008834628,0.0005614968,0.0135832075,0.000023944893,0.83712023,0.0055851857,0.14281534],"study_design_scores_gemma":[0.0009621799,0.00040172058,0.005328871,0.000033007327,0.000012677938,0.000027456193,0.00003954092,0.64784455,0.0003304351,0.33613873,0.00839795,0.0004828881],"about_ca_topic_score_codex":0.0011749172,"about_ca_topic_score_gemma":0.0012387675,"teacher_disagreement_score":0.6342613,"about_ca_system_score_codex":0.00019679019,"about_ca_system_score_gemma":0.0011027649,"threshold_uncertainty_score":0.99256027},"labels":[],"label_agreement":null},{"id":"W2295337288","doi":"","title":"Weighted Region Problem in Arrangement of Lines","year":2013,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","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":"Carleton University","funders":"","keywords":"Shortest path problem; Hull; Bounded function; Combinatorics; Boundary (topology); Path (computing); Line segment; Mathematics; Line (geometry); Computer science; Geometry; Graph; Mathematical analysis","score_opus":0.027374131823302613,"score_gpt":0.2344320232530039,"score_spread":0.2070578914297013,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2295337288","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32095125,0.00016051087,0.6470078,0.01330805,0.00059431087,0.0010860948,0.00001997018,0.00009645128,0.016775552],"genre_scores_gemma":[0.9578236,0.0000075238245,0.040935494,0.000775101,0.00005457175,0.000051441606,0.000062348816,0.0000070958595,0.00028285285],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984673,0.00007051243,0.00040807284,0.0003825734,0.00036863494,0.0003028702],"domain_scores_gemma":[0.99867463,0.00015281497,0.00013273294,0.00023350849,0.0005535467,0.00025276965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001769798,0.00016202191,0.00019587702,0.0013304391,0.000080462494,0.0001240125,0.00046867775,0.00007729895,0.00017605569],"category_scores_gemma":[0.000039132585,0.0001682795,0.000050205457,0.0014967408,0.000044644825,0.00039414264,0.00004535022,0.00013962804,0.00014795011],"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.000007729863,0.00015382783,0.0038875407,0.00004979654,0.000031191783,0.000024840107,0.00037084988,0.09410509,0.00018002682,0.74243176,0.0052686576,0.15348868],"study_design_scores_gemma":[0.0007471907,0.0002095023,0.09605246,0.00013300574,0.000003860603,0.000018649958,0.00005890866,0.7164518,0.0003288554,0.18313771,0.0024483267,0.0004096894],"about_ca_topic_score_codex":0.0062097255,"about_ca_topic_score_gemma":0.0030922992,"teacher_disagreement_score":0.6368723,"about_ca_system_score_codex":0.0001564902,"about_ca_system_score_gemma":0.0007958708,"threshold_uncertainty_score":0.9387289},"labels":[],"label_agreement":null},{"id":"W2295704388","doi":"","title":"The Possible Hull of Imprecise Points","year":2011,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","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 British Columbia","funders":"","keywords":"Convex hull; Hull; Polygon (computer graphics); Simple (philosophy); Simple polygon; Point (geometry); Mathematics; Regular polygon; Combinatorics; Set (abstract data type); Plane (geometry); Orthogonal convex hull; Mathematical optimization; Algorithm; Computer science; Geometry; Convex body; Engineering","score_opus":0.04666611281999775,"score_gpt":0.2427950566893644,"score_spread":0.19612894386936666,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2295704388","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11251985,0.000379158,0.7906931,0.004575264,0.002189826,0.000625399,0.000100368336,0.00014920943,0.088767834],"genre_scores_gemma":[0.9750527,0.000012982571,0.023738403,0.00062275876,0.0000528529,0.00001340326,0.000025311962,0.000008155481,0.00047339997],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99842805,0.00008482686,0.00035536298,0.0003472738,0.00043299058,0.00035152596],"domain_scores_gemma":[0.9981715,0.00033482318,0.00015470569,0.00039261748,0.0006044267,0.00034190205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004294607,0.00016132396,0.00015363877,0.0005517491,0.0003767841,0.00014301695,0.00094464736,0.000071325485,0.0001750082],"category_scores_gemma":[0.0001364659,0.00013705778,0.00008104709,0.0010783103,0.00011072713,0.0002724817,0.00007693057,0.00015732611,0.00016544544],"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.000013225876,0.000042852753,0.00044082626,0.0000061021938,0.000030091112,0.0000092963355,0.00030881717,0.003498823,0.000026293888,0.9223243,0.0017397231,0.07155966],"study_design_scores_gemma":[0.00085782626,0.00053851394,0.12397072,0.00007536953,0.000015752887,0.000057093657,0.0001610046,0.3288467,0.0021860742,0.5341711,0.008436342,0.00068351196],"about_ca_topic_score_codex":0.0020503676,"about_ca_topic_score_gemma":0.0027618075,"teacher_disagreement_score":0.86253285,"about_ca_system_score_codex":0.000095120864,"about_ca_system_score_gemma":0.0013277532,"threshold_uncertainty_score":0.5589054},"labels":[],"label_agreement":null},{"id":"W2296221246","doi":"","title":"The Approximability and Integrality Gap of Interval Stabbing and Independence Problems","year":2012,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Complexity and Algorithms in Graphs","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":"Mathematics; Rectangle; Combinatorics; Interval (graph theory); Linear programming; Independence (probability theory); Approximation algorithm; Set (abstract data type); Discrete mathematics; Duality (order theory); Independent set; Upper and lower bounds; Plane (geometry); Duality gap; Mathematical optimization; Optimization problem; Graph; Computer science; Statistics; Mathematical analysis","score_opus":0.058811907638360375,"score_gpt":0.2680974723676161,"score_spread":0.20928556472925575,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2296221246","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6910842,0.0009922882,0.2989909,0.0039346474,0.0006597705,0.0004955258,0.00007425542,0.000064020365,0.003704383],"genre_scores_gemma":[0.99069184,0.000017933427,0.009044772,0.00018145022,0.000025905836,0.000008707028,0.0000041948642,0.0000037147358,0.00002146609],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987242,0.00010688826,0.0002454328,0.00027712042,0.00030282378,0.00034350328],"domain_scores_gemma":[0.9985914,0.00048545015,0.00009677683,0.00025945719,0.00021925385,0.00034761825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094725186,0.00013127488,0.00015688394,0.0001968118,0.0003047664,0.00019000671,0.00046254837,0.000060181163,0.000015062016],"category_scores_gemma":[0.00016542658,0.000105880354,0.000032150663,0.00039503863,0.00039608663,0.00034992068,0.00017675576,0.00026973023,0.0000028360414],"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.0000040121076,0.000030933777,0.021717098,0.000035958037,0.00001769958,8.515429e-7,0.00072533643,0.00010494849,0.0000065643912,0.867608,0.000049614682,0.109698966],"study_design_scores_gemma":[0.00037895172,0.00017056799,0.3683476,0.00012731367,0.000007818295,0.00005264189,0.0005276949,0.22893757,0.000064614316,0.39953855,0.0014544476,0.0003922605],"about_ca_topic_score_codex":0.0046037408,"about_ca_topic_score_gemma":0.0046375114,"teacher_disagreement_score":0.46806946,"about_ca_system_score_codex":0.00006459793,"about_ca_system_score_gemma":0.00032665065,"threshold_uncertainty_score":0.6959509},"labels":[],"label_agreement":null},{"id":"W2395072164","doi":"","title":"Space-Efficient Algorithm for Computing a Centerpoint of a Point Set in R^2.","year":2014,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Set (abstract data type); Space (punctuation); Point (geometry); Algorithm; Mathematics; Geometry; Programming language","score_opus":0.023490783606116762,"score_gpt":0.26017690045934166,"score_spread":0.2366861168532249,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2395072164","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032821577,0.000025175303,0.9631357,0.0017900756,0.0004414387,0.00038911862,0.000078188365,0.00003751947,0.001281182],"genre_scores_gemma":[0.8331645,9.443439e-7,0.16588925,0.00068921054,0.000081339706,0.00001577191,0.0001086853,0.000010072346,0.000040233317],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980198,0.000109246954,0.00049291516,0.0005329197,0.00040022042,0.00044485775],"domain_scores_gemma":[0.99814266,0.000577523,0.00019026146,0.00027009574,0.0005028822,0.0003165574],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076136284,0.00020947303,0.00030193443,0.0013856898,0.00014176306,0.00012235878,0.0005140271,0.00008559099,0.000027402508],"category_scores_gemma":[0.00018859151,0.00023329325,0.000102884645,0.0011591304,0.00005477856,0.00012842202,0.00007344828,0.00015703116,0.000024006973],"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.0000065748486,0.0000750214,0.00013970748,0.00002485869,0.000014309071,0.000003904864,0.0003280392,0.4489967,0.000028707409,0.40987885,0.00040028396,0.14010304],"study_design_scores_gemma":[0.0007528967,0.00019483124,0.005470729,0.000085150976,0.0000030529643,0.000011277058,0.00004773737,0.9718207,0.00015006859,0.020217687,0.0010159954,0.00022985134],"about_ca_topic_score_codex":0.0013514158,"about_ca_topic_score_gemma":0.0013426838,"teacher_disagreement_score":0.8003429,"about_ca_system_score_codex":0.0002366812,"about_ca_system_score_gemma":0.00084354123,"threshold_uncertainty_score":0.9513422},"labels":[],"label_agreement":null},{"id":"W2395375684","doi":"","title":"Basis Enumeration of Hyperplane Arrangements Up to Symmetries.","year":2012,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","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 New Brunswick","funders":"","keywords":"Polyhedron; Hyperplane; Invariant (physics); Symmetry group; Enumeration; Homogeneous space; Symmetry (geometry); Basis (linear algebra); Speedup; Group (periodic table); Mathematics; Computer science; Algebra over a field; Combinatorics; Pure mathematics; Parallel computing; Physics; Geometry","score_opus":0.08859729421388006,"score_gpt":0.33250410585268897,"score_spread":0.2439068116388089,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2395375684","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88163906,0.00006962576,0.093432166,0.0014662361,0.002990409,0.0010513369,0.00037011006,0.00010108743,0.01887995],"genre_scores_gemma":[0.9792854,0.0000015641355,0.019687552,0.00046075898,0.00012971122,0.0000230956,0.000048124926,0.00002463596,0.00033914423],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985714,0.000044065466,0.00036262066,0.00018512426,0.00045425183,0.00038253286],"domain_scores_gemma":[0.9979275,0.00068214897,0.00014767445,0.00025019178,0.0004781696,0.0005143491],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029824543,0.00017558262,0.0002786252,0.00066786096,0.000097322394,0.00003092837,0.0002148062,0.000082695275,0.0004444057],"category_scores_gemma":[0.0015853005,0.00018986248,0.000048037586,0.00070759683,0.00003570737,0.00015324543,0.00002817876,0.000121900695,0.00020888555],"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.000016188567,0.000087951834,0.00205092,0.00008374227,0.00005654813,0.0000017814971,0.00077686046,0.0004354334,0.00007498047,0.9861209,0.0053460323,0.0049486626],"study_design_scores_gemma":[0.0015283868,0.00041260998,0.011722468,0.00035451006,0.00010242869,0.00002062304,0.0012336733,0.002661636,0.0035770277,0.9680447,0.0093070455,0.0010349209],"about_ca_topic_score_codex":0.00057280913,"about_ca_topic_score_gemma":0.00058095594,"teacher_disagreement_score":0.09764633,"about_ca_system_score_codex":0.00024668756,"about_ca_system_score_gemma":0.00031367107,"threshold_uncertainty_score":0.77423674},"labels":[],"label_agreement":null},{"id":"W2395902960","doi":"","title":"Minimum many-to-many matchings for computing the distance between two sequences","year":2011,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Combinatorics; Theoretical computer science; Mathematics","score_opus":0.03947693002219832,"score_gpt":0.2458477516972585,"score_spread":0.20637082167506018,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2395902960","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.62449944,0.0000826194,0.35366386,0.0005416888,0.0009015723,0.0006595491,0.00041546015,0.00017391938,0.019061862],"genre_scores_gemma":[0.99719584,7.3716313e-7,0.0019296599,0.00046553655,0.00018050255,0.000031070667,0.00005130708,0.000027189926,0.00011817124],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99881333,0.00004016276,0.00027938624,0.0002547603,0.00018272347,0.00042961657],"domain_scores_gemma":[0.99897623,0.000328688,0.00005118799,0.00018571723,0.000120734025,0.0003374207],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033322608,0.00020017364,0.00020916341,0.00029152568,0.00029757564,0.00009951384,0.00045048047,0.00006066802,0.0000892998],"category_scores_gemma":[0.000031520074,0.00017829274,0.0000726136,0.00040010095,0.00007802052,0.000081161204,0.000015696649,0.00017398363,0.00011476591],"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.000017273222,0.000011498059,0.006990543,0.00011518734,0.00015369752,0.000015130379,0.0031640301,0.060718074,0.000036116464,0.9071828,0.0025398992,0.019055732],"study_design_scores_gemma":[0.001318371,0.000349773,0.12631944,0.0006767565,0.00008944491,0.000032994765,0.0032925059,0.49311712,0.00036437652,0.34579897,0.026668703,0.0019715696],"about_ca_topic_score_codex":0.0023174558,"about_ca_topic_score_gemma":0.0027149168,"teacher_disagreement_score":0.56138384,"about_ca_system_score_codex":0.0001112598,"about_ca_system_score_gemma":0.00014863268,"threshold_uncertainty_score":0.72705674},"labels":[],"label_agreement":null},{"id":"W2397167913","doi":"","title":"A Data Structure Supporting Exclusion Persistence Range Search.","year":2012,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Data Management and Algorithms","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 New Brunswick","funders":"","keywords":"Computer science; Set (abstract data type); Data structure; Range (aeronautics); Block (permutation group theory); Space (punctuation); Persistence (discontinuity); Range query (database); Algorithm; Web search query; Mathematics; Combinatorics; Information retrieval; Sargable; Search engine","score_opus":0.10867846574142782,"score_gpt":0.30237502488695656,"score_spread":0.19369655914552875,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397167913","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10683491,0.00036560587,0.8447862,0.014625936,0.0029944463,0.00091213355,0.0037163561,0.00037989108,0.025384465],"genre_scores_gemma":[0.96499735,0.0000046841997,0.03185187,0.0015335975,0.00024573976,0.000002412251,0.0010376904,0.00001037327,0.00031626862],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997895,0.00006508967,0.00022175715,0.00053681474,0.00057054544,0.00071081956],"domain_scores_gemma":[0.9981235,0.00010913296,0.000082217324,0.00087564654,0.00015185065,0.00065763306],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054928183,0.00018079417,0.00015270757,0.00055237755,0.00034125897,0.0004144161,0.0023309686,0.00006353254,0.0005012168],"category_scores_gemma":[0.00009855638,0.0001815995,0.000033839755,0.0007818026,0.00006373295,0.0017141553,0.0007170299,0.00023215094,0.00025015185],"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.000010400371,0.00012583708,0.019631723,0.00009553781,0.00011379878,0.00010640904,0.0014251734,0.0033770872,0.000046889032,0.5603988,0.042735122,0.3719332],"study_design_scores_gemma":[0.00047828635,0.00007464834,0.04704701,0.00006828555,0.000016080574,0.00003091839,0.00039608602,0.914767,0.000022794173,0.0049869022,0.031452548,0.00065941986],"about_ca_topic_score_codex":0.001974101,"about_ca_topic_score_gemma":0.0019808572,"teacher_disagreement_score":0.91138995,"about_ca_system_score_codex":0.0001360424,"about_ca_system_score_gemma":0.0005639555,"threshold_uncertainty_score":0.74054134},"labels":[],"label_agreement":null},{"id":"W2398258650","doi":"","title":"Time-Windowed Closest Pair","year":2015,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Algorithms and Data Compression","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":"Quadtree; Dimension (graph theory); Point (geometry); Interval (graph theory); Set (abstract data type); Computer science; Binary logarithm; Computational geometry; Data structure; Algorithm; Word (group theory); Combinatorics; Constant (computer programming); Mathematics; Theoretical computer science; Geometry","score_opus":0.04467829215851175,"score_gpt":0.25425152611678137,"score_spread":0.20957323395826963,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398258650","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05985162,0.00025843942,0.78900814,0.014616881,0.0022164544,0.0007208008,0.0003371208,0.0007081322,0.13228244],"genre_scores_gemma":[0.96418095,0.0000014492034,0.03108429,0.0029268053,0.00017619669,0.000011989799,0.00022277462,0.000014729592,0.0013808367],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99830765,0.000069855705,0.00021821377,0.00047536383,0.0005210848,0.00040786312],"domain_scores_gemma":[0.9978467,0.00013170158,0.00007507349,0.0004672437,0.00042183982,0.0010574049],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00025975687,0.00018734859,0.0001815843,0.0005108961,0.00017408401,0.00029731734,0.00097364513,0.000092592534,0.00021633906],"category_scores_gemma":[0.00011724177,0.00018388682,0.00004720045,0.00067662995,0.00007400011,0.0004497735,0.00013488454,0.00019439554,0.0022370883],"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.000023355013,0.00016653075,0.0017255646,0.000013994258,0.00006106327,0.00033701205,0.00056589424,0.03857445,0.000017479135,0.50041175,0.26659587,0.19150706],"study_design_scores_gemma":[0.00071611797,0.00020945416,0.008213755,0.00004880253,0.000003986155,0.00004293059,0.000051684947,0.876018,0.00002705336,0.04138005,0.07281667,0.00047151797],"about_ca_topic_score_codex":0.0026444343,"about_ca_topic_score_gemma":0.00063965435,"teacher_disagreement_score":0.9043293,"about_ca_system_score_codex":0.00021961724,"about_ca_system_score_gemma":0.00219008,"threshold_uncertainty_score":0.9985398},"labels":[],"label_agreement":null},{"id":"W2400087804","doi":"","title":"Range Counting with Distinct Constraints.","year":2015,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Data Management and Algorithms","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":"Range (aeronautics); Range query (database); Computer science; Counting problem; Point (geometry); Data structure; Combinatorics; Mathematics; Algorithm; Sargable; Information retrieval; Search engine; Web search query; Geometry","score_opus":0.04844032645569903,"score_gpt":0.24745062627455283,"score_spread":0.1990102998188538,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400087804","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012031257,0.00003226158,0.8584856,0.0047167246,0.0005283298,0.0002733343,0.00013718798,0.0001777949,0.123617545],"genre_scores_gemma":[0.97339344,6.068806e-7,0.02459796,0.001360385,0.00007451047,0.0000088032375,0.00012578254,0.00000881831,0.00042969355],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985668,0.00003222349,0.00015890162,0.00039458807,0.00047690736,0.00037059086],"domain_scores_gemma":[0.99866396,0.00008427436,0.00007303122,0.00028667922,0.00032566875,0.0005663552],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030661395,0.00016106093,0.00014441588,0.00042712304,0.00014230574,0.0004982778,0.0007395857,0.000037614474,0.0001201008],"category_scores_gemma":[0.00006824296,0.0001481586,0.000023475975,0.0006902129,0.00014602445,0.0004940023,0.000074362484,0.00013961669,0.00035794967],"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.000007934104,0.000035690995,0.0075650522,0.000012642739,0.000044967128,0.00024954331,0.00017315222,0.0028290018,3.5663484e-7,0.869772,0.0120115485,0.107298106],"study_design_scores_gemma":[0.0033621457,0.00059687864,0.076317996,0.00020217254,0.000028641429,0.00013903096,0.00059581245,0.7981681,0.000009061386,0.04970753,0.06931739,0.0015552135],"about_ca_topic_score_codex":0.0028454943,"about_ca_topic_score_gemma":0.004813608,"teacher_disagreement_score":0.9613622,"about_ca_system_score_codex":0.00015019397,"about_ca_system_score_gemma":0.0012391333,"threshold_uncertainty_score":0.60417324},"labels":[],"label_agreement":null},{"id":"W2400285273","doi":"","title":"Point Location in Well-Shaped Meshes Using Jump-and-Walk","year":2011,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","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":"Carleton University","funders":"","keywords":"Jump; Polygon mesh; Constant (computer programming); Point (geometry); Computer science; Nearest neighbour; Random walk; Algorithm; Statistical physics; Mathematics; Geometry; Physics; Artificial intelligence; Computer graphics (images); Statistics","score_opus":0.0670509323113462,"score_gpt":0.2543895345018169,"score_spread":0.1873386021904707,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400285273","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2902104,0.00018741761,0.69858485,0.0012292578,0.0005576595,0.00036635954,0.000013997022,0.00008702876,0.008763021],"genre_scores_gemma":[0.95506394,0.000008551696,0.043653704,0.0010285657,0.000058174635,0.000012747606,0.000046508332,0.000011241552,0.000116571115],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99825746,0.000097062424,0.00036783196,0.00055577664,0.00034000864,0.00038189138],"domain_scores_gemma":[0.9987621,0.00014078066,0.000110588415,0.00024215812,0.00036478188,0.0003796263],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036853246,0.00021546519,0.0002024028,0.0014507963,0.00019600725,0.00017096158,0.0004095136,0.00010739489,0.00021181461],"category_scores_gemma":[0.00008829308,0.0002444494,0.000040067865,0.0015640937,0.00006862556,0.0005528053,0.000072022594,0.00019968596,0.00011929703],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020845688,0.00011263178,0.0035064255,0.00003428975,0.0000333201,0.00007002508,0.0011004183,0.06270716,0.00011522165,0.8953838,0.00028547793,0.03663038],"study_design_scores_gemma":[0.00042665555,0.00011671193,0.07238744,0.000064041764,0.000005787767,0.000050217022,0.00009174801,0.8667737,0.00009443138,0.059265062,0.0003727841,0.0003513766],"about_ca_topic_score_codex":0.008669162,"about_ca_topic_score_gemma":0.0071904124,"teacher_disagreement_score":0.83611876,"about_ca_system_score_codex":0.0002583535,"about_ca_system_score_gemma":0.0011109608,"threshold_uncertainty_score":0.9979322},"labels":[],"label_agreement":null},{"id":"W2400709422","doi":"","title":"On the Inverse Beacon Attraction Region of a Point.","year":2015,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","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":"Queen's University","funders":"","keywords":"Attraction; Polygon (computer graphics); Monotone polygon; Simple polygon; Inverse; Trajectory; Boundary (topology); Obstacle; Mathematics; Regular polygon; Simple (philosophy); Point (geometry); Set (abstract data type); Combinatorics; Computer science; Topology (electrical circuits); Mathematical analysis; Physics; Geometry; Geography; Telecommunications","score_opus":0.0822544231741283,"score_gpt":0.26077276814147504,"score_spread":0.17851834496734675,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400709422","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28585413,0.000046418718,0.6579062,0.025398625,0.0015310305,0.0005718446,0.000033908364,0.00011310766,0.028544743],"genre_scores_gemma":[0.99248457,0.000002342252,0.0036256413,0.0033221007,0.000092620416,0.000015323725,0.00005511295,0.000008391578,0.00039392716],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99835885,0.00014351614,0.00029982737,0.00036730894,0.0005757867,0.00025471183],"domain_scores_gemma":[0.9978727,0.0005170832,0.00018090465,0.00035470398,0.0006781228,0.0003964661],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049892534,0.00017128082,0.00016067055,0.00075437414,0.00018009877,0.00009885368,0.00053182367,0.00008673,0.000064902386],"category_scores_gemma":[0.0003959999,0.0001469286,0.000074239244,0.001146816,0.000079902806,0.00032718116,0.000042182335,0.00022546355,0.00020051587],"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.00002012304,0.000050987255,0.000101225225,0.0000053344547,0.000021113417,0.00001926782,0.00024809106,0.14715838,0.00001685784,0.817206,0.025975462,0.009177138],"study_design_scores_gemma":[0.0008447626,0.00065058586,0.007836151,0.000094577954,0.00001183163,0.00009289053,0.00023796537,0.65907377,0.00038853058,0.32361627,0.0067150765,0.00043758837],"about_ca_topic_score_codex":0.0015320956,"about_ca_topic_score_gemma":0.0024966858,"teacher_disagreement_score":0.7066304,"about_ca_system_score_codex":0.00026085525,"about_ca_system_score_gemma":0.001577522,"threshold_uncertainty_score":0.5991575},"labels":[],"label_agreement":null},{"id":"W2400822338","doi":"","title":"Reconfiguring a Chain of Cubes.","year":2015,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Modular Robots and Swarm Intelligence","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; University of Manitoba; University of Waterloo","funders":"","keywords":"Chain (unit); Computer science; Physics","score_opus":0.05981796194493664,"score_gpt":0.2391147477118028,"score_spread":0.17929678576686617,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400822338","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.63486326,0.0005374833,0.16489846,0.0007464434,0.0015581114,0.00035571866,0.00018079403,0.00021300392,0.19664672],"genre_scores_gemma":[0.99839175,0.0000070066408,0.00120773,0.0001251781,0.000046626505,0.000004673347,0.000027768718,0.000014048661,0.00017524182],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99929,0.00001230522,0.00018323862,0.00012865954,0.00017974427,0.00020606899],"domain_scores_gemma":[0.9992627,0.000037513895,0.00002289576,0.000121979065,0.00017614594,0.00037875728],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012884733,0.000104391846,0.00013724455,0.00036887816,0.000026214913,0.000025759273,0.0001566496,0.000056929523,0.0003030932],"category_scores_gemma":[0.000048442926,0.00011554124,0.000028940294,0.00025904557,0.000034735775,0.000050158043,0.0000065304394,0.00011578969,0.00013403491],"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.0000027654473,0.000007472276,0.0003984376,0.000024583089,0.000023994216,0.000013636812,0.00022494068,0.9209637,0.000031589225,0.04634861,0.0021448866,0.029815376],"study_design_scores_gemma":[0.0002574037,0.00009058391,0.0034640979,0.00010110807,0.000005953197,0.000016496202,0.00024543944,0.97435176,0.0011879659,0.013469929,0.006450222,0.0003590471],"about_ca_topic_score_codex":0.0031672553,"about_ca_topic_score_gemma":0.0034028052,"teacher_disagreement_score":0.36352846,"about_ca_system_score_codex":0.00013077616,"about_ca_system_score_gemma":0.00036868962,"threshold_uncertainty_score":0.4787964},"labels":[],"label_agreement":null},{"id":"W2402228242","doi":"","title":"Drawing Plane Triangulations with Few Segments, pp. 40-45.","year":2014,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Mathematics Education and Teaching Techniques","field":"Social Sciences","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Computer science; Plane (geometry); Combinatorics; Geometry; Computer graphics (images); Artificial intelligence; Mathematics","score_opus":0.041766119435305275,"score_gpt":0.3143262654433295,"score_spread":0.2725601460080242,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402228242","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11042049,0.00003436574,0.35818607,0.017587345,0.0005919593,0.00083721057,0.000088780704,0.00046898302,0.5117848],"genre_scores_gemma":[0.98154753,0.0000039470074,0.016119465,0.0010935983,0.0001334659,0.000018299525,0.00010203391,0.000011529928,0.0009701106],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998817,0.00015014564,0.00016937823,0.00020663578,0.0003802639,0.00027655446],"domain_scores_gemma":[0.9988314,0.00034174437,0.00006600711,0.00015198298,0.00018915877,0.00041969056],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0006174995,0.00011198967,0.00013417186,0.00034088752,0.00069722714,0.00020823293,0.00023301784,0.00007745917,0.0012219261],"category_scores_gemma":[0.00031865927,0.00011094229,0.00002923867,0.00040370037,0.000120914905,0.00009833102,0.000008345136,0.00016496882,0.00012445089],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003939917,0.000029125718,0.001694929,0.000007834449,0.000014515495,0.0000015027194,0.002000245,0.0004229099,0.0000018559771,0.98441,0.0052661723,0.006147011],"study_design_scores_gemma":[0.0014936951,0.00036597808,0.048190866,0.0005345652,0.00006793449,0.000016839747,0.0057871817,0.02781236,0.00005836019,0.6017693,0.31240094,0.0015019774],"about_ca_topic_score_codex":0.022927683,"about_ca_topic_score_gemma":0.054841664,"teacher_disagreement_score":0.87112707,"about_ca_system_score_codex":0.00022203432,"about_ca_system_score_gemma":0.0013985962,"threshold_uncertainty_score":0.99969107},"labels":[],"label_agreement":null},{"id":"W2402614570","doi":"","title":"Open Problems from CCCG 2014.","year":2015,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"University of Victoria","funders":"","keywords":"Combinatorics; Vertex (graph theory); Upper and lower bounds; Conjecture; Discrete geometry; Mathematics; Partition (number theory); Computer science; Discrete mathematics; Graph","score_opus":0.0928333167172997,"score_gpt":0.28590306801585375,"score_spread":0.19306975129855403,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402614570","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024503142,0.00029726216,0.8936345,0.013706149,0.0019968536,0.0008068418,0.00023160467,0.00019963409,0.06462402],"genre_scores_gemma":[0.9388223,0.0000052243317,0.05520684,0.0040401095,0.00022517542,0.00004487338,0.0005217999,0.000015729343,0.0011179181],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977297,0.00012287193,0.0003478447,0.000734536,0.00063807087,0.0004269704],"domain_scores_gemma":[0.9973299,0.00021828475,0.00013315225,0.0004760727,0.00075193145,0.0010906897],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00049515447,0.00024243313,0.00024584561,0.00070002925,0.0002466797,0.0011763658,0.0020510424,0.0001130651,0.00034960482],"category_scores_gemma":[0.00015310163,0.00025960093,0.00005516252,0.0010526734,0.000052901083,0.00091795943,0.0003242716,0.00022192823,0.0016990709],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013278138,0.00009472049,0.0007466427,0.000005233506,0.000053078824,0.000040214552,0.00042674755,0.22169961,0.000023380491,0.6367389,0.09118531,0.048972867],"study_design_scores_gemma":[0.0012857916,0.00024588974,0.0094121,0.00005162103,0.000008316155,0.000022850163,0.000075097356,0.52186763,0.0000730062,0.3852757,0.081047274,0.0006347412],"about_ca_topic_score_codex":0.021460867,"about_ca_topic_score_gemma":0.011696311,"teacher_disagreement_score":0.9143192,"about_ca_system_score_codex":0.00035188688,"about_ca_system_score_gemma":0.0038744754,"threshold_uncertainty_score":0.99998564},"labels":[],"label_agreement":null},{"id":"W2402872817","doi":"","title":"Buttons & Scissors is NP-Complete.","year":2015,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Semantic Web and Ontologies","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science","score_opus":0.11160446627365601,"score_gpt":0.28406016141787976,"score_spread":0.17245569514422376,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402872817","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13601278,0.0004498897,0.59386134,0.09691078,0.0037954594,0.0006321824,0.0002702665,0.0007008094,0.1673665],"genre_scores_gemma":[0.96965486,0.000002426324,0.021177346,0.008401959,0.00008055364,0.000008822233,0.000025661839,0.000009381463,0.00063901057],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99815965,0.0000595039,0.00023697836,0.00050404994,0.0005254586,0.00051439035],"domain_scores_gemma":[0.99794644,0.00019726009,0.000074223746,0.00044773592,0.00046243667,0.0008718986],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00029724542,0.00019974603,0.00021929127,0.00070056244,0.00019252242,0.00035114418,0.0011262228,0.00009578742,0.00018621284],"category_scores_gemma":[0.00020376276,0.00020066866,0.000066091525,0.0008555123,0.00011789185,0.00028736403,0.000096550146,0.0001866346,0.0012796614],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000059167132,0.000041291405,0.0033784383,0.000007892029,0.000039852614,0.00011284535,0.00086762465,0.004379927,0.000007959818,0.8834636,0.08670353,0.020991087],"study_design_scores_gemma":[0.0013938888,0.0004428443,0.052640587,0.000075969256,0.000015891066,0.0001928383,0.00060243206,0.38567787,0.000116574876,0.41770247,0.13989595,0.0012426993],"about_ca_topic_score_codex":0.010714907,"about_ca_topic_score_gemma":0.006844671,"teacher_disagreement_score":0.83364207,"about_ca_system_score_codex":0.00022266313,"about_ca_system_score_gemma":0.0022654461,"threshold_uncertainty_score":0.99949795},"labels":[],"label_agreement":null},{"id":"W2403354906","doi":"","title":"A Fault Tolerant Data Structure for Peer-to-Peer Range Query Processing","year":2015,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Peer-to-Peer Network Technologies","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 New Brunswick","funders":"","keywords":"Computer science; Range query (database); Hash table; Hash function; Distributed hash table; Redundancy (engineering); Data structure; Fault tolerance; Query optimization; Theoretical computer science; Peer-to-peer; Distributed computing; Data mining; Web search query; Search engine; Sargable; Information retrieval","score_opus":0.11166072722308411,"score_gpt":0.3223953343659361,"score_spread":0.21073460714285197,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403354906","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025076287,0.000113390684,0.8858823,0.0836099,0.0010199201,0.00097252685,0.0015237166,0.00044683414,0.0013550831],"genre_scores_gemma":[0.7823908,3.0467666e-7,0.21049912,0.005616173,0.0001960024,0.00004829697,0.00046309936,0.000025248413,0.0007610002],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964159,0.000043973258,0.0003694176,0.0011133637,0.0012298218,0.0008275057],"domain_scores_gemma":[0.9949212,0.00019722218,0.0001131066,0.0011776376,0.0024043527,0.0011864702],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007157303,0.00034241143,0.00035788323,0.0011714952,0.00026477125,0.00078007474,0.0037044415,0.00020470437,0.000022384234],"category_scores_gemma":[0.0012169284,0.0003496305,0.0000453654,0.0018039097,0.00007509974,0.0005963068,0.0005311723,0.0003353289,0.00012462944],"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.0000528202,0.00005099495,0.0007643246,0.000052486215,0.00005939103,0.000088664005,0.0012537058,0.13859387,0.000026125776,0.07755492,0.42709592,0.3544068],"study_design_scores_gemma":[0.00083031406,0.00028946673,0.0034881984,0.00013484835,0.000013505496,0.000052443665,0.00027454062,0.79033315,0.000048085774,0.03407631,0.1696159,0.0008432722],"about_ca_topic_score_codex":0.0027070022,"about_ca_topic_score_gemma":0.016407384,"teacher_disagreement_score":0.75731444,"about_ca_system_score_codex":0.00044261065,"about_ca_system_score_gemma":0.0035358607,"threshold_uncertainty_score":0.9998956},"labels":[],"label_agreement":null},{"id":"W2404357874","doi":"","title":"A Faster 4-Approximation Algorithm for the Unit Disk Cover Problem","year":2015,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","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":"University of British Columbia; Carleton University","funders":"","keywords":"Approximation algorithm; Set cover problem; Cover (algebra); Plane (geometry); Simple (philosophy); Set (abstract data type); Unit (ring theory); Unit disk; Unit disk graph; Algorithm; Computer science; Computational geometry; Running time; Mathematics; Combinatorics; Mathematical optimization; Geometry","score_opus":0.0630496311394427,"score_gpt":0.27244246840386455,"score_spread":0.20939283726442184,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404357874","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007137588,0.00006347144,0.98638916,0.006389597,0.00056730723,0.0006434972,0.00008821809,0.000065450404,0.0050795227],"genre_scores_gemma":[0.67809886,0.0000042601855,0.3138973,0.0045630154,0.00035995903,0.00022984172,0.00039450545,0.000024053197,0.0024282213],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99826664,0.00007578091,0.00029287665,0.00044480708,0.00054422556,0.00037570155],"domain_scores_gemma":[0.99785405,0.00045754865,0.00012303234,0.0003090583,0.00079635176,0.0004599362],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055272866,0.00020723509,0.00015842378,0.00042854922,0.00035984832,0.00047121904,0.00067448127,0.000087625056,0.00010017817],"category_scores_gemma":[0.000114657465,0.00017471817,0.00007602723,0.001073011,0.000063923464,0.00046730417,0.000077111086,0.00016296428,0.0003498598],"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.000008881554,0.00004224957,0.000084690284,0.000008012109,0.000042768374,0.0000041120365,0.00030016687,0.30386975,0.0000034469533,0.30366984,0.020835895,0.37113017],"study_design_scores_gemma":[0.0005540722,0.0001306639,0.0012711888,0.000012899656,0.000009142154,0.000016288786,0.00004045095,0.8858624,0.00002195077,0.074736044,0.03712663,0.00021825168],"about_ca_topic_score_codex":0.0009097823,"about_ca_topic_score_gemma":0.00092060416,"teacher_disagreement_score":0.6773851,"about_ca_system_score_codex":0.00021632382,"about_ca_system_score_gemma":0.0016222985,"threshold_uncertainty_score":0.71248},"labels":[],"label_agreement":null},{"id":"W2404508046","doi":"","title":"xy-Monotone Path Existence Queries in a Rectilinear Environment.","year":2012,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","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":"Carleton University","funders":"","keywords":"Tree traversal; Monotone polygon; Disjoint sets; Path (computing); Tree (set theory); Combinatorics; Computer science; Time complexity; Range tree; Binary logarithm; Data structure; Preprocessor; Computational geometry; Binary tree; Mathematics; Discrete mathematics; Interval tree; Algorithm; Tree structure; Artificial intelligence","score_opus":0.03309736335871667,"score_gpt":0.24524503912596776,"score_spread":0.21214767576725108,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404508046","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33810678,0.0006902926,0.6362005,0.004572496,0.0015361448,0.00067636947,0.00008293177,0.0001724688,0.01796205],"genre_scores_gemma":[0.96255535,0.000024528812,0.03541685,0.0012984346,0.00016640392,0.000041998628,0.000091611946,0.000012272363,0.00039255657],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979327,0.000121381425,0.0003624403,0.00047699094,0.0004796553,0.0006268775],"domain_scores_gemma":[0.99862564,0.00023865445,0.0001036604,0.00033004343,0.00012079783,0.0005811926],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00048317597,0.00023646287,0.00021764121,0.0009587655,0.00020606481,0.00017240927,0.0005035554,0.00011023475,0.0002635272],"category_scores_gemma":[0.00011537695,0.00026526072,0.00006100718,0.0010730366,0.00007680284,0.0007497531,0.000080008525,0.00026361932,0.00047949498],"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.00001845621,0.00022376253,0.010731056,0.000020841006,0.000026637597,0.000040516352,0.0009474214,0.071546495,0.000097261945,0.8614641,0.0012279447,0.05365552],"study_design_scores_gemma":[0.0013240728,0.0003581201,0.32328084,0.00013303802,0.000011905736,0.00012594296,0.00029472198,0.56544137,0.0005104554,0.059784085,0.04728391,0.0014515329],"about_ca_topic_score_codex":0.0020890867,"about_ca_topic_score_gemma":0.0013972522,"teacher_disagreement_score":0.80168,"about_ca_system_score_codex":0.00039579847,"about_ca_system_score_gemma":0.00075396127,"threshold_uncertainty_score":0.99998},"labels":[],"label_agreement":null},{"id":"W2406062735","doi":"","title":"Edge Guards for Polyhedra in 3-Space.","year":2012,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Polyhedron; Enhanced Data Rates for GSM Evolution; Computer science; Space (punctuation); Combinatorics; Mathematics; Artificial intelligence; Operating system","score_opus":0.040380205080123924,"score_gpt":0.27861341975674936,"score_spread":0.23823321467662545,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406062735","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035975788,0.00026318725,0.9431136,0.0061164806,0.0015396748,0.00052173866,0.00010414049,0.00008653343,0.01227884],"genre_scores_gemma":[0.9579061,0.0000042042325,0.039324857,0.0017719055,0.00031738315,0.00006721346,0.0001743251,0.000013109446,0.00042088178],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981723,0.00008325228,0.00030647227,0.0004037936,0.0003542916,0.0006799203],"domain_scores_gemma":[0.99832684,0.00045356445,0.00008440738,0.00026156177,0.00029689012,0.0005767666],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006537775,0.00020811563,0.00020411347,0.0013243046,0.00020265077,0.0002375593,0.00051442644,0.000114892435,0.00013086693],"category_scores_gemma":[0.00021118553,0.00023444915,0.00008135151,0.0012795607,0.000038808725,0.00078148243,0.000048745456,0.00017262147,0.00016910651],"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.000006063865,0.000070417555,0.0015584506,0.000012298072,0.000012942284,0.0000036476747,0.00023286116,0.0243308,0.000030264433,0.9108747,0.0033949118,0.05947261],"study_design_scores_gemma":[0.0018576598,0.00031575732,0.20568737,0.00008797778,0.000011742638,0.000053113497,0.00013528719,0.60843146,0.0004173971,0.110064246,0.071788505,0.0011494618],"about_ca_topic_score_codex":0.0009806758,"about_ca_topic_score_gemma":0.00197949,"teacher_disagreement_score":0.9219303,"about_ca_system_score_codex":0.00034241448,"about_ca_system_score_gemma":0.0012188694,"threshold_uncertainty_score":0.95605594},"labels":[],"label_agreement":null},{"id":"W2406237833","doi":"","title":"Cuttings in 2D Revisited.","year":2014,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Subdivision; Cutting; Computer science; Construct (python library); Simple (philosophy); Plane (geometry); Combinatorics; Deterministic algorithm; Algorithm; Mathematics; Theoretical computer science; Programming language; Engineering; Geometry; Botany","score_opus":0.019307233064556575,"score_gpt":0.2428241013642129,"score_spread":0.22351686829965633,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406237833","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05809594,0.000085673004,0.8915812,0.010007054,0.000553369,0.00030451137,0.00002349806,0.00015008965,0.039198663],"genre_scores_gemma":[0.9700655,0.0000046457462,0.0239242,0.005435926,0.00014074534,0.00001411858,0.00009766662,0.000010093566,0.00030710286],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99812204,0.00012659557,0.00034630825,0.00055466656,0.00042369083,0.0004266824],"domain_scores_gemma":[0.99856794,0.000326212,0.00009310922,0.0003136092,0.00029214605,0.00040699146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057377235,0.00019544605,0.00020732901,0.0014443906,0.00017703408,0.00028064134,0.0006398066,0.00009531062,0.000107258136],"category_scores_gemma":[0.00024461863,0.00022007643,0.000057340596,0.001751549,0.000038786995,0.00035395275,0.000054008615,0.00024142499,0.0004178804],"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.0000031413965,0.00003024188,0.0011599016,0.000010803119,0.0000067839032,0.0000134892625,0.00009324906,0.07004137,0.000019448791,0.84634054,0.002832122,0.07944892],"study_design_scores_gemma":[0.00047468414,0.00011130283,0.044166014,0.00007382193,0.0000024766844,0.000022078224,0.000015242298,0.81756437,0.000046582543,0.10429593,0.032842875,0.00038463724],"about_ca_topic_score_codex":0.0014647328,"about_ca_topic_score_gemma":0.0023915803,"teacher_disagreement_score":0.91196954,"about_ca_system_score_codex":0.00022078968,"about_ca_system_score_gemma":0.0007233679,"threshold_uncertainty_score":0.8974456},"labels":[],"label_agreement":null},{"id":"W2406692538","doi":"","title":"One of Ferran Hurtado's favorite topics - Flips.","year":2015,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Point (geometry); World Wide Web; Information retrieval; Mathematics; Geometry","score_opus":0.10719563354728603,"score_gpt":0.3121231820828642,"score_spread":0.20492754853557818,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406692538","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06646449,0.00025231298,0.8456053,0.010755787,0.0010968474,0.0005626773,0.00013864435,0.00016937582,0.07495454],"genre_scores_gemma":[0.9633907,0.000003989866,0.035274453,0.00061053,0.00007703985,0.000007444983,0.000029736357,0.000010265232,0.0005958527],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981448,0.0000992228,0.00026828932,0.00038574202,0.000670493,0.00043144895],"domain_scores_gemma":[0.99770236,0.00016321904,0.00008775022,0.00046164912,0.000763344,0.0008216553],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039419287,0.00014614758,0.00022625372,0.00084944564,0.00010175141,0.00010577411,0.0010309896,0.00008451925,0.00012569928],"category_scores_gemma":[0.00023623025,0.00017015827,0.000056541434,0.0011465304,0.00015014719,0.0002981481,0.00010152251,0.00025242523,0.00013282167],"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.000009174875,0.000038352497,0.00069222425,0.000011321321,0.000021172465,0.000016738939,0.00022812467,0.006808224,0.000016830436,0.94517255,0.0005491551,0.04643614],"study_design_scores_gemma":[0.0009351435,0.00041732672,0.013668176,0.000081195576,0.0000057719235,0.000015819971,0.0001782091,0.10878829,0.00032774624,0.8674507,0.007647311,0.00048428506],"about_ca_topic_score_codex":0.0025388517,"about_ca_topic_score_gemma":0.002936722,"teacher_disagreement_score":0.89692616,"about_ca_system_score_codex":0.00020987954,"about_ca_system_score_gemma":0.0020553456,"threshold_uncertainty_score":0.69388527},"labels":[],"label_agreement":null},{"id":"W2407224220","doi":"","title":"An Algorithm for the Maximum Weight Independent Set Problem onOutersting Graphs.","year":2015,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Maximal independent set; Computer science; Independent set; Algorithm; Set (abstract data type); Theoretical computer science; Chordal graph; Graph; 1-planar graph","score_opus":0.055230565297083936,"score_gpt":0.2744272080274784,"score_spread":0.21919664273039446,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407224220","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00047338527,0.000043113818,0.99150187,0.0038152572,0.00079887785,0.0005129997,0.0002466888,0.000096439646,0.0025113714],"genre_scores_gemma":[0.561831,0.0000078363055,0.43187454,0.004465511,0.000361609,0.00014881857,0.00078891555,0.000032383006,0.000489389],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981269,0.000055030298,0.00024925443,0.0005479617,0.0005200462,0.00050079136],"domain_scores_gemma":[0.99820983,0.00018747794,0.00010937126,0.000491502,0.00038765543,0.00061414216],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006863712,0.00020917077,0.00015717154,0.00054343825,0.00036507475,0.0008638529,0.0016735806,0.00006569953,0.000031641994],"category_scores_gemma":[0.00003216862,0.00017436894,0.000060324524,0.0007107927,0.00006879748,0.00075136084,0.00011840318,0.00018395032,0.000082247774],"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.0000032873536,0.000037111204,0.00020878465,0.000007866164,0.000055121818,0.000024781717,0.0003134979,0.0067963027,5.2529003e-7,0.31121853,0.009789882,0.6715443],"study_design_scores_gemma":[0.00051290024,0.00017952391,0.0011630725,0.000017552993,0.000009954883,0.000010256326,0.00022994899,0.8734124,0.000004057282,0.10488508,0.019307066,0.0002682447],"about_ca_topic_score_codex":0.004165195,"about_ca_topic_score_gemma":0.0031923575,"teacher_disagreement_score":0.8666161,"about_ca_system_score_codex":0.00017266524,"about_ca_system_score_gemma":0.00095519394,"threshold_uncertainty_score":0.8330153},"labels":[],"label_agreement":null},{"id":"W2407655771","doi":"","title":"Kinetic Data Structures on The Move.","year":2013,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Advanced Database Systems and Queries","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Kinetic energy; Computer science; Physics; Classical mechanics","score_opus":0.05671062729089524,"score_gpt":0.2630991015320934,"score_spread":0.2063884742411982,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407655771","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03802054,0.00013975288,0.8979503,0.031621788,0.0013790028,0.0009483229,0.0010245682,0.00017633903,0.028739389],"genre_scores_gemma":[0.97613984,0.0000030193494,0.017622277,0.0055647357,0.000104621984,0.000022883554,0.00021419296,0.000009360088,0.00031907644],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985616,0.00006440097,0.00019247993,0.00048523338,0.0003653092,0.00033093712],"domain_scores_gemma":[0.99792236,0.0003549796,0.0000759031,0.0011581836,0.00019139219,0.0002972092],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001391042,0.00016936482,0.0001363204,0.00024945993,0.0002763123,0.0002682371,0.0014277621,0.000046295176,0.00069543486],"category_scores_gemma":[0.00016544625,0.00012032838,0.000023865125,0.00044322354,0.00009166981,0.00046047868,0.00019036305,0.0002029218,0.00075056206],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.093443e-7,0.000005422549,0.00006443885,0.0000036690087,0.000009747608,0.00000683968,0.000034326684,0.0036283652,0.0000057773505,0.95922744,0.018280527,0.018732725],"study_design_scores_gemma":[0.00037330578,0.00016893208,0.09449379,0.00011328115,0.0000057835364,0.000044417447,0.00024858877,0.525464,0.000060188115,0.21992064,0.15834317,0.0007639474],"about_ca_topic_score_codex":0.013778548,"about_ca_topic_score_gemma":0.0037172355,"teacher_disagreement_score":0.9381193,"about_ca_system_score_codex":0.00007089903,"about_ca_system_score_gemma":0.0005649413,"threshold_uncertainty_score":0.9927888},"labels":[],"label_agreement":null},{"id":"W2415869271","doi":"","title":"Drawing the Horton Set in an Integer Grid of Minimun Size.","year":2014,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Set (abstract data type); Integer (computer science); Grid; Mathematics; Geometry; Programming language","score_opus":0.017186325880671184,"score_gpt":0.22372259275893402,"score_spread":0.20653626687826285,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2415869271","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9884331,0.000035918856,0.0018121275,0.00016572485,0.0004715966,0.000110079745,0.000056457066,0.000030287767,0.008884708],"genre_scores_gemma":[0.99956274,0.0000012234749,0.000078888035,0.00018845404,0.00007662247,0.000008678896,0.000039189392,0.000012968228,0.000031229283],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99921626,0.00008433759,0.00021883244,0.00013342092,0.00014057785,0.00020658565],"domain_scores_gemma":[0.99922156,0.00035238403,0.00003076977,0.00017057135,0.000072718736,0.00015199187],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032343707,0.00011343769,0.00015307197,0.0003111345,0.00005323793,0.0000398212,0.0002315602,0.00006518105,0.0001572093],"category_scores_gemma":[0.00007383054,0.00010038512,0.00003636956,0.00037333713,0.00005937119,0.000072773335,0.00000684287,0.00017367763,0.000028430808],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019837898,0.000030312704,0.018703403,0.00012504641,0.000059949652,0.000014524253,0.0023606524,0.69424176,0.00034780792,0.26329902,0.0014633635,0.01933434],"study_design_scores_gemma":[0.00064951734,0.00019538759,0.18666661,0.00030601225,0.000013482225,0.000016152908,0.0017750541,0.7679946,0.0003140538,0.035412755,0.006084619,0.0005717629],"about_ca_topic_score_codex":0.0026787983,"about_ca_topic_score_gemma":0.020107858,"teacher_disagreement_score":0.22788626,"about_ca_system_score_codex":0.000059795748,"about_ca_system_score_gemma":0.00011707428,"threshold_uncertainty_score":0.99777263},"labels":[],"label_agreement":null},{"id":"W2604600966","doi":"","title":"Progressive Alignment of Shapes.","year":2016,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Modular Robots and Swarm Intelligence","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science","score_opus":0.024157655208773422,"score_gpt":0.23140245207314525,"score_spread":0.20724479686437183,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2604600966","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45674717,0.0006792528,0.48905492,0.0025778208,0.0010147669,0.00067622523,0.0006050899,0.0002338241,0.04841094],"genre_scores_gemma":[0.9988113,0.0000108863915,0.0008626201,0.00009809155,0.00003258814,0.000009649607,0.000009591194,0.0000118748785,0.00015338858],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99930644,0.000009175801,0.00016372111,0.00013451508,0.00018285411,0.00020327205],"domain_scores_gemma":[0.99949,0.000059910504,0.000026694519,0.000091081696,0.00011955904,0.00021275894],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00005264883,0.000100984544,0.00011322445,0.00023347585,0.000029561752,0.000015574704,0.00014859518,0.000047158217,0.0014673735],"category_scores_gemma":[0.00002181718,0.00007882565,0.00003079983,0.00015223432,0.000055598204,0.0000460797,0.000007672948,0.00004772603,0.00015055813],"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.000009793241,0.000038889117,0.0015383965,0.00007696854,0.00014226392,0.0000865855,0.00020361062,0.17634647,0.0011869891,0.33140072,0.00556453,0.4834048],"study_design_scores_gemma":[0.0023462812,0.00096306903,0.10720269,0.002160155,0.00006697036,0.00013182082,0.00040254885,0.6930602,0.031255852,0.12405982,0.035233807,0.0031167862],"about_ca_topic_score_codex":0.00040496458,"about_ca_topic_score_gemma":0.0005306859,"teacher_disagreement_score":0.54206413,"about_ca_system_score_codex":0.00012226983,"about_ca_system_score_gemma":0.00018216453,"threshold_uncertainty_score":0.99944544},"labels":[],"label_agreement":null},{"id":"W2604739239","doi":"","title":"Rectangle-of-influence triangulations.","year":2016,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba; Carleton University; University of Waterloo","funders":"","keywords":"Rectangle; Computer science; Combinatorics; Parallel computing; Mathematics; Geometry","score_opus":0.025373454355276704,"score_gpt":0.24724990706608185,"score_spread":0.22187645271080514,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2604739239","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14118649,0.00006889435,0.8424314,0.00780782,0.00052134093,0.00025356706,0.00008664648,0.000105040395,0.00753875],"genre_scores_gemma":[0.9753626,0.000007119755,0.02327607,0.0006946088,0.000070007656,0.000014836697,0.000024745026,0.000008719037,0.00054127077],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982933,0.000084830775,0.00038643437,0.00044354697,0.0004718899,0.0003200247],"domain_scores_gemma":[0.9978746,0.0005411959,0.00015890042,0.00036266804,0.0006962512,0.00036634807],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030214965,0.00017325411,0.00019520069,0.00105777,0.00016717498,0.00009219385,0.00062894606,0.00008833569,0.00024425302],"category_scores_gemma":[0.00033607456,0.00014481184,0.00008135487,0.0013225212,0.000084696076,0.0004923807,0.00004857601,0.000086331595,0.00024690139],"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.0000096499725,0.000032536016,0.00077144755,0.0000071508507,0.000023778664,0.000010145195,0.0000667812,0.024825573,0.00063607853,0.8377141,0.0011762884,0.1347265],"study_design_scores_gemma":[0.0032265112,0.00077883207,0.24272294,0.00045321858,0.000026083699,0.00010847976,0.000047364236,0.20832247,0.004750227,0.51400524,0.023990149,0.0015684762],"about_ca_topic_score_codex":0.000678711,"about_ca_topic_score_gemma":0.00089036376,"teacher_disagreement_score":0.8341761,"about_ca_system_score_codex":0.00019299402,"about_ca_system_score_gemma":0.0014540222,"threshold_uncertainty_score":0.5905255},"labels":[],"label_agreement":null},{"id":"W2604824923","doi":"","title":"The Length of the Beacon Attraction Trajectory.","year":2016,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Underwater Vehicles and Communication Systems","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Trajectory; Attraction; Computer science; Physics; Astronomy","score_opus":0.023765716120903176,"score_gpt":0.20962495383306856,"score_spread":0.1858592377121654,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2604824923","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9362229,0.00037521785,0.026857616,0.010361784,0.0009870064,0.0004498516,0.0001513625,0.00012755644,0.024466667],"genre_scores_gemma":[0.99940807,0.000025663574,0.00006779414,0.000084458756,0.000036518875,0.000009700503,0.0000033597842,0.000009596442,0.00035483664],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99939734,0.000043782988,0.00017241493,0.00007853425,0.00016097788,0.00014696662],"domain_scores_gemma":[0.9993038,0.00023053361,0.00004269162,0.00023202157,0.00010568509,0.00008525134],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012586401,0.00007544541,0.000071159724,0.00008316865,0.00017176058,0.0000359098,0.0003114583,0.00004308314,0.00006290687],"category_scores_gemma":[0.000009013808,0.000040488758,0.000043814453,0.00017334122,0.000072619936,0.00005201849,0.000010467828,0.00009135345,0.000046186145],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023474242,0.00004540745,0.009849538,0.000065572436,0.00031627328,0.0000022797178,0.000696373,0.05513185,0.0121479025,0.15018028,0.0075145396,0.7640265],"study_design_scores_gemma":[0.0013907495,0.00014448777,0.48394874,0.000501261,0.000035303627,0.000033331326,0.0009958354,0.052230764,0.014180324,0.021201564,0.42449388,0.00084374734],"about_ca_topic_score_codex":0.0011567571,"about_ca_topic_score_gemma":0.00921488,"teacher_disagreement_score":0.76318276,"about_ca_system_score_codex":0.00013789216,"about_ca_system_score_gemma":0.00017681468,"threshold_uncertainty_score":0.51421195},"labels":[],"label_agreement":null},{"id":"W2605132714","doi":"","title":"Geometric Unique Set Cover on Unit Disks and Unit Squares.","year":2016,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Unit (ring theory); Cover (algebra); Set cover problem; Set (abstract data type); Computer science; Mathematics; Engineering; Programming language","score_opus":0.0533389688352964,"score_gpt":0.273573053030554,"score_spread":0.2202340841952576,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2605132714","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23663244,0.00011932015,0.73656595,0.0120872585,0.0007890305,0.00047590616,0.00037547376,0.00019461,0.012760002],"genre_scores_gemma":[0.99154574,0.00003326597,0.0033695216,0.0028929983,0.00012619945,0.00002298323,0.00012324704,0.000019627932,0.0018664243],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99753404,0.00015738107,0.00035619581,0.0007627724,0.00064786634,0.0005417615],"domain_scores_gemma":[0.9970563,0.0010536836,0.00013669243,0.00043456547,0.00052996824,0.0007887806],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00039729537,0.00032786405,0.00025990774,0.0024937473,0.000376182,0.0003453092,0.0006540475,0.00015457219,0.0004320887],"category_scores_gemma":[0.00030496137,0.0002776334,0.00006771616,0.0024789132,0.00012722836,0.00048749568,0.00010733858,0.00023661985,0.0006159574],"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.000025225312,0.000063863066,0.0031588036,0.000017266413,0.000051519695,0.000056240424,0.00012890514,0.01847089,0.00005578716,0.8309563,0.004207767,0.14280745],"study_design_scores_gemma":[0.004290019,0.0018725751,0.4275443,0.00050788355,0.000038572114,0.00019328856,0.0000897734,0.21988024,0.001093723,0.20274778,0.13914551,0.002596332],"about_ca_topic_score_codex":0.0010638387,"about_ca_topic_score_gemma":0.00118686,"teacher_disagreement_score":0.7549133,"about_ca_system_score_codex":0.00022338887,"about_ca_system_score_gemma":0.001326506,"threshold_uncertainty_score":0.9999676},"labels":[],"label_agreement":null},{"id":"W2605171502","doi":"","title":"On the Biplanar Crossing Number of K n .","year":2016,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Crossing number (knot theory); Computer science; Physics; Materials science; Composite material","score_opus":0.03215945695421688,"score_gpt":0.26548581645001285,"score_spread":0.23332635949579597,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2605171502","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30181727,0.000021659218,0.65870136,0.020942831,0.00066988997,0.00023135223,0.00010112171,0.00006595681,0.017448558],"genre_scores_gemma":[0.99187857,0.0000017428397,0.0045657447,0.0029482779,0.00007062188,0.000009714173,0.000011651578,0.000007770443,0.0005058846],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99851656,0.00009027173,0.0002705706,0.00035144654,0.00048176348,0.00028940948],"domain_scores_gemma":[0.99780583,0.0011275202,0.00012564861,0.0003385937,0.00037019842,0.00023218185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003295613,0.00015692426,0.00014380085,0.00040670138,0.00035139997,0.00021442825,0.00063773466,0.000064677966,0.0005979719],"category_scores_gemma":[0.00024625292,0.00010065787,0.00006935134,0.00085257785,0.00015169539,0.00020991545,0.000043048254,0.00010961129,0.0005030838],"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.0000061937267,0.00002216095,0.00042232132,0.000003244375,0.000016674356,0.000005997563,0.00006171193,0.0057930914,0.000083622595,0.9595612,0.0038181348,0.0302056],"study_design_scores_gemma":[0.0011319771,0.00031144446,0.044859316,0.0003408576,0.000010831249,0.00007596701,0.000046864683,0.123899944,0.0018934351,0.80708456,0.019578839,0.0007659932],"about_ca_topic_score_codex":0.00058288145,"about_ca_topic_score_gemma":0.00056292675,"teacher_disagreement_score":0.69006133,"about_ca_system_score_codex":0.00013522732,"about_ca_system_score_gemma":0.0012476065,"threshold_uncertainty_score":0.6547373},"labels":[],"label_agreement":null},{"id":"W2782677994","doi":"","title":"Minimum Enclosing Circle Problem with Base Point.","year":2017,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Base (topology); Point (geometry); Computer science; Mathematical optimization; Mathematics; Geometry; Mathematical analysis","score_opus":0.027865243042939393,"score_gpt":0.24974887250867842,"score_spread":0.22188362946573903,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2782677994","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09519035,0.000053898886,0.8360949,0.015361138,0.0006988503,0.00053416373,0.00006876438,0.00016773549,0.05183019],"genre_scores_gemma":[0.93548894,0.000002670601,0.062130127,0.0015831171,0.00014803783,0.000023191214,0.000073249386,0.00001574319,0.0005349259],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979016,0.000059498943,0.00027709606,0.0006869206,0.00057768286,0.0004971979],"domain_scores_gemma":[0.9976606,0.00016737627,0.00023398008,0.00074869004,0.00057303545,0.00061635085],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00033629307,0.00024325371,0.00021687675,0.0007094797,0.0013134917,0.0013489918,0.001210693,0.00009208693,0.00018672597],"category_scores_gemma":[0.000121735764,0.00025656345,0.0000635592,0.000458282,0.00013626531,0.0009894999,0.0001135064,0.00023571467,0.00024104139],"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.000033643308,0.00013315606,0.002049792,0.000042805357,0.00009024938,0.00024936133,0.00037010186,0.08992102,0.00016818965,0.7277209,0.0052682115,0.17395255],"study_design_scores_gemma":[0.0021548453,0.0007162629,0.12257214,0.0003141954,0.000026279768,0.00022869736,0.00010849676,0.7178617,0.000725578,0.14764833,0.0062056584,0.001437803],"about_ca_topic_score_codex":0.0025212746,"about_ca_topic_score_gemma":0.004542531,"teacher_disagreement_score":0.8402986,"about_ca_system_score_codex":0.00020417738,"about_ca_system_score_gemma":0.001989332,"threshold_uncertainty_score":0.9999887},"labels":[],"label_agreement":null},{"id":"W2783071455","doi":"","title":"Interference Minimization in k-Connected Wireless Networks.","year":2017,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Interference (communication); Computer science; Minification; Wireless; Wireless network; Computer network; Telecommunications","score_opus":0.026078376337796652,"score_gpt":0.253558978571153,"score_spread":0.22748060223335637,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2783071455","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.062282525,0.00005084425,0.9143252,0.0047779256,0.0013962714,0.00043071972,0.00002005421,0.00012325661,0.01659324],"genre_scores_gemma":[0.9945579,0.000014679112,0.0039659766,0.0011027373,0.000112394104,0.000033917935,0.00005059333,0.000015335756,0.0001464424],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980398,0.00008989097,0.00035213793,0.00065226207,0.00028946585,0.0005764603],"domain_scores_gemma":[0.99788576,0.00022866373,0.00022841677,0.00090887316,0.00030015234,0.00044812937],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000254553,0.0002385294,0.00026520848,0.00061041006,0.00044215532,0.0009246489,0.0020846087,0.00016426666,0.00015485355],"category_scores_gemma":[0.00017246019,0.0002715452,0.00005065284,0.0005309239,0.00012984968,0.0006459322,0.0001880297,0.00036864865,0.000111776295],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013098954,0.00004950463,0.012325589,0.000009628304,0.00002148906,0.00013660762,0.00016136211,0.24762517,0.000003530604,0.61143696,0.0023017959,0.12591526],"study_design_scores_gemma":[0.00037711722,0.000052390802,0.106701806,0.0001070903,0.000001824876,0.000008602507,0.000013154719,0.88311464,0.0000063524967,0.008968961,0.00036839768,0.0002796535],"about_ca_topic_score_codex":0.0077557056,"about_ca_topic_score_gemma":0.054325704,"teacher_disagreement_score":0.9322754,"about_ca_system_score_codex":0.00029569722,"about_ca_system_score_gemma":0.0009428901,"threshold_uncertainty_score":0.99997365},"labels":[],"label_agreement":null},{"id":"W2783114890","doi":"","title":"On the Planar Spherical Depth and Lens Depth.","year":2017,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Planar; Lens (geology); Optics; Depth of field; Computer science; Physics; Computer graphics (images)","score_opus":0.05594521687350084,"score_gpt":0.2681369403757105,"score_spread":0.21219172350220966,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2783114890","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25114667,0.00013522983,0.58151597,0.06628684,0.0015564793,0.00066042045,0.000088397246,0.00015362374,0.09845636],"genre_scores_gemma":[0.9867525,0.000009654549,0.0073728235,0.0052895867,0.00013304473,0.0000156833,0.000030877203,0.000009786072,0.00038603408],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99840164,0.000079342324,0.00020418229,0.0005043012,0.0004525812,0.0003579618],"domain_scores_gemma":[0.99813926,0.0005729819,0.00013763775,0.00058059103,0.00021240335,0.00035714245],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00030116132,0.00020715779,0.00016495022,0.00027778605,0.001358183,0.00097262755,0.0009913583,0.00008668445,0.00010422848],"category_scores_gemma":[0.00035959051,0.0001713992,0.000053364456,0.00026333125,0.00016344235,0.00036793537,0.00008406965,0.00026724706,0.00022534085],"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.000007063607,0.000022540256,0.00093695865,0.000003774461,0.000022045035,0.000033106124,0.00006911867,0.007595807,0.000010422908,0.94946134,0.0053429524,0.03649489],"study_design_scores_gemma":[0.00066356204,0.00034291137,0.35942993,0.000072351846,0.000011070292,0.00008376634,0.000050752755,0.40506753,0.00010191198,0.21892323,0.014633054,0.0006199228],"about_ca_topic_score_codex":0.0019426988,"about_ca_topic_score_gemma":0.010347905,"teacher_disagreement_score":0.73560584,"about_ca_system_score_codex":0.00010989683,"about_ca_system_score_gemma":0.0007396516,"threshold_uncertainty_score":0.9999419},"labels":[],"label_agreement":null},{"id":"W2783355325","doi":"","title":"Upward Order-Preserving 8-Grid-Drawings of Binary Trees.","year":2017,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Binary number; Binary tree; Grid; Computer graphics (images); Algorithm; Mathematics; Geometry; Arithmetic","score_opus":0.05160737549822516,"score_gpt":0.31323921461039234,"score_spread":0.2616318391121672,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2783355325","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51513314,0.00026792844,0.37580022,0.023419717,0.0021073557,0.00093676936,0.0003423099,0.0002607056,0.08173184],"genre_scores_gemma":[0.9791776,0.000008869372,0.019843005,0.00037566715,0.000070335984,0.000012301993,0.000022108132,0.000015951822,0.00047419532],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99786747,0.00008426868,0.00029670648,0.0005513511,0.0006306253,0.00056956575],"domain_scores_gemma":[0.99689925,0.00034050664,0.00016955126,0.001227229,0.000791365,0.0005720935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044684243,0.00020702505,0.00027528754,0.0010072542,0.0007515569,0.00041164528,0.0032716547,0.00010035788,0.000247872],"category_scores_gemma":[0.0007223852,0.00022227255,0.00008429413,0.0006771045,0.00035349818,0.0007895364,0.00043607285,0.00031594632,0.00012064952],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027714053,0.0000656253,0.0076315054,0.000048428203,0.00006623141,0.0001516486,0.00029925012,0.030970154,0.00047481002,0.9227329,0.0029782061,0.03455353],"study_design_scores_gemma":[0.0011887836,0.0004305634,0.26741403,0.00028091617,0.000009170964,0.000031230204,0.00013579038,0.41045904,0.00071080547,0.31310773,0.005394885,0.0008370402],"about_ca_topic_score_codex":0.007399025,"about_ca_topic_score_gemma":0.0067672366,"teacher_disagreement_score":0.60962516,"about_ca_system_score_codex":0.00014981654,"about_ca_system_score_gemma":0.0017643902,"threshold_uncertainty_score":0.9992108},"labels":[],"label_agreement":null},{"id":"W2783721252","doi":"","title":"Packing Boundary-Anchored Rectangles.","year":2017,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba; Carleton University; University of Waterloo","funders":"","keywords":"Computer science; Boundary (topology); Mathematics","score_opus":0.032501644865725335,"score_gpt":0.2521070399376369,"score_spread":0.21960539507191157,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2783721252","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24417792,0.0006161429,0.12212721,0.002873222,0.0026739724,0.0007602264,0.0005397443,0.001528736,0.6247028],"genre_scores_gemma":[0.9969712,0.000018400548,0.0023310971,0.00025918373,0.00012864808,0.0000137870575,0.000053023214,0.00002708604,0.00019759154],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99915797,0.000011687006,0.00014727289,0.00019179969,0.00017623947,0.00031504693],"domain_scores_gemma":[0.9991783,0.000043478234,0.00004198928,0.00032430538,0.00011072059,0.00030120806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000110462446,0.0001543964,0.00015109917,0.00034196503,0.00044616687,0.00044018,0.0003807525,0.00010488646,0.00033904702],"category_scores_gemma":[0.00007392006,0.0001764213,0.000045879548,0.00010145179,0.00009121789,0.000170391,0.000015602169,0.00020932616,0.00016823747],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017136477,0.000039098537,0.009891798,0.00012860274,0.00023020366,0.0003587259,0.0004452628,0.023032732,0.0008249695,0.18961756,0.09689086,0.67852306],"study_design_scores_gemma":[0.0013521529,0.00029097687,0.23432434,0.0006125451,0.000044940927,0.000084596795,0.00016942769,0.41670993,0.0027420847,0.19060428,0.15057346,0.0024912662],"about_ca_topic_score_codex":0.0024445057,"about_ca_topic_score_gemma":0.007613354,"teacher_disagreement_score":0.75279325,"about_ca_system_score_codex":0.00022840998,"about_ca_system_score_gemma":0.00030994375,"threshold_uncertainty_score":0.71942514},"labels":[],"label_agreement":null},{"id":"W2908455634","doi":"","title":"Emanation Graph: A New t-Spanner.","year":2018,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Spanner; Computer science; Graph; Theoretical computer science; Distributed computing","score_opus":0.033883652390772644,"score_gpt":0.26529704014268607,"score_spread":0.23141338775191342,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2908455634","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0044887746,0.000043982873,0.9725305,0.004912164,0.0008659666,0.00014308299,0.000040440984,0.00012639302,0.01684872],"genre_scores_gemma":[0.9366968,0.0000046659306,0.058854476,0.0029853412,0.00040991136,0.0000056146405,0.00010611845,0.000010904643,0.00092611555],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984584,0.000038815175,0.00020692241,0.00049236824,0.00042556744,0.00037796807],"domain_scores_gemma":[0.99834806,0.00008552333,0.00008102103,0.00041803264,0.0003918731,0.0006754659],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00015143296,0.00016922907,0.00013891567,0.00079088355,0.00033398694,0.00034816194,0.00087463186,0.00008592582,0.00045027645],"category_scores_gemma":[0.00006404268,0.00016910555,0.000048208585,0.0010447707,0.00008207973,0.0004918982,0.00009706984,0.00014978525,0.00081522414],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000048928473,0.00002363071,0.00017249912,0.0000036768693,0.000018001918,0.000020960495,0.00019450788,0.0012931362,0.000014191921,0.770586,0.058601823,0.16906667],"study_design_scores_gemma":[0.0006496257,0.00035764757,0.02636839,0.000085816595,0.0000062387726,0.00003451479,0.000041864158,0.6625692,0.000105598374,0.24766357,0.061529092,0.0005884013],"about_ca_topic_score_codex":0.011259247,"about_ca_topic_score_gemma":0.009362139,"teacher_disagreement_score":0.93220806,"about_ca_system_score_codex":0.000123846,"about_ca_system_score_gemma":0.0014636066,"threshold_uncertainty_score":0.99996275},"labels":[],"label_agreement":null},{"id":"W2943430289","doi":"","title":"Weighted Minimum Backward Frechet Distance.","year":2015,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","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":"Carleton University","funders":"","keywords":"Computer science; Mathematics","score_opus":0.054461784248001716,"score_gpt":0.26468968030747553,"score_spread":0.2102278960594738,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2943430289","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018820735,0.00017593002,0.93244606,0.0078068376,0.001603395,0.0002778263,0.000096487944,0.00019823197,0.038574494],"genre_scores_gemma":[0.9475096,0.0000048164097,0.04787244,0.0027131655,0.00023646063,0.00002340052,0.00029315386,0.000015969239,0.0013309818],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975825,0.00011972413,0.00036938794,0.00065262546,0.0007600853,0.00051569915],"domain_scores_gemma":[0.9971826,0.00022145624,0.00012122797,0.0004210133,0.00087617757,0.0011775226],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00043732402,0.00027423122,0.00024573866,0.00096313044,0.00023303003,0.00040749635,0.0008567117,0.00013623257,0.00018742317],"category_scores_gemma":[0.00016574403,0.00029471674,0.00008323672,0.0017084328,0.000074547264,0.00050979515,0.00008239299,0.00025552584,0.00094223523],"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.000016813998,0.00007285745,0.00042124436,0.000009322402,0.000038591308,0.00006393095,0.00029174358,0.030637234,0.00001363782,0.8893742,0.03977151,0.0392889],"study_design_scores_gemma":[0.0010282111,0.00025686444,0.0036723823,0.000043244316,0.00000865927,0.000052994503,0.00011649413,0.72234124,0.00011927214,0.19442363,0.07725434,0.0006826916],"about_ca_topic_score_codex":0.0010482811,"about_ca_topic_score_gemma":0.0027522333,"teacher_disagreement_score":0.9286889,"about_ca_system_score_codex":0.0004631177,"about_ca_system_score_gemma":0.0031347086,"threshold_uncertainty_score":0.99995047},"labels":[],"label_agreement":null},{"id":"W2962742438","doi":"","title":"Square Formation by Asynchronous Oblivious Robots.","year":2016,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Optimization and Search Problems","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":"Robot; Computer science; Asynchronous communication; Correctness; Mobile robot; Square (algebra); Theoretical computer science; Degenerate energy levels; Algorithm; Mathematics; Artificial intelligence; Geometry; Physics","score_opus":0.02441196527484058,"score_gpt":0.24285998804405776,"score_spread":0.21844802276921718,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962742438","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013372197,0.000031073178,0.9738796,0.011931188,0.00021420457,0.00021529666,0.00009004053,0.00012321345,0.012178159],"genre_scores_gemma":[0.9827405,0.00002215763,0.013715452,0.0022135105,0.000034107466,0.000023312674,0.00009178189,0.00001176374,0.0011473987],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99840426,0.000080326434,0.0002516153,0.00038774652,0.0004278013,0.0004482418],"domain_scores_gemma":[0.99846953,0.00018358136,0.00008604599,0.00030594558,0.00039157318,0.00056333304],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002139999,0.00016325382,0.00013866555,0.00058964343,0.00023941795,0.00030271732,0.0006523057,0.000089931615,0.00079782767],"category_scores_gemma":[0.00009581062,0.00013568914,0.00004680661,0.0006410577,0.00006378084,0.0007499505,0.00005220536,0.00011327927,0.0014501916],"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.000005911418,0.00007201043,0.00049495563,0.00002134832,0.000025837548,0.000024687553,0.0002694872,0.030834746,0.0001187492,0.59268725,0.06566454,0.30978045],"study_design_scores_gemma":[0.0018872392,0.00043350644,0.005115812,0.00022892462,0.000006144497,0.00006708062,0.00007044196,0.90048474,0.0003179622,0.054849263,0.03547816,0.0010607233],"about_ca_topic_score_codex":0.0010431847,"about_ca_topic_score_gemma":0.0019992355,"teacher_disagreement_score":0.9814033,"about_ca_system_score_codex":0.00039495027,"about_ca_system_score_gemma":0.00093947863,"threshold_uncertainty_score":0.9993273},"labels":[],"label_agreement":null},{"id":"W2962974790","doi":"","title":"Collinearities in Kinetic Point Sets","year":2011,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","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 Calgary","funders":"","keywords":"Collinearity; Combinatorics; Plane (geometry); Trajectory; Mathematics; Point (geometry); Constant (computer programming); Line (geometry); Set (abstract data type); Kinetic energy; Line segment; Geometry; Physics; Mathematical analysis; Computer science; Classical mechanics","score_opus":0.055974921718670016,"score_gpt":0.24644584040733972,"score_spread":0.1904709186886697,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962974790","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22995827,0.00022338986,0.64729124,0.004261881,0.0016447824,0.0007531479,0.000101164784,0.00024700857,0.11551909],"genre_scores_gemma":[0.96019185,0.0000060899124,0.037617464,0.0017911475,0.000045585068,0.00002399813,0.00006354454,0.000009565462,0.00025077662],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983532,0.00008127113,0.00033606388,0.00046394393,0.00035651817,0.00040902954],"domain_scores_gemma":[0.9988538,0.0001460317,0.00007339252,0.00026327942,0.0002921491,0.00037133263],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028003464,0.00019265029,0.00018553367,0.0014028116,0.00013988165,0.00015553363,0.0005736016,0.000092016046,0.00053923886],"category_scores_gemma":[0.00008450185,0.00021820205,0.00005239577,0.0013860612,0.000059697602,0.00036086465,0.00005799311,0.00020897697,0.00027959654],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011320459,0.00009311322,0.0015758929,0.000012792736,0.000015446349,0.000110134206,0.00079096516,0.034006994,0.000010872491,0.93208224,0.0012032529,0.03008697],"study_design_scores_gemma":[0.0007892773,0.00026759907,0.21220934,0.00007463246,0.0000045156166,0.00006151238,0.00012638805,0.58036655,0.00018754673,0.20341101,0.0019040847,0.0005975232],"about_ca_topic_score_codex":0.008000307,"about_ca_topic_score_gemma":0.013177802,"teacher_disagreement_score":0.73023355,"about_ca_system_score_codex":0.000214758,"about_ca_system_score_gemma":0.0011825039,"threshold_uncertainty_score":0.9986055},"labels":[],"label_agreement":null},{"id":"W2963098896","doi":"","title":"Approximation Schemes for Covering and Packing in the Streaming Model.","year":2017,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Streaming data; Approximation algorithm; Packing problems; Context (archaeology); Streaming algorithm; Theoretical computer science; Cluster analysis; Cover (algebra); Mathematical optimization; Algorithm; Mathematics; Upper and lower bounds; Artificial intelligence; Data mining","score_opus":0.06221067361608096,"score_gpt":0.29343118656529077,"score_spread":0.2312205129492098,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963098896","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13679844,0.000032826585,0.8572922,0.0037182635,0.00013350628,0.00029489934,0.000022885144,0.000017842778,0.0016891834],"genre_scores_gemma":[0.9594206,0.0000048235006,0.03963016,0.0007425181,0.00006261288,0.00004277864,0.00004456231,0.0000055133846,0.000046420697],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989642,0.000030435613,0.00018273114,0.0003314771,0.00024661593,0.00024453842],"domain_scores_gemma":[0.9990364,0.00026404948,0.00011931048,0.0002967704,0.00016990902,0.000113574926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046351558,0.00012592741,0.00011542777,0.00038922866,0.0007495591,0.00093837525,0.00060826563,0.0000547229,0.0000035779979],"category_scores_gemma":[0.00023973522,0.00011694278,0.000031467276,0.00018887498,0.000050554558,0.0005883492,0.000055222725,0.00011946208,0.0000040079613],"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.0000037486338,0.0000139764425,0.0005776681,0.000014572175,0.0000068542945,0.0000033158622,0.00040438052,0.18803534,0.000022921646,0.7284396,0.000113248585,0.082364336],"study_design_scores_gemma":[0.00027975376,0.00003055329,0.012883754,0.00003187109,0.0000022297013,0.0000064531364,0.000055782744,0.9072805,0.00002849073,0.07879485,0.00047535467,0.00013041077],"about_ca_topic_score_codex":0.0005991442,"about_ca_topic_score_gemma":0.003045164,"teacher_disagreement_score":0.8226222,"about_ca_system_score_codex":0.00008558494,"about_ca_system_score_gemma":0.00046554566,"threshold_uncertainty_score":0.9048774},"labels":[],"label_agreement":null},{"id":"W2963302799","doi":"","title":"Sliding k-Transmitters: Hardness and Approximation","year":2016,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba; University of Waterloo","funders":"","keywords":"Monotone polygon; Simple polygon; Combinatorics; Polygon (computer graphics); Mathematics; Perpendicular; Guard (computer science); Line segment; Algorithm; Geometry; Mathematical analysis; Computer science; Telecommunications","score_opus":0.028130455835106392,"score_gpt":0.23365218653069406,"score_spread":0.20552173069558766,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963302799","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034785304,0.000053450804,0.94840986,0.013612465,0.000552627,0.00017477285,0.000029822631,0.000093672665,0.0022880235],"genre_scores_gemma":[0.97416514,0.000013817161,0.023754636,0.0014643541,0.0000958638,0.000019290444,0.000028870016,0.000009476597,0.00044852443],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99850225,0.000066684035,0.00024191545,0.00050172705,0.00035993478,0.0003275029],"domain_scores_gemma":[0.9988057,0.00021592592,0.00007746775,0.0002136682,0.00027848157,0.0004087582],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002739561,0.00018063607,0.0001506371,0.0007955847,0.0002637123,0.00028129827,0.00035574866,0.000078676196,0.00009925749],"category_scores_gemma":[0.00009077435,0.00015142334,0.000041760264,0.0006491955,0.00005044367,0.000656114,0.000042681848,0.0000903245,0.00013817642],"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.000004591402,0.000017313856,0.00040437898,0.000012016149,0.000017262313,0.000010286116,0.00011750658,0.0015630481,0.00033715705,0.77562606,0.0011440155,0.22074634],"study_design_scores_gemma":[0.0024570338,0.00039195007,0.08643523,0.00039312048,0.00002148985,0.00017786521,0.00009885716,0.55318516,0.0016617597,0.32886893,0.024780098,0.0015285368],"about_ca_topic_score_codex":0.00032929974,"about_ca_topic_score_gemma":0.00047226524,"teacher_disagreement_score":0.9393799,"about_ca_system_score_codex":0.00018407391,"about_ca_system_score_gemma":0.0006385663,"threshold_uncertainty_score":0.6174865},"labels":[],"label_agreement":null},{"id":"W2963433266","doi":"","title":"$1$-String $B_1$-VPG Representations of Planar Partial $3$-Trees and Some Subclasses","year":2015,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Planar; Planar graph; Vertex (graph theory); Mathematics; Graph; String (physics); Face (sociological concept); Computer science","score_opus":0.061165323226796596,"score_gpt":0.28277101308477515,"score_spread":0.22160568985797854,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963433266","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45389658,0.00052946614,0.5292067,0.010498142,0.0011942897,0.00046150986,0.00018877351,0.00015529056,0.0038692225],"genre_scores_gemma":[0.9792682,0.000012276664,0.01951511,0.00070599216,0.0001401046,0.000012803022,0.00014888782,0.000008714987,0.00018792684],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982873,0.00008803008,0.00035831434,0.000452098,0.0005121221,0.0003021085],"domain_scores_gemma":[0.9981615,0.00031295788,0.00014392412,0.00026587254,0.00050279306,0.0006129523],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003005493,0.0001772888,0.0002175682,0.00088333216,0.00017202874,0.00020057143,0.00039538386,0.00008066216,0.000022219545],"category_scores_gemma":[0.00024413543,0.0001957905,0.000047354642,0.00085874886,0.00010274822,0.0006002969,0.00006335907,0.00014359146,0.00004851869],"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.000010685272,0.00003883219,0.002044339,0.0000109869225,0.00003218587,0.0000196383,0.0002827569,0.06346679,0.000087330896,0.92345273,0.0030865888,0.0074671223],"study_design_scores_gemma":[0.0018609889,0.00056633836,0.07315975,0.00010995489,0.000031482934,0.000107883316,0.0004714073,0.5722563,0.0014300907,0.33970174,0.00942587,0.00087815936],"about_ca_topic_score_codex":0.002377385,"about_ca_topic_score_gemma":0.002050191,"teacher_disagreement_score":0.583751,"about_ca_system_score_codex":0.000114552975,"about_ca_system_score_gemma":0.0016462125,"threshold_uncertainty_score":0.7984105},"labels":[],"label_agreement":null},{"id":"W2995839712","doi":"","title":"Approximating the minimum closest pair distance and nearest neighbor distances of linearly moving points","year":2015,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","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 Waterloo","funders":"","keywords":"Constant (computer programming); Dimension (graph theory); Combinatorics; Linear space; k-nearest neighbors algorithm; Mathematics; Space (punctuation); Discrete mathematics; Computer science","score_opus":0.04014110122099491,"score_gpt":0.2516269006426904,"score_spread":0.2114857994216955,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2995839712","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18890926,0.00041355775,0.7989307,0.0075876694,0.00050986017,0.00031413892,0.00009029301,0.000059838356,0.0031846706],"genre_scores_gemma":[0.96908796,0.000004389392,0.02977623,0.0007732207,0.000114824536,0.000014237693,0.00005201728,0.000009458167,0.00016766529],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998212,0.00011432798,0.00040459225,0.00041886483,0.0005427315,0.00030748514],"domain_scores_gemma":[0.99798065,0.0005261568,0.00022042071,0.00028520258,0.00057496276,0.00041258652],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005888759,0.0001913532,0.0002145028,0.00033332026,0.00027793084,0.00033678906,0.00057153817,0.00006374648,0.000014259528],"category_scores_gemma":[0.0004099148,0.00016378335,0.000045848996,0.0009740194,0.00016686798,0.0004107229,0.000090418354,0.00018584229,0.000018133649],"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.000020755058,0.000055683493,0.004418085,0.000045433335,0.000036906138,0.0000172309,0.0011588226,0.06739419,0.00002321406,0.8703899,0.0014130701,0.055026714],"study_design_scores_gemma":[0.00045355948,0.00016186356,0.017558303,0.000082808074,0.000007446168,0.000021679063,0.00030261863,0.93214566,0.00007076755,0.045107365,0.003800857,0.00028705876],"about_ca_topic_score_codex":0.0012519957,"about_ca_topic_score_gemma":0.002465487,"teacher_disagreement_score":0.86475146,"about_ca_system_score_codex":0.00011254535,"about_ca_system_score_gemma":0.0012230882,"threshold_uncertainty_score":0.6678891},"labels":[],"label_agreement":null},{"id":"W3020829986","doi":"","title":"Reconstructing a Polyhedron between Polygons in Parallel Slices.","year":2019,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Vertex (graph theory); Mathematics; Polyhedron; Regular polygon; Surface (topology); Disjoint sets; Planar; Triangulation; Time complexity; Geometry; Computer science; Graph","score_opus":0.027851291218023832,"score_gpt":0.2508997063316967,"score_spread":0.2230484151136729,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3020829986","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8117395,0.000097996606,0.15986963,0.004945602,0.000952613,0.0005224417,0.000058566602,0.00012447912,0.021689186],"genre_scores_gemma":[0.96630716,0.0000034080904,0.03193593,0.001092152,0.00012267564,0.00001426227,0.00011944231,0.000012614384,0.00039236958],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978192,0.00010142152,0.00043301267,0.00066185906,0.00044068886,0.000543827],"domain_scores_gemma":[0.99849266,0.00039714744,0.00013818429,0.00034423423,0.00019693265,0.00043083524],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003824071,0.00023592835,0.00028429064,0.0016713477,0.00015834042,0.0002805601,0.00069978193,0.0001342402,0.00036599374],"category_scores_gemma":[0.000076841236,0.00027397557,0.000074652955,0.001721783,0.00004036592,0.0005224177,0.00007470865,0.0003428168,0.00071245036],"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.00001052643,0.0000477636,0.1328417,0.000027924087,0.000044493572,0.00003482319,0.00036440784,0.16985153,0.00005273057,0.6055724,0.00058678776,0.09056489],"study_design_scores_gemma":[0.0013086281,0.00020948108,0.30791426,0.00013768725,0.0000065171216,0.000050675328,0.00017102582,0.6254803,0.000064348445,0.060806736,0.0030301393,0.00082021294],"about_ca_topic_score_codex":0.004398192,"about_ca_topic_score_gemma":0.0036614444,"teacher_disagreement_score":0.54476565,"about_ca_system_score_codex":0.00033191487,"about_ca_system_score_gemma":0.0015970479,"threshold_uncertainty_score":0.9999713},"labels":[],"label_agreement":null},{"id":"W3020899460","doi":"","title":"Watchtower for k-crossing Visibility.","year":2019,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Manitoba","funders":"","keywords":"Visibility; Computer science; Telecommunications; Environmental science; Physics; Optics","score_opus":0.027419268007542713,"score_gpt":0.26531223596246645,"score_spread":0.23789296795492373,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3020899460","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054391794,0.000036659807,0.91509205,0.006075685,0.0015642162,0.00076190045,0.0001830978,0.00014292693,0.021751687],"genre_scores_gemma":[0.94942176,0.0000010637516,0.044457663,0.0024779693,0.000075125114,0.000016065358,0.00016866777,0.000010628678,0.003371053],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985924,0.000019102377,0.00018881951,0.00052551227,0.00027102663,0.0004031909],"domain_scores_gemma":[0.99886113,0.00016435483,0.000058378213,0.00042897917,0.00021584837,0.00027127907],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027866376,0.00014619614,0.00015202351,0.00042500402,0.0002262155,0.00094356237,0.000832623,0.000052250558,0.00027358608],"category_scores_gemma":[0.000046753765,0.00015085975,0.00006537633,0.00048022476,0.000048524988,0.0005534359,0.00008584746,0.00010242191,0.0006390088],"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.0000054037932,0.0000311362,0.001375974,0.000030010046,0.000027229562,0.000007869205,0.000111903915,0.0038223653,0.000012824614,0.86408114,0.006170186,0.12432394],"study_design_scores_gemma":[0.00079441146,0.00018815252,0.016767265,0.000052179585,0.0000054412812,0.000004213247,0.000053559925,0.77530813,0.000034839235,0.0851203,0.12117675,0.0004947706],"about_ca_topic_score_codex":0.0009950609,"about_ca_topic_score_gemma":0.0010891622,"teacher_disagreement_score":0.89502996,"about_ca_system_score_codex":0.00013329825,"about_ca_system_score_gemma":0.00072955084,"threshold_uncertainty_score":0.9098793},"labels":[],"label_agreement":null},{"id":"W3021534272","doi":"","title":"Three-Coloring Three-Dimensional Uniform Hypergraphs.","year":2019,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Waterloo","funders":"","keywords":"Computer science","score_opus":0.014843588248475922,"score_gpt":0.1947268364063736,"score_spread":0.17988324815789766,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3021534272","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96351373,0.00011344306,0.0026994962,0.00014986965,0.0013571695,0.00027178385,0.00008641892,0.00017235422,0.03163573],"genre_scores_gemma":[0.999019,0.000001271806,0.00039709566,0.00024550394,0.00007683767,0.000015966896,0.00008324581,0.000030627507,0.00013044999],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987871,0.000012334926,0.00022935972,0.00026236547,0.00028901966,0.00041984388],"domain_scores_gemma":[0.9991372,0.00011960755,0.000031641255,0.00021806256,0.000121523066,0.00037196],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00016123334,0.00021714497,0.0002146156,0.00064984657,0.000120642115,0.00007104256,0.00024180938,0.0001224552,0.0011835136],"category_scores_gemma":[0.000010980005,0.0002321022,0.00008286279,0.0005547741,0.000045797715,0.00012816074,0.000014433377,0.00025718726,0.0013740128],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013494711,0.000014724916,0.016953172,0.0000641284,0.00011062311,0.000027770584,0.000043153315,0.54358023,0.00012811447,0.4317415,0.001411554,0.0059114997],"study_design_scores_gemma":[0.00081521826,0.00015379785,0.109433286,0.00021483467,0.000016972164,0.00005128123,0.00008707781,0.7811045,0.00009439496,0.10028086,0.0068628625,0.00088492496],"about_ca_topic_score_codex":0.0026181967,"about_ca_topic_score_gemma":0.02508727,"teacher_disagreement_score":0.33146065,"about_ca_system_score_codex":0.00016151095,"about_ca_system_score_gemma":0.00027225,"threshold_uncertainty_score":0.9997295},"labels":[],"label_agreement":null},{"id":"W3023360435","doi":"","title":"Redundant Persistent Acyclic Formations for Vision-Based Control of Distributed Multi-Agent Formations.","year":2019,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Control (management); Distributed computing; Multi-agent system; Geology; Artificial intelligence","score_opus":0.026395066848468422,"score_gpt":0.26148191985535324,"score_spread":0.2350868530068848,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3023360435","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013449071,0.000048061185,0.97629136,0.0036341504,0.0007093186,0.0016953379,0.0035947578,0.00008959213,0.00048837904],"genre_scores_gemma":[0.98714316,9.4694695e-7,0.010258484,0.00084230443,0.000027519523,0.00016327771,0.0014349496,0.000016289232,0.00011308722],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99743617,0.00010523462,0.00079551083,0.0004908018,0.0005758489,0.0005964292],"domain_scores_gemma":[0.9966339,0.00063096726,0.00043403436,0.00063091837,0.001131654,0.0005385204],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00045372223,0.0002942926,0.00044818668,0.00086115295,0.00029492428,0.00028467548,0.0010197817,0.00013669551,0.00008736691],"category_scores_gemma":[0.00023028544,0.0003024788,0.0003320907,0.0008014508,0.000073613446,0.00053653074,0.000033033848,0.00016814072,0.00023605277],"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.00006938037,0.00039161864,0.0022021844,0.00024183065,0.00031218096,0.0000057063376,0.00034769883,0.77517766,0.00033551877,0.20841497,0.0038113254,0.008689913],"study_design_scores_gemma":[0.0034647346,0.00027794822,0.010781722,0.00011899496,0.000026080195,0.0000051956736,0.00013981512,0.9797718,0.000056884604,0.00061586715,0.0044202474,0.00032072762],"about_ca_topic_score_codex":0.0011636147,"about_ca_topic_score_gemma":0.00078339514,"teacher_disagreement_score":0.9736941,"about_ca_system_score_codex":0.0005791338,"about_ca_system_score_gemma":0.0020495371,"threshold_uncertainty_score":0.9999427},"labels":[],"label_agreement":null},{"id":"W3023639838","doi":"","title":"Graph Drawing via Layered Partitions.","year":2019,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Graph; Theoretical computer science","score_opus":0.02048755667012055,"score_gpt":0.2358003441935206,"score_spread":0.21531278752340005,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3023639838","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10728054,0.00007893085,0.86313444,0.0045516593,0.0014328356,0.0004043076,0.00004405362,0.00019062174,0.022882603],"genre_scores_gemma":[0.97977674,0.000003878567,0.01617199,0.0029816139,0.0001112985,0.00002177477,0.00018099858,0.000013338386,0.00073838624],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99797106,0.00008280355,0.0003266281,0.0006107688,0.0005365744,0.0004721629],"domain_scores_gemma":[0.9983306,0.00022682513,0.00010516011,0.00040798582,0.00042664958,0.0005028134],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00027191584,0.00022751103,0.00021109892,0.0011841997,0.000305674,0.00036659496,0.00064291595,0.00010568935,0.0007779089],"category_scores_gemma":[0.00004891092,0.00025615148,0.00010458126,0.0016150298,0.000042372238,0.0005464502,0.00006426047,0.00023233594,0.002103801],"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.0000062170297,0.000052700383,0.001293486,0.000015208792,0.000040447023,0.00002245416,0.00012440307,0.3356514,0.0001811916,0.6302716,0.0030013602,0.029339503],"study_design_scores_gemma":[0.00080528494,0.00023455803,0.035961896,0.000065126216,0.000007729516,0.000059854097,0.00004284413,0.72698766,0.00026754302,0.22156425,0.013271258,0.0007320161],"about_ca_topic_score_codex":0.0011530971,"about_ca_topic_score_gemma":0.0013648751,"teacher_disagreement_score":0.8724962,"about_ca_system_score_codex":0.00019304277,"about_ca_system_score_gemma":0.001109019,"threshold_uncertainty_score":0.9999891},"labels":[],"label_agreement":null},{"id":"W3079396048","doi":"","title":"Distance-Two Coloring of Barnette Graphs.","year":2018,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science","score_opus":0.03704036719867936,"score_gpt":0.3021818451341628,"score_spread":0.2651414779354834,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3079396048","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14473775,0.000075409676,0.8146031,0.00163643,0.00064312207,0.00031140624,0.000071186616,0.00010662416,0.03781501],"genre_scores_gemma":[0.98213804,0.0000029782782,0.016996687,0.0005445799,0.00006265212,0.0000116055235,0.000012891493,0.000011113095,0.00021944962],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981883,0.00008173865,0.00026358222,0.00045806137,0.0005034757,0.00050481106],"domain_scores_gemma":[0.99799955,0.00028103645,0.00010112276,0.000450282,0.00069030834,0.00047768443],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003305754,0.00016235487,0.00020008175,0.0010051187,0.00023447187,0.00010355985,0.001089026,0.000053052678,0.00021299222],"category_scores_gemma":[0.00012422152,0.00017463822,0.000063576415,0.0017434312,0.00043484903,0.00029510108,0.00009653731,0.00020567336,0.0001624125],"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.000010810494,0.000015438865,0.0014167513,0.000007708517,0.000017969825,0.000015262387,0.00010249075,0.0019845003,0.000056870038,0.9797767,0.000380741,0.016214801],"study_design_scores_gemma":[0.00073419104,0.00045023803,0.018013654,0.00009844533,0.000004436855,0.000020794898,0.00006313935,0.13635467,0.0011852356,0.8374321,0.0051775817,0.00046555308],"about_ca_topic_score_codex":0.0019629293,"about_ca_topic_score_gemma":0.007376385,"teacher_disagreement_score":0.8374003,"about_ca_system_score_codex":0.00014252662,"about_ca_system_score_gemma":0.00095389166,"threshold_uncertainty_score":0.71215403},"labels":[],"label_agreement":null},{"id":"W3164099491","doi":"","title":"Covering Points with Pairs of Concentric Disks.","year":2020,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Concentric; Computer science; Geometry; Mathematics","score_opus":0.03095064521175248,"score_gpt":0.224095522346871,"score_spread":0.19314487713511852,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3164099491","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09848584,0.0000718142,0.8864763,0.009602983,0.00020243287,0.00025443957,0.000072264105,0.000084606654,0.004749348],"genre_scores_gemma":[0.9750733,0.0000044293497,0.021915393,0.0028087134,0.00007193019,0.000006806131,0.000070342045,0.000009747831,0.000039388786],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984214,0.00005605529,0.000283865,0.00043714672,0.0005055448,0.00029599934],"domain_scores_gemma":[0.99848324,0.00019625528,0.00014154975,0.00018733084,0.00041925412,0.000572373],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012595694,0.00017966154,0.00022149518,0.0003241365,0.00013183698,0.00012366993,0.0005182355,0.000055610166,0.00015457104],"category_scores_gemma":[0.000108649794,0.00017724787,0.000053465974,0.0016380434,0.00006938841,0.00030457322,0.0000546953,0.0001560406,0.00008674086],"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.000042291733,0.00005298532,0.0036924155,0.000053347532,0.00007345844,0.000063826235,0.0005960164,0.37280163,0.00009551946,0.589647,0.002000629,0.030880898],"study_design_scores_gemma":[0.0012365982,0.00070970866,0.03200374,0.000088472654,0.000014542473,0.000030424306,0.00010655529,0.94972736,0.000837874,0.009002457,0.00566707,0.0005751936],"about_ca_topic_score_codex":0.0005957886,"about_ca_topic_score_gemma":0.00042218665,"teacher_disagreement_score":0.8765874,"about_ca_system_score_codex":0.00010218377,"about_ca_system_score_gemma":0.0013633495,"threshold_uncertainty_score":0.72279584},"labels":[],"label_agreement":null},{"id":"W3164322801","doi":"","title":"External Exploration of a Convex Polygon.","year":2020,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Regular polygon; Polygon (computer graphics); Computer science; Mathematics; Geometry; Telecommunications","score_opus":0.07268516792617138,"score_gpt":0.2614421747228599,"score_spread":0.18875700679668853,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3164322801","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020868339,0.00009033081,0.9637237,0.011029761,0.0003039897,0.00019145603,0.000044158336,0.00007066043,0.0036775752],"genre_scores_gemma":[0.9640964,0.00000668543,0.031232616,0.004344117,0.00015275813,0.000011153532,0.00006878954,0.000009201995,0.00007827391],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983287,0.000073639574,0.00037498755,0.0004363769,0.0005176972,0.00026860257],"domain_scores_gemma":[0.9984241,0.00014955694,0.00015953522,0.0002014031,0.0004908541,0.0005745367],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015884195,0.00017684967,0.00022136843,0.00053384673,0.00013624234,0.00014946132,0.0005879194,0.00007622068,0.0002285755],"category_scores_gemma":[0.00013842253,0.00019749087,0.000078109246,0.0012369052,0.000056142628,0.00072929484,0.000057912126,0.00016523561,0.00020717869],"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.000018444456,0.000038221122,0.00022414542,0.00002406304,0.00002583205,0.000020805202,0.000632855,0.12613566,0.00063032977,0.8283449,0.0017649345,0.042139847],"study_design_scores_gemma":[0.00068259035,0.00041697535,0.006993351,0.000051807838,0.000008328776,0.000014526496,0.000092101865,0.92377675,0.0017785429,0.06196745,0.0038072527,0.00041034498],"about_ca_topic_score_codex":0.00067734584,"about_ca_topic_score_gemma":0.0003146598,"teacher_disagreement_score":0.94322807,"about_ca_system_score_codex":0.00008137078,"about_ca_system_score_gemma":0.0012565206,"threshold_uncertainty_score":0.80534434},"labels":[],"label_agreement":null},{"id":"W3164360850","doi":"","title":"Minimum Ply Covering of Points with Convex Shapes.","year":2020,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Regular polygon; Computer science; Combinatorics; Mathematics; Geometry","score_opus":0.032863458709418585,"score_gpt":0.22728231669365648,"score_spread":0.19441885798423789,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3164360850","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10447772,0.000066294764,0.87269413,0.01299972,0.00020988449,0.0003052763,0.000093303664,0.00009866298,0.009055007],"genre_scores_gemma":[0.9650211,0.000002873625,0.029557211,0.0051717386,0.00008679102,0.000007761108,0.00006516593,0.000011949038,0.00007544229],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998278,0.00005109363,0.00032197856,0.00049287773,0.00054459576,0.00031140982],"domain_scores_gemma":[0.9983643,0.00020858603,0.00015376089,0.00017001027,0.00049849314,0.0006048406],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013967058,0.00020372069,0.00026242938,0.0004666894,0.00013416156,0.0001440654,0.0005968647,0.00007011564,0.00022862223],"category_scores_gemma":[0.000101555,0.00020707134,0.000058169764,0.0013102395,0.00007839673,0.00033127202,0.00006342639,0.00017619791,0.00013073803],"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.00006753697,0.000067947745,0.001214801,0.00007789113,0.000107860214,0.00008316995,0.0008345397,0.26902536,0.00032295982,0.6994723,0.0032950088,0.025430601],"study_design_scores_gemma":[0.0009997997,0.0006330269,0.016308408,0.00007663733,0.000011568784,0.000029648005,0.00008437623,0.96603996,0.0006077389,0.009545818,0.005183288,0.0004797474],"about_ca_topic_score_codex":0.00056393776,"about_ca_topic_score_gemma":0.0005107269,"teacher_disagreement_score":0.8605434,"about_ca_system_score_codex":0.000089716385,"about_ca_system_score_gemma":0.0016042558,"threshold_uncertainty_score":0.84441245},"labels":[],"label_agreement":null},{"id":"W3174457827","doi":"","title":"Simultaneous Visibility Representations of Undirected Pairs of Graphs.","year":2020,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; University of British Columbia","funders":"","keywords":"Visibility; Combinatorics; Vertex (graph theory); Visibility graph; Representation (politics); Mathematics; Undirected graph; Enhanced Data Rates for GSM Evolution; Graph; Discrete mathematics; Computer science; Geometry; Artificial intelligence; Physics; Optics","score_opus":0.03468051167596801,"score_gpt":0.26695648007855466,"score_spread":0.23227596840258666,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3174457827","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27527234,0.00009960861,0.71231014,0.0054735397,0.00034584262,0.00045685194,0.0002701782,0.00012229595,0.0056492044],"genre_scores_gemma":[0.9763187,0.000004707618,0.022653546,0.0008103269,0.000033979974,0.0000060913394,0.00012948227,0.000007716202,0.00003544852],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981315,0.00011957377,0.0005204158,0.00048132605,0.000514017,0.00023314173],"domain_scores_gemma":[0.9973307,0.0007411218,0.00023614593,0.00030149744,0.00094370777,0.00044681178],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019737284,0.0001638929,0.00027789923,0.0006214299,0.000111675516,0.000054268126,0.00057696074,0.000077593606,0.00017233072],"category_scores_gemma":[0.00070685527,0.00018341109,0.000110757486,0.0023515867,0.00011190799,0.00021181235,0.000060947423,0.00014859319,0.000029253912],"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.000025861547,0.00009645169,0.002102432,0.000061226696,0.000068023444,0.000018410869,0.00063110923,0.584691,0.000591177,0.38794878,0.0009066515,0.022858905],"study_design_scores_gemma":[0.00049532036,0.00033229106,0.02997217,0.000035096917,0.000013085423,0.0000066982807,0.00009337587,0.9264853,0.0016254502,0.040197574,0.00046361482,0.0002800223],"about_ca_topic_score_codex":0.0018360425,"about_ca_topic_score_gemma":0.0009780303,"teacher_disagreement_score":0.70104635,"about_ca_system_score_codex":0.00006705749,"about_ca_system_score_gemma":0.0012847375,"threshold_uncertainty_score":0.74792874},"labels":[],"label_agreement":null},{"id":"W3175012788","doi":"","title":"Massively winning configurations in the convex grabbing game on the plane","year":2021,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Convex hull; Combinatorics; Regular polygon; Convex body; Cutting-plane method; Mathematics; Point (geometry); Set (abstract data type); Hull; Plane (geometry); Convex combination; Discrete mathematics; Computer science; Mathematical optimization; Convex optimization; Geometry; Engineering; Integer programming","score_opus":0.05902740392706114,"score_gpt":0.28885181292854883,"score_spread":0.2298244090014877,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3175012788","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20867077,0.0002645581,0.47489613,0.21045339,0.0009959945,0.0013555769,0.00023350384,0.0001662773,0.10296378],"genre_scores_gemma":[0.9900699,0.000004914068,0.001028022,0.008510801,0.000045084675,0.00003979026,0.000054571796,0.000008855374,0.00023803016],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978565,0.00039482868,0.0002351212,0.00043761038,0.0006031607,0.0004727655],"domain_scores_gemma":[0.9966395,0.002246019,0.00007263165,0.00050539256,0.00033386904,0.00020259997],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060537376,0.00016638415,0.00015292218,0.00051176595,0.00041512033,0.00047846552,0.0011678003,0.000062074934,0.00026784607],"category_scores_gemma":[0.0004967102,0.00012265013,0.00005261499,0.001750761,0.00017160267,0.00019435339,0.000059051603,0.00059287203,0.00019919277],"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.000003634004,0.000020046034,0.00025348744,0.0000030888436,0.000011552497,0.0002016968,0.0005216834,0.014221408,0.00005089877,0.9804083,0.00068572134,0.0036184692],"study_design_scores_gemma":[0.000813774,0.00021362606,0.066521406,0.00019219324,0.000006289449,0.00017926612,0.0027827295,0.23472592,0.00041935957,0.68166584,0.011840884,0.00063872687],"about_ca_topic_score_codex":0.00066125655,"about_ca_topic_score_gemma":0.003757378,"teacher_disagreement_score":0.7813992,"about_ca_system_score_codex":0.00015470241,"about_ca_system_score_gemma":0.001614381,"threshold_uncertainty_score":0.50015277},"labels":[],"label_agreement":null},{"id":"W3202043921","doi":"","title":"An Acrophobic Guard Watchtower Problem on Terrains.","year":2021,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Guard (computer science); Computer science; Computer security; Programming language","score_opus":0.029826325630256632,"score_gpt":0.27213839133728307,"score_spread":0.24231206570702643,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3202043921","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.090141945,0.00010899077,0.82445115,0.023580944,0.002742748,0.00060925685,0.00025871294,0.00060167524,0.05750457],"genre_scores_gemma":[0.8380014,0.000002341549,0.1552395,0.0056718863,0.0001253323,0.000017041304,0.00017066112,0.000020649606,0.0007512244],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974398,0.00014007463,0.00030175078,0.00085716543,0.00062123523,0.0006399612],"domain_scores_gemma":[0.9976932,0.00017683917,0.00009144054,0.0007231523,0.00049158133,0.0008238131],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00025907918,0.0002738863,0.00025334404,0.0005601505,0.000296246,0.0005180452,0.0010177317,0.00013949363,0.000257908],"category_scores_gemma":[0.00008655862,0.0002925734,0.00007199338,0.0010547597,0.00007550279,0.0003154528,0.00006671909,0.00038268472,0.0006774427],"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.000014278414,0.00038505121,0.0016457291,0.00003781399,0.00011313194,0.0026501252,0.0018882446,0.46396044,0.00034830472,0.38294595,0.016505366,0.12950556],"study_design_scores_gemma":[0.0009484309,0.0007114827,0.041520085,0.00024299014,0.00001103928,0.0002613859,0.00022055004,0.90557116,0.00042040786,0.039416168,0.0095085045,0.0011677869],"about_ca_topic_score_codex":0.0017404644,"about_ca_topic_score_gemma":0.0011428775,"teacher_disagreement_score":0.7478594,"about_ca_system_score_codex":0.00032385025,"about_ca_system_score_gemma":0.0028905089,"threshold_uncertainty_score":0.9999526},"labels":[],"label_agreement":null},{"id":"W3202544316","doi":"","title":"Convex Bichromatic Quadrangulation of Point Sets with Minimum Color Flips.","year":2021,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Regular polygon; Mathematics; Point (geometry); Combinatorics; Geometry","score_opus":0.021661916448564238,"score_gpt":0.2412595239077216,"score_spread":0.21959760745915735,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3202544316","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43127602,0.00013474822,0.5567876,0.0048489086,0.0004946747,0.000323871,0.000081606806,0.00008010115,0.005972492],"genre_scores_gemma":[0.95045793,0.0000034346203,0.047725502,0.0011664119,0.000049840375,0.00001528245,0.00028720015,0.000011979801,0.00028240954],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99798405,0.00012236595,0.00042418513,0.0005117626,0.00063040823,0.00032722612],"domain_scores_gemma":[0.9975479,0.00037477873,0.00019979363,0.0003632671,0.0011439705,0.00037026955],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025133355,0.0002157507,0.00030372947,0.00071638846,0.00018590347,0.00017014534,0.0003758693,0.00009804142,0.0002905791],"category_scores_gemma":[0.0001376312,0.00021919006,0.00007151391,0.0017284177,0.00008854229,0.00034863738,0.00005032169,0.00014879311,0.00009282262],"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.00002915188,0.00020914142,0.0012247311,0.00012186968,0.0001649544,0.00016461368,0.00078509154,0.22888072,0.001100418,0.73671895,0.0023030734,0.028297294],"study_design_scores_gemma":[0.0012880764,0.0004251368,0.07882869,0.00018897594,0.00002682985,0.00018438093,0.00021244127,0.8803938,0.0017017268,0.03490707,0.0012637512,0.0005791302],"about_ca_topic_score_codex":0.0006842962,"about_ca_topic_score_gemma":0.0032410293,"teacher_disagreement_score":0.70181185,"about_ca_system_score_codex":0.00017469146,"about_ca_system_score_gemma":0.0033225617,"threshold_uncertainty_score":0.8938311},"labels":[],"label_agreement":null},{"id":"W41445881","doi":"","title":"Tight Bounds for Point Recolouring.","year":2006,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","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":"Queen's University","funders":"","keywords":"Sequence (biology); Point (geometry); Set (abstract data type); Upper and lower bounds; Matching (statistics); Mathematics; Combinatorics; Iterative method; Computer science; Algorithm; Geometry; Mathematical analysis; Statistics","score_opus":0.020996723931934257,"score_gpt":0.23916707461103823,"score_spread":0.21817035067910398,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W41445881","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017700063,0.00007854349,0.9548146,0.008304976,0.0010076083,0.00043573673,0.00009507935,0.00014531739,0.017418047],"genre_scores_gemma":[0.92642456,0.0000017542926,0.068839066,0.0018968744,0.0003540039,0.00006751647,0.00035257568,0.000014838045,0.002048808],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99822044,0.000044487046,0.00034065128,0.0005541523,0.0003664384,0.00047380076],"domain_scores_gemma":[0.99839884,0.00033560777,0.000112779046,0.00027619908,0.00055569306,0.00032090774],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003232096,0.00021354205,0.0001893944,0.0009357132,0.00044430117,0.00043771273,0.0005541477,0.000105032246,0.0001477973],"category_scores_gemma":[0.00008318921,0.000236453,0.00010605996,0.0008850179,0.00004689963,0.00035916927,0.000041387117,0.0001383448,0.00016896403],"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.0000072536805,0.000047205904,0.00015254093,0.000011281279,0.000015306536,0.000010041799,0.00002879918,0.07989791,0.000034755143,0.8779983,0.024484884,0.017311761],"study_design_scores_gemma":[0.00076626305,0.00023098559,0.018136207,0.000029795809,0.000007881375,0.000032662836,0.000012943847,0.54066974,0.0002752136,0.3693996,0.06991603,0.00052264554],"about_ca_topic_score_codex":0.0021021701,"about_ca_topic_score_gemma":0.0063318494,"teacher_disagreement_score":0.9087245,"about_ca_system_score_codex":0.0003122371,"about_ca_system_score_gemma":0.0014297218,"threshold_uncertainty_score":0.9642274},"labels":[],"label_agreement":null},{"id":"W4452397","doi":"","title":"Characterization of Polygons Searchable by a Boundary 1-Searcher.","year":2006,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Artificial Intelligence in Games","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","funders":"","keywords":"Polygon (computer graphics); Boundary (topology); Computer science; Schedule; Visibility polygon; Combinatorics; Simple polygon; Mathematics; Monotone polygon; Geometry; Computer network","score_opus":0.031280114097779504,"score_gpt":0.26983664738800195,"score_spread":0.23855653329022244,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4452397","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41630587,0.000071221024,0.56479937,0.00576793,0.00032742694,0.0003073246,0.00032067334,0.000099310455,0.012000856],"genre_scores_gemma":[0.9944805,0.0000045068036,0.0035556713,0.00051040744,0.000056715857,0.00001173882,0.00021795317,0.000011768723,0.0011507674],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998288,0.00007690499,0.00032910728,0.0003725268,0.0004999696,0.00043352362],"domain_scores_gemma":[0.99871945,0.0001582898,0.000112092705,0.00029485658,0.0004355869,0.00027970626],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002534605,0.00014876304,0.00017236006,0.00061256386,0.00020459024,0.00023254447,0.00072731456,0.000087912245,0.00030039635],"category_scores_gemma":[0.000058751746,0.00016799694,0.000052198222,0.00097433943,0.00020639856,0.00035583522,0.000064109896,0.00018617968,0.0002041703],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013751514,0.00018738671,0.004950182,0.000033066517,0.00003485164,0.000029611781,0.00036615744,0.005665336,0.022022318,0.89949095,0.007946502,0.05925988],"study_design_scores_gemma":[0.00035599095,0.00042965636,0.06345355,0.00014952951,0.0000094287125,0.000027290804,0.00015244614,0.68945986,0.03418998,0.18315795,0.027606156,0.0010081731],"about_ca_topic_score_codex":0.023026716,"about_ca_topic_score_gemma":0.005760689,"teacher_disagreement_score":0.716333,"about_ca_system_score_codex":0.00019481793,"about_ca_system_score_gemma":0.0016916418,"threshold_uncertainty_score":0.983479},"labels":[],"label_agreement":null},{"id":"W6119617","doi":"","title":"Determining the robustness of sensor barriers","year":2010,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Energy Efficient Wireless Sensor 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 British Columbia","funders":"","keywords":"Robustness (evolution); Wireless sensor network; Computer science; Redundancy (engineering); Topology (electrical circuits); Distributed computing; Real-time computing; Computer network; Mathematics; Combinatorics","score_opus":0.015291326085902857,"score_gpt":0.22846644950841782,"score_spread":0.21317512342251496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6119617","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7907459,0.000007689304,0.19889215,0.0025238674,0.0017825399,0.00016348848,0.000025170477,0.00006979646,0.005789369],"genre_scores_gemma":[0.9811787,8.162393e-7,0.01790527,0.00067482487,0.00010506341,0.000005708083,0.000012905743,0.000011435839,0.00010529006],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99856305,0.00006257716,0.00024936337,0.00034611064,0.00039771234,0.00038118393],"domain_scores_gemma":[0.9980341,0.00046898297,0.00012806931,0.00048535492,0.00044276088,0.00044070045],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026105077,0.00016202462,0.00016507479,0.00039982682,0.0002771492,0.00015233613,0.0011286199,0.00010924963,0.00012677978],"category_scores_gemma":[0.00021398482,0.00013631854,0.00006322084,0.00077833224,0.0002031975,0.00013204945,0.00006788834,0.00039922164,0.000023084189],"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.0000016631222,0.000011182462,0.0023808067,0.000004200803,0.000012970146,0.000007666455,0.00009972783,0.7911371,0.000036627258,0.1941997,0.0004505171,0.011657818],"study_design_scores_gemma":[0.00020565865,0.000038562437,0.019573772,0.000020032883,0.0000037086932,0.000012469261,0.000046945417,0.97798187,0.00010388392,0.0005525229,0.0012589575,0.00020161859],"about_ca_topic_score_codex":0.0007595707,"about_ca_topic_score_gemma":0.0062174434,"teacher_disagreement_score":0.19364718,"about_ca_system_score_codex":0.00004912763,"about_ca_system_score_gemma":0.0009990366,"threshold_uncertainty_score":0.55589086},"labels":[],"label_agreement":null},{"id":"W94935907","doi":"","title":"The spanning ratio of the Delaunay triangulation is greater than pi/2.","year":2009,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","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":"McGill University; Carleton University","funders":"","keywords":"Delaunay triangulation; Combinatorics; Euclidean minimum spanning tree; Mathematics; Spanning tree; Position (finance); Discrete mathematics; Kruskal's algorithm","score_opus":0.02840429613742914,"score_gpt":0.2476286008519265,"score_spread":0.21922430471449736,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W94935907","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19009225,0.00019588822,0.7615309,0.039509147,0.0013578341,0.00064127694,0.00004969514,0.00007553307,0.0065475204],"genre_scores_gemma":[0.9936664,0.000004252138,0.002400626,0.0028131772,0.00011958523,0.000007746037,0.00002593906,0.000006212057,0.00095607166],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982126,0.00012695737,0.0003868525,0.00035620833,0.00059480284,0.00032261945],"domain_scores_gemma":[0.9983522,0.00027138644,0.00021042812,0.00044547138,0.0005260264,0.00019446579],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040565315,0.0001811328,0.00015543484,0.00036870432,0.0007201697,0.0003185546,0.0008616376,0.00008178378,0.00005022716],"category_scores_gemma":[0.00013268061,0.0001274968,0.00011971399,0.001324982,0.000081263235,0.00028484836,0.000046811372,0.00018849211,0.000040472747],"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.000018266259,0.00003172806,0.0013767532,0.0000051621246,0.000046213518,0.000004062308,0.00075662066,0.13900836,0.00020830533,0.7544357,0.004353373,0.09975545],"study_design_scores_gemma":[0.0005147282,0.00017205275,0.35751435,0.000055653054,0.000014803809,0.000021666723,0.000045941964,0.5189375,0.0013802794,0.11723175,0.0038053556,0.00030590166],"about_ca_topic_score_codex":0.00049129716,"about_ca_topic_score_gemma":0.0007069857,"teacher_disagreement_score":0.80357414,"about_ca_system_score_codex":0.00014259103,"about_ca_system_score_gemma":0.0010873979,"threshold_uncertainty_score":0.5539036},"labels":[],"label_agreement":null}]}