{"meta":{"query_hash":"a7a88dbf5485","filters":{"venue":"Discrete & Computational Geometry"},"cohort_total":172,"direct_labels_cover":0,"predictions_cover":172,"exported":172,"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/a7a88dbf5485","api":"https://metacan.xera.ac/api/v1/cohort?venue=Discrete+%26+Computational+Geometry"},"results":[{"id":"W1494368934","doi":"10.1007/s00454-001-0089-9","title":"Visibility Queries and Maintenance in Simple Polygons","year":2002,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":60,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Bell (Canada)","funders":"Army Research Office; Multidisciplinary University Research Initiative; Defense Advanced Research Projects Agency; National Science Foundation","keywords":"Visibility polygon; Visibility; Polygon (computer graphics); Simple polygon; Point in polygon; Star-shaped polygon; Mathematics; Disjoint sets; Computer science; Algorithm; Combinatorics; Regular polygon; Geometry; Geography","score_opus":0.01461476435847057,"score_gpt":0.24566496950688094,"score_spread":0.23105020514841038,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1494368934","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25598708,0.0010836514,0.7311695,0.00067201955,0.00013414894,0.00020779436,0.00090766465,0.0032486191,0.006589361],"genre_scores_gemma":[0.7630158,0.00062133593,0.2280183,0.0001323914,0.00011830425,0.000107726075,0.0020583307,0.000805972,0.00512179],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973884,0.0004003934,0.00029836746,0.00057035976,0.0009873852,0.0003552133],"domain_scores_gemma":[0.9866716,0.006399603,0.0012938407,0.0043379357,0.00085193187,0.00044512842],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018531184,0.00055302185,0.0015139463,0.0015824429,0.0016386681,0.0040234504,0.0029566681,0.0016782609,0.0041960287],"category_scores_gemma":[0.020033652,0.0011711887,0.0010354705,0.003492173,0.0021751244,0.011687781,0.004719984,0.0016464799,0.0007561179],"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.0025255906,0.0004978764,0.011637935,0.0010563846,0.00016684213,0.0018104647,0.0039154473,0.11155404,0.03179847,0.38600454,0.021344768,0.4276876],"study_design_scores_gemma":[0.00020020893,0.00020834681,0.0020467967,0.00009346583,0.00010290394,0.0009436056,0.00085216085,0.40133458,0.021157015,0.5566775,0.01631206,0.00007128111],"about_ca_topic_score_codex":0.00304959,"about_ca_topic_score_gemma":0.0024295384,"teacher_disagreement_score":0.0041960287,"about_ca_system_score_codex":0.00091321603,"about_ca_system_score_gemma":0.00082417496,"threshold_uncertainty_score":0.014037073},"labels":[],"label_agreement":null},{"id":"W1513971741","doi":"10.1007/s00454-020-00211-1","title":"Discrete Equidecomposability and Ehrhart Theory of Polygons","year":2020,"lang":"en","type":"preprint","venue":"Discrete & Computational Geometry","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","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 Toronto","funders":"National Science Foundation","keywords":"Bijection; Unimodular matrix; Mathematics; Combinatorics; Affine transformation; Existential quantification; Lattice (music); Section (typography); Integer (computer science); Equivalence (formal languages); Discrete mathematics; Pure mathematics; Computer science; Physics","score_opus":0.06239109846820105,"score_gpt":0.35755062370658797,"score_spread":0.2951595252383869,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1513971741","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5139551,0.0021538965,0.14289154,0.0031926776,0.00052979076,0.000055959536,0.0005279175,0.00014241444,0.3365507],"genre_scores_gemma":[0.94546705,0.0013183433,0.014463354,0.00034260095,0.00046513503,0.000033758886,0.00040052584,0.000066085035,0.03744311],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99932396,0.0001945998,0.000029274708,0.000118030075,0.00022181626,0.00011233802],"domain_scores_gemma":[0.99878615,0.00062423944,0.00011979523,0.00013163121,0.00018629657,0.00015185316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007854069,0.00064692274,0.00079242245,0.0020455488,0.0014068707,0.0035445627,0.00089625246,0.00076838955,0.007627311],"category_scores_gemma":[0.0030670422,0.00035051294,0.00068531465,0.0014926575,0.003523611,0.0045793625,0.002298162,0.0031390034,0.0007027615],"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.000014767182,0.000008264558,0.00007921927,0.000009156953,0.0000026406376,0.000029680074,0.00006866025,0.00049294333,0.00015762675,0.9964234,0.0003719646,0.0023415647],"study_design_scores_gemma":[0.0000076220695,0.0000084846615,0.00012033454,0.0000052887544,0.0000025490838,0.00005044498,0.00006617778,0.0016514306,0.00019337391,0.9958045,0.0020856617,0.000004253226],"about_ca_topic_score_codex":0.0013229608,"about_ca_topic_score_gemma":0.0006379748,"teacher_disagreement_score":0.007627311,"about_ca_system_score_codex":0.0013047329,"about_ca_system_score_gemma":0.00043898114,"threshold_uncertainty_score":0.025515914},"labels":[],"label_agreement":null},{"id":"W1590235295","doi":"10.1007/s00454-009-9179-x","title":"On a Question of Erdős and Ulam","year":2009,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Algebraic Geometry and Number Theory","field":"Mathematics","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia Hospital","funders":"Natural Sciences and Engineering Research Council of Canada; Hungarian Scientific Research Fund","keywords":"Mathematics; Conjecture; Rational point; Pairwise comparison; Set (abstract data type); Combinatorics; Algebraic number; Point (geometry); Plane (geometry); Rational number; Line (geometry); Algebraic curve; Algebraic surface; Discrete mathematics; Pure mathematics; Geometry; Mathematical analysis; Computer science","score_opus":0.01557051645572705,"score_gpt":0.3031591900003767,"score_spread":0.2875886735446497,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1590235295","genre_codex":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036361195,0.025647994,0.047166467,0.55626565,0.011993627,0.00005679059,0.0009726989,0.00039664167,0.321139],"genre_scores_gemma":[0.7564156,0.019300811,0.020551993,0.09674019,0.025558537,0.00021241688,0.0008066554,0.00078729395,0.07962657],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99728966,0.0010506824,0.00012541254,0.0006566646,0.00054756325,0.00033001244],"domain_scores_gemma":[0.99257374,0.0049770516,0.00034552393,0.0010296996,0.00079167966,0.00028223955],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036600742,0.0007511599,0.002435904,0.002369697,0.0068329093,0.0059629367,0.0019320953,0.0073257633,0.017486276],"category_scores_gemma":[0.021829387,0.0005297546,0.0012414344,0.003914379,0.013147422,0.03293204,0.008142139,0.008473681,0.0031746514],"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.00003369971,0.000008667985,0.00007310347,0.000036934354,0.000005803238,0.00002230225,0.00026935345,0.00008714372,0.000042078427,0.9740407,0.020824593,0.0045556137],"study_design_scores_gemma":[0.000016063028,0.000005994621,0.00008047623,0.000032932832,0.0000058827177,0.000054870132,0.00018790556,0.00022842396,0.00006494722,0.95355606,0.045756217,0.000010168682],"about_ca_topic_score_codex":0.0017163451,"about_ca_topic_score_gemma":0.00063783256,"teacher_disagreement_score":0.017486276,"about_ca_system_score_codex":0.0033533114,"about_ca_system_score_gemma":0.0011443453,"threshold_uncertainty_score":0.05849743},"labels":[],"label_agreement":null},{"id":"W1597231587","doi":"10.1007/s00454-015-9721-y","title":"Cubic Tessellations of the Helicosms","year":2015,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Geometric and Algebraic Topology","field":"Mathematics","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":"York University","funders":"","keywords":"Tessellation (computer graphics); Mathematics; Combinatorics; Quotient; Isomorphism (crystallography); Manifold (fluid mechanics); Euclidean space; Torus; Tetrahedron; Group (periodic table); Euclidean geometry; Cubic form; Geometry; Crystallography; Physics; Crystal structure","score_opus":0.07189115578235901,"score_gpt":0.3302668407585173,"score_spread":0.2583756849761583,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1597231587","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6423238,0.0012523634,0.106995374,0.0014061372,0.00045271387,0.0002137743,0.0025172895,0.0006301773,0.24420837],"genre_scores_gemma":[0.93753475,0.00062762277,0.022505414,0.00028378592,0.00011858003,0.000082869796,0.001047492,0.00019621165,0.03760328],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997547,0.000042311403,0.000010625218,0.000045359884,0.00007464323,0.00007238293],"domain_scores_gemma":[0.99955446,0.00012521994,0.00007115086,0.000070615606,0.0000741678,0.00010447672],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012493301,0.00034542472,0.00046585608,0.00092055474,0.0010389884,0.0023228365,0.0007013956,0.0005247746,0.014081139],"category_scores_gemma":[0.0010601615,0.00028062004,0.00030035738,0.0008479273,0.0014794461,0.00091266463,0.0016679594,0.0009851631,0.0014023007],"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.00020623958,0.000029023773,0.0009037832,0.00010980923,0.000019935671,0.00026867152,0.00054832356,0.015630933,0.0037274961,0.9419502,0.008910123,0.027695525],"study_design_scores_gemma":[0.00012700233,0.00006617901,0.0026765321,0.00005414633,0.000024468682,0.0007548332,0.0012158215,0.069150835,0.003932218,0.84815,0.07377948,0.000068444904],"about_ca_topic_score_codex":0.010071681,"about_ca_topic_score_gemma":0.008315381,"teacher_disagreement_score":0.014081139,"about_ca_system_score_codex":0.0008712822,"about_ca_system_score_gemma":0.00049818767,"threshold_uncertainty_score":0.047106147},"labels":[],"label_agreement":null},{"id":"W1610448541","doi":"10.1007/s00454-016-9796-0","title":"A Linear-Time Algorithm for the Geodesic Center of a Simple Polygon","year":2016,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":24,"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":"National Institutes of Natural Sciences; National Research Foundation of Korea","keywords":"Geodesic; Simple polygon; Mathematics; Combinatorics; Center (category theory); Polygon (computer graphics); Time complexity; Simple (philosophy); Path (computing); Shortest path problem; Point (geometry); Algorithm; Discrete mathematics; Regular polygon; Geometry; Computer science","score_opus":0.013262794940170849,"score_gpt":0.26509074850379444,"score_spread":0.2518279535636236,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1610448541","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009738539,0.000104286395,0.981384,0.00011091176,0.000085708576,0.0001814878,0.00011055661,0.0038990914,0.0043855137],"genre_scores_gemma":[0.10466834,0.000099696525,0.88931257,0.000046576974,0.000038329657,0.00016562779,0.0005089847,0.00086421834,0.004295628],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99957246,0.00003924159,0.000021070475,0.000114788454,0.00018969669,0.000062736595],"domain_scores_gemma":[0.99933606,0.00023173491,0.000046078716,0.0001233881,0.00018763727,0.0000750969],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004798085,0.0012228825,0.0012526368,0.0013691859,0.0011396387,0.0014212981,0.0022859115,0.0011437383,0.019762645],"category_scores_gemma":[0.002269447,0.0006809468,0.00093400595,0.0012825156,0.0007879535,0.0014963434,0.0029337225,0.0014699209,0.0044084974],"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.00052479346,0.0001670059,0.0011905311,0.00034907344,0.0000801362,0.00028303708,0.0003516615,0.13481437,0.020485008,0.04596155,0.019000117,0.7767927],"study_design_scores_gemma":[0.00018730294,0.00010955259,0.00023394343,0.00002254835,0.000028096123,0.00013030204,0.00013280362,0.95699036,0.009056273,0.022684628,0.010395107,0.000029145773],"about_ca_topic_score_codex":0.008683404,"about_ca_topic_score_gemma":0.010688669,"teacher_disagreement_score":0.019762645,"about_ca_system_score_codex":0.0013283171,"about_ca_system_score_gemma":0.0018715443,"threshold_uncertainty_score":0.06611258},"labels":[],"label_agreement":null},{"id":"W1672094821","doi":"10.1007/s00454-013-9508-y","title":"Open Sets Avoiding Integral Distances","year":2013,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Point processes and geometric inequalities","field":"Mathematics","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":"York University","funders":"","keywords":"Mathematics; Pairwise comparison; Dimension (graph theory); Lebesgue integration; Point (geometry); Lebesgue measure; Uniqueness; Inverse; Euclidean geometry; Combinatorics; Zero (linguistics); Upper and lower bounds; Euclidean distance; Measure (data warehouse); Open set; Discrete mathematics; Mathematical analysis; Geometry; Computer science","score_opus":0.07196974190510812,"score_gpt":0.3678062705645863,"score_spread":0.2958365286594782,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1672094821","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3137422,0.0036320093,0.47702208,0.0050769458,0.00064230774,0.000080855505,0.00038345388,0.00023308881,0.19918714],"genre_scores_gemma":[0.913426,0.002131488,0.04356371,0.00075380487,0.00085725845,0.00014328671,0.00040227547,0.00018814487,0.038534146],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99716187,0.0006276302,0.00015134446,0.0005870548,0.0010933614,0.00037874363],"domain_scores_gemma":[0.98795635,0.00829531,0.0010893465,0.0008058524,0.001038724,0.0008144725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002393189,0.0011051538,0.0021687855,0.0040922496,0.0028160869,0.0056773163,0.0024428312,0.0022766958,0.008379629],"category_scores_gemma":[0.014205823,0.00102884,0.0017660495,0.0023431622,0.006847885,0.0106146205,0.0077876034,0.00809399,0.001036686],"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.000009572094,0.000004902866,0.000045006098,0.000013294278,0.000003098652,0.00001968931,0.00007697525,0.00040133743,0.00009874906,0.99801105,0.00018460439,0.0011318768],"study_design_scores_gemma":[0.000005057781,0.0000052791997,0.000051297262,0.000006908099,0.000004284753,0.000039375973,0.000036576057,0.002206435,0.000098498866,0.9967079,0.00083483564,0.0000036912688],"about_ca_topic_score_codex":0.0009448292,"about_ca_topic_score_gemma":0.000674608,"teacher_disagreement_score":0.008379629,"about_ca_system_score_codex":0.0021919247,"about_ca_system_score_gemma":0.0007160082,"threshold_uncertainty_score":0.02803266},"labels":[],"label_agreement":null},{"id":"W1798872925","doi":"10.1007/s00454-013-9486-0","title":"An Approximation Algorithm for Computing Shortest Paths in Weighted 3-d Domains","year":2013,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Los Alamos National Laboratory; Laboratory Directed Research and Development; Natural Sciences and Engineering Research Council of Canada; U.S. Department of Energy","keywords":"Combinatorics; Mathematics; Geodesic; Voronoi diagram; Vertex (graph theory); Domain (mathematical analysis); Tetrahedron; Algorithm; Geometry; Graph; Mathematical analysis","score_opus":0.010904921221458088,"score_gpt":0.266188493852599,"score_spread":0.25528357263114093,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1798872925","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0062815417,0.00011125287,0.9923539,0.00004408064,0.00003415949,0.000045595683,0.00006613276,0.00038846844,0.00067488034],"genre_scores_gemma":[0.065059416,0.00018846572,0.93244123,0.000036587004,0.000021101876,0.00017018212,0.0003207887,0.00013496194,0.0016271872],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993303,0.00010771751,0.000046842302,0.00013325334,0.000310933,0.00007101845],"domain_scores_gemma":[0.9986217,0.0007250445,0.00008938312,0.00015814815,0.00032130347,0.00008443928],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00097563904,0.0012658928,0.0015498284,0.001964136,0.0008656263,0.0015670275,0.0026188216,0.0015806983,0.0037440988],"category_scores_gemma":[0.0050186682,0.0007827519,0.0011524304,0.00284701,0.00076994643,0.002054369,0.0023005141,0.0016075462,0.0009768788],"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.00023618505,0.00011603289,0.00081345375,0.00020999902,0.00007403483,0.00008329407,0.00017038026,0.67235374,0.004066165,0.026429826,0.0033673916,0.29207948],"study_design_scores_gemma":[0.000015690686,0.000022114526,0.000065400316,0.000009390018,0.000008846092,0.000024270876,0.000024155257,0.9912964,0.0006890074,0.006816784,0.001021498,0.0000064204482],"about_ca_topic_score_codex":0.009710218,"about_ca_topic_score_gemma":0.011679637,"teacher_disagreement_score":0.009710218,"about_ca_system_score_codex":0.0013416219,"about_ca_system_score_gemma":0.0017670139,"threshold_uncertainty_score":0.019307435},"labels":[],"label_agreement":null},{"id":"W1885355001","doi":"10.1007/s00454-016-9806-2","title":"Lines, Betweenness and Metric Spaces","year":2016,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Comisión Nacional de Investigación Científica y Tecnológica; Concordia University; Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Mathematics; Combinatorics; Metric space; Real line; Metric (unit); Upper and lower bounds; Intrinsic metric; Omega; Line (geometry); Injective metric space; Euclidean space; Discrete mathematics; Space (punctuation); Mathematical analysis; Geometry; Physics","score_opus":0.012752499103977768,"score_gpt":0.25322697153750856,"score_spread":0.2404744724335308,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1885355001","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.091991,0.016693367,0.7945149,0.0049282373,0.0008595837,0.00007001538,0.0004950459,0.0003385873,0.09010928],"genre_scores_gemma":[0.81097895,0.0072817514,0.13456404,0.0006844895,0.0010354269,0.00014447846,0.0007737532,0.00037976244,0.04415733],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99904305,0.00036909265,0.00005716834,0.00025261505,0.00020740308,0.00007072596],"domain_scores_gemma":[0.99769235,0.0010600503,0.0003090784,0.0002961349,0.0004175785,0.00022478921],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011167858,0.00061752397,0.0005946349,0.0031920597,0.001438138,0.0040179132,0.00089624734,0.0013739556,0.0072533847],"category_scores_gemma":[0.0054306504,0.00046378555,0.0005300114,0.0025708668,0.005359932,0.010414893,0.0019697458,0.0028402344,0.00085140456],"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.0000075050134,0.0000039944944,0.00012644232,0.000024290495,0.000004416491,0.000018160792,0.00014048725,0.0006750527,0.00022068656,0.99118984,0.00079699454,0.0067920103],"study_design_scores_gemma":[0.0000031179356,0.000009929401,0.000110786794,0.000011451298,0.0000034609038,0.00005819499,0.00010342056,0.0021656062,0.0001435395,0.98804396,0.009340628,0.0000059779272],"about_ca_topic_score_codex":0.0016112721,"about_ca_topic_score_gemma":0.0011724846,"teacher_disagreement_score":0.0072533847,"about_ca_system_score_codex":0.00095247076,"about_ca_system_score_gemma":0.00042986302,"threshold_uncertainty_score":0.024264991},"labels":[],"label_agreement":null},{"id":"W1965541390","doi":"10.1007/s00454-015-9691-0","title":"Fan Realizations of Type $$A$$ A Subword Complexes and Multi-associahedra of Rank 3","year":2015,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Fields Institute for Research in Mathematical Sciences; York University","funders":"","keywords":"Mathematics; Type (biology); Rank (graph theory); Combinatorics; Paleontology; Geology","score_opus":0.09453200583366962,"score_gpt":0.3719656877612763,"score_spread":0.2774336819276067,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1965541390","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79698604,0.0004004408,0.08243779,0.00036139708,0.00015153427,0.000063578285,0.00046616545,0.00029340238,0.1188396],"genre_scores_gemma":[0.9573465,0.00015179037,0.022062546,0.00006499418,0.000035620258,0.000056159173,0.00060290494,0.00009441251,0.019585086],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997812,0.000029442295,0.000013211131,0.00005207627,0.000069036905,0.000055068853],"domain_scores_gemma":[0.9997793,0.000044838598,0.000032924723,0.000026627804,0.000041935982,0.00007442315],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013593248,0.0004023832,0.00032472334,0.0009081534,0.0011016127,0.0017693317,0.0003917655,0.00042744886,0.009839133],"category_scores_gemma":[0.00047885676,0.00028918043,0.0004844924,0.00038483503,0.0010009082,0.0011070531,0.0011620263,0.00069001253,0.0010337383],"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.00008420516,0.000028973667,0.002025796,0.000065136446,0.000014597191,0.0006824601,0.00051542826,0.0043762373,0.01107328,0.96696055,0.0024231344,0.011750193],"study_design_scores_gemma":[0.00004543977,0.00013658329,0.008396969,0.000086375214,0.000045483343,0.002241703,0.002082016,0.06698769,0.018366229,0.8121317,0.08935694,0.00012280668],"about_ca_topic_score_codex":0.0012841014,"about_ca_topic_score_gemma":0.0021511363,"teacher_disagreement_score":0.009839133,"about_ca_system_score_codex":0.0006016845,"about_ca_system_score_gemma":0.00026936023,"threshold_uncertainty_score":0.032915235},"labels":[],"label_agreement":null},{"id":"W1968376338","doi":"10.1007/s00454-013-9564-3","title":"Pairwise Balanced Designs with Prescribed Minimum Dimension","year":2013,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Dimension (graph theory); Integer (computer science); Pairwise comparison; Subspace topology; Space (punctuation); Linear space; Upper and lower bounds; Discrete mathematics; Statistics; Mathematical analysis","score_opus":0.008800566591257537,"score_gpt":0.19598536669691574,"score_spread":0.18718480010565822,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1968376338","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044092663,0.00045179183,0.93011135,0.0005981081,0.00014829493,0.00022513854,0.0006112481,0.0002695645,0.023491835],"genre_scores_gemma":[0.57458895,0.0009159549,0.4063438,0.00072533666,0.0002917263,0.0012906328,0.0006095697,0.00023781683,0.0149962455],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99505424,0.0023974618,0.00024649137,0.00066240376,0.0012089614,0.00043045098],"domain_scores_gemma":[0.9909548,0.004640416,0.0011143388,0.0015207018,0.0012662656,0.0005035195],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029207212,0.0017743744,0.0018257067,0.0015188647,0.0008430094,0.002479776,0.0016839787,0.0020117364,0.0083576],"category_scores_gemma":[0.013548761,0.0011948625,0.00069365505,0.0017671543,0.0012909743,0.0021660342,0.0029162506,0.0014805221,0.0024658216],"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.000623428,0.00009510571,0.0006018363,0.0002871689,0.00009264785,0.0001062131,0.00011438531,0.05632145,0.013947441,0.867121,0.004312626,0.056376718],"study_design_scores_gemma":[0.00049237296,0.000638508,0.00041616,0.00014954295,0.000084853695,0.00035256715,0.00007378969,0.14660311,0.009010015,0.8301006,0.012019874,0.00005863199],"about_ca_topic_score_codex":0.00030484772,"about_ca_topic_score_gemma":0.00047503674,"teacher_disagreement_score":0.0083576,"about_ca_system_score_codex":0.0010906646,"about_ca_system_score_gemma":0.0013026232,"threshold_uncertainty_score":0.02795899},"labels":[],"label_agreement":null},{"id":"W1968541942","doi":"10.1007/s00454-004-1108-4","title":"Covering Things with Things","year":2004,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":65,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs; Fonds De La Recherche Scientifique - FNRS","keywords":"Mathematics; Combinatorics; Dimension (graph theory); Running time; Time complexity; Discrete mathematics; Computational geometry; Notation; Algorithm","score_opus":0.005501027611406248,"score_gpt":0.22838803611212843,"score_spread":0.22288700850072218,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1968541942","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016477387,0.010004802,0.27360007,0.024197707,0.0047703343,0.00010552015,0.000910284,0.0010918952,0.6688421],"genre_scores_gemma":[0.5626434,0.010208813,0.095575,0.009725685,0.0043922,0.0004222369,0.0023360394,0.0014610846,0.31323552],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99862695,0.00050601957,0.00006079721,0.00039018554,0.00028619333,0.00012979253],"domain_scores_gemma":[0.9984573,0.00048147346,0.000073524716,0.00064361386,0.00018407221,0.00016000937],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007192581,0.00083603576,0.00085709704,0.001424336,0.0033022685,0.0054422165,0.000782045,0.001593287,0.03771838],"category_scores_gemma":[0.004439026,0.000499505,0.0010940504,0.0020483083,0.0063243867,0.01274187,0.0055184723,0.003626136,0.008194515],"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.000004780768,0.0000016901057,0.000039556344,0.000020362035,0.000004290135,0.000021000442,0.00023180079,0.0001231741,0.00007728945,0.9857465,0.007936304,0.0057933205],"study_design_scores_gemma":[0.0000023356988,0.0000040673276,0.000051582407,0.000014955622,0.0000049736846,0.00008787535,0.00018001044,0.0002750242,0.00006742554,0.9032963,0.096010916,0.0000045573593],"about_ca_topic_score_codex":0.00087329483,"about_ca_topic_score_gemma":0.00075682974,"teacher_disagreement_score":0.03771838,"about_ca_system_score_codex":0.00112493,"about_ca_system_score_gemma":0.00060335186,"threshold_uncertainty_score":0.12618059},"labels":[],"label_agreement":null},{"id":"W1973111922","doi":"10.1007/s00454-009-9169-z","title":"Schnyder Woods for Higher Genus Triangulated Surfaces, with Applications to Encoding","year":2009,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":21,"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":"Fundação Carlos Chagas Filho de Amparo à Pesquisa do Estado do Rio de Janeiro; Conselho Nacional de Desenvolvimento Científico e Tecnológico","keywords":"Genus; Triangulation; Combinatorics; Mathematics; Encoding (memory); Traverse; ENCODE; Computer science; Geometry; Artificial intelligence; Geography; Biology; Zoology","score_opus":0.02141033322352696,"score_gpt":0.29123669885686976,"score_spread":0.2698263656333428,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1973111922","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07154549,0.00089532085,0.89213204,0.0005181428,0.000261702,0.00007335873,0.00019515298,0.0008087566,0.033570003],"genre_scores_gemma":[0.52469885,0.0019628955,0.42219177,0.00033514987,0.00023053325,0.00012550034,0.00047973034,0.0010065055,0.048968945],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996295,0.00008497963,0.000023124356,0.00007461587,0.00012736312,0.000060427737],"domain_scores_gemma":[0.9991904,0.00033465566,0.00008306716,0.00019527871,0.00012430274,0.00007226153],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000553373,0.00055656635,0.0006459065,0.001971143,0.001062689,0.0023356916,0.0012661392,0.0011330206,0.010598384],"category_scores_gemma":[0.0035144764,0.00045951217,0.00063435215,0.0021532902,0.0013985478,0.002765767,0.002618914,0.0016858788,0.0013454906],"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.000046947323,0.000023527014,0.00020898208,0.000051050734,0.0000050322883,0.00009001117,0.00020782833,0.012855272,0.0020162796,0.91456044,0.002432362,0.067502275],"study_design_scores_gemma":[0.000012493221,0.000035261626,0.00022109122,0.00004774885,0.000013480247,0.00022882823,0.00026939498,0.16068238,0.0038185515,0.82162493,0.013016239,0.000029686526],"about_ca_topic_score_codex":0.0015614525,"about_ca_topic_score_gemma":0.0027546736,"teacher_disagreement_score":0.010598384,"about_ca_system_score_codex":0.00086390536,"about_ca_system_score_gemma":0.00047062204,"threshold_uncertainty_score":0.035455167},"labels":[],"label_agreement":null},{"id":"W1973144466","doi":"10.1007/s00454-010-9247-2","title":"Combinatorial Structure of Schulte’s Chiral Polyhedra","year":2010,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Quasicrystal Structures and Properties","field":"Materials Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Polyhedron; Combinatorics; Mathematics; Euclidean space; Tetrahedron; Euclidean geometry; Geometry","score_opus":0.0051365867119782475,"score_gpt":0.2333390915597226,"score_spread":0.22820250484774435,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1973144466","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5103357,0.00042348393,0.20182309,0.0018487837,0.00020423919,0.00011303603,0.0007092112,0.000235823,0.28430656],"genre_scores_gemma":[0.9273703,0.00034841592,0.027109604,0.00028422187,0.00015883379,0.00011386936,0.0004959392,0.00016671137,0.043951996],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995484,0.00010950295,0.000018677107,0.0000661314,0.000162048,0.00009519317],"domain_scores_gemma":[0.9992986,0.0002547601,0.00009125358,0.00008515282,0.00014917119,0.00012110148],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004313481,0.00038129065,0.00056739466,0.0015497892,0.0014961603,0.003280494,0.001014756,0.00061752927,0.01016722],"category_scores_gemma":[0.0013131653,0.0003475318,0.00046690818,0.0011166635,0.0025389318,0.0021927152,0.0013706373,0.0018465435,0.001190059],"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.000007665893,0.0000061268097,0.000035760535,0.0000042528873,0.000001210129,0.000012840024,0.000033627377,0.00074784283,0.0001864378,0.9970413,0.00030095084,0.0016219042],"study_design_scores_gemma":[0.000008982128,0.000007898403,0.00007474083,0.000004510299,0.0000016436153,0.000036053,0.000046912955,0.0054532723,0.0002817009,0.99171644,0.0023609977,0.000006739728],"about_ca_topic_score_codex":0.0018008848,"about_ca_topic_score_gemma":0.0021442724,"teacher_disagreement_score":0.01016722,"about_ca_system_score_codex":0.0012405135,"about_ca_system_score_gemma":0.0007669477,"threshold_uncertainty_score":0.034012735},"labels":[],"label_agreement":null},{"id":"W1974074904","doi":"10.1007/s00454-009-9158-2","title":"Cuttings for Disks and Axis-Aligned Rectangles in Three-Space","year":2009,"lang":"en","type":"article","venue":"Discrete & 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 Calgary","funders":"Massachusetts Institute of Technology; National Science Foundation","keywords":"Combinatorics; Rectangle; Mathematics; Disjoint sets; Spanning tree; Simplex; Tree (set theory); Space (punctuation); Plane (geometry); Upper and lower bounds; Geometry; Discrete mathematics; Mathematical analysis; Computer science","score_opus":0.014208607201156805,"score_gpt":0.270826414557728,"score_spread":0.2566178073565712,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1974074904","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042842958,0.00043545358,0.9434938,0.00014925482,0.00012383316,0.00008819599,0.0001664207,0.00058963854,0.0121104475],"genre_scores_gemma":[0.28141284,0.00038786506,0.7088071,0.00008259006,0.000033872013,0.00016437922,0.00042910886,0.00047440032,0.008207878],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99949634,0.00009207307,0.000039049333,0.00009028998,0.00021981022,0.000062334875],"domain_scores_gemma":[0.9992136,0.00037575405,0.000067451474,0.000158212,0.00013409313,0.000050935294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005881865,0.0006273369,0.0007647444,0.0010060042,0.000717447,0.0015371492,0.0013407775,0.0010494116,0.0077409907],"category_scores_gemma":[0.0029066398,0.0007023816,0.0006610942,0.00092918746,0.0008910415,0.0012882327,0.001674212,0.0014003916,0.0012674677],"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.00036438042,0.000122023994,0.0013167837,0.00033133075,0.00004026788,0.0002785395,0.0008072176,0.15832505,0.018294446,0.5109613,0.009647631,0.29951116],"study_design_scores_gemma":[0.00009845484,0.00013991159,0.00063757773,0.0000927836,0.00002445421,0.00040532395,0.00037681067,0.70343596,0.0100185415,0.25979376,0.024928104,0.0000483688],"about_ca_topic_score_codex":0.0012482081,"about_ca_topic_score_gemma":0.0015692471,"teacher_disagreement_score":0.0077409907,"about_ca_system_score_codex":0.0005058983,"about_ca_system_score_gemma":0.00037869313,"threshold_uncertainty_score":0.025896251},"labels":[],"label_agreement":null},{"id":"W1975656597","doi":"10.1007/pl00009508","title":"On Minimum Stars and Maximum Matchings","year":2000,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":27,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Universität zu Köln; Natural Sciences and Engineering Research Council of Canada; Queen's University; Deutsche Forschungsgemeinschaft","keywords":"Combinatorics; Mathematics; Upper and lower bounds; Conjecture; Context (archaeology); Integer (computer science); Star (game theory); Euclidean geometry; Matching (statistics); Point (geometry); Center (category theory); Discrete mathematics; Geometry; Mathematical analysis; Statistics","score_opus":0.0116355487962758,"score_gpt":0.22789829827859076,"score_spread":0.21626274948231497,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1975656597","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10736116,0.0034925798,0.78423065,0.0047270465,0.000591146,0.00009305333,0.0008497748,0.00044637703,0.09820825],"genre_scores_gemma":[0.72876066,0.005400783,0.20844932,0.0015641795,0.0013576226,0.00017960166,0.001749832,0.00075511565,0.051782943],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99825925,0.0006349952,0.00008908962,0.00038979066,0.00039402468,0.00023285909],"domain_scores_gemma":[0.9923258,0.004801322,0.0007236669,0.0007488231,0.0006908367,0.00070956844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026796537,0.0011305349,0.0027093866,0.002966715,0.0021474885,0.0030722602,0.0028462708,0.0024177663,0.016414592],"category_scores_gemma":[0.018693984,0.0012946805,0.0016761945,0.005074581,0.0041392185,0.0100613795,0.005906551,0.0043992545,0.0020089555],"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.00008318642,0.000025435158,0.00029849182,0.000077439545,0.000014296979,0.000025818412,0.00015544324,0.012730527,0.00026363853,0.9666578,0.0041790307,0.015488885],"study_design_scores_gemma":[0.0000092092705,0.000010655051,0.00009480193,0.000015923591,0.0000044330995,0.000023104281,0.000041284693,0.016525224,0.00008666325,0.9807366,0.0024468573,0.000005169318],"about_ca_topic_score_codex":0.0019496982,"about_ca_topic_score_gemma":0.0015900288,"teacher_disagreement_score":0.016414592,"about_ca_system_score_codex":0.0016784375,"about_ca_system_score_gemma":0.00080750324,"threshold_uncertainty_score":0.05491227},"labels":[],"label_agreement":null},{"id":"W1975951981","doi":"10.1007/s00454-006-1279-2","title":"Incidence Theorems for Pseudoflats","year":2007,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Bounded function; Class (philosophy); Algebraic number; Combinatorics; Incidence (geometry); Discrete mathematics; Type (biology); Degree (music); Computer science; Artificial intelligence; Geometry","score_opus":0.013175561921324621,"score_gpt":0.29046009244640403,"score_spread":0.2772845305250794,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1975951981","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.088741474,0.0005020271,0.7403422,0.0013653977,0.00056786306,0.00011225441,0.00044821933,0.00042858804,0.16749191],"genre_scores_gemma":[0.7632083,0.0018372482,0.123299524,0.0013025705,0.00094153296,0.0004075662,0.0015766267,0.0009912775,0.10643531],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99900985,0.0001840759,0.000058287278,0.00016268394,0.00041830627,0.00016692572],"domain_scores_gemma":[0.9972556,0.0014270298,0.00023271152,0.00033991376,0.0005344301,0.00021037774],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011957928,0.0009436808,0.0006965924,0.0033907082,0.0020028206,0.0032712533,0.0015966546,0.0011586407,0.018139819],"category_scores_gemma":[0.0058016134,0.0007644439,0.0016609915,0.0014497967,0.0029446098,0.0060399114,0.0036636512,0.0044549014,0.0023979773],"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.00001283881,0.000011239229,0.00010917402,0.000015752343,0.000004125205,0.000025515059,0.0000640178,0.00088608917,0.00026557906,0.9934667,0.0012299626,0.003909033],"study_design_scores_gemma":[0.000011115799,0.000011294573,0.00011122114,0.000011280343,0.0000074462014,0.0000750578,0.00005055306,0.008129461,0.0005588261,0.987328,0.0036964393,0.000009310548],"about_ca_topic_score_codex":0.0011784862,"about_ca_topic_score_gemma":0.000996705,"teacher_disagreement_score":0.018139819,"about_ca_system_score_codex":0.0012723792,"about_ca_system_score_gemma":0.0006009283,"threshold_uncertainty_score":0.060683727},"labels":[],"label_agreement":null},{"id":"W1978402801","doi":"10.1007/s00454-012-9427-3","title":"Coning, Symmetry and Spherical Frameworks","year":2012,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Structural Analysis and Optimization","field":"Engineering","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University; Fields Institute for Research in Mathematical Sciences","funders":"Natural Sciences and Engineering Research Council of Canada; Deutsche Forschungsgemeinschaft","keywords":"Infinitesimal; Mathematics; Rigidity (electromagnetism); Pure mathematics; Euclidean space; Euclidean geometry; Dimension (graph theory); Symmetric space; Metric (unit); Symmetry (geometry); Combinatorics; Mathematical analysis; Geometry; Physics; Quantum mechanics","score_opus":0.005477161084116109,"score_gpt":0.22104971207949842,"score_spread":0.2155725509953823,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1978402801","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11302921,0.005201831,0.5561788,0.0038335654,0.0010058593,0.000097248914,0.000578119,0.00035695737,0.31971836],"genre_scores_gemma":[0.85188735,0.0043747844,0.075121485,0.00079255766,0.0009559924,0.000111797155,0.00067380216,0.00033366968,0.0657485],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994912,0.00015854542,0.000016678117,0.00009317347,0.00015397658,0.000086391396],"domain_scores_gemma":[0.999496,0.00010611629,0.000091127666,0.00010756886,0.0001051853,0.00009399813],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084260094,0.0007449821,0.0007090664,0.0011303078,0.0012799437,0.001826853,0.00083235267,0.00082012627,0.00758147],"category_scores_gemma":[0.0017257779,0.00024941223,0.00070635846,0.0009182255,0.0030345358,0.0023574661,0.0016444174,0.0015970294,0.0010161225],"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.000007864997,0.000004987706,0.00003703469,0.0000090786325,0.0000024007325,0.00001004934,0.000019403484,0.004342949,0.00016161315,0.9903459,0.00094697025,0.0041118017],"study_design_scores_gemma":[0.0000052718256,0.000012557458,0.00007921714,0.000006781862,0.0000018800304,0.000032642372,0.0000435724,0.018113676,0.0001322015,0.9757295,0.0058355355,0.000007207429],"about_ca_topic_score_codex":0.0038484728,"about_ca_topic_score_gemma":0.0039737057,"teacher_disagreement_score":0.00758147,"about_ca_system_score_codex":0.0007239625,"about_ca_system_score_gemma":0.0012260887,"threshold_uncertainty_score":0.025362551},"labels":[],"label_agreement":null},{"id":"W1979867394","doi":"10.1007/s00454-009-9159-1","title":"On the Exact Maximum Complexity of Minkowski Sums of Polytopes","year":2009,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":20,"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":"Tel Aviv University; Israel Science Foundation","keywords":"Polytope; Combinatorics; Mathematics; Minkowski space; Minkowski addition; Bounded function; Mathematical analysis; Geometry","score_opus":0.02933775667041619,"score_gpt":0.27031486102212404,"score_spread":0.24097710435170785,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1979867394","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41652322,0.00459088,0.5040091,0.0045176283,0.0006012766,0.0001306567,0.001732228,0.00078395143,0.067111015],"genre_scores_gemma":[0.90322584,0.0016192478,0.080899715,0.00052668713,0.00061345997,0.00018312162,0.0012809957,0.000796374,0.0108546335],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967637,0.0010551879,0.00019887161,0.0005075336,0.0010021274,0.00047247933],"domain_scores_gemma":[0.9777779,0.01802642,0.0007829607,0.001791984,0.00074378063,0.00087693037],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031571423,0.0015391088,0.002311621,0.0018480496,0.0013604965,0.005244242,0.0043533077,0.0017781876,0.011324042],"category_scores_gemma":[0.028670464,0.0012454974,0.0016107798,0.0023438905,0.0034288855,0.013434972,0.0052977144,0.004644096,0.0010047479],"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.0007137501,0.00016624134,0.0025718366,0.00065002375,0.00013706535,0.00017901583,0.00054750795,0.15651695,0.00365956,0.7710406,0.0105829425,0.053234465],"study_design_scores_gemma":[0.000023325105,0.00004163546,0.00063523016,0.000043126103,0.000031217412,0.000121804886,0.00010470988,0.2124938,0.0012743179,0.78342164,0.0017813339,0.00002787276],"about_ca_topic_score_codex":0.0011029247,"about_ca_topic_score_gemma":0.0016705943,"teacher_disagreement_score":0.011324042,"about_ca_system_score_codex":0.0020513565,"about_ca_system_score_gemma":0.0012425807,"threshold_uncertainty_score":0.037882686},"labels":[],"label_agreement":null},{"id":"W1980936231","doi":"10.1007/s004540010023","title":"Covering Squares with Squares","year":2000,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Division of Mathematical Sciences; University of Alberta; National Science Foundation","keywords":"Mathematics; Combinatorics; Sequence (biology); Square (algebra); Least-squares function approximation; Geometry; Statistics; Chemistry","score_opus":0.003261643802897685,"score_gpt":0.18219877660642803,"score_spread":0.17893713280353035,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1980936231","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.061478224,0.0026532894,0.73459035,0.0018330548,0.001187883,0.00009522137,0.00048775264,0.0011633674,0.1965109],"genre_scores_gemma":[0.6576729,0.0026889136,0.21257526,0.0015309319,0.0011227075,0.00017492639,0.00084711215,0.0010861096,0.1223011],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994,0.00022174134,0.000020767147,0.00014795097,0.00015769768,0.000051839572],"domain_scores_gemma":[0.9989492,0.0004488314,0.00007446326,0.00030806882,0.00013651019,0.000082949846],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031788557,0.00076598866,0.0008013063,0.0007180544,0.00067168643,0.0012110821,0.0006163915,0.00083577406,0.014627865],"category_scores_gemma":[0.003523464,0.00043943874,0.0005045016,0.0011686144,0.0010277873,0.0017835542,0.0021008982,0.00176543,0.0043941992],"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.00008895839,0.000015152309,0.0002659662,0.0001405504,0.000030822874,0.00010222023,0.00014101737,0.014776964,0.0038827593,0.8628445,0.018483436,0.09922772],"study_design_scores_gemma":[0.000015831652,0.00003984756,0.0002987886,0.000021484382,0.000015015603,0.0002743949,0.0000619897,0.04416376,0.0023407943,0.9108143,0.041939255,0.000014544131],"about_ca_topic_score_codex":0.00049588986,"about_ca_topic_score_gemma":0.0005221745,"teacher_disagreement_score":0.014627865,"about_ca_system_score_codex":0.00038225783,"about_ca_system_score_gemma":0.00026237886,"threshold_uncertainty_score":0.048935115},"labels":[],"label_agreement":null},{"id":"W1981418501","doi":"10.1007/s004540010087","title":"Face-transitive polyhedra with rectangular faces and icosahedral symmetry","year":2001,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Structural Analysis and Optimization","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":"University of Toronto","funders":"","keywords":"Icosahedral symmetry; Polyhedron; Combinatorics; Mathematics; Homogeneous space; Dual polyhedron; Symmetry (geometry); Group (periodic table); Transitive relation; Face (sociological concept); One-dimensional symmetry group; Symmetry group; Geometry; Physics","score_opus":0.004026675687228111,"score_gpt":0.19544741270510382,"score_spread":0.1914207370178757,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1981418501","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17154974,0.0004440888,0.57615095,0.00051686063,0.0006334508,0.00040515303,0.0010822462,0.00085492095,0.24836265],"genre_scores_gemma":[0.82245135,0.00041506634,0.1473696,0.00025821183,0.00016051295,0.00038338886,0.0009126771,0.00032132532,0.027727855],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99948514,0.000106073654,0.00002993509,0.00008234785,0.00020218939,0.00009427613],"domain_scores_gemma":[0.9995906,0.00009413649,0.000059299957,0.00015195503,0.000055350014,0.000048701466],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002730552,0.000637471,0.00078612356,0.00074424135,0.0012172485,0.0017495513,0.0010810117,0.00070103206,0.01227571],"category_scores_gemma":[0.0011926708,0.00039145863,0.0006950695,0.0007669211,0.0017711931,0.0010130203,0.0012170724,0.001249867,0.0019587649],"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.000046766036,0.00002529044,0.0001539235,0.000055169745,0.000009469445,0.00014767244,0.000080723665,0.011650277,0.002498954,0.96348053,0.0034750733,0.018376146],"study_design_scores_gemma":[0.00005450079,0.000074380594,0.0002701668,0.00002881812,0.000014436369,0.0004831895,0.00019667148,0.04949858,0.0042957324,0.9271606,0.017892215,0.0000305979],"about_ca_topic_score_codex":0.00088779896,"about_ca_topic_score_gemma":0.0010569834,"teacher_disagreement_score":0.01227571,"about_ca_system_score_codex":0.00038434245,"about_ca_system_score_gemma":0.0006786508,"threshold_uncertainty_score":0.04106629},"labels":[],"label_agreement":null},{"id":"W1981450700","doi":"10.1007/s00454-012-9444-2","title":"Symmetries of Equivelar 4-Toroids","year":2012,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Geometric and Algebraic Topology","field":"Mathematics","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University; Fields Institute for Research in Mathematical Sciences","funders":"Natural Sciences and Engineering Research Council of Canada; Javna Agencija za Raziskovalno Dejavnost RS; European Science Foundation","keywords":"Dihedral group; Mathematics; Homogeneous space; One-dimensional symmetry group; Toroid; Combinatorics; Dihedral angle; Symmetry group; Lattice (music); Symmetry (geometry); Group (periodic table); Geometry; Pure mathematics; Physics; Quantum mechanics","score_opus":0.04283573802574372,"score_gpt":0.33346577945444855,"score_spread":0.29063004142870486,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1981450700","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6843414,0.0005319197,0.07546459,0.0013374706,0.0007443683,0.0001711314,0.00065955997,0.0005940182,0.23615561],"genre_scores_gemma":[0.9414079,0.00032407837,0.016004281,0.00048437313,0.00026501575,0.00008782303,0.0005676955,0.00026806296,0.04059087],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99934393,0.000114484115,0.00004208339,0.0001317924,0.00019095805,0.00017678627],"domain_scores_gemma":[0.99960965,0.00007066747,0.00008665472,0.00008434784,0.000059751255,0.00008907803],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004879634,0.00065848057,0.0007062841,0.0014813408,0.0016591208,0.0026830647,0.0011576248,0.0008058962,0.01262634],"category_scores_gemma":[0.0010384035,0.00045609887,0.0010216973,0.00070610974,0.002934674,0.0023822202,0.0025575454,0.0020167266,0.0019703684],"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.00006657776,0.000019109442,0.00019827393,0.000017899793,0.00000829776,0.0001409548,0.00029657932,0.000888542,0.0012005616,0.99094313,0.0010061406,0.0052140225],"study_design_scores_gemma":[0.00003636296,0.00003791072,0.00046575846,0.000009482317,0.000009851872,0.00017603583,0.0003956401,0.002075159,0.0009115443,0.98805773,0.0078045037,0.000019968744],"about_ca_topic_score_codex":0.0014900522,"about_ca_topic_score_gemma":0.0012388387,"teacher_disagreement_score":0.01262634,"about_ca_system_score_codex":0.001194036,"about_ca_system_score_gemma":0.00057760626,"threshold_uncertainty_score":0.042239368},"labels":[],"label_agreement":null},{"id":"W1982128583","doi":"10.1007/s00454-008-9127-1","title":"Traversing a Set of Points with a Minimum Number of Turns","year":2008,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":21,"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":"National Science Foundation","keywords":"Combinatorics; Mathematics; Conjecture; Upper and lower bounds; Path (computing); Mathematical analysis","score_opus":0.018935165917497356,"score_gpt":0.2642083172706151,"score_spread":0.24527315135311775,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1982128583","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31438175,0.00021331404,0.659613,0.00042346795,0.00013582478,0.0005862334,0.00097039744,0.001643498,0.022032492],"genre_scores_gemma":[0.50122255,0.00013079778,0.48945823,0.00005723938,0.000017901282,0.00028627468,0.0012653143,0.00030031375,0.0072614234],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994137,0.00008001861,0.00003513126,0.00012625917,0.0002130779,0.00013179143],"domain_scores_gemma":[0.9991021,0.00033931062,0.00009887096,0.00016502391,0.00020086578,0.00009395222],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037248162,0.0009944073,0.0013228065,0.0014032472,0.0012636676,0.0011948501,0.0014713521,0.0016001367,0.009276235],"category_scores_gemma":[0.003092866,0.0008292324,0.0008586572,0.0009393776,0.00059429865,0.0016040326,0.001763939,0.0009614203,0.0018806368],"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.0024953084,0.0007064877,0.012097379,0.00083096424,0.00030306506,0.0013526757,0.0013246114,0.45090404,0.094016336,0.036587026,0.01153069,0.38785145],"study_design_scores_gemma":[0.00015285001,0.00090282405,0.0029847973,0.0001606352,0.00013180793,0.0005245891,0.00082561525,0.8976529,0.04380885,0.035791002,0.017007323,0.00005665557],"about_ca_topic_score_codex":0.0024347433,"about_ca_topic_score_gemma":0.004760052,"teacher_disagreement_score":0.009276235,"about_ca_system_score_codex":0.0005308259,"about_ca_system_score_gemma":0.0011642377,"threshold_uncertainty_score":0.031032145},"labels":[],"label_agreement":null},{"id":"W1982875144","doi":"10.1007/s004540010048","title":"Realizations of Regular Toroidal Maps of Type {4,4}","year":2000,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University; University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Toroid; Mathematics; Combinatorics; Type (biology); Geometry; Physics; Plasma; Quantum mechanics","score_opus":0.04224917224942598,"score_gpt":0.3409932152187975,"score_spread":0.2987440429693715,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1982875144","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79537,0.00032180577,0.069980174,0.00076982664,0.0005051059,0.00007344907,0.00045611395,0.00051260577,0.13201109],"genre_scores_gemma":[0.97453624,0.00011261838,0.010478284,0.00009690911,0.00010742432,0.000049149337,0.00039831374,0.00009113124,0.014129909],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99954504,0.000087024186,0.000026122023,0.00006986218,0.00009978371,0.00017223464],"domain_scores_gemma":[0.99952066,0.00010509265,0.00009599514,0.00006766952,0.0000664207,0.00014416862],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036837938,0.0005389592,0.0005761769,0.00093690655,0.001857402,0.0031057054,0.0007233084,0.0010365626,0.0072335205],"category_scores_gemma":[0.0011210265,0.0004189003,0.00071662804,0.00052150304,0.0020479641,0.0017973568,0.0013945372,0.0013432212,0.00084190076],"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.00008795322,0.000011499593,0.000109765526,0.000013809478,0.000005073667,0.00015904079,0.00020831445,0.0010001074,0.0011850405,0.9954515,0.00049769506,0.0012701673],"study_design_scores_gemma":[0.000045258148,0.000050050454,0.0004887752,0.000017856237,0.000015028272,0.00017099691,0.0004253873,0.008226902,0.0022552807,0.9826282,0.005646031,0.000030097348],"about_ca_topic_score_codex":0.0009995745,"about_ca_topic_score_gemma":0.00085969194,"teacher_disagreement_score":0.0072335205,"about_ca_system_score_codex":0.0012213169,"about_ca_system_score_gemma":0.0006083194,"threshold_uncertainty_score":0.024198592},"labels":[],"label_agreement":null},{"id":"W1985563250","doi":"10.1007/s00454-003-0781-z","title":"Consequences of Pure Point Diffraction Spectra for Multiset Substitution Systems","year":2003,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Quasicrystal Structures and Properties","field":"Materials Science","cited_by":44,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Multiset; Substitution (logic); Point (geometry); Substitution tiling; Lattice (music); Dynamical systems theory","score_opus":0.01923316589679318,"score_gpt":0.2617628820439277,"score_spread":0.24252971614713453,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1985563250","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81046265,0.00042765736,0.08320221,0.0018036275,0.00031207592,0.000051121075,0.00041600142,0.0005480771,0.102776565],"genre_scores_gemma":[0.9876446,0.00013744948,0.008198358,0.00021817308,0.000056400328,0.000022095408,0.00015471112,0.00012405524,0.0034441766],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99925953,0.00019334107,0.00003698314,0.00009680906,0.00028486806,0.00012850617],"domain_scores_gemma":[0.9982345,0.0007388055,0.00015341632,0.00042940382,0.00026639897,0.00017740193],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010728759,0.0006408017,0.00076123077,0.00117189,0.0014297903,0.0021055168,0.0011056409,0.0014165823,0.011417828],"category_scores_gemma":[0.0043064607,0.0004649883,0.00040458466,0.00063762226,0.0025160967,0.0031136598,0.0013208978,0.0012900358,0.0006191051],"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.00013613656,0.000035144145,0.00037686102,0.00004762282,0.0000071863856,0.00021104234,0.0001008528,0.003999746,0.007920196,0.9828075,0.0012791059,0.0030786071],"study_design_scores_gemma":[0.00004566538,0.000023054903,0.00056806917,0.000012351938,0.000005896549,0.00034465932,0.00014434787,0.043773923,0.0061439914,0.94825953,0.0006577505,0.000020736246],"about_ca_topic_score_codex":0.00056372554,"about_ca_topic_score_gemma":0.0006208754,"teacher_disagreement_score":0.011417828,"about_ca_system_score_codex":0.00046728083,"about_ca_system_score_gemma":0.00046586693,"threshold_uncertainty_score":0.038196445},"labels":[],"label_agreement":null},{"id":"W1989753182","doi":"10.1007/s00454-015-9682-1","title":"Small Extended Formulations for Cyclic Polytopes","year":2015,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","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 Waterloo","funders":"","keywords":"Polytope; Dimension (graph theory); Iterated function; Factorization; Yield (engineering); Base (topology); Tensor product","score_opus":0.15288814404874046,"score_gpt":0.40237703885139203,"score_spread":0.24948889480265157,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1989753182","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032969758,0.00066702504,0.9178627,0.0008402406,0.00034942597,0.0001126162,0.00042271067,0.00011616465,0.04665942],"genre_scores_gemma":[0.5814992,0.0018930879,0.31613767,0.0010031534,0.0008128046,0.00081132463,0.001693851,0.0007866756,0.09536225],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995536,0.0001631948,0.000019601153,0.000083798404,0.000130358,0.000049462607],"domain_scores_gemma":[0.9989772,0.00054984045,0.00007316845,0.00014253515,0.00013293444,0.00012440985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009047264,0.0012838502,0.00089180545,0.00069689646,0.00050841883,0.0015897411,0.0015431774,0.0011299422,0.017283605],"category_scores_gemma":[0.0036146066,0.00049769145,0.0009934192,0.0007071236,0.0014285218,0.0026973088,0.0027692216,0.0032274583,0.0010912794],"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.000060014325,0.000057517293,0.00015409183,0.00019678127,0.000025247693,0.000105567866,0.00010841498,0.13360141,0.0017674797,0.83730775,0.0073925974,0.019223096],"study_design_scores_gemma":[0.000022138533,0.00006244166,0.00011280873,0.000041401898,0.000014166998,0.00005911863,0.000071913375,0.52701694,0.00049385737,0.46013483,0.011956814,0.000013556898],"about_ca_topic_score_codex":0.0010943209,"about_ca_topic_score_gemma":0.0020008704,"teacher_disagreement_score":0.017283605,"about_ca_system_score_codex":0.0009336206,"about_ca_system_score_gemma":0.0006345729,"threshold_uncertainty_score":0.057819486},"labels":[],"label_agreement":null},{"id":"W1990790475","doi":"10.1007/s00454-009-9199-6","title":"On the Characterization of Expansion Maps for Self-Affine Tilings","year":2009,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Mathematical Dynamics and Fractals","field":"Mathematics","cited_by":43,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Mathematics; Affine transformation; Combinatorics; Conjecture; Diagonalizable matrix; Dimension (graph theory); Pure mathematics; Symmetric matrix; Eigenvalues and eigenvectors","score_opus":0.022022949361047824,"score_gpt":0.2929062644779385,"score_spread":0.2708833151168907,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1990790475","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.74879366,0.0010738244,0.19323279,0.0006207456,0.00015919405,0.00008311692,0.00026979312,0.00029160356,0.055475358],"genre_scores_gemma":[0.9724835,0.00052826153,0.014839281,0.00013386435,0.00019949191,0.000047647118,0.0003462949,0.00012811756,0.011293491],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996061,0.000073573654,0.000026872589,0.000098898476,0.00010165914,0.00009286179],"domain_scores_gemma":[0.99723047,0.0013816187,0.00041194266,0.00023160332,0.0003718867,0.00037259102],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007144058,0.0006504138,0.0007176922,0.0028301387,0.0009792752,0.002722976,0.00076925557,0.0010649936,0.0054991413],"category_scores_gemma":[0.0044089393,0.00038722155,0.0005398425,0.0011105414,0.0027346304,0.003978104,0.0019725836,0.0016599345,0.00060652295],"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.00009070701,0.00004509609,0.00092498836,0.00006367051,0.0000089405585,0.00019978214,0.0005246561,0.005339062,0.0061705746,0.9700071,0.0010255546,0.0155998785],"study_design_scores_gemma":[0.000023919107,0.00011504319,0.0015953638,0.000053752745,0.000016870055,0.0005544024,0.00039457515,0.072716236,0.004895116,0.9134152,0.006175868,0.000043551478],"about_ca_topic_score_codex":0.00049544976,"about_ca_topic_score_gemma":0.00039388918,"teacher_disagreement_score":0.0054991413,"about_ca_system_score_codex":0.00070985506,"about_ca_system_score_gemma":0.0002858865,"threshold_uncertainty_score":0.018396497},"labels":[],"label_agreement":null},{"id":"W1995123299","doi":"10.1007/s00454-001-0045-8","title":"Approximation for Minimum Triangulations of Simplicial Convex 3-Polytopes","year":2001,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Polytope; Mathematics; Triangulation; Point set triangulation; Convex polytope; Regular polygon; Tetrahedron; Minimum-weight triangulation; Pitteway triangulation; Delaunay triangulation; Discrete mathematics; Convex set; Bowyer–Watson algorithm; Convex optimization; Geometry","score_opus":0.022846532477707314,"score_gpt":0.2893487290770637,"score_spread":0.2665021965993564,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1995123299","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.059171945,0.0003326803,0.93375736,0.00029008507,0.00007439437,0.0000685782,0.0003655359,0.0003898068,0.005549542],"genre_scores_gemma":[0.38069668,0.00039893924,0.6125324,0.000086697466,0.000050982377,0.00018370176,0.0013868124,0.0004534196,0.0042104246],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994435,0.00012653609,0.000030075082,0.00008098015,0.0002452428,0.000073836],"domain_scores_gemma":[0.9983967,0.00095357833,0.00013952902,0.00017538153,0.0002391167,0.000095745294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007794295,0.00090306083,0.0017886031,0.0014570083,0.0006183447,0.0018150121,0.002089282,0.0017750527,0.0067677344],"category_scores_gemma":[0.0077300756,0.00095653767,0.001151862,0.0012013047,0.00082504406,0.0017682288,0.002705336,0.002343935,0.0010169573],"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.0004105665,0.00015266119,0.0018502551,0.0006252024,0.00007972428,0.00015855899,0.00039422576,0.70671165,0.005304683,0.12275806,0.0078056073,0.15374875],"study_design_scores_gemma":[0.000022319826,0.000025176862,0.0001812468,0.000037341197,0.000007822685,0.000042772383,0.00006270577,0.9557533,0.00080728665,0.041756026,0.0012969539,0.0000070138744],"about_ca_topic_score_codex":0.0033129328,"about_ca_topic_score_gemma":0.0052470984,"teacher_disagreement_score":0.0067677344,"about_ca_system_score_codex":0.0013306261,"about_ca_system_score_gemma":0.0006474538,"threshold_uncertainty_score":0.022640288},"labels":[],"label_agreement":null},{"id":"W1995366441","doi":"10.1007/s00454-007-9026-x","title":"Enumerating Constrained Non-crossing Minimally Rigid Frameworks","year":2007,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Structural Analysis and Optimization","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; Defense Advanced Research Projects Agency; Fonds Québécois de la Recherche sur la Nature et les Technologies; National Science Foundation","keywords":"Mathematics; Combinatorics; Set (abstract data type); Property (philosophy); Space (punctuation); Point (geometry); Graph; Discrete mathematics; Algorithm; Computer science; Geometry","score_opus":0.004755983189725644,"score_gpt":0.23650085020260608,"score_spread":0.23174486701288044,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1995366441","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1860423,0.0007399692,0.7642824,0.0005645747,0.0001263654,0.00012714256,0.0011320583,0.0012719738,0.04571324],"genre_scores_gemma":[0.72117054,0.00056144886,0.2603047,0.00024795614,0.0000624099,0.00021673886,0.0024279447,0.0007882089,0.014220166],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990761,0.00021801419,0.000049066315,0.00018831567,0.00029066022,0.00017786046],"domain_scores_gemma":[0.9971892,0.0017816395,0.00019773832,0.00041380533,0.00021557182,0.00020217791],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010222085,0.0012670659,0.0015609732,0.0020532697,0.0015030504,0.002165554,0.0032000882,0.002360735,0.01581169],"category_scores_gemma":[0.007590118,0.0009546685,0.0011893711,0.0021869193,0.0015723298,0.004060874,0.0052843383,0.002922227,0.0011794532],"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.00013334281,0.000092862174,0.00075259234,0.00029097192,0.000035378114,0.00018233381,0.00024185293,0.15304634,0.0018927649,0.77407014,0.005455487,0.063806005],"study_design_scores_gemma":[0.000016228232,0.00003621604,0.00018597076,0.000046128374,0.000015175589,0.00011623832,0.00010492878,0.228849,0.00085983844,0.766837,0.0029154434,0.00001780133],"about_ca_topic_score_codex":0.0013288948,"about_ca_topic_score_gemma":0.0031226226,"teacher_disagreement_score":0.01581169,"about_ca_system_score_codex":0.00095226336,"about_ca_system_score_gemma":0.0008374295,"threshold_uncertainty_score":0.052895367},"labels":[],"label_agreement":null},{"id":"W1998526928","doi":"10.1007/s00454-006-1278-3","title":"Lines Tangent to Four Triangles in Three-Dimensional Space","year":2007,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Institut national de recherche en informatique et en automatique (INRIA); McGill University; National Science Foundation","keywords":"Tangent; Mathematics; Disjoint sets; General position; Combinatorics; Tangent cone; Tangent space; Tangent vector; Position (finance); Geometry; Space (punctuation); Computer science","score_opus":0.02448682600550685,"score_gpt":0.2819633764569991,"score_spread":0.25747655045149226,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1998526928","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1936033,0.00020118267,0.7233618,0.0009678139,0.0005417442,0.00048581642,0.0009809233,0.0014958814,0.078361616],"genre_scores_gemma":[0.693788,0.00034788364,0.26261786,0.0001233323,0.000057389097,0.00031680078,0.0012343391,0.00044829675,0.041066084],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996126,0.000079085956,0.00001906084,0.000051883646,0.00019022153,0.000047188725],"domain_scores_gemma":[0.99932265,0.00011935734,0.0001019742,0.00009596304,0.00027414865,0.000085999636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026680683,0.0007004975,0.00031033048,0.0013799131,0.00088460086,0.0016621288,0.00096345006,0.0010800754,0.017384842],"category_scores_gemma":[0.0022707777,0.0003587575,0.00029376216,0.0014911004,0.0010372649,0.0010950122,0.0013080301,0.001383999,0.0030739782],"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.0009440035,0.0002948869,0.0056245467,0.00027273048,0.0000621376,0.0013026701,0.0022994273,0.093616806,0.051180564,0.5081614,0.022322992,0.31391793],"study_design_scores_gemma":[0.00031773277,0.00052793906,0.004810279,0.00014889422,0.000050771985,0.0012856429,0.0030718825,0.46549696,0.078110896,0.24863477,0.19738477,0.00015946163],"about_ca_topic_score_codex":0.0027667682,"about_ca_topic_score_gemma":0.0020559465,"teacher_disagreement_score":0.017384842,"about_ca_system_score_codex":0.0006346548,"about_ca_system_score_gemma":0.00058931607,"threshold_uncertainty_score":0.05815816},"labels":[],"label_agreement":null},{"id":"W1999457828","doi":"10.1007/s00454-004-0831-1","title":"The Kneser?Poulsen Conjecture for Spherical Polytopes","year":2004,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Mathematics and Applications","field":"Mathematics","cited_by":21,"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":"Hungarian Scientific Research Fund; National Science Foundation","keywords":"Conjecture; Mathematics; Polytope; Combinatorics","score_opus":0.031805751936509405,"score_gpt":0.34042308378678104,"score_spread":0.3086173318502716,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1999457828","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31669894,0.0033729812,0.08452543,0.031006554,0.0027813392,0.000061990235,0.0014606464,0.00095886586,0.55913335],"genre_scores_gemma":[0.9326152,0.0018780449,0.011760265,0.0026971523,0.0014618175,0.000070923634,0.0012346539,0.00029569076,0.047986235],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987779,0.00023062533,0.000062648905,0.000317711,0.00032430468,0.0002867437],"domain_scores_gemma":[0.99735117,0.0012170993,0.00028238192,0.00049770053,0.00030013712,0.00035154965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011445414,0.0010575645,0.0018453125,0.0018417255,0.0036119765,0.005297956,0.0014672708,0.0033734976,0.01983927],"category_scores_gemma":[0.0076416307,0.0007962958,0.0014708744,0.0015249003,0.0050275885,0.009652697,0.004340896,0.0061374204,0.0035831837],"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.0000918891,0.000022455431,0.00035602512,0.0001057858,0.000015758273,0.00010649812,0.00020682525,0.002385644,0.00032882192,0.9816544,0.010080348,0.0046454715],"study_design_scores_gemma":[0.000016180853,0.000007665062,0.00019963327,0.000023328912,0.0000064149003,0.00007513756,0.00013827295,0.0032490958,0.00014765082,0.9914492,0.0046727047,0.000014665072],"about_ca_topic_score_codex":0.0030043614,"about_ca_topic_score_gemma":0.0026010259,"teacher_disagreement_score":0.01983927,"about_ca_system_score_codex":0.0015642025,"about_ca_system_score_gemma":0.0007275725,"threshold_uncertainty_score":0.06636894},"labels":[],"label_agreement":null},{"id":"W2001019475","doi":"10.1007/s00454-010-9310-z","title":"Small Drawings of Outerplanar Graphs, Series-Parallel Graphs, and Other Planar Graphs","year":2010,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":37,"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":"Pathwidth; Chordal graph; Combinatorics; Planar graph; Outerplanar graph; Mathematics; 1-planar graph; Indifference graph; Planar; Book embedding; Clique-sum; Discrete mathematics; Series (stratigraphy); Graph; Computer science; Line graph; Computer graphics (images)","score_opus":0.013783665333972583,"score_gpt":0.23815582210133418,"score_spread":0.2243721567673616,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2001019475","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2254721,0.00069314585,0.6678268,0.0006704552,0.00023045666,0.00017385573,0.0007634213,0.0012525603,0.1029173],"genre_scores_gemma":[0.7411366,0.0015697426,0.21098556,0.00021188574,0.0001361854,0.00015650556,0.0016429345,0.00047236524,0.04368829],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997893,0.000051426658,0.0000074542545,0.000047957412,0.00007879005,0.000025098705],"domain_scores_gemma":[0.9992347,0.00027787342,0.000106089356,0.0001930597,0.000103775405,0.000084494335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001630853,0.00061309955,0.0003460594,0.00085567066,0.00053950766,0.00096027326,0.000727594,0.0005583482,0.010513712],"category_scores_gemma":[0.0017478964,0.00038381392,0.0003170073,0.0012465928,0.0006058144,0.0013694793,0.000737927,0.0010572477,0.0009761964],"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.00019483408,0.00008482028,0.0009773911,0.0001905425,0.00002803606,0.0005273303,0.0003177988,0.08616562,0.022686407,0.74153376,0.015279744,0.13201377],"study_design_scores_gemma":[0.00009290276,0.00012287703,0.0016238781,0.000046607733,0.00006133018,0.0007524414,0.00030003113,0.17160839,0.016142346,0.74181664,0.067398936,0.000033605014],"about_ca_topic_score_codex":0.0008673452,"about_ca_topic_score_gemma":0.0022723023,"teacher_disagreement_score":0.010513712,"about_ca_system_score_codex":0.0003581699,"about_ca_system_score_gemma":0.0002218604,"threshold_uncertainty_score":0.035171926},"labels":[],"label_agreement":null},{"id":"W2001552595","doi":"10.1007/s00454-006-1275-6","title":"Multi-Pass Geometric Algorithms","year":2006,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":55,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Convex hull; Regular polygon; Geometric programming; Algorithm; Computational geometry; Combinatorics; Linear programming; Mathematical optimization; Geometry","score_opus":0.014879910241498168,"score_gpt":0.26032009529383554,"score_spread":0.24544018505233736,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2001552595","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015745679,0.00011802041,0.9929299,0.000038877195,0.00004514158,0.000033643257,0.000039982126,0.00076992053,0.004450062],"genre_scores_gemma":[0.071706995,0.00030738316,0.9004037,0.00008881567,0.00007021323,0.0001523567,0.00030578498,0.0005762692,0.026388524],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993563,0.00007886957,0.000028113016,0.00014866411,0.00033416713,0.000053821524],"domain_scores_gemma":[0.9991598,0.00017132422,0.00006844613,0.00038634735,0.00017862672,0.000035395875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006335757,0.0013416455,0.0011944132,0.0014066282,0.00085613725,0.0018924645,0.0020054681,0.0016313251,0.030332897],"category_scores_gemma":[0.0018551367,0.00085066905,0.0011581905,0.001190219,0.00061142567,0.0021898253,0.0029997474,0.0014154857,0.009391095],"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.00018810354,0.00011693524,0.000673344,0.0002564779,0.00011987152,0.00015130061,0.00018502008,0.15487382,0.013913562,0.12337621,0.012136508,0.6940088],"study_design_scores_gemma":[0.000044437304,0.00015060697,0.00044060152,0.00004272894,0.000056979505,0.00035738517,0.00006646349,0.8897533,0.013319475,0.045373354,0.05036374,0.00003102274],"about_ca_topic_score_codex":0.0011134036,"about_ca_topic_score_gemma":0.0021740505,"teacher_disagreement_score":0.030332897,"about_ca_system_score_codex":0.0005176098,"about_ca_system_score_gemma":0.0006686156,"threshold_uncertainty_score":0.10147363},"labels":[],"label_agreement":null},{"id":"W2005407846","doi":"10.1007/s00454-007-1326-7","title":"Banach-Mazur Distances and Projections on Random Subgaussian Polytopes","year":2007,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Point processes and geometric inequalities","field":"Mathematics","cited_by":24,"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 Alberta","funders":"","keywords":"Polytope; Mathematics; Combinatorics; Mathematical proof; Unit cube; Cube (algebra); Unit sphere; Banach space; Discrete mathematics; Geometry","score_opus":0.03444786534423174,"score_gpt":0.33967523527281235,"score_spread":0.3052273699285806,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2005407846","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18582635,0.0025943539,0.7884881,0.0037263867,0.00024898662,0.000108821194,0.00070503284,0.00016225864,0.01813976],"genre_scores_gemma":[0.88231385,0.0040125633,0.08702977,0.0008744386,0.0007848115,0.00045034592,0.00083824067,0.00018645708,0.023509406],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9945484,0.0026443938,0.00022908697,0.0006653939,0.0014119638,0.0005008307],"domain_scores_gemma":[0.96969056,0.021076597,0.0030861106,0.0014412145,0.0023485415,0.00235696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00818923,0.001956094,0.0030612242,0.0042818235,0.0018675907,0.006012546,0.0032885487,0.0025711774,0.00785941],"category_scores_gemma":[0.030312043,0.0013999722,0.0020482508,0.0036488967,0.007859614,0.011060492,0.006940459,0.0066393707,0.00075414655],"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.00004270916,0.000015471951,0.00018367081,0.000025660798,0.000014298875,0.000023165381,0.00006793967,0.008064855,0.00013356436,0.98908615,0.00039701865,0.001945632],"study_design_scores_gemma":[0.000020580803,0.000039183164,0.00029676475,0.000023236254,0.00001168214,0.000068232526,0.000081564016,0.077209674,0.000197514,0.9210774,0.00094493723,0.000029346249],"about_ca_topic_score_codex":0.0018758927,"about_ca_topic_score_gemma":0.0014263727,"teacher_disagreement_score":0.00818923,"about_ca_system_score_codex":0.0036716347,"about_ca_system_score_gemma":0.0018806591,"threshold_uncertainty_score":0.04330933},"labels":[],"label_agreement":null},{"id":"W2007793103","doi":"10.1007/s00454-015-9681-2","title":"A $$d$$ d -dimensional Extension of Christoffel Words","year":2015,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"semigroups and automata theory","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Agence Nationale de la Recherche","keywords":"Christoffel symbols; Mathematics; Pure mathematics; Arithmetic","score_opus":0.02211496332905167,"score_gpt":0.26556724424520894,"score_spread":0.24345228091615728,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2007793103","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44248426,0.0019975659,0.30115712,0.0024155336,0.001733336,0.000119077835,0.0010483989,0.0005945622,0.24845009],"genre_scores_gemma":[0.8950153,0.0007305887,0.04191844,0.00047714275,0.00059009914,0.000103611,0.00049891043,0.00013151453,0.060534466],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995394,0.00006913194,0.000034605237,0.00016466087,0.00008974383,0.00010259658],"domain_scores_gemma":[0.9992545,0.00017560287,0.00008608658,0.00009030645,0.00017738246,0.00021607187],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039459573,0.000494344,0.00051312015,0.0012871829,0.0012899473,0.0017277029,0.000796339,0.00060244196,0.013333827],"category_scores_gemma":[0.0010859505,0.00027463556,0.00063301803,0.00074080453,0.001555539,0.0022935814,0.002204168,0.0012543632,0.0017360531],"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.00004671788,0.000023050292,0.00013652659,0.00003265215,0.0000057631387,0.0001314981,0.00012609619,0.00038571228,0.002116396,0.986991,0.0012241387,0.008780374],"study_design_scores_gemma":[0.000024583795,0.00007859225,0.0004938767,0.000027035881,0.000014325549,0.000668867,0.00019907359,0.0054436596,0.0024561335,0.9550564,0.035502374,0.000035108897],"about_ca_topic_score_codex":0.0005792205,"about_ca_topic_score_gemma":0.00041513017,"teacher_disagreement_score":0.013333827,"about_ca_system_score_codex":0.000709667,"about_ca_system_score_gemma":0.00042586125,"threshold_uncertainty_score":0.04460609},"labels":[],"label_agreement":null},{"id":"W2008520454","doi":"10.1007/s00454-003-0011-x","title":"The Complexity of Hyperplane Depth in the Plane","year":2003,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":23,"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":"Hyperplane; Mathematics; Combinatorics; Dimension (graph theory); Point (geometry); Set (abstract data type); Half-space; Plane (geometry); Discrete mathematics; Geometry; Computer science","score_opus":0.035452492252876534,"score_gpt":0.2746656796004278,"score_spread":0.2392131873475513,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2008520454","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5471389,0.0022195235,0.38797572,0.004194591,0.00021762487,0.00012679065,0.0022854148,0.0010458264,0.054795504],"genre_scores_gemma":[0.9192745,0.0012020624,0.06840726,0.00022220454,0.00017683182,0.00007199602,0.00097450713,0.0003966479,0.009273966],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985904,0.000304895,0.0000773714,0.00024033719,0.0005007333,0.00028625657],"domain_scores_gemma":[0.990464,0.007176042,0.0006893959,0.00076823327,0.0004737132,0.0004286069],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011061123,0.0005339307,0.001272121,0.0010956785,0.00090476655,0.0037979123,0.0021094016,0.0016613061,0.015572627],"category_scores_gemma":[0.013981101,0.0008022204,0.0007523843,0.0017245165,0.0019290698,0.009931034,0.0028017408,0.0023659226,0.0010831521],"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.0007437623,0.00013321031,0.0053660134,0.0004129712,0.00006409055,0.00021710356,0.0006286795,0.32613602,0.0046819635,0.538603,0.014354584,0.1086586],"study_design_scores_gemma":[0.00005608997,0.000050847728,0.001143216,0.000030024576,0.000023273218,0.00012954515,0.00019299024,0.560128,0.0014050564,0.43408692,0.002726814,0.000027233911],"about_ca_topic_score_codex":0.0041449033,"about_ca_topic_score_gemma":0.003855014,"teacher_disagreement_score":0.015572627,"about_ca_system_score_codex":0.0014744104,"about_ca_system_score_gemma":0.0009219259,"threshold_uncertainty_score":0.05209565},"labels":[],"label_agreement":null},{"id":"W2008612935","doi":"10.1007/s00454-014-9605-6","title":"New Roses: Simple Symmetric Venn Diagrams with 11 and 13 Curves","year":2014,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"University of Victoria; Louisiana State University","keywords":"Venn diagram; Simple (philosophy); Diagram; Mathematics; Symmetry (geometry); Invariant (physics); Combinatorics; Geometry; Statistics; Mathematical physics","score_opus":0.017004197258841187,"score_gpt":0.2858750381227947,"score_spread":0.2688708408639535,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2008612935","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3756615,0.001091797,0.18598834,0.0013599702,0.0010419022,0.00035544793,0.0016814673,0.001889481,0.43093008],"genre_scores_gemma":[0.8380509,0.0006241457,0.07082811,0.00038518765,0.00022294353,0.00013908926,0.001127277,0.00067309383,0.08794917],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992392,0.00018723532,0.000037817757,0.00017246345,0.00021971742,0.00014357186],"domain_scores_gemma":[0.999228,0.00019174464,0.00011498925,0.00012734864,0.00011011545,0.0002278703],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005118279,0.0008677374,0.00081163197,0.0017353725,0.0016736981,0.0030827923,0.0014139742,0.0013878854,0.021100638],"category_scores_gemma":[0.0016326786,0.00072146655,0.00071707007,0.001147958,0.0016778823,0.003282381,0.0022813221,0.0021574548,0.0042633126],"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.0001504333,0.000045604353,0.00038505121,0.00009914591,0.000019090096,0.00070126087,0.00045177943,0.0012269904,0.0054415986,0.9703939,0.005474295,0.015610892],"study_design_scores_gemma":[0.000100212324,0.000060217462,0.0008252216,0.00006355478,0.00004737728,0.0016470776,0.0005253766,0.007324486,0.0067798398,0.90412486,0.07842277,0.000078981764],"about_ca_topic_score_codex":0.0005782452,"about_ca_topic_score_gemma":0.000995514,"teacher_disagreement_score":0.021100638,"about_ca_system_score_codex":0.0008211131,"about_ca_system_score_gemma":0.00045323648,"threshold_uncertainty_score":0.07058865},"labels":[],"label_agreement":null},{"id":"W2012039160","doi":"10.1007/s00454-011-9383-3","title":"Oriented Interval Greedoids","year":2011,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick; Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Matroid; Mathematics; Combinatorics; Enumeration; Interval (graph theory); Oriented matroid; Simplicial complex; Regular polygon; Subdivision; Discrete mathematics; Graphic matroid; Geometry","score_opus":0.0279979525442483,"score_gpt":0.25306902121828273,"score_spread":0.22507106867403442,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2012039160","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19530769,0.0011475893,0.6592507,0.00060499954,0.00046208192,0.0001545176,0.0006738632,0.001038778,0.14135972],"genre_scores_gemma":[0.7637871,0.0008953899,0.17300066,0.00027280336,0.0002273795,0.00016020192,0.0013407794,0.00043266275,0.059883013],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995072,0.000074199175,0.00003588931,0.00015213534,0.00015872298,0.000071847746],"domain_scores_gemma":[0.999014,0.00026228745,0.00018102281,0.00017755333,0.00020950424,0.00015559117],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045441923,0.00060007896,0.0006427884,0.0019456466,0.00089147326,0.0026673921,0.0009663809,0.0007902804,0.011444296],"category_scores_gemma":[0.0020146929,0.00036483712,0.00048244392,0.0011495091,0.0014350367,0.0017621659,0.0016150152,0.0019078065,0.003231331],"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.00020456291,0.000031799394,0.00044790827,0.00006908111,0.000014245311,0.0002830654,0.00039156605,0.004858851,0.0061231493,0.93728477,0.0027406702,0.047550254],"study_design_scores_gemma":[0.000052475796,0.00015860092,0.0010696647,0.00006661704,0.00003251684,0.00097257923,0.00064566464,0.030273747,0.0074841357,0.88529664,0.07389905,0.00004825439],"about_ca_topic_score_codex":0.0004856023,"about_ca_topic_score_gemma":0.00035597017,"teacher_disagreement_score":0.011444296,"about_ca_system_score_codex":0.00059689744,"about_ca_system_score_gemma":0.00020746331,"threshold_uncertainty_score":0.038285017},"labels":[],"label_agreement":null},{"id":"W2016069320","doi":"10.1007/s00454-009-9220-0","title":"Global Rigidity: The Effect of Coning","year":2009,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Structural Analysis and Optimization","field":"Engineering","cited_by":74,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Mathematics; Rigidity (electromagnetism); Corollary; Infinitesimal; Combinatorics; Euclidean space; Euclidean geometry; Graph; Discrete mathematics; Geometry; Mathematical analysis","score_opus":0.0030436445461443345,"score_gpt":0.2229412836714452,"score_spread":0.21989763912530086,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2016069320","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4240164,0.0024864438,0.2695123,0.0018380517,0.0015008625,0.00008119321,0.0005048151,0.0016823424,0.29837757],"genre_scores_gemma":[0.97260576,0.0004965274,0.008863089,0.00017972538,0.00014913123,0.000020089656,0.0001293958,0.0006780476,0.016878309],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993135,0.00016628232,0.000016687685,0.00018728532,0.00015832503,0.00015800436],"domain_scores_gemma":[0.9976272,0.00076992303,0.00020215988,0.00081765745,0.00024379206,0.00033927325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006489497,0.0010896339,0.0011398694,0.001138776,0.0018442378,0.0026666184,0.0009774631,0.0012538054,0.03214603],"category_scores_gemma":[0.003929522,0.00064497703,0.0005775404,0.00090676616,0.002489673,0.0028933273,0.0020815837,0.0016952882,0.0022210726],"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.0010227271,0.0002868284,0.0017884983,0.00027616395,0.000087061555,0.000700707,0.00035487814,0.1692769,0.046529997,0.67204404,0.009581673,0.09805063],"study_design_scores_gemma":[0.00010963837,0.00052312476,0.006299972,0.00012235243,0.00011992644,0.001032082,0.0007601635,0.43793437,0.03760727,0.493465,0.021855773,0.00017024661],"about_ca_topic_score_codex":0.0008837066,"about_ca_topic_score_gemma":0.0016765202,"teacher_disagreement_score":0.03214603,"about_ca_system_score_codex":0.00049010885,"about_ca_system_score_gemma":0.00065763737,"threshold_uncertainty_score":0.10753918},"labels":[],"label_agreement":null},{"id":"W2016780725","doi":"10.1007/s00454-012-9429-1","title":"The Art Gallery Theorem for Polyominoes","year":2012,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Polyomino; Combinatorics; Mathematics; Art gallery; Discrete mathematics; Regular polygon; Geometry; Art history; Art","score_opus":0.01631502397956291,"score_gpt":0.2707261965360722,"score_spread":0.2544111725565093,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2016780725","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04319636,0.0023017053,0.6623841,0.0033836395,0.0015084936,0.00012065031,0.0007824849,0.0007760773,0.28554648],"genre_scores_gemma":[0.57522786,0.0034765243,0.20328186,0.003353367,0.0020943112,0.0004772771,0.001761594,0.0020401056,0.20828712],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99891746,0.000159045,0.00005493162,0.00027644954,0.0004600759,0.00013201336],"domain_scores_gemma":[0.9979911,0.00084925507,0.00010982727,0.0005948136,0.00029453513,0.0001604475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011184968,0.0009724684,0.0013507206,0.0026925476,0.0026326878,0.004369892,0.0018458473,0.002057775,0.021235129],"category_scores_gemma":[0.006747865,0.00077592285,0.0020482205,0.0013051492,0.003918386,0.005826911,0.005604214,0.005986396,0.003936652],"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.0000399465,0.000015190712,0.00012914222,0.000074277705,0.000017435063,0.000038757225,0.00012429712,0.0023496733,0.00068316556,0.966247,0.008729663,0.02155144],"study_design_scores_gemma":[0.0000128895745,0.000014783566,0.00019571235,0.00003079829,0.000014137607,0.000100267236,0.000037439626,0.009820439,0.00081649655,0.97261727,0.01632245,0.000017207376],"about_ca_topic_score_codex":0.0013836187,"about_ca_topic_score_gemma":0.0012976138,"teacher_disagreement_score":0.021235129,"about_ca_system_score_codex":0.0010053718,"about_ca_system_score_gemma":0.00066580356,"threshold_uncertainty_score":0.071038604},"labels":[],"label_agreement":null},{"id":"W2017477785","doi":"10.1007/s00454-002-2707-6","title":"The Size of Spanning Disks for Polygonal Curves","year":2002,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Mathematics; Combinatorics; Integer (computer science); Piecewise linear function; Geometry; Computer science","score_opus":0.022293254525976927,"score_gpt":0.2664097479403711,"score_spread":0.24411649341439418,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2017477785","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8619854,0.0022179177,0.110737324,0.0012509356,0.0001450535,0.000061774976,0.0007859082,0.0004858635,0.02232987],"genre_scores_gemma":[0.97621834,0.0009720446,0.019723581,0.000073988296,0.0001114266,0.000056548226,0.00038887808,0.00018975735,0.0022654405],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992404,0.00018299159,0.000054121,0.00012672241,0.00029457128,0.00010125869],"domain_scores_gemma":[0.9880531,0.008345018,0.00083169434,0.0008600434,0.00085845945,0.0010517903],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094669854,0.00045967512,0.0007901291,0.0015205177,0.0007565875,0.001984093,0.0013605179,0.0012552531,0.0044354643],"category_scores_gemma":[0.020402066,0.0006081272,0.00029263538,0.0010529632,0.001292298,0.003937548,0.0017946135,0.0008139675,0.00037337467],"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.0011560497,0.00016960522,0.008157542,0.0005642998,0.00007983203,0.00060458115,0.0013948557,0.12678623,0.043456417,0.684347,0.011418901,0.121864714],"study_design_scores_gemma":[0.000094169016,0.00023458648,0.0066614533,0.00011725381,0.00007126814,0.0011425605,0.0009209486,0.44282255,0.017735546,0.5220011,0.008136082,0.00006249458],"about_ca_topic_score_codex":0.0004907734,"about_ca_topic_score_gemma":0.00031680395,"teacher_disagreement_score":0.0044354643,"about_ca_system_score_codex":0.0005423224,"about_ca_system_score_gemma":0.00033058453,"threshold_uncertainty_score":0.01483804},"labels":[],"label_agreement":null},{"id":"W2019019197","doi":"10.1007/s00454-007-1319-6","title":"Realizations of the Associahedron and Cyclohedron","year":2007,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":126,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Fields Institute for Research in Mathematical Sciences","funders":"","keywords":"Combinatorics; Polytope; Conjecture; Coxeter graph; Type (biology); Coxeter group; Mathematics; Integer (computer science); Graph; Orientation (vector space); Graph theory; Computer science; Geometry; Voltage graph; Line graph","score_opus":0.02074767812952066,"score_gpt":0.32934407766506374,"score_spread":0.3085963995355431,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2019019197","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4079204,0.0010360004,0.092505105,0.0028007808,0.0007630626,0.000062716346,0.0006781666,0.0002829174,0.4939509],"genre_scores_gemma":[0.9563462,0.0004504776,0.013638566,0.0003082786,0.0003558913,0.00007762354,0.0003660873,0.000058706813,0.028398158],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995684,0.00011115039,0.000021072461,0.00006562315,0.00013332984,0.00010036201],"domain_scores_gemma":[0.9995981,0.00009982955,0.000055922294,0.000076008415,0.00007114182,0.000099063065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003929012,0.00036632037,0.0005822201,0.0010882319,0.001776986,0.0030256896,0.0006919585,0.0010053301,0.009999617],"category_scores_gemma":[0.0011046818,0.00024965467,0.0005100792,0.00080441847,0.0021803894,0.002153869,0.0015610311,0.0017454713,0.00093418034],"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.0000085660095,0.0000034694208,0.000025903473,0.0000043102027,8.949521e-7,0.000016491651,0.00002518639,0.00021468602,0.000105106956,0.9984762,0.0003837383,0.00073533115],"study_design_scores_gemma":[0.000011412954,0.000008639773,0.00010468309,0.000006862728,0.0000023439054,0.00007233014,0.00007420297,0.002516731,0.00021515042,0.9929703,0.0040095737,0.000007799246],"about_ca_topic_score_codex":0.0008259813,"about_ca_topic_score_gemma":0.00077280885,"teacher_disagreement_score":0.009999617,"about_ca_system_score_codex":0.0010351845,"about_ca_system_score_gemma":0.00058000797,"threshold_uncertainty_score":0.033452034},"labels":[],"label_agreement":null},{"id":"W2020827550","doi":"10.1007/s00454-012-9464-y","title":"A Center Transversal Theorem for Hyperplanes and Applications to Graph Drawing","year":2012,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Hyperplane; Planar graph; Lemma (botany); Transversal (combinatorics); Vertex (graph theory); Discrete mathematics; Center (category theory); Graph; Mathematical analysis","score_opus":0.015975049501925086,"score_gpt":0.2745048794931883,"score_spread":0.2585298299912632,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2020827550","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010724393,0.00060360815,0.9741484,0.00038974997,0.0001914382,0.00004838645,0.00016385231,0.00048555844,0.0132446],"genre_scores_gemma":[0.32537606,0.00303903,0.6270183,0.00058612553,0.0009504371,0.0002989068,0.0011614515,0.0015552784,0.040014423],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991522,0.00015370137,0.00004612836,0.00027206846,0.00026583872,0.00011006731],"domain_scores_gemma":[0.99713755,0.0011915623,0.00023284691,0.00046157558,0.0007042226,0.00027230143],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012049272,0.0009638012,0.0011873099,0.0030979319,0.0014573594,0.0030492002,0.0021782543,0.0014494405,0.014485202],"category_scores_gemma":[0.006500065,0.0011305786,0.0014987676,0.002689819,0.0026332177,0.004525619,0.003979604,0.0054043466,0.0028278208],"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.00007376567,0.000048119073,0.00044652238,0.00011102046,0.000022735414,0.00006443381,0.00024354686,0.01090372,0.0039871866,0.8997677,0.008058645,0.07627245],"study_design_scores_gemma":[0.000050891773,0.000073803094,0.00044930022,0.00006711784,0.000030633666,0.00023138119,0.00016965317,0.1266725,0.0050111185,0.8417093,0.025488503,0.00004574587],"about_ca_topic_score_codex":0.002781864,"about_ca_topic_score_gemma":0.0021894502,"teacher_disagreement_score":0.014485202,"about_ca_system_score_codex":0.001143021,"about_ca_system_score_gemma":0.00079504895,"threshold_uncertainty_score":0.04845786},"labels":[],"label_agreement":null},{"id":"W2022467326","doi":"10.1007/s00454-001-0038-7","title":"Locked and Unlocked Polygonal Chains in Three Dimensions","year":2001,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":36,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; McGill University; National Science Foundation","keywords":"Polygonal chain; Combinatorics; Mathematics; Regular polygon; Convex polygon; Simple (philosophy); Chain (unit); Polygon (computer graphics); Plane (geometry); Planar; Polytope; Convex polytope; Simple polygon; Projection (relational algebra); Geometry; Convex set; Algorithm; Computer science; Convex optimization; Computer graphics (images)","score_opus":0.014836212412967925,"score_gpt":0.25402744485809237,"score_spread":0.23919123244512444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2022467326","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7355903,0.00049932,0.23624179,0.00028763586,0.00021989334,0.000058960173,0.000119718454,0.00025376686,0.026728656],"genre_scores_gemma":[0.97621286,0.00015733254,0.014720087,0.00003748326,0.000020152549,0.00003027978,0.00006250997,0.000077909914,0.008681308],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998223,0.000027980157,0.00000956343,0.000040220864,0.000051603653,0.00004834174],"domain_scores_gemma":[0.9994267,0.00016681533,0.000095106,0.00010913716,0.00007276955,0.00012946645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019672043,0.00020559828,0.00036905252,0.0005761168,0.0008001015,0.0016088655,0.0007404654,0.0008396555,0.006843833],"category_scores_gemma":[0.0014579617,0.00033834617,0.00023386006,0.0004524707,0.0017856897,0.001272719,0.0011928412,0.00069266977,0.00044261152],"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.00050095556,0.00017449462,0.0018641358,0.000103430786,0.000025369343,0.00044948148,0.00057751976,0.25885618,0.019498665,0.6718289,0.0016336748,0.044487197],"study_design_scores_gemma":[0.00006242157,0.000129956,0.0008601309,0.00003096316,0.0000140873435,0.00012906807,0.00046527956,0.70248365,0.006154766,0.28450805,0.005131044,0.000030618892],"about_ca_topic_score_codex":0.0011817793,"about_ca_topic_score_gemma":0.0013875993,"teacher_disagreement_score":0.006843833,"about_ca_system_score_codex":0.00033135066,"about_ca_system_score_gemma":0.0003887122,"threshold_uncertainty_score":0.022894919},"labels":[],"label_agreement":null},{"id":"W2023680143","doi":"10.1007/s00454-010-9264-1","title":"An Eberhard-Like Theorem for Pentagons and Heptagons","year":2010,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Mathematics and Applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Univerza v Ljubljani; Javna Agencija za Raziskovalno Dejavnost RS; Canada Research Chairs; Simon Fraser University; Austrian Science Fund; Grantová Agentura České Republiky","keywords":"Combinatorics; Mathematics; Polyhedron; Regular polygon; Simple (philosophy); Euler characteristic; Image (mathematics); Geometry","score_opus":0.027329210840670685,"score_gpt":0.34697393423721934,"score_spread":0.31964472339654865,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2023680143","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15372348,0.0031848988,0.3644923,0.007629588,0.0013180677,0.00013872328,0.0008737581,0.00060223544,0.46803692],"genre_scores_gemma":[0.75791967,0.004065792,0.121282935,0.004826137,0.0013902907,0.00033048983,0.001364213,0.00079709024,0.108023405],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991804,0.00017419265,0.000038302034,0.00020768476,0.00025343383,0.000145901],"domain_scores_gemma":[0.997823,0.0012761533,0.00014700976,0.00027576086,0.00027164796,0.00020642072],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010571083,0.00095137744,0.0012976793,0.0020856606,0.0025186578,0.0031165401,0.001959175,0.0015748559,0.013743989],"category_scores_gemma":[0.0050468864,0.0007192635,0.0016015947,0.0018296605,0.0036752739,0.0069265445,0.0034561686,0.005955519,0.0024910292],"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.00003922402,0.000019881842,0.00017763098,0.00007283484,0.000013833103,0.000053877302,0.00012194679,0.0014827972,0.00044409695,0.98299164,0.0058521233,0.008729989],"study_design_scores_gemma":[0.000008815466,0.000005370077,0.00011013718,0.000010403119,0.0000055036617,0.00005239997,0.00002755313,0.0025897129,0.0001893893,0.9936488,0.0033467368,0.00000518324],"about_ca_topic_score_codex":0.0015940389,"about_ca_topic_score_gemma":0.0014429325,"teacher_disagreement_score":0.013743989,"about_ca_system_score_codex":0.0011935686,"about_ca_system_score_gemma":0.0005615154,"threshold_uncertainty_score":0.045978248},"labels":[],"label_agreement":null},{"id":"W2025569303","doi":"10.1007/s00454-007-1311-1","title":"Which n-Venn Diagrams Can Be Drawn with Convex k-Gons?","year":2007,"lang":"en","type":"article","venue":"Discrete & 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 Victoria","funders":"","keywords":"Venn diagram; Mathematics; Combinatorics; Diagram; Simple (philosophy); Quadrilateral; Regular polygon; Discrete mathematics; Geometry; Statistics; Physics; Thermodynamics","score_opus":0.012103804645428972,"score_gpt":0.25586705555086003,"score_spread":0.24376325090543105,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2025569303","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24913612,0.0012663091,0.5185163,0.0025955485,0.0008007599,0.00020763921,0.0011676728,0.001281545,0.22502807],"genre_scores_gemma":[0.78296864,0.0008175312,0.18039401,0.00044260232,0.000080071775,0.0001615937,0.0011106523,0.00051518116,0.03350962],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99959713,0.0000999637,0.000020834053,0.0001228953,0.00007674833,0.00008248905],"domain_scores_gemma":[0.9989944,0.0003556023,0.00013484049,0.00016939713,0.00019401351,0.00015183703],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030843215,0.0005345545,0.00073317735,0.0010270086,0.0013190566,0.002195955,0.0011291202,0.0017446912,0.02140923],"category_scores_gemma":[0.0041392483,0.00053887937,0.00060601765,0.0008903366,0.0013418025,0.0045232605,0.0012179206,0.0011782285,0.0036033532],"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.0002592189,0.00003517594,0.0016892496,0.0003080365,0.000028012653,0.00056182453,0.00074430974,0.012342054,0.004347319,0.90851086,0.011821284,0.05935256],"study_design_scores_gemma":[0.000038982336,0.000024984432,0.0007144697,0.00021185022,0.000022967992,0.00041450106,0.0012968127,0.035471745,0.0032976354,0.89399356,0.06446264,0.00004987624],"about_ca_topic_score_codex":0.0014058757,"about_ca_topic_score_gemma":0.002350294,"teacher_disagreement_score":0.02140923,"about_ca_system_score_codex":0.00057345483,"about_ca_system_score_gemma":0.00036978946,"threshold_uncertainty_score":0.07162106},"labels":[],"label_agreement":null},{"id":"W2025920119","doi":"10.1007/s00454-011-9381-5","title":"The Shape of Orthogonal Cycles in Three Dimensions","year":2011,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; University of Waterloo; McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; Ministero dell’Istruzione, dell’Università e della Ricerca","keywords":"Mathematics; Combinatorics; Geometry","score_opus":0.0304768645177658,"score_gpt":0.25908404196421614,"score_spread":0.22860717744645034,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2025920119","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.58661026,0.0007326119,0.33583233,0.00064414693,0.00021351122,0.00010491299,0.00029828443,0.00032748078,0.075236514],"genre_scores_gemma":[0.9549029,0.0003303628,0.03509483,0.000099884914,0.00003325177,0.00004883095,0.00012857589,0.00017404812,0.00918724],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998597,0.00003133842,0.0000065751947,0.000022735892,0.00005370831,0.000025849009],"domain_scores_gemma":[0.9996333,0.00009440484,0.000052775922,0.00004706,0.000105057596,0.00006735571],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017895765,0.00023906745,0.00023877289,0.000895436,0.0005523455,0.0013884235,0.00046527715,0.0006007708,0.003684893],"category_scores_gemma":[0.001614684,0.00028309983,0.00022073345,0.0006629349,0.0011048707,0.0008289918,0.0008875821,0.0005432547,0.00047347933],"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.00015188735,0.000034157663,0.0014386036,0.000059281232,0.0000081664,0.00018355827,0.0005713411,0.039940145,0.0085743265,0.8761099,0.002924011,0.070004575],"study_design_scores_gemma":[0.00003378418,0.00008331084,0.0016720652,0.000054187516,0.000009882934,0.000528713,0.0007417551,0.32786855,0.004761981,0.63722473,0.02696674,0.000054271713],"about_ca_topic_score_codex":0.0014736594,"about_ca_topic_score_gemma":0.0010719202,"teacher_disagreement_score":0.003684893,"about_ca_system_score_codex":0.0003826943,"about_ca_system_score_gemma":0.00049532176,"threshold_uncertainty_score":0.012327135},"labels":[],"label_agreement":null},{"id":"W2028474908","doi":"10.1007/s00454-003-2777-0","title":"An isosceles triangle that tiles the sphere in exactly three ways","year":2003,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Quasicrystal Structures and Properties","field":"Materials Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saint Mary's University; St. Mary's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Isosceles triangle; Combinatorics; Mathematics; Enhanced Data Rates for GSM Evolution; Spherical trigonometry; Equilateral triangle; Triangle inequality; Geometry; Computer science","score_opus":0.028768031865336316,"score_gpt":0.25208324722372694,"score_spread":0.2233152153583906,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2028474908","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3478115,0.00038920206,0.3524298,0.001200874,0.0013060761,0.000120055665,0.0006990264,0.0013056489,0.29473796],"genre_scores_gemma":[0.87018114,0.00019572761,0.09148525,0.00024027153,0.00007964466,0.0000820972,0.00047190962,0.0002901054,0.036973815],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997447,0.000040017418,0.000010495408,0.0000679457,0.00008191214,0.000055011416],"domain_scores_gemma":[0.99975914,0.000042079882,0.000021441345,0.00008925719,0.000039229795,0.00004891077],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013741058,0.00030889033,0.00037027433,0.00036352806,0.00076041545,0.0009862736,0.0005876306,0.00084950426,0.011877082],"category_scores_gemma":[0.0006194637,0.00026227682,0.00037180755,0.00035459688,0.0009888734,0.00088363833,0.0011196663,0.00080453046,0.002091586],"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.00033527266,0.000050855477,0.0006785831,0.00014531214,0.000018997885,0.0006037178,0.0004807584,0.012243512,0.046396498,0.8768791,0.008460351,0.0537071],"study_design_scores_gemma":[0.00023747786,0.00031076878,0.0014280756,0.00007570108,0.000034557223,0.0018248904,0.0010848211,0.102516524,0.039084762,0.72571933,0.12759522,0.000087927336],"about_ca_topic_score_codex":0.0013151749,"about_ca_topic_score_gemma":0.0015948443,"teacher_disagreement_score":0.011877082,"about_ca_system_score_codex":0.00028797594,"about_ca_system_score_gemma":0.0004123018,"threshold_uncertainty_score":0.039732814},"labels":[],"label_agreement":null},{"id":"W2031207101","doi":"10.1007/s00454-015-9663-4","title":"Average Stretch Factor: How Low Does It Go?","year":2015,"lang":"en","type":"article","venue":"Discrete & 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":"Carleton University; University of Ottawa","funders":"","keywords":"Combinatorics; Mathematics; Upper and lower bounds; Vertex (graph theory); Graph; Euclidean geometry; Omega; Dimension (graph theory); Discrete mathematics; Geometry; Mathematical analysis; Physics","score_opus":0.024092420459902182,"score_gpt":0.26712992377713934,"score_spread":0.24303750331723717,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2031207101","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11713279,0.04438126,0.65554833,0.066784464,0.0072507137,0.000106913954,0.0022357986,0.008754558,0.09780513],"genre_scores_gemma":[0.81542104,0.009349426,0.1474761,0.004563513,0.0034421065,0.00013694268,0.0008388379,0.0029265217,0.015845556],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973851,0.0006132653,0.00010987317,0.00073372916,0.0008305515,0.0003275927],"domain_scores_gemma":[0.9840352,0.0098130135,0.00075464085,0.0028545707,0.0015886549,0.0009538327],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041837916,0.0010605772,0.0017055593,0.0015573537,0.0013356043,0.003609374,0.002992493,0.0042828666,0.014446596],"category_scores_gemma":[0.041685253,0.00058413745,0.0006591342,0.0014183923,0.0032638935,0.014299465,0.002248615,0.0038838454,0.0039156605],"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.0010998232,0.00038765054,0.008679911,0.0011045911,0.0002367643,0.00023716023,0.0003190941,0.06465422,0.009991308,0.30517122,0.07162493,0.53649336],"study_design_scores_gemma":[0.00010437968,0.00042370765,0.0035278695,0.0005122645,0.0001528159,0.0005471692,0.00042114066,0.27824235,0.011686343,0.6681639,0.03604193,0.00017601355],"about_ca_topic_score_codex":0.0024412633,"about_ca_topic_score_gemma":0.0018323829,"teacher_disagreement_score":0.014446596,"about_ca_system_score_codex":0.0017861053,"about_ca_system_score_gemma":0.001390256,"threshold_uncertainty_score":0.048328638},"labels":[],"label_agreement":null},{"id":"W2033123200","doi":"10.1007/s00454-007-9025-y","title":"Tight Bounds for Connecting Sites Across Barriers","year":2008,"lang":"en","type":"article","venue":"Discrete & 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 Calgary","funders":"National Science Foundation","keywords":"Combinatorics; Spanning tree; Mathematics; Disjoint sets; Minimum spanning tree; Tree (set theory); Line segment; Steiner tree problem; Minimum degree spanning tree; K-ary tree; Upper and lower bounds; Regular polygon; Plane (geometry); Line (geometry); Discrete mathematics; Tree structure; Geometry; Binary tree; Mathematical analysis","score_opus":0.0264118285099958,"score_gpt":0.2983841775060861,"score_spread":0.2719723489960903,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2033123200","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0750067,0.0029217459,0.8496522,0.003337757,0.0006896495,0.00031348015,0.0013516685,0.0016150809,0.0651117],"genre_scores_gemma":[0.57743114,0.003441779,0.37523478,0.0014850545,0.0007548877,0.0011679383,0.0030869804,0.0028198373,0.034577537],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9940924,0.0014624506,0.0002851858,0.0010849381,0.0019863518,0.0010886355],"domain_scores_gemma":[0.94071555,0.043249093,0.002554055,0.0071336427,0.0028954209,0.0034522302],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0067620794,0.0034271358,0.0044265157,0.0051645697,0.004353781,0.007470116,0.011210138,0.0063441014,0.033545386],"category_scores_gemma":[0.07139934,0.0031620206,0.0027659999,0.0059453314,0.006167624,0.018002337,0.013403308,0.012173495,0.0045190975],"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.0005315543,0.0002620151,0.0009929122,0.0006038797,0.00007955052,0.00015289722,0.00057230046,0.14182658,0.0030944555,0.79980403,0.014560019,0.037519746],"study_design_scores_gemma":[0.00007265324,0.000091977636,0.00029578994,0.0001231075,0.00008070962,0.00010891669,0.00017552557,0.22823793,0.0016328399,0.76390666,0.005233768,0.000040137053],"about_ca_topic_score_codex":0.0032118538,"about_ca_topic_score_gemma":0.005364517,"teacher_disagreement_score":0.033545386,"about_ca_system_score_codex":0.0029977958,"about_ca_system_score_gemma":0.0024450994,"threshold_uncertainty_score":0.112220466},"labels":[],"label_agreement":null},{"id":"W2034649530","doi":"10.1007/s004540010072","title":"Geometric Construction of a Coboundary of a Cycle","year":2001,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Homomorphism; Rectangle; Mathematics; Combinatorics; Discrete mathematics; Computer science; Geometry","score_opus":0.010762083353932824,"score_gpt":0.25145233626384383,"score_spread":0.240690252909911,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2034649530","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30529085,0.00046952092,0.59522504,0.0012425332,0.00067898846,0.0003049079,0.00027648054,0.001198163,0.095313594],"genre_scores_gemma":[0.8045013,0.00030104516,0.17179702,0.00026864596,0.00010655267,0.00017705516,0.0004244522,0.00054440903,0.021879561],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999485,0.0000709114,0.00002381749,0.00015522426,0.0001528632,0.000112117115],"domain_scores_gemma":[0.999218,0.00015257932,0.00005777285,0.00012215895,0.00021832333,0.00023119169],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003927793,0.00064437796,0.00080782874,0.002562924,0.0020980071,0.0021421064,0.0011232381,0.0014632222,0.009658351],"category_scores_gemma":[0.0016524997,0.0005443863,0.00072476495,0.0010733743,0.0026762227,0.0021943727,0.004176429,0.0021952009,0.0015708901],"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.00006298938,0.000045139685,0.00046274374,0.00006187311,0.00000930112,0.00055161654,0.000759018,0.0016335194,0.013550899,0.96319324,0.0015442542,0.0181254],"study_design_scores_gemma":[0.000041389358,0.00014279375,0.0010200404,0.00007312191,0.000030346811,0.0014508028,0.0010760055,0.023700438,0.016694847,0.8960794,0.059632376,0.00005832756],"about_ca_topic_score_codex":0.0013467387,"about_ca_topic_score_gemma":0.00097029767,"teacher_disagreement_score":0.009658351,"about_ca_system_score_codex":0.00084472843,"about_ca_system_score_gemma":0.0007621962,"threshold_uncertainty_score":0.032310367},"labels":[],"label_agreement":null},{"id":"W2036063851","doi":"10.1007/s00454-011-9361-9","title":"Embedding a Pair of Graphs in a Surface, and the Width of 4-dimensional Prismatoids","year":2011,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick; Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Conjecture; Embedding; Dimension (graph theory); Graph; Base (topology); Polytope","score_opus":0.0332532098968531,"score_gpt":0.29991389279205966,"score_spread":0.26666068289520656,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2036063851","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9071538,0.00055390317,0.06491693,0.00038019937,0.00009532208,0.000031614298,0.00032197876,0.0002166788,0.026329646],"genre_scores_gemma":[0.96347195,0.00031214577,0.027216848,0.000094166106,0.000045971745,0.00006270936,0.00032041143,0.00010163119,0.008374245],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994703,0.00011742476,0.00003292701,0.00014658133,0.00012855904,0.000104298895],"domain_scores_gemma":[0.9982673,0.00066060066,0.00040217047,0.00020171782,0.00012649401,0.00034168726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005572684,0.0005982324,0.0005649956,0.0014149946,0.0011364234,0.0025576854,0.0017417256,0.0013272397,0.006154453],"category_scores_gemma":[0.003635719,0.000827359,0.00057163514,0.0010286215,0.00214948,0.005050005,0.003502182,0.0018770072,0.0007100127],"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.00053780904,0.0000907587,0.0026351805,0.00017934013,0.00004314783,0.00043670912,0.0011795359,0.01789879,0.0126161985,0.9469039,0.0016273909,0.01585124],"study_design_scores_gemma":[0.000099506346,0.00016837085,0.0034052078,0.00011288576,0.00006094988,0.0005935399,0.0019551143,0.0687078,0.005344279,0.9103168,0.009144279,0.000091183625],"about_ca_topic_score_codex":0.0009368664,"about_ca_topic_score_gemma":0.0010299167,"teacher_disagreement_score":0.006154453,"about_ca_system_score_codex":0.000648448,"about_ca_system_score_gemma":0.0003440493,"threshold_uncertainty_score":0.020588696},"labels":[],"label_agreement":null},{"id":"W2036529526","doi":"10.1007/s00454-008-9125-3","title":"A Polynomial Bound for Untangling Geometric Planar Graphs","year":2008,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Carleton University","funders":"Departament d'Universitats, Recerca i Societat de la Informació; Natural Sciences and Engineering Research Council of Canada; Universitat Politècnica de Catalunya; Ministerio de Economía y Competitividad","keywords":"Upper and lower bounds; Graph; Planar; Time complexity; Planar graph; Spanning tree","score_opus":0.024040076932284965,"score_gpt":0.26137474662002247,"score_spread":0.2373346696877375,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2036529526","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10843338,0.0018729506,0.81599635,0.0036137134,0.00056528416,0.00034583878,0.0019183677,0.005064288,0.06218992],"genre_scores_gemma":[0.54756206,0.0021237985,0.39818904,0.0013871297,0.0005921022,0.000464256,0.0046344805,0.0029333457,0.042113744],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99649364,0.0005043493,0.00014597204,0.0008117118,0.0011827081,0.00086165743],"domain_scores_gemma":[0.9841211,0.010251377,0.00065183686,0.003535248,0.0007269845,0.00071339874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019670741,0.002800927,0.0025666053,0.001926874,0.0023466975,0.00531019,0.007824521,0.0031660076,0.02703508],"category_scores_gemma":[0.017137261,0.0015884186,0.002899836,0.003894484,0.0035765215,0.015888741,0.008443115,0.007559491,0.006862234],"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.0019126334,0.0007599482,0.0022209396,0.0013958005,0.00014917247,0.00040082945,0.00087070354,0.2968305,0.016898492,0.35660565,0.041996848,0.27995843],"study_design_scores_gemma":[0.00014900486,0.00019478894,0.00043474042,0.0000798271,0.00011393253,0.00019548718,0.00019349022,0.49225008,0.006576438,0.49048927,0.009277537,0.00004540748],"about_ca_topic_score_codex":0.0053624134,"about_ca_topic_score_gemma":0.009667308,"teacher_disagreement_score":0.02703508,"about_ca_system_score_codex":0.0031320117,"about_ca_system_score_gemma":0.0023842982,"threshold_uncertainty_score":0.090441406},"labels":[],"label_agreement":null},{"id":"W2037586226","doi":"10.1007/s00454-012-9468-7","title":"Estimating Support Functions of Random Polytopes via Orlicz Norms","year":2012,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Point processes and geometric inequalities","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"University of Alberta","keywords":"Polytope; Mathematics; Combinatorics; Convex body; Regular polygon; Convex polytope; Connection (principal bundle); Expected value; Probabilistic logic; Discrete mathematics; Statistics; Convex analysis; Geometry; Convex hull; Convex optimization","score_opus":0.03685262287377868,"score_gpt":0.32190070942148885,"score_spread":0.2850480865477102,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2037586226","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039584164,0.0003983636,0.9583134,0.0002535941,0.000033476324,0.00003535636,0.00019026845,0.00010769427,0.0010836046],"genre_scores_gemma":[0.7506517,0.0020353082,0.24064991,0.000218302,0.00040163778,0.00034127946,0.0013738716,0.0002493684,0.0040786304],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99706453,0.0012972862,0.0001283564,0.00047659592,0.00078616285,0.000247064],"domain_scores_gemma":[0.9695348,0.024528356,0.002104324,0.0014120516,0.001579492,0.00084094045],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006468654,0.0018262585,0.0024608136,0.0036058484,0.0005839727,0.003527744,0.0030400052,0.0021028696,0.0023040508],"category_scores_gemma":[0.038497757,0.0014629122,0.0014326342,0.0017334801,0.0034820938,0.0069793537,0.0037876323,0.00408018,0.00045304556],"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.0004015767,0.00015530843,0.005725716,0.00032970592,0.0001477752,0.0002031762,0.0001954206,0.50974435,0.0042650844,0.43040115,0.001908147,0.046522625],"study_design_scores_gemma":[0.000014023351,0.000037350517,0.00056272413,0.000026767926,0.000010482351,0.000030564628,0.000033205444,0.8886655,0.0007008029,0.109499164,0.00039534806,0.000023950059],"about_ca_topic_score_codex":0.0024281624,"about_ca_topic_score_gemma":0.0015034396,"teacher_disagreement_score":0.006468654,"about_ca_system_score_codex":0.0013453823,"about_ca_system_score_gemma":0.000867759,"threshold_uncertainty_score":0.034209907},"labels":[],"label_agreement":null},{"id":"W2038549989","doi":"10.1007/s00454-009-9232-9","title":"Matroid Polytopes and their Volumes","year":2009,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":89,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"San Francisco State University; National Science Foundation","keywords":"Matroid; Mathematics; Combinatorics; Polytope; Minkowski addition; Grassmannian; Flag (linear algebra); Discrete mathematics; Minkowski space; Pure mathematics; Algebra over a field; Geometry","score_opus":0.01867194026509233,"score_gpt":0.2980928033620706,"score_spread":0.2794208630969783,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2038549989","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38482857,0.007181738,0.23387767,0.005572634,0.0006915547,0.00017007207,0.0028421555,0.0004751205,0.36436042],"genre_scores_gemma":[0.87198615,0.0038633284,0.03655795,0.0005637387,0.0011615901,0.00028529004,0.0014566833,0.0003040365,0.08382124],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994487,0.00011208108,0.00002462017,0.00010690996,0.00023025765,0.0000773129],"domain_scores_gemma":[0.9986559,0.00062215026,0.00021700273,0.00010667836,0.00016994544,0.00022814788],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004899136,0.00064943574,0.0008731609,0.0030229362,0.0014810805,0.004728876,0.0015550606,0.00091028755,0.012737564],"category_scores_gemma":[0.0028089161,0.0007540093,0.0006963123,0.002238446,0.002890866,0.0051561147,0.002377764,0.0034718073,0.0013795603],"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.000015493184,0.000011032172,0.00010414401,0.000031626863,0.000006389092,0.000024957668,0.00013869542,0.0014579832,0.00026206506,0.9904964,0.0019228712,0.0055285157],"study_design_scores_gemma":[0.000008364714,0.000011173664,0.00033680556,0.000016187223,0.000007199283,0.00013309921,0.00011372252,0.0052282657,0.00025116646,0.98496026,0.008924856,0.000008817608],"about_ca_topic_score_codex":0.0010567231,"about_ca_topic_score_gemma":0.00087975455,"teacher_disagreement_score":0.012737564,"about_ca_system_score_codex":0.0011609669,"about_ca_system_score_gemma":0.0003376176,"threshold_uncertainty_score":0.04261142},"labels":[],"label_agreement":null},{"id":"W2038607380","doi":"10.1007/s00454-003-2872-2","title":"Metric Embeddings?Beyond One-Dimensional Distortion","year":2004,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":12,"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":"Defense Advanced Research Projects Agency; Hebrew University of Jerusalem; National Science Foundation","keywords":"Pairwise comparison; Mathematics; Embedding; Distortion (music); Metric (unit); Combinatorics; Graph; Metric space; Discrete mathematics; Computer science; Artificial intelligence; Statistics","score_opus":0.016334324780769453,"score_gpt":0.29402775613076054,"score_spread":0.2776934313499911,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2038607380","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15601513,0.02418074,0.57294583,0.051904812,0.0043351096,0.00009020942,0.0016403458,0.0012238483,0.18766391],"genre_scores_gemma":[0.8875622,0.010501822,0.053321254,0.0030803184,0.0033624086,0.00009760929,0.00065884675,0.0007375663,0.040677924],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987859,0.00041467627,0.00006139857,0.000230601,0.00039158453,0.00011583818],"domain_scores_gemma":[0.9944277,0.0022970822,0.0006131669,0.0016131056,0.0005891813,0.00045983808],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015677736,0.00094857207,0.001395297,0.0013862962,0.0010851098,0.0040073725,0.001811116,0.0021997467,0.009957184],"category_scores_gemma":[0.013834252,0.00048586554,0.00059672224,0.0015542426,0.0046618157,0.019026143,0.004345401,0.0047268793,0.0017343592],"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.000014174462,0.0000057015895,0.000071588154,0.000034021356,0.000004788621,0.00001610289,0.000045541103,0.0007806248,0.000103617516,0.98858124,0.002173202,0.008169425],"study_design_scores_gemma":[0.000005034263,0.0000066370762,0.0000490342,0.000011037436,0.0000030746346,0.00006882699,0.00004282426,0.0035527607,0.00012627317,0.9914586,0.0046677142,0.000008339435],"about_ca_topic_score_codex":0.00065369,"about_ca_topic_score_gemma":0.00042577233,"teacher_disagreement_score":0.009957184,"about_ca_system_score_codex":0.0015138793,"about_ca_system_score_gemma":0.000538012,"threshold_uncertainty_score":0.033310115},"labels":[],"label_agreement":null},{"id":"W2041014877","doi":"10.1007/s00454-004-1135-1","title":"Enumerative Properties of Ferrers Graphs","year":2004,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":58,"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":"National Science Foundation","keywords":"Mathematics; Combinatorics; Bipartite graph; Chromatic scale; Chromatic polynomial; Discrete mathematics; Spanning tree; Class (philosophy); Graph; Computer science","score_opus":0.044196201473794,"score_gpt":0.3100833130545225,"score_spread":0.26588711158072853,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2041014877","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8844023,0.0006219274,0.03912284,0.0019520794,0.00009944245,0.00007482595,0.0008186863,0.00040416265,0.072503686],"genre_scores_gemma":[0.9730786,0.00041257683,0.009288263,0.0002838402,0.00018017186,0.000075307056,0.0010306117,0.0001227472,0.015527854],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989329,0.00025821145,0.00006770897,0.00023042235,0.00026207065,0.0002485486],"domain_scores_gemma":[0.990284,0.006534537,0.0010931811,0.00094481197,0.0005591335,0.00058436696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011422166,0.00065250834,0.0008891429,0.0034975354,0.0028815577,0.003636726,0.0020699727,0.0013188525,0.013738482],"category_scores_gemma":[0.008387593,0.0005576127,0.00088344223,0.002349699,0.0029391088,0.0064923526,0.002065364,0.0023670045,0.0006662139],"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.00015258759,0.00009262738,0.002174364,0.00009777458,0.000022785855,0.00020551948,0.0009229526,0.0038566338,0.00258284,0.9735962,0.0034382686,0.012857451],"study_design_scores_gemma":[0.00003340547,0.000028968427,0.0012835431,0.000027045588,0.00003426351,0.00024817136,0.0002565495,0.008812468,0.0018736398,0.98402023,0.0033605602,0.000021094545],"about_ca_topic_score_codex":0.0017802861,"about_ca_topic_score_gemma":0.0021922167,"teacher_disagreement_score":0.013738482,"about_ca_system_score_codex":0.0021159258,"about_ca_system_score_gemma":0.00071089895,"threshold_uncertainty_score":0.04595983},"labels":[],"label_agreement":null},{"id":"W2042115984","doi":"10.1007/s004540010075","title":"The screensaver map: Dynamics on elliptic curves arising from polygonal folding","year":2001,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Geometric and Algebraic Topology","field":"Mathematics","cited_by":18,"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 Alberta","funders":"","keywords":"Quadrilateral; Mathematics; Folding (DSP implementation); Diagonal; Combinatorics; Rotation (mathematics); Elliptic curve; Space (punctuation); Translation (biology); Mathematical analysis; Geometry; Pure mathematics; Physics; Computer science","score_opus":0.02905924461556617,"score_gpt":0.30280786580957436,"score_spread":0.27374862119400817,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2042115984","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7047002,0.0006480032,0.19455208,0.001625443,0.00052788935,0.00009531918,0.00021810371,0.00060418254,0.09702881],"genre_scores_gemma":[0.9665514,0.0005193168,0.009566458,0.00013727587,0.00015455847,0.000033481512,0.00009008887,0.00016865715,0.022778811],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99984217,0.000027201015,0.0000067492647,0.000031618616,0.0000528292,0.000039350754],"domain_scores_gemma":[0.99965847,0.00007816473,0.000058660375,0.00004213375,0.000047068635,0.00011550985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023338606,0.0005753507,0.00045594113,0.001472646,0.0011919463,0.0023338376,0.0006103663,0.0013418498,0.0065404954],"category_scores_gemma":[0.001643559,0.0003301716,0.0003801615,0.000730589,0.0017808727,0.003755494,0.0019965095,0.0013475933,0.0007436933],"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.000052608368,0.000023410146,0.00019143985,0.000021479898,0.00000456334,0.00025151434,0.00040178903,0.005555749,0.0027355351,0.9819957,0.001003097,0.0077630435],"study_design_scores_gemma":[0.000027177184,0.000048590162,0.00034071528,0.000018432687,0.0000054637403,0.00038557287,0.0003344353,0.05482954,0.0019247743,0.9353344,0.0067273807,0.000023609246],"about_ca_topic_score_codex":0.0007226394,"about_ca_topic_score_gemma":0.00039011452,"teacher_disagreement_score":0.0065404954,"about_ca_system_score_codex":0.0007326751,"about_ca_system_score_gemma":0.00030039804,"threshold_uncertainty_score":0.02188015},"labels":[],"label_agreement":null},{"id":"W2042156180","doi":"10.1007/s00454-012-9482-9","title":"On the Stretch Factor of Randomly Embedded Random Graphs","year":2012,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Stochastic processes and statistical mechanics","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Bounded function; Unit square; Upper and lower bounds; Vertex (graph theory); Cardinality (data modeling); Graph; Random graph; Euclidean geometry; Random geometric graph","score_opus":0.04298874635406716,"score_gpt":0.3240291046706237,"score_spread":0.2810403583165565,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2042156180","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6930909,0.0046642013,0.25904745,0.0056516095,0.00051984185,0.00010022761,0.00052526634,0.0006991282,0.035701323],"genre_scores_gemma":[0.97442925,0.0021789137,0.0118644405,0.0004784512,0.000856202,0.000085166874,0.00033555215,0.00036032344,0.009411614],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991304,0.00033650582,0.00003009234,0.00016253575,0.00019307509,0.00014737643],"domain_scores_gemma":[0.9841007,0.010057525,0.0020462736,0.0011605312,0.00067794486,0.0019569541],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022937232,0.0013404079,0.0017406747,0.0027617838,0.0012194843,0.0020737525,0.0018949142,0.0021990205,0.008104352],"category_scores_gemma":[0.02197875,0.00084226223,0.0007636233,0.0014808881,0.004457133,0.0068301503,0.0025637092,0.0028981173,0.000700101],"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.00021825099,0.00006449918,0.0011915066,0.0001403013,0.000033016997,0.00024310165,0.00032807302,0.05155481,0.0025600328,0.9327767,0.002845044,0.008044719],"study_design_scores_gemma":[0.00004394089,0.000058539794,0.0009946588,0.00004384963,0.0000204853,0.00012807843,0.00010650488,0.17749266,0.00051488203,0.81924886,0.0013016518,0.000045905796],"about_ca_topic_score_codex":0.0024326595,"about_ca_topic_score_gemma":0.0016992053,"teacher_disagreement_score":0.008104352,"about_ca_system_score_codex":0.0016320398,"about_ca_system_score_gemma":0.0007310988,"threshold_uncertainty_score":0.027111769},"labels":[],"label_agreement":null},{"id":"W2042172307","doi":"10.1007/s00454-008-9092-8","title":"Stability Properties of Neighbourly Random Polytopes","year":2008,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Point processes and geometric inequalities","field":"Mathematics","cited_by":2,"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 Alberta","funders":"National Eye Institute","keywords":"Polytope; Mathematics; Combinatorics; Regular polygon; Stability (learning theory); Polytope model; Convex polytope; Convex set; Geometry; Convex optimization; Computer science","score_opus":0.09681367140401036,"score_gpt":0.29591460319749385,"score_spread":0.19910093179348348,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2042172307","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5791884,0.0010100428,0.38261494,0.0012470877,0.0001313595,0.00011920734,0.0006120397,0.00020692946,0.034869958],"genre_scores_gemma":[0.97878987,0.00042459328,0.011489121,0.00010472697,0.00008143407,0.00012756891,0.00043459487,0.00008360686,0.008464549],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991392,0.00023521532,0.000034094708,0.00019788707,0.00028059894,0.00011303991],"domain_scores_gemma":[0.9906358,0.005917923,0.0012832799,0.0004240265,0.0010317197,0.0007071532],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015258982,0.00073515024,0.001305207,0.0020422826,0.0014145136,0.003013777,0.0019483189,0.0014428865,0.006425925],"category_scores_gemma":[0.012152172,0.00072419574,0.0010798408,0.00075596554,0.0029188,0.002298907,0.0022520497,0.0018853802,0.0007028664],"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.00029938776,0.00005916511,0.0018379487,0.00013115205,0.000069270514,0.00018523823,0.00024323948,0.16653349,0.0057273856,0.8169305,0.0016416122,0.006341694],"study_design_scores_gemma":[0.000042233056,0.00008678539,0.0012142087,0.00003057703,0.000018372859,0.00012942914,0.000113183116,0.63211346,0.0016325754,0.3635593,0.001009277,0.00005059391],"about_ca_topic_score_codex":0.00248137,"about_ca_topic_score_gemma":0.0013831293,"teacher_disagreement_score":0.006425925,"about_ca_system_score_codex":0.001475218,"about_ca_system_score_gemma":0.00057282305,"threshold_uncertainty_score":0.021496832},"labels":[],"label_agreement":null},{"id":"W2042985865","doi":"10.1007/s00454-008-9093-7","title":"Simple Polygons of Maximum Perimeter Contained in a Unit Disk","year":2008,"lang":"sv","type":"article","venue":"Discrete & Computational Geometry","topic":"Advanced Theoretical and Applied Studies in Material Sciences and Geometry","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"Air Force Office of Scientific Research; Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Isosceles triangle; Perimeter; Mathematics; Polygon (computer graphics); Simple (philosophy); Plane (geometry); Simple polygon; Regular polygon; Polygon covering; RADIUS; Rectilinear polygon; Geometry; Computer science","score_opus":0.012915805446300376,"score_gpt":0.258853232758665,"score_spread":0.24593742731236462,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2042985865","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.75509626,0.0010090191,0.17301314,0.0004326627,0.00013838684,0.00016635776,0.0008913296,0.00044161166,0.06881134],"genre_scores_gemma":[0.9399231,0.00040013427,0.051010545,0.000055093205,0.000059850976,0.000100093595,0.00046211077,0.00009619831,0.007892848],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99961936,0.00007907375,0.0000292007,0.00006851777,0.0001487319,0.00005506981],"domain_scores_gemma":[0.9985201,0.0006672317,0.00034204606,0.00015352067,0.00011643238,0.00020065192],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022270942,0.00065733,0.0009552681,0.0014636493,0.00086854276,0.002271425,0.0009355391,0.00078421447,0.0031870508],"category_scores_gemma":[0.0026104692,0.00079264364,0.00043934383,0.0016223514,0.0014749195,0.0016834802,0.0016078937,0.00068332325,0.0006895672],"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.001853289,0.00013909415,0.002985561,0.00086632214,0.00012362337,0.002802246,0.0011186227,0.041548915,0.03896704,0.8495985,0.0055493657,0.054447476],"study_design_scores_gemma":[0.00048901944,0.0005990357,0.0056418185,0.0001427834,0.00011843755,0.005037937,0.0009085335,0.13631925,0.026685728,0.7918989,0.032054357,0.00010420088],"about_ca_topic_score_codex":0.0002774148,"about_ca_topic_score_gemma":0.0002820857,"teacher_disagreement_score":0.0031870508,"about_ca_system_score_codex":0.00034718856,"about_ca_system_score_gemma":0.00021320708,"threshold_uncertainty_score":0.010661781},"labels":[],"label_agreement":null},{"id":"W2043193623","doi":"10.1007/s00454-010-9313-9","title":"Letter from the New Editors-in-Chief","year":2010,"lang":"en","type":"letter","venue":"Discrete & Computational Geometry","topic":"3D Modeling in Geospatial Applications","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Honor; Editorial board; Editor in chief; Quarter (Canadian coin); Mathematics; Field (mathematics); Geometry; Computer science; Library science; Artificial intelligence; Management; Geography; Pure mathematics; Archaeology","score_opus":0.008992598889359124,"score_gpt":0.22341108894231365,"score_spread":0.21441849005295452,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2043193623","genre_codex":"commentary","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00033534007,0.001412425,0.00019172273,0.8650478,0.12594141,0.000025359912,0.00012119902,0.000059476934,0.0068651964],"genre_scores_gemma":[0.0044752755,0.0017842232,0.00037171887,0.84989625,0.092718504,0.0000789997,0.00008466633,0.00006858922,0.05052176],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9972765,0.00050313066,0.00026022716,0.00045805657,0.0010595211,0.0004425967],"domain_scores_gemma":[0.9951798,0.0020113247,0.0003252542,0.00013258126,0.0013143695,0.0010366341],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024127283,0.0011661885,0.0018066053,0.00081518106,0.0034305917,0.0056065237,0.0013514187,0.032125488,0.010535332],"category_scores_gemma":[0.022301933,0.0009245172,0.0012278757,0.00052610936,0.0017113847,0.0036405034,0.0013344969,0.027609296,0.01374565],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004302008,0.000015251718,0.00012911399,0.000019265624,0.000005499391,0.0005290814,0.000029305887,0.000032698536,0.000059858856,0.0004975192,0.996225,0.0024143707],"study_design_scores_gemma":[0.00006366581,0.000053046642,0.00074871915,0.00012396507,0.000020688567,0.0012883231,0.00034935438,0.0005327526,0.00021053711,0.0026793722,0.9938823,0.00004722756],"about_ca_topic_score_codex":0.0031914755,"about_ca_topic_score_gemma":0.0054702912,"teacher_disagreement_score":0.032125488,"about_ca_system_score_codex":0.002932331,"about_ca_system_score_gemma":0.0032720803,"threshold_uncertainty_score":0.035244167},"labels":[],"label_agreement":null},{"id":"W2043718124","doi":"10.1007/s00454-007-1345-4","title":"Multiple Coverings of the Plane with Triangles","year":2007,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Mathematical Approximation and Integration","field":"Mathematics","cited_by":42,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Hungarian Scientific Research Fund","keywords":"Mathematics; Combinatorics; Plane (geometry); Geometry","score_opus":0.02555882728740597,"score_gpt":0.2870210564526353,"score_spread":0.2614622291652293,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2043718124","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47636735,0.001897006,0.43203816,0.00077975244,0.00057130936,0.00007524035,0.00032273962,0.00037618168,0.08757234],"genre_scores_gemma":[0.92915434,0.0008944417,0.051960114,0.000097673445,0.00016168984,0.000043235068,0.00027304882,0.00014123686,0.017274316],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99926955,0.0001221656,0.000036044883,0.0001560132,0.000299972,0.000116258256],"domain_scores_gemma":[0.9988925,0.0004126292,0.00016589127,0.0002218588,0.0001432797,0.00016394061],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002850694,0.0005916139,0.0007219603,0.0013421279,0.0007700745,0.0017391358,0.0009138345,0.0008960356,0.00858398],"category_scores_gemma":[0.0026389933,0.00055452617,0.00073375326,0.0009482328,0.000999936,0.0019177592,0.0025244579,0.001463112,0.000970587],"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.00034829334,0.000050555147,0.0015308402,0.0001927638,0.00007830956,0.0013493889,0.00083610334,0.03261735,0.017890006,0.86670715,0.004316852,0.074082404],"study_design_scores_gemma":[0.00007870062,0.00021114954,0.002278376,0.00009229509,0.00006878492,0.0038877851,0.0008724006,0.20519006,0.011340117,0.7353553,0.040571984,0.000053011787],"about_ca_topic_score_codex":0.000857805,"about_ca_topic_score_gemma":0.00060752005,"teacher_disagreement_score":0.00858398,"about_ca_system_score_codex":0.00048870605,"about_ca_system_score_gemma":0.00018248001,"threshold_uncertainty_score":0.028716326},"labels":[],"label_agreement":null},{"id":"W2043753795","doi":"10.1007/s00454-010-9317-5","title":"The Orbit Rigidity Matrix of a Symmetric Framework","year":2010,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Structural Analysis and Optimization","field":"Engineering","cited_by":53,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"Natural Sciences and Engineering Research Council of Canada; Deutsche Forschungsgemeinschaft","keywords":"Infinitesimal; Rigidity (electromagnetism); Mathematics; Pure mathematics; Symmetry (geometry); Matrix (chemical analysis); Matrix representation; Orbit (dynamics); Geometry; Mathematical analysis; Physics; Group (periodic table)","score_opus":0.004093069760041351,"score_gpt":0.23671219288773065,"score_spread":0.23261912312768931,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2043753795","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38937575,0.00074057,0.42498276,0.0019682595,0.00056653924,0.00014601252,0.0008841184,0.00041462816,0.18092138],"genre_scores_gemma":[0.9412975,0.0004406257,0.031085989,0.0003002108,0.00029891153,0.00007867751,0.00037722624,0.00020942089,0.025911365],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995359,0.000097152275,0.00001551316,0.000082737046,0.00017382525,0.00009492836],"domain_scores_gemma":[0.999328,0.00013464621,0.00011833723,0.00009560894,0.00013499723,0.00018846449],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065534306,0.0007032057,0.0006008444,0.0016478099,0.0012721198,0.0015676746,0.0011721769,0.0012163538,0.015515493],"category_scores_gemma":[0.0016248875,0.00034277872,0.00046703944,0.00068331516,0.0021128282,0.0021585093,0.0013079814,0.0013823727,0.0013963492],"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.00002120296,0.0000108324275,0.000054031363,0.0000145742215,0.0000042518413,0.000026597514,0.000039707655,0.005292643,0.0010808946,0.9897022,0.00095857447,0.0027944248],"study_design_scores_gemma":[0.000012342904,0.000041072442,0.00028797152,0.000012402797,0.0000054295024,0.00008862515,0.0000829831,0.051269077,0.00060959987,0.9443894,0.0031713862,0.000029666635],"about_ca_topic_score_codex":0.0019129042,"about_ca_topic_score_gemma":0.0016728762,"teacher_disagreement_score":0.015515493,"about_ca_system_score_codex":0.00072860566,"about_ca_system_score_gemma":0.0010510294,"threshold_uncertainty_score":0.05190456},"labels":[],"label_agreement":null},{"id":"W2046209393","doi":"10.1007/s00454-008-9063-0","title":"On the Number of Facets of Three-Dimensional Dirichlet Stereohedra III: Full Cubic Groups","year":2008,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Quarter (Canadian coin); Dirichlet distribution; Mathematics; Group (periodic table); Combinatorics; Pure mathematics; Mathematical analysis; Physics; History; Quantum mechanics","score_opus":0.023027953355241645,"score_gpt":0.25769156508404156,"score_spread":0.2346636117287999,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2046209393","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.73619336,0.0009200217,0.14997683,0.0019904135,0.00039244298,0.00011292037,0.0008516912,0.00028748898,0.109274745],"genre_scores_gemma":[0.9636646,0.0004065215,0.021326274,0.0002252804,0.00023900036,0.000080054786,0.0005795832,0.00013449798,0.013344305],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99919826,0.00016689861,0.000033221408,0.00011052079,0.00030772388,0.00018344811],"domain_scores_gemma":[0.996135,0.0019580203,0.0004191781,0.0004773683,0.000415368,0.0005950184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009985551,0.0006444483,0.0009976617,0.0017666322,0.0015194742,0.0024936907,0.0021337636,0.0011748218,0.009900924],"category_scores_gemma":[0.005857175,0.0004915255,0.00065905665,0.0012536847,0.004399474,0.0033457614,0.0024110877,0.0023306,0.00072257465],"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.0003038099,0.000049524093,0.0015927423,0.0000996724,0.000018393319,0.00008124526,0.0004176604,0.019531332,0.0023797594,0.9454794,0.0050510336,0.02499551],"study_design_scores_gemma":[0.00002706109,0.00003321693,0.0009127733,0.00002284033,0.000008943481,0.000081296894,0.00019523903,0.06373371,0.0010847771,0.93142766,0.0024466773,0.000025833424],"about_ca_topic_score_codex":0.0029181077,"about_ca_topic_score_gemma":0.0028179488,"teacher_disagreement_score":0.009900924,"about_ca_system_score_codex":0.0012617043,"about_ca_system_score_gemma":0.00090417487,"threshold_uncertainty_score":0.033121884},"labels":[],"label_agreement":null},{"id":"W2051728965","doi":"10.1007/s00454-013-9521-1","title":"Computing Cartograms with Optimal Complexity","year":2013,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":56,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Technische Universität Berlin; Deutsche Forschungsgemeinschaft; National Science Foundation","keywords":"Mathematics; Hamiltonian path; Planar graph; Planar; Combinatorics; Polygon (computer graphics); Time complexity; Polygonal chain; Discrete mathematics; Graph; Regular polygon; Geometry; Computer science","score_opus":0.017222318304278988,"score_gpt":0.24917491993821247,"score_spread":0.2319526016339335,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2051728965","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053340156,0.00046537354,0.932205,0.0005339626,0.0001877063,0.00010914191,0.00049373234,0.002450247,0.010214676],"genre_scores_gemma":[0.2837401,0.00048504202,0.7083703,0.00015764245,0.00011994567,0.00011862731,0.0010322199,0.00088568026,0.00509035],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99941397,0.0001037772,0.00003595166,0.000115877316,0.00025001494,0.000080374106],"domain_scores_gemma":[0.998159,0.0010808435,0.00008233604,0.0003929513,0.00019882283,0.00008602483],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047073598,0.0009214007,0.0014317736,0.0015959996,0.0007421329,0.0022781584,0.0012621694,0.0011741789,0.011829475],"category_scores_gemma":[0.006345767,0.0009329142,0.0011460421,0.0022179731,0.0009893813,0.002913242,0.0022047772,0.001374061,0.0021531056],"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.00039547443,0.00012183125,0.0015867266,0.00042842256,0.00011668761,0.00027892055,0.00021740726,0.4707158,0.008213422,0.13046445,0.019773059,0.36768788],"study_design_scores_gemma":[0.00006684012,0.000047344518,0.00024817543,0.000022027452,0.000027668959,0.00010908037,0.000076861004,0.87161005,0.0027778074,0.11999959,0.005001384,0.00001305229],"about_ca_topic_score_codex":0.0031110467,"about_ca_topic_score_gemma":0.0065376265,"teacher_disagreement_score":0.011829475,"about_ca_system_score_codex":0.00075422344,"about_ca_system_score_gemma":0.0011646559,"threshold_uncertainty_score":0.03957349},"labels":[],"label_agreement":null},{"id":"W2054944142","doi":"10.1007/s00454-010-9251-6","title":"The Banach–Mazur Distance to the Cube in Low Dimensions","year":2010,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Point processes and geometric inequalities","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Regular polygon; Convex body; Cube (algebra); Banach space; Identity (music); Discrete mathematics; Geometry; Convex optimization","score_opus":0.01970109532364454,"score_gpt":0.3109540065512491,"score_spread":0.29125291122760455,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2054944142","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25332314,0.017636402,0.5760213,0.012990185,0.0012499836,0.00006630791,0.0008942691,0.00023304444,0.13758533],"genre_scores_gemma":[0.8904795,0.006998961,0.068980314,0.0015948135,0.0017309581,0.00015534174,0.00045891813,0.00017984472,0.029421398],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988463,0.0004896307,0.00005525476,0.0001829946,0.00032556147,0.000100251156],"domain_scores_gemma":[0.9963188,0.0021008414,0.00038117982,0.0002600234,0.0004969489,0.0004422906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016936798,0.00075936114,0.0012580671,0.002123442,0.0012308817,0.0035408745,0.0014579028,0.00117066,0.006086325],"category_scores_gemma":[0.0074837003,0.00033831387,0.00069230946,0.0015927395,0.004683754,0.0067745843,0.0036074899,0.004218976,0.0007556641],"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.000019846446,0.0000034248687,0.000060636776,0.000021471531,0.0000039352835,0.000009999483,0.000043767388,0.0008586062,0.00015231586,0.9961133,0.0006476045,0.0020651047],"study_design_scores_gemma":[0.000005416413,0.000010336069,0.00012081157,0.000008749499,0.000002805858,0.000020773929,0.000029576122,0.005390856,0.000094653966,0.9918745,0.0024346227,0.00000695584],"about_ca_topic_score_codex":0.0018121636,"about_ca_topic_score_gemma":0.0010657466,"teacher_disagreement_score":0.006086325,"about_ca_system_score_codex":0.0018924547,"about_ca_system_score_gemma":0.0009687864,"threshold_uncertainty_score":0.020360768},"labels":[],"label_agreement":null},{"id":"W2056713944","doi":"10.1007/s004540010025","title":"Oriented Matroid Rigidity of Multiplices","year":2000,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada; Hungarian Scientific Research Fund","keywords":"Matroid; Combinatorics; Mathematics; Polytope; Affine transformation; Quotient; Regular polygon; Rigidity (electromagnetism); Discrete mathematics; Pure mathematics; Geometry","score_opus":0.004473086168676054,"score_gpt":0.20529922138605056,"score_spread":0.2008261352173745,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2056713944","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.69063586,0.0004894791,0.16200946,0.0012575,0.00026271262,0.00006844813,0.00052775466,0.0004690741,0.14427978],"genre_scores_gemma":[0.9561574,0.00028557508,0.02050803,0.00028749582,0.0001896869,0.00005335873,0.0004324172,0.00017698004,0.021908939],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99885654,0.0001996723,0.00006672162,0.00033785848,0.00032641884,0.00021291769],"domain_scores_gemma":[0.9975368,0.00084875233,0.00045326294,0.00042735494,0.00030663586,0.0004271447],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065178575,0.0007289925,0.0008456164,0.0022482534,0.002549241,0.003926037,0.0016207803,0.0011952769,0.011614484],"category_scores_gemma":[0.0028960318,0.0008418177,0.00089706713,0.0014689462,0.0028115257,0.004277126,0.0036069003,0.003062402,0.0015517288],"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.000057418598,0.000028011518,0.00027547262,0.000023270473,0.000008956179,0.00010888624,0.00021882205,0.0016089283,0.0010596813,0.99235064,0.0007058269,0.0035541044],"study_design_scores_gemma":[0.000017281478,0.000027092692,0.00048618807,0.000013139259,0.000014592599,0.00018504981,0.000199266,0.006202307,0.0013532732,0.98757744,0.0039039291,0.000020560501],"about_ca_topic_score_codex":0.0010708863,"about_ca_topic_score_gemma":0.0010828478,"teacher_disagreement_score":0.011614484,"about_ca_system_score_codex":0.001006403,"about_ca_system_score_gemma":0.00040618278,"threshold_uncertainty_score":0.0388543},"labels":[],"label_agreement":null},{"id":"W2056994687","doi":"10.1007/s00454-013-9489-x","title":"The Small Octagons of Maximal Width","year":2013,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal; Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics","score_opus":0.014528169664538388,"score_gpt":0.2586883984759491,"score_spread":0.24416022881141072,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2056994687","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38495407,0.0037195769,0.3193076,0.0027001528,0.0009408358,0.00020702877,0.0012780317,0.0007676561,0.28612506],"genre_scores_gemma":[0.87759227,0.0012390789,0.068844646,0.00072862604,0.00033363863,0.00024691768,0.0006884631,0.0005216908,0.049804747],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99957305,0.00010097547,0.000021573596,0.00010252267,0.00012280178,0.000079047764],"domain_scores_gemma":[0.9991216,0.00034812585,0.00009672455,0.00014693139,0.00012961628,0.00015706039],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026394526,0.0006310037,0.00089202635,0.0010656823,0.0009577619,0.0025740576,0.0010503929,0.00085337984,0.01195413],"category_scores_gemma":[0.0043840846,0.0006907788,0.0004337425,0.00084761466,0.0019952888,0.002013561,0.0018456093,0.0021577997,0.0020305628],"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.00028034992,0.000029418537,0.00034868292,0.000115145725,0.000013192127,0.00008830424,0.00023077789,0.0025611254,0.0027264273,0.9572154,0.0072171073,0.029174075],"study_design_scores_gemma":[0.00008636565,0.00005270346,0.00055312173,0.00006402329,0.000017843326,0.0002576153,0.00036642465,0.01589876,0.0020751394,0.952262,0.028336626,0.000029421024],"about_ca_topic_score_codex":0.00065008254,"about_ca_topic_score_gemma":0.0006299747,"teacher_disagreement_score":0.01195413,"about_ca_system_score_codex":0.00031924894,"about_ca_system_score_gemma":0.0003660931,"threshold_uncertainty_score":0.039990544},"labels":[],"label_agreement":null},{"id":"W2057259762","doi":"10.1007/s00454-001-0042-y","title":"Every Set of Disjoint Line Segments Admits a Binary Tree","year":2001,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; K-ary tree; Disjoint sets; Tree (set theory); Interval tree; Binary tree; Vertex (graph theory); Segment tree; Line segment; Range tree; Line (geometry); Plane (geometry); Discrete mathematics; Tree structure; Graph; Geometry","score_opus":0.02535542343954046,"score_gpt":0.2833968965844862,"score_spread":0.25804147314494574,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2057259762","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33675843,0.00055869116,0.61515146,0.0010929971,0.00012251154,0.00020287483,0.0021811505,0.000833847,0.043097965],"genre_scores_gemma":[0.6616988,0.00072799774,0.30842546,0.00032567343,0.00011917916,0.00029968668,0.004840888,0.00031348722,0.023248816],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992361,0.00007001617,0.000056883946,0.00021639121,0.00028425,0.00013636681],"domain_scores_gemma":[0.9982084,0.00074388954,0.0002757014,0.00026808988,0.00031307034,0.00019078927],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026882018,0.0005674606,0.00112326,0.0021524879,0.0016132855,0.0028991355,0.0015672,0.0016852226,0.0090957405],"category_scores_gemma":[0.0022934393,0.0010369963,0.0007336896,0.0029860327,0.0012467448,0.004220589,0.002286961,0.0020362176,0.0024766098],"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.00043176184,0.0003305373,0.0042702444,0.0006099736,0.000096489704,0.0008095639,0.0012265049,0.01620902,0.025071261,0.795115,0.011506757,0.14432284],"study_design_scores_gemma":[0.000098556535,0.0001740598,0.00362828,0.00014232585,0.00007288335,0.0020845716,0.00079792057,0.07583192,0.010435699,0.8703303,0.036349755,0.000053718475],"about_ca_topic_score_codex":0.0005872899,"about_ca_topic_score_gemma":0.00060718117,"teacher_disagreement_score":0.0090957405,"about_ca_system_score_codex":0.0005793295,"about_ca_system_score_gemma":0.0003142782,"threshold_uncertainty_score":0.03042823},"labels":[],"label_agreement":null},{"id":"W2058678665","doi":"10.1007/s00454-009-9149-3","title":"Universal Sets of n Points for One-bend Drawings of Planar Graphs with n Vertices","year":2009,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"Natural Sciences and Engineering Research Council of Canada; Ministero dell’Istruzione, dell’Università e della Ricerca","keywords":"Combinatorics; Planar graph; Mathematics; Book embedding; Embedding; Planar; Planar straight-line graph; Enhanced Data Rates for GSM Evolution; 1-planar graph; Point (geometry); Outerplanar graph; Plane (geometry); Graph; Discrete mathematics; Pathwidth; Chordal graph; Geometry; Computer science; Line graph; Computer graphics (images)","score_opus":0.013979366589323364,"score_gpt":0.25362074825531133,"score_spread":0.23964138166598797,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2058678665","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46488,0.00058979425,0.44717985,0.0005417792,0.00014874198,0.00021065802,0.0017409513,0.00084672787,0.0838614],"genre_scores_gemma":[0.88351554,0.00050044834,0.09822534,0.00018373503,0.00004793362,0.00030817665,0.0019007329,0.0003870259,0.014931009],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985629,0.00019917834,0.00013442563,0.00037156872,0.00044185916,0.0002901288],"domain_scores_gemma":[0.997449,0.0011240117,0.00038499606,0.0004418213,0.0002773853,0.00032275883],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007430688,0.0007539913,0.0011730007,0.0021128021,0.0019882217,0.0031742305,0.0023907812,0.0018330354,0.008795505],"category_scores_gemma":[0.0052952175,0.0012117496,0.0013012697,0.0017684174,0.0023728386,0.003351161,0.004202615,0.0019127249,0.0011819134],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026616998,0.00008472609,0.0014073317,0.0001617389,0.000027490118,0.00027292388,0.0009466263,0.018245133,0.003534915,0.9266908,0.0034550333,0.044907108],"study_design_scores_gemma":[0.000069655136,0.00007346496,0.0015052053,0.00013909089,0.00004539571,0.00033498948,0.0006055025,0.04977284,0.005475841,0.9319155,0.0100062145,0.000056410325],"about_ca_topic_score_codex":0.0016428143,"about_ca_topic_score_gemma":0.00188458,"teacher_disagreement_score":0.008795505,"about_ca_system_score_codex":0.0017478666,"about_ca_system_score_gemma":0.0005592236,"threshold_uncertainty_score":0.029423892},"labels":[],"label_agreement":null},{"id":"W2061274508","doi":"10.1007/s4540010065","title":"Generalizing Ham Sandwich Cuts to Equitable Subdivisions","year":2000,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":85,"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":"Mathematics; Combinatorics; Subdivision; Disjoint sets; Plane (geometry); Generalization; Regular polygon; General position; Cutting-plane method; Discrete mathematics; Geometry; Algorithm; Mathematical analysis; Integer programming","score_opus":0.015435263351056735,"score_gpt":0.2780546105862947,"score_spread":0.262619347235238,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2061274508","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01603288,0.00008481458,0.9756739,0.000045047687,0.00006007261,0.000029008297,0.000033486594,0.00027205452,0.0077687707],"genre_scores_gemma":[0.41826132,0.0002790549,0.5651984,0.00020835131,0.00009993421,0.000111598165,0.00025653446,0.0007881791,0.014796628],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994779,0.00014188599,0.000026685026,0.00009992881,0.00019379944,0.000059714046],"domain_scores_gemma":[0.99888843,0.00039502143,0.000061042476,0.00043584814,0.00017301296,0.000046586687],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000842782,0.00075802574,0.0006974818,0.0011659147,0.0004755312,0.0013668024,0.001070596,0.0010264585,0.0072652944],"category_scores_gemma":[0.004619248,0.0006419845,0.00071694667,0.0006793089,0.0010942296,0.0015085118,0.0031058826,0.0017833879,0.0011939558],"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.0002196151,0.00011060437,0.0009492364,0.00014684358,0.00005918103,0.00024715668,0.00038821105,0.25687087,0.02380072,0.4915071,0.0038396022,0.2218608],"study_design_scores_gemma":[0.000020680547,0.000054279364,0.00022810636,0.000030570165,0.000023101506,0.00017110564,0.000084213716,0.72231936,0.0087903645,0.2579315,0.010330984,0.00001575407],"about_ca_topic_score_codex":0.0007962855,"about_ca_topic_score_gemma":0.0017790934,"teacher_disagreement_score":0.0072652944,"about_ca_system_score_codex":0.00042788038,"about_ca_system_score_gemma":0.00027352915,"threshold_uncertainty_score":0.024304867},"labels":[],"label_agreement":null},{"id":"W2061769667","doi":"10.1007/s00454-007-1329-4","title":"Dimensionality Reductions in ℓ2 that Preserve Volumes and Distance to Affine Spaces","year":2007,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":23,"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":"Mathematics; Affine space; Combinatorics; Euclidean space; Affine transformation; Dimension (graph theory); Embedding; Curse of dimensionality; Space (punctuation); Affine hull; Discrete mathematics; Geometry","score_opus":0.017670676533831628,"score_gpt":0.2824645015259168,"score_spread":0.26479382499208515,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2061769667","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13041808,0.00042181305,0.8512766,0.00069378415,0.00042981395,0.0000777104,0.00026109943,0.00064830563,0.015772806],"genre_scores_gemma":[0.6732343,0.00065741985,0.30111992,0.00034333876,0.00040125978,0.00013033123,0.0005121351,0.0008148966,0.022786463],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999428,0.00009625639,0.000038731054,0.00010703751,0.0002679734,0.0000619907],"domain_scores_gemma":[0.99896765,0.00026081488,0.00013105758,0.00042780186,0.00014547788,0.00006709564],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048454644,0.00048764257,0.0007234597,0.0007598588,0.00055615354,0.0015169841,0.00081373175,0.00066800293,0.0030874985],"category_scores_gemma":[0.002667099,0.0003526712,0.0007654856,0.00065102155,0.0010932898,0.0018342425,0.0014901048,0.0018102309,0.00086412684],"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.0002746756,0.00020865681,0.0008732199,0.00017891191,0.000062088235,0.00015965,0.00050094066,0.11287879,0.037798826,0.6232174,0.010356703,0.21349002],"study_design_scores_gemma":[0.00004873737,0.00021811058,0.0010813915,0.000024024457,0.00004351417,0.00045686233,0.00026176026,0.4500755,0.03378601,0.49185818,0.022088222,0.00005760514],"about_ca_topic_score_codex":0.000675052,"about_ca_topic_score_gemma":0.00092188944,"teacher_disagreement_score":0.0030874985,"about_ca_system_score_codex":0.0004938384,"about_ca_system_score_gemma":0.00043282495,"threshold_uncertainty_score":0.01032871},"labels":[],"label_agreement":null},{"id":"W2062105084","doi":"10.1007/s00454-003-2952-3","title":"Pseudo Approximation Algorithms with Applications to Optimal Motion Planning","year":2003,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":20,"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":"National Science Foundation","keywords":"Mathematics; Approximation algorithm; Algorithm; Combinatorics; Euclidean geometry; Path (computing); Geometry; Computer science","score_opus":0.0213936465075181,"score_gpt":0.28247218594386614,"score_spread":0.26107853943634807,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2062105084","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014817567,0.0007320286,0.9948003,0.00019951038,0.00014256788,0.000018819486,0.000035966037,0.00026618628,0.0023228738],"genre_scores_gemma":[0.1035536,0.0022816176,0.8860768,0.00023823821,0.00032640286,0.00030121935,0.00029842352,0.0004913954,0.0064322143],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99854326,0.00057439995,0.000078561236,0.0001580813,0.0005731174,0.00007255797],"domain_scores_gemma":[0.9944713,0.0039719064,0.00024018614,0.00055860716,0.0006090654,0.00014891809],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018014575,0.0015917221,0.0017555734,0.0017388203,0.0012314463,0.0023016722,0.002223246,0.0023460109,0.007198605],"category_scores_gemma":[0.01327179,0.0012729804,0.0011518855,0.0047224327,0.0020920776,0.0036906712,0.002484547,0.00432781,0.0015922944],"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.0001809062,0.000087711756,0.00029846418,0.00021545125,0.00003953192,0.00006521162,0.00014461236,0.5268976,0.00091308623,0.28225613,0.007156412,0.18174493],"study_design_scores_gemma":[0.000024124525,0.000026617658,0.000052995747,0.00002305597,0.000009911862,0.000041147832,0.000018098322,0.884627,0.00044455068,0.110474594,0.004246632,0.00001131273],"about_ca_topic_score_codex":0.00494842,"about_ca_topic_score_gemma":0.0043929955,"teacher_disagreement_score":0.007198605,"about_ca_system_score_codex":0.0013704638,"about_ca_system_score_gemma":0.0014769702,"threshold_uncertainty_score":0.024081707},"labels":[],"label_agreement":null},{"id":"W2064178031","doi":"10.1007/s00454-009-9160-8","title":"Characterizing Graphs with Convex and Connected Cayley Configuration Spaces","year":2009,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Structural Analysis and Optimization","field":"Engineering","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"McGill University; National Science Foundation","keywords":"Mathematics; Cayley graph; Cayley transform; Combinatorics; Discrete mathematics; Convexity; Graph; Line graph; Voltage graph","score_opus":0.004790835647840105,"score_gpt":0.19709045246350088,"score_spread":0.19229961681566077,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2064178031","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5392343,0.00056541956,0.41817153,0.0011494615,0.000085904016,0.00010855527,0.0007805387,0.00045133597,0.039452966],"genre_scores_gemma":[0.9597796,0.00033517712,0.029938819,0.00024182019,0.00010271665,0.00009001988,0.0007692784,0.00013924147,0.008603338],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99904853,0.00029977752,0.000034906694,0.00025359017,0.00024272998,0.000120500416],"domain_scores_gemma":[0.99405944,0.003062866,0.0011172188,0.0004998603,0.0006695824,0.00059107156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008265305,0.0012293437,0.00087873876,0.0030420606,0.0014585826,0.004405999,0.0023556487,0.00206829,0.006859167],"category_scores_gemma":[0.007315659,0.0011639561,0.0007125237,0.0029083206,0.0032496573,0.0058056084,0.002420428,0.0021874572,0.0007433978],"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.000037013615,0.000026466569,0.0007749462,0.00004258742,0.000016551885,0.00011510003,0.00021645607,0.016560525,0.0011343261,0.9751865,0.0012114563,0.004678065],"study_design_scores_gemma":[0.000010423263,0.000016093612,0.00044430065,0.000010994805,0.000008662484,0.00011252101,0.00017037317,0.04648622,0.00051567436,0.95125145,0.0009562657,0.00001702977],"about_ca_topic_score_codex":0.0020938145,"about_ca_topic_score_gemma":0.0025539328,"teacher_disagreement_score":0.006859167,"about_ca_system_score_codex":0.0014097394,"about_ca_system_score_gemma":0.0006580468,"threshold_uncertainty_score":0.022946179},"labels":[],"label_agreement":null},{"id":"W2064896804","doi":"10.1007/s00454-008-9075-9","title":"Asymmetry of Convex Polytopes and Vertex Index of Symmetric Convex Bodies","year":2008,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Point processes and geometric inequalities","field":"Mathematics","cited_by":10,"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 Alberta","funders":"","keywords":"Combinatorics; Mathematics; Convex body; Convex polytope; Polytope; Vertex (graph theory); Regular polygon; Convex analysis; Convex hull; Geometry; Convex optimization; Graph","score_opus":0.040604842526013415,"score_gpt":0.2984391542783099,"score_spread":0.2578343117522965,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2064896804","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6994165,0.0004466519,0.2707648,0.00032718878,0.00008126877,0.00006061482,0.00056638254,0.00009305132,0.0282435],"genre_scores_gemma":[0.98454905,0.0003011981,0.011444813,0.00003828603,0.00006671938,0.000051219668,0.00036256108,0.00005567345,0.003130512],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99913955,0.00013830462,0.000048467424,0.0001491197,0.000358429,0.00016607954],"domain_scores_gemma":[0.9936055,0.0032095085,0.0014089593,0.0003779722,0.00069678464,0.0007012886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012965328,0.00066448783,0.0014473206,0.002666224,0.0009844594,0.003989649,0.0018159446,0.0010063334,0.0051678875],"category_scores_gemma":[0.008139983,0.0006523525,0.0009080557,0.0016847166,0.002894988,0.003740849,0.0019641742,0.0020634062,0.0005572235],"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.0003176191,0.00006262497,0.0051264986,0.0001120325,0.000035354544,0.00022202544,0.00034345055,0.06395696,0.006355172,0.90379035,0.00089990225,0.018777931],"study_design_scores_gemma":[0.00003441402,0.00007464522,0.0041247155,0.000043111453,0.000029489202,0.0002887573,0.00028661688,0.21457674,0.003601793,0.7754951,0.0013988555,0.000045679866],"about_ca_topic_score_codex":0.00097597146,"about_ca_topic_score_gemma":0.0009301016,"teacher_disagreement_score":0.0051678875,"about_ca_system_score_codex":0.001355946,"about_ca_system_score_gemma":0.00057654415,"threshold_uncertainty_score":0.017288327},"labels":[],"label_agreement":null},{"id":"W2068450184","doi":"10.1007/s00454-008-9054-1","title":"Pure Point Diffractive Substitution Delone Sets Have the Meyer Property","year":2008,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Quasicrystal Structures and Properties","field":"Materials Science","cited_by":27,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada; Weizmann Institute of Science; University of Washington; University of Victoria; National Science Foundation","keywords":"Mathematics; Substitution (logic); Point (geometry); Set (abstract data type); Connection (principal bundle); Combinatorics; Dynamical systems theory; Property (philosophy); Discrete mathematics; Pure mathematics; Physics; Geometry; Computer science; Quantum mechanics","score_opus":0.02142055357960614,"score_gpt":0.24818173110125952,"score_spread":0.22676117752165337,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2068450184","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.67971486,0.0012419757,0.18279378,0.0007306081,0.00021691086,0.000050799597,0.0005694947,0.0004495102,0.13423198],"genre_scores_gemma":[0.96496505,0.00034230278,0.018017272,0.00017717943,0.000048483365,0.000038468595,0.00025949953,0.00010524831,0.016046606],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996339,0.000053440952,0.000021454489,0.000060792387,0.00015808336,0.00007228051],"domain_scores_gemma":[0.99945873,0.0001720395,0.00007386974,0.00015617226,0.000087971974,0.000051248702],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039712715,0.000607686,0.0007056312,0.0011899485,0.0011295328,0.002227102,0.00064146926,0.0006168699,0.0059573487],"category_scores_gemma":[0.0011310402,0.00027634492,0.00049012544,0.0008414961,0.0016797851,0.0019873693,0.001281845,0.0009963765,0.0009106802],"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.00005879162,0.000008115136,0.00013477623,0.000025797275,0.0000071397726,0.000043703345,0.000085537795,0.0006999067,0.0032144964,0.98915416,0.00048134863,0.0060861954],"study_design_scores_gemma":[0.000033245982,0.000056242443,0.00045011935,0.000018570789,0.000015940785,0.00034897475,0.0001527132,0.010159799,0.013046042,0.96738476,0.008299009,0.00003456923],"about_ca_topic_score_codex":0.00042492006,"about_ca_topic_score_gemma":0.0005256237,"teacher_disagreement_score":0.0059573487,"about_ca_system_score_codex":0.00058794185,"about_ca_system_score_gemma":0.0003087596,"threshold_uncertainty_score":0.01992929},"labels":[],"label_agreement":null},{"id":"W2068564171","doi":"10.1007/s00454-003-0006-7","title":"Blowing Up Polygonal Linkages","year":2003,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Structural Analysis and Optimization","field":"Engineering","cited_by":73,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Deutsche Forschungsgemeinschaft; McGill University","keywords":"Mathematics; Combinatorics; Disjoint sets; Conjecture; Linkage (software); Regular polygon; Arc (geometry); Piecewise; Differentiable function; Polygonal chain; Plane (geometry); Planar; Symmetry (geometry); Geometry; Pure mathematics; Mathematical analysis; Computer science","score_opus":0.006604200726812044,"score_gpt":0.21412340346909048,"score_spread":0.20751920274227845,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2068564171","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34235695,0.000844607,0.40031984,0.00077576964,0.000823106,0.00015273392,0.00033454955,0.0009105121,0.25348195],"genre_scores_gemma":[0.86129284,0.00059915497,0.05505342,0.00028462545,0.00011564301,0.00006920166,0.00026025187,0.00046924298,0.08185574],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99987495,0.00001638697,0.0000047179574,0.000027723925,0.00004911716,0.000027097252],"domain_scores_gemma":[0.9997609,0.00008115535,0.000029085983,0.000056921635,0.000033403867,0.000038604463],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014870967,0.0004597345,0.00044750888,0.0010350094,0.0007780307,0.00090734905,0.00044942828,0.0009055621,0.03164028],"category_scores_gemma":[0.00152361,0.00037878918,0.00047215002,0.0004955338,0.0008269551,0.0013942834,0.0016800866,0.0013590979,0.0014709837],"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.00013016141,0.00007423237,0.0005513002,0.00028054518,0.000044196837,0.0011494315,0.00051639986,0.0990153,0.018928189,0.76253086,0.007653185,0.109126106],"study_design_scores_gemma":[0.00003906811,0.0002092411,0.0009140374,0.00010647497,0.000030626918,0.0010450309,0.00064049795,0.21745442,0.007349366,0.7342772,0.037903905,0.00003014588],"about_ca_topic_score_codex":0.00041822778,"about_ca_topic_score_gemma":0.00061600824,"teacher_disagreement_score":0.03164028,"about_ca_system_score_codex":0.0002788805,"about_ca_system_score_gemma":0.0002185138,"threshold_uncertainty_score":0.1058473},"labels":[],"label_agreement":null},{"id":"W2068790848","doi":"10.1007/s00454-007-9019-9","title":"Computing the Detour and Spanning Ratio of Paths, Trees, and Cycles in 2D and 3D","year":2007,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":40,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs; Army Research Office; Tel Aviv University; Deutsche Forschungsgemeinschaft; Deutscher Akademischer Austauschdienst; National Science Foundation","keywords":"Spanning tree; Combinatorics; Minimum spanning tree; Euclidean geometry; Mathematics; Euclidean minimum spanning tree; Planar graph; Graph; Euclidean space; k-minimum spanning tree; Planar; Path (computing); Steiner tree problem; Discrete mathematics; Minimum degree spanning tree; Computer science; Tree structure; Binary tree; Geometry","score_opus":0.01198783087499152,"score_gpt":0.2639476584860729,"score_spread":0.2519598276110814,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2068790848","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.820177,0.0004495315,0.17481966,0.00015900377,0.000023290924,0.0000370017,0.0004444778,0.00096042105,0.002929708],"genre_scores_gemma":[0.89513373,0.00018876982,0.102715306,0.000020240024,0.000011954342,0.000027603666,0.00059138995,0.00017667061,0.0011342943],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996642,0.00006789839,0.000022327056,0.00007306601,0.00012535893,0.000047190977],"domain_scores_gemma":[0.9981614,0.00128668,0.00016370817,0.00011335754,0.00014817316,0.00012670926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005595618,0.0006774379,0.00079705496,0.002038137,0.00046828165,0.001178919,0.0010232847,0.0008816889,0.0020765786],"category_scores_gemma":[0.0059717586,0.0005417665,0.00045905903,0.0013658616,0.0006316837,0.0020690972,0.00089108094,0.000501873,0.0002888283],"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.00095147,0.00014570795,0.015686518,0.00022977733,0.00011290848,0.00025538835,0.00034858365,0.7828592,0.009414848,0.02165491,0.0018924379,0.16644825],"study_design_scores_gemma":[0.000014422117,0.000032041506,0.0012034792,0.0000051339503,0.000009168873,0.000056430745,0.000067491295,0.98901725,0.0017132087,0.007556044,0.00031647942,0.000008861649],"about_ca_topic_score_codex":0.005867352,"about_ca_topic_score_gemma":0.010878064,"teacher_disagreement_score":0.005867352,"about_ca_system_score_codex":0.00061024615,"about_ca_system_score_gemma":0.00046481457,"threshold_uncertainty_score":0.011666417},"labels":[],"label_agreement":null},{"id":"W2068821766","doi":"10.1007/s00454-009-9190-2","title":"The Odd-Distance Plane Graph","year":2009,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs; United States-Israel Binational Science Foundation; National Science Foundation","keywords":"Combinatorics; Mathematics; Geometric graph theory; Distance-regular graph; Butterfly graph; Petersen graph; Wheel graph; Windmill graph; Graph power; Graph; Friendship graph; Discrete mathematics; Planar graph; Voltage graph; Line graph","score_opus":0.008770172417843971,"score_gpt":0.24651940598952396,"score_spread":0.23774923357167999,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2068821766","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37381986,0.0008596933,0.4562883,0.0025297448,0.00029217976,0.00014290433,0.0024109073,0.00044336353,0.163213],"genre_scores_gemma":[0.81879914,0.0014029691,0.1232218,0.00065511506,0.00013405418,0.000116408424,0.002664344,0.00027707883,0.05272917],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998629,0.00002637861,0.000004571499,0.00003997256,0.000041008698,0.00002522428],"domain_scores_gemma":[0.9996208,0.00009597821,0.000068526824,0.000064565655,0.000078422665,0.000071756695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012678998,0.00034046473,0.0003353989,0.0008603373,0.0007708725,0.0012342476,0.00078982423,0.0005452865,0.008933799],"category_scores_gemma":[0.0008883414,0.00020083519,0.00020349525,0.0007888223,0.0007295593,0.0015292744,0.00088778674,0.0011041763,0.0013022461],"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.00014670129,0.000033816224,0.000994982,0.000090339454,0.000012797302,0.00019051283,0.00015712011,0.009227749,0.0042988164,0.92584,0.007995488,0.05101169],"study_design_scores_gemma":[0.00003212884,0.000032155294,0.0010200952,0.000027023323,0.000017899163,0.00034597176,0.0002260569,0.029868867,0.002055184,0.92090595,0.04545427,0.000014416328],"about_ca_topic_score_codex":0.0019735722,"about_ca_topic_score_gemma":0.0018561373,"teacher_disagreement_score":0.008933799,"about_ca_system_score_codex":0.00051631907,"about_ca_system_score_gemma":0.00039257866,"threshold_uncertainty_score":0.029886603},"labels":[],"label_agreement":null},{"id":"W2069358561","doi":"10.1007/s00454-004-1152-0","title":"Output-Sensitive Algorithms for Computing Nearest-Neighbour Decision Boundaries","year":2005,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":168,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Carleton University; University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada; McGill University; Alexander von Humboldt-Stiftung","keywords":"Mathematics; Combinatorics; Boundary (topology); Algorithm; Nearest neighbour; Set (abstract data type); Point (geometry); Decision boundary; Decision rule; Line segment; k-nearest neighbors algorithm; Computer science; Artificial intelligence; Geometry; Statistics; Mathematical analysis","score_opus":0.021132077019035658,"score_gpt":0.29788084914743057,"score_spread":0.27674877212839494,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2069358561","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0060862415,0.00013929364,0.9920345,0.0000663906,0.00003913838,0.00005425427,0.00006011784,0.00074477796,0.00077529],"genre_scores_gemma":[0.2171212,0.00014960741,0.7786116,0.00018618695,0.00007193751,0.0002715776,0.00058291317,0.00042718515,0.0025778217],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99614835,0.0011292117,0.0003262533,0.0005813779,0.0015658321,0.00024896662],"domain_scores_gemma":[0.98663944,0.009012174,0.00053627323,0.0013892517,0.0021879917,0.00023480674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048262896,0.0012286193,0.0022166257,0.001912105,0.0014560762,0.0029339544,0.003945647,0.002496717,0.006467793],"category_scores_gemma":[0.02609133,0.0010119472,0.0010219285,0.002036292,0.0013716728,0.003007807,0.0040721195,0.003074788,0.001606115],"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.00061266473,0.00022312919,0.0013694165,0.00024393348,0.00009033246,0.00009443065,0.00023954114,0.47530156,0.0042227553,0.041285995,0.004565534,0.47175068],"study_design_scores_gemma":[0.000021344102,0.000029012504,0.00012291859,0.000013990529,0.000011899601,0.000025920175,0.000018357805,0.97590566,0.0026174495,0.020604387,0.0006186398,0.000010297324],"about_ca_topic_score_codex":0.0039772536,"about_ca_topic_score_gemma":0.0047087967,"teacher_disagreement_score":0.006467793,"about_ca_system_score_codex":0.0018815321,"about_ca_system_score_gemma":0.0018793644,"threshold_uncertainty_score":0.025524199},"labels":[],"label_agreement":null},{"id":"W2069812454","doi":"10.1007/s00454-003-2857-1","title":"Distance Sets of Well-Distributed Planar Point Sets","year":2004,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Mathematical Approximation and Integration","field":"Mathematics","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Combinatorics; Mathematics; Planar; Polygon (computer graphics); Point (geometry); Set (abstract data type); Discrete mathematics; Geometry; Computer science","score_opus":0.026093379307435428,"score_gpt":0.30632671577548415,"score_spread":0.2802333364680487,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2069812454","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25453782,0.0009863939,0.7300939,0.00061381725,0.000078167635,0.000107166794,0.00069058227,0.00019588902,0.012696254],"genre_scores_gemma":[0.87321955,0.0008444243,0.11440102,0.00020558198,0.00016505277,0.00030304564,0.0013741599,0.000113072514,0.009374148],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963373,0.00070776616,0.00025656875,0.000657416,0.0017890141,0.00025190733],"domain_scores_gemma":[0.986186,0.007448567,0.0019069266,0.0012919646,0.0020612355,0.0011052528],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018932752,0.0011659036,0.0020534543,0.00510097,0.0014724139,0.0049130907,0.004858967,0.0018395827,0.0036452336],"category_scores_gemma":[0.021322498,0.001301468,0.0011299939,0.0036174997,0.0035180084,0.005872466,0.0064613894,0.002880747,0.00068350043],"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.0001989942,0.000058495316,0.0015154418,0.00016649373,0.0000792273,0.0002198107,0.0005503347,0.07118654,0.002694603,0.90324646,0.0009934985,0.019090159],"study_design_scores_gemma":[0.0000339582,0.000052412677,0.0009360181,0.000029946294,0.000022173797,0.00032448026,0.00024244275,0.17790362,0.0013777621,0.816882,0.0021596842,0.000035514553],"about_ca_topic_score_codex":0.001488354,"about_ca_topic_score_gemma":0.0011913911,"teacher_disagreement_score":0.00510097,"about_ca_system_score_codex":0.0021156732,"about_ca_system_score_gemma":0.0006455444,"threshold_uncertainty_score":0.015350282},"labels":[],"label_agreement":null},{"id":"W2070606919","doi":"10.1007/s00454-007-1318-7","title":"Graph Treewidth and Geometric Thickness Parameters","year":2007,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":82,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Departament d'Universitats, Recerca i Societat de la Informació; Natural Sciences and Engineering Research Council of Canada; Ministerio de Economía y Competitividad; Centre de Recherches Mathématiques","keywords":"Arboricity; Treewidth; Combinatorics; Mathematics; Regular polygon; Conjecture; Upper and lower bounds; Partial k-tree; 1-planar graph; Graph; Crossing number (knot theory); Planar graph; Discrete mathematics; Pathwidth; Geometry; Chordal graph; Mathematical analysis; Line graph","score_opus":0.019270224172990538,"score_gpt":0.2982417351459352,"score_spread":0.2789715109729447,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2070606919","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7035707,0.0036328794,0.24178506,0.0029725425,0.0001839173,0.000069500114,0.0012974899,0.00077232806,0.045715556],"genre_scores_gemma":[0.96603596,0.0011932676,0.025695093,0.00017484075,0.0001878897,0.00007765041,0.00044100848,0.0004966522,0.00569756],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990646,0.00022363379,0.00004385484,0.00028118017,0.00020780215,0.00017892288],"domain_scores_gemma":[0.9858293,0.0083977515,0.0025525715,0.0014898578,0.0006137388,0.0011168617],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014910038,0.00088171917,0.0009109561,0.0024158808,0.0011038034,0.0038969414,0.0026516921,0.0021008693,0.01155046],"category_scores_gemma":[0.018061271,0.0012895622,0.0004993408,0.0037012184,0.0027082763,0.014987172,0.0027936473,0.0030594117,0.0011669769],"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.0005645897,0.00011286901,0.010518388,0.00022420946,0.000057570553,0.0002701755,0.0007402247,0.06902786,0.011231747,0.8582587,0.0058879307,0.04310566],"study_design_scores_gemma":[0.000049927523,0.0000652826,0.003859151,0.00008592439,0.000084074236,0.0008667205,0.0005630611,0.10723857,0.00664705,0.87503046,0.0054429313,0.00006681837],"about_ca_topic_score_codex":0.0007967501,"about_ca_topic_score_gemma":0.0010622037,"teacher_disagreement_score":0.01155046,"about_ca_system_score_codex":0.0013030277,"about_ca_system_score_gemma":0.00056802423,"threshold_uncertainty_score":0.03864014},"labels":[],"label_agreement":null},{"id":"W2074682596","doi":"10.1007/s00454-009-9204-0","title":"Algorithms for Approximate Shortest Path Queries on Weighted Polyhedral Surfaces","year":2009,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; U.S. Department of Energy","keywords":"Mathematics; Shortest path problem; Combinatorics; Logarithm; Euclidean geometry; Data structure; Graph; Range (aeronautics); Discrete mathematics; Algorithm; Computer science","score_opus":0.019290037217268973,"score_gpt":0.28079750833709416,"score_spread":0.2615074711198252,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2074682596","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047409493,0.0007892401,0.94155383,0.00063896325,0.00012119213,0.00031802294,0.0010179696,0.0040525985,0.0040987534],"genre_scores_gemma":[0.31878692,0.00063368503,0.6693311,0.00021188566,0.000111202346,0.0005592968,0.004171025,0.0009994534,0.0051954216],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960044,0.0005421607,0.00030938408,0.0008041966,0.0018488419,0.00049106556],"domain_scores_gemma":[0.9927349,0.0040727947,0.00035026736,0.0017879086,0.00079644227,0.00025759646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019982802,0.0017929537,0.0034443801,0.0023846738,0.0016006823,0.004326002,0.0054691243,0.002596575,0.009905683],"category_scores_gemma":[0.014294922,0.0013257614,0.001733094,0.0067160036,0.0015350751,0.010484677,0.0066553876,0.0028973483,0.0020806855],"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.001402192,0.00041359538,0.0020354714,0.0008027637,0.00019583649,0.00019509511,0.0006768399,0.47107136,0.008081797,0.09406059,0.022377657,0.3986867],"study_design_scores_gemma":[0.000095137904,0.000054433036,0.0001465032,0.000018073597,0.000025499505,0.000060909282,0.00017722884,0.9195784,0.0018140011,0.07576524,0.0022482835,0.000016368718],"about_ca_topic_score_codex":0.00740019,"about_ca_topic_score_gemma":0.009669504,"teacher_disagreement_score":0.009905683,"about_ca_system_score_codex":0.0025663332,"about_ca_system_score_gemma":0.0020796026,"threshold_uncertainty_score":0.033137858},"labels":[],"label_agreement":null},{"id":"W2077735330","doi":"10.1007/s00454-012-9417-5","title":"Approximation Algorithms for Maximum Independent Set of Pseudo-Disks","year":2012,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":131,"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":"Mathematics; Rounding; Approximation algorithm; Set (abstract data type); Independent set; Combinatorics; Algorithm; Plane (geometry); Relaxation (psychology); Linear programming relaxation; Set packing; Discrete mathematics; Linear programming; Computer science; Geometry; Graph","score_opus":0.03693149263006409,"score_gpt":0.3046274523030603,"score_spread":0.26769595967299625,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2077735330","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00784892,0.00080006354,0.9852704,0.00047340937,0.00014359911,0.00010582772,0.0002587551,0.00046394693,0.004635078],"genre_scores_gemma":[0.18929641,0.0012053078,0.79949623,0.0003424931,0.0003349085,0.0006854766,0.0013212946,0.0006345683,0.006683321],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99699044,0.001261808,0.00015861727,0.00044356403,0.00087317656,0.0002723231],"domain_scores_gemma":[0.98627937,0.009956959,0.00049892685,0.0017251737,0.0010185672,0.00052092085],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003918263,0.0024158198,0.0032674058,0.0029006263,0.0014394384,0.0038867965,0.0074747102,0.0032104878,0.009539285],"category_scores_gemma":[0.029486122,0.0019594426,0.0026289145,0.005033333,0.0021614549,0.0070899474,0.0062741316,0.005702548,0.0021850816],"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.00054613,0.00023197613,0.00076137116,0.00059083797,0.000160456,0.00008249648,0.00030745048,0.6392685,0.0009997018,0.23235331,0.013125213,0.11157256],"study_design_scores_gemma":[0.00005198746,0.000027332055,0.00008143929,0.000032978747,0.000021537715,0.000033357246,0.00003476977,0.8704271,0.00037454432,0.12747777,0.0014251794,0.000011982926],"about_ca_topic_score_codex":0.0028518303,"about_ca_topic_score_gemma":0.0033513072,"teacher_disagreement_score":0.009539285,"about_ca_system_score_codex":0.003433702,"about_ca_system_score_gemma":0.0023299793,"threshold_uncertainty_score":0.03191203},"labels":[],"label_agreement":null},{"id":"W2078355120","doi":"10.1007/s00454-011-9388-y","title":"Matroid Enumeration for Incidence Geometry","year":2011,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":45,"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":"Matroid; Combinatorics; Mathematics; Oriented matroid; Hyperplane; Graphic matroid; Enumeration; Rank (graph theory); Discrete mathematics; Discrete geometry; Antipodal point; Incidence (geometry); Geometry","score_opus":0.028588883420126835,"score_gpt":0.26595618511322267,"score_spread":0.23736730169309583,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2078355120","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026308164,0.0003013122,0.94269973,0.0004866199,0.000101142105,0.00008210664,0.00059386034,0.0007165797,0.028710483],"genre_scores_gemma":[0.38909653,0.0010552458,0.568699,0.00050003524,0.00032758742,0.0003719882,0.0035057878,0.0010552297,0.035388656],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99889,0.00022801557,0.00008072787,0.00020452111,0.00045307836,0.00014367698],"domain_scores_gemma":[0.99769574,0.0009955071,0.00013957714,0.00061573816,0.0004036958,0.00014971857],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007802255,0.00075218646,0.0012590098,0.0018292345,0.00111975,0.0035402772,0.002288464,0.00091553567,0.012280712],"category_scores_gemma":[0.004736769,0.0007607859,0.0014842439,0.0025167188,0.0012639469,0.0049907537,0.0036073509,0.0040393206,0.0028370167],"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.00006783483,0.000103629776,0.00058212556,0.00013167631,0.000019304993,0.000060910166,0.00018999545,0.013245416,0.0019164499,0.88195646,0.008274723,0.09345144],"study_design_scores_gemma":[0.000011553336,0.000018354178,0.00017290376,0.000024069415,0.000011996487,0.00008256769,0.000058565456,0.06667483,0.0012696448,0.9240833,0.007579624,0.000012444417],"about_ca_topic_score_codex":0.0013628853,"about_ca_topic_score_gemma":0.0020672537,"teacher_disagreement_score":0.012280712,"about_ca_system_score_codex":0.0012411997,"about_ca_system_score_gemma":0.00074978394,"threshold_uncertainty_score":0.041083038},"labels":[],"label_agreement":null},{"id":"W2083046806","doi":"10.1007/s00454-005-1183-1","title":"Transversals to Line Segments in Three-Dimensional Space","year":2005,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Institut national de recherche en informatique et en automatique (INRIA); McGill University","keywords":"Mathematics; Combinatorics; Line segment; Line (geometry); Hyperboloid; Space (punctuation); Upper and lower bounds; Geometry; Mathematical analysis; Computer science","score_opus":0.015291887743706436,"score_gpt":0.27093243330678074,"score_spread":0.2556405455630743,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083046806","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1824214,0.00030565605,0.7982593,0.00017510969,0.00018905888,0.0001887798,0.00041321237,0.0010019678,0.017045526],"genre_scores_gemma":[0.6714869,0.0007938623,0.29641786,0.000082538376,0.0000857043,0.000245121,0.001239137,0.00063015555,0.029018635],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99959725,0.0000939874,0.000023407252,0.00009189138,0.00014303486,0.000050538023],"domain_scores_gemma":[0.9988324,0.00023073515,0.00022462069,0.00014483568,0.00042047273,0.00014697951],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035843576,0.0006113313,0.00036526623,0.0019049358,0.0006803886,0.0016940096,0.00091407885,0.00069792534,0.008962689],"category_scores_gemma":[0.0027556259,0.0004071832,0.00037311154,0.0015287226,0.0009961326,0.0012702751,0.0017476785,0.0014127037,0.002166802],"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.00064359326,0.00028764855,0.0048565613,0.00035885198,0.00004531447,0.00067816215,0.0024827963,0.06685007,0.050780997,0.57840216,0.00848169,0.28613216],"study_design_scores_gemma":[0.00010465599,0.00066189043,0.004050965,0.00022174529,0.000043924683,0.0010661186,0.0031719094,0.5006627,0.044993185,0.36070818,0.08422526,0.00008945173],"about_ca_topic_score_codex":0.0015518308,"about_ca_topic_score_gemma":0.0018815321,"teacher_disagreement_score":0.008962689,"about_ca_system_score_codex":0.0005049452,"about_ca_system_score_gemma":0.00038157045,"threshold_uncertainty_score":0.029983163},"labels":[],"label_agreement":null},{"id":"W2084176317","doi":"10.1007/s00454-001-0013-3","title":"On the Number of Balanced Lines","year":2001,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"York University; Hungarian Scientific Research Fund; City University of New York; National Science Foundation","keywords":"Mathematics; Combinatorics; General position; Conjecture; Bounded function; Plane (geometry); Line (geometry); Set (abstract data type); Discrete mathematics; Geometry; Mathematical analysis","score_opus":0.016084635105653722,"score_gpt":0.27943787908684875,"score_spread":0.26335324398119503,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2084176317","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28869084,0.0024248154,0.59528935,0.0038086232,0.0005375424,0.00014588948,0.001134943,0.0008374081,0.107130535],"genre_scores_gemma":[0.82054067,0.0016468153,0.14179711,0.00056390784,0.00042084334,0.00028690783,0.0012145436,0.00061731454,0.032912],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979672,0.0005910186,0.00009767699,0.00045121706,0.0005637425,0.00032915125],"domain_scores_gemma":[0.9790558,0.013957385,0.0019454281,0.0018444229,0.0018837241,0.0013131902],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002405021,0.00088045275,0.0009997683,0.0025063537,0.0016402502,0.0038432686,0.002105479,0.001773145,0.021021394],"category_scores_gemma":[0.027110675,0.0008007933,0.0004981309,0.0018789663,0.002427503,0.008800454,0.00237653,0.0023595404,0.0022642908],"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.0008615083,0.0001371786,0.0055444944,0.00025386928,0.000053040007,0.00014016585,0.00029536602,0.06791605,0.0065583494,0.7941782,0.0140689695,0.109992735],"study_design_scores_gemma":[0.000089702844,0.00012296865,0.0013773666,0.00009908956,0.000043151522,0.00028110752,0.00020800323,0.24595794,0.0031040441,0.7366677,0.012016866,0.000032145017],"about_ca_topic_score_codex":0.00096370484,"about_ca_topic_score_gemma":0.0013398093,"teacher_disagreement_score":0.021021394,"about_ca_system_score_codex":0.0013358912,"about_ca_system_score_gemma":0.00072587753,"threshold_uncertainty_score":0.07032359},"labels":[],"label_agreement":null},{"id":"W2085831227","doi":"10.1007/s00454-010-9303-y","title":"Coreduction Homology Algorithm for Regular CW-Complexes","year":2010,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"Natural Sciences and Engineering Research Council of Canada; Ministerstwo Edukacji i Nauki; U.S. Department of Energy; National Science Foundation","keywords":"Mathematics; Homology (biology); Algorithm; Preprocessor; Persistent homology; Combinatorics; Discrete mathematics; Computer science; Artificial intelligence","score_opus":0.011808489082576054,"score_gpt":0.27068170221882815,"score_spread":0.2588732131362521,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2085831227","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026514309,0.00013733283,0.9655029,0.000094287425,0.000051597,0.00008791724,0.000105853,0.0013443513,0.006161393],"genre_scores_gemma":[0.2938677,0.00028555773,0.6933138,0.00017464293,0.000053060197,0.00019343733,0.0015443312,0.00076898513,0.00979846],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99928635,0.000083400846,0.000053379288,0.00020209866,0.0002628937,0.00011195359],"domain_scores_gemma":[0.99912626,0.00023675952,0.000044328932,0.0002613496,0.00026079538,0.00007047545],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000652107,0.00039614952,0.0006475516,0.0018062363,0.00061324093,0.0017002474,0.0017352451,0.0005459189,0.011487311],"category_scores_gemma":[0.002162361,0.00032157387,0.0006269538,0.001140124,0.0010936898,0.0036343026,0.0032876846,0.0014775764,0.0027309682],"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.0002194237,0.00014914252,0.0018969973,0.0002717703,0.00004491886,0.00032637073,0.00052248855,0.020988217,0.026008097,0.4945177,0.0100810975,0.44497386],"study_design_scores_gemma":[0.00008540473,0.00021154612,0.0014997469,0.000076005395,0.000045460787,0.00091841596,0.0004533128,0.39983514,0.06779111,0.47154233,0.057460483,0.00008103945],"about_ca_topic_score_codex":0.0008860708,"about_ca_topic_score_gemma":0.0008648855,"teacher_disagreement_score":0.011487311,"about_ca_system_score_codex":0.00069005496,"about_ca_system_score_gemma":0.00078879116,"threshold_uncertainty_score":0.038428843},"labels":[],"label_agreement":null},{"id":"W2089943985","doi":"10.1007/s00454-015-9677-y","title":"On Constant Factors in Comparison-Based Geometric Algorithms and Data Structures","year":2015,"lang":"en","type":"article","venue":"Discrete & 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 Waterloo","funders":"","keywords":"Intersection (aeronautics); Mathematics; Constant (computer programming); Regular polygon; Convex hull; Algorithm; Computational geometry; Binary number; Point (geometry); Asymptotically optimal algorithm; Combinatorics; Mathematical optimization; Geometry; Computer science","score_opus":0.06708566401529192,"score_gpt":0.33068781697860244,"score_spread":0.2636021529633105,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2089943985","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016670518,0.0029675588,0.96741945,0.0012441525,0.00033751022,0.00013525698,0.0001513843,0.0012754021,0.009798732],"genre_scores_gemma":[0.31088138,0.0018753238,0.6739623,0.0008352218,0.0006832479,0.000273954,0.0005167071,0.0015935668,0.009378319],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9822666,0.007110037,0.001021466,0.0028451935,0.005630822,0.0011258405],"domain_scores_gemma":[0.9156028,0.057710838,0.0023655626,0.016405655,0.0066836774,0.0012314818],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.018983541,0.001997033,0.0025265997,0.0036520266,0.0023778272,0.0041820337,0.004811789,0.002274472,0.016156245],"category_scores_gemma":[0.11243956,0.0012750869,0.0020109832,0.006632801,0.006879274,0.020288276,0.0073642945,0.005411118,0.0031192696],"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.002070513,0.00025482455,0.003774743,0.000454189,0.000094086856,0.000119058015,0.0005839126,0.06632575,0.00295796,0.5419789,0.01195083,0.36943528],"study_design_scores_gemma":[0.00021207726,0.0005577201,0.00064614345,0.00022891058,0.00013072207,0.00028751494,0.000255713,0.2669539,0.0076918225,0.7014588,0.021509169,0.000067538116],"about_ca_topic_score_codex":0.004630966,"about_ca_topic_score_gemma":0.0042822855,"teacher_disagreement_score":0.018983541,"about_ca_system_score_codex":0.0032296972,"about_ca_system_score_gemma":0.0032687804,"threshold_uncertainty_score":0.1003958},"labels":[],"label_agreement":null},{"id":"W2092500953","doi":"10.1007/s00454-009-9236-5","title":"VC Dimensions of Principal Component Analysis","year":2009,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":6,"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":"Mathematics; Combinatorics; Principal component analysis; Affine transformation; Upper and lower bounds; Dimension (graph theory); Eigenvalues and eigenvectors; Subspace topology; Simple (philosophy); VC dimension; Covariance; Discrete mathematics; Covariance matrix; Constant (computer programming); Sign (mathematics); Spectrum (functional analysis); Pure mathematics; Statistics; Mathematical analysis","score_opus":0.011452529167206021,"score_gpt":0.2531162487751962,"score_spread":0.24166371960799016,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2092500953","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019087724,0.0038811038,0.958855,0.0017360523,0.00062063645,0.00005648214,0.0011070156,0.00050798105,0.014148054],"genre_scores_gemma":[0.5846443,0.010660579,0.37299046,0.0013002115,0.002356933,0.0004596154,0.0025244253,0.0004464331,0.024617],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986235,0.00047372378,0.00007943578,0.00021638625,0.0005072714,0.00009981301],"domain_scores_gemma":[0.9957274,0.0021805265,0.00029081394,0.00070865767,0.0008842476,0.00020843103],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001104546,0.0008377526,0.0007139879,0.0015252758,0.00050940964,0.0027291751,0.000910462,0.00084615074,0.005772431],"category_scores_gemma":[0.01032232,0.0003558329,0.0004575891,0.00175888,0.0013121819,0.0024576916,0.0017266726,0.0018455172,0.0012485803],"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.00009282059,0.000037126127,0.00058839825,0.00018394241,0.000042966472,0.00008944313,0.00013302633,0.020519786,0.003972999,0.8126389,0.017088171,0.14461257],"study_design_scores_gemma":[0.00001536067,0.00005353992,0.0011806821,0.000070036505,0.000026452342,0.0003517087,0.00009339015,0.30488202,0.0028373918,0.6570155,0.0334203,0.000053492557],"about_ca_topic_score_codex":0.0016218007,"about_ca_topic_score_gemma":0.0009944955,"teacher_disagreement_score":0.005772431,"about_ca_system_score_codex":0.0005909103,"about_ca_system_score_gemma":0.0009903003,"threshold_uncertainty_score":0.019310713},"labels":[],"label_agreement":null},{"id":"W2098742646","doi":"10.1007/s00454-010-9288-6","title":"Lines Pinning Lines","year":2010,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Banff International Research Station for Mathematical Innovation and Discovery; Korea Advanced Institute of Science and Technology; Research Institute for Mathematical Sciences; Division of Mathematical Sciences; Institut national de recherche en informatique et en automatique (INRIA); National Science Foundation","keywords":"Combinatorics; Polytope; Disjoint sets; Regular polygon; Line (geometry); Transversal (combinatorics); Mathematics; Face (sociological concept); Convex polytope; Pairwise comparison; Convex set; Geometry; Mathematical analysis; Sociology; Convex optimization; Statistics","score_opus":0.012523875588679477,"score_gpt":0.27200951409927454,"score_spread":0.2594856385105951,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098742646","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042562302,0.00031687433,0.7110373,0.00043181176,0.0012854086,0.00037464398,0.00087671465,0.0067740604,0.23634088],"genre_scores_gemma":[0.494801,0.00059661875,0.2917702,0.0005207311,0.0002481708,0.0004252512,0.002340042,0.0032010458,0.20609689],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99933124,0.00006320133,0.000034946457,0.0002043174,0.00028424643,0.00008212092],"domain_scores_gemma":[0.99921393,0.000097916316,0.00008663248,0.00025095593,0.00027169526,0.00007887533],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025229255,0.0011012586,0.00039997458,0.0014686532,0.0010831227,0.0014340626,0.0010030479,0.00089885865,0.076483265],"category_scores_gemma":[0.001394156,0.00051365554,0.00041362393,0.0009650445,0.0008397391,0.0019222522,0.0016875,0.0016915584,0.019048333],"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.00050160446,0.00015673974,0.0012096735,0.0003222787,0.000035292735,0.0007836315,0.00048291212,0.024664734,0.058139905,0.2769908,0.043164983,0.59354734],"study_design_scores_gemma":[0.00013750908,0.0005655756,0.0013250725,0.00017469395,0.000053703116,0.0012891244,0.0006279677,0.099016935,0.16723031,0.12189636,0.6075857,0.00009699898],"about_ca_topic_score_codex":0.0006539246,"about_ca_topic_score_gemma":0.0008436824,"teacher_disagreement_score":0.076483265,"about_ca_system_score_codex":0.0003688807,"about_ca_system_score_gemma":0.0004280193,"threshold_uncertainty_score":0.255862},"labels":[],"label_agreement":null},{"id":"W2101632844","doi":"10.1007/s00454-012-9413-9","title":"Linkless and Flat Embeddings in 3-Space","year":2012,"lang":"en","type":"article","venue":"Discrete & 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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Japan Society for the Promotion of Science; Banff International Research Station for Mathematical Innovation and Discovery","keywords":"Combinatorics; Mathematics; Embedding; Discrete mathematics; Computer science","score_opus":0.016664740178682233,"score_gpt":0.308982869549456,"score_spread":0.2923181293707737,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2101632844","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.72015053,0.0011726471,0.17181513,0.002584564,0.00047067265,0.00008001087,0.0011243324,0.0006279491,0.10197413],"genre_scores_gemma":[0.9440923,0.00047856924,0.019315759,0.00040781722,0.00019783349,0.000058339145,0.0007679731,0.00023108661,0.03445029],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995017,0.00009622953,0.000027423454,0.00010850003,0.00015010207,0.00011601919],"domain_scores_gemma":[0.9988564,0.00030462944,0.00020507888,0.00016839223,0.00017413036,0.00029140862],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037490693,0.0007404273,0.0005644296,0.0022288605,0.0019140089,0.0029334074,0.0012674737,0.0012874275,0.011106542],"category_scores_gemma":[0.0022914796,0.0005180513,0.0005540287,0.0013309498,0.0024148547,0.005552365,0.0031926318,0.0026237061,0.001424865],"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.00007451879,0.000025373067,0.0002797056,0.000029759385,0.000004923196,0.00009708587,0.0002576766,0.0017433551,0.00050752115,0.989592,0.0014656341,0.005922497],"study_design_scores_gemma":[0.000013171187,0.000024611967,0.00037267717,0.000011986647,0.000005937087,0.00010922678,0.00023503244,0.0062356675,0.00030315723,0.98979694,0.0028795777,0.000012006886],"about_ca_topic_score_codex":0.0017551024,"about_ca_topic_score_gemma":0.0019526418,"teacher_disagreement_score":0.011106542,"about_ca_system_score_codex":0.0006792659,"about_ca_system_score_gemma":0.00033501972,"threshold_uncertainty_score":0.03715509},"labels":[],"label_agreement":null},{"id":"W2103307323","doi":"10.1007/s00454-006-1233-3","title":"Colourful Simplicial Depth","year":2006,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":29,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Conjecture; Mathematics; Betti number; Bounding overwatch; Combinatorics; Simplicial manifold; Monochrome; Generalization; Simplicial complex; Point (geometry); Pure mathematics; Simplicial set; Geometry; Computer science; Artificial intelligence; Mathematical analysis","score_opus":0.004734151466921731,"score_gpt":0.20358803825217633,"score_spread":0.1988538867852546,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2103307323","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16741817,0.0012623399,0.35085854,0.0037324072,0.00066037336,0.00012933694,0.001289241,0.0009163691,0.47373316],"genre_scores_gemma":[0.8144116,0.0008522957,0.050241064,0.0009407711,0.00033592168,0.00007790112,0.00070669455,0.0005438149,0.13188988],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991887,0.00011406521,0.000030987147,0.00019121903,0.00029224178,0.00018282425],"domain_scores_gemma":[0.9988071,0.00041073968,0.00007496001,0.00024282455,0.00023319006,0.00023120178],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005471673,0.0008422109,0.0010327342,0.0022489876,0.0022521107,0.00435485,0.0012832932,0.0014114099,0.024664052],"category_scores_gemma":[0.0021897252,0.00066880975,0.0009437541,0.0015642426,0.0032438908,0.006817191,0.004640584,0.0047905426,0.0029203396],"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.000006469775,0.0000050712447,0.00002838717,0.000010755296,0.0000018693609,0.000013752008,0.00007840132,0.00026367168,0.00028627462,0.9963492,0.00077270373,0.0021833559],"study_design_scores_gemma":[0.0000029721546,0.000003241262,0.00004134316,0.000005409231,0.0000032538146,0.00004059079,0.00004095681,0.0011016229,0.00028615168,0.99305445,0.005414697,0.0000054285015],"about_ca_topic_score_codex":0.0018110055,"about_ca_topic_score_gemma":0.0022801058,"teacher_disagreement_score":0.024664052,"about_ca_system_score_codex":0.0018744932,"about_ca_system_score_gemma":0.0006179349,"threshold_uncertainty_score":0.08250946},"labels":[],"label_agreement":null},{"id":"W2106248614","doi":"10.1007/s00454-013-9526-9","title":"Many Collinear $$k$$ k -Tuples with no $$k+1$$ k + 1 Collinear Points","year":2013,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Hungarian Scientific Research Fund","keywords":"Tuple; Combinatorics; Mathematics; Upper and lower bounds; Plane (geometry); Planar; Point (geometry); Line (geometry); Set (abstract data type); Discrete mathematics; Geometry; Mathematical analysis; Computer science","score_opus":0.008008304695346212,"score_gpt":0.22375942436473428,"score_spread":0.21575111966938806,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2106248614","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54904914,0.0018375744,0.38028225,0.001702262,0.00088722457,0.00036429998,0.0045551723,0.0013633391,0.059958756],"genre_scores_gemma":[0.75609696,0.0005116288,0.21594359,0.0003729393,0.00011258968,0.00030593158,0.006034664,0.00082323636,0.019798415],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99727255,0.00035704617,0.00031166116,0.0005824396,0.0009253459,0.00055088085],"domain_scores_gemma":[0.9969795,0.0009309731,0.0003958849,0.00059306563,0.0008901679,0.00021049044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007465905,0.0012374128,0.0015828747,0.0014454997,0.0026269173,0.0029437488,0.0016217591,0.0014617877,0.020027466],"category_scores_gemma":[0.006102231,0.0008701659,0.0011783796,0.0028066211,0.0017298203,0.0038348052,0.0041854125,0.0020357815,0.005170578],"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.0048766825,0.0006471031,0.039497074,0.0021429705,0.0005951373,0.008040555,0.0025965022,0.06343911,0.056767285,0.44709203,0.048928574,0.32537696],"study_design_scores_gemma":[0.000370292,0.0007520847,0.014235196,0.00056944013,0.00033378426,0.009880181,0.0052255234,0.13555431,0.07373488,0.6218248,0.13704972,0.00046974758],"about_ca_topic_score_codex":0.00077618123,"about_ca_topic_score_gemma":0.0012150302,"teacher_disagreement_score":0.020027466,"about_ca_system_score_codex":0.00074600265,"about_ca_system_score_gemma":0.00055785937,"threshold_uncertainty_score":0.06699854},"labels":[],"label_agreement":null},{"id":"W2109075893","doi":"10.1007/s00454-010-9277-9","title":"Long Non-crossing Configurations in the Plane","year":2010,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Combinatorics; Mathematics; Hamiltonian path; Hamiltonian (control theory); General position; Approximation algorithm; Spanning tree; Discrete mathematics; Mathematical optimization; Graph","score_opus":0.01084745765232033,"score_gpt":0.2704098126255391,"score_spread":0.2595623549732188,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2109075893","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.72558904,0.00095635856,0.18747535,0.0008674287,0.00033863212,0.000081174425,0.000555576,0.0006277748,0.08350865],"genre_scores_gemma":[0.96296173,0.00035280906,0.02429241,0.0001307728,0.00004832599,0.00005599811,0.00042656143,0.00021693038,0.011514496],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99960095,0.00006840598,0.00001839574,0.00011158309,0.000103562576,0.000097135526],"domain_scores_gemma":[0.999089,0.00023322518,0.00018518468,0.000121583354,0.00016330602,0.00020772479],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037503205,0.00057542365,0.00072441803,0.0012073934,0.0024533756,0.003050483,0.001036335,0.0014427471,0.012131713],"category_scores_gemma":[0.0022729328,0.00078109774,0.00034819523,0.0011458123,0.001665162,0.0028224275,0.0019493725,0.002020369,0.002219432],"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.00059241557,0.00019354394,0.0036603734,0.00013934665,0.000051520026,0.0014825276,0.0007189987,0.08447313,0.012819628,0.8620333,0.00509834,0.028736858],"study_design_scores_gemma":[0.000102097016,0.00019898727,0.003135194,0.00010033946,0.00003240998,0.0014319421,0.0014720918,0.16918609,0.005696209,0.80813944,0.010406017,0.00009913472],"about_ca_topic_score_codex":0.0008430423,"about_ca_topic_score_gemma":0.0010348062,"teacher_disagreement_score":0.012131713,"about_ca_system_score_codex":0.0008437752,"about_ca_system_score_gemma":0.0005380125,"threshold_uncertainty_score":0.040584624},"labels":[],"label_agreement":null},{"id":"W2110131456","doi":"10.1007/s00454-015-9699-5","title":"The Packing Density of the $$n$$ n -Dimensional Cross-Polytope","year":2015,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":8,"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":"Combinatorics; Mathematics; Polytope; Dimension (graph theory); Sphere packing; Upper and lower bounds; Euclidean geometry; Euclidean space; Space (punctuation); Geometry; Mathematical analysis","score_opus":0.021622339269126056,"score_gpt":0.2817796608075106,"score_spread":0.26015732153838456,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2110131456","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8139843,0.00068020425,0.09122759,0.0004341031,0.00015782248,0.000059223854,0.0013240981,0.0003122563,0.09182046],"genre_scores_gemma":[0.9740898,0.00027351239,0.0155336475,0.00007534032,0.000031792733,0.00007136807,0.0013549579,0.00010253605,0.00846703],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996177,0.000052101386,0.000015297765,0.00008273206,0.00015360706,0.00007858316],"domain_scores_gemma":[0.9991351,0.00039697153,0.00008151389,0.000094821626,0.00018492513,0.00010674451],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030014812,0.0003428833,0.00036950348,0.0010205441,0.00080545555,0.0016089757,0.00073650747,0.00086381857,0.013365972],"category_scores_gemma":[0.0023243786,0.00041941117,0.0002942468,0.0009380821,0.0008365202,0.0013274597,0.0009252121,0.0004971521,0.0011989332],"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.00056199223,0.00036341776,0.02249421,0.00040446097,0.00012769664,0.0009875564,0.0002878627,0.55946004,0.032036833,0.2954223,0.017907226,0.069946416],"study_design_scores_gemma":[0.000016001786,0.00008569776,0.014762782,0.000046388184,0.000023913844,0.0005320707,0.00027248746,0.93777263,0.010412239,0.030786918,0.0052409377,0.000047854996],"about_ca_topic_score_codex":0.0025795663,"about_ca_topic_score_gemma":0.0023203958,"teacher_disagreement_score":0.013365972,"about_ca_system_score_codex":0.0006927143,"about_ca_system_score_gemma":0.0004553606,"threshold_uncertainty_score":0.044713676},"labels":[],"label_agreement":null},{"id":"W2115900859","doi":"10.1007/s00454-008-9096-4","title":"A Continuous d-Step Conjecture for Polytopes","year":2008,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Polytope; Mathematics; Combinatorics; Conjecture; Curvature; Path (computing); Dimension (graph theory); Order (exchange); Polytope model; Geometry; Computer science","score_opus":0.03949021774810775,"score_gpt":0.3228103529865319,"score_spread":0.28332013523842414,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2115900859","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44577438,0.00207859,0.21694383,0.026785884,0.0019540333,0.0001323691,0.002631339,0.0009521085,0.3027475],"genre_scores_gemma":[0.92886627,0.0011350972,0.026548441,0.003419365,0.0008845152,0.00014589902,0.0023685123,0.00027551252,0.03635638],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987109,0.00019630897,0.00006109148,0.0004465682,0.00032340025,0.00026179836],"domain_scores_gemma":[0.9931554,0.00414363,0.00032104235,0.0010069256,0.00052836724,0.00084457966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013139035,0.000990555,0.0014994986,0.0015897502,0.002719997,0.005198827,0.0027764246,0.002894439,0.022192976],"category_scores_gemma":[0.007895005,0.0009973244,0.0018471797,0.0018541418,0.005541668,0.010837137,0.006221277,0.010474101,0.0026086422],"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.000108168635,0.00006594274,0.0007789322,0.000121384,0.000013935651,0.0001163341,0.00020824971,0.0015614795,0.000557773,0.98356426,0.00742964,0.005474004],"study_design_scores_gemma":[0.000047717727,0.00002814071,0.00043866603,0.000028556642,0.000011364672,0.00011322897,0.00014557812,0.005957142,0.00042800725,0.98807377,0.004710995,0.000016816057],"about_ca_topic_score_codex":0.0014611343,"about_ca_topic_score_gemma":0.0011642289,"teacher_disagreement_score":0.022192976,"about_ca_system_score_codex":0.0015209023,"about_ca_system_score_gemma":0.00080439553,"threshold_uncertainty_score":0.07424295},"labels":[],"label_agreement":null},{"id":"W2116738999","doi":"10.1007/s00454-012-9480-y","title":"Rigid Ball-Polyhedra in Euclidean $$3$$ -Space","year":2012,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Mathematics and Applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada; Hungarian Scientific Research Fund","keywords":"Dihedral angle; Vertex (graph theory); Euclidean geometry; Rigidity (electromagnetism); Lattice (music); Intersection (aeronautics); Simple (philosophy)","score_opus":0.045029292082047846,"score_gpt":0.35142151595591875,"score_spread":0.3063922238738709,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116738999","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2162945,0.0015920891,0.6138247,0.0023634532,0.0009824341,0.00023352499,0.0021822543,0.0005446946,0.16198233],"genre_scores_gemma":[0.78066015,0.0013057004,0.13956498,0.0007499888,0.0003641615,0.00031413828,0.0018358463,0.00048657472,0.074718386],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991315,0.00017175944,0.000059302514,0.00014647323,0.00036958783,0.00012133057],"domain_scores_gemma":[0.9994722,0.00012527655,0.00010604598,0.00006208153,0.00011316141,0.000121178564],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041485048,0.0010696893,0.001102587,0.0018804882,0.002059018,0.003518012,0.0021912542,0.0014616728,0.014462431],"category_scores_gemma":[0.0014548309,0.0005853834,0.00081557577,0.0019724437,0.0034881847,0.002322622,0.0031526408,0.0024462081,0.003102247],"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.00003609993,0.000013967198,0.0000706497,0.00003374112,0.000006207496,0.000048656955,0.00011239696,0.0065329424,0.0005639229,0.9836235,0.0017598493,0.007197959],"study_design_scores_gemma":[0.000018215793,0.000030216113,0.0001885374,0.000016278125,0.0000042488655,0.00011452343,0.00015708603,0.020380149,0.00052372925,0.967986,0.01055843,0.000022747343],"about_ca_topic_score_codex":0.00499353,"about_ca_topic_score_gemma":0.0040200013,"teacher_disagreement_score":0.014462431,"about_ca_system_score_codex":0.0011955502,"about_ca_system_score_gemma":0.0007376092,"threshold_uncertainty_score":0.048381686},"labels":[],"label_agreement":null},{"id":"W2136910207","doi":"10.1007/s00454-006-1232-4","title":"Distinct Distances in Homogeneous Sets in Euclidean Space","year":2006,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Hungarian Scientific Research Fund","keywords":"Homogeneous; Omega; Combinatorics; Euclidean space; Space (punctuation); Mathematics; Constant (computer programming); Set (abstract data type); Euclidean geometry; Euclidean distance; Point (geometry); Physics; Geometry; Computer science","score_opus":0.0077357791002921105,"score_gpt":0.24469735313444796,"score_spread":0.23696157403415585,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136910207","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24758974,0.0007728343,0.7319244,0.0007665415,0.0002133806,0.000089674155,0.00052503956,0.00017179329,0.017946547],"genre_scores_gemma":[0.7656232,0.0007481168,0.21400517,0.00023729741,0.00026192085,0.0002110132,0.00093675,0.0002106748,0.017765863],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99806553,0.00048067857,0.0001512117,0.00043102299,0.00072527234,0.00014624721],"domain_scores_gemma":[0.99358034,0.0035351557,0.000718603,0.00055947946,0.0009541817,0.00065220665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016074321,0.00063082995,0.0011765385,0.004025748,0.0014637518,0.00345585,0.0028241244,0.0012977534,0.003766872],"category_scores_gemma":[0.010102115,0.00081375655,0.0008479636,0.0028842129,0.003968195,0.005439172,0.004152263,0.0032061797,0.0007650112],"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.000066125656,0.000022758355,0.00041541728,0.00006026721,0.000012926203,0.00007279978,0.00029913566,0.006360905,0.000957361,0.98090357,0.0007203232,0.01010834],"study_design_scores_gemma":[0.000018714414,0.000035851288,0.0005017313,0.000020568841,0.000013009675,0.00014542624,0.00022948466,0.040943954,0.0010036966,0.95450217,0.0025659786,0.000019457368],"about_ca_topic_score_codex":0.0010224992,"about_ca_topic_score_gemma":0.0009786852,"teacher_disagreement_score":0.004025748,"about_ca_system_score_codex":0.0015746325,"about_ca_system_score_gemma":0.00046325295,"threshold_uncertainty_score":0.012601435},"labels":[],"label_agreement":null},{"id":"W2139332235","doi":"10.1007/s00454-011-9352-x","title":"Improved Approximation for Guarding Simple Galleries from the Perimeter","year":2011,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":46,"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; McGill University","funders":"","keywords":"Combinatorics; Mathematics; Perimeter; Approximation algorithm; Polygon (computer graphics); Simple polygon; Binary logarithm; Guard (computer science); Time complexity; Dimension (graph theory); Simple (philosophy); Discrete mathematics; Algorithm; Regular polygon; Geometry; Computer science","score_opus":0.04409133552517794,"score_gpt":0.2635143971703761,"score_spread":0.21942306164519818,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139332235","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20021945,0.00076572684,0.7705725,0.0007084017,0.00025998286,0.00023100013,0.00069744757,0.0028914725,0.02365389],"genre_scores_gemma":[0.5953966,0.0006052858,0.388674,0.00022580486,0.0001296776,0.00019502702,0.0016222592,0.00065513357,0.012496252],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999014,0.000197086,0.000050723247,0.00017650408,0.00036998058,0.00019160727],"domain_scores_gemma":[0.996682,0.0016539013,0.00019761965,0.0010509343,0.00019292107,0.00022259145],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092827744,0.0014652349,0.0026635902,0.001327052,0.0007357004,0.0022113675,0.0027274184,0.0018936791,0.011001517],"category_scores_gemma":[0.007009465,0.0008198966,0.0017361781,0.0017971882,0.001527546,0.0041722353,0.0054019354,0.0029917066,0.002237027],"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.0014360471,0.0004314761,0.00227731,0.00059500476,0.0001490934,0.00045387802,0.00059678487,0.48083836,0.010987504,0.20168346,0.023038048,0.2775131],"study_design_scores_gemma":[0.00007821384,0.00011354798,0.00024003949,0.000038177062,0.000029519435,0.00012807272,0.00007611983,0.86363244,0.0019126745,0.13101397,0.002719147,0.00001807946],"about_ca_topic_score_codex":0.0023750744,"about_ca_topic_score_gemma":0.002641566,"teacher_disagreement_score":0.011001517,"about_ca_system_score_codex":0.0011703828,"about_ca_system_score_gemma":0.0010074999,"threshold_uncertainty_score":0.036803782},"labels":[],"label_agreement":null},{"id":"W2141148003","doi":"10.1007/s00454-001-0052-9","title":"Lattice Polytopes with Distinct Pair-Sums","year":2002,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":7,"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":"Polytope; Combinatorics; Mathematics; Lattice (music); Physics","score_opus":0.04015428670726018,"score_gpt":0.2922861093654003,"score_spread":0.2521318226581401,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141148003","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2819784,0.001033891,0.2430226,0.0032068507,0.0014579241,0.00026532746,0.001884529,0.0008343587,0.46631604],"genre_scores_gemma":[0.78205806,0.00093684916,0.098118305,0.0010780954,0.0005346873,0.00048161045,0.0019199473,0.0005311085,0.114341274],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99821234,0.0004042952,0.00010287444,0.0003168813,0.0005995125,0.0003640217],"domain_scores_gemma":[0.9984676,0.0005292461,0.00017442217,0.0002169885,0.0001834502,0.00042826642],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007354554,0.0013459828,0.001621976,0.0023187888,0.0040903436,0.007066204,0.0020204536,0.0016917074,0.025302019],"category_scores_gemma":[0.0024516748,0.0012981156,0.0012633151,0.0024656525,0.0036589894,0.0052344427,0.0043551684,0.0060400395,0.0051351287],"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.00005905694,0.000038803726,0.00007747904,0.000035398378,0.000010353302,0.00008618521,0.00006788395,0.00091122964,0.00053502567,0.99186194,0.0024416454,0.0038750889],"study_design_scores_gemma":[0.000047239642,0.000019826866,0.000092627546,0.000017988086,0.000012355948,0.00025208475,0.00012426834,0.0034132448,0.0008198384,0.9879534,0.007223789,0.000023418996],"about_ca_topic_score_codex":0.00058858184,"about_ca_topic_score_gemma":0.0010519811,"teacher_disagreement_score":0.025302019,"about_ca_system_score_codex":0.0013240518,"about_ca_system_score_gemma":0.0008030862,"threshold_uncertainty_score":0.08464372},"labels":[],"label_agreement":null},{"id":"W2144337080","doi":"10.1007/s00454-012-9420-x","title":"An Incidence Theorem in Higher Dimensions","year":2012,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":120,"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":"Isaac Newton Institute for Mathematical Sciences","keywords":"Mathematics; Combinatorics; Bounded function; Dimension (graph theory); Polynomial; Degree (music); Incidence (geometry); Discrete mathematics; Mathematical analysis; Geometry","score_opus":0.024675720790977365,"score_gpt":0.2908872514977361,"score_spread":0.26621153070675874,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144337080","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05830489,0.002387879,0.7380784,0.0035015913,0.0017961903,0.00006185411,0.00038263857,0.00039089643,0.19509561],"genre_scores_gemma":[0.75557214,0.0047236877,0.13210939,0.0015750814,0.0031246094,0.00022020056,0.0008160244,0.00084170216,0.1010172],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99897456,0.00021052524,0.000060835428,0.00017182437,0.0004284432,0.00015382419],"domain_scores_gemma":[0.9976476,0.0011675119,0.00021340906,0.0003138966,0.00044187345,0.0002157711],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014289839,0.0008636062,0.00092460046,0.0025857931,0.0017919955,0.0035358495,0.0017117001,0.0012625415,0.012817033],"category_scores_gemma":[0.0058317804,0.000660693,0.0015327368,0.0018413565,0.003128448,0.0075020907,0.0038386781,0.005347594,0.0020363166],"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.000007123166,0.000009398348,0.00011865764,0.000020425201,0.0000032642631,0.000021663884,0.00006074123,0.00062604534,0.0002302231,0.9939202,0.0013815376,0.0036007322],"study_design_scores_gemma":[0.000007469557,0.000009138653,0.0001575341,0.00001440347,0.00000627076,0.00007851015,0.000035845707,0.009465591,0.0003520427,0.98407346,0.005791232,0.000008586543],"about_ca_topic_score_codex":0.001599775,"about_ca_topic_score_gemma":0.0010201092,"teacher_disagreement_score":0.012817033,"about_ca_system_score_codex":0.0013190259,"about_ca_system_score_gemma":0.00072535337,"threshold_uncertainty_score":0.042877197},"labels":[],"label_agreement":null},{"id":"W2146448055","doi":"10.1007/s00454-003-2853-5","title":"Spanning Trees Crossing Few Barriers","year":2003,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of British Columbia; National Science Foundation","keywords":"Spanning tree; Combinatorics; Disjoint sets; Mathematics; Multiplicative function; Minimum spanning tree; Tree (set theory); Shortest-path tree; Minimum degree spanning tree; Line segment; Regular polygon; Plane (geometry); Line (geometry); Discrete mathematics; Geometry","score_opus":0.013820528404470164,"score_gpt":0.26648596864009155,"score_spread":0.2526654402356214,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2146448055","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38266027,0.0013020667,0.5607984,0.0013986571,0.00030325982,0.00014770756,0.0005430995,0.0008487541,0.051997725],"genre_scores_gemma":[0.83419514,0.00083870714,0.13168728,0.00039772704,0.00011324091,0.00019371102,0.00093769154,0.0004296271,0.031206876],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999551,0.000090840265,0.000025485104,0.00011003682,0.0001099466,0.00011257549],"domain_scores_gemma":[0.9975926,0.0011680274,0.0002321479,0.00039943444,0.00023637874,0.00037129514],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037867978,0.00043326273,0.0008897404,0.00094006566,0.0012543441,0.0014221531,0.0012352067,0.0018040995,0.009854568],"category_scores_gemma":[0.005400257,0.0005583186,0.00051270804,0.0009265473,0.00070479314,0.0023834216,0.0025278665,0.0020737585,0.0016316848],"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.0004349608,0.00020564598,0.0013082591,0.00040930638,0.000089451256,0.00073546957,0.0006270509,0.082504064,0.021638887,0.79438984,0.013026083,0.084631026],"study_design_scores_gemma":[0.0000686058,0.00011946752,0.00083894335,0.00007058661,0.000047659323,0.000790766,0.0002870798,0.2327512,0.0043576886,0.74752825,0.013111785,0.000027855724],"about_ca_topic_score_codex":0.00048081393,"about_ca_topic_score_gemma":0.000787254,"teacher_disagreement_score":0.009854568,"about_ca_system_score_codex":0.00043755377,"about_ca_system_score_gemma":0.0004435236,"threshold_uncertainty_score":0.032966793},"labels":[],"label_agreement":null},{"id":"W2148091059","doi":"10.1007/s00454-004-1139-x","title":"Non-Crossing Frameworks with Non-Crossing Reciprocals","year":2004,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Structural Analysis and Optimization","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"Natural Sciences and Engineering Research Council of Canada; Deutsche Forschungsgemeinschaft; Ministerio de Ciencia y Tecnología; McGill University; National Institutes of Health; National Science Foundation","keywords":"Reciprocal; Embedding; Planar; Graph; Planar graph; Planar straight-line graph; Sign (mathematics)","score_opus":0.005139027119167768,"score_gpt":0.22868772445822788,"score_spread":0.2235486973390601,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148091059","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23078102,0.001785993,0.44647557,0.0023020967,0.0010145961,0.00016552205,0.00052331627,0.0010172769,0.3159347],"genre_scores_gemma":[0.88859576,0.00081732514,0.0755557,0.00049925165,0.00028657258,0.00020245249,0.00035698287,0.00046005193,0.033225983],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99871886,0.00036815673,0.000051185765,0.00024037888,0.0003838863,0.00023761191],"domain_scores_gemma":[0.9988433,0.0002949272,0.00013398899,0.000312474,0.00017989535,0.00023539159],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013712803,0.001036146,0.001371347,0.0023926334,0.002537167,0.0034325616,0.0020236685,0.002192005,0.019372292],"category_scores_gemma":[0.0033906081,0.0005655691,0.0010489373,0.0014750038,0.0030415228,0.0046457294,0.0029464683,0.0029504143,0.0018465222],"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.000007038789,0.0000080956415,0.000015908938,0.000010486255,0.0000025423417,0.000017159931,0.000018563707,0.001192915,0.00014255356,0.99645424,0.00048775502,0.0016428242],"study_design_scores_gemma":[0.000009310346,0.000012553773,0.000033555963,0.000007795125,0.0000043780356,0.0000754709,0.00003077665,0.009412126,0.00015426309,0.9872651,0.0029851724,0.0000095138075],"about_ca_topic_score_codex":0.00071256317,"about_ca_topic_score_gemma":0.0010366357,"teacher_disagreement_score":0.019372292,"about_ca_system_score_codex":0.00088615017,"about_ca_system_score_gemma":0.0007545102,"threshold_uncertainty_score":0.06480676},"labels":[],"label_agreement":null},{"id":"W2152546987","doi":"10.1007/s00454-009-9206-y","title":"Simplices and Spectra of Graphs","year":2009,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Univerza v Ljubljani; Javna Agencija za Raziskovalno Dejavnost RS; American Institute of Mathematics; National Science Foundation","keywords":"Mathematics; Simplex; Codimension; Combinatorics; Dimension (graph theory); Computation; Eigenvalues and eigenvectors; Enhanced Data Rates for GSM Evolution; Pure mathematics; Computer science","score_opus":0.009929335787763083,"score_gpt":0.2566403824881218,"score_spread":0.24671104670035873,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152546987","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4991832,0.006500202,0.4068556,0.0046948977,0.00040737688,0.000105161314,0.00094643293,0.00051085814,0.08079632],"genre_scores_gemma":[0.9508179,0.0018146553,0.038147278,0.00021831245,0.00024861406,0.000050810042,0.00038633664,0.0000970969,0.008218999],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988512,0.00034677927,0.00006900486,0.00025531862,0.00035655484,0.000121104764],"domain_scores_gemma":[0.99578756,0.0022466893,0.0005059129,0.0004207875,0.00043993385,0.00059915055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010959943,0.0005466221,0.0008973629,0.004718065,0.0019185815,0.0056272014,0.0010383659,0.0012104558,0.006193624],"category_scores_gemma":[0.0068926434,0.0006421657,0.0007301209,0.0023137487,0.004950104,0.0069160764,0.003157132,0.0017706217,0.0007734022],"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.0000154207,0.000011106553,0.00026038347,0.000020956375,0.0000054359007,0.00003887797,0.0003812342,0.00075523223,0.00040847037,0.9937065,0.00044336586,0.0039530676],"study_design_scores_gemma":[0.0000029435362,0.000002881902,0.00013736081,0.000008884524,0.0000026436617,0.00005376875,0.0001661657,0.00304261,0.000101171914,0.99489576,0.0015812409,0.0000045599727],"about_ca_topic_score_codex":0.0016349077,"about_ca_topic_score_gemma":0.0011735215,"teacher_disagreement_score":0.006193624,"about_ca_system_score_codex":0.0011304688,"about_ca_system_score_gemma":0.0005305442,"threshold_uncertainty_score":0.020719767},"labels":[],"label_agreement":null},{"id":"W2155549190","doi":"10.1007/s00454-011-9369-1","title":"Illuminating Spindle Convex Bodies and Minimizing the Volume of Spherical Sets of Constant Width","year":2011,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Point processes and geometric inequalities","field":"Mathematics","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Convex body; Intersection (aeronautics); Regular polygon; Convex set; Constant (computer programming); Orthogonal convex hull; Mixed volume; Convex polytope; Convex analysis","score_opus":0.06858455116316184,"score_gpt":0.30594406730316415,"score_spread":0.2373595161400023,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155549190","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18290006,0.00044850423,0.8012411,0.00027065826,0.000051067902,0.000046596848,0.00011474533,0.00014385619,0.014783501],"genre_scores_gemma":[0.8743745,0.000761877,0.11358376,0.000109254586,0.00009582667,0.00012132656,0.00030898172,0.00039501712,0.010249468],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996131,0.00011854881,0.00001326129,0.000060209935,0.00013519113,0.00005971808],"domain_scores_gemma":[0.9988117,0.0007464693,0.00014086964,0.00008746269,0.00011894949,0.00009456522],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007127353,0.0009886138,0.0011059316,0.000809514,0.00033754102,0.0017749893,0.0014203036,0.0012091139,0.0024050816],"category_scores_gemma":[0.005023397,0.00083507475,0.0007754165,0.00071951933,0.0014409944,0.0016873747,0.0021058687,0.0011372019,0.00037732645],"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.0004567756,0.000060349346,0.0009024454,0.00028104652,0.00005588513,0.00016365793,0.0005977259,0.62270105,0.022463882,0.2999551,0.002192749,0.05016941],"study_design_scores_gemma":[0.000033409637,0.000109271976,0.00064411137,0.000034317123,0.000016399747,0.00011204352,0.00021108412,0.8727907,0.004913735,0.11901897,0.0020860482,0.000029889998],"about_ca_topic_score_codex":0.0017994933,"about_ca_topic_score_gemma":0.0014900245,"teacher_disagreement_score":0.0024050816,"about_ca_system_score_codex":0.0009428747,"about_ca_system_score_gemma":0.00038990093,"threshold_uncertainty_score":0.008045793},"labels":[],"label_agreement":null},{"id":"W2170193516","doi":"10.1007/s00454-012-9405-9","title":"Contact Numbers for Congruent Sphere Packings in Euclidean 3-Space","year":2012,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Point processes and geometric inequalities","field":"Mathematics","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Unit sphere; Mathematics; Euclidean geometry; Lattice (music); Euclidean space; Circle packing; Unit (ring theory); Graph; Sphere packing; Space (punctuation); Geometry; Computer science; Physics","score_opus":0.052373488718579615,"score_gpt":0.3546704835279267,"score_spread":0.3022969948093471,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170193516","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5828819,0.0012523385,0.2959568,0.0014842316,0.00041954126,0.0001516591,0.0004718325,0.00029663352,0.117084965],"genre_scores_gemma":[0.9625531,0.00054009,0.026656797,0.00016232171,0.00024604323,0.00015385717,0.0003820238,0.0001285395,0.0091772145],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99845433,0.00031995962,0.000108490894,0.00020177486,0.00062304793,0.00029242635],"domain_scores_gemma":[0.99175924,0.005349506,0.0009361366,0.00039766097,0.0005352826,0.0010221695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019235737,0.00089346303,0.001259597,0.0057197856,0.0028192915,0.005993846,0.0023208912,0.0023310336,0.015710063],"category_scores_gemma":[0.012911153,0.0005157834,0.0007692578,0.0032384682,0.005701597,0.008032124,0.003739113,0.0032352956,0.001181888],"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.000055535285,0.000021672215,0.00027037345,0.000025350582,0.000003175722,0.00004718656,0.00019719353,0.003042977,0.00038032114,0.9919205,0.00066446344,0.003371323],"study_design_scores_gemma":[0.00001688244,0.000030813793,0.0005449316,0.000021929476,0.000006639477,0.00010462766,0.00022619455,0.04045288,0.00088073657,0.956193,0.0015012956,0.00002009261],"about_ca_topic_score_codex":0.0012135735,"about_ca_topic_score_gemma":0.0012026437,"teacher_disagreement_score":0.015710063,"about_ca_system_score_codex":0.0019787767,"about_ca_system_score_gemma":0.0006937509,"threshold_uncertainty_score":0.052555382},"labels":[],"label_agreement":null},{"id":"W2170867015","doi":"10.1007/s004540010083","title":"Lattice substitution systems and model sets","year":2001,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Mathematical Dynamics and Fractals","field":"Mathematics","cited_by":54,"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 Alberta","funders":"","keywords":"Mathematics; Lattice (music); Combinatorics; Substitution (logic); Partition (number theory); Discrete mathematics; Computer science; Physics","score_opus":0.04483498335996422,"score_gpt":0.32336718582552587,"score_spread":0.27853220246556165,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170867015","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26152965,0.012642603,0.41331646,0.019185772,0.0012476831,0.000130531,0.0006865861,0.0005567243,0.2907041],"genre_scores_gemma":[0.9422132,0.0030595728,0.031825457,0.0006355594,0.0005281091,0.00020285742,0.00030989022,0.00009994429,0.021125354],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99917716,0.00039230092,0.00003472951,0.00009901502,0.00020460255,0.00009204042],"domain_scores_gemma":[0.99809414,0.0011669907,0.00017129008,0.0002616554,0.00018189101,0.00012399607],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012126196,0.00065881264,0.0011981678,0.0015958888,0.0019019879,0.0046451013,0.0011452711,0.0023839218,0.009208974],"category_scores_gemma":[0.0043956866,0.0005133641,0.00069801544,0.0018070524,0.0052774,0.005374959,0.0017663917,0.0025511745,0.0008335913],"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.0000019809866,0.0000021834642,0.000011404935,0.0000045519805,8.711135e-7,0.000005386159,0.000023010014,0.000849794,0.000022573955,0.9985073,0.00026188657,0.0003090938],"study_design_scores_gemma":[0.0000031106952,0.0000012260888,0.000007596956,0.0000019969773,6.844352e-7,0.000009121418,0.000013819703,0.003445376,0.000015921407,0.99560165,0.0008980774,0.0000015457132],"about_ca_topic_score_codex":0.0014566268,"about_ca_topic_score_gemma":0.001088698,"teacher_disagreement_score":0.009208974,"about_ca_system_score_codex":0.0019313194,"about_ca_system_score_gemma":0.0009791953,"threshold_uncertainty_score":0.030807078},"labels":[],"label_agreement":null},{"id":"W2171698682","doi":"10.1007/s00454-010-9291-y","title":"More Colourful Simplices","year":2010,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs; Canada Research Chairs","keywords":"Combinatorics; General position; Mathematics; Vertex (graph theory); Convex hull; Regular polygon; Simplex; Position (finance); Point (geometry); Set (abstract data type); Geometry; Graph; Computer science","score_opus":0.007892612822278692,"score_gpt":0.269471527868626,"score_spread":0.2615789150463473,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2171698682","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08330027,0.00084056123,0.7743954,0.0026590156,0.0018928065,0.00011941589,0.0006315576,0.002293286,0.13386765],"genre_scores_gemma":[0.52019584,0.00082239526,0.36104155,0.0023123096,0.00045106062,0.0001269652,0.0011903057,0.002212284,0.11164729],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991316,0.00016400752,0.000042576743,0.00020894386,0.0003380392,0.00011489179],"domain_scores_gemma":[0.9978866,0.00045877762,0.00006560227,0.0010988067,0.00027441446,0.00021586746],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007589061,0.0008179593,0.0011270714,0.0012328217,0.00097609975,0.003426888,0.0013759434,0.0019599071,0.05335366],"category_scores_gemma":[0.0036513973,0.0007499597,0.0013321204,0.0009877293,0.0019398966,0.0051064664,0.003240499,0.0032373723,0.0061034253],"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.00021317664,0.00013271185,0.0004240037,0.00021154633,0.000039961644,0.0002075542,0.00032293776,0.020792522,0.02219505,0.87595147,0.012998416,0.06651062],"study_design_scores_gemma":[0.000051998413,0.0000643228,0.00036197295,0.00005982926,0.000033587592,0.0003490471,0.00014724898,0.07007134,0.007858621,0.8630605,0.057891827,0.000049621256],"about_ca_topic_score_codex":0.0008071612,"about_ca_topic_score_gemma":0.0017682044,"teacher_disagreement_score":0.05335366,"about_ca_system_score_codex":0.000735759,"about_ca_system_score_gemma":0.00032123222,"threshold_uncertainty_score":0.17848581},"labels":[],"label_agreement":null},{"id":"W2174692193","doi":"10.1007/s00454-013-9559-0","title":"Colourful and Fractional (p,q)-theorems","year":2013,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":17,"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":"National Institutes of Health; Magyar Tudományos Akadémia","keywords":"Combinatorics; Mathematics; Element (criminal law); Zero (linguistics); Class (philosophy); Idempotence; Regular polygon; Fraction (chemistry); Discrete mathematics; Geometry","score_opus":0.015857367499309744,"score_gpt":0.28325509917332425,"score_spread":0.2673977316740145,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2174692193","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34587717,0.0033339616,0.35518116,0.010650699,0.0010829008,0.00007762441,0.00063635386,0.00071729394,0.28244287],"genre_scores_gemma":[0.94123805,0.00089247245,0.033954874,0.001194947,0.0005395122,0.000098588585,0.00016731281,0.00015521821,0.021758968],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989316,0.00032305863,0.000051433235,0.00023444809,0.00025282401,0.00020661183],"domain_scores_gemma":[0.9957273,0.0027114465,0.00026451828,0.0005168689,0.00036524553,0.00041471934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002142878,0.00083009887,0.00097227056,0.0028097003,0.003966537,0.0040497812,0.0016301699,0.0021768122,0.0076475525],"category_scores_gemma":[0.007507795,0.0006290606,0.0015309025,0.0023383019,0.00760325,0.010402373,0.0037120767,0.0046916474,0.0006438813],"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.000012235988,0.0000047866624,0.000043566415,0.000008367592,0.0000014965698,0.00001957337,0.000068102665,0.00017133649,0.00009761342,0.99842924,0.00034334455,0.00080044795],"study_design_scores_gemma":[0.0000057895527,0.0000021458764,0.000033729208,0.0000026312923,0.0000029135226,0.000028111104,0.000015173194,0.0007240939,0.00010256964,0.9983758,0.00070394244,0.0000030807844],"about_ca_topic_score_codex":0.0024257218,"about_ca_topic_score_gemma":0.0017658864,"teacher_disagreement_score":0.0076475525,"about_ca_system_score_codex":0.0025537761,"about_ca_system_score_gemma":0.0009609131,"threshold_uncertainty_score":0.025583565},"labels":[],"label_agreement":null},{"id":"W2202861778","doi":"10.1007/s00454-016-9760-z","title":"Packing Convex Bodies by Cylinders","year":2016,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Point processes and geometric inequalities","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta; University of Calgary","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Regular polygon; Relation (database); Upper and lower bounds; Convex body; Convex geometry","score_opus":0.040594108517168374,"score_gpt":0.3194086962686885,"score_spread":0.2788145877515201,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2202861778","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17228076,0.0012592897,0.7621615,0.0010589038,0.00042646378,0.00012515517,0.0004687028,0.0004961136,0.061723083],"genre_scores_gemma":[0.79319185,0.0017102154,0.14986272,0.0006356487,0.00043641942,0.00021321129,0.0012932442,0.0006517052,0.05200511],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99820626,0.00035311468,0.00012517517,0.00032138824,0.00067257445,0.00032153053],"domain_scores_gemma":[0.9971342,0.0014973553,0.00039675186,0.00040328084,0.00026719653,0.00030117447],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007802533,0.0010601191,0.0022137794,0.0025004072,0.0015511697,0.00398738,0.0020511923,0.0026050368,0.0119636],"category_scores_gemma":[0.006146344,0.0016001025,0.0017012852,0.0023255886,0.0032563505,0.0053685694,0.0052844137,0.0036205207,0.0020457483],"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.00016218895,0.000053740907,0.00042732077,0.00013025278,0.000033968652,0.00024458295,0.00031506913,0.069718085,0.0030067863,0.89281523,0.004252069,0.028840752],"study_design_scores_gemma":[0.000030009809,0.00007572823,0.0004775407,0.00005728529,0.000018006873,0.0002012101,0.00020736884,0.274659,0.002309051,0.71575844,0.006179188,0.000027160595],"about_ca_topic_score_codex":0.0032396629,"about_ca_topic_score_gemma":0.0020187881,"teacher_disagreement_score":0.0119636,"about_ca_system_score_codex":0.001402091,"about_ca_system_score_gemma":0.0006123617,"threshold_uncertainty_score":0.040022254},"labels":[],"label_agreement":null},{"id":"W2207114119","doi":"10.1007/s00454-016-9833-z","title":"Curves in $$\\mathbb {R}^4$$ and Two-Rich Points","year":2016,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Algebraic Geometry and Number Theory","field":"Mathematics","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 British Columbia","funders":"Simons Foundation; National Science Foundation","keywords":"Hypersurface; Degree (music); Family of curves; Algebraic curve; Algebraic number; Plane curve; Differential geometry of curves","score_opus":0.02212339162016196,"score_gpt":0.30526312678699746,"score_spread":0.2831397351668355,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2207114119","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38476074,0.0016984142,0.12904093,0.008689936,0.0009648678,0.00013771851,0.0010161062,0.0010433688,0.47264785],"genre_scores_gemma":[0.8786474,0.0008637222,0.026533665,0.00074321154,0.00040315217,0.00012339496,0.0006083751,0.00050200475,0.09157509],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999315,0.00014228154,0.000027776552,0.00013370957,0.00020647717,0.00017483995],"domain_scores_gemma":[0.9990852,0.0003200946,0.00012244652,0.000101594254,0.00016654252,0.00020421976],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006339309,0.0012584656,0.0010735829,0.0038486393,0.003699364,0.0049730847,0.0013344352,0.0015822531,0.016749658],"category_scores_gemma":[0.0024168761,0.0005546001,0.00083788036,0.00279483,0.0053121345,0.0064975587,0.0044442657,0.004099232,0.0026635956],"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.000033465745,0.000007330621,0.000044105116,0.0000129816535,0.0000035618714,0.0000469699,0.00009699588,0.0002439076,0.00020587635,0.9965706,0.0009582343,0.001776046],"study_design_scores_gemma":[0.000024432788,0.000010287386,0.00014504892,0.000015404334,0.0000073098017,0.00009894534,0.0001409932,0.0010602406,0.00051487435,0.99022955,0.007740075,0.000012900887],"about_ca_topic_score_codex":0.0017998017,"about_ca_topic_score_gemma":0.0012497659,"teacher_disagreement_score":0.016749658,"about_ca_system_score_codex":0.0019735517,"about_ca_system_score_gemma":0.00057070696,"threshold_uncertainty_score":0.056033134},"labels":[],"label_agreement":null},{"id":"W2216780118","doi":"10.1007/s00454-017-9899-2","title":"Universal Completability, Least Eigenvalue Frameworks, and Vector Colorings","year":2017,"lang":"en","type":"preprint","venue":"Discrete & Computational Geometry","topic":"Graph theory and applications","field":"Mathematics","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":"Engineering and Physical Sciences Research Council; National Research Foundation Singapore; Grantová Agentura České Republiky; Ministerstvo Školství, Mládeže a Tělovýchovy; National Research Foundation","keywords":"Eigenvalues and eigenvectors; Combinatorics; Mathematics; Adjacency matrix; Embedding; Discrete mathematics; Positive-definite matrix; Graph; Computer science","score_opus":0.050012090198601866,"score_gpt":0.3387573476827348,"score_spread":0.28874525748413293,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2216780118","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5885562,0.00057687826,0.3913024,0.00058315805,0.000048789938,0.000054265533,0.00052962796,0.0011092093,0.017239464],"genre_scores_gemma":[0.95974785,0.00015893951,0.0371753,0.00007585802,0.000027813747,0.000045106743,0.00040174724,0.00011138003,0.0022559224],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988882,0.00022365613,0.0000378325,0.0003064986,0.00017834941,0.0003654101],"domain_scores_gemma":[0.99806076,0.0007609092,0.00036510077,0.00032597873,0.00022559761,0.00026165764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007881517,0.0005960311,0.00039985526,0.001364809,0.001433217,0.0014806752,0.0009840966,0.00062445214,0.004382811],"category_scores_gemma":[0.0030667942,0.00039552822,0.00086314185,0.0012910849,0.0024887945,0.0028625233,0.0014435359,0.0014186206,0.00032463664],"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.000082622784,0.00005563004,0.0017047095,0.00006865993,0.000024399782,0.00014484358,0.0003605729,0.0350577,0.0045791147,0.9407014,0.0017896033,0.015430619],"study_design_scores_gemma":[0.000016209293,0.000062489264,0.0014708602,0.00002705673,0.000019431165,0.00023193347,0.00035174293,0.091572285,0.0038558377,0.89848304,0.0038479252,0.00006121304],"about_ca_topic_score_codex":0.004185542,"about_ca_topic_score_gemma":0.006138712,"teacher_disagreement_score":0.004382811,"about_ca_system_score_codex":0.0014840722,"about_ca_system_score_gemma":0.00079242245,"threshold_uncertainty_score":0.014661968},"labels":[],"label_agreement":null},{"id":"W2253735142","doi":"10.1007/s00454-015-9737-3","title":"How to Walk Your Dog in the Mountains with No Magic Leash","year":2015,"lang":"en","type":"article","venue":"Discrete & 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 Alberta","funders":"Directorate for Computer and Information Science and Engineering","keywords":"Mathematics; Homotopy; Euclidean geometry; Combinatorics; MAGIC (telescope); Boundary (topology); Approximation algorithm; Geometry; Pure mathematics; Mathematical analysis","score_opus":0.029618555784002163,"score_gpt":0.2758049609016351,"score_spread":0.24618640511763293,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2253735142","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019862823,0.0030252852,0.6225678,0.042744096,0.010141074,0.00044272275,0.0010366974,0.008288226,0.29189125],"genre_scores_gemma":[0.16379897,0.0029133004,0.48819655,0.008866388,0.0006700102,0.0003012925,0.0010875148,0.0035260369,0.33063993],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997181,0.0000669546,0.000011745225,0.00005084426,0.00010964371,0.00004259199],"domain_scores_gemma":[0.9995277,0.00006486284,0.000015693904,0.00010446935,0.0001497892,0.00013746781],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004786548,0.00066911575,0.00040895358,0.00040883585,0.0019651235,0.002498222,0.0011118926,0.0019009499,0.06261593],"category_scores_gemma":[0.00270247,0.0003536132,0.00049017265,0.00034326973,0.0011920865,0.0037635826,0.0017404774,0.0019949204,0.028925925],"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.00020786912,0.00013080257,0.0011479935,0.0003286266,0.000049141232,0.00043343357,0.0014164564,0.0050774957,0.005866943,0.06095115,0.5169089,0.40748116],"study_design_scores_gemma":[0.00008543899,0.00013329717,0.00061584107,0.00037316117,0.000038021186,0.0009426246,0.003285491,0.012944209,0.0032773155,0.111057274,0.8671448,0.00010250312],"about_ca_topic_score_codex":0.0023931148,"about_ca_topic_score_gemma":0.007003875,"teacher_disagreement_score":0.06261593,"about_ca_system_score_codex":0.0003204568,"about_ca_system_score_gemma":0.0007919529,"threshold_uncertainty_score":0.20947117},"labels":[],"label_agreement":null},{"id":"W2254647820","doi":"10.1007/s00454-015-9752-4","title":"Combinatorially Two-Orbit Convex Polytopes","year":2015,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Convex polytope; Polytope; Regular polygon; Automorphism group; Group (periodic table); Homogeneous space; Automorphism; Convex hull; Convex body","score_opus":0.06849600971876124,"score_gpt":0.3632463689505271,"score_spread":0.29475035923176585,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2254647820","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5536691,0.0005766145,0.18282358,0.0022295886,0.00038800258,0.00014645263,0.0019536628,0.000302128,0.2579109],"genre_scores_gemma":[0.8938058,0.00057919906,0.024471465,0.0003261968,0.00020559519,0.00016336294,0.0022977353,0.00020375375,0.07794685],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995443,0.000057268746,0.000020724163,0.000083197854,0.00017575416,0.00011874862],"domain_scores_gemma":[0.999271,0.00026102873,0.00009313482,0.00006287985,0.0000966915,0.00021527511],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002929265,0.0009959124,0.0009542138,0.0014956034,0.0017582095,0.004082413,0.0011952735,0.0009919164,0.019347565],"category_scores_gemma":[0.0013705323,0.00051101553,0.00073758495,0.0011936295,0.002543774,0.0027826289,0.002884202,0.0032158834,0.0014369191],"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.00009600676,0.000033125838,0.0002312928,0.000059521746,0.000012421028,0.00014659106,0.00019000894,0.0042060493,0.0012021568,0.98560506,0.002393439,0.0058242516],"study_design_scores_gemma":[0.0000647929,0.00005517466,0.0008554152,0.000032567863,0.000020393258,0.0003028353,0.00044625546,0.022004614,0.0015309341,0.9638017,0.010853919,0.00003140395],"about_ca_topic_score_codex":0.0022855655,"about_ca_topic_score_gemma":0.0017326626,"teacher_disagreement_score":0.019347565,"about_ca_system_score_codex":0.001269142,"about_ca_system_score_gemma":0.0005741858,"threshold_uncertainty_score":0.06472409},"labels":[],"label_agreement":null},{"id":"W2257178227","doi":"10.1007/s00454-017-9939-y","title":"Embedding-Preserving Rectangle Visibility Representations of Nonplanar Graphs","year":2017,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; University of Waterloo; Ministero dell’Istruzione, dell’Università e della Ricerca; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Rectangle; Embedding; Time complexity; Book embedding; Graph; Visibility; Crossing number (knot theory); Set (abstract data type)","score_opus":0.02211987090027542,"score_gpt":0.32635410914234164,"score_spread":0.30423423824206625,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2257178227","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19398667,0.0002197391,0.78390324,0.00021920727,0.000082394865,0.000055271626,0.00038666322,0.00090005016,0.020246817],"genre_scores_gemma":[0.8508365,0.00041842225,0.13808094,0.000070629234,0.000051788942,0.000045185763,0.00089666166,0.0005315633,0.009068217],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99983346,0.000029465013,0.000008402639,0.000040417417,0.000054997625,0.00003337967],"domain_scores_gemma":[0.9995621,0.00012281215,0.00006610917,0.00014230546,0.00006694268,0.000039654627],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017827268,0.00036888017,0.00033994755,0.0005055946,0.0001977231,0.0011532815,0.0008326216,0.00054131926,0.0071371747],"category_scores_gemma":[0.001251576,0.00024824005,0.00033189825,0.00053607806,0.00045572122,0.0014585492,0.0010665654,0.0010102397,0.0008797299],"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.00038888401,0.00013372753,0.000607282,0.00021200752,0.000021517648,0.00033420871,0.0006661503,0.12024127,0.035389725,0.6316132,0.006499156,0.20389284],"study_design_scores_gemma":[0.00005496582,0.00011811869,0.0005930339,0.000046961744,0.000021560529,0.0002800236,0.00029406106,0.680161,0.012157345,0.29268098,0.013564614,0.00002737943],"about_ca_topic_score_codex":0.0006497425,"about_ca_topic_score_gemma":0.000982074,"teacher_disagreement_score":0.0071371747,"about_ca_system_score_codex":0.00025793535,"about_ca_system_score_gemma":0.00019495287,"threshold_uncertainty_score":0.02387625},"labels":[],"label_agreement":null},{"id":"W2261802587","doi":"10.1007/s00454-016-9815-1","title":"On Non-separable Families of Positive Homothetic Convex Bodies","year":2016,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Point processes and geometric inequalities","field":"Mathematics","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":"Mathematics; Combinatorics; Homothetic transformation; Separable space; Conjecture; Disjoint sets; Ball (mathematics); Convex body; Hyperplane; Regular polygon; Counterexample; Norm (philosophy); Euclidean geometry; Convex hull; Mathematical analysis; Geometry","score_opus":0.022070071477755273,"score_gpt":0.3032988742440914,"score_spread":0.28122880276633616,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2261802587","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43059024,0.0014806064,0.52034414,0.0020784198,0.00014418495,0.00007497199,0.00045249637,0.0001225589,0.044712447],"genre_scores_gemma":[0.9348973,0.0014815289,0.03885832,0.00037595202,0.00023035398,0.00015726915,0.0007118847,0.00012621826,0.02316116],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980192,0.0005846015,0.00010179711,0.0003651065,0.00061470544,0.00031449035],"domain_scores_gemma":[0.98805565,0.007656918,0.0014710489,0.000519908,0.0011745692,0.0011220211],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029185005,0.0015027778,0.002028498,0.0036144005,0.0028612374,0.0045459284,0.0024733148,0.0018774191,0.0071557523],"category_scores_gemma":[0.012497176,0.001287536,0.002222453,0.0027588224,0.0067424444,0.006088154,0.004716155,0.0043593654,0.00053040864],"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.0000455745,0.000016898835,0.00036591757,0.000040787043,0.00001891075,0.0001285953,0.0003278433,0.007332904,0.00043308636,0.9886346,0.00043233632,0.0022226633],"study_design_scores_gemma":[0.000021899248,0.00003205728,0.00073258986,0.000035469864,0.000017598553,0.00012552393,0.00029133883,0.05617077,0.00027935818,0.9411447,0.0011303934,0.000018241508],"about_ca_topic_score_codex":0.0043323063,"about_ca_topic_score_gemma":0.0031645799,"teacher_disagreement_score":0.0071557523,"about_ca_system_score_codex":0.0034856927,"about_ca_system_score_gemma":0.0009377528,"threshold_uncertainty_score":0.025290608},"labels":[],"label_agreement":null},{"id":"W2282988760","doi":"10.1007/s00454-016-9784-4","title":"Optimal Deterministic Algorithms for 2-d and 3-d Shallow Cuttings","year":2016,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":30,"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":"Mathematics; Computational geometry; Combinatorics; Deterministic algorithm; Algorithm; Regular polygon; Voronoi diagram; Convex geometry; Geometry; Convex optimization; Convex set","score_opus":0.019191564393856005,"score_gpt":0.27946708847346396,"score_spread":0.26027552407960797,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2282988760","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014657244,0.00026422055,0.9796163,0.0001809387,0.000059488328,0.00007823867,0.00013202455,0.00071417424,0.004297267],"genre_scores_gemma":[0.21643545,0.00026011223,0.7771612,0.00013600478,0.00004755622,0.00027696646,0.00040741204,0.00042269088,0.00485256],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990932,0.00014475334,0.0000662338,0.00020498823,0.00032401466,0.000166928],"domain_scores_gemma":[0.99686325,0.0020847565,0.00020531498,0.00039594222,0.00031915135,0.00013158568],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011039474,0.0011141686,0.0014531445,0.0012048371,0.0010700226,0.0016762767,0.0024371997,0.0020064902,0.011936733],"category_scores_gemma":[0.005793489,0.001489782,0.001672681,0.0013307198,0.0012528754,0.001965795,0.0032102924,0.0018113685,0.0011971353],"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.0002682707,0.00008804201,0.00071431545,0.00021820782,0.000040196017,0.000034149754,0.00012808437,0.78812885,0.002560653,0.051429853,0.0042151893,0.15217407],"study_design_scores_gemma":[0.000030117522,0.000024917399,0.0001177023,0.000011847322,0.000008290364,0.000012637149,0.000021063812,0.98015517,0.00055306475,0.018152546,0.0009043261,0.000008367459],"about_ca_topic_score_codex":0.009643093,"about_ca_topic_score_gemma":0.019963454,"teacher_disagreement_score":0.011936733,"about_ca_system_score_codex":0.002536333,"about_ca_system_score_gemma":0.002682673,"threshold_uncertainty_score":0.03993231},"labels":[],"label_agreement":null},{"id":"W2471885719","doi":"10.1007/s00454-016-9852-9","title":"Smaller Extended Formulations for the Spanning Tree Polytope of Bounded-Genus Graphs","year":2017,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":11,"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":"European Research Council","keywords":"Combinatorics; Polytope; Spanning tree; Mathematics; Vertex (graph theory); Genus; Bounded function; Minimum spanning tree; Graph; Minimum degree spanning tree; Discrete mathematics","score_opus":0.04279141595860556,"score_gpt":0.31238818516437084,"score_spread":0.26959676920576525,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2471885719","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10480003,0.0014834292,0.8149096,0.0030842784,0.0004956381,0.00024572862,0.0013773739,0.00025054842,0.07335343],"genre_scores_gemma":[0.6093932,0.0021932044,0.3149992,0.0014781563,0.0010369928,0.00084603584,0.003090496,0.0010355355,0.06592717],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99914026,0.00028220672,0.00003766023,0.00018898805,0.00022431482,0.0001265561],"domain_scores_gemma":[0.9976574,0.0014179278,0.00016414895,0.0002857247,0.00021994903,0.0002548455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013622579,0.001423685,0.0016218749,0.0008896891,0.00080510875,0.00345895,0.0032248267,0.002082963,0.02085149],"category_scores_gemma":[0.0054002753,0.00070770405,0.0019171917,0.0012768771,0.0015453956,0.006394889,0.0023937603,0.005862559,0.00114072],"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.00009483408,0.00015248093,0.00026509663,0.0002768448,0.00004534871,0.00014008672,0.0002593348,0.17957748,0.0014005702,0.78931856,0.011029483,0.017439708],"study_design_scores_gemma":[0.0000356628,0.0000399845,0.00019770199,0.000051058352,0.000025168605,0.00007245728,0.00013658438,0.44058815,0.0003204954,0.5509958,0.007519739,0.000017119864],"about_ca_topic_score_codex":0.0019627607,"about_ca_topic_score_gemma":0.0035613598,"teacher_disagreement_score":0.02085149,"about_ca_system_score_codex":0.0022458686,"about_ca_system_score_gemma":0.0009946352,"threshold_uncertainty_score":0.0697552},"labels":[],"label_agreement":null},{"id":"W2515361867","doi":"10.1007/s00454-016-9823-1","title":"Unique Determination of Convex Lattice Sets","year":2016,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Regular polygon; Lattice (music); Physics; Geometry","score_opus":0.015330599697729083,"score_gpt":0.28902329182556397,"score_spread":0.27369269212783487,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2515361867","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16655186,0.00056000607,0.7730661,0.000913752,0.00031492382,0.00010836611,0.00054214895,0.00047342505,0.057469454],"genre_scores_gemma":[0.72109556,0.00033776747,0.25902948,0.00016895888,0.00013600306,0.00013034172,0.0006819337,0.00039645957,0.018023467],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99830675,0.00041526704,0.0000861471,0.00036645198,0.0006080514,0.0002173327],"domain_scores_gemma":[0.9968688,0.0011966503,0.0003333649,0.00041606565,0.00063530856,0.0005499058],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00091820717,0.0004887771,0.0013237112,0.0020879067,0.0022096005,0.0043715728,0.001620842,0.00097283314,0.005508425],"category_scores_gemma":[0.006968734,0.0009982707,0.0010309593,0.0011152168,0.0031177104,0.0029243492,0.0035894166,0.0038424272,0.0014232281],"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.000065560074,0.000039570357,0.0005347106,0.00008491066,0.00001715137,0.00012916952,0.00030210082,0.009411696,0.004116028,0.9581478,0.0028895778,0.024261707],"study_design_scores_gemma":[0.000019871643,0.000034083325,0.00036582796,0.000033993794,0.000008711724,0.00031360905,0.00034393175,0.072369814,0.005827059,0.9141071,0.0065259347,0.000050098955],"about_ca_topic_score_codex":0.001080713,"about_ca_topic_score_gemma":0.0013531292,"teacher_disagreement_score":0.005508425,"about_ca_system_score_codex":0.0012239424,"about_ca_system_score_gemma":0.0011197473,"threshold_uncertainty_score":0.018427491},"labels":[],"label_agreement":null},{"id":"W2566851301","doi":"10.1007/s00454-018-0001-5","title":"On Planar Greedy Drawings of 3-Connected Planar Graphs","year":2018,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"H2020 Marie Skłodowska-Curie Actions; Ministero dell’Istruzione, dell’Università e della Ricerca; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Planar graph; Planar straight-line graph; Greedy algorithm; Embedding; Conjecture; Discrete mathematics; Graph; Pathwidth; Computer science; Line graph; Algorithm","score_opus":0.012167746225320412,"score_gpt":0.2531643707748612,"score_spread":0.2409966245495408,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2566851301","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1193598,0.0007505252,0.8263723,0.0006881344,0.00016739855,0.00022638873,0.00085000804,0.0007888017,0.05079662],"genre_scores_gemma":[0.49886045,0.002620773,0.45740038,0.00039215063,0.00015784848,0.00028955855,0.003093456,0.0006903072,0.03649516],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993674,0.00018812928,0.000027081664,0.00009384158,0.00023410053,0.00008952309],"domain_scores_gemma":[0.99860317,0.00068524835,0.00020593635,0.00016892079,0.00021766526,0.00011907002],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044102795,0.0013000272,0.00079709676,0.0017665345,0.0008103919,0.0019821245,0.0015216077,0.0013243733,0.013963489],"category_scores_gemma":[0.0043985653,0.00096205215,0.0008246723,0.002514101,0.001136354,0.0018909635,0.002339351,0.0015938288,0.002326176],"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.0001825152,0.00007968101,0.0010032131,0.00031782108,0.000045963916,0.00040466193,0.00046338447,0.1903913,0.0080134105,0.66119033,0.015991045,0.121916726],"study_design_scores_gemma":[0.00007170249,0.000079537676,0.00065840804,0.00010242648,0.000041267576,0.00030670225,0.00031514544,0.3450598,0.0028921026,0.6306337,0.019800775,0.00003838558],"about_ca_topic_score_codex":0.0027051857,"about_ca_topic_score_gemma":0.0048058513,"teacher_disagreement_score":0.013963489,"about_ca_system_score_codex":0.0009793148,"about_ca_system_score_gemma":0.00056666933,"threshold_uncertainty_score":0.046712518},"labels":[],"label_agreement":null},{"id":"W2570731303","doi":"10.1007/s00454-015-9734-6","title":"On Triple Intersections of Three Families of Unit Circles","year":2015,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":11,"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":"National Science Foundation","keywords":"Combinatorics; Conjecture; Mathematics; Unit (ring theory); Plane (geometry); Crossing number (knot theory); Unit circle; Geometry; Intersection (aeronautics)","score_opus":0.04075130836591756,"score_gpt":0.2811433365238591,"score_spread":0.24039202815794153,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2570731303","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5493749,0.000874096,0.31757775,0.00094619585,0.0004982594,0.00016428289,0.00041706293,0.0004373801,0.12971005],"genre_scores_gemma":[0.93861216,0.00038499644,0.04149639,0.00011444011,0.000086560896,0.00009672382,0.0004506934,0.00020593936,0.018552065],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991141,0.00020686115,0.000038855313,0.00015083594,0.00031614295,0.00017327881],"domain_scores_gemma":[0.99768734,0.00087913516,0.0003946456,0.00018968305,0.0005731959,0.000276053],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006924975,0.0007346845,0.0007948293,0.0026417058,0.0024896716,0.0028614237,0.0015858723,0.0018403656,0.012103829],"category_scores_gemma":[0.0051581357,0.0006876912,0.00072983257,0.001867174,0.0022364107,0.0020925654,0.0026657027,0.0019170346,0.0016416641],"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.00023685094,0.000037919286,0.0012011353,0.00010593356,0.000024250736,0.0008115833,0.0010739599,0.016234484,0.0019839231,0.95438164,0.0032941236,0.020614335],"study_design_scores_gemma":[0.000049303395,0.00012621608,0.001174758,0.00012774846,0.000031159616,0.00086963107,0.0020079156,0.11379933,0.003945022,0.85854,0.019269139,0.000059776023],"about_ca_topic_score_codex":0.0019198917,"about_ca_topic_score_gemma":0.0011924527,"teacher_disagreement_score":0.012103829,"about_ca_system_score_codex":0.0012627635,"about_ca_system_score_gemma":0.00049754675,"threshold_uncertainty_score":0.040491343},"labels":[],"label_agreement":null},{"id":"W2591812587","doi":"10.1007/s00454-012-9479-4","title":"Sporadic Reinhardt Polygons","year":2013,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Simons Foundation","keywords":"Combinatorics; Mathematics","score_opus":0.007348079187393582,"score_gpt":0.22793138899979737,"score_spread":0.2205833098124038,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2591812587","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32424083,0.0009994532,0.08806485,0.0012768947,0.0005699549,0.00012581603,0.0006883008,0.0005609262,0.583473],"genre_scores_gemma":[0.8835686,0.0004865226,0.012473617,0.00020972214,0.0001999319,0.00008051076,0.0006987605,0.00022048158,0.10206182],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99944395,0.0000862157,0.00003058451,0.00012411487,0.00017882514,0.00013622346],"domain_scores_gemma":[0.9995615,0.000091492846,0.00007032792,0.00009755697,0.00008032321,0.00009879179],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032381102,0.00078903395,0.00082815695,0.0021613098,0.0022110296,0.0025765074,0.0009546143,0.0008161682,0.020882042],"category_scores_gemma":[0.0014779164,0.00048999046,0.0007102882,0.0009448769,0.001981419,0.0021741446,0.002592005,0.0020122363,0.0030502977],"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.000029158035,0.000008062904,0.00013667798,0.000020843932,0.0000060214866,0.00013923993,0.00013475584,0.0006271665,0.0006589767,0.9930629,0.0014013293,0.0037748995],"study_design_scores_gemma":[0.000031086995,0.000025809655,0.00051504374,0.00002318864,0.00001812559,0.0007111213,0.00031711636,0.004900763,0.0019324716,0.96252406,0.028983835,0.000017297469],"about_ca_topic_score_codex":0.00096741173,"about_ca_topic_score_gemma":0.0010259134,"teacher_disagreement_score":0.020882042,"about_ca_system_score_codex":0.00078260305,"about_ca_system_score_gemma":0.0004780917,"threshold_uncertainty_score":0.06985736},"labels":[],"label_agreement":null},{"id":"W2592215285","doi":"10.1007/s00454-016-9842-y","title":"Upper and Lower Bounds for Online Routing on Delaunay Triangulations","year":2016,"lang":"en","type":"article","venue":"Discrete & 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; Carleton University","funders":"Agence Nationale de la Recherche","keywords":"Delaunay triangulation; Computer science; Upper and lower bounds; Routing (electronic design automation); Constrained Delaunay triangulation; Combinatorics; Computer network; Algorithm; Mathematics","score_opus":0.01888128039390763,"score_gpt":0.28410217519620534,"score_spread":0.2652208948022977,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2592215285","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042916294,0.008789851,0.8716743,0.0062958873,0.0011726946,0.00053324323,0.002596197,0.0037023174,0.06231913],"genre_scores_gemma":[0.5458148,0.0094535835,0.39636436,0.0021283315,0.0026999372,0.0014498831,0.0046312623,0.0041916408,0.03326622],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9846644,0.0031756444,0.0008322795,0.0023666401,0.005725596,0.0032354214],"domain_scores_gemma":[0.88625103,0.08550882,0.004504246,0.01396492,0.0058276607,0.0039433236],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0105389925,0.0055107297,0.00600505,0.0059018238,0.0038341968,0.012889774,0.0138696935,0.00563223,0.03339813],"category_scores_gemma":[0.07424908,0.0031478952,0.0038657277,0.0076011624,0.005680273,0.0260702,0.015948432,0.011852283,0.006389698],"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.0016992948,0.00082809903,0.002265265,0.001825102,0.00024311997,0.00027736666,0.00088233233,0.543972,0.0067135543,0.2616578,0.03469778,0.14493826],"study_design_scores_gemma":[0.00008624223,0.0002067753,0.0004787091,0.00023915771,0.00015824345,0.00020320914,0.00025243813,0.80093,0.0028169847,0.18860905,0.0059487764,0.00007039611],"about_ca_topic_score_codex":0.0037345137,"about_ca_topic_score_gemma":0.0063731773,"teacher_disagreement_score":0.03339813,"about_ca_system_score_codex":0.006926754,"about_ca_system_score_gemma":0.004310646,"threshold_uncertainty_score":0.111727834},"labels":[],"label_agreement":null},{"id":"W2592372025","doi":"10.1007/s00454-017-9877-8","title":"On the Bounds of Conway’s Thrackles","year":2017,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":9,"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":"Combinatorics; Mathematics; Conjecture; Upper and lower bounds; Graph; Order (exchange); Crossing number (knot theory); Knot (papermaking); Mathematical analysis","score_opus":0.023006922480881938,"score_gpt":0.28466544712215036,"score_spread":0.26165852464126843,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2592372025","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13156432,0.003894216,0.5204462,0.0048593516,0.0014806206,0.00014675705,0.00057405245,0.0009432581,0.33609128],"genre_scores_gemma":[0.80805373,0.0018632705,0.09053922,0.0012284908,0.0004912822,0.00020168241,0.00078261265,0.0013388623,0.09550086],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978264,0.0005736778,0.00010469242,0.00041794463,0.00063585734,0.00044137475],"domain_scores_gemma":[0.98800045,0.007955236,0.0005833954,0.0014134424,0.0010889183,0.0009586265],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024630763,0.0013702849,0.0014732883,0.0027460833,0.0025490155,0.004263102,0.0028743765,0.002595386,0.03450904],"category_scores_gemma":[0.031850297,0.0011406721,0.0011658114,0.0016817766,0.00485123,0.008811288,0.0066517573,0.0074040308,0.0044500586],"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.00021177036,0.000036767087,0.00035530975,0.00007656652,0.0000141542,0.0000789866,0.00030553647,0.017638966,0.00069318525,0.9463365,0.008027903,0.026224328],"study_design_scores_gemma":[0.000026847814,0.00006819196,0.00031502306,0.00010569012,0.00002072795,0.00011409792,0.0002224876,0.090451874,0.0010429778,0.8899408,0.017648134,0.00004312975],"about_ca_topic_score_codex":0.004073835,"about_ca_topic_score_gemma":0.0034290175,"teacher_disagreement_score":0.03450904,"about_ca_system_score_codex":0.001612585,"about_ca_system_score_gemma":0.0009769906,"threshold_uncertainty_score":0.11544424},"labels":[],"label_agreement":null},{"id":"W2743143360","doi":"10.1007/s00454-018-0027-8","title":"Lower Bounds for the Measurable Chromatic Number of the Hyperbolic Plane","year":2018,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Limits and Structures in Graph Theory","field":"Mathematics","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":"Lady Davis Fellowship Trust, Hebrew University of Jerusalem; European Research Council","keywords":"Mathematics; Chromatic scale; Hyperbolic geometry; Combinatorics; Euclidean geometry; Vertex (graph theory); Graph; Plane (geometry); Upper and lower bounds; Hyperbolic triangle; Euclidean distance; Geometry; Mathematical analysis; Algebraic geometry","score_opus":0.02733506430932519,"score_gpt":0.3130590862465464,"score_spread":0.2857240219372212,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2743143360","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35557246,0.010683328,0.4154772,0.016016467,0.0009086663,0.00016041183,0.0022151575,0.0012405292,0.19772582],"genre_scores_gemma":[0.9381297,0.0041795606,0.033419278,0.001111333,0.0012243201,0.00027947716,0.0013411551,0.0005238788,0.01979124],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982147,0.00046146804,0.00006089917,0.00043164135,0.0004802203,0.0003509867],"domain_scores_gemma":[0.9803771,0.013823157,0.0010152728,0.0013882006,0.0010439984,0.0023523571],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031143895,0.0021137653,0.0017349834,0.0060972613,0.0021114082,0.0060070883,0.0049362867,0.00208217,0.016133016],"category_scores_gemma":[0.016991155,0.00082334573,0.0014209138,0.0033245129,0.007190935,0.010205865,0.0057809097,0.007906554,0.0013852589],"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.000138399,0.00005905165,0.0009796674,0.00016724273,0.00003420794,0.00004486376,0.00023585837,0.0121385995,0.0018327521,0.9735416,0.0032950458,0.007532676],"study_design_scores_gemma":[0.000022019716,0.000037603473,0.00094317965,0.00008066484,0.000032899767,0.000067198205,0.000091378744,0.04635586,0.00094687205,0.94787186,0.0035132652,0.00003710758],"about_ca_topic_score_codex":0.0020576448,"about_ca_topic_score_gemma":0.0025774033,"teacher_disagreement_score":0.016133016,"about_ca_system_score_codex":0.0056014988,"about_ca_system_score_gemma":0.0014123713,"threshold_uncertainty_score":0.053970277},"labels":[],"label_agreement":null},{"id":"W2788865931","doi":"10.1007/s00454-020-00230-y","title":"Equivelar Toroids with Few Flag-Orbits","year":2021,"lang":"en","type":"preprint","venue":"Discrete & Computational Geometry","topic":"Geometric and Algebraic Topology","field":"Mathematics","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":"York University","funders":"","keywords":"Toroid; Torus; Tessellation (computer graphics); Quotient; Mathematics; Flag (linear algebra); Geometry; Dimension (graph theory); Euclidean space; Tetrahedron; Combinatorics; Space (punctuation); Polytope; Euclidean geometry; Orbit (dynamics); Physics; Pure mathematics; Algebra over a field; Computer science; Quantum mechanics","score_opus":0.037414859234279056,"score_gpt":0.3168305712470329,"score_spread":0.27941571201275384,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2788865931","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6943537,0.00081706897,0.0942703,0.0018731034,0.00093139365,0.00010989595,0.0011863287,0.0007693739,0.20568885],"genre_scores_gemma":[0.9409061,0.00027450544,0.012326715,0.00034432762,0.00031124297,0.0000628126,0.00074039114,0.00021537388,0.044818517],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994906,0.00008600474,0.000027756381,0.00014249138,0.00013593237,0.00011715644],"domain_scores_gemma":[0.999295,0.0001832113,0.00013096507,0.00011204535,0.000100104604,0.00017875247],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004013982,0.00079798634,0.00086955633,0.0020173755,0.0022823124,0.0029151386,0.001017897,0.0011767532,0.013110173],"category_scores_gemma":[0.0016687845,0.0005273223,0.00071476673,0.00076077756,0.0029948102,0.0037657516,0.0039397646,0.0026833785,0.0018976956],"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.00013344534,0.00003312221,0.00047791353,0.000051569983,0.000012327473,0.00021320072,0.00026101383,0.00095308677,0.0013560894,0.98857147,0.0019842656,0.005952505],"study_design_scores_gemma":[0.000025918807,0.000045658777,0.0007533206,0.000017827451,0.000014854962,0.00035436897,0.00034255238,0.0034952473,0.00086406036,0.9872075,0.0068583726,0.000020432277],"about_ca_topic_score_codex":0.00077306957,"about_ca_topic_score_gemma":0.0009410599,"teacher_disagreement_score":0.013110173,"about_ca_system_score_codex":0.0010931351,"about_ca_system_score_gemma":0.00046417807,"threshold_uncertainty_score":0.043857872},"labels":[],"label_agreement":null},{"id":"W2789246618","doi":"10.1007/s00454-020-00213-z","title":"Almost All String Graphs are Intersection Graphs of Plane Convex Sets","year":2020,"lang":"en","type":"preprint","venue":"Discrete & Computational Geometry","topic":"Limits and Structures in Graph Theory","field":"Mathematics","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":"Ministry of Education and Science of the Russian Federation; Austrian Science Fund; Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung; National Science Foundation","keywords":"Combinatorics; Mathematics; Corollary; Chordal graph; Intersection graph; Discrete mathematics; Indifference graph; Planar graph; Graph; Line graph","score_opus":0.05276311599847083,"score_gpt":0.3223841234176652,"score_spread":0.26962100741919437,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2789246618","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5499694,0.0014807961,0.27511826,0.003321294,0.00030164426,0.000120823686,0.0024938846,0.0008488698,0.166345],"genre_scores_gemma":[0.92882276,0.0012758425,0.0399266,0.0009781227,0.0003500162,0.00022988708,0.0029353532,0.00044026223,0.02504118],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990896,0.00021360218,0.000042156666,0.00027847104,0.0002560236,0.000120116296],"domain_scores_gemma":[0.99687755,0.0013748461,0.0006254761,0.00037861505,0.00039801787,0.00034559902],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048811926,0.00094737986,0.0012238089,0.003199623,0.0024163418,0.005897668,0.0016807225,0.0018936141,0.012190406],"category_scores_gemma":[0.0036372084,0.00096673163,0.0009857964,0.0038466072,0.0035875787,0.010652797,0.002216048,0.0037285003,0.0014727552],"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.000033388158,0.00001784697,0.00029575403,0.000041256917,0.000013132838,0.00005584142,0.00017181042,0.00078690174,0.00044959024,0.9914858,0.0015240622,0.0051246514],"study_design_scores_gemma":[0.000005340967,0.0000063496605,0.00024234572,0.000013083218,0.0000071206887,0.00009717621,0.00011813207,0.0023093717,0.00031829017,0.9946116,0.0022652822,0.0000058605874],"about_ca_topic_score_codex":0.0008065872,"about_ca_topic_score_gemma":0.0007510856,"teacher_disagreement_score":0.012190406,"about_ca_system_score_codex":0.001010079,"about_ca_system_score_gemma":0.0004027428,"threshold_uncertainty_score":0.04078096},"labels":[],"label_agreement":null},{"id":"W2790579414","doi":"10.1007/s00454-022-00401-z","title":"Maximal Perimeters of Polytope Sections and Origin-Symmetry","year":2022,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Point processes and geometric inequalities","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Conjecture; Polytope; Mathematics; Star (game theory); Boundary (topology); Regular polygon; Geometry; Mathematical analysis","score_opus":0.044830756806349244,"score_gpt":0.31898898761346944,"score_spread":0.2741582308071202,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2790579414","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.623975,0.0008614261,0.26708278,0.0010111594,0.00012750663,0.000091689064,0.0005154636,0.0002499767,0.106085055],"genre_scores_gemma":[0.9698294,0.0005027544,0.018755412,0.000102415426,0.00012983888,0.00007191175,0.00029571026,0.00012620832,0.010186361],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991554,0.00020906224,0.000038799742,0.00021355148,0.00021110258,0.00017203666],"domain_scores_gemma":[0.9946911,0.0030684383,0.0008315588,0.0003412463,0.00040951392,0.00065813214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001562498,0.0006745292,0.0010640221,0.0018864035,0.0012899523,0.003442474,0.001867878,0.0008358024,0.007914038],"category_scores_gemma":[0.0071188803,0.0007969927,0.0011012906,0.0009354085,0.0051260237,0.004942976,0.0029682738,0.0027507034,0.00062555174],"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.000053379117,0.000017373233,0.00046785787,0.000027274464,0.00000747279,0.00004169657,0.0001392668,0.0027459706,0.0005980237,0.9925483,0.00039973986,0.0029537624],"study_design_scores_gemma":[0.000027072962,0.00003320679,0.00082356913,0.000014826696,0.0000092558885,0.00011330029,0.00013271536,0.014061935,0.000759965,0.9828205,0.0011932878,0.000010393583],"about_ca_topic_score_codex":0.00079303654,"about_ca_topic_score_gemma":0.00054109923,"teacher_disagreement_score":0.007914038,"about_ca_system_score_codex":0.0011790426,"about_ca_system_score_gemma":0.00057154143,"threshold_uncertainty_score":0.026475072},"labels":[],"label_agreement":null},{"id":"W2889537410","doi":"10.1007/s00454-023-00499-9","title":"Improved Routing on the Delaunay Triangulation","year":2023,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Ottawa","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; Agence Nationale de la Recherche","keywords":"Delaunay triangulation; Combinatorics; Vertex (graph theory); Mathematics; Constrained Delaunay triangulation; Minimum-weight triangulation; Euclidean geometry; Discrete mathematics; Graph; Geometry","score_opus":0.024599141864490155,"score_gpt":0.2717554313335173,"score_spread":0.24715628946902715,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2889537410","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026950143,0.0006758976,0.95150965,0.00030774946,0.00024190595,0.00006976212,0.00017635441,0.0011409323,0.01892747],"genre_scores_gemma":[0.27060616,0.0009304275,0.70783985,0.0001458261,0.00015273612,0.00012937549,0.00036151553,0.00047610092,0.019358054],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99934417,0.00016286116,0.00003317446,0.00011609984,0.00028702372,0.000056692355],"domain_scores_gemma":[0.9993668,0.00020521908,0.000037037342,0.00017643192,0.00018930386,0.000025213545],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039662907,0.00049535104,0.00097211596,0.0009478231,0.00055111095,0.00084525306,0.0010924351,0.0005899101,0.008077228],"category_scores_gemma":[0.0020779811,0.00040237012,0.000486879,0.0009219702,0.000584862,0.0012834838,0.0017129439,0.000882955,0.00170963],"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.0002607863,0.000055989025,0.0006690795,0.0002536441,0.000054129498,0.00017234546,0.00021492032,0.4180703,0.014362459,0.15951532,0.012058584,0.3943125],"study_design_scores_gemma":[0.000036098463,0.00008549017,0.0002573291,0.00002919272,0.00002395221,0.000132277,0.000047133963,0.9338911,0.0039504077,0.042837366,0.018682754,0.000026837639],"about_ca_topic_score_codex":0.0046805115,"about_ca_topic_score_gemma":0.0061275503,"teacher_disagreement_score":0.008077228,"about_ca_system_score_codex":0.00066670007,"about_ca_system_score_gemma":0.00068528106,"threshold_uncertainty_score":0.02702105},"labels":[],"label_agreement":null},{"id":"W2899582626","doi":"10.1007/s00454-022-00418-4","title":"Dual Circumference and Collinear Sets","year":2022,"lang":"en","type":"preprint","venue":"Discrete & 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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Circumference; Vertex (graph theory); Mathematics; Omega; Planar graph; Degree (music); Triangulation; Graph; Planar; Line (geometry); Geometry; Physics; Computer science","score_opus":0.023055911642320546,"score_gpt":0.2864938477798974,"score_spread":0.2634379361375768,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2899582626","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2938069,0.001217905,0.5083203,0.0016692015,0.0008010414,0.000105352,0.00053198065,0.0004016556,0.19314568],"genre_scores_gemma":[0.8732251,0.000638123,0.08669614,0.00036899972,0.00033874757,0.00014397841,0.000641015,0.00040028765,0.037547626],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991703,0.00019382943,0.000035601304,0.00020253706,0.0002762836,0.00012136005],"domain_scores_gemma":[0.9986934,0.0005667503,0.0001952767,0.00016782276,0.00019414921,0.00018262892],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005445425,0.0007291367,0.00078398024,0.0025181356,0.0015128591,0.0030829622,0.0012500165,0.0011115205,0.011149763],"category_scores_gemma":[0.0047957883,0.0007217794,0.0007999616,0.0013333008,0.0026871574,0.0024565065,0.0041504693,0.00272604,0.0011323004],"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.00005067377,0.000013922018,0.00023687944,0.000028165765,0.0000057217308,0.00007576893,0.000100411125,0.0028802147,0.0006513136,0.9871895,0.0013027221,0.0074646696],"study_design_scores_gemma":[0.00002067257,0.000026985732,0.00035083276,0.00002996086,0.000011100065,0.00023124037,0.00017879832,0.022668902,0.0013007742,0.9636869,0.01147724,0.000016593509],"about_ca_topic_score_codex":0.0010665319,"about_ca_topic_score_gemma":0.00059299986,"teacher_disagreement_score":0.011149763,"about_ca_system_score_codex":0.0010417496,"about_ca_system_score_gemma":0.0003864165,"threshold_uncertainty_score":0.037299693},"labels":[],"label_agreement":null},{"id":"W2904743400","doi":"10.1007/s00454-023-00567-0","title":"Stabbing Pairwise Intersecting Disks by Four Points","year":2023,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Mathematics; Combinatorics; Pairwise comparison; Simple (philosophy); Constructive proof; Set (abstract data type); Constructive; Plane (geometry); Discrete mathematics; Computer science; Geometry; Statistics","score_opus":0.02403260326701627,"score_gpt":0.27041770027146167,"score_spread":0.24638509700444539,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2904743400","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22023669,0.00030236313,0.7458197,0.00036540316,0.00030483227,0.0002673686,0.00025140715,0.0011149179,0.03133725],"genre_scores_gemma":[0.58485943,0.00022507,0.38913563,0.00012759976,0.000034596458,0.00017126824,0.0004275359,0.00046619936,0.02455274],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99936074,0.00010479813,0.00004039996,0.00012371919,0.00026200843,0.000108387416],"domain_scores_gemma":[0.9987896,0.00041929088,0.000111409405,0.00029394013,0.00022427073,0.00016145683],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055981387,0.00077448087,0.0011519289,0.0012100788,0.0011885188,0.001444916,0.0022319772,0.0018476519,0.018614318],"category_scores_gemma":[0.0029277578,0.00079984573,0.0006891027,0.0013773357,0.0013654206,0.0013962501,0.0044172667,0.0017012568,0.004243682],"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.0017802782,0.00039471383,0.00291917,0.0006207932,0.00013944907,0.0015175119,0.002018757,0.42634508,0.06962261,0.2061776,0.01100775,0.2774563],"study_design_scores_gemma":[0.00016520929,0.00048895285,0.00044819503,0.00013029891,0.000037458904,0.00042243072,0.0006876323,0.8643955,0.022967445,0.08919072,0.021001847,0.000064398584],"about_ca_topic_score_codex":0.0017690059,"about_ca_topic_score_gemma":0.0019054798,"teacher_disagreement_score":0.018614318,"about_ca_system_score_codex":0.00067548326,"about_ca_system_score_gemma":0.0006097299,"threshold_uncertainty_score":0.06227112},"labels":[],"label_agreement":null},{"id":"W2913852997","doi":"10.1007/s00454-002-2775-7","title":"Flipturning Polygons","year":2002,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University; McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; Ministerio de Economía y Competitividad","keywords":"Polygon covering; Combinatorics; Polygon (computer graphics); Simple polygon; Rectilinear polygon; Mathematics; Star-shaped polygon; Equiangular polygon; Regular polygon; Midpoint; Sequence (biology); Convex polygon; Simple (philosophy); Bounding overwatch; General position; Convex hull; Convex set; Geometry; Computer science; Convex optimization; Artificial intelligence","score_opus":0.019448622564453854,"score_gpt":0.23897590358612722,"score_spread":0.21952728102167338,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2913852997","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11944813,0.00055392506,0.39373693,0.00041857062,0.001126298,0.0003981198,0.0020112256,0.0023578394,0.47994906],"genre_scores_gemma":[0.6895078,0.0007667603,0.11488973,0.00035943926,0.00012311489,0.00029871488,0.003949693,0.0014532602,0.18865153],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997304,0.000017969136,0.000010832999,0.00006594247,0.00010243794,0.00007229886],"domain_scores_gemma":[0.99976784,0.000029343568,0.000019842357,0.00008977137,0.000059694696,0.0000335015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012464909,0.00064337923,0.00048464254,0.00088005303,0.0009205991,0.0012260515,0.0006924008,0.00052154926,0.052609615],"category_scores_gemma":[0.0008592514,0.0003226425,0.00051053014,0.0006048613,0.0007682355,0.0011586926,0.0019482883,0.0011959614,0.008580929],"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.00044469116,0.00011307309,0.0014574982,0.000251802,0.000020842088,0.0013984045,0.00038081352,0.014508247,0.029589504,0.4265651,0.033293895,0.4919761],"study_design_scores_gemma":[0.00009712877,0.00031216233,0.0019713694,0.00015882024,0.000050736206,0.0027983426,0.00085646467,0.055858742,0.06809918,0.33489496,0.53484124,0.000060877697],"about_ca_topic_score_codex":0.000570188,"about_ca_topic_score_gemma":0.00073386723,"teacher_disagreement_score":0.052609615,"about_ca_system_score_codex":0.0002893001,"about_ca_system_score_gemma":0.0003161619,"threshold_uncertainty_score":0.17599672},"labels":[],"label_agreement":null},{"id":"W2918796755","doi":"10.1007/s00454-022-00440-6","title":"Schubert Curves in the Orthogonal Grassmannian","year":2023,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Simon Fraser University","funders":"Horace H. Rackham School of Graduate Studies, University of Michigan; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Mathematics; Schubert calculus; Combinatorics; Grassmannian; Type (biology); Schubert polynomial; Osculating circle; Connection (principal bundle); Geometry","score_opus":0.058261491471308526,"score_gpt":0.36879749914227966,"score_spread":0.3105360076709711,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2918796755","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7694669,0.000848213,0.034034662,0.0020880927,0.0004839339,0.00007616823,0.00024046765,0.00021812234,0.19254348],"genre_scores_gemma":[0.96901023,0.0006109521,0.0061400025,0.00023803151,0.00034930918,0.000027469452,0.000110468085,0.00008198088,0.023431575],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994393,0.00011824154,0.000023092014,0.000086092805,0.00018300948,0.0001501982],"domain_scores_gemma":[0.99953663,0.000082139995,0.000098377546,0.000041783907,0.00008276402,0.00015827117],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005652,0.0007458197,0.0005569041,0.003094369,0.0022728874,0.0034665535,0.0005771173,0.0008943156,0.006282533],"category_scores_gemma":[0.00139652,0.00038743438,0.00038065942,0.0016209965,0.0038903719,0.0043904954,0.0020011712,0.0018533787,0.0009066879],"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.000015706582,0.000006824922,0.0000847021,0.000005795325,0.0000017145444,0.000057740057,0.00012406286,0.00019241749,0.00036075478,0.9965977,0.0003985814,0.0021541365],"study_design_scores_gemma":[0.0000127811845,0.000015601161,0.00033771078,0.000008200093,0.0000042689053,0.00011726969,0.0001848705,0.0014382008,0.00037614765,0.993877,0.0036171852,0.000010701181],"about_ca_topic_score_codex":0.002273039,"about_ca_topic_score_gemma":0.0016342821,"teacher_disagreement_score":0.006282533,"about_ca_system_score_codex":0.0013949462,"about_ca_system_score_gemma":0.00082529295,"threshold_uncertainty_score":0.021017194},"labels":[],"label_agreement":null},{"id":"W2947458145","doi":"10.1007/s00454-020-00198-9","title":"Pairing Symmetries for Euclidean and Spherical Frameworks","year":2020,"lang":"en","type":"preprint","venue":"Discrete & Computational Geometry","topic":"Structural Analysis and Optimization","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"Core Research for Evolutional Science and Technology; Natural Sciences and Engineering Research Council of Canada; Lancaster University","keywords":"Infinitesimal; Rigidity (electromagnetism); Homogeneous space; Hyperplane; Mathematics; Pure mathematics; Structural rigidity; Euclidean geometry; SPHERES; Combinatorics; Mathematical analysis; Geometry; Physics; Quantum mechanics","score_opus":0.013908485443167959,"score_gpt":0.24650121204830985,"score_spread":0.2325927266051419,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2947458145","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6581168,0.00070931966,0.14781915,0.0017771778,0.00075634755,0.00011771368,0.0004535357,0.0008237336,0.18942623],"genre_scores_gemma":[0.9741746,0.00015977547,0.0145076,0.00023687356,0.000105675266,0.00005234828,0.00018900106,0.00013628395,0.010437789],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99823195,0.00047206515,0.000067957764,0.00025991118,0.00044090112,0.0005272564],"domain_scores_gemma":[0.9987801,0.0002921228,0.00022457766,0.00027071827,0.00013950543,0.00029299638],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014949598,0.0005208709,0.00075877085,0.0012798023,0.0024283149,0.0022131253,0.0010982832,0.001500247,0.012996479],"category_scores_gemma":[0.0029657546,0.0004353707,0.0013278541,0.0005515384,0.0030864477,0.003242343,0.0028199914,0.0015666859,0.0011035952],"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.000020311054,0.00000858838,0.00006697775,0.00001315619,0.0000030096314,0.000040580693,0.000057655787,0.0022326857,0.00032847343,0.99497616,0.0005166974,0.0017358491],"study_design_scores_gemma":[0.000025902933,0.000060970284,0.0003637811,0.000022120586,0.000008102304,0.0001231246,0.00022187446,0.015561054,0.00073110074,0.97884095,0.004013107,0.000027929967],"about_ca_topic_score_codex":0.0020895915,"about_ca_topic_score_gemma":0.0022913062,"teacher_disagreement_score":0.012996479,"about_ca_system_score_codex":0.0011427576,"about_ca_system_score_gemma":0.0009068953,"threshold_uncertainty_score":0.043477535},"labels":[],"label_agreement":null},{"id":"W2952746235","doi":"10.1007/s00454-021-00355-8","title":"Circumscribing Polygons and Polygonizations for Disjoint Line Segments","year":2022,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; Ministry of Education, Culture, Sports, Science and Technology; National Science Foundation","keywords":"Mathematics; Combinatorics; Disjoint sets; Star-shaped polygon; Rectilinear polygon; Polygon (computer graphics); Polygon covering; Line segment; Diagonal; Monotone polygon; Conjecture; Simple polygon; Discrete mathematics; Geometry; Regular polygon; Convex set","score_opus":0.01887991619814172,"score_gpt":0.26261876149551594,"score_spread":0.24373884529737422,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952746235","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018635655,0.00021953059,0.9742727,0.000051153565,0.000032230353,0.0001032436,0.00014439737,0.0002151646,0.006325976],"genre_scores_gemma":[0.251494,0.00066696986,0.73806995,0.0000767008,0.000052155123,0.0002993699,0.0009724824,0.0005973738,0.0077710203],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992067,0.00018373453,0.000051691924,0.00019922733,0.00029537347,0.00006325834],"domain_scores_gemma":[0.99837995,0.00071749097,0.00021820536,0.0003258927,0.00022296768,0.00013563107],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006406527,0.00055072625,0.00069309206,0.0015418307,0.00060415344,0.0017857365,0.0013145067,0.00063909125,0.0044842125],"category_scores_gemma":[0.0046590045,0.00076614495,0.0005816812,0.0015585093,0.0017410632,0.0015574049,0.0025111183,0.0019272766,0.0010115992],"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.000196409,0.00008492357,0.0014813809,0.000256008,0.000021510861,0.00043301957,0.0009669458,0.13827138,0.018145986,0.6393994,0.0045802025,0.19616292],"study_design_scores_gemma":[0.000040922667,0.00010473405,0.00076995837,0.00015003105,0.00003318332,0.0006317494,0.0005996236,0.6171454,0.014986835,0.31931382,0.04618441,0.000039381976],"about_ca_topic_score_codex":0.0012313542,"about_ca_topic_score_gemma":0.0017975662,"teacher_disagreement_score":0.0044842125,"about_ca_system_score_codex":0.00048529828,"about_ca_system_score_gemma":0.00041914833,"threshold_uncertainty_score":0.015001178},"labels":[],"label_agreement":null},{"id":"W2961715688","doi":"10.1007/s00454-022-00477-7","title":"Dense Graphs Have Rigid Parts","year":2023,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Structural Analysis and Optimization","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":"Mathematics; Combinatorics; Embedding; Omega; Line graph; Infinitesimal; Connection (principal bundle); Discrete mathematics; Graph; Rigidity (electromagnetism); Computer science; Geometry","score_opus":0.010170556963319864,"score_gpt":0.23226853770417377,"score_spread":0.2220979807408539,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2961715688","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21112362,0.00094344676,0.5621836,0.0023261982,0.00066994404,0.00028434576,0.0017541967,0.0016933186,0.21902132],"genre_scores_gemma":[0.8556086,0.0007600717,0.07143148,0.00143725,0.00028859495,0.00024934378,0.0020903116,0.00082965236,0.06730469],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990976,0.00012659981,0.000030975163,0.0003344383,0.00022862521,0.00018176765],"domain_scores_gemma":[0.9970919,0.00089875207,0.0003033125,0.00083518756,0.0004483091,0.00042246285],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035906167,0.0010904418,0.0010533736,0.0018962754,0.0020383582,0.0022338128,0.0013380361,0.0018764408,0.023623582],"category_scores_gemma":[0.0031565726,0.0012323644,0.0010191168,0.0013992744,0.0027658488,0.004620421,0.0028034295,0.0029696939,0.004531083],"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.00008366025,0.000063078674,0.0005986731,0.00013711928,0.000028737457,0.0002545392,0.00040601534,0.00445967,0.0035215395,0.96396935,0.0065131993,0.019964384],"study_design_scores_gemma":[0.000020354191,0.000038090155,0.00058728125,0.000029204426,0.000023310395,0.00033237986,0.00028556204,0.0072800056,0.0019205572,0.9796072,0.009859635,0.00001644318],"about_ca_topic_score_codex":0.0016141982,"about_ca_topic_score_gemma":0.0025122962,"teacher_disagreement_score":0.023623582,"about_ca_system_score_codex":0.00064401946,"about_ca_system_score_gemma":0.00051631854,"threshold_uncertainty_score":0.079028785},"labels":[],"label_agreement":null},{"id":"W2963622148","doi":"10.1007/s00454-022-00414-8","title":"Combinatorial Properties and Recognition of Unit Square Visibility Graphs","year":2023,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada; Lorentz Center; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; Deutsche Forschungsgemeinschaft","keywords":"Unit square; Combinatorics; Visibility; Algorithm; Graph; Mathematics; Unit (ring theory); Square (algebra); Computer science; Geometry; Physics","score_opus":0.05925306103931311,"score_gpt":0.30829910793677706,"score_spread":0.24904604689746396,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963622148","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5997558,0.0006327673,0.3664831,0.0010552983,0.000114867646,0.00013885855,0.0013236892,0.0013280788,0.02916758],"genre_scores_gemma":[0.9542775,0.00017421435,0.04058401,0.00011473212,0.000045352837,0.00006401902,0.0013730623,0.00012054432,0.003246556],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987205,0.00022512821,0.00009305706,0.00043709783,0.0002852596,0.00023891112],"domain_scores_gemma":[0.99546427,0.002026761,0.0008678308,0.0008644211,0.00040317967,0.00037349915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035650012,0.0004936302,0.00051685184,0.0008267798,0.0005975301,0.0029990603,0.0013867558,0.0009847793,0.0059556775],"category_scores_gemma":[0.0049619153,0.00047862288,0.00069589535,0.0015750973,0.0015856955,0.0031106537,0.0016388037,0.0013238582,0.0006693779],"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.000720475,0.00031158762,0.013538151,0.0006082017,0.00010470885,0.0012783123,0.0010168396,0.19253477,0.04673108,0.564196,0.016827852,0.16213207],"study_design_scores_gemma":[0.00006408396,0.00015650528,0.005147332,0.00005927436,0.000045046272,0.0012083092,0.00060624216,0.3467925,0.020896446,0.6116014,0.013366164,0.000056693054],"about_ca_topic_score_codex":0.0020286061,"about_ca_topic_score_gemma":0.0015822976,"teacher_disagreement_score":0.0059556775,"about_ca_system_score_codex":0.000724755,"about_ca_system_score_gemma":0.00044230133,"threshold_uncertainty_score":0.019923687},"labels":[],"label_agreement":null},{"id":"W3006212172","doi":"10.1007/s00454-022-00398-5","title":"Drawing Graphs as Spanners","year":2022,"lang":"en","type":"article","venue":"Discrete & 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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"H2020 Marie Skłodowska-Curie Actions; Natural Sciences and Engineering Research Council of Canada; Ministero dell’Istruzione, dell’Università e della Ricerca","keywords":"Combinatorics; Mathematics; Planar graph; Vertex (graph theory); Spanning tree; Graph; Discrete mathematics","score_opus":0.010740796446093335,"score_gpt":0.2541017257448844,"score_spread":0.24336092929879105,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3006212172","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031951908,0.00032819094,0.91506016,0.0003486565,0.0002423832,0.00014106948,0.00034714656,0.002046233,0.049534332],"genre_scores_gemma":[0.35068882,0.00097336865,0.5950853,0.00032138109,0.0001277358,0.00020485221,0.0012257526,0.0014822658,0.049890514],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999585,0.000095354946,0.000020822856,0.00012663308,0.00013415831,0.000037985214],"domain_scores_gemma":[0.999516,0.00016311598,0.000033824457,0.00012620901,0.00008699054,0.00007384517],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029804368,0.0008404856,0.0005215547,0.0013281722,0.00063666736,0.0017360342,0.0011591022,0.001008199,0.024202442],"category_scores_gemma":[0.0015906609,0.00069735723,0.0006436626,0.0012663233,0.0008360011,0.002761396,0.002173525,0.0016074306,0.004021655],"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.00013978867,0.00008486475,0.00050151034,0.00026033007,0.000050695016,0.00035799175,0.00063120277,0.059303354,0.01799445,0.66360915,0.015595022,0.24147163],"study_design_scores_gemma":[0.00003813687,0.00011298062,0.00029543278,0.000109204855,0.000047433816,0.00032325363,0.00033931396,0.18956733,0.013328572,0.70208436,0.09372502,0.000028937893],"about_ca_topic_score_codex":0.00082499493,"about_ca_topic_score_gemma":0.0016293654,"teacher_disagreement_score":0.024202442,"about_ca_system_score_codex":0.00048396277,"about_ca_system_score_gemma":0.00025226007,"threshold_uncertainty_score":0.08096522},"labels":[],"label_agreement":null},{"id":"W3014654089","doi":"10.1007/s00454-020-00252-6","title":"On Arithmetic Progressions in Model Sets","year":2021,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Quasicrystal Structures and Properties","field":"Materials Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"MacEwan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Van der Waerden's theorem; Mathematics; Arithmetic; Arithmetic progression; Point (geometry); Space (punctuation); Second-order arithmetic; Type (biology); Euclidean space; Discrete mathematics; Combinatorics; Computer science; Peano axioms; Geometry","score_opus":0.016726087211784,"score_gpt":0.280398203943213,"score_spread":0.26367211673142904,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3014654089","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22502333,0.0044000093,0.40582386,0.0075368537,0.0013287149,0.00016940848,0.000997479,0.0005911668,0.35412914],"genre_scores_gemma":[0.9057586,0.0023074867,0.045224372,0.00088544725,0.00072607846,0.00021034344,0.0006510928,0.0002816841,0.043954875],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990619,0.00031598262,0.000057389014,0.0001481221,0.0002612802,0.00015534495],"domain_scores_gemma":[0.997614,0.0015885739,0.00018233551,0.00027059414,0.00019435059,0.0001501411],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013718689,0.0011088612,0.001356449,0.0023972634,0.0024365878,0.0042925896,0.001746658,0.0016666047,0.01508573],"category_scores_gemma":[0.005203137,0.00063073257,0.0015647083,0.0027523362,0.005220252,0.009313061,0.0032486322,0.004062909,0.0014915762],"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.000004091503,0.0000030137164,0.000013179413,0.000007679151,8.272622e-7,0.000009260176,0.000048514394,0.00046311747,0.000034050776,0.9983468,0.0002713032,0.00079817587],"study_design_scores_gemma":[0.000003359763,0.0000034586928,0.000015607706,0.000007318262,0.0000011233691,0.00001296773,0.000020632651,0.0016665695,0.00003573754,0.9972434,0.000986882,0.0000029021471],"about_ca_topic_score_codex":0.0017206986,"about_ca_topic_score_gemma":0.0013931473,"teacher_disagreement_score":0.01508573,"about_ca_system_score_codex":0.0022766385,"about_ca_system_score_gemma":0.0008591523,"threshold_uncertainty_score":0.050466776},"labels":[],"label_agreement":null},{"id":"W3027661369","doi":"10.1007/s00454-022-00456-y","title":"Combinatorics of Intervals in the Plane I: Trapezoids","year":2022,"lang":"en","type":"article","venue":"Discrete & 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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Horizon 2020; Hungarian Scientific Research Fund","keywords":"Mathematics; Combinatorics; Plane (geometry); Geometry","score_opus":0.015129094553496807,"score_gpt":0.25696632915018014,"score_spread":0.24183723459668333,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3027661369","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.283895,0.002334808,0.55342466,0.0010346211,0.00047302296,0.00017250743,0.0013791997,0.00065224426,0.15663402],"genre_scores_gemma":[0.84242165,0.0021110387,0.12573515,0.00029260485,0.00025518378,0.00019993137,0.0009595534,0.000390316,0.027634565],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99905866,0.00014252585,0.000108282766,0.00022982761,0.00032516615,0.00013557772],"domain_scores_gemma":[0.99808705,0.0008011471,0.0003455784,0.00033271336,0.00022191345,0.00021172504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000656656,0.00049581024,0.0010181158,0.0021010241,0.0012581,0.005761719,0.0013708025,0.0007119998,0.010572105],"category_scores_gemma":[0.0032889848,0.00076460815,0.0012059319,0.003015838,0.0022522532,0.0030272708,0.002090226,0.0020722758,0.0016828481],"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.00005249809,0.000016696968,0.00045969326,0.00006646242,0.00001200719,0.00013909198,0.00027081402,0.0030873562,0.0011578255,0.97893035,0.0018148039,0.013992324],"study_design_scores_gemma":[0.000033528864,0.000034000986,0.00040306474,0.00006306755,0.0000273017,0.00041641464,0.00044673146,0.011365246,0.0014691389,0.9672209,0.018493399,0.000027115651],"about_ca_topic_score_codex":0.0011635653,"about_ca_topic_score_gemma":0.00083350384,"teacher_disagreement_score":0.010572105,"about_ca_system_score_codex":0.0010089321,"about_ca_system_score_gemma":0.00041213832,"threshold_uncertainty_score":0.03536719},"labels":[],"label_agreement":null},{"id":"W3033185809","doi":"10.1007/s00454-020-00209-9","title":"An Exploration of Locally Spherical Regular Hypertopes","year":2020,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Geometric and Algebraic Topology","field":"Mathematics","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Mathematics; Coxeter group; Type (biology); Euclidean geometry; Pure mathematics; Quotient; Combinatorics; Geometry","score_opus":0.07086811436417499,"score_gpt":0.32146930646580785,"score_spread":0.25060119210163284,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3033185809","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37384003,0.00521503,0.26276436,0.004651895,0.0003136852,0.00008897919,0.00069194176,0.00039321734,0.35204083],"genre_scores_gemma":[0.93812597,0.0022361379,0.03273374,0.0002639848,0.0002570608,0.000043454824,0.00035826123,0.00021763994,0.025763702],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997259,0.00010153645,0.000008631956,0.000040913703,0.00008379254,0.00003932877],"domain_scores_gemma":[0.9995553,0.0002026698,0.000047440502,0.000049059985,0.000059250826,0.000086337466],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040486688,0.0005507549,0.0005484968,0.0011787978,0.000889173,0.0027282382,0.0008858522,0.0007535,0.010269306],"category_scores_gemma":[0.0016592123,0.0003553568,0.0004888265,0.00088899385,0.0022487263,0.002891952,0.0018773307,0.0013315717,0.00088712975],"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.000015525495,0.0000053647823,0.00009327023,0.000034513905,0.000003958184,0.000079467005,0.00020537314,0.0042428584,0.00037129238,0.99126434,0.0007820999,0.002902007],"study_design_scores_gemma":[0.000009661987,0.00001549613,0.00016298852,0.000020984307,0.000004195485,0.00018762081,0.00041431948,0.019914495,0.0001895421,0.97059727,0.008475069,0.000008343909],"about_ca_topic_score_codex":0.0011262199,"about_ca_topic_score_gemma":0.0011506057,"teacher_disagreement_score":0.010269306,"about_ca_system_score_codex":0.0008466049,"about_ca_system_score_gemma":0.00033053002,"threshold_uncertainty_score":0.03435427},"labels":[],"label_agreement":null},{"id":"W3037874269","doi":"10.1007/s00454-017-9873-z","title":"Primitive Zonotopes","year":2017,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Matroid; Polytope; Convex hull; Generalization; Dimension (graph theory); Regular polygon; Set (abstract data type); Discrete mathematics; Computer science; Geometry","score_opus":0.054717281068247824,"score_gpt":0.3767638090998506,"score_spread":0.3220465280316028,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3037874269","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21441466,0.0008742462,0.12084504,0.002271596,0.0012167433,0.00014464936,0.0009912299,0.00078676076,0.6584551],"genre_scores_gemma":[0.7695199,0.00086140796,0.02553305,0.00074782455,0.00053405226,0.00013102524,0.0007907899,0.0005329182,0.20134899],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99958783,0.00004571268,0.000015658296,0.00008968162,0.00014695594,0.000114221504],"domain_scores_gemma":[0.99955136,0.00007690526,0.000058474587,0.00006955375,0.00011097892,0.0001327313],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025771582,0.00074094714,0.0007949224,0.0027410213,0.002504628,0.0027742642,0.0008988592,0.00093643396,0.028944634],"category_scores_gemma":[0.0010722537,0.00041805618,0.0005977967,0.0013928966,0.0026945407,0.0033812614,0.0028131665,0.003439498,0.0042911996],"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.000013850007,0.0000049362725,0.00003945914,0.000010623504,0.0000021396665,0.000025719195,0.000048767648,0.00011784289,0.00042574396,0.9948716,0.0014985994,0.0029405693],"study_design_scores_gemma":[0.000015484617,0.000013691842,0.00022860055,0.000010576704,0.0000056237573,0.00018993611,0.00008178911,0.0012157557,0.00058224134,0.97975624,0.017889738,0.000010468566],"about_ca_topic_score_codex":0.00089108554,"about_ca_topic_score_gemma":0.0010537107,"teacher_disagreement_score":0.028944634,"about_ca_system_score_codex":0.0010243498,"about_ca_system_score_gemma":0.0006035641,"threshold_uncertainty_score":0.096829474},"labels":[],"label_agreement":null},{"id":"W3089577182","doi":"10.1007/s00454-003-0012-9","title":"Unavoidable Configurations in Complete Topological Graphs","year":2003,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":38,"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":"Eidgenössische Technische Hochschule Zürich; Deutsche Forschungsgemeinschaft; Hungarian Scientific Research Fund; City University of New York; National Science Foundation","keywords":"Mathematics; Combinatorics; Topological graph; Discrete mathematics; Induced subgraph; Path graph; Graph homomorphism; Topological graph theory; Graph; Topology (electrical circuits); Line graph; Pathwidth; Graph power; Vertex (graph theory)","score_opus":0.022634841835219056,"score_gpt":0.2668587935351035,"score_spread":0.24422395169988445,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3089577182","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.69236916,0.00079281203,0.23331189,0.0014230837,0.00024819208,0.000089469075,0.0004493505,0.00055434625,0.0707616],"genre_scores_gemma":[0.9645823,0.00034276355,0.025640737,0.0001786972,0.0001314316,0.00010757479,0.00041334276,0.00016599988,0.008437151],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987476,0.00031735617,0.000068823625,0.0002945673,0.00035787944,0.00021379172],"domain_scores_gemma":[0.9956691,0.0022247352,0.0006011969,0.0004717845,0.00030552637,0.0007276905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001025272,0.0007606047,0.0011349206,0.0028342623,0.0028652302,0.0030493059,0.0021662351,0.0019230198,0.008094205],"category_scores_gemma":[0.006367953,0.0012059388,0.0009306095,0.0020341268,0.004019795,0.005718926,0.003901064,0.003809051,0.00064748956],"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.000043560216,0.000020393278,0.00038889315,0.000048171445,0.000008948931,0.00015415362,0.0003291475,0.0056376406,0.000491711,0.98951095,0.0006917844,0.0026746197],"study_design_scores_gemma":[0.000010705062,0.000016146152,0.00020716188,0.000012175138,0.000008329561,0.00011263207,0.00019028598,0.00822464,0.00030290164,0.98980975,0.0010968529,0.000008278007],"about_ca_topic_score_codex":0.00076343084,"about_ca_topic_score_gemma":0.0013816567,"teacher_disagreement_score":0.008094205,"about_ca_system_score_codex":0.001185294,"about_ca_system_score_gemma":0.00053313107,"threshold_uncertainty_score":0.027077794},"labels":[],"label_agreement":null},{"id":"W3125391957","doi":"10.1007/s00454-008-9114-6","title":"Minimizing the Stabbing Number of Matchings, Trees, and Triangulations","year":2008,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Deutsche Forschungsgemeinschaft","keywords":"Spanning tree; Linear programming relaxation; Iterated function; Rounding; Conjecture; Minimum spanning tree; Upper and lower bounds; Relaxation (psychology); Integer programming","score_opus":0.020425895085397095,"score_gpt":0.2681112469458681,"score_spread":0.24768535186047097,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3125391957","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10393897,0.0009739418,0.8790023,0.0005623722,0.0001318542,0.00010494795,0.00025494242,0.0010888623,0.013941889],"genre_scores_gemma":[0.39263755,0.0007158448,0.58778125,0.00012992033,0.00006619349,0.00014327263,0.0005196902,0.000753684,0.017252618],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988871,0.0003087099,0.000056496723,0.00019853875,0.00036998512,0.00017918905],"domain_scores_gemma":[0.996765,0.0016374558,0.00027340712,0.00065486925,0.00042776126,0.00024145887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013079988,0.0009567715,0.0015307415,0.001621746,0.0009415932,0.0015530667,0.0021226974,0.0022023963,0.010213609],"category_scores_gemma":[0.009880927,0.0008098388,0.0007695884,0.0023149247,0.001085284,0.0035509497,0.001710515,0.0015406675,0.0019453585],"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.0007164179,0.00019986877,0.001765324,0.00041587115,0.000060966235,0.000111999725,0.00019350027,0.50754696,0.014433908,0.117851004,0.012671691,0.3440326],"study_design_scores_gemma":[0.000033287724,0.00013501087,0.00040977297,0.00003337517,0.000025406114,0.000093316434,0.00007590408,0.91185033,0.0039229,0.079648495,0.0037581879,0.0000141640085],"about_ca_topic_score_codex":0.0029447302,"about_ca_topic_score_gemma":0.0057526077,"teacher_disagreement_score":0.010213609,"about_ca_system_score_codex":0.001332744,"about_ca_system_score_gemma":0.0013380074,"threshold_uncertainty_score":0.034167945},"labels":[],"label_agreement":null},{"id":"W3147681132","doi":"10.1007/s00454-002-2840-2","title":"On Levels in Arrangements of Curves","year":2003,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":40,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Mathematical proof; Upper and lower bounds; Pairwise comparison; Degree (music); Simple (philosophy); Planar; Polynomial; Planar graph; Discrete mathematics; Geometry; Graph; Mathematical analysis; Computer science","score_opus":0.022735473511496646,"score_gpt":0.28101257274923647,"score_spread":0.25827709923773984,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3147681132","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22356802,0.001612593,0.6254859,0.0015449823,0.0007810795,0.00015794959,0.00044825487,0.0007839452,0.14561725],"genre_scores_gemma":[0.772108,0.0013804807,0.16695283,0.00035459187,0.0002947072,0.00013414466,0.00055821805,0.00056719413,0.057649694],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993389,0.00017360944,0.000040586645,0.000117147036,0.0001936395,0.0001361172],"domain_scores_gemma":[0.99911267,0.00032447896,0.00010243364,0.00015158155,0.00014581403,0.00016305778],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049852,0.0005883676,0.0007601489,0.0020975121,0.0015861478,0.003037149,0.0011775526,0.0013480136,0.014394487],"category_scores_gemma":[0.0033657248,0.0007378208,0.0007682622,0.0015979267,0.0026757417,0.003506991,0.0030641875,0.0023754272,0.0025130396],"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.000027819462,0.000011607765,0.0002867422,0.00003665151,0.0000054556945,0.00006840941,0.00029405762,0.005553664,0.0007849011,0.9769693,0.0017576097,0.014203732],"study_design_scores_gemma":[0.000010293809,0.000020860647,0.00016688828,0.000029421904,0.0000050641024,0.00006775029,0.0002172722,0.0146454265,0.0003648093,0.974337,0.010126612,0.00000860226],"about_ca_topic_score_codex":0.0015579803,"about_ca_topic_score_gemma":0.0019402752,"teacher_disagreement_score":0.014394487,"about_ca_system_score_codex":0.0010123232,"about_ca_system_score_gemma":0.00035593304,"threshold_uncertainty_score":0.048154354},"labels":[],"label_agreement":null},{"id":"W3151759838","doi":"10.1007/s00454-002-0793-0","title":"A Helly-Type Theorem for Line Transversals to Disjoint Unit Balls","year":2003,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":30,"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 Alberta","funders":"","keywords":"Transversal (combinatorics); Disjoint sets; Combinatorics; Mathematics; Unit (ring theory); Line (geometry); Order (exchange); Type (biology); Discrete mathematics; Geometry; Mathematical analysis","score_opus":0.01665846638318672,"score_gpt":0.24972540014439143,"score_spread":0.23306693376120471,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3151759838","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20001382,0.0015098585,0.69524413,0.006011757,0.0007747709,0.0001342519,0.00084101787,0.00050618756,0.094964236],"genre_scores_gemma":[0.8365103,0.002703585,0.09172624,0.0023516116,0.0013054832,0.00040847855,0.0010941778,0.00049098406,0.063409105],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988514,0.00028897534,0.00006611416,0.00032102416,0.0002582879,0.00021420867],"domain_scores_gemma":[0.9946302,0.003027784,0.0005175733,0.0005031431,0.0006666628,0.00065457914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017510919,0.0010301763,0.0013478923,0.003222371,0.0031665494,0.004181136,0.0021144073,0.0019837494,0.012564559],"category_scores_gemma":[0.0077822516,0.0011815414,0.002058909,0.0027055137,0.0048382757,0.014021269,0.0064665982,0.0073601585,0.0012337515],"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.000041217314,0.00001309121,0.00017020825,0.000042608874,0.000011807247,0.000038181457,0.00026129442,0.00060803257,0.00040974113,0.99386674,0.0015491839,0.002987939],"study_design_scores_gemma":[0.000023101324,0.000022154842,0.00018599852,0.000014110355,0.000017117518,0.00007851143,0.00013998018,0.0028949343,0.00035226037,0.9927901,0.0034676949,0.000014053361],"about_ca_topic_score_codex":0.0014002476,"about_ca_topic_score_gemma":0.0009678823,"teacher_disagreement_score":0.012564559,"about_ca_system_score_codex":0.0018767723,"about_ca_system_score_gemma":0.0006676074,"threshold_uncertainty_score":0.04203266},"labels":[],"label_agreement":null},{"id":"W3183234265","doi":"10.1007/s00454-021-00312-5","title":"The Facial Weak Order on Hyperplane Arrangements","year":2021,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"Fonds de recherche du Québec – Nature et technologies; Natural Sciences and Engineering Research Council of Canada; Agence Nationale de la Recherche","keywords":"Partially ordered set; Hyperplane; Mathematics; Homotopy; Combinatorics; Matroid; Lattice (music); Hasse diagram; Coxeter group; Order (exchange); Abstract simplicial complex; Bruhat order; Simplicial complex; Pure mathematics; Discrete mathematics","score_opus":0.030876229036849813,"score_gpt":0.325907049815962,"score_spread":0.2950308207791122,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3183234265","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5879599,0.00087967876,0.09790478,0.002754535,0.000675267,0.000077081524,0.00066988746,0.00021678166,0.30886206],"genre_scores_gemma":[0.92554647,0.0008132618,0.0096568335,0.00043860008,0.00047315017,0.00006187768,0.00039876555,0.00015499805,0.062456045],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995628,0.00008149895,0.000024218038,0.00007792356,0.00011918717,0.00013443019],"domain_scores_gemma":[0.9991404,0.00026556928,0.00013596952,0.00010696029,0.00015687142,0.0001941796],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044982388,0.0005776957,0.00074001285,0.0019029748,0.0021282032,0.003161475,0.00080004893,0.0008831767,0.012498459],"category_scores_gemma":[0.0018129573,0.00046661115,0.0005425696,0.0012057424,0.0033141437,0.0051192828,0.0021153642,0.002841492,0.0013728034],"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.000035396843,0.00000945271,0.00020363803,0.000013540809,0.0000023248742,0.00003848151,0.00015958527,0.00040286375,0.0004367518,0.9922086,0.001110763,0.0053786244],"study_design_scores_gemma":[0.0000072127687,0.000016110378,0.00030858623,0.000010023176,0.0000035679618,0.000056538272,0.0001349402,0.0013982719,0.00024939075,0.9948731,0.0029353397,0.0000067846213],"about_ca_topic_score_codex":0.0025811251,"about_ca_topic_score_gemma":0.0025258234,"teacher_disagreement_score":0.012498459,"about_ca_system_score_codex":0.0013401136,"about_ca_system_score_gemma":0.00055113115,"threshold_uncertainty_score":0.041811526},"labels":[],"label_agreement":null},{"id":"W3208469348","doi":"10.1007/s00454-023-00493-1","title":"Diversities and the Generalized Circumradius","year":2023,"lang":"lv","type":"article","venue":"Discrete & Computational Geometry","topic":"Point processes and geometric inequalities","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; Royal Society","keywords":"Algorithm; Artificial intelligence; Computer science; Mathematics","score_opus":0.03735579974253639,"score_gpt":0.29641268359058087,"score_spread":0.2590568838480445,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3208469348","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6768404,0.0034737175,0.18959142,0.0016240047,0.00025097546,0.00012731389,0.0010270091,0.00064965483,0.12641537],"genre_scores_gemma":[0.9604881,0.0005228942,0.025398528,0.00014853645,0.00013649801,0.00007779069,0.00051404885,0.00016602503,0.0125476],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99884367,0.00021554493,0.000067104345,0.0003638617,0.00035894275,0.00015074939],"domain_scores_gemma":[0.9979297,0.0004628145,0.0005525349,0.00021820203,0.00039484724,0.00044188419],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009199068,0.0005796565,0.00096436794,0.0035615393,0.0016366169,0.003497218,0.0009166311,0.0009892748,0.013064703],"category_scores_gemma":[0.0050879046,0.0004467591,0.0005885482,0.0020870436,0.005432459,0.0029741332,0.0027597148,0.0016097395,0.001586215],"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.000215351,0.00003510423,0.0054525672,0.00014367663,0.000037561407,0.00037696684,0.00057540607,0.01645664,0.0047606584,0.9109932,0.0031142384,0.057838704],"study_design_scores_gemma":[0.000045276618,0.000164062,0.010450797,0.00021734413,0.000032995056,0.0011357239,0.0010653962,0.055228475,0.0029961285,0.8959619,0.032619547,0.00008235634],"about_ca_topic_score_codex":0.0029058217,"about_ca_topic_score_gemma":0.0030198009,"teacher_disagreement_score":0.013064703,"about_ca_system_score_codex":0.0016151789,"about_ca_system_score_gemma":0.0005506266,"threshold_uncertainty_score":0.04370582},"labels":[],"label_agreement":null},{"id":"W3216262330","doi":"10.1007/s00454-023-00486-0","title":"Acute Tours in the Plane","year":2023,"lang":"en","type":"preprint","venue":"Discrete & 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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Conjecture; Combinatorics; Mathematics; Constructive; Constructive proof; Upper and lower bounds; Plane (geometry); Hamiltonian path; Hamiltonian (control theory); Simple (philosophy); Line (geometry); Discrete mathematics; Geometry; Mathematical analysis; Computer science; Mathematical optimization; Graph","score_opus":0.03301147917995095,"score_gpt":0.3027844184221456,"score_spread":0.26977293924219464,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3216262330","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38345495,0.0013125548,0.24275263,0.0027603025,0.0006241387,0.00037514808,0.0026051318,0.00075044215,0.36536467],"genre_scores_gemma":[0.68297017,0.0016137903,0.10950641,0.00041900834,0.00019216338,0.00021605921,0.0035246524,0.00084040046,0.20071729],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997576,0.00004871341,0.000010319472,0.000044285887,0.00006572164,0.00007339536],"domain_scores_gemma":[0.9993844,0.00019622249,0.00008561746,0.00005542215,0.00013018736,0.00014809787],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017682825,0.0005166939,0.00049191056,0.0010912124,0.0017878889,0.0026818234,0.00076066697,0.0009544138,0.030907843],"category_scores_gemma":[0.0017288357,0.00046424998,0.00050082116,0.00079602306,0.0013099231,0.0019355245,0.0020047238,0.0022005413,0.0046436195],"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.00026159713,0.000051235984,0.000859602,0.0001439154,0.000012840637,0.00040137884,0.0006183945,0.012322693,0.0027077098,0.9393558,0.018826958,0.02443788],"study_design_scores_gemma":[0.00008102184,0.000062773535,0.0010614899,0.000094971874,0.000013891718,0.0005305906,0.0013328732,0.04876635,0.0018496239,0.8842103,0.0619686,0.000027448872],"about_ca_topic_score_codex":0.002962112,"about_ca_topic_score_gemma":0.004084311,"teacher_disagreement_score":0.030907843,"about_ca_system_score_codex":0.0010203909,"about_ca_system_score_gemma":0.00054044207,"threshold_uncertainty_score":0.10339701},"labels":[],"label_agreement":null},{"id":"W4233454535","doi":"10.1007/s00454-009-9165-3","title":"Dynamic Coresets","year":2009,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Constant (computer programming); Bounded function; Dimension (graph theory); Amortized analysis; Integer (computer science); Binary logarithm; Bounding overwatch; Annulus (botany); Discrete mathematics; Data structure; Mathematical analysis; Computer science","score_opus":0.01138252880161875,"score_gpt":0.27628883777066476,"score_spread":0.264906308969046,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4233454535","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17783034,0.00097262143,0.30260938,0.0036036638,0.00088220584,0.00038287902,0.0036294088,0.001662036,0.50842744],"genre_scores_gemma":[0.75179607,0.0009236557,0.052241985,0.0010017963,0.00042150996,0.0003575873,0.004814043,0.0008765182,0.1875669],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99903893,0.00010803771,0.00003689502,0.00031847425,0.0002562038,0.00024146473],"domain_scores_gemma":[0.9982886,0.0003564883,0.0001248383,0.0005690319,0.00033038203,0.0003307181],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048473172,0.0007117871,0.00085922313,0.0013137101,0.0021087986,0.003050286,0.001390881,0.0010589649,0.043972272],"category_scores_gemma":[0.0032569852,0.000508597,0.0007369568,0.001419883,0.0015159624,0.006530458,0.0038061047,0.0027020073,0.0056897714],"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.000104140956,0.000058421843,0.0003740569,0.000055681903,0.00001260754,0.00009633843,0.00012127855,0.003120426,0.0011359595,0.9598263,0.012877916,0.022216795],"study_design_scores_gemma":[0.00002708009,0.000025603851,0.00024034994,0.000024627376,0.000013551149,0.00020327936,0.00018414794,0.0147188045,0.0013388895,0.9420692,0.041143246,0.000011209692],"about_ca_topic_score_codex":0.0010414217,"about_ca_topic_score_gemma":0.0016600514,"teacher_disagreement_score":0.043972272,"about_ca_system_score_codex":0.0011563997,"about_ca_system_score_gemma":0.0010106156,"threshold_uncertainty_score":0.14710194},"labels":[],"label_agreement":null},{"id":"W4239171964","doi":"10.1007/s00454-011-9347-7","title":"Cache-Oblivious Range Reporting with Optimal Queries Requires Superlinear Space","year":2011,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Killam Trusts; Dalhousie University; Canada Research Chairs","keywords":"Computer science; Cache; Range (aeronautics); Space (punctuation); Information retrieval; Parallel computing; Materials science; Operating system","score_opus":0.03748508906001073,"score_gpt":0.2570956064961202,"score_spread":0.21961051743610943,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4239171964","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11911189,0.0074109677,0.76529735,0.016962575,0.0015168566,0.0008264619,0.0059889546,0.043510143,0.03937488],"genre_scores_gemma":[0.72850543,0.0016128214,0.24198167,0.0027596701,0.0009828192,0.00065525534,0.0040702634,0.0027632385,0.016668832],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.97686654,0.0046322932,0.001752404,0.0034370925,0.009214704,0.0040969593],"domain_scores_gemma":[0.9204253,0.036559094,0.0034732325,0.034750283,0.003415404,0.0013767623],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0063548684,0.0030751256,0.005232658,0.002183962,0.0025221533,0.008222489,0.007276564,0.0039535123,0.024048101],"category_scores_gemma":[0.04149289,0.0018330493,0.0025752406,0.009408274,0.0035061731,0.026077682,0.009014489,0.005931755,0.008216751],"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.010679143,0.0021829843,0.008699586,0.0022993127,0.00077810197,0.00073961075,0.0013999039,0.15950069,0.038561907,0.0968738,0.14427903,0.5340058],"study_design_scores_gemma":[0.0009550135,0.00046353074,0.0016680289,0.00015083958,0.00046528864,0.00094584445,0.0008514289,0.76244634,0.023061125,0.19656852,0.012279099,0.00014489482],"about_ca_topic_score_codex":0.0072537246,"about_ca_topic_score_gemma":0.011165311,"teacher_disagreement_score":0.024048101,"about_ca_system_score_codex":0.0051015727,"about_ca_system_score_gemma":0.010945594,"threshold_uncertainty_score":0.080448866},"labels":[],"label_agreement":null},{"id":"W4244357043","doi":"10.1007/s00454-020-00214-y","title":"Guest Editors’ Foreword","year":2020,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Finite Group Theory Research","field":"Mathematics","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":"Combinatorics; Mathematics; Computer science","score_opus":0.08438889554617592,"score_gpt":0.35436734199834435,"score_spread":0.26997844645216845,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4244357043","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000090696405,0.0055509717,0.00019113794,0.042876955,0.9414114,0.000020057607,0.00009515476,0.00009648617,0.009667103],"genre_scores_gemma":[0.0017106048,0.004807162,0.00022734606,0.033825755,0.86169803,0.00006493572,0.00014032015,0.00019440636,0.0973315],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9980028,0.00026037596,0.00018252981,0.00033858014,0.0009200166,0.00029565158],"domain_scores_gemma":[0.99013066,0.0018760449,0.0007302202,0.0004972266,0.0038516212,0.0029141726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003038706,0.0016349863,0.0014598978,0.0022019865,0.002029788,0.00661775,0.0019094779,0.0058858795,0.106456526],"category_scores_gemma":[0.016268332,0.00058378966,0.0010419904,0.001007571,0.0009341082,0.0034678355,0.0033279131,0.009317092,0.061523266],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020051328,0.000005536373,0.000021570875,0.00005767399,0.000002977333,0.000041815234,0.000008200485,0.00001166804,0.000053056785,0.00048912613,0.9915283,0.007760111],"study_design_scores_gemma":[0.000017507633,0.000019349378,0.00013970974,0.00012530753,0.00000667367,0.000107361266,0.000026029067,0.000043782882,0.00009402202,0.00070462737,0.99870837,0.000007262386],"about_ca_topic_score_codex":0.00068771513,"about_ca_topic_score_gemma":0.0014824322,"teacher_disagreement_score":0.106456526,"about_ca_system_score_codex":0.0013616774,"about_ca_system_score_gemma":0.0020860843,"threshold_uncertainty_score":0.3561325},"labels":[],"label_agreement":null},{"id":"W4250011572","doi":"10.1007/s00454-009-9177-z","title":"On Approximate Range Counting and Depth","year":2009,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":19,"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":"Mathematics; Las vegas; Range (aeronautics); Combinatorics; Tree (set theory); Expected value; Monte Carlo method; Value (mathematics); Binary logarithm; Discrete mathematics; Statistics","score_opus":0.012770673390030974,"score_gpt":0.2538683223519223,"score_spread":0.24109764896189134,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4250011572","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021622093,0.0048562656,0.9452041,0.002982729,0.0003415249,0.000109288114,0.0005643465,0.0009859584,0.023333628],"genre_scores_gemma":[0.42996907,0.006641904,0.5331175,0.0020179902,0.0016117592,0.00037519814,0.0016983735,0.0014061923,0.023162015],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9921135,0.0020920425,0.0005131739,0.0013916373,0.0028428533,0.0010469022],"domain_scores_gemma":[0.9732425,0.017984333,0.0011190276,0.0051391097,0.0017780801,0.0007369565],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0059721298,0.0022530144,0.0042021,0.005736433,0.0025776215,0.0060543073,0.007189512,0.0030832933,0.011994618],"category_scores_gemma":[0.048726298,0.0019249977,0.0029210448,0.011772483,0.006294592,0.031613912,0.0137494,0.007003354,0.001824546],"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.00038253298,0.000083871295,0.0017371562,0.00029773594,0.00006833766,0.000080462785,0.0004513803,0.044806525,0.0010315654,0.8194235,0.00999478,0.12164213],"study_design_scores_gemma":[0.000025919648,0.000036749767,0.00034033533,0.00007856079,0.00006425148,0.00014649106,0.00012399085,0.14248943,0.0011337973,0.8476839,0.007844625,0.00003180776],"about_ca_topic_score_codex":0.0057274867,"about_ca_topic_score_gemma":0.004806987,"teacher_disagreement_score":0.011994618,"about_ca_system_score_codex":0.0040131053,"about_ca_system_score_gemma":0.0020923165,"threshold_uncertainty_score":0.040126026},"labels":[],"label_agreement":null},{"id":"W4321377127","doi":"10.1007/s00454-022-00478-6","title":"Three-Dimensional Graph Products with Unbounded Stack-Number","year":2023,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"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":"Bounded function; Combinatorics; Mathematics; Upper and lower bounds; Cartesian product; Discrete mathematics; Graph; Vertex (graph theory); Degree (music)","score_opus":0.023090070453325007,"score_gpt":0.29694691226906667,"score_spread":0.27385684181574166,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4321377127","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51927304,0.0006459249,0.30541852,0.0021222231,0.0006937989,0.000096355805,0.00078489986,0.0015617966,0.16940346],"genre_scores_gemma":[0.921627,0.00039243713,0.047277458,0.0003868258,0.00018102076,0.00009319696,0.0004188278,0.00057298364,0.029050294],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99933904,0.00011831439,0.00004339839,0.00012693644,0.0002170435,0.00015530776],"domain_scores_gemma":[0.9986494,0.00037821507,0.00019313642,0.00020857292,0.00019062817,0.00038014082],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063825183,0.001073518,0.0007775338,0.002009968,0.0020926492,0.0040963134,0.0015768869,0.0016197915,0.011987703],"category_scores_gemma":[0.0023451452,0.0007076322,0.0009599221,0.0013092795,0.0033981944,0.0057001747,0.003818085,0.0023911304,0.002456699],"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.000037623464,0.000017150744,0.00013445549,0.000020669959,0.0000056457993,0.00009432055,0.00013088546,0.0012210067,0.0009392417,0.9939235,0.0008703963,0.0026050902],"study_design_scores_gemma":[0.000011244081,0.0000125676515,0.00012977126,0.000010849273,0.000007280573,0.00014862875,0.000080063204,0.0068631545,0.0011066634,0.9886545,0.0029575047,0.000017636075],"about_ca_topic_score_codex":0.0012488145,"about_ca_topic_score_gemma":0.001582391,"teacher_disagreement_score":0.011987703,"about_ca_system_score_codex":0.0011966309,"about_ca_system_score_gemma":0.0008036945,"threshold_uncertainty_score":0.0401029},"labels":[],"label_agreement":null},{"id":"W4377989629","doi":"10.1007/s00454-023-00515-y","title":"Concyclic Intervals in the Plane","year":2023,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Mathematics and Applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Killam Trusts","keywords":"Quartic function; Mathematics; Combinatorics; Plane (geometry); Interval (graph theory); Set (abstract data type); Algebraic number; Quartic plane curve; Algebraic curve; Discrete mathematics; Pure mathematics; Geometry; Mathematical analysis; Computer science","score_opus":0.07059271642983628,"score_gpt":0.3714161703885655,"score_spread":0.3008234539587292,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4377989629","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55304706,0.00475952,0.08855216,0.0020677939,0.0004095308,0.000094640214,0.0013383034,0.0002452684,0.3494857],"genre_scores_gemma":[0.9656944,0.0019222925,0.009502444,0.00027671497,0.0002707845,0.000041902083,0.00060006964,0.000043729957,0.021647556],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99963784,0.00006720991,0.000017422197,0.00007916741,0.000116491705,0.00008179402],"domain_scores_gemma":[0.9985719,0.00058976555,0.00030649744,0.00009629471,0.00023201041,0.0002034632],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030460372,0.0003707842,0.0005051021,0.001533244,0.0010200697,0.002597972,0.00069969916,0.00052215066,0.0072970903],"category_scores_gemma":[0.0020859642,0.00031042696,0.00023487052,0.0018578502,0.0017377704,0.0016091724,0.0011523712,0.0019497835,0.00090248534],"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.00013309953,0.000014485211,0.0002701796,0.00004820366,0.0000068444506,0.000085691645,0.00014530767,0.0018549277,0.00068876543,0.9855762,0.0023328683,0.008843473],"study_design_scores_gemma":[0.00007380957,0.000052853506,0.0009424183,0.000030005851,0.0000138177775,0.00030905494,0.00025648176,0.007300106,0.0009902408,0.9736094,0.016404927,0.000016937389],"about_ca_topic_score_codex":0.0021049199,"about_ca_topic_score_gemma":0.0011181612,"teacher_disagreement_score":0.0072970903,"about_ca_system_score_codex":0.0009977348,"about_ca_system_score_gemma":0.00040022802,"threshold_uncertainty_score":0.024411201},"labels":[],"label_agreement":null},{"id":"W4379653734","doi":"10.1007/s00454-023-00509-w","title":"From the Separable Tammes Problem to Extremal Distributions of Great Circles in the Unit Sphere","year":2023,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Quasicrystal Structures and Properties","field":"Materials Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Unit sphere; Combinatorics; Circle packing; Mathematics; Unit (ring theory); Separable space; Disjoint sets; Spherical trigonometry; Dimension (graph theory); Hypersphere; RADIUS; Sphere packing; Great circle; Unit vector; Packing problems; Euclidean geometry; Convex body; Unit cube; Euclidean space; Geometry; Regular polygon; Mathematical analysis; Computer science; Convex hull","score_opus":0.02616870058225178,"score_gpt":0.27699381424024155,"score_spread":0.25082511365798976,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4379653734","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6722465,0.0016959567,0.24591781,0.005952366,0.00022363188,0.00004523073,0.0004308357,0.00024990016,0.07323772],"genre_scores_gemma":[0.9720775,0.0006431399,0.015129919,0.0002784043,0.00036173017,0.000036886955,0.0002676367,0.00013539684,0.011069333],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995415,0.0002062321,0.000014100679,0.0000780266,0.00009354793,0.00006659689],"domain_scores_gemma":[0.99739885,0.0016947782,0.00025666974,0.00016723495,0.00020650621,0.00027592425],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010351095,0.0005037764,0.0007364503,0.0012806132,0.0010419452,0.0023171194,0.0013873032,0.0014499167,0.0069277124],"category_scores_gemma":[0.006931453,0.0004034039,0.0003587667,0.00078064564,0.003681878,0.003929311,0.0021315971,0.0020580052,0.00042005573],"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.000025815269,0.0000075639364,0.000113493516,0.000025644289,0.0000033466256,0.000027308542,0.000086011605,0.0040776646,0.00015441698,0.9923252,0.0010554101,0.002098126],"study_design_scores_gemma":[0.000008653585,0.000005800015,0.00010980301,0.0000064522806,0.0000012859106,0.000029555897,0.000059222362,0.020864138,0.00010573004,0.9782331,0.0005716134,0.0000047264452],"about_ca_topic_score_codex":0.0012233375,"about_ca_topic_score_gemma":0.0010655853,"teacher_disagreement_score":0.0069277124,"about_ca_system_score_codex":0.0011260567,"about_ca_system_score_gemma":0.0006389554,"threshold_uncertainty_score":0.023175478},"labels":[],"label_agreement":null},{"id":"W4387409735","doi":"10.1007/s00454-023-00597-8","title":"On the Spanning and Routing Ratio of the Directed Theta-Four Graph","year":2023,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Vertex (graph theory); Mathematics; Computer science; Graph; Euclidean distance; Discrete mathematics; Artificial intelligence","score_opus":0.030246869920199745,"score_gpt":0.26529246000904205,"score_spread":0.2350455900888423,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387409735","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82678056,0.0047468613,0.095196754,0.0032169097,0.00021759115,0.00007238343,0.0007544383,0.00038365292,0.06863079],"genre_scores_gemma":[0.9765113,0.0017957406,0.016427357,0.00027223115,0.00022477271,0.000054528482,0.0003703039,0.00018163634,0.0041622417],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989054,0.000514615,0.000032932203,0.00019036108,0.00018117117,0.00017546906],"domain_scores_gemma":[0.98307496,0.013773287,0.0012335902,0.00047122312,0.0006540302,0.0007929461],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022308347,0.00089582003,0.0010601999,0.0031521823,0.0007627738,0.0019521473,0.0020334772,0.0009306614,0.00828416],"category_scores_gemma":[0.01902897,0.00048271695,0.00048610638,0.001981483,0.00181181,0.0034786703,0.0011690552,0.0014837133,0.0008385745],"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.0014186228,0.00024842084,0.0075347237,0.0005516429,0.00015534893,0.0003282578,0.0007122278,0.19306593,0.011414364,0.6843354,0.014048451,0.08618668],"study_design_scores_gemma":[0.000106730535,0.0002751631,0.0052926075,0.0001092472,0.00015430718,0.00075278484,0.00062619726,0.51480716,0.003995458,0.46895027,0.004864847,0.000065194],"about_ca_topic_score_codex":0.0019182768,"about_ca_topic_score_gemma":0.0012277424,"teacher_disagreement_score":0.00828416,"about_ca_system_score_codex":0.0016113926,"about_ca_system_score_gemma":0.00066768436,"threshold_uncertainty_score":0.02771324},"labels":[],"label_agreement":null},{"id":"W4388221631","doi":"10.1007/s00454-023-00579-w","title":"On the Structure of Pointsets with Many Collinear Triples","year":2023,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Hungarian Scientific Research Fund","keywords":"Mathematics; Combinatorics; Conic section; Conjecture; General position; Set (abstract data type); Finite set; Plane (geometry); Point (geometry); Regular polygon; Position (finance); Discrete geometry; Discrete mathematics; Geometry; Mathematical analysis; Computer science","score_opus":0.022270517813925684,"score_gpt":0.28564257373572816,"score_spread":0.26337205592180246,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388221631","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8000202,0.0010788597,0.1049643,0.002768434,0.00026214344,0.00007962401,0.00081152853,0.00037471522,0.08964012],"genre_scores_gemma":[0.97418493,0.0004907203,0.013503841,0.00030604555,0.00019780431,0.00006981619,0.00049356266,0.00013987542,0.010613396],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991748,0.0002104012,0.00004034444,0.00017698492,0.00023548811,0.00016195978],"domain_scores_gemma":[0.9958753,0.0018797219,0.0007388836,0.00043126574,0.0004891127,0.00058567734],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008633902,0.00065016677,0.0012039021,0.0034245064,0.003699772,0.004492313,0.0018360696,0.0019312745,0.009548453],"category_scores_gemma":[0.005177932,0.0007532789,0.00068874424,0.003050196,0.005220732,0.008055146,0.004006031,0.002957398,0.0012905205],"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.00004208894,0.000014554389,0.00028764,0.000021516968,0.0000053159483,0.000107682565,0.00030247823,0.0014824765,0.000367128,0.99427646,0.00084452814,0.0022480453],"study_design_scores_gemma":[0.000008000439,0.0000099759445,0.00012210952,0.00001251734,0.0000037352077,0.00007720816,0.00018398289,0.0030483857,0.0001374814,0.9953999,0.0009887848,0.000007893646],"about_ca_topic_score_codex":0.0012922173,"about_ca_topic_score_gemma":0.0010623732,"teacher_disagreement_score":0.009548453,"about_ca_system_score_codex":0.0011459668,"about_ca_system_score_gemma":0.0006157227,"threshold_uncertainty_score":0.031942785},"labels":[],"label_agreement":null},{"id":"W4388480514","doi":"10.1007/s00454-023-00557-2","title":"Computing Characteristic Polynomials of Hyperplane Arrangements with Symmetries","year":2023,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","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":"Western University","funders":"Max-Planck-Institut für Mathematik in den Naturwissenschaften; Universität Bielefeld; Deutsche Forschungsgemeinschaft","keywords":"Hyperplane; Mathematics; Homogeneous space; Symmetry (geometry); Polynomial; Combinatorics; Discrete mathematics; Algebra over a field; Pure mathematics; Geometry; Mathematical analysis","score_opus":0.03658175084843057,"score_gpt":0.3297291979591482,"score_spread":0.2931474471107176,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388480514","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43124747,0.0001233054,0.5563427,0.00021229955,0.000059716738,0.000071484734,0.000555688,0.0018843537,0.009503003],"genre_scores_gemma":[0.8847005,0.00007763868,0.11125179,0.000034971872,0.000037515198,0.000039656075,0.0006871709,0.00022108303,0.002949582],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992286,0.000096085874,0.000042754302,0.00017749751,0.00024782843,0.0002072318],"domain_scores_gemma":[0.9985207,0.0005754682,0.00020359445,0.00029546808,0.00028949717,0.000115314906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003792788,0.00040080244,0.0005482811,0.0012149544,0.00060528977,0.0019992504,0.0009010062,0.00053784536,0.0066168564],"category_scores_gemma":[0.0034118562,0.0003105513,0.00053015316,0.0013502699,0.0011651897,0.0034571884,0.0014548379,0.00087540934,0.0010696831],"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.0007324443,0.00018986395,0.014917143,0.00031182586,0.00005337808,0.0005357374,0.0007818087,0.0797516,0.05956028,0.5675061,0.008197134,0.26746276],"study_design_scores_gemma":[0.00008488399,0.00024137793,0.0037125181,0.000040024992,0.000028326105,0.00059250527,0.00063903513,0.34922346,0.06810902,0.5631284,0.014111514,0.000088946465],"about_ca_topic_score_codex":0.0017448191,"about_ca_topic_score_gemma":0.0020154966,"teacher_disagreement_score":0.0066168564,"about_ca_system_score_codex":0.0007936558,"about_ca_system_score_gemma":0.0006965619,"threshold_uncertainty_score":0.022135615},"labels":[],"label_agreement":null},{"id":"W4389504647","doi":"10.1007/s00454-023-00615-9","title":"Improved Estimates on the Number of Unit Perimeter Triangles","year":2023,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Digital Image Processing Techniques","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":"Perimeter; Mathematics; Combinatorics; Plane (geometry); Integer (computer science); Unit (ring theory); Point (geometry); Section (typography); Grid; Upper and lower bounds; Set (abstract data type); Geometry; Computer science; Mathematical analysis","score_opus":0.03385344117330329,"score_gpt":0.3233221951589076,"score_spread":0.2894687539856043,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389504647","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028537301,0.0039642695,0.9088353,0.0015324276,0.0011842784,0.00011281753,0.0010254276,0.0008599895,0.05394813],"genre_scores_gemma":[0.27089217,0.005429667,0.6684111,0.0007873076,0.002240633,0.0005387649,0.0022848886,0.0017432285,0.047672186],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971738,0.00067589193,0.00016329154,0.00055257307,0.001170689,0.00026369217],"domain_scores_gemma":[0.9821323,0.011086913,0.00068165717,0.0025361206,0.0027739743,0.0007890656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029663118,0.002468448,0.0018735745,0.006386233,0.00091898703,0.002925107,0.0047101337,0.0019534754,0.022839738],"category_scores_gemma":[0.025065515,0.0010408325,0.0016546975,0.0029544523,0.0025045625,0.008512401,0.0050908816,0.0062211715,0.005791473],"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.00078079005,0.00024291205,0.004409462,0.0011403706,0.00014126468,0.00045715988,0.0005168775,0.08241931,0.020832932,0.6615705,0.028674426,0.19881396],"study_design_scores_gemma":[0.00006700671,0.00016396627,0.003991172,0.00026257968,0.00010844238,0.00059579755,0.00020805604,0.53936696,0.009716732,0.4121875,0.0332202,0.000111602945],"about_ca_topic_score_codex":0.0017703789,"about_ca_topic_score_gemma":0.0029296307,"teacher_disagreement_score":0.022839738,"about_ca_system_score_codex":0.0016937347,"about_ca_system_score_gemma":0.00071781216,"threshold_uncertainty_score":0.07640648},"labels":[],"label_agreement":null},{"id":"W4396646704","doi":"10.1007/s00454-024-00647-9","title":"Convex Bodies of Constant Width with Exponential Illumination Number","year":2024,"lang":"en","type":"article","venue":"Discrete & 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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada; Norges Forskningsråd","keywords":"Constant (computer programming); Regular polygon; Exponential function; Mathematics; Mathematical analysis; Geometry; Computer science","score_opus":0.009586110527460747,"score_gpt":0.25663253319542656,"score_spread":0.2470464226679658,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396646704","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014428216,0.00007943613,0.98039675,0.00014790098,0.000029366407,0.000031530984,0.00009290302,0.00022852061,0.0045653703],"genre_scores_gemma":[0.40986034,0.00045391737,0.5683302,0.00021511165,0.00009134579,0.00024825215,0.00055216963,0.0008397825,0.01940875],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99890053,0.00024954023,0.00004281827,0.00020454376,0.00047648506,0.00012612],"domain_scores_gemma":[0.9967714,0.0018468121,0.00024089163,0.00057421497,0.00040554607,0.00016119436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008476825,0.00093914004,0.0010985039,0.000798701,0.00045114654,0.0016216155,0.0016755029,0.0019628839,0.0053738425],"category_scores_gemma":[0.007616307,0.0015126725,0.00091941445,0.00096053956,0.001318791,0.002347478,0.0031533227,0.0024013275,0.0017866071],"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.0004752313,0.00012822701,0.0014292859,0.00029433586,0.00007846138,0.00039511733,0.0003500113,0.72676986,0.04192785,0.10253165,0.0064755003,0.11914449],"study_design_scores_gemma":[0.000019936582,0.000030450261,0.00032669323,0.000015925812,0.0000070042274,0.00011037544,0.000040069805,0.9709735,0.0055423854,0.021333497,0.0015839265,0.000016227086],"about_ca_topic_score_codex":0.0015356789,"about_ca_topic_score_gemma":0.0014074068,"teacher_disagreement_score":0.0053738425,"about_ca_system_score_codex":0.00096400274,"about_ca_system_score_gemma":0.00048578446,"threshold_uncertainty_score":0.017977297},"labels":[],"label_agreement":null},{"id":"W4396659401","doi":"10.1007/s00454-024-00650-0","title":"On the Maximal Distance Between the Centers of Mass of a Planar Convex Body and Its Boundary","year":2024,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Point processes and geometric inequalities","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; United States - Israel Binational Science Foundation; National Science Foundation","keywords":"Planar; Convex body; Boundary (topology); Regular polygon; Mathematics; Geometry; Combinatorics; Physics; Mathematical analysis; Convex hull; Computer science","score_opus":0.03436421736350743,"score_gpt":0.3032321590154891,"score_spread":0.2688679416519817,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396659401","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.60733175,0.0040132394,0.31908643,0.004278707,0.00047939603,0.00010749632,0.0010699624,0.00022510707,0.06340787],"genre_scores_gemma":[0.96071666,0.001244323,0.030550243,0.00023430068,0.00036571204,0.00010608697,0.0005751949,0.00011536175,0.0060921987],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987381,0.00052458217,0.000064449305,0.00030809946,0.00022997505,0.00013483508],"domain_scores_gemma":[0.97419894,0.0202098,0.0020661654,0.00050133996,0.0013921914,0.0016315483],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027868978,0.0013899661,0.001536035,0.0024032167,0.0011718626,0.0024044837,0.0037909679,0.0017471637,0.0060192524],"category_scores_gemma":[0.025135603,0.0006053953,0.0006458225,0.0010608633,0.0049532945,0.0049074544,0.0038958387,0.0028870872,0.0006572085],"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.00155028,0.0001630759,0.0057676244,0.00073899614,0.00015213195,0.0004772453,0.00085883477,0.08688043,0.009443142,0.8616131,0.0045043216,0.027850837],"study_design_scores_gemma":[0.00009520031,0.0005012663,0.008212155,0.00027428594,0.00010631965,0.00050329464,0.0007667882,0.3910757,0.0052289865,0.5880451,0.0050582034,0.0001326429],"about_ca_topic_score_codex":0.001343321,"about_ca_topic_score_gemma":0.00092524866,"teacher_disagreement_score":0.0060192524,"about_ca_system_score_codex":0.0014078625,"about_ca_system_score_gemma":0.0006226618,"threshold_uncertainty_score":0.020136416},"labels":[],"label_agreement":null},{"id":"W4399528893","doi":"10.1007/s00454-024-00661-x","title":"A Sylvester–Gallai-Type Theorem for Complex-Representable Matroids","year":2024,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Matroid; Type (biology); Mathematics; Combinatorics; Pure mathematics; Discrete mathematics","score_opus":0.030090876649505556,"score_gpt":0.3282654088476513,"score_spread":0.29817453219814577,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399528893","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11407965,0.0013981311,0.65913147,0.006009151,0.0010708093,0.000116660405,0.0008459343,0.0005510366,0.21679717],"genre_scores_gemma":[0.8088031,0.002268436,0.103223495,0.0024005244,0.0020603803,0.00026923587,0.0009903882,0.000469454,0.07951494],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995291,0.00008642244,0.000023329487,0.00013223698,0.00016225486,0.000066548375],"domain_scores_gemma":[0.9984932,0.0006784872,0.00017364524,0.00019814349,0.0002746376,0.0001819573],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009259789,0.0009516974,0.00083596323,0.0017375991,0.0013571215,0.003130199,0.0013277144,0.0015391792,0.012107603],"category_scores_gemma":[0.0030834677,0.0005152929,0.0013170512,0.0014944181,0.0028012772,0.00467073,0.0024443085,0.00459721,0.0019927714],"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.000013481906,0.000011877605,0.000071944894,0.000022120077,0.000006948625,0.000029546321,0.00007332624,0.00085373956,0.0006516207,0.99108106,0.0027418789,0.0044425447],"study_design_scores_gemma":[0.00000876066,0.00001153682,0.00009296421,0.000006733046,0.000004816822,0.00006301765,0.000017686596,0.005587415,0.0003737579,0.9898747,0.003950783,0.0000077154355],"about_ca_topic_score_codex":0.00073708117,"about_ca_topic_score_gemma":0.0007197106,"teacher_disagreement_score":0.012107603,"about_ca_system_score_codex":0.0012776557,"about_ca_system_score_gemma":0.0005050628,"threshold_uncertainty_score":0.04050398},"labels":[],"label_agreement":null},{"id":"W4403426488","doi":"10.1007/s00454-024-00698-y","title":"Realizations of Multiassociahedra via Rigidity","year":2024,"lang":"lv","type":"article","venue":"Discrete & Computational Geometry","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"Agencia Estatal de Investigación; Universidad de Cantabria; Banco Santander","keywords":"Rigidity (electromagnetism); Materials science; Composite material","score_opus":0.015113686902145887,"score_gpt":0.287054341023027,"score_spread":0.27194065412088114,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403426488","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45909205,0.00092320365,0.16818629,0.0014047176,0.0007257831,0.00007507035,0.0005307768,0.0017458367,0.36731628],"genre_scores_gemma":[0.93042713,0.00020450633,0.023979396,0.00019034365,0.00010563368,0.000058162917,0.0002843576,0.0002712676,0.0444793],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990484,0.00018722868,0.000056633056,0.00020081342,0.0002620385,0.00024487526],"domain_scores_gemma":[0.99946445,0.0001108692,0.00005354371,0.00013795817,0.000086002074,0.0001471765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049308065,0.0005045975,0.0004940263,0.0011689644,0.002179934,0.0034971517,0.0008243399,0.00083049835,0.018597152],"category_scores_gemma":[0.0008904273,0.0005013057,0.0009115639,0.00055279076,0.0022584435,0.0025678251,0.0039884215,0.0015469622,0.0037881683],"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.000023016235,0.000012950472,0.00009732382,0.000016345237,0.0000053917324,0.00008213899,0.00014490576,0.0014176456,0.0008502926,0.99236286,0.0008657737,0.004121434],"study_design_scores_gemma":[0.000020681922,0.000025011526,0.00033537814,0.000033400247,0.000011894129,0.00017126542,0.0003024371,0.011352808,0.0021265862,0.9654256,0.020160306,0.000034744808],"about_ca_topic_score_codex":0.0010012615,"about_ca_topic_score_gemma":0.0013651834,"teacher_disagreement_score":0.018597152,"about_ca_system_score_codex":0.0013418543,"about_ca_system_score_gemma":0.00048268127,"threshold_uncertainty_score":0.06221366},"labels":[],"label_agreement":null},{"id":"W4414051275","doi":"10.1007/s00454-025-00768-9","title":"The Geodesic Edge Center of a Simple Polygon","year":2025,"lang":"en","type":"article","venue":"Discrete & 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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Rheinische Friedrich-Wilhelms-Universität Bonn","keywords":"Geodesic; Voronoi diagram; Simple polygon; Polygon (computer graphics); Weighted Voronoi diagram; Geodesic map; Bowyer–Watson algorithm; Power diagram","score_opus":0.008284805618460409,"score_gpt":0.26834868803193457,"score_spread":0.26006388241347417,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414051275","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.123261414,0.00067545683,0.8321684,0.0005386989,0.0002626821,0.0004232415,0.0012859266,0.0029349297,0.038449213],"genre_scores_gemma":[0.5400229,0.00044962027,0.4436092,0.0001102645,0.00009768278,0.00020674033,0.0022082438,0.0007345083,0.012560821],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992861,0.0000751099,0.00003895469,0.00016389685,0.00035647955,0.000079399986],"domain_scores_gemma":[0.9988973,0.00026289385,0.00016995524,0.00018465187,0.0003532715,0.00013188938],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003218008,0.00083590864,0.0009770651,0.0019951113,0.0010499075,0.0015844406,0.0011703371,0.00087811437,0.009220502],"category_scores_gemma":[0.003729684,0.0005982652,0.0008220757,0.0014058602,0.0013564825,0.0017040338,0.0023203613,0.0009301862,0.0030508356],"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.0014007281,0.00019564787,0.0066025713,0.0009515929,0.00012094375,0.0019204009,0.0008027726,0.17241095,0.052027594,0.27847397,0.037430022,0.44766274],"study_design_scores_gemma":[0.00018180917,0.00044736464,0.0018896736,0.0001532766,0.00006908698,0.0014374768,0.00044007998,0.64970154,0.03773361,0.24774204,0.06008865,0.000115397095],"about_ca_topic_score_codex":0.0017614043,"about_ca_topic_score_gemma":0.0012102368,"teacher_disagreement_score":0.009220502,"about_ca_system_score_codex":0.0006246846,"about_ca_system_score_gemma":0.00083720003,"threshold_uncertainty_score":0.030845702},"labels":[],"label_agreement":null},{"id":"W4414542636","doi":"10.1007/s00454-025-00771-0","title":"A Stability Theorem for Bigraded Persistence Barcodes","year":2025,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada; National Research Foundation of Korea; Serbian Academy of Sciences and Arts; Simons Foundation","keywords":"Homology (biology); Persistent homology; Filtration (mathematics); Stability (learning theory); Persistence (discontinuity)","score_opus":0.03165396604230301,"score_gpt":0.28327984864798067,"score_spread":0.25162588260567764,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414542636","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2716049,0.0006289753,0.6814564,0.0014915464,0.00044628105,0.00009452848,0.00043406535,0.00084595673,0.04299744],"genre_scores_gemma":[0.9551004,0.0003307956,0.020651331,0.00047884896,0.00025973684,0.00013348994,0.0002679217,0.00025568684,0.022521807],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994574,0.000050390245,0.000024209943,0.00014929338,0.0002083596,0.000110290515],"domain_scores_gemma":[0.99711573,0.0011611542,0.00033352542,0.00033077656,0.00071886316,0.00033995137],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054029294,0.00062906183,0.0007368308,0.0016803992,0.0016780946,0.001961695,0.001141464,0.0013844321,0.006994361],"category_scores_gemma":[0.005193981,0.00039618544,0.00063599297,0.0006116739,0.002690694,0.0032933345,0.0038354776,0.0022173233,0.0013171855],"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.00006216885,0.000021798838,0.0003831287,0.000055908742,0.0000137769675,0.00009912779,0.00019255442,0.010228976,0.0054054954,0.96985114,0.0018894312,0.011796429],"study_design_scores_gemma":[0.000021588492,0.0000905429,0.0003031652,0.000023682749,0.00001105513,0.00016437676,0.00008475458,0.10541864,0.004794209,0.884449,0.0045929807,0.000045995577],"about_ca_topic_score_codex":0.0010828752,"about_ca_topic_score_gemma":0.00050046656,"teacher_disagreement_score":0.006994361,"about_ca_system_score_codex":0.00068055437,"about_ca_system_score_gemma":0.0005796661,"threshold_uncertainty_score":0.023398459},"labels":[],"label_agreement":null},{"id":"W4414596675","doi":"10.1007/s00454-025-00770-1","title":"Combinatorics of Generalized Parking-Function Polytopes","year":2025,"lang":"lv","type":"article","venue":"Discrete & 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 Calgary","funders":"University of Wyoming; Harvey Mudd College; National Science Foundation","keywords":"Polytope; Convex hull; Sequence (biology); Regular polygon; Convex polytope; Chain (unit)","score_opus":0.01800016506785492,"score_gpt":0.3081994212894893,"score_spread":0.2901992562216344,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414596675","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50241476,0.0012233875,0.13696556,0.0021081318,0.00051516725,0.00012495797,0.001386129,0.0008098071,0.35445213],"genre_scores_gemma":[0.92987305,0.00055670657,0.01357759,0.00027225335,0.00016851733,0.00010409176,0.0009754929,0.00017406823,0.054298226],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99945396,0.000106898595,0.000030538587,0.00011558142,0.00014117103,0.00015188358],"domain_scores_gemma":[0.99950945,0.00017544895,0.000059699076,0.00006473497,0.00007703482,0.00011355114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038768377,0.0006440946,0.00086839334,0.0016195308,0.0014999835,0.0034029423,0.000988126,0.0006204442,0.027657824],"category_scores_gemma":[0.0009694406,0.0004557347,0.0011790516,0.0016187207,0.002032684,0.002422348,0.0018516779,0.0013497864,0.0031161932],"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.000028982635,0.000020211251,0.00015264585,0.00006505651,0.000013757728,0.00014795197,0.000082276005,0.0028225,0.0003398556,0.9873782,0.0032803097,0.005668267],"study_design_scores_gemma":[0.00003768559,0.000021400232,0.00033135957,0.000025175941,0.000015474956,0.00023589979,0.0001585842,0.00932095,0.0005029139,0.97580975,0.013520372,0.000020436024],"about_ca_topic_score_codex":0.0018420515,"about_ca_topic_score_gemma":0.0022155484,"teacher_disagreement_score":0.027657824,"about_ca_system_score_codex":0.0015793901,"about_ca_system_score_gemma":0.00059557025,"threshold_uncertainty_score":0.09252471},"labels":[],"label_agreement":null},{"id":"W4415768889","doi":"10.1007/s00454-025-00758-x","title":"Stability of Simplex Slicing","year":2025,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Point processes and geometric inequalities","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of the Fraser Valley","funders":"Hausdorff Research Institute for Mathematics; Natural Sciences and Engineering Research Council of Canada; Carnegie Mellon University; National Science Foundation","keywords":"Simplex; Slicing; Stability (learning theory); Regular polygon; Simplex algorithm","score_opus":0.052869622388125925,"score_gpt":0.3597585024049285,"score_spread":0.3068888800168026,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415768889","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55095077,0.0010698935,0.38815153,0.00084243575,0.00016586922,0.0001001407,0.00046730114,0.00047958264,0.05777253],"genre_scores_gemma":[0.9818377,0.00021999111,0.01287087,0.00010717677,0.000038324913,0.00003329167,0.00017442326,0.000102918646,0.004615403],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992987,0.00011604995,0.000028546734,0.00015929715,0.0002606852,0.00013666713],"domain_scores_gemma":[0.9970812,0.0009494002,0.00040288002,0.0004980358,0.0006240202,0.00044446974],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010678362,0.00042488257,0.0007254245,0.0012971788,0.0009140309,0.0020348916,0.0007397365,0.0006809611,0.0055876994],"category_scores_gemma":[0.0073120724,0.00035667027,0.0006730933,0.00043977497,0.0027430386,0.0021407532,0.0026842707,0.0017384588,0.00050656614],"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.00019090607,0.000023712208,0.0032249647,0.00007066597,0.000053796768,0.00022986703,0.0003293899,0.06956341,0.013740415,0.8930446,0.0025119763,0.017016264],"study_design_scores_gemma":[0.00002446419,0.0000621882,0.0024136933,0.00003649512,0.000017907365,0.00023550498,0.0001451711,0.35821617,0.008055875,0.62696284,0.0037887865,0.00004089205],"about_ca_topic_score_codex":0.0029485042,"about_ca_topic_score_gemma":0.0012591076,"teacher_disagreement_score":0.0055876994,"about_ca_system_score_codex":0.0014561719,"about_ca_system_score_gemma":0.000571739,"threshold_uncertainty_score":0.018692732},"labels":[],"label_agreement":null},{"id":"W4415816767","doi":"10.1007/s00454-025-00762-1","title":"External Columns and Chambers of Vector Partition Functions","year":2025,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Mathematical functions and polynomials","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":"Simon Fraser University","funders":"Universidad de Sevilla","keywords":"Partition (number theory); Enumeration; Partition function (quantum field theory); Binomial coefficient; Piecewise; Function (biology); Generating function; Vector field","score_opus":0.022425376759831833,"score_gpt":0.31526309868138086,"score_spread":0.292837721921549,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415816767","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8329916,0.00028035563,0.13508397,0.00026735768,0.000053385622,0.00003434884,0.00028146623,0.00025852968,0.030748935],"genre_scores_gemma":[0.9835473,0.00010221382,0.009203662,0.000045277324,0.000038069564,0.000027421103,0.00019137695,0.00008533812,0.006759182],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994654,0.00010947559,0.000022798282,0.00009163975,0.00015286545,0.00015788859],"domain_scores_gemma":[0.99881494,0.00045128586,0.00018019174,0.0001293798,0.00021084498,0.00021340686],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047107646,0.00031686318,0.00035718695,0.00094537495,0.00077065,0.0020290513,0.00046767297,0.00031862137,0.0067984397],"category_scores_gemma":[0.0019502243,0.0002997069,0.00032851505,0.0007931836,0.0015404886,0.0019310473,0.0013234869,0.0006916344,0.0005239489],"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.000076304015,0.00002761156,0.0018181067,0.000039845905,0.0000060544926,0.00010592551,0.00018444743,0.003937204,0.0066288332,0.97856975,0.0006878701,0.0079179965],"study_design_scores_gemma":[0.000046110086,0.00012965706,0.0048397607,0.00006997476,0.000028565442,0.0005291923,0.00046537173,0.10403665,0.02931249,0.844329,0.016153462,0.000059721897],"about_ca_topic_score_codex":0.00086246396,"about_ca_topic_score_gemma":0.0010155477,"teacher_disagreement_score":0.0067984397,"about_ca_system_score_codex":0.0007594534,"about_ca_system_score_gemma":0.00033433022,"threshold_uncertainty_score":0.022743046},"labels":[],"label_agreement":null},{"id":"W4416055631","doi":"10.1007/s00454-025-00751-4","title":"Rolling Spheres and the Willmore Energy","year":2025,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Geometric Analysis and Curvature Flows","field":"Mathematics","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":"Crosslight Software (Canada)","funders":"National Science Foundation Graduate Research Fellowship Program; Einstein Stiftung Berlin; Deutsche Forschungsgemeinschaft","keywords":"Willmore energy; Invariant (physics); Curvature; Conformal map; SPHERES; Connection (principal bundle); Computation; Discretization","score_opus":0.010091848614762327,"score_gpt":0.2783084667362323,"score_spread":0.26821661812146996,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416055631","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26290727,0.009467382,0.23006175,0.016818995,0.0017250874,0.000081509046,0.00047617903,0.0006026337,0.47785914],"genre_scores_gemma":[0.84943414,0.001949094,0.016968707,0.0017550539,0.0013321514,0.00006236987,0.00027181444,0.00039893787,0.12782769],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99962115,0.00010610884,0.000015208733,0.0000771162,0.000107364016,0.000072918774],"domain_scores_gemma":[0.999491,0.00014442137,0.00007112043,0.00009213485,0.00007493139,0.00012638846],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007455801,0.00064198824,0.00082029664,0.0017426022,0.0018036385,0.0020769443,0.00076944724,0.0014524928,0.013478911],"category_scores_gemma":[0.00237578,0.0003595076,0.0007208123,0.0007622383,0.0024076975,0.0033615541,0.0023281767,0.001788587,0.0013092085],"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.000009930552,0.000004429087,0.00003873723,0.000007550516,0.0000031966842,0.000009812472,0.000037013026,0.000903997,0.00016650837,0.99504673,0.0010637708,0.002708361],"study_design_scores_gemma":[0.000004619884,0.000007667875,0.00017778708,0.000005453769,0.000002399154,0.00002662213,0.000024007504,0.0059633222,0.00012028299,0.98930407,0.0043577384,0.000006060342],"about_ca_topic_score_codex":0.0031619065,"about_ca_topic_score_gemma":0.002365765,"teacher_disagreement_score":0.013478911,"about_ca_system_score_codex":0.0015691462,"about_ca_system_score_gemma":0.0006174769,"threshold_uncertainty_score":0.04509145},"labels":[],"label_agreement":null},{"id":"W761232304","doi":"10.1007/s00454-016-9795-1","title":"Star Unfolding from a Geodesic Curve","year":2016,"lang":"en","type":"article","venue":"Discrete & 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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Geodesic; Polyhedron; Vertex (graph theory); Star (game theory); Mathematics; Geodesic map; Combinatorics; Regular polygon; Conjecture; Surface (topology); Path (computing); Geometry; Mathematical analysis; Computer science","score_opus":0.015167514554242366,"score_gpt":0.24942401827510005,"score_spread":0.23425650372085768,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W761232304","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14734365,0.00016955829,0.81930673,0.0006080753,0.00031696682,0.00014127001,0.0004552013,0.0013974946,0.03026103],"genre_scores_gemma":[0.66949594,0.00037365558,0.29273036,0.00017931081,0.000119068354,0.000067565976,0.0009505645,0.0016363589,0.034447208],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99970007,0.00003809295,0.000012597182,0.00008466253,0.00012209288,0.000042506534],"domain_scores_gemma":[0.9994917,0.00009377255,0.000039971135,0.00014235855,0.0001454343,0.00008670426],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041754398,0.0005298781,0.00072102185,0.0013007747,0.0008213092,0.0011843973,0.0005819738,0.0011102352,0.011120319],"category_scores_gemma":[0.0016507714,0.00037263255,0.0006951758,0.0007557783,0.0010830171,0.0015434199,0.002160953,0.0015749084,0.002630952],"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.0003162302,0.00012575038,0.00146226,0.00021424609,0.000048658076,0.0007599277,0.0008795036,0.07360343,0.040949166,0.71245956,0.010306045,0.1588752],"study_design_scores_gemma":[0.000033916247,0.00026533773,0.0008534862,0.000050882616,0.000022967513,0.00052790734,0.00041226385,0.37105775,0.017161014,0.5655208,0.04405606,0.000037478007],"about_ca_topic_score_codex":0.0009885201,"about_ca_topic_score_gemma":0.00101809,"teacher_disagreement_score":0.011120319,"about_ca_system_score_codex":0.000651692,"about_ca_system_score_gemma":0.00053330715,"threshold_uncertainty_score":0.037201166},"labels":[],"label_agreement":null}]}